2007 6th International Workshop on Design and Reliable Communication Networks最新文献

Improving network reliability by avoiding misconfiguration 避免错误配置，提高网络可靠性

2007 6th International Workshop on Design and Reliable Communication Networks Pub Date : 2007-10-01 DOI: 10.1109/DRCN.2007.4762255

David Buchmann, Dominik Jungo, U. Ultes-Nitsche

引用次数: 4

Ethernet over WDM: Optimization for resilience and scalability 基于WDM的以太网:优化弹性和可伸缩性

2007 6th International Workshop on Design and Reliable Communication Networks Pub Date : 2007-10-01 DOI: 10.1109/DRCN.2007.4762280

A. Kern, I. Moldován, P. Hegyi, T. Cinkler

{"title":"Ethernet over WDM: Optimization for resilience and scalability","authors":"A. Kern, I. Moldován, P. Hegyi, T. Cinkler","doi":"10.1109/DRCN.2007.4762280","DOIUrl":"https://doi.org/10.1109/DRCN.2007.4762280","url":null,"abstract":"The emerging Ethernet technologies deployed in metro networks provide services based on pure Ethernet. Low cost optical Ethernet interfaces are used to interconnect different sites. Then, the use of wavelength division multiplexing technology with optical Ethernet is clearly the next step in building cost efficient metro networks. In this paper we propose a novel architecture and configuration methods that make metro Ethernet better scale to larger traffic and to covering larger areas that consist of more nodes promising significantly lower costs. The idea is to utilize wavelength paths optimally for bypassing certain Ethernet nodes and by employing traffic grooming according to different strategies we propose and compare. The result is always a tradeoff between the cost of the solution and the achievable throughput. Our methods are based on integer linear program and combinatorial heuristics. The proposed architecture and the optimization framework support very fast recovery upon a failure. Furthermore, it handles the shared risk link groups to ensure that the working and the backup paths should be physically disjoint. The method also supports traffic engineering goals: network utilization and resilience. Furthermore, it can be well used to enforce limitations on the depth and diameter of the obtained logical topology that allows scalability.","PeriodicalId":347030,"journal":{"name":"2007 6th International Workshop on Design and Reliable Communication Networks","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122560347","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

Direct optimal design of a quasi-regular composite-star core network 拟规则复合星型核心网络的直接优化设计

2007 6th International Workshop on Design and Reliable Communication Networks Pub Date : 2007-10-01 DOI: 10.1109/DRCN.2007.4762276

Stefano Secci, A. Ceselli, F. Malucelli, A. Pattavina, B. Sansò

引用次数: 6

A fast heuristic for DWDM routing and grooming DWDM路由和修饰的快速启发式算法

2007 6th International Workshop on Design and Reliable Communication Networks Pub Date : 2007-10-01 DOI: 10.1109/DRCN.2007.4762291

M. Kiese, A. Autenrieth

引用次数: 5

ILP approaches to study interconnection strategies for multi-ring networks in the presence of traffic grooming 在存在流量疏导的情况下研究多环网络互连策略的ILP方法

2007 6th International Workshop on Design and Reliable Communication Networks Pub Date : 2007-10-01 DOI: 10.1109/DRCN.2007.4762286

L. Resendo, J. Pedro, M. Ribeiro, J. Pires

引用次数: 1

p-cycle network design: From fewest in number to smallest in size p循环网络设计:从数量最少到尺寸最小

2007 6th International Workshop on Design and Reliable Communication Networks Pub Date : 2007-10-01 DOI: 10.1109/DRCN.2007.4762275

Diane Prisca Onguetou, W. Grover

{"title":"p-cycle network design: From fewest in number to smallest in size","authors":"Diane Prisca Onguetou, W. Grover","doi":"10.1109/DRCN.2007.4762275","DOIUrl":"https://doi.org/10.1109/DRCN.2007.4762275","url":null,"abstract":"An idea seems to have spread that p-cycle networks are always based on a single Hamiltonian cycle. The correct understanding is that while they can be based on a Hamiltonian, network designs involving multiple p-cycles are far more capacity-efficient in general. In fact, from an optical networking standpoint one would probably like to work with p-cycles of the smallest size (circumference) possible, to satisfy optical reach considerations, and in this case the number of p-cycles might be even more numerous than a pure minimum capacity design. However, the fact that an entire network could be protected by a single cyclic structure could be attractive from another viewpoint simply because only one logical structure has to be managed. Thus, different recent orientations have brought us to realize the need for a study of p-cycle network designs that vary systematically across the range between the smallest size p-cycles, to using the fewest number of p-cycles. Questions include: What are the design models for p-cycle networks that use the fewest number of distinct structures? What are the capacity implications of a design restricted to a specific maximum number of structures? Can a capacity-optimal design be ¿nudged¿ into using fewer structures in total without requiring any extra capacity? What happens to the number of structures if the smallest possible p-cycles are insisted upon? Accordingly, we offer a systematic study of the optimal p-cycle network design problem addressing such questions about how the logical number of p-cycle structures present or allowed in a design interacts with the minimum spare capacity required for the design to be 100% restorable.","PeriodicalId":347030,"journal":{"name":"2007 6th International Workshop on Design and Reliable Communication Networks","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125130557","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

Evaluation of survivable ethernet over WDM network architectures in metro ring networks 城域环网中基于WDM网络架构的生存性以太网的评估

2007 6th International Workshop on Design and Reliable Communication Networks Pub Date : 2007-10-01 DOI: 10.1109/DRCN.2007.4762266

Georg Baier, T. Engel, A. Autenrieth

引用次数: 2

ROADM design for OMS-DPRing protection in GMPLS-based optical networks 基于gmpls的光网络中OMS-DPRing保护的ROADM设计

2007 6th International Workshop on Design and Reliable Communication Networks Pub Date : 2007-10-01 DOI: 10.1109/DRCN.2007.4762283

L. Velasco, S. Spadaro, J. Comellas, G. Junyent

引用次数: 6

Map of Relaying Messages (MORM) an approach of message distribution enabling Network Advertisement and Discovery 中继消息映射(MORM)是一种实现网络发布和发现的消息分发方法

2007 6th International Workshop on Design and Reliable Communication Networks Pub Date : 2007-10-01 DOI: 10.1109/DRCN.2007.4762259

Di Zhou, Yaning Wang, N. Akhtar, K. Moessner, D. Migault

{"title":"Map of Relaying Messages (MORM) an approach of message distribution enabling Network Advertisement and Discovery","authors":"Di Zhou, Yaning Wang, N. Akhtar, K. Moessner, D. Migault","doi":"10.1109/DRCN.2007.4762259","DOIUrl":"https://doi.org/10.1109/DRCN.2007.4762259","url":null,"abstract":"Next generation networks will be more and more heterogeneous and dynamic. The traditional model for interactions between different networks is relatively static. However, future scenarios involve quite dynamic inter-network relationships established to meet service requirements on-the-fly. In particular, Network Composition will enable dynamic and automatic cooperation between networks, based on agreements tailored to meet the specific needs of the networks concerned. To facilitate such interactions, functionality to advertise and to discover various networks and services within the local and remote scope will be required. In this paper, we address the twinfunctions of Network Advertisement and Discovery. A scenariobased analysis is used to determine the key requirements of these functions, with special emphasis on the problem of distributing advertisement and discovery messages to a set of unknown target networks. A novel solution called Map of Relaying Messages is presented to enable the efficient and timely distribution of various messages for the purpose of advertisement and discovery.","PeriodicalId":347030,"journal":{"name":"2007 6th International Workshop on Design and Reliable Communication Networks","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124628288","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

k-splittable delay constrained routing problem: A branch and price approach k可分延迟约束路由问题:一个分支和价格方法

2007 6th International Workshop on Design and Reliable Communication Networks Pub Date : 2007-10-01 DOI: 10.1002/net.20311

J. Truffot, C. Duhamel, P. Mahey

引用次数: 9