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

TSFD: two stage frame dropping for scalable video transmission over data networks TSFD:用于数据网络上可扩展视频传输的两阶段帧丢弃

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

B. Zheng, Mohammed Atiquzzaman

引用次数: 9

On scheduling using parallel input-output queued crossbar switches with no speedup 无加速的并行输入输出排队交叉开关调度研究

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

S. Mneimneh, V. Sharma, Kai-Yeung Siu

{"title":"On scheduling using parallel input-output queued crossbar switches with no speedup","authors":"S. Mneimneh, V. Sharma, Kai-Yeung Siu","doi":"10.1109/HPSR.2001.923654","DOIUrl":"https://doi.org/10.1109/HPSR.2001.923654","url":null,"abstract":"We propose an efficient parallel switching architecture (PSA) that requires no speedup and guarantees bounded delay. Our architecture consists of /spl kappa/ crossbar switches operating in parallel under the control of a single scheduler, with /spl kappa/ being independent of N the number of inputs and outputs of the PSA. Arriving traffic is demultiplexed (spread) over the /spl kappa/ identical crossbar switches, switched to the correct output, and multiplexed (combined) before departing from the parallel switch. We show that by using an appropriate demultiplexing strategy at the inputs and by applying the same matching at each of the /spl kappa/ parallel crossbar switches during each slot, our scheme guarantees that the cells of a flow can be read in FIFO order from the output queues of the crossbar switches, thus eliminating the need for cell resequencing. Further, by allowing the PSA scheduler to examine the state of only the first of the /spl kappa/ parallel switches, our scheme also reduces considerably the amount of state information required at the scheduler. The scheduling algorithms that we develop are based on existing practical scheduling algorithms for crossbar switches, and have an additional communication complexity that is optimal up to a constant factor. Our approach also provides a way to build a high capacity switch/router that can support line rates that are higher than the speed at which the parallel switches themselves operate.","PeriodicalId":308964,"journal":{"name":"2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552)","volume":"4 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":"115207056","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}

引用次数: 9

Load balanced Birkhoff-von Neumann switches 负载平衡伯克霍夫-冯诺伊曼开关

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

Cheng-Shang Chang, D. Lee, Yi-Shean Jou

{"title":"Load balanced Birkhoff-von Neumann switches","authors":"Cheng-Shang Chang, D. Lee, Yi-Shean Jou","doi":"10.1109/HPSR.2001.923646","DOIUrl":"https://doi.org/10.1109/HPSR.2001.923646","url":null,"abstract":"Motivated by the need of a simple and high performance switch architecture that scales up with the speed of fiber optics, we propose a switch architecture with two-stage switching fabrics and one-stage buffering. The first stage performs load balancing, while the second stage is a Birkhoff-von Neumann input-buffered switch that performs switching for load balanced traffic. Such a switch is called the load balanced Birkhoff-von Neumann switch in this paper. The on-line complexity of the switch is O(1). It is shown that under a mild technical condition on the input traffic, the load balanced Birkhoff-von Neumann switch achieves 100% throughput as an output-buffered switch for both unicast and multicast traffic with fan-out splitting. When input traffic is bursty, we show that load balancing is very effective in reducing delay, and the average delay of the load balanced Birkhoff-von Neumann switch converges to that of an output-buffered switch under heavy load. Also, by simulations, we demonstrate that load balancing is more effective than the conflict resolution algorithm, i-SLIP, in heavy loads. When both the load balanced Birkhoff-von Neumann switch and the corresponding output-buffered switch are allocated with the same finite amount of buffer at each port, we also show that the packet loss probability in the load balanced Birkhoff-von Neumann switch is much smaller than that in an output-buffered switch when the buffer is large.","PeriodicalId":308964,"journal":{"name":"2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552)","volume":"26 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":"124409407","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}

引用次数: 107

The preplanned weighted restoration scheme 预先规划的加权恢复方案

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

A. Fumagalli, L. Valcarenghi

{"title":"The preplanned weighted restoration scheme","authors":"A. Fumagalli, L. Valcarenghi","doi":"10.1109/HPSR.2001.923600","DOIUrl":"https://doi.org/10.1109/HPSR.2001.923600","url":null,"abstract":"One of the expected benefits of wavelength division multiplexing (WDM) is the possibility to provide an optical layer (OL) with built-in capabilities to survive network component faults, e.g., fiber cut. Several schemes exist to design a reliable OL. These schemes are generally divided into protection and restoration techniques. Protection schemes reserve in advance a dedicated backup path and a wavelength that are readily available upon disruption of the working path. Restoration schemes, on the contrary, dynamically look for backup paths of spare wavelengths upon failure occurrence. The authors propose a fast and efficient path restoration scheme called preplanned weighted restoration (PWR). In the PWR scheme distinct restoration paths are precomputed at the source node during the connection setup. Upon failure, one of the preplanned paths is randomly selected depending on specific weights precalculated by the source node. The proposed scheme requires limited signaling upon failure occurrence as coordination among the source nodes involved in the restoration process is not required. Therefore, the scheme is fast and scalable in terms of number of network nodes, link or fiber capacity, and number of connections. Yet, the presented results show that the PWR scheme may considerably decrease the blocking probability of the restoration attempts when compared to other schemes such as alternate routing.","PeriodicalId":308964,"journal":{"name":"2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552)","volume":"40 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":"116928830","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}

引用次数: 16

CIXB-1: combined input-one-cell-crosspoint buffered switch CIXB-1:组合式输入-单cell-交叉点缓冲开关

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

R. Rojas-Cessa, Eiji Oki, Z. Jing, Hung-Hsiang Jonathan Chao

引用次数: 227

Parallel reservation protocols for achieving fairness in optical burst switching 实现光突发交换公平性的并行保留协议

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

Ikutaro Ogushi, S. Arakawa, Masayuki Murata, Ken-ichi Kitayama

引用次数: 30

A network processor architecture for flexible QoS control in very high-speed line interfaces 在非常高速的线路接口中实现灵活QoS控制的网络处理器体系结构

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

H. Shimonishi, T. Murase

引用次数: 16

A multiconstraint QoS routing scheme using the depth-first search method with limited crankbacks 一种基于有限曲back的深度优先搜索多约束QoS路由方案

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

Dong-Won Shin, E. Chong, H. Siegel

引用次数: 16

TD/sup 2/FQ: an integrated traffic scheduling and shaping scheme for DiffServ networks TD/sup 2/FQ:一种用于DiffServ网络的综合流量调度和整形方案

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

D. Hang, Huai-Rong Shao, Wenwu Zhu, Ya-Qin Zhang

引用次数: 17

Upper-bound for blocking probabilities of a class of optical MINs under crosstalk-free constraint 无串扰约束下一类光学微信号的阻塞概率上界

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

Xiaohong Jiang, M. Khandker, S. Horiguchi

引用次数: 4