{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T09:49:33Z","timestamp":1737539373954,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540423027"},{"type":"electronic","value":"9783540477280"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-47728-4_75","type":"book-chapter","created":{"date-parts":[[2007,11,14]],"date-time":"2007-11-14T01:39:45Z","timestamp":1195004385000},"page":"762-770","source":"Crossref","is-referenced-by-count":6,"title":["Influence of Network Topology on Protocol Simulation"],"prefix":"10.1007","author":[{"given":"Damien","family":"Magoni","sequence":"first","affiliation":[]},{"given":"Jean-Jacques","family":"Pansiot","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,6,22]]},"reference":[{"key":"75_CR1","unstructured":"Anindo Banerjea, Michalis Faloutsos, and Rajesh Pankaj. Designing qosmic: A quality of service sensitive multicast internet protocol. In Proceedings of ACM SIGCOMM\u201998, Vancouver, BC, Canada, September 1998."},{"key":"75_CR2","first-page":"511","volume":"271","author":"Ken Carlberg and Jon Crowcroft","year":"1997","unstructured":"Ken Carlberg and Jon Crowcroft. Building shared trees using a one-to-many joining mechanism. ACM Computer Communication Review, 271:511, January 1997.","journal-title":"ACM Computer Communication Review"},{"key":"75_CR3","doi-asserted-by":"crossref","unstructured":"Matthew Doar. A better model for generating test networks. In Proceedings of IEEE GLOBECOM\u201996, November 1996.","DOI":"10.1109\/GLOCOM.1996.586131"},{"key":"75_CR4","doi-asserted-by":"crossref","unstructured":"Matthew Doar and Ian Leslie. How bad is nave multicast routing. In Proceedings of IEEE Infocom\u201993, pages 82-89, 1993.","DOI":"10.1109\/INFCOM.1993.253246"},{"key":"75_CR5","doi-asserted-by":"crossref","unstructured":"Michalis Faloutsos, Petros Faloutsos, and Christos Faloutsos. On power-law rela-tionships of the internet topology. In Proceedings of ACM SIGCOMM\u201999, Cambridge, Massachusetts, USA, September 1999.","DOI":"10.1145\/316188.316229"},{"key":"75_CR6","unstructured":"Cheng Jin, Qian Chen, and Sugih Jamin. Inet: Internet topology generator. Technical Report CSE-TR-433-00, University of Michigan, 2000."},{"key":"75_CR7","doi-asserted-by":"crossref","unstructured":"Damien Magoni and Jean-Jacques Pansiot. Algorithm for an oriented multicast routing protocol. In Proceedings of IEEE International Conference on Communi-cations ICC\u201901, Helsinki, Finland, June 2001.","DOI":"10.1109\/ICC.2001.936618"},{"key":"75_CR8","unstructured":"Damien Magoni and Jean-Jacques Pansiot. Autonomous system level analysis of internet. Technical Report ULP\/LSIIT-RR-2001\/01, Universit_e Louis Pasteur, 2001."},{"key":"75_CR9","unstructured":"Damien Magoni, Jean-Jacques Pansiot, David Pat_e, and Dominique Grad. Agent search by oriented multicast. In Proceedings of ACIS International Conference on Software Engineering Applied to Networking & Parallel\/Distributed Computing SNPD\u201900, pages 181\u2013188, Reims, France, May 2000."},{"key":"75_CR10","doi-asserted-by":"crossref","unstructured":"Alberto Medina, Ibrahim Matta, and John Byers. On the origin of power laws in internet topologies. ACM Computer Communication Review, 2000.","DOI":"10.1145\/505680.505683"},{"key":"75_CR11","unstructured":"Christopher Palmer and Gregory Ste_an. Generating network topologies that obey power laws. In Proceedings of IEEE GLOBECOM\u201900, San Francisco, California, USA, November 2000."},{"key":"75_CR12","unstructured":"Parallel Computing Laboratory, http:\/\/pcl.cs.ucla.edu\/projects\/glomosim\/ . Glo-MoSim."},{"key":"75_CR13","unstructured":"P. Radoslavov, H. Tangmunarunkit, H. Yu, R. Govindan, S. Shenker, and D. Es-trin. On characterizing network topologies and analyzing their impact on protocol design. Technical report, University of Southern California, 2000."},{"key":"75_CR14","unstructured":"The VINT project, http:\/\/www.isi.edu\/nsnam\/vint\/ . network simulator ns-2."},{"key":"75_CR15","doi-asserted-by":"publisher","first-page":"1617","DOI":"10.1109\/49.12889","volume":"69","author":"B. Waxman","year":"1988","unstructured":"Bernard Waxman. Routing of multipoint connections. IEEE Journal on Selected Areas in Communications, 69:1617\u20131622, December 1988.","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"75_CR16","unstructured":"L. Wei and D. Estrin. A comparison of multicast trees and algorithms. In Proceedings of IEEE Infocom\u201994, Toronto, Canada, June 1994."},{"issue":"6","key":"75_CR17","doi-asserted-by":"publisher","first-page":"770","DOI":"10.1109\/90.650138","volume":"5","author":"E. Zegura","year":"1997","unstructured":"Ellen Zegura, Kenneth Calvert, and Michael Donahoo. A quantitative comparison of graph-based models for internetworks. IEEE \/ ACM Transactions on Networking, 5(6):770\u2013783, December 1997.","journal-title":"IEEE \/ ACM Transactions on Networking"}],"container-title":["Lecture Notes in Computer Science","Networking \u2014 ICN 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-47728-4_75","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T09:11:55Z","timestamp":1737537115000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-47728-4_75"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540423027","9783540477280"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-47728-4_75","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}