{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T11:22:07Z","timestamp":1742988127294,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030374280"},{"type":"electronic","value":"9783030374297"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-37429-7_37","type":"book-chapter","created":{"date-parts":[[2020,1,20]],"date-time":"2020-01-20T06:02:48Z","timestamp":1579500168000},"page":"371-382","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Network Optimization Under Traffic Uncertainties Based on SDN"],"prefix":"10.1007","author":[{"given":"Junjie","family":"Teng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuxue","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mo","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,12,12]]},"reference":[{"issue":"6","key":"37_CR1","first-page":"239","volume":"121","author":"H Netze","year":"2002","unstructured":"Netze, H.: Overview and principles of internet traffic engineering. RFC 121(6), 239\u2013242 (2002)","journal-title":"RFC"},{"issue":"3","key":"37_CR2","doi-asserted-by":"publisher","first-page":"1617","DOI":"10.1109\/SURV.2014.012214.00180","volume":"16","author":"BAA Nunes","year":"2014","unstructured":"Nunes, B.A.A., Mendonca, M., Nguyen, X.N., et al.: A survey of software-defined networking: past, present, and future of programmable networks. IEEE Commun. Surv. Tutor. 16(3), 1617\u20131634 (2014)","journal-title":"IEEE Commun. Surv. Tutor."},{"issue":"2","key":"37_CR3","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1145\/1355734.1355746","volume":"38","author":"N Mckeown","year":"2008","unstructured":"Mckeown, N., Anderson, T., Balakrishnan, H., et al.: OpenFlow: enabling innovation in campus networks. ACM SIGCOMM Comput. Commun. Rev. 38(2), 69\u201374 (2008)","journal-title":"ACM SIGCOMM Comput. Commun. Rev."},{"issue":"6","key":"37_CR4","doi-asserted-by":"publisher","first-page":"1597","DOI":"10.1109\/TMM.2014.2325791","volume":"16","author":"HE Egilmez","year":"2014","unstructured":"Egilmez, H.E., Tekalp, A.M.: Distributed QoS architectures for multimedia streaming over software defined networks. IEEE Trans. Multimed. 16(6), 1597\u20131609 (2014)","journal-title":"IEEE Trans. Multimed."},{"issue":"5","key":"37_CR5","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1109\/CC.2015.7112035","volume":"12","author":"J Yan","year":"2015","unstructured":"Yan, J., Zhang, H., Shuai, Q., et al.: HiQoS: an SDN-based multipath QoS solution. China Commun. 12(5), 123\u2013133 (2015)","journal-title":"China Commun."},{"key":"37_CR6","unstructured":"&Lt C E H, Edu&Gt C.: Analysis of an Equal-Cost Multipath Algorithm. RFC Editor (2000)"},{"key":"37_CR7","doi-asserted-by":"crossref","unstructured":"Zhou, J., Tewari, M., Zhu, M., et al.: WCMP: weighted cost multi-pathing for improved fairness in data centers. In: European Conference on Computer Systems. ACM (2014)","DOI":"10.1145\/2592798.2592803"},{"issue":"4","key":"37_CR8","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1145\/2740070.2626316","volume":"44","author":"M Alizadeh","year":"2015","unstructured":"Alizadeh, M., Edsall, T., Dharmapurikar, S., et al.: CONGA: distributed congestion-aware load balancing for datacenters. ACM SIGCOMM Comput. Commun. Rev. 44(4), 503\u2013514 (2015)","journal-title":"ACM SIGCOMM Comput. Commun. Rev."},{"key":"37_CR9","unstructured":"Al-Fares, M., Radhakrishnan, S., Raghavan, B., et al.: Hedera: dynamic flow scheduling for data center networks. In: Proceedings of the 7th USENIX Symposium on Networked Systems Design and Implementation, NSDI 2010, San Jose, CA, USA, 28\u201330 April. DBLP (2010)"},{"key":"37_CR10","unstructured":"Handigol, N., Flajslik, M., Seetharaman, S., et al.: Aster* x: load-balancing as a network primitive. In: Proceedings of the 9th GENI Engineering Conference (Plenary), pp. 1\u20132 (2013)"},{"key":"37_CR11","doi-asserted-by":"crossref","unstructured":"Agarwal, S., Kodialam, M., Lakshman, T.V.: Traffic engineering in software defined networks. In: 2013 Proceedings of the IEEE INFOCOM (2013)","DOI":"10.1109\/INFCOM.2013.6567024"},{"issue":"4","key":"37_CR12","doi-asserted-by":"publisher","first-page":"1954","DOI":"10.1109\/TNET.2017.2669216","volume":"25","author":"W Bai","year":"2017","unstructured":"Bai, W., Chen, L., Chen, K., et al.: PIAS: practical information-agnostic flow scheduling for commodity data centers. IEEE\/ACM Trans. Netw. 25(4), 1954\u20131967 (2017)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"37_CR13","doi-asserted-by":"crossref","unstructured":"Awduche, D., Berger, L., Gan, D., et al.: RSVP-TE: Extensions to RSVP for LSP Tunnels. Ietf RFC (2001)","DOI":"10.17487\/rfc3209"},{"issue":"3","key":"37_CR14","doi-asserted-by":"publisher","first-page":"1292","DOI":"10.1109\/TNET.2018.2832020","volume":"26","author":"M Chiesa","year":"2018","unstructured":"Chiesa, M., R\u00e9tv\u00e1ri, G., Schapira, M.: Oblivious routing in IP networks. IEEE\/ACM Trans. Netw. 26(3), 1292\u20131305 (2018)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"2","key":"37_CR15","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1002\/net.21461","volume":"60","author":"A Altin","year":"2012","unstructured":"Altin, A., Fortz, B., \u00dcmit, H.: Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty. Networks 60(2), 132\u2013139 (2012)","journal-title":"Networks"},{"key":"37_CR16","doi-asserted-by":"crossref","unstructured":"Vissicchio, S., Vanbever, L., Rexford, J.: Sweet little lies: fake topologies for flexible routing. In: ACM Workshop on Hot Topics in Networks (2014)","DOI":"10.1145\/2670518.2673868"}],"container-title":["Lecture Notes in Computer Science","Human Centered Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-37429-7_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T14:58:27Z","timestamp":1710255507000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-37429-7_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030374280","9783030374297"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-37429-7_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"12 December 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"HCC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Human Centered Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"\u010ca\u010dak","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Serbia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icpca2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/hcc.scholat.com\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}