2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552)最新文献_第5页

Design of an input-queued ATM switch supporting multicast and research on its scheduling policy 一种支持组播的输入排队ATM交换机的设计及其调度策略研究

2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552) Pub Date : 2001-05-29 DOI: 10.1109/HPSR.2001.923656

Zhai Mingyu, Zhao Qi, Luo Junzhou, Gu Guanqun

引用次数: 1

On the convergence of path vector routing protocols 路径矢量路由协议的收敛性

2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552) Pub Date : 2001-05-29 DOI: 10.1109/HPSR.2001.923649

J. Sobrinho

{"title":"On the convergence of path vector routing protocols","authors":"J. Sobrinho","doi":"10.1109/HPSR.2001.923649","DOIUrl":"https://doi.org/10.1109/HPSR.2001.923649","url":null,"abstract":"This work is motivated by previously reported experimental results on the delayed convergence of the border gateway protocol (BGP), which is the standard for inter-domain routing in the Internet. BGP is a path vector protocol. We investigate the convergence properties of path vector protocols and, in particular, their alleged effectiveness in dealing with the count-to-infinity problem that plagues conventional distance vector protocols. We assume synchronous operation of the protocols, and we study the cases when a destination comes up, the network topology changes while preserving connectedness, and a destination goes down. It is known that path vector protocols do not count to infinity. We show that they may still count to the length of the longest possible path in the network, when a destination goes down. On the other hand, when a destination comes up or the topology of the network changes, convergence time depends on the diameter of the network. The length of the longest path in a network may differ substantially from its diameter. In order to further understand the convergence properties of path vector protocols, we simulated their behavior over random graphs. We verified that path vector protocols converge much more quickly when a destination comes up than when it goes down.","PeriodicalId":308964,"journal":{"name":"2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552)","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122444417","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 6

Fair, efficient and low-latency packet scheduling using nested deficit round robin 公平，高效和低延迟数据包调度使用嵌套赤字轮询

2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552) Pub Date : 2001-05-29 DOI: 10.1109/HPSR.2001.923594

S. Kanhere, H. Sethu

引用次数: 58

A traffic control mechanism based on the load of output ports in an ATM switch 一种基于ATM交换机输出端口负载的流量控制机制

2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552) Pub Date : 2001-05-29 DOI: 10.1109/HPSR.2001.923604

Hong-soon Nam, D. Choi, Y. An, Woo-Seep Lee, Kyu-Ouk Lee, Kwon-Cheol Park

引用次数: 0

Scaling high-speed shared-memory switch fabric buffers 扩展高速共享内存交换机结构缓冲区

2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552) Pub Date : 2001-05-29 DOI: 10.1109/HPSR.2001.923647

M. Hegde, M. Naraghi-Pour

引用次数: 1

A terabit electro-optical Clos switch architecture 一种太比特电光开关结构

2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552) Pub Date : 2001-05-29 DOI: 10.1109/HPSR.2001.923644

F. Liotopoulos

引用次数: 0

An improved PIM-SM tree recovery algorithm 一种改进的PIM-SM树恢复算法

2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552) Pub Date : 2001-05-29 DOI: 10.1109/HPSR.2001.923658

T. Cicic, S. Gjessing, Oivind Kure

引用次数: 0

Use of FEC coding for real-time transport on ATM networks 在ATM网络上使用FEC编码进行实时传输

2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552) Pub Date : 2001-05-29 DOI: 10.1109/HPSR.2001.923603

R. Kurceren, J. Modestino

{"title":"Use of FEC coding for real-time transport on ATM networks","authors":"R. Kurceren, J. Modestino","doi":"10.1109/HPSR.2001.923603","DOIUrl":"https://doi.org/10.1109/HPSR.2001.923603","url":null,"abstract":"The use of forward error-control (FEC) coding has emerged as a promising approach for real-time transport over ATM networks for cell-loss recovery. The use of an FEC-based transport protocol over networks with bandwidth constraints, however, is not obvious since FEC coding introduces an overhead which can possibly cause additional cell losses which, furthermore, tend to occur in bursts. In this work, an overall performance evaluation of FEC coding is provided by incorporating the effects of channel coding on the cell-loss characteristics of the network. It is shown that FEC coding with proper selection of channel coding rate can significantly improve the throughput at a multiplexer even under correlated cell-loss situations. We also develop and illustrate an information-theoretic approach for incorporating the effects of FEC coding into well-established queueing theory calculations. This is achieved by solving separately the channel-coding problem for the modeled transmission channel and the queueing problem for the network. The performance of some specific coding designs are shown to approach the information-theoretic predictions with increasing complexity and/or delay.","PeriodicalId":308964,"journal":{"name":"2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123862001","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

A processor based high-speed longest prefix match search engine 基于处理器的高速最长前缀匹配搜索引擎

2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552) Pub Date : 2001-05-29 DOI: 10.1109/HPSR.2001.923638

M. Kobayashi, T. Murase

引用次数: 1

A novel ultra high-speed multi-layer table lookup method using TCAM for differentiated services in the Internet 一种基于TCAM的超高速多层表查找方法

2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552) Pub Date : 2001-05-29 DOI: 10.1109/HPSR.2001.923639

M. Uga, K. Shiomoto

引用次数: 1