2012 IEEE 13th International Conference on High Performance Switching and Routing最新文献_第3页

Cost-optimized dimensioning of translucent WDM networks with Mixed-Line-Rate spectrum-flexible channels 具有混合线速率频谱柔性信道的半透明WDM网络的成本优化尺寸

2012 IEEE 13th International Conference on High Performance Switching and Routing Pub Date : 2012-06-24 DOI: 10.1109/HPSR.2012.6260848

A. Eira, J. Pedro, J. Pires

{"title":"Cost-optimized dimensioning of translucent WDM networks with Mixed-Line-Rate spectrum-flexible channels","authors":"A. Eira, J. Pedro, J. Pires","doi":"10.1109/HPSR.2012.6260848","DOIUrl":"https://doi.org/10.1109/HPSR.2012.6260848","url":null,"abstract":"In order for transport networks to cost-effectively provide higher capacity, it is expected that channel bit-rates beyond 100 Gb/s will be accomplished by resorting to a flexible WDM grid with variable channel spacing. Among the implications of this concept is the need for planning tools that fully exploit the additional degrees of freedom enabled by a flexible grid to further optimize network cost and spectral efficiency. This paper proposes an optimization framework to minimize the transponder and regenerator deployment cost in a translucent WDM network featuring channel bit-rates of 40, 100 and 400 Gb/s and multiple transmission formats per bit-rate, each characterized by its own spectral width, optical reach and cost properties. Firstly, we formulate the problem via a novel Integer Linear Programming (ILP) model, whose resolution finds the optimal (cheapest) feasible network configuration. Secondly, we propose an efficient heuristic called Narrowest First-Iterative Cost Reduction (NF-ICR) to handle network scenarios for which solving the ILP entails an unreasonable computational burden. The NF-ICR heuristic is shown to provide tight optimality bounds where the benchmark given by the ILP solution is attainable. For larger networks, we show that the use of a flexible grid and multiple format options for each bit-rate results in around 10% less cost in transponders and regenerators for metro networks, and a substantial increase in the total traffic load supported by the network. We also conclude that a distinction emerges between metro/regional scenarios and long-haul networks with long paths, wherein the shorter transparent reach of 400 Gb/s channels drives up the cost due to extra regeneration, favoring the use of parallelized solutions of lower bit-rate channels.","PeriodicalId":163079,"journal":{"name":"2012 IEEE 13th International Conference on High Performance Switching and Routing","volume":"76 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126031327","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

Module-level matching algorithms for MSM clos-network switches MSM闭网交换机的模块级匹配算法

2012 IEEE 13th International Conference on High Performance Switching and Routing Pub Date : 2012-06-24 DOI: 10.1109/HPSR.2012.6260825

Yu Xia, H. J. Chao

{"title":"Module-level matching algorithms for MSM clos-network switches","authors":"Yu Xia, H. J. Chao","doi":"10.1109/HPSR.2012.6260825","DOIUrl":"https://doi.org/10.1109/HPSR.2012.6260825","url":null,"abstract":"In this paper, we propose a simple module-level matching scheme for memory-space-memory Clos-network switches to avoid complex path-allocation algorithms in bufferless Clos networks, as well as cell out-of-order and saturation-tree problems in buffered Clos networks. We show that the module-level matching scheme can achieve 100% throughput.We propose static and dynamic dispatching cell schemes in addition to the module-level matching to improve the delay performance. The static cell dispatching scheme requires no additional scheduling; while the dynamic cell dispatching scheme is more adaptive to the traffic than the static one, thus can achieve better delay performance under non-uniform traffic loads. However, the wiring complexity of the scheduler for dynamic cell dispatching is high. Thus, the grouped dynamic cell dispatching scheme is proposed as a trade-off between the complexity and performance. In practice, embedded memory size is restricted, thus the queue length limitation in each switch module is also considered in this paper. We propose an efficient scheme to prevent queues to overflow in this situation which makes our work more practical.","PeriodicalId":163079,"journal":{"name":"2012 IEEE 13th International Conference on High Performance Switching and Routing","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121738999","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

On stability of virtual topologies in dynamic multilayer networks 动态多层网络中虚拟拓扑的稳定性

2012 IEEE 13th International Conference on High Performance Switching and Routing Pub Date : 2012-06-24 DOI: 10.1109/HPSR.2012.6260839

J. Rzasa, A. Lason, Krzysztof Rusek, A. Szymanski, A. Jajszczyk

引用次数: 1

Optical transport network design with collocated regeneration and differential delay compensation 具有并行再生和差分时延补偿的光传输网络设计

2012 IEEE 13th International Conference on High Performance Switching and Routing Pub Date : 2012-06-24 DOI: 10.1109/HPSR.2012.6260851

J. Santos, J. Pedro, A. Eira, P. Monteiro, J. Pires

{"title":"Optical transport network design with collocated regeneration and differential delay compensation","authors":"J. Santos, J. Pedro, A. Eira, P. Monteiro, J. Pires","doi":"10.1109/HPSR.2012.6260851","DOIUrl":"https://doi.org/10.1109/HPSR.2012.6260851","url":null,"abstract":"A potentially cost-effective approach for augmenting the transmission capacity in an optical transport network (OTN) consists of bundling several optical channels by means of an inverse-multiplexing strategy, e.g. virtual concatenation (VCAT). When VCAT is employed together with multipath routing, the differential delay between concatenated channels needs to be compensated via electrical buffering. To avoid installing large and costly high-speed buffers, this compensation can be dispersed throughout the intermediate path nodes. With this distributed scheme, each intermediate compensation operation requires an optical-electrical-optical (OEO) converter. Such converters, which are typically employed to allow electrical processing (e.g. signal regeneration, traffic switching/grooming, etc.), represent the largest contributor to the capital expenditures of an optical network. Hence, to save on OEO equipment and keep the network cost-effectiveness, we propose the novel approach of collocating the differential delay buffering and the regeneration on the same network element, enabling the implementation of distributed schemes with minimal link capacity levels, OEO count, and buffer size requirements. To effectively design an OTN network under these conditions, we also present a new multi-step optimization framework based on integer linear programming (ILP) modeling. To test our approach, emerging 100 Gb/s Ethernet services are established over two reference networks using virtually-concatenated 40 Gb/s channels. The correspondent results confirm that relevant OEO/regenerator count savings (ranging from 23% to 44%) can be attained with the collocated approach while the buffer sizes are maintained reasonably small. We also show that the end-to-end transmission latency is not affected by the adoption of this collocated strategy","PeriodicalId":163079,"journal":{"name":"2012 IEEE 13th International Conference on High Performance Switching and Routing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131144542","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

Assessing physical network vulnerability under random line-segment failure model 随机线段失效模型下物理网络脆弱性评估

2012 IEEE 13th International Conference on High Performance Switching and Routing Pub Date : 2012-06-24 DOI: 10.1109/HPSR.2012.6260838

Xiaoliang Wang, Xiaohong Jiang, A. Pattavina, Sanglu Lu

{"title":"Assessing physical network vulnerability under random line-segment failure model","authors":"Xiaoliang Wang, Xiaohong Jiang, A. Pattavina, Sanglu Lu","doi":"10.1109/HPSR.2012.6260838","DOIUrl":"https://doi.org/10.1109/HPSR.2012.6260838","url":null,"abstract":"The communication network is now one of the critical infrastructures in our society. However, the current communication networks are facing more and more large-scale region failure threats, such as natural disasters (e.g. earthquake, tornado) and physical attacks (e.g. dragging anchors or EMP attack). Therefore, a deep understanding of network behaviors under region failure is essential for the design and maintenance of future highly survivable networks. In this paper, we focus on the network vulnerability assessment under the geographically correlated region failure(s) caused by a random “line-segment” cut, an important region failure model that can efficiently capture the behaviors of some region failures like earthquake, tornado and anchor cutting. To facilitate such vulnerability assessment, we apply the geometrical probability theory to design a grid partition-based estimation scheme for Disrupted Link Capacity, Pairwise Traffic Reduction and Pairwise Disconnection Probability, three commonly used metrics for statistical vulnerability assessment. A theoretical framework is also established to determine a suitable grid partition such that a specified estimation error requirement is satisfied.","PeriodicalId":163079,"journal":{"name":"2012 IEEE 13th International Conference on High Performance Switching and Routing","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127039796","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}

引用次数: 12

Statistical approach for detecting malicious PCE activity in multi-domain networks 多域网络中恶意PCE活动检测的统计方法

2012 IEEE 13th International Conference on High Performance Switching and Routing Pub Date : 2012-06-24 DOI: 10.1109/HPSR.2012.6260845

M. Gharbaoui, F. Paolucci, A. Giorgetti, B. Martini, P. Castoldi

引用次数: 5

Monitoring Trail Allocation in all-optical networks with the Random Next Hop Policy 基于随机下一跳策略的全光网络中跟踪分配监控

2012 IEEE 13th International Conference on High Performance Switching and Routing Pub Date : 2012-06-24 DOI: 10.1109/HPSR.2012.6260849

Yangming Zhao, Shizhong Xu, Bin Wu, Xiong Wang, Sheng Wang

{"title":"Monitoring Trail Allocation in all-optical networks with the Random Next Hop Policy","authors":"Yangming Zhao, Shizhong Xu, Bin Wu, Xiong Wang, Sheng Wang","doi":"10.1109/HPSR.2012.6260849","DOIUrl":"https://doi.org/10.1109/HPSR.2012.6260849","url":null,"abstract":"The concept of monitoring trail (m-trail) provides a striking mechanism for fast and unambiguous link failure localization in all-optical networks. To achieve fast m-trail design in large-size networks, two efficient heuristics RCA+RCS and MTA are proposed against the optimal ILP (Integer Linear Program) model. However, RCA+RCS suffers from the disjoint trail problem which increases the required number of m-trails, and MTA always finds a deterministic solution which may not be good enough due to the limited solution space. In this paper, we propose a new heuristic RNH-MTA (Monitoring Trail Allocation with the Random Next Hop policy) to solve those issues. Similar to MTA, RNH-MTA ensures a valid optical structure of each m-trail and sequentially adds necessary m-trails to the solution, and thus is free of the disjoint trail problem. By replacing the deterministic searching in MTA using the Random Next Hop policy, RNH-MTA sets up a probabilistic model in extending each m-trail. This not only enlarges the solution space and increases the solution diversity, but also enables a controllable tradeoff between the solution quality and the running time of the algorithm. Our numerical results show the advantages of RNH-MTA over both RCA+RCS and MTA.","PeriodicalId":163079,"journal":{"name":"2012 IEEE 13th International Conference on High Performance Switching and Routing","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125768902","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}

引用次数: 5

Classes of service for daisy chain interconnects 菊花链互连的服务等级

2012 IEEE 13th International Conference on High Performance Switching and Routing Pub Date : 2012-06-24 DOI: 10.1109/HPSR.2012.6260842

H. Eberle, W. Olesinski

引用次数: 0

Modeling and optimizing the delay-energy tradeoff in TDM systems with sleep mode 睡眠模式时分复用系统的延迟-能量权衡建模与优化

2012 IEEE 13th International Conference on High Performance Switching and Routing Pub Date : 2012-06-24 DOI: 10.1109/HPSR.2012.6260856

I. Cerutti, A. Kassem, P. G. Raponi, P. Castoldi

引用次数: 2

Improving performance in a combined router/server 提高路由器/服务器组合的性能

2012 IEEE 13th International Conference on High Performance Switching and Routing Pub Date : 2012-06-24 DOI: 10.1109/HPSR.2012.6260827

Voravit Tanyingyong, M. Hidell, Peter Sjödin

引用次数: 10