- 1、本文档共10页,可阅读全部内容。
- 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
- 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
QoSMIC Quality of Service sensitive Multicast Internet protoCol
QoSMIC: Quality of Service sensitive Multicast Internet protoColMichalis Faloutsos Anindo Banerjea Rajesh PankajU. of Toronto U. of Toronto Qualcomm Inc.Computer Science Electr. and Comp. Eng. 6455 Lusk BlvdToronto M5S 3G4, Canada Toronto M5S 3G4, Canada San Diego CA 92121, USAmfalou@ banerjea@ rpankaj@AbstractIn this paper, we present, QoSMIC, a multicast protocolfor the Internet that supports QoS-sensitive routing, andminimizes the importance of a priori conguration decisions(such as core selection). The protocol is resource-ecient,robust,
exible, and scalable. In addition, our protocol isprovably loop-free.Our protocol starts with a resources-saving tree (SharedTree) and individual receivers switch to a QoS-competitivetree (Source-Based Tree) when necessary. In both trees, thenew destination is able to choose the most promising amongseveral paths. An innovation is that we use dynamic rout-ing information without relying on a link state exchangeprotocol to provide it. Our protocol limits the eect of pre-conguration decisions drastically, by separating the man-agement from the data transfer functions; administrativerouters are not necessarily part of the tree. This separa-tion increases the robustness, and
exibility of the protocol.Furthermore, QoSMIC is able to adapt dynamically to theconditions of the network.The QoSMIC protocol introduces several new ideas thatmake it more
exible than other protocols proposed to date.In fact, many of the other protocols, (such as YAM, PIM-SM, BGMP, CBT) can be seen as special cases of QoSMIC.This paper presents the motivation behind, and the designof QoSMIC, and provides both analytical and experimentalresults to support our claims.1 IntroductionMulticasting can be dened as the distribution of the sameinformation stream from one to many nodes concurrently. Inthe last few years, multicast routing has attracted a lot of at-tention from the networks community, since many emergingapplications are of multicast nature, such as
您可能关注的文档
- On the Group of Automorphisms of Universal Algebra and Many Sorted Algebra.pdf
- On the long term spatial segregation for a competition-diffusion system.pdf
- On the number of bound states for Schrdinger operators with operator-valued potentials.pdf
- On the mechanisms of various fretting wear modes微动磨损.pdf
- On the operator space UMD property for noncommutative Lp-spaces.pdf
- On the Polyharmonic Operator with a Periodic Potential.pdf
- On the position operator for massless particles.pdf
- On the semi-regular module and vertex operator algebras.pdf
- On the Trivial Many Sorted Algebras and Many Sorted Congruences.pdf
- On the union stabilization of two Heegaard splittings.pdf
文档评论(0)