2009 International Conference on High Performance Switching and Routing最新文献

An OBS RWA formulation for asynchronous loss-less transfer in OBS networks 一种用于OBS网络中异步无损传输的OBS RWA公式

2009 International Conference on High Performance Switching and Routing Pub Date : 2009-06-22 DOI: 10.1109/HPSR.2009.5307423

T. Coutelen, G. Hébuterne, B. Jaumard

{"title":"An OBS RWA formulation for asynchronous loss-less transfer in OBS networks","authors":"T. Coutelen, G. Hébuterne, B. Jaumard","doi":"10.1109/HPSR.2009.5307423","DOIUrl":"https://doi.org/10.1109/HPSR.2009.5307423","url":null,"abstract":"Optical Burst Switching (OBS) has been proposed to increase the resource utilization achieved by Optical Circuit Switching (OCS), which is impaired by its coarse granularity. A crucial step toward OBS maturity deals with the feature of lossless guaranteed transfers. No contention resolution mechanism, even combined with efficient pro-active mechanisms has been able to provide such a guarantee so far. In this paper, we investigate further the “offset based priority” and the “streamline effect” to identify flow isolation patterns. We then propose a specific medium access protocol in order to preserve the isolation of transit bursts over ingress bursts. The isolation patterns are translated into an MILP optimization OBS model that performs routing and wavelength assignment (RWA-OBS). Using the routes obtained with RWA-OBS guarantees asynchronous loss-less transfers. It preserves the statistical multiplexing potential and the asynchronous nature of OBS, and thus addresses the drawbacks of WR-OBS and SOBS which were recently introduced in polymorphous OBS (POBS) (Qiao et al. 2006). Experimental results show the benefits of RWA-OBS over WR-OBS in terms of grade of service, while sidestepping the synchronization issues of SOBS with similar grade of service.","PeriodicalId":251545,"journal":{"name":"2009 International Conference on High Performance Switching and Routing","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125187203","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

Beyond single-box SW router architectures 超越单箱SW路由器架构

2009 International Conference on High Performance Switching and Routing Pub Date : 2009-06-22 DOI: 10.1109/HPSR.2009.5307442

R. Bolla, R. Bruschi, G. Lamanna, A. Ranieri

引用次数: 2

Optimal capacity allocation for load balanced shortest path routing 负载均衡最短路径路由的最优容量分配

2009 International Conference on High Performance Switching and Routing Pub Date : 2009-06-22 DOI: 10.1109/HPSR.2009.5307437

Marija Antic, A. Smiljanic

引用次数: 3

ILP-based design of survivable broadcast trees 基于ilp的可生存广播树设计

2009 International Conference on High Performance Switching and Routing Pub Date : 2009-06-22 DOI: 10.1109/HPSR.2009.5307443

Minjing Mao, Bin Wu, K. Yeung

引用次数: 0

Runtime resource allocation in multi-core packet processing systems 多核包处理系统的运行时资源分配

2009 International Conference on High Performance Switching and Routing Pub Date : 2009-06-22 DOI: 10.1109/HPSR.2009.5307422

Qiang Wu, T. Wolf

引用次数: 8

A unified approach for Multiple Multicast Tree Construction and Max-Min Fair rate allocation 一种统一的多组播树构造和最大最小公平速率分配方法

2009 International Conference on High Performance Switching and Routing Pub Date : 2009-06-22 DOI: 10.1109/HPSR.2009.5307420

R. Maniyar, P. Ghosh, Arunabha Sen

{"title":"A unified approach for Multiple Multicast Tree Construction and Max-Min Fair rate allocation","authors":"R. Maniyar, P. Ghosh, Arunabha Sen","doi":"10.1109/HPSR.2009.5307420","DOIUrl":"https://doi.org/10.1109/HPSR.2009.5307420","url":null,"abstract":"Multicast communication is an efficient method of data transmission and distribution among a group, especially when network resources are inadequate and needs to be shared. Fair share of network resources, such as, bandwidth, is desirable in such cases. Although there has been an intensive research effort to design protocols and construct multicast routing graphs for a single multicast group, construction of multiple multicast groups and the fair allocation of network resources remains virtually unexplored. In this paper, a unified approach for the Multiple Multicast Tree Construction and Rate Allocation (MMTCRA) problem is addressed. The MMTCRA problem has been defined as an optimization problem with an objective of finding a Max-Min Fair rate allocation among the multiple multicast groups that co-exist in the network subject to the link-capacity constraints. The problem is proved to be NP-Complete. A Mixed Integer Linear Program (MILP) is formulated to achieve the optimal solution for this problem. A heuristic is proposed to solve the MMTCRA problem in polynomial time. The quality of the heuristic is evaluated by comparing the solution with the optimal solution for several randomly generated networks. A metric for user satisfaction, USat, has been defined in the paper. Experimental results show that 81% solutions obtained from heuristic have optimal USat, 95% solutions obtained from heuristic have optimal minimum allocated rate and the standard deviation of solutions are within 10% of optimal solutions.","PeriodicalId":251545,"journal":{"name":"2009 International Conference on High Performance Switching and Routing","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121542370","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

FlashLook: 100-Gbps hash-tuned route lookup architecture FlashLook: 100 gbps哈希调优路由查找架构

2009 International Conference on High Performance Switching and Routing Pub Date : 2009-06-22 DOI: 10.1109/HPSR.2009.5307429

M. Bando, N. S. Artan, H. J. Chao

{"title":"FlashLook: 100-Gbps hash-tuned route lookup architecture","authors":"M. Bando, N. S. Artan, H. J. Chao","doi":"10.1109/HPSR.2009.5307429","DOIUrl":"https://doi.org/10.1109/HPSR.2009.5307429","url":null,"abstract":"Since the recent increase in the popularity of services that require high bandwidth, such as high-quality video and voice traffic, the need for 100-Gbps equipment has become a reality. In particular, next generation routers are needed to support 100-Gbps worst-case IP lookup throughput for large IPv4 and IPv6 routing tables, while keeping the cost and power consumption low. It is challenging for today's state-of-the-art IP lookup schemes to satisfy all of these requirements. In this paper, we propose FlashLook, a low-cost, high-speed route lookup architecture scalable to large routing tables. FlashLook allows the use of low-cost DRAMs, while achieving high throughput. Traditionally, DRAMs are not known for their high throughput due to their high latency. However, FlashLook architecture achieves high-throughput with DRAMs by using the DRAM bursts efficiently to hide DRAM latency. FlashLook has a data structure that can be evenly partitioned into DRAM banks, a novel hash method, HashTune to smooth the hash table distribution and a data compaction method called verify bit aggregation to reduce memory usage of the hash table. These features of the FlashLook results in better DRAM memory utilization and less number of DRAM accesses per lookup. FlashLook achieves 100-Gbps worst-case throughput while simultaneously supporting 2M prefixes for IPv4 and 256k prefixes for IPv6 using one FPGA and 9 DRAM chips. FlashLook provides fast real-time updates that can support updates according to real update statistics.","PeriodicalId":251545,"journal":{"name":"2009 International Conference on High Performance Switching and Routing","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114666715","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

Empowering Chord DHT overlays 授权和弦DHT覆盖

2009 International Conference on High Performance Switching and Routing Pub Date : 2009-06-22 DOI: 10.1109/HPSR.2009.5307418

S. Ktari, Artur Hecker, H. Labiod

引用次数: 2

Rearranging algorithms for log2(N, 0, p) switching networks with even number of stages 偶级log2(N, 0, p)交换网络的重新排序算法

2009 International Conference on High Performance Switching and Routing Pub Date : 2009-06-22 DOI: 10.1109/HPSR.2009.5307430

W. Kabaciński, J. Kleban, M. Michalski, M. Żal, A. Pattavina, G. Maier

引用次数: 10

Update-aware Controlled Prefix Expansion for fast IP lookups 更新感知控制前缀扩展快速IP查找

2009 International Conference on High Performance Switching and Routing Pub Date : 2009-06-22 DOI: 10.1109/HPSR.2009.5307416

Yeim-Kuan Chang, Yung-Chieh Lin, Kuan-Ying Ho

{"title":"Update-aware Controlled Prefix Expansion for fast IP lookups","authors":"Yeim-Kuan Chang, Yung-Chieh Lin, Kuan-Ying Ho","doi":"10.1109/HPSR.2009.5307416","DOIUrl":"https://doi.org/10.1109/HPSR.2009.5307416","url":null,"abstract":"In high performance routers design, fast IP address lookup is always a challenge. In order to obtain fast lookup speed, multi-bit tries are often used to represent the routing tables [1,2,3,6]. The drawbacks of multi-bit tries are the large memory usage and extensive update cost. To reduce the memory usage of multi-bit tries, Srinivasan and Varghese proposed a scheme called Controlled Prefix Expansion (CPE) [2] that uses the dynamic programming technique to obtain the optimal multi-bit tries in terms of memory usage. Furthermore, current backbone routers usually run the Border Gateway Protocol (BGP). BGP may cause a few hundred of updates per second. To make multi-bit tries adequate to these updates, a series of multi-bit tries nodes need to be modified. Since these updates can seriously affect the lookup speed, we need to minimize these update cost. However, CPE does not concern this issue. In this paper, we explore the optimization issue in terms of the update cost. We want to find an update-optimal multi-bit tries that still have the efficiency of lookup speed and memory usage. Contrast to CPE, our solutions achieve a 26% reduction of the update overhead and improve 38% of the search speed. Besides, we also examine our schemes in IPv6 routing tables. The experimental results show that our scheme can also scale well in IPv6.","PeriodicalId":251545,"journal":{"name":"2009 International Conference on High Performance Switching and Routing","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126018803","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}

引用次数: 3