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}
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.