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

A new scalable and efficient packet scheduling method in high-speed packet switch networks 高速分组交换网络中一种新的可扩展、高效的分组调度方法

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

Cheng Shan

引用次数: 5

Comparison of routing and wavelength assignment algorithms for optical networks 光网络路由和波长分配算法的比较

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

S. Ohta, A. Greca

引用次数: 8

QoS guaranteed input queued scheduling algorithms with low delay 低时延、有QoS保证的输入队列调度算法

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

Jinhui Li, N. Ansari

引用次数: 4

BPP: a protocol for exchanging pricing information between autonomous systems BPP:用于在自治系统之间交换定价信息的协议

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

V. Oberle, H. Ritter, Klaus Wehrle

引用次数: 2

Design of wavelength-convertible optical switches for the all-optical next-generation Internet 面向下一代全光互联网的波长可转换光交换机设计

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

X. Hou, H. Mouftah

引用次数: 7

A parallel-polled virtual output queued switch with a buffered crossbar 具有缓冲交叉条的并行轮询虚拟输出队列交换机

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

K. Yoshigoe, Ken Christensen

引用次数: 84

Efficient routing using NIx-Vectors 使用NIx-Vectors的高效路由

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

G. Riley, M. Ammar, E. Zegura

{"title":"Efficient routing using NIx-Vectors","authors":"G. Riley, M. Ammar, E. Zegura","doi":"10.1109/HPSR.2001.923667","DOIUrl":"https://doi.org/10.1109/HPSR.2001.923667","url":null,"abstract":"We introduce the concept of Neighbor-Index Vector (NIx-Vector) routing which gives efficient and consistent routing of packets in Internet routers. A NIx-Vector is a compact representation of a routing path, which is small enough to be included in a packet header. We show how, by including the routing information in the packet header, routing decisions can be made in O(1) time at each router, with no caching or state in the routers (other than the existing routing tables). The creation of a NIx-Vector for a source and destination pair requires one round trip time, but once the NIx-Vector is known, it can be retained by the source and reused indefinitely with no further setup time required (or until it becomes no longer valid, which is easily detected). In addition to O(1) routing decisions, the use of NIx-Vectors to record and specify routes has other benefits. NIx-Vectors provide for route pinning which is beneficial for reservation protocols and mitigates the effect of routing flaps on long lived flows. A variation of NIx-Vectors can insure symmetrical routes from a source to a destination and back to the source, which is also beneficial to some reservation protocols. We give a complete description of how NIx-Vectors are created and used in Internet routers; and give empirical data showing the number of bits required to represent NIx-Vectors for typical Internet paths.","PeriodicalId":308964,"journal":{"name":"2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552)","volume":"16 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":"131090134","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}

引用次数: 35

Study of scalability properties of two LP-based algorithms for traffic engineering in a flat differentiated services network 扁平差别化业务网络中两种基于lp的流量工程算法的可扩展性研究

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

S. Van den Bosch, P. de La Vallee-Poussin, G. Van Hoey, H. de Neve, G. Petit

引用次数: 1

Parallel packet forwarding architecture using ATM switch core for scalable performance 并行数据包转发架构，使用ATM交换核心，可扩展性能

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

K. Shiomoto, M. Omotani, M. Uga, S. Shimizu

引用次数: 0

Scalable configuration of RED queue parameters RED队列参数的可扩展配置

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

K. Chandrayana, B. Sikdar, S. Kalyanaraman

{"title":"Scalable configuration of RED queue parameters","authors":"K. Chandrayana, B. Sikdar, S. Kalyanaraman","doi":"10.1109/HPSR.2001.923629","DOIUrl":"https://doi.org/10.1109/HPSR.2001.923629","url":null,"abstract":"Active queue management policies and in particular random early drop (RED) are being pushed as additional mechanisms in Internet routers to control congestion and keep network utilization high. RED's performance is highly dependent on the settings of its control parameters. However, no firm guidelines exist on configuring RED parameters and the current suggestions fail to provide the desired performance scalability. We propose a mechanism to configure RED parameters based on evaluating the expected instantaneous length of a M/sup x//M/1/K queue. We show that by setting the RED parameters min/sub th/ and max/sub th/ to lie on either side of this expected queue length, we can ensure that the queue is not underutilized and flows cut their rates before the onset of congestion. This setting also allows the operating point to perform satisfactorily over a wide range of flow counts thereby allowing for a higher degree of scalability. We also show that our proposed mechanism increases the queue goodput, reduces losses and timeouts and increases the fairness when compared to existing guidelines. Our proposals have been verified using extensive simulations.","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":"130339981","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}

引用次数: 14