D. Careglio, D. Papadimitriou, F. Agraz, Sahel Sahhaf, J. Perelló, W. Tavernier
{"title":"On the experimentation of the novel GCMR multicast routing in a large-scale testbed","authors":"D. Careglio, D. Papadimitriou, F. Agraz, Sahel Sahhaf, J. Perelló, W. Tavernier","doi":"10.1109/INFCOMW.2014.6849177","DOIUrl":null,"url":null,"abstract":"Originally defined in the 90s, multicast is nowadays (re)gaining interest given the increasing popularity of multimedia streaming/content traffic and the explosion of cloud services. In fact, multicast yields bandwidth savings complementing cached content distribution techniques and its potential benefits have been verified by studies several times since then (see e.g. [1]). By multicast routing, we refer to a distributed algorithm that, given a group identifier, allows any node to route multicast traffic to a group of destination nodes, usually called multicast group. To enable one-to-many traffic distribution, the multicast routing protocol configures the involved routers to build a (logical) delivery tree between the source and the multicast group, commonly referred to as the Multicast Distribution Tree (MDT). Nevertheless, the scaling problems faced in the 90s still remain mostly unaddressed and worst-case projections predict indeed that routing engines could have to process and maintain in the order of 1 million active routes within the next 5 years [2].","PeriodicalId":6468,"journal":{"name":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"91 1","pages":"105-106"},"PeriodicalIF":0.0000,"publicationDate":"2014-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INFCOMW.2014.6849177","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
Originally defined in the 90s, multicast is nowadays (re)gaining interest given the increasing popularity of multimedia streaming/content traffic and the explosion of cloud services. In fact, multicast yields bandwidth savings complementing cached content distribution techniques and its potential benefits have been verified by studies several times since then (see e.g. [1]). By multicast routing, we refer to a distributed algorithm that, given a group identifier, allows any node to route multicast traffic to a group of destination nodes, usually called multicast group. To enable one-to-many traffic distribution, the multicast routing protocol configures the involved routers to build a (logical) delivery tree between the source and the multicast group, commonly referred to as the Multicast Distribution Tree (MDT). Nevertheless, the scaling problems faced in the 90s still remain mostly unaddressed and worst-case projections predict indeed that routing engines could have to process and maintain in the order of 1 million active routes within the next 5 years [2].
最初定义于上世纪90年代,随着多媒体流/内容流量的日益普及和云服务的爆炸式增长,多播现在(重新)引起了人们的兴趣。事实上,多播可以节省带宽,补充缓存内容分发技术,并且从那时起,它的潜在好处已经被多次研究证实(参见示例[1])。通过组播路由,我们指的是一种分布式算法,给定组标识符,允许任何节点将组播流量路由到一组目标节点,通常称为组播组。为了实现一对多的流量分配,组播路由协议配置相关路由器在源和组播组之间构建一个(逻辑)传递树,通常称为组播分发树(multicast distribution tree, MDT)。尽管如此,90年代面临的扩展问题仍然没有得到解决,最坏情况的预测确实预测路由引擎可能不得不在未来5年内处理和维护大约100万条活动路由[2]。