{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T23:20:12Z","timestamp":1649114412925},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2010,5,5]],"date-time":"2010-05-05T00:00:00Z","timestamp":1273017600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Telecommun Syst"],"published-print":{"date-parts":[[2011,6]]},"DOI":"10.1007\/s11235-010-9298-y","type":"journal-article","created":{"date-parts":[[2010,5,4]],"date-time":"2010-05-04T18:22:25Z","timestamp":1272997345000},"page":"3-17","source":"Crossref","is-referenced-by-count":4,"title":["GATEway: symbiotic inter-domain traffic engineering"],"prefix":"10.1007","volume":"47","author":[{"given":"Matthew","family":"Roughan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yin","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,5,5]]},"reference":[{"key":"9298_CR1","volume-title":"Network flows: theory, algorithms, and applications","author":"R. K. Ahuja","year":"1993","unstructured":"Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1993). Network flows: theory, algorithms, and applications. Upper Saddle River: Prentice Hall."},{"key":"9298_CR2","doi-asserted-by":"crossref","first-page":"569","DOI":"10.3934\/nhm.2006.1.569","volume":"1","author":"D. Alderson","year":"2006","unstructured":"Alderson,\u00a0D., Chang,\u00a0H., Roughan,\u00a0M., Uhlig,\u00a0S., & Willinger,\u00a0W. (2006). The many facets of Internet topology and traffic. Networks and Heterogeneous Media, 1, 569\u2013600.","journal-title":"Networks and Heterogeneous Media"},{"key":"9298_CR3","doi-asserted-by":"crossref","unstructured":"Awduche,\u00a0D., Malcolm,\u00a0J., Agogbua,\u00a0J., O\u2019Dell,\u00a0M., & McManus,\u00a0J. (1999). Requirements for traffic engineering over MPLS. In IETF RFC 2702. September 1999.","DOI":"10.17487\/rfc2702"},{"key":"9298_CR4","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1038\/430741a","volume":"430","author":"A. Baker","year":"2004","unstructured":"Baker,\u00a0A. (2004). Corals adaptive response to climate change shifting to new algal symbionts may safeguard devastated reefs from extinction. Nature, 430, 741.","journal-title":"Nature"},{"key":"9298_CR5","doi-asserted-by":"crossref","unstructured":"Brickell,\u00a0J., & Shmatikov,\u00a0V. (2005). Privacy-preserving graph algorithms in the semi-honest model. In LNCS. ASIACRYPT (pp. 236\u2013252).","DOI":"10.1007\/11593447_13"},{"key":"9298_CR6","unstructured":"Buriol, L. S., Resende, M. G. C., Ribeiro, C. C., & Thorup,\u00a0M. (2002). A memetic algorithm for OSPF routing. In Proc. 6th INFORMS Telecom (pp. 187\u2013188)."},{"key":"9298_CR7","unstructured":"Buriol, L. S., Resende, M. G. C., Ribeiro,\u00a0C., & Thorup,\u00a0M. (2003). A hybrid genetic algorithm for the weight setting problem in OSPF\/IS-IS routing. Optimization Online."},{"issue":"3","key":"9298_CR8","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1023\/A:1014852026591","volume":"6","author":"M. Ericsson","year":"2002","unstructured":"Ericsson,\u00a0M., Resende,\u00a0M., & Pardalos,\u00a0P. (2002). A genetic algorithm for the weight setting problem in OSPF routing. Journal of Combinatorial Optimization, 6(3), 299\u2013333.","journal-title":"Journal of Combinatorial Optimization"},{"key":"9298_CR9","doi-asserted-by":"crossref","unstructured":"Feamster,\u00a0N., Borkenhagen,\u00a0J., & Rexford,\u00a0J. (2003). Guidelines for interdomain traffic engineering. ACM SIGCOMM Computer Communications Review.","DOI":"10.1145\/963985.963988"},{"key":"9298_CR10","doi-asserted-by":"crossref","unstructured":"Fortz,\u00a0B., & Thorup,\u00a0M. (2000). Internet traffic engineering by optimizing OSPF weights. In Proc. 19th IEEE conf. on computer communications (INFOCOM) (pp. 519\u2013528).","DOI":"10.1109\/INFCOM.2000.832225"},{"issue":"4","key":"9298_CR11","doi-asserted-by":"crossref","first-page":"756","DOI":"10.1109\/JSAC.2002.1003042","volume":"20","author":"B. Fortz","year":"2002","unstructured":"Fortz,\u00a0B., & Thorup,\u00a0M. (2002). Optimizing OSPF\/IS-IS weights in a changing world. IEEE Journal on Selected Areas in Communications, 20(4), 756\u2013767.","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"9298_CR12","unstructured":"Fortz,\u00a0B., & Thorup,\u00a0M. (2003). Robust optimization of OSPF\/IS-IS weights. In W. Ben-Ameur & A. Petrowski (Eds.), Proc. INOC 2003 (pp. 225\u2013230). October 2003."},{"issue":"10","key":"9298_CR13","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1109\/MCOM.2002.1039866","volume":"40","author":"B. Fortz","year":"2002","unstructured":"Fortz,\u00a0B., Rexford,\u00a0J., & Thorup,\u00a0M. (2002). Traffic engineering with traditional IP routing protocols. IEEE Communications Magazine, 40(10), 118\u2013124.","journal-title":"IEEE Communications Magazine"},{"key":"9298_CR14","volume-title":"Adaptation in natural and artificial systems","author":"J. H. Holland","year":"1975","unstructured":"Holland, J. H. (1975). Adaptation in natural and artificial systems. Ann Arbor: University of Michigan Press."},{"key":"9298_CR15","unstructured":"Kaur, H. T., & Kalyanaram,\u00a0S. (2002). A connectionless approach to intra- and inter-domain traffic engineering. In 2nd New York area metro area networking workshop. Columbia University, September 2002."},{"key":"9298_CR16","doi-asserted-by":"crossref","unstructured":"Kaur,\u00a0H., Ye,\u00a0T., Kalyanaraman,\u00a0S., & Vastola, K. S. (2003). Minimizing packet loss by optimizing OSPF weights using on-line simulation. In Proceedings of the 11th international IEEE\/ACM symposium on modeling, analysis and simulation of computer and telecommunication systems. MASCOTS-2003.","DOI":"10.1109\/MASCOT.2003.1240645"},{"key":"9298_CR17","doi-asserted-by":"crossref","unstructured":"Lin,\u00a0F., & Wang,\u00a0J. (1993). Minimax open shortest path first routing algorithms in networks supporing the SMDS services. In Proc. IEEE international conference on communications (ICC) (Vol.\u00a02, pp.\u00a0666\u2013670).","DOI":"10.1109\/ICC.1993.397358"},{"key":"9298_CR18","unstructured":"Machiraju,\u00a0S., & Katz, R. H. (2004). Reconciling cooperation with confidentiality in multi-provider distributed systems (Tech. Rep. UCB\/CSD-04-1345). EECS Department, University of California, Berkeley."},{"key":"9298_CR19","unstructured":"Mahajan,\u00a0R., Wetherall,\u00a0D., & Anderson,\u00a0T. (2005). Negotiation-based routing between neighboring ISPs. In Proceedings of the 2nd symposium on networked systems design and implementation. Boston, MA, USA, April 2005."},{"key":"9298_CR20","doi-asserted-by":"crossref","unstructured":"Mitra,\u00a0D., & Ramakrishnan, K. G. (1999). A case study of multiservice, multipriority traffic engineering design for data networks. In Proc. IEEE GLOBECOM (pp. 1077\u20131083).","DOI":"10.1109\/GLOCOM.1999.830281"},{"key":"9298_CR21","unstructured":"Multiparty computations. http:\/\/www.cs.ut.ee\/~lipmaa\/crypto\/link\/mpc\/ ."},{"key":"9298_CR22","unstructured":"Murphy,\u00a0J., Harris,\u00a0R., & Nelson,\u00a0R. (2002). Traffic engineering using OSPF weights and splitting ratios. In INTERWORKING (pp. 277\u2013287)."},{"key":"9298_CR23","volume-title":"Game theory: analysis of conflict","author":"R. B. Myerson","year":"1997","unstructured":"Myerson, R. B. (1997). Game theory: analysis of conflict. Cambridge: Harvard University Press."},{"key":"9298_CR24","doi-asserted-by":"crossref","unstructured":"Nucci,\u00a0A., Schroeder,\u00a0B., Bhattacharyya,\u00a0S., Taft,\u00a0N., & Diot,\u00a0C. (2003). IGP link weight assignment for transient link failures. In 18th international teletraffic congress. Berlin, Germany, August 2003.","DOI":"10.1016\/S1388-3437(03)80177-4"},{"key":"9298_CR25","doi-asserted-by":"crossref","unstructured":"Pelsser,\u00a0C., Uhlig,\u00a0S., & Bonaventure,\u00a0O. (2004). On the difficulty of establishing interdomain LSPs. In Proc. of the 2004 IEEE international workshop on IP operations and management (IPOM). Beijing, China, October 2004.","DOI":"10.1109\/IPOM.2004.1547605"},{"key":"9298_CR26","unstructured":"Pinkas,\u00a0B. (2003). Cryptographic techniques for privacy-preserving data mining. In SIGKDD explorations. January 2003."},{"key":"9298_CR27","doi-asserted-by":"crossref","unstructured":"Quoitin,\u00a0B., Uhlig,\u00a0S., & Bonaventure,\u00a0O. (2002). Using redistribution communities for interdomain traffic engineering. In Quality of future Internet services (QoFIS 2002). October 2002.","DOI":"10.1007\/3-540-45859-X_12"},{"key":"9298_CR28","doi-asserted-by":"crossref","unstructured":"Quoitin,\u00a0B., Uhlig,\u00a0S., Pelsser,\u00a0C., Swinnen,\u00a0L., & Bonaventure,\u00a0O. (May 2003). Interdomain traffic engineering with BGP. IEEE Communications Magazine, Internet Technology Series.","DOI":"10.1109\/MCOM.2003.1200112"},{"key":"9298_CR29","doi-asserted-by":"crossref","unstructured":"Ramakrishnan,\u00a0K., & Rodrigues,\u00a0M. (2001). Optimal routing in shortest-path data networks. Lucent Bell Labs Technical Journal, 6(1).","DOI":"10.1002\/bltj.2267"},{"key":"9298_CR30","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1145\/1096536.1096551","volume":"35","author":"M. Roughan","year":"2005","unstructured":"Roughan,\u00a0M. (2005). Simplifying the synthesis of Internet traffic matrices. SIGCOMM Computer Communication Review, 35, 93\u201396.","journal-title":"SIGCOMM Computer Communication Review"},{"key":"9298_CR31","doi-asserted-by":"crossref","unstructured":"Roughan,\u00a0M., Thorup,\u00a0M., & Zhang,\u00a0Y. (2003). Traffic engineering with estimated traffic matrices. In ACM SIGCOMM Internet measurement conference (IMC) (pp. 248\u2013258). Miami Beach, FL, USA.","DOI":"10.1145\/948205.948237"},{"key":"9298_CR32","unstructured":"Spring,\u00a0N., Mahajan,\u00a0R., & Anderson,\u00a0T. (2003). Quantifying the causes of path inflation. In ACM SIGCOMM 2003. Karlsruhe, Germany."},{"key":"9298_CR33","doi-asserted-by":"crossref","unstructured":"Sridharan,\u00a0A., & Guerin,\u00a0R. (2005). Making IGP routing robust to link failures. In Networking 2005. Waterloo, Canada, May 2005.","DOI":"10.1007\/11422778_51"},{"key":"9298_CR34","doi-asserted-by":"crossref","unstructured":"Teixeira,\u00a0R., Griffin,\u00a0T., Shaikh,\u00a0A., & Voelker,\u00a0G. (2004). Network sensitivity to hot-potato disruptions. In Proceedings of ACM SIGCOMM. August 2004.","DOI":"10.1145\/1030194.1015493"},{"key":"9298_CR35","doi-asserted-by":"crossref","unstructured":"Teixeira,\u00a0R., Duffield,\u00a0N., Rexford,\u00a0J., & Roughan,\u00a0M. (2005). Traffic matrix reloaded: Impact of routing changes. In Workshop on passive and active measurements (PAM).","DOI":"10.1007\/978-3-540-31966-5_20"},{"key":"9298_CR36","doi-asserted-by":"crossref","unstructured":"Teixeira,\u00a0R., Griffin,\u00a0T., Resende, M. G. C., & Rexford,\u00a0J. (2005). TIE breaking: Tunable interdomain egress selection. In Proceedings of CoNEXT. October 2005.","DOI":"10.1145\/1095921.1095935"},{"key":"9298_CR37","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1142\/S1469026805001581","volume":"5","author":"S. Uhlig","year":"2005","unstructured":"Uhlig,\u00a0S. (2005). A multiple-objectives evolutionary perspective to interdomain traffic engineering. International Journal of Computational Intelligence and Applications, 5, 215\u2013230.","journal-title":"International Journal of Computational Intelligence and Applications"},{"key":"9298_CR38","doi-asserted-by":"crossref","unstructured":"Uhlig,\u00a0S., & Bonaventure,\u00a0O. (2000). On the cost of using MPLS for interdomain traffic. In Quality of future Internet services (QoFIS 2000). September 2000.","DOI":"10.1007\/3-540-39939-9_12"},{"key":"9298_CR39","doi-asserted-by":"crossref","unstructured":"Uhlig,\u00a0S., Bonaventure,\u00a0O., & Quoitin,\u00a0B. (2003). Interdomain traffic engineering with minimal BGP configurations. In 18th international teletraffic congress (ITC). September 2003.","DOI":"10.1016\/S1388-3437(03)80174-9"},{"key":"9298_CR40","doi-asserted-by":"crossref","unstructured":"Yao,\u00a0A. (1986). How to generate and exchange secrets. In Proc. of the 27th IEEE symposium on foundations of computer science (FOCS) (pp. 162\u2013167).","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Telecommunication Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11235-010-9298-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11235-010-9298-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11235-010-9298-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T06:50:08Z","timestamp":1559371808000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11235-010-9298-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,5,5]]},"references-count":40,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2011,6]]}},"alternative-id":["9298"],"URL":"https:\/\/doi.org\/10.1007\/s11235-010-9298-y","relation":{},"ISSN":["1018-4864","1572-9451"],"issn-type":[{"value":"1018-4864","type":"print"},{"value":"1572-9451","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,5,5]]}}}