2011 IEEE 12th International Conference on High Performance Switching and Routing最新文献_第4页

OOK Q-factor degradation in scalable optical switches 可扩展光开关中的q因子退化

2011 IEEE 12th International Conference on High Performance Switching and Routing Pub Date : 2011-07-04 DOI: 10.1109/HPSR.2011.5986012

Qing Xu, H. Rastegarfar, Yousra Ben M'Sallem, S. Larochelle, A. Leon-Garcia, L. Rusch

{"title":"OOK Q-factor degradation in scalable optical switches","authors":"Qing Xu, H. Rastegarfar, Yousra Ben M'Sallem, S. Larochelle, A. Leon-Garcia, L. Rusch","doi":"10.1109/HPSR.2011.5986012","DOIUrl":"https://doi.org/10.1109/HPSR.2011.5986012","url":null,"abstract":"All-optical switching has been proposed to overcome the limitations of electronic switches in terms of scalability, speed, footprint, and power consumption. A key passive optical component to bypass electronic processing limitations is the arrayed waveguide grating (AWG). Switch architectures combining wavelength converters and fiber delay lines provide tunable routing and contention resolution when used with AWGs. An AWG passively routes either single or multiple input port wavelengths to its output ports. A single wavelength per port strategy reduces crosstalk within the AWG, but drastically increases the dimensionality of the device. Physical constraints on AWG design limit the port number for the foreseeable future to under 100. To scale optical switches to emerging network requirements, we can use multiple wavelengths per port. In this paper we examine one multiple wavelength per port architecture and quantify the physical layer impairments due not only to the AWG crosstalk, but also Q-factor degradation due to multiple wavelength conversions, and as a function of the number of recirculations in the contention resolution delay lines. While previous work has addressed this issue in terms of accumulated loss, we focus on accumulated relative intensity noise and amplified spontaneous emission.","PeriodicalId":269137,"journal":{"name":"2011 IEEE 12th International Conference on High Performance Switching and Routing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133444942","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

VAIPA: A video-aware internet protocol architecture VAIPA:一种视频感知互联网协议架构

2011 IEEE 12th International Conference on High Performance Switching and Routing Pub Date : 2011-07-04 DOI: 10.1109/HPSR.2011.5986017

V. Murcia, Meli Delgado, T. R. Vargas, J. C. Guerri, J. Antich

引用次数: 4

To switch on or off: A simple case study on energy efficiency in IP-over-WDM networks 打开或关闭:IP-over-WDM网络能源效率的简单案例研究

2011 IEEE 12th International Conference on High Performance Switching and Routing Pub Date : 2011-07-04 DOI: 10.1109/HPSR.2011.5986006

M. Caria, M. Chamania, A. Jukan

引用次数: 15

Using hardware classification to improve PC-based OpenFlow switching 利用硬件分类改进基于pc机的OpenFlow交换

2011 IEEE 12th International Conference on High Performance Switching and Routing Pub Date : 2011-07-04 DOI: 10.1109/HPSR.2011.5986029

Voravit Tanyingyong, M. Hidell, Peter Sjödin

引用次数: 42

Beyond RED: Periodic Early Detection for on-chip buffer memories in network elements 超越RED:网络元件中片上缓冲存储器的周期性早期检测

2011 IEEE 12th International Conference on High Performance Switching and Routing Pub Date : 2011-07-04 DOI: 10.1109/HPSR.2011.5986016

A. Francini

{"title":"Beyond RED: Periodic Early Detection for on-chip buffer memories in network elements","authors":"A. Francini","doi":"10.1109/HPSR.2011.5986016","DOIUrl":"https://doi.org/10.1109/HPSR.2011.5986016","url":null,"abstract":"The scalability and energy efficiency of future network equipment will critically depend on the ability to confine the memories that implement the packet buffers within the same traffic management chips that process and forward the packets. Despite massive research efforts aimed at trimming its demand of large buffers for the accommodation of TCP traffic, the bandwidth-delay product (BDP) rule remains to-date the dominant criterion for the sizing of packet buffers in commercial network elements, and arguably the only cause for their implementation in off-chip memories. Only the lack of a valid alternative justifies the lasting popularity of conventional buffer management methods for TCP traffic such as Tail Drop and Random Early Detection (RED), which fail to reconcile small buffer sizes with high-end throughput performance. Our contribution is twofold. First, we show that the RED algorithm is intrinsically flawed because of the way it maps buffer occupancy levels onto packet drop probabilities. Second, we introduce Periodic Early Detection (PED), a buffer management scheme with touchless configuration that sustains 100% link utilization using only 2.5% of the memory required by the BDP rule. While a more comprehensive study of PED's properties is in order, the clear superiority of the scheme under common benchmarking setups places it at the forefront of the candidate enablers for the on-chip implementation of buffer memories.","PeriodicalId":269137,"journal":{"name":"2011 IEEE 12th International Conference on High Performance Switching and Routing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129941264","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

FPGA controller for rearrangeable Log2(N, 0, p) fabrics with an even number of stages 用于具有偶数级的可重新排列Log2(N, 0, p)结构的FPGA控制器

2011 IEEE 12th International Conference on High Performance Switching and Routing Pub Date : 2011-07-04 DOI: 10.1109/HPSR.2011.5986003

W. Kabaciński, M. Michalski

引用次数: 4

A new ranked Hopfield neural networks approach to QoS parallel scheduling for WDM optical interconnection system 基于Hopfield神经网络的WDM光互联系统QoS并行调度

2011 IEEE 12th International Conference on High Performance Switching and Routing Pub Date : 2011-07-04 DOI: 10.1109/HPSR.2011.5986038

P. Tien, Bo-Yu Ke

{"title":"A new ranked Hopfield neural networks approach to QoS parallel scheduling for WDM optical interconnection system","authors":"P. Tien, Bo-Yu Ke","doi":"10.1109/HPSR.2011.5986038","DOIUrl":"https://doi.org/10.1109/HPSR.2011.5986038","url":null,"abstract":"In this paper, we propose a novel ranked Hopfield neural-network (RHNN) parallel scheduler for a WDM optical interconnection system (WOPIS), containing a set of Clos-like optical switches and a handful of output FDL-based optical buffers. The RHNN scheduler determines an optimal set of neurons (I/O paths) to be enabled, achieving maximal system throughput and priority differentiation subject to the switch- and buffer-contention-free constraints. The RHNN is specially structured with ranked neurons. With each neuron being associated with an input/output path within WOPIS, the RHNN allows higher-rank neurons (higher-priority and/or lower-delay paths) to disable lower-rank neurons that were enabled during previous iterations. Ranking the neurons unfortunately gives rise to a convergence problem. We present two theorems that supply the sufficient conditions for the RHNN scheduler to converge to the optimal solution. We demonstrate via simulation results that, with the computation time of less than one system time slot, the RHNN scheduler achieves near 100% throughput and multi-level prioritized scheduling.","PeriodicalId":269137,"journal":{"name":"2011 IEEE 12th International Conference on High Performance Switching and Routing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127811059","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}

引用次数: 1

Two-step routing for dynamic traffic protection in WDM networks with wavelength continuity constraint 具有波长连续性约束的WDM网络中动态业务保护的两步路由

2011 IEEE 12th International Conference on High Performance Switching and Routing Pub Date : 2011-07-04 DOI: 10.1109/HPSR.2011.5986023

Minjing Mao, K. Yeung

{"title":"Two-step routing for dynamic traffic protection in WDM networks with wavelength continuity constraint","authors":"Minjing Mao, K. Yeung","doi":"10.1109/HPSR.2011.5986023","DOIUrl":"https://doi.org/10.1109/HPSR.2011.5986023","url":null,"abstract":"Capacity efficiency is a key issue in designing survivable Wavelength Division Multiplexing (WDM) networks. In this paper, we propose a two-step routing algorithm for dynamic lightpath protection in a WDM mesh network that is subject to wavelength continuity constraint. In other words, upon each call arrival a pair of link-disjoint active and backup lightpaths is to be found for carrying the call. To enhance the capacity efficiency, the resources on the backup lightpath can be shared for protecting different active lightpaths. Owing to the very different natures of active and backup lightpaths, active lightpath is found using the widest-shortest path (WSP) routing and backup lightpath is found using the shortest-widest path (SWP) routing. A distinct feature of our design is that we require both active and backup lightpaths of a call to use the same wavelength. Two major advantages of this feature are: a) source node can use the same laser for both active and backup lightpaths, and b) the scalability issue related to route advertisement is solved. As compared with some existing schemes, we show that our two-step routing algorithm yields noticeably higher capacity efficiency and lower call blocking probability.","PeriodicalId":269137,"journal":{"name":"2011 IEEE 12th International Conference on High Performance Switching and Routing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130227934","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}

引用次数: 1

Design and performance evaluation of a GMPLS-enabled MPLS-TP/PWE3 node with integrated 10Gbps tunable DWDM transponders 集成10Gbps可调谐DWDM转发器的支持gmpls的MPLS-TP/PWE3节点设计与性能评估

2011 IEEE 12th International Conference on High Performance Switching and Routing Pub Date : 2011-07-04 DOI: 10.1109/HPSR.2011.5986032

R. Vilalta, R. Muñoz, R. Casellas, R. Martínez

{"title":"Design and performance evaluation of a GMPLS-enabled MPLS-TP/PWE3 node with integrated 10Gbps tunable DWDM transponders","authors":"R. Vilalta, R. Muñoz, R. Casellas, R. Martínez","doi":"10.1109/HPSR.2011.5986032","DOIUrl":"https://doi.org/10.1109/HPSR.2011.5986032","url":null,"abstract":"To achieve cost reductions, simplified operations and flexible scalability in optical transport networks, a challenging approach is to replace the TDM aggregation and transport infrastructure, based on legacy SONET/SDH technology, by a new dynamic network infrastructure that delivers the high-bandwidth transport and deterministic performance of the optical circuit technology (i.e., WSON) along with the efficient aggregation and statistical multiplexing of a packet transport technology (e.g., MPLS-TP) to support IP and Ethernet services. This paper presents the architectural design, implementation and the performance evaluation of the forwarding capabilities of a MPLS-TP/PWE3 node with integrated 10Gbps tunable DWDM transponders to extend the GMPLS-enabled WSON transport network of the ADRENALINE testbed. The node has been implemented using commercial off-the-shelf hardware and open source software. An evaluation of the node is provided by means of analyzing the obtained throughput and CPU usage in two different evaluation scenarios with different traffic grooming strategies.","PeriodicalId":269137,"journal":{"name":"2011 IEEE 12th International Conference on High Performance Switching and Routing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121389727","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

Beyond connectivity - new metrics to evaluate robustness of networks 超越连接性——评估网络稳健性的新指标

2011 IEEE 12th International Conference on High Performance Switching and Routing Pub Date : 2011-07-04 DOI: 10.1109/HPSR.2011.5986022

Sujogya Banerjee, Shahrzad Shirazipourazad, P. Ghosh, Arunabha Sen

{"title":"Beyond connectivity - new metrics to evaluate robustness of networks","authors":"Sujogya Banerjee, Shahrzad Shirazipourazad, P. Ghosh, Arunabha Sen","doi":"10.1109/HPSR.2011.5986022","DOIUrl":"https://doi.org/10.1109/HPSR.2011.5986022","url":null,"abstract":"Robustness or fault-tolerance capability of a network is an important design parameter in both wired and wireless networks. Connectivity of a network is traditionally considered to be the primary metric for evaluation of its fault-tolerance capability. However, connectivity κ(G) (for random faults) or region-based connectivity κR(G) (for spatially correlated or region-based faults, where the faults are confined to a region R) of a network G, does not provide any information about the network state, (i.e., whether the network is connected or not) once the number of faults exceeds κ(G) or κR(G). If the number of faults exceeds κ(G) or κR(G), one would like to know, (i) the number of connected components into which G decomposes, (ii) the size of the largest connected component, (iii) the size of the smallest connected component. In this paper, we introduce a set of new metrics that computes these values. We focus on one particular metric called region-based component decomposition number (RBCDN), that measures the number of connected components in which the network decomposes once all the nodes of a region fail. We study the computational complexity of finding RBCDN of a network. In addition, we study the problem of least cost design of a network with a target value of RBCDN. We show that the optimal design problem is NP-complete and present an approximation algorithm with a performance bound of O(log K + 4log n), where n denotes the number of nodes in the graph and K denotes a target value of RBCDN. We evaluate the performance of our algorithm by comparing it with the performance of the optimal solution. Experimental results demonstrate that our algorithm produces near optimal solution in a fraction of time needed to find an optimal solution.","PeriodicalId":269137,"journal":{"name":"2011 IEEE 12th International Conference on High Performance Switching and Routing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125691118","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}

引用次数: 27