基于QoS的多播协议SRSVP的分层路径QoS

T. Sekiguchi, Youichi Koyama, Kenji Fujikawa, Yasuo Okabe, K. Iwama
{"title":"基于QoS的多播协议SRSVP的分层路径QoS","authors":"T. Sekiguchi, Youichi Koyama, Kenji Fujikawa, Yasuo Okabe, K. Iwama","doi":"10.1109/HPSR.2002.1024259","DOIUrl":null,"url":null,"abstract":"In this paper, we argue a method to collect information of each existing multicast flow on hierarchical networks. SRSVP, a QoS-based multicast routing protocol, is designed as it collects flow-specific information, called PQ by putting it into signaling messages, so that the derived QoS path becomes more efficient. HQLIP, an underlying QoS-based unicast routing protocol, handles a network as a hierarchical structure for scalable QoS-based routing. We have designed and implemented an algorithm to compute PQ (hierarchical PQ) corresponding to aggregated link information on hierarchical networks for SRSVP to compute better QoS paths. We have attempted to make the algorithm more efficient by examining behaviors of routers.","PeriodicalId":180090,"journal":{"name":"Workshop on High Performance Switching and Routing, Merging Optical and IP Technologie","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Hierarchical path QoS on a QoS-based multicast protocol SRSVP\",\"authors\":\"T. Sekiguchi, Youichi Koyama, Kenji Fujikawa, Yasuo Okabe, K. Iwama\",\"doi\":\"10.1109/HPSR.2002.1024259\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we argue a method to collect information of each existing multicast flow on hierarchical networks. SRSVP, a QoS-based multicast routing protocol, is designed as it collects flow-specific information, called PQ by putting it into signaling messages, so that the derived QoS path becomes more efficient. HQLIP, an underlying QoS-based unicast routing protocol, handles a network as a hierarchical structure for scalable QoS-based routing. We have designed and implemented an algorithm to compute PQ (hierarchical PQ) corresponding to aggregated link information on hierarchical networks for SRSVP to compute better QoS paths. We have attempted to make the algorithm more efficient by examining behaviors of routers.\",\"PeriodicalId\":180090,\"journal\":{\"name\":\"Workshop on High Performance Switching and Routing, Merging Optical and IP Technologie\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-11-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Workshop on High Performance Switching and Routing, Merging Optical and IP Technologie\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/HPSR.2002.1024259\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Workshop on High Performance Switching and Routing, Merging Optical and IP Technologie","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HPSR.2002.1024259","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

本文提出了一种收集分层网络中各现有组播流信息的方法。SRSVP是一种基于QoS的多播路由协议,它被设计成通过将特定流的信息(称为PQ)放入信令消息中来收集,从而使派生的QoS路径变得更有效。HQLIP是一种底层的基于qos的单播路由协议,它将网络作为可扩展的基于qos的路由的分层结构来处理。我们设计并实现了一种计算分层网络中聚合链路信息对应的PQ(分层PQ)的算法,用于SRSVP计算更好的QoS路径。我们试图通过检查路由器的行为来提高算法的效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Hierarchical path QoS on a QoS-based multicast protocol SRSVP
In this paper, we argue a method to collect information of each existing multicast flow on hierarchical networks. SRSVP, a QoS-based multicast routing protocol, is designed as it collects flow-specific information, called PQ by putting it into signaling messages, so that the derived QoS path becomes more efficient. HQLIP, an underlying QoS-based unicast routing protocol, handles a network as a hierarchical structure for scalable QoS-based routing. We have designed and implemented an algorithm to compute PQ (hierarchical PQ) corresponding to aggregated link information on hierarchical networks for SRSVP to compute better QoS paths. We have attempted to make the algorithm more efficient by examining behaviors of routers.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Next generation carriers Internet backbone node architecture (MSN Type-X) Multipath packet switch using packet bundling Permutation in rearrangeable nonblocking optical MINs with zero first-order switching-element-crosstalk End-to-end delay differentiation of IP traffic aggregates using priority queuing models Delay and throughput analysis of the high speed variable length self-routing packet switch
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1