{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T21:03:23Z","timestamp":1729631003955,"version":"3.28.0"},"reference-count":28,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1109\/ictel.2009.5158621","type":"proceedings-article","created":{"date-parts":[[2009,7,7]],"date-time":"2009-07-07T22:18:41Z","timestamp":1247005121000},"page":"71-76","source":"Crossref","is-referenced-by-count":1,"title":["On the methodology for the evaluation of unconstrained multicast routing algorithms"],"prefix":"10.1109","author":[{"given":"Maciej","family":"Stasiak","sequence":"first","affiliation":[]},{"given":"Maciej","family":"Piechowiak","sequence":"additional","affiliation":[]},{"given":"Piotr","family":"Zwierzykowski","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1992.263480"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/EURCON.2007.4400670"},{"key":"ref12","first-page":"282","article-title":"An Application of the Switched Tree Mechanism in the Multicast Routing Algorithms","author":"piechowiak","year":"2008","journal-title":"1-st Interdisciplinary Technical Conference of Young Scientists InterTech 2008"},{"key":"ref13","first-page":"113","article-title":"Efficiency of QoS-oriented Multicast Routing Algorithms","author":"piechowiak","year":"2008","journal-title":"Information Systems Architecture and Technology Information Systems and Computer Communication Networks"},{"key":"ref14","article-title":"Genetic Routing Algorithm for Multicast Connections in Packet Networks","volume":"13","author":"chojnacki","year":"2008","journal-title":"International Journal of Image Processing & Communications"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/90.532865"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISCC.2000.860716"},{"key":"ref19","first-page":"55","article-title":"The trade-offs of multicast trees and algorithms","author":"wei","year":"1994","journal-title":"Proc IEEE ICC 94"},{"key":"ref28","first-page":"5\/1","article-title":"Heuristics for ATM Multicast Routing","author":"crawford","year":"1998","journal-title":"Proceedings of 6th IFIP Workshop on Performance Modeling and Evaluation of ATM Networks"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/49.12889"},{"key":"ref27","first-page":"111","article-title":"On Power-Law Relationships of the Internet Topology","author":"faloutsos","year":"1999","journal-title":"ACM Computer Communication Review"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/MASCOT.2001.948886"},{"key":"ref6","first-page":"377","article-title":"A source-based algorithm for delay-constrained minimum-cost multicasting","author":"zhu","year":"1995","journal-title":"INFOCOM'95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol 1)-Volume IEEE Computer Society"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/BF00288961"},{"key":"ref8","doi-asserted-by":"crossref","DOI":"10.1109\/INFCOM.1996.493353","article-title":"How to Model an Internetwork","author":"zegura","year":"1996","journal-title":"IEEE INFOCOM'96"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/49.564135"},{"key":"ref2","article-title":"Inet: Internet topology generator","author":"jin","year":"2000","journal-title":"University of Michigan at Ann Arbor Technical Research Report CSE-TR-433-00"},{"key":"ref9","article-title":"A delay constrained shortest path algorithm for multicast routing in multimedia applications","author":"mokbel","year":"1999","journal-title":"Proceedings of IEEE Middle East Workshop on Networking IEEE Computer Society"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/90.650138"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/49.564133"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/49.552065"},{"key":"ref21","first-page":"743","article-title":"A*Prune: An Algorithm for Finding K Shortest Paths Subject to Multiple Constraints","author":"liu","year":"2001","journal-title":"INFOCOM 2001 Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies"},{"journal-title":"The Structure and Dynamics of Networks Princeton Studies in Complexity","year":"2007","author":"newman","key":"ref24"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/49.564129"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ICNS.2007.56"},{"key":"ref25","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","article-title":"Emergence of scaling in random networks","author":"barabasi","year":"1999","journal-title":"Science"}],"event":{"name":"2009 International Conference on Telecommunications","start":{"date-parts":[[2009,5,25]]},"location":"Marrakech, Morroco","end":{"date-parts":[[2009,5,27]]}},"container-title":["2009 International Conference on Telecommunications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5089941\/5158601\/05158621.pdf?arnumber=5158621","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,20]],"date-time":"2020-05-20T09:23:12Z","timestamp":1589966592000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5158621\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1109\/ictel.2009.5158621","relation":{},"subject":[],"published":{"date-parts":[[2009]]}}}