{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:01:12Z","timestamp":1725534072939},"publisher-location":"Berlin, Heidelberg","reference-count":50,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642020933"},{"type":"electronic","value":"9783642020940"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02094-0_13","type":"book-chapter","created":{"date-parts":[[2009,6,27]],"date-time":"2009-06-27T10:45:07Z","timestamp":1246099507000},"page":"266-291","source":"Crossref","is-referenced-by-count":0,"title":["Management of Variable Data Streams in Networks"],"prefix":"10.1007","author":[{"given":"Anja","family":"Feldmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simon","family":"Fischer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nils","family":"Kammenhuber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Berthold","family":"V\u00f6cking","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Ackermann, H., R\u00f6glin, H., V\u00f6cking, B.: On the impact of combinatorial structure on congestion games. In: Proc. 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 613\u2013622 (2006)","DOI":"10.1109\/FOCS.2006.55"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Azar, Y., Epstein, A.: The price of routing unsplittable flow. In: Proc. 37th Annual ACM Symposium on Theory of Computing, STOC (2005)","DOI":"10.1145\/1060590.1060599"},{"key":"13_CR3","unstructured":"Awerbuch, B., Khandekar, R., Rao, S.: Distributed algorithms for multicommodity flow problems via approximate steepest descent framework. In: Proc. 18th Annual ACM\u2013SIAM Symposium on Discrete Algorithms, SODA (2007)"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Kleinberg, R.D.: Adaptive routing with end-to-end feedback: Distributed learning and geometric approaches. In: Proc. 36th Annual ACM Symposium on Theory of Computing (STOC), pp. 45\u201353 (2004)","DOI":"10.1145\/1007352.1007367"},{"key":"13_CR5","unstructured":"Balon, S., Lepropre, J., Monfort, G.: TOTEM\u2014TOolbox for Traffic Engineering Methods, http:\/\/totem.run.montefiore.ulg.ac.be\/"},{"key":"13_CR6","unstructured":"Beckmann, M., McGuire, C.B., Winsten, C.B.: Studies in the Economics of Transportation. Yale University Press (1956)"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Berenbrink, P., Friedetzky, T., Goldberg, L.A., Goldberg, P., Hu, Z., Martin, R.: Distributed selfish load balancing. In: Proc. 17th Annual ACM\u2013SIAM Symposium on Discrete Algorithms, SODA (2006)","DOI":"10.1145\/1109557.1109597"},{"key":"13_CR8","unstructured":"Bertsekas, D.P., Tsitsiklis, J.N.: Parallel and Distributed Computing: Numerical Methods. Athena Scientific (1989)"},{"key":"13_CR9","first-page":"45","volume-title":"Proc. 25th Annual ACM Symposium on Principles of Distributed Computing (PODC)","author":"A. Blum","year":"2006","unstructured":"Blum, A., Even-Dar, E., Ligett, K.: Routing without regret: On convergence to Nash equilibria of regret-minimizing algorithms in routing games. In: Proc. 25th Annual ACM Symposium on Principles of Distributed Computing (PODC), Denver, Colorado, USA, July 2006, pp. 45\u201352. ACM, New York (2006)"},{"key":"13_CR10","unstructured":"Cao, J., Nyberg, C.: An approximate analysis of load balancing using stale state information for servers in parallel. In: Proc. 2nd IASTED International Conference on Communications Internet and Information Technology (November 2003)"},{"key":"13_CR11","unstructured":"Cao, Z., Wang, Z., Zegura, E.W.: Performance of hashing-based schemes for Internet load balancing. In: Proc. IEEE INFOCOM Conference (2000)"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Christodoulou, G., Koutsoupias, E.: The price of anarchy of finite congestion games. In: Proc. 37th Annual ACM Symposium on Theory of Computing, STOC (2005)","DOI":"10.1145\/1060590.1060600"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Cole, R., Dodis, Y., Roughgarden, T.: How much can taxes help selfish routing? In: Proc. 4th ACM Conference on Electronic Commerce, pp. 98\u2013107 (2003)","DOI":"10.1145\/779928.779941"},{"key":"13_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/11786986_46","volume-title":"Automata, Languages and Programming","author":"R. Cominetti","year":"2006","unstructured":"Cominetti, R., Correa, J.R., Moses, N.E.S.: Network games with atomic players. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04051, pp. 525\u2013536. Springer, Heidelberg (2006)"},{"key":"13_CR15","unstructured":"Dreger, H., Feldmann, A., Mai, M., Paxson, V., Sommer, R.: Dynamic application-layer protocol analysis for network intrusion detection. In: Proc.15th Usenix Security Symposium (2006)"},{"key":"13_CR16","unstructured":"Even-Dar, E., Mansour, Y.: Fast convergence of selfish rerouting. In: Proc. 16th Annual ACM\u2013SIAM Symposium on Discrete Algorithms (SODA), pp. 772\u2013781 (2005)"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Papadimitriou, C., Talwar, K.: The complexity of pure Nash equilibria. In: Proc. 36th Annual ACM Symposium on Theory of Computing (STOC), pp. 604\u2013612 (2004)","DOI":"10.1145\/1007352.1007445"},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"Fischer, S., Kammenhuber, N., Feldmann, A.: ReplEx\u2014dynamic traffic engineering based on Wardrop routing policies. In: Proc. CoNext, Lisboa, Portugal (2006)","DOI":"10.1145\/1368436.1368438"},{"key":"13_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/978-3-540-75142-7_20","volume-title":"Distributed Computing","author":"S. Fischer","year":"2007","unstructured":"Fischer, S., Olbrich, L., V\u00f6cking, B.: Approximating Wardrop equilibria with finitely many agents. In: Pelc, A. (ed.) DISC 2007. LNCS, vol.\u00a04731, pp. 238\u2013252. Springer, Heidelberg (2007)"},{"key":"13_CR20","first-page":"653","volume-title":"Proc. 38th Annual ACM Symposium on Theory of Computing (STOC)","author":"S. Fischer","year":"2006","unstructured":"Fischer, S., R\u00e4cke, H., V\u00f6cking, B.: Fast convergence to Wardrop equilibria by adaptive sampling methods. In: Proc. 38th Annual ACM Symposium on Theory of Computing (STOC), Seattle, WA, USA, May 2006, pp. 653\u2013662. ACM, New York (2006)"},{"key":"13_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/978-3-540-30140-0_30","volume-title":"Algorithms \u2013 ESA 2004","author":"S. Fischer","year":"2004","unstructured":"Fischer, S., V\u00f6cking, B.: On the evolution of selfish routing. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol.\u00a03221, pp. 323\u2013334. Springer, Heidelberg (2004)"},{"key":"13_CR22","first-page":"276","volume-title":"Proc. 24th Annual ACM Symposium on Principles of Distributed Computing (PODC)","author":"S. Fischer","year":"2005","unstructured":"Fischer, S., V\u00f6cking, B.: Adaptive routing with stale information. In: Proc. 24th Annual ACM Symposium on Principles of Distributed Computing (PODC), Las Vegas, NV, USA, pp. 276\u2013283. ACM, New York (2005)"},{"key":"13_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1007\/978-3-540-27836-8_47","volume-title":"Automata, Languages and Programming","author":"L. Fleischer","year":"2004","unstructured":"Fleischer, L.: Linear tolls suffice: New bounds and algorithms for tolls in single source networks. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 544\u2013554. Springer, Heidelberg (2004)"},{"key":"13_CR24","doi-asserted-by":"crossref","unstructured":"Fortz, B., Rexford, J., Thorup, M.: Traffic engineering with traditional IP routing protocols. IEEE Communication Magazine, 118\u2013124 (2002)","DOI":"10.1109\/MCOM.2002.1039866"},{"key":"13_CR25","doi-asserted-by":"crossref","unstructured":"Fortz, B., Thorup, M.: Internet traffic engineering by optimizing OSPF weights. In: Proc. IEEE INFOCOM Conference (2000)","DOI":"10.1109\/INFCOM.2000.832225"},{"key":"13_CR26","doi-asserted-by":"crossref","unstructured":"Fortz, B., Thorup, M.: Optimizing OSPF\/IS-IS weights in a changing world. IEEE Journal on Selected Areas in Communications\u00a020(4) (2002)","DOI":"10.1109\/JSAC.2002.1003042"},{"key":"13_CR27","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1002\/net.3230150303","volume":"15","author":"A.B. Haurie","year":"1985","unstructured":"Haurie, A.B., Marcotte, P.: On the relationship between Nash-Cournot and Wardrop equilibria. Networks\u00a015, 295\u2013308 (1985)","journal-title":"Networks"},{"key":"13_CR28","doi-asserted-by":"crossref","unstructured":"Hayrapetyan, A., Tardos, \u00c9., Wexler, T.: The effect of collusion in congestion games. In: Proc. 38th Annual ACM Symposium on Theory of Computing (STOC), pp. 89\u201398 (2006)","DOI":"10.1145\/1132516.1132529"},{"key":"13_CR29","unstructured":"Kammenhuber, N.: Traffic Adaptive Routing. Ph.D thesis, Technische Universit\u00e4t M\u00fcnchen (2008)"},{"key":"13_CR30","doi-asserted-by":"crossref","unstructured":"Khanna, A., Zinky, J.: The revised ARPANET routing metric. In: Proc. ACM SIGCOMM Conference (1989)","DOI":"10.1145\/75246.75252"},{"key":"13_CR31","first-page":"45","volume-title":"Proc. ACM SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication (SIGCOMM)","author":"A. Khanna","year":"1998","unstructured":"Khanna, A., Zinky, J.A.: The revised ARPANET routing metric. In: Proc. ACM SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication (SIGCOMM), September 1998, pp. 45\u201356. ACM, New York (1998)"},{"key":"13_CR32","volume-title":"Computer Networking, a top down approach featuring the Internet","author":"J.F. Kurose","year":"2004","unstructured":"Kurose, J.F., Ross, K.W.: Computer Networking, a top down approach featuring the Internet, 3rd edn. Addison-Wesley Longman, Amsterdam (2004)","edition":"3"},{"key":"13_CR33","doi-asserted-by":"crossref","unstructured":"Laor, M., Gendel, L.: The effect of packet reordering in a backbone link on application throughput. IEEE Network (September\/October 2002)","DOI":"10.1109\/MNET.2002.1035115"},{"issue":"1","key":"13_CR34","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1109\/71.824633","volume":"11","author":"M. Mitzenmacher","year":"2000","unstructured":"Mitzenmacher, M.: How useful is old information? IEEE Transactions on Parallel and Distributed Systems\u00a011(1), 6\u201320 (2000)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"volume-title":"Self-Similar Network Traffic and Performance Evaluation","year":"2000","key":"13_CR35","unstructured":"Park, K., Willinger, W. (eds.): Self-Similar Network Traffic and Performance Evaluation. Wiley-Interscience, Hoboken (2000)"},{"key":"13_CR36","volume-title":"Handbook of Optimization in Telecommunications","author":"J. Rexford","year":"2005","unstructured":"Rexford, J.: Route optimization in IP networks. In: Handbook of Optimization in Telecommunications. Kluwer Academic Publishers, Dordrecht (2005)"},{"key":"13_CR37","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF01737559","volume":"2","author":"R.W. Rosenthal","year":"1973","unstructured":"Rosenthal, R.W.: A class of games possessing pure-strategy Nash equilibria. International Journal of Game Theory\u00a02, 65\u201367 (1973)","journal-title":"International Journal of Game Theory"},{"key":"13_CR38","doi-asserted-by":"crossref","unstructured":"Roughan, M., Thorup, M., Zhang, Y.: Traffic engineering with estimated traffic matrices. In: Proc. ACM Measurement Conference (2003)","DOI":"10.1145\/948205.948237"},{"key":"13_CR39","doi-asserted-by":"crossref","unstructured":"Roughgarden, T.: Stackelberg scheduling strategies. In: Proc. 33rd Annual ACM Symposium on Theory of Computing (STOC), pp. 104\u2013113 (2001)","DOI":"10.1145\/380752.380783"},{"issue":"2","key":"13_CR40","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1016\/S0022-0000(03)00044-8","volume":"67","author":"T. Roughgarden","year":"2003","unstructured":"Roughgarden, T.: The price of anarchy is independent of the network topology. Journal of Computer and System Sciences\u00a067(2), 341\u2013367 (2003)","journal-title":"Journal of Computer and System Sciences"},{"key":"13_CR41","unstructured":"Roughgarden, T.: The maximum latency of selfish routing. In: Proc. 15th Annual ACM\u2013SIAM Symposium on Discrete Algorithms (SODA), pp. 973\u2013974 (2005)"},{"issue":"2","key":"13_CR42","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1145\/506147.506153","volume":"49","author":"T. Roughgarden","year":"2002","unstructured":"Roughgarden, T., Tardos, \u00c9.: How bad is selfish routing? Journal of the ACM\u00a049(2), 236\u2013259 (2002)","journal-title":"Journal of the ACM"},{"key":"13_CR43","doi-asserted-by":"crossref","unstructured":"Savage, S., Collins, A., Hoffman, E., Snell, J., Anderson, T.E.: The end-to-end effects of internet path selection. In: Proc. ACM SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication (SIGCOMM), Boston, MA, pp. 289\u2013299 (1999)","DOI":"10.1145\/316188.316233"},{"key":"13_CR44","first-page":"133","volume-title":"Proc. ACM SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication (SIGCOMM)","author":"N. Spring","year":"2002","unstructured":"Spring, N., Mahajan, R., Wetherall, D.: Measuring ISP topologies with Rocketfuel. In: Proc. ACM SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication (SIGCOMM), Pittsburgh, PA, USA, August 2002, pp. 133\u2013145. ACM, New York (2002)"},{"key":"13_CR45","doi-asserted-by":"crossref","unstructured":"Teixeira, R., Duffield, N., Rexford, J., Roughan, M.: Traffic matrix reloaded: Impact of routing changes. In: Proc. Passive and Active Measurement (2005)","DOI":"10.1007\/978-3-540-31966-5_20"},{"key":"13_CR46","doi-asserted-by":"crossref","unstructured":"Wang, H., Xie, H., Qiu, L., Yang, Y.R., Zhang, Y., Greenberg, A.: COPE: Traffic engineering in dynamic networks. In: Proc. ACM SIGCOMM Conference (2006)","DOI":"10.1145\/1159913.1159926"},{"key":"13_CR47","doi-asserted-by":"crossref","unstructured":"Wardrop, J.G.: Some theoretical aspects of road traffic research. In: Proc. of the Institute of Civil Engineers, Pt. II, vol.\u00a01, pp. 325\u2013378 (1952)","DOI":"10.1680\/ipeds.1952.11259"},{"key":"13_CR48","unstructured":"Xiao, X., Hannan, A., Bailey, B., Ni, L.: Traffic engineering with MPLS in the Internet. IEEE Network Magazine (March 2000)"},{"key":"13_CR49","unstructured":"Zhang, C., Ge, Z., Kurose, J., Liu, Y., Towsley, D.: Optimal routing with multiple traffic matrices: Tradeoff between average case and worst case performance. In: Proc. 13th International Conference on Network Protocols, ICNP (2005)"},{"key":"13_CR50","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Roughan, M., Lund, C., Donoho, D.: An information-theoretic approach to traffic matrix estimation. In: Proc. ACM SIGCOMM Conference (2003)","DOI":"10.1145\/863955.863990"}],"container-title":["Lecture Notes in Computer Science","Algorithmics of Large and Complex Networks"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02094-0_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T23:46:45Z","timestamp":1558396005000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02094-0_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642020933","9783642020940"],"references-count":50,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02094-0_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}