{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T02:27:34Z","timestamp":1743042454878,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642011559"},{"type":"electronic","value":"9783642011566"}],"license":[{"start":{"date-parts":[[2009,10,22]],"date-time":"2009-10-22T00:00:00Z","timestamp":1256169600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2009,10,22]],"date-time":"2009-10-22T00:00:00Z","timestamp":1256169600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-01156-6_17","type":"book-chapter","created":{"date-parts":[[2009,10,21]],"date-time":"2009-10-21T16:33:44Z","timestamp":1256142824000},"page":"199-235","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["RELAY \u2014 On the Performance and Resource Utilisation of Time-Dependent Large-Scale Distributed Systems"],"prefix":"10.1007","author":[{"given":"Carsten","family":"Griwodz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P\u00e5l","family":"Halvorsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,10,22]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"F. Dabek, R. Cox, F. Kaashoek, and R. Morris. Vivaldi: a decentralized network coordinate system. ACM International Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM), pages 15\u201326, 2004.","DOI":"10.1145\/1030194.1015471"},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/BF00288961","volume":"15","author":"L. Kou","year":"1981","unstructured":"L. Kou, G. Markowsky, and L. Berman. A fast algorithm for Steiner trees. Acta Informatica, 15:141\u2013145, jun 1981.","journal-title":"Acta Informatica"},{"key":"17_CR3","unstructured":"The Verdione project. Verdione. https:\/\/verdione.org\/."},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"K.-H. Vik, C. Griwodz, and P. Halvorsen. Dynamic group membership management for distributed interactive applications. IEEE Conference on Local Computer Networks (LCN), pages 141\u2013148, oct 2007.","DOI":"10.1109\/LCN.2007.85"},{"issue":"1","key":"17_CR5","first-page":"573","volume":"6","author":"H. Takahashi","year":"1980","unstructured":"H. Takahashi and A. Matsuyama. An approximate solution for the steiner trees in graphs. Intl. J. Math. Japonica, 6(1):573\u2013577, 1980.","journal-title":"Intl. J. Math. Japonica"},{"key":"17_CR6","unstructured":"Skype, March 2008."},{"issue":"15","key":"17_CR7","doi-asserted-by":"publisher","first-page":"2872","DOI":"10.1016\/j.comnet.2008.06.003","volume":"52","author":"K.-H. Vik","year":"2008","unstructured":"K.-H. Vik, P. Halvorsen, and C. Griwodz. Evaluating steiner tree heuristics and diameter variations for application layer multicast. Elsevier Computer Networks, 52(15):2872\u20132893, oct 2008.","journal-title":"Elsevier Computer Networks"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"M. Allman, V. Paxson, and W. Stevens. TCP Congestion Control . RFC 2581 (Proposed Standard), Apr. 1999.","DOI":"10.17487\/rfc2581"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"W. Stevens. TCP Slow Start, Congestion Avoidance, Fast Retransmit, and Fast Recovery Algorithms. RFC 2001 (Proposed Standard), Jan. 1997.","DOI":"10.17487\/rfc2001"},{"issue":"1","key":"17_CR10","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1080\/0020739830140103","volume":"14","author":"V. Rayward-Smith","year":"1983","unstructured":"V. Rayward-Smith and A. Clare. The computation of nearly minimal Steiner trees in graphs. International Journal of Mathematical Education in Science and Technology, 14(1):8pp, 1983.","journal-title":"International Journal of Mathematical Education in Science and Technology"},{"issue":"3","key":"17_CR11","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1109\/TNET.2005.850221","volume":"13","author":"W. chang Feng","year":"2005","unstructured":"W. chang Feng, F. Chang, W. chi Feng, and J. Walpole. A traffic characterization of popular on-line games. IEEE\/ACM Transactions on Networking, 13(3):488\u2013500, 2005.","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"C. Parsa and J.\u00a0J. Garcia-Luna-Aceves. Improving TCP congestion control over internets with heterogeneous transmission media. International Conference on Network Protocols (ICNP), pages 213\u2013221, Nov. 1999.","DOI":"10.1109\/ICNP.1999.801940"},{"key":"17_CR13","unstructured":"R.\u00a0J. Larsen and M.\u00a0L. Marx. An Introduction to Mathemetical Statistics and Its Applications. Prentice Hall, 1986."},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"W. chang Feng, F. Chang, W. chi Feng, and J. Walpole. Provisioning on-line games: a traffic analysis of a busy Counter-strike server. In the Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurement, Marseille, France, pages 151\u2013156, November 2002.","DOI":"10.1145\/637201.637223"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"M. Allman, H. Balakrishnan, and S. Floyd. Enhancing TCP\u2019s Loss Recovery Using Limited Transmit. RFC 3042 (Proposed Standard), Jan. 2001.","DOI":"10.17487\/rfc3042"},{"issue":"1","key":"17_CR16","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.comnet.2005.04.008","volume":"49","author":"M. Claypool","year":"2005","unstructured":"M. Claypool. The effect of latency on user performance in real-time strategy games. Elsevier Computer Networks, 49(1):52\u201370, Sept. 2005.","journal-title":"Elsevier Computer Networks"},{"issue":"3","key":"17_CR17","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1145\/1140086.1140092","volume":"36","author":"P. Sharma","year":"2006","unstructured":"P. Sharma, Z. Xu, S. Banerjee, and S.-J. Lee. Estimating network proximity and latency. SIGCOMM Comput. Commun. Rev., 36(3):39\u201350, 2006.","journal-title":"SIGCOMM Comput. Commun. Rev."},{"key":"17_CR18","unstructured":"The MiSMoSS project. Middleware services for management of shared state in large-scale distributed interactive applications (MiSMoSS). http:\/\/www.simula.no\/research\/networks\/projects\/RELAY\/mismoss\/."},{"key":"17_CR19","doi-asserted-by":"crossref","unstructured":"K.-H. Vik, P. Halvorsen, and C. Griwodz. Multicast tree diameter for dynamic distributed interactive applications. infocom, pages 1597\u20131605, Apr. 2008.","DOI":"10.1109\/INFOCOM.2008.220"},{"key":"17_CR20","unstructured":"International Telecommunication Union (ITU-T). One-way Transmission Time, ITU-T Recommendation G. 114, 2003."},{"key":"17_CR21","doi-asserted-by":"crossref","unstructured":"R.\u00a0A. Bangun, E. Dutkiewicz, and G.\u00a0J. Anido. An analysis of multi-player network games traffic. Proceedings of IEEE MMSP, 1999.","DOI":"10.1109\/MMSP.1999.793777"},{"key":"17_CR22","unstructured":"M.\u00a0S. Borella. Source models of network game traffic. Proceedings of Networld and Interop, 1999."},{"key":"17_CR23","doi-asserted-by":"crossref","unstructured":"K.-T. Chen, C.-Y. Huang, P. Huang, and C.-L. Lei. An empirical evaluation of TCP performance in online games. Proceedings of ACM SIGCHI ACE\u201906, Los Angeles, USA, Jun 2006.","DOI":"10.1145\/1178823.1178830"},{"key":"17_CR24","doi-asserted-by":"crossref","unstructured":"P. Svoboda, W. Karner, and M. Rupp. Traffic analysis and modeling for world of warcraft. Communications, 2007. ICC \u201907. IEEE International Conference on, pages 1612\u20131617, June 2007.","DOI":"10.1109\/ICC.2007.270"},{"key":"17_CR25","doi-asserted-by":"crossref","unstructured":"K.-T. Chen, P. Huang, C.-Y. Huang, and C.-L. Lei. Games traffic analysis: An MMORPG perspective. nossdav, pages 19\u201324. ACM Press, 2005.","DOI":"10.1145\/1065983.1065988"},{"key":"17_CR26","unstructured":"The RELAY project. Resource utilization in time-dependent large-scale distributed systems (RELAY). http:\/\/www.simula.no\/research\/networks\/projects\/RELAY."},{"key":"17_CR27","doi-asserted-by":"crossref","unstructured":"C. Griwodz and P. Halvorsen. The fun of using TCP for an MMORPG. nossdav, pages 1\u20137. ACM Press, May 2006.","DOI":"10.1145\/1378191.1378193"},{"key":"17_CR28","volume-title":"Internet QoS: Architectures and Mechanisms for Quality of Service","author":"Z. Wang","year":"2001","unstructured":"Z. Wang. Internet QoS: Architectures and Mechanisms for Quality of Service. Morgan Kaufmann Publishers Inc, San Francisco, CA, USA, 2001."},{"issue":"11","key":"17_CR29","first-page":"40","volume":"49","author":"M. Claypool","year":"2005","unstructured":"M. Claypool and K. Claypool. Latency and player actions in online games. com_acm, 49(11):40\u201345, Nov. 2005.","journal-title":"com_acm"},{"key":"17_CR30","unstructured":"B.\u00a0Y. Wu and K.-M. Chao. Spanning Trees and Opitmization Problems. Chapman and Hall\/CRC, 2004."},{"key":"17_CR31","doi-asserted-by":"crossref","unstructured":"K.-H. Vik, P. Halvorsen, and C. Griwodz. Constructing low-latency overlay networks: Tree vs. mesh algorithms. IEEE Conference on Local Computer Networks (LCN), Oct. 2008.","DOI":"10.1109\/LCN.2008.4664149"},{"key":"17_CR32","doi-asserted-by":"crossref","unstructured":"L. Pantel and L. Wolf. On the impact of delay on real-time multiplayer games. nossdav, pages 23\u201329, 2002.","DOI":"10.1145\/507670.507674"},{"issue":"4","key":"17_CR33","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1109\/LCOMM.2008.071957","volume":"12","author":"K. Evensen","year":"2008","unstructured":"K. Evensen, A. Petlund, C. Griwodz, and P. Halvorsen. Redundant bundling in tcp to reduce perceived latency for time-dependent thin streams. Communications Letters, IEEE, 12(4):324\u2013326, April 2008.","journal-title":"Communications Letters, IEEE"},{"key":"17_CR34","doi-asserted-by":"crossref","unstructured":"K.-H. Vik, C. Griwodz, and P. Halvorsen. Applicability of group communication for increased scalability in MMOGs. Workshop on Network and System Support for Games (NETGAMES), Singapore, Oct. 2006. ACM Press.","DOI":"10.1145\/1230040.1230065"},{"key":"17_CR35","unstructured":"The iAD project. information access disruptions (iAD). http:\/\/www.ifi.uio.no\/forskning\/grupper\/nd\/projects\/2006\/iad\/."},{"key":"17_CR36","doi-asserted-by":"crossref","unstructured":"K.-H. Vik, C. Griwodz, and P. Halvorsen. On the influence of latency estimation on dynamic group communication using overlays, (to appear). SPIE\/ACM Conference on Multimedia Computing and Networking (MMCN), San Jose, CA, USA, Jan. 2009.","DOI":"10.1117\/12.815561"}],"container-title":["Simula Research Laboratory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-01156-6_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T21:41:16Z","timestamp":1739396476000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-01156-6_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,10,22]]},"ISBN":["9783642011559","9783642011566"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-01156-6_17","relation":{},"subject":[],"published":{"date-parts":[[2009,10,22]]},"assertion":[{"value":"22 October 2009","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}