发布求助
文献互助 智能选刊 最新文献

2006 Workshop on High Performance Switching and Routing最新文献

筛选
英文 中文
Practical algorithms for multicast support in input queued switches 输入队列交换机中支持组播的实用算法
2006 Workshop on High Performance Switching and Routing Pub Date : 2006-10-16 DOI: 10.1109/HPSR.2006.1709704
A. Bianco, P. Giaccone, C. Piglione, Sonia Sessa
{"title":"Practical algorithms for multicast support in input queued switches","authors":"A. Bianco, P. Giaccone, C. Piglione, Sonia Sessa","doi":"10.1109/HPSR.2006.1709704","DOIUrl":"https://doi.org/10.1109/HPSR.2006.1709704","url":null,"abstract":"This paper deals with multicast flow support in NtimesN input queued switch architectures. A practical approach to support multicast traffic is presented, assuming that O(N) queues are available at each input port. The focus is on dynamic queueing policies, where, at each input port, multicast flows are assigned to one among the available queues when flows become active: flows are assigned to queues according to switch queue status and, possibly, to flow information. We discuss queueing assignments, scheduling algorithms and flow activity definition models. We explain why dynamic queueing disciplines may outperform static policies, and we show that, even in the most favorable conditions for static policies, they provide comparable performance","PeriodicalId":274390,"journal":{"name":"2006 Workshop on High Performance Switching and Routing","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126433674","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}
引用次数: 22
Routing with deceptive information 带有欺骗性信息的路由
2006 Workshop on High Performance Switching and Routing Pub Date : 2006-10-16 DOI: 10.1109/HPSR.2006.1709712
C. Casetti, M. Mellia, M. Munafò, C. Racca
{"title":"Routing with deceptive information","authors":"C. Casetti, M. Mellia, M. Munafò, C. Racca","doi":"10.1109/HPSR.2006.1709712","DOIUrl":"https://doi.org/10.1109/HPSR.2006.1709712","url":null,"abstract":"Routing protocols based on the link-state paradigm notoriously suffer from the problem of stale information in highly dynamic traffic scenarios, leading to an overall loss in routing efficiency. Solutions are not easy to come by, since an increase in the frequency of link state advertisements is equally dangerous: route flapping (i.e., periodic route changes that force traffic to be routed through an alternately underloaded set of paths) is one of the main drawbacks. In this paper we propose a novel, yet simple link state mechanism that may deliberately advertise false link state information with the purpose of stabilizing the routing, while keeping a high network utilization","PeriodicalId":274390,"journal":{"name":"2006 Workshop on High Performance Switching and Routing","volume":"284 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132027338","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}
引用次数: 0
Divide-and-conquer: a scheme for IPv6 address longest prefix matching 分而治之:IPv6地址最长前缀匹配方案
2006 Workshop on High Performance Switching and Routing Pub Date : 2006-10-16 DOI: 10.1109/HPSR.2006.1709678
Zhenqiang Li, Xiaohong Deng, Hongxiao Ma, Yan Ma
{"title":"Divide-and-conquer: a scheme for IPv6 address longest prefix matching","authors":"Zhenqiang Li, Xiaohong Deng, Hongxiao Ma, Yan Ma","doi":"10.1109/HPSR.2006.1709678","DOIUrl":"https://doi.org/10.1109/HPSR.2006.1709678","url":null,"abstract":"Longest prefix matching (LPM) is a challenging subject because of the increasing routing table size, the increasing link speed, and the increasing Internet traffic with decreasing packet size. With the advent of IPv6, it requires reconsideration of the previous schemes particularly designed for IPv4. We introduce the first algorithm that we are aware of to employ divide-and-conquer method for IPv6 address 128-bit-long LPM. The algorithm divides an IPv6 address into 8 chunks of 16 bits each and the chunks are reduced recursively through several tunable phases according to the tradeoff between lookup performance and memory consumption. After exhaustive examination of IPv6 address allocation policies and 6 latest global backbone IPv6 BGP routing tables, we put forward some refinements to the basic scheme. The scheme is suitable for both software and hardware implementation. In measurements performed on a 1.1 GHz AMD Athlon machine using the real world IPv6 BGP routing tables, we can forward over several million IPv6 packets per second. When implemented in hardware adopting parallel chunk lookup and pipeline phase lookup architecture, the proposed scheme can achieve one IPv6 LPM lookup per memory access","PeriodicalId":274390,"journal":{"name":"2006 Workshop on High Performance Switching and Routing","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133045319","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}
引用次数: 8
Hybrid deflection and retransmission routing schemes for OBS networks OBS网络的混合偏转和重传路由方案
2006 Workshop on High Performance Switching and Routing Pub Date : 2006-10-16 DOI: 10.1109/HPSR.2006.1709739
Son-Hong Ngo, Xiaohong Jian, S. Horiguchi
{"title":"Hybrid deflection and retransmission routing schemes for OBS networks","authors":"Son-Hong Ngo, Xiaohong Jian, S. Horiguchi","doi":"10.1109/HPSR.2006.1709739","DOIUrl":"https://doi.org/10.1109/HPSR.2006.1709739","url":null,"abstract":"Deflection routing is an attractive scheme for resolving the burst contention problem in optical burst switching (OBS) networks and retransmission of rejected packets is widely accepted as a basic mechanism for guaranteeing the robust operation of IP networks. In this paper, we explore the potential benefits of combining the deflection routing and burst retransmission schemes in OBS networks. We first demonstrate that if these two schemes are not combined appropriately, the network performance may be significantly degraded. We then suggest a novel approach to combining deflection routing and burst retransmission, such that the resulting hybrid algorithm can always guarantee a better overall performance in terms of burst loss and end-to-end delay than that of both the conventional pure deflection routing and the pure retransmission scheme, as verified by the simulation results based on the ns-2 simulator and two typical network topologies","PeriodicalId":274390,"journal":{"name":"2006 Workshop on High Performance Switching and Routing","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124145924","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}
引用次数: 23
Delivering 100% throughput in a buffered crossbar with round robin scheduling 在具有轮循调度的缓冲交叉栏中提供100%的吞吐量
2006 Workshop on High Performance Switching and Routing Pub Date : 2006-10-16 DOI: 10.1109/HPSR.2006.1709743
Michael Stübert Berger
{"title":"Delivering 100% throughput in a buffered crossbar with round robin scheduling","authors":"Michael Stübert Berger","doi":"10.1109/HPSR.2006.1709743","DOIUrl":"https://doi.org/10.1109/HPSR.2006.1709743","url":null,"abstract":"Buffered crossbars with virtual output queuing are considered an alternative to bufferless crossbars mainly because the latter requires a complex global scheduling algorithm that matches input with output. Buffered crossbars require only simple schedulers that operate independently for each output crosspoint queue column and independently for each port card. In this paper, fluid-model techniques will be utilized to show that the necessary and sufficient speedup for a NxN buffered crossbar with 1-cell crosspoint buffers is 2-1/N to deliver 100% throughput. Round robin scheduling is assumed, both among virtual output queues in port cards and among crosspoint buffers in output columns","PeriodicalId":274390,"journal":{"name":"2006 Workshop on High Performance Switching and Routing","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124443891","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}
引用次数: 17
Maximum lifetime routing in wireless sensor network using realistic battery model 基于真实电池模型的无线传感器网络最大寿命路由
2006 Workshop on High Performance Switching and Routing Pub Date : 2006-10-16 DOI: 10.1109/HPSR.2006.1709698
K. Padmanabh, R. Roy
{"title":"Maximum lifetime routing in wireless sensor network using realistic battery model","authors":"K. Padmanabh, R. Roy","doi":"10.1109/HPSR.2006.1709698","DOIUrl":"https://doi.org/10.1109/HPSR.2006.1709698","url":null,"abstract":"Capacity of the battery is used to be specified in Ampere-Hour. So far, while designing a routing protocol people are considering this capacity of battery like water in a tank. That is, if C is the capacity of tank and water drawn out of it with rate R then total time to evacuate is T=C/R. On contrary, the batteries show rate capacity effect. That is, capacity of a battery decreases with increase in discharge current. Thus lifetime of the battery also decreases significantly with increase in discharge current. To the best of our knowledge this effect of a realistic battery model has never been considered while designing a routing protocol. Thus practically a battery gives a lifetime that is very less in comparison to what is theoretically estimated. We are presenting here two types of power aware algorithms to overcome this issue. In our algorithm rate capacity effect, minimum drain rate and minimum transmission power constraints are exploited altogether as a metric to design routing protocol, which minimizes rate capacity effect and ultimately gives improved lifetime of the sensor network","PeriodicalId":274390,"journal":{"name":"2006 Workshop on High Performance Switching and Routing","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128620377","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}
引用次数: 7
Forwarding model of backplane Ethernet for open architecture router 开放架构路由器的背板以太网转发模型
2006 Workshop on High Performance Switching and Routing Pub Date : 2006-10-16 DOI: 10.1109/HPSR.2006.1709672
T. Hamano, M. Inami, M. Aoki, K. Habara, S. Chaki
{"title":"Forwarding model of backplane Ethernet for open architecture router","authors":"T. Hamano, M. Inami, M. Aoki, K. Habara, S. Chaki","doi":"10.1109/HPSR.2006.1709672","DOIUrl":"https://doi.org/10.1109/HPSR.2006.1709672","url":null,"abstract":"Diversified IP services have recently required flexible and scalable edge routers to support advanced service functions such as IPsec VPN and application layer firewalls. However, those functions cannot be integrated into existing routers easily, and this prevents required routers from becoming available. A common forwarding model of backplane Ethernet for a router supporting separate control, line, and service cards is proposed in this paper. This model enables an open architecture router that has multivendor control, line, and service cards, where packets are forwarded among them based on a common method of backplane routing. It supports inline, host, and tap service cards. We propose an efficient forwarding decision-making algorithm in terms of the required speed and efficiency of table lookup and demonstrate that the method requires half the table lookup processing resources compared with those of a naive method","PeriodicalId":274390,"journal":{"name":"2006 Workshop on High Performance Switching and Routing","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131313120","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
Performance study of various packet scheduling algorithms for variable-packet-length feedback type WDM optical packet switches 变包长反馈型WDM光分组交换机各种分组调度算法的性能研究
2006 Workshop on High Performance Switching and Routing Pub Date : 2006-10-16 DOI: 10.1109/HPSR.2006.1709708
C. Chang, Shou-Kuo Shao, M. R. Perati, Jingshown Wu
{"title":"Performance study of various packet scheduling algorithms for variable-packet-length feedback type WDM optical packet switches","authors":"C. Chang, Shou-Kuo Shao, M. R. Perati, Jingshown Wu","doi":"10.1109/HPSR.2006.1709708","DOIUrl":"https://doi.org/10.1109/HPSR.2006.1709708","url":null,"abstract":"In this paper, we investigate the switching performance of feedback (FB) type wavelength division multiplexing (WDM) optical packet switches (OPSes) with various packet scheduling algorithms that determine the buffer entrance sequence of packets arriving at the input end of the switches. Five different packet scheduling algorithms have been applied to the FB type WDM OPSes. It is observed that OPSes incorporated with shortest packets first (SF) and oldest packets first (OF) algorithms will yield better switching performance. Next, we observe that packet scheduling algorithms have stronger influence on switching performance when they are applied to the primary output buffers than to the re-circulated buffers. Moreover, we demonstrate that by appropriately employing the suitable packet scheduling algorithms in the primary output buffers and re-circulated buffers, the benefits of packet scheduling algorithms could be significant. Hence, the switching performance of FB type WDM OPSes could be greatly improved simply by employing the appropriate packet scheduling algorithms","PeriodicalId":274390,"journal":{"name":"2006 Workshop on High Performance Switching and Routing","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121558220","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}
引用次数: 4
Markers-based space decomposition algorithm: a new algorithm for multi-fields packet classification 基于标记的空间分解算法:一种新的多字段分组分类算法
2006 Workshop on High Performance Switching and Routing Pub Date : 2006-10-16 DOI: 10.1109/HPSR.2006.1709679
Ons Jelassi, O. Paul
{"title":"Markers-based space decomposition algorithm: a new algorithm for multi-fields packet classification","authors":"Ons Jelassi, O. Paul","doi":"10.1109/HPSR.2006.1709679","DOIUrl":"https://doi.org/10.1109/HPSR.2006.1709679","url":null,"abstract":"Packet classification is a central function in several network applications such as firewalls and QoS-enhanced routers. Several schemes were proposed for fast packet classification, but few ones support incremental updates. In this paper, we present a new multi-fields packet classification algorithm and show its advantages compared to previous proposed algorithms. We present performance measurements using a free benchmark developed at Washington University. We show how this algorithm performs improved search times without any limitation in terms of incremental updates","PeriodicalId":274390,"journal":{"name":"2006 Workshop on High Performance Switching and Routing","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122462775","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
CRRD-OG: a packet dispatching algorithm with open grants for three-stage buffered clos-network switches CRRD-OG:面向三级缓冲封闭式网络交换机的开放授权分组调度算法
2006 Workshop on High Performance Switching and Routing Pub Date : 2006-10-16 DOI: 10.1109/HPSR.2006.1709727
J. Kleban, A. Wieczorek
{"title":"CRRD-OG: a packet dispatching algorithm with open grants for three-stage buffered clos-network switches","authors":"J. Kleban, A. Wieczorek","doi":"10.1109/HPSR.2006.1709727","DOIUrl":"https://doi.org/10.1109/HPSR.2006.1709727","url":null,"abstract":"The clos-network architecture is well-known and widely described in the literature. It is very attractive because of its scalability. The clos-network in packet switching systems adopt the use of packet dispatching algorithms to avoid packet contention, which may occur while a packet is being routed in a switch fabric. The complexity of packet scheduling may be relaxed by providing buffers in the first and third stages in a three-stage clos network. Different dispatching schemes for buffered clos-network switches that provide 100% throughput under uniform traffic were proposed in many papers. In this paper the idea of open grants is introduced and an algorithm called concurrent round-robin dispatching with open grants (CRRD-OG) for three-stage buffered clos-network switches is proposed. This algorithm is an improved version of CRRD scheme by implementing an open grant rules and gives better performance results. The performance of CRRD-OG algorithm was evaluated and compared with results obtained for CRRD and CMSD (concurrent master-slave round-robin dispatching) schemes","PeriodicalId":274390,"journal":{"name":"2006 Workshop on High Performance Switching and Routing","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117299714","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}
引用次数: 26
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信