DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005.最新文献_第5页

Clinical grade - a foundation for healthcare communications networks 临床级-医疗保健通信网络的基础

DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005. Pub Date : 2005-12-27 DOI: 10.1109/DRCN.2005.1563898

A. Graves, Bruce Wallace, S. Periyalwar, Carlo Riccardi

引用次数: 7

A randomized rounding heuristic to reroute tunnels in MPLS networks MPLS网络中隧道重路由的随机四舍五入启发式算法

DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005. Pub Date : 2005-12-27 DOI: 10.1109/DRCN.2005.1563909

O. Klopfenstein

{"title":"A randomized rounding heuristic to reroute tunnels in MPLS networks","authors":"O. Klopfenstein","doi":"10.1109/DRCN.2005.1563909","DOIUrl":"https://doi.org/10.1109/DRCN.2005.1563909","url":null,"abstract":"In multi-protocol label switching (MPLS) networks, traffic demands can be routed along tunnels called label switched paths (LSPs). One tunnel is characterized by a path in the network and a reserved bandwidth. These tunnels can be created and deleted dynamically, depending on traffic demand arrivals or departures. After several operations of this type, the network resources utilization can be unsatisfactory, with for instance congestion or too long routing paths. One way to improve it is to reroute tunnels. Different rerouting procedures may be applied, breaking tunnels or using make-before-break. This has to be adapted to the LSP quality of service (QoS) requirements. Moreover, for network management purposes, we would like to control the number of rerouting operations to perform. A global rerouting framework is proposed, which enables to consider independently each class of LSPs. Then, a mathematical model is introduced. As it appears very hard to solve to optimality, a heuristic based on randomized rounding is proposed. Finally, the designed tool has enabled a numerical study on the proportion of tunnels to reroute in order to reach near-optimal network states.","PeriodicalId":415896,"journal":{"name":"DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005.","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126009464","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

Inter-infrastructure simulations across telecom, power, and emergency services 跨电信、电力和应急服务的基础设施间模拟

DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005. Pub Date : 2005-12-27 DOI: 10.1109/DRCN.2005.1563897

G. O'Reilly, H. Uzunalioglu, S. Conrad, W. Beyeler

引用次数: 20

Automatic lightpath service provisioning with an adaptive protected working capacity envelope based on p-cycles 基于p循环的自适应保护工作容量包络的自动光路服务配置

DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005. Pub Date : 2005-12-27 DOI: 10.1109/DRCN.2005.1563895

G. Shen, W. Grover

{"title":"Automatic lightpath service provisioning with an adaptive protected working capacity envelope based on p-cycles","authors":"G. Shen, W. Grover","doi":"10.1109/DRCN.2005.1563895","DOIUrl":"https://doi.org/10.1109/DRCN.2005.1563895","url":null,"abstract":"The problem of automatic provisioning of survivable service paths in a transport network in the face of random arrivals and departures, and fundamental traffic uncertainty, is a challenging and interesting problem for research. Essentially to date, only one basic approach is considered, that of provisioning a working path and then explicitly arranging a shared disjoint backup path for protection. This is done on every new connection arrival and is heavily dependent on synchronized network state databases and state dissemination to keep such databases current. The authors described an alternate approach to simplify the process of automatic survivable service provisioning scheme from the end users point of view. Under an adaptive protected working capacity envelope (AP-WCE), statistically stationary but random demand patterns require little or no state dissemination and protected service routing is no different than shortest path working routing. But under non-stationary evolution of the traffic load both spatially and temporally, a slow-acting background process of APWCE reoptimization occurs which keeps the logical configuration of both working envelope and protection overlay always as well matched to the actual traffic load pattern as possible within the finite amount of total as-built transmission capacity. The scheme is attractive as it is easily implemented by existing network control systems and is inherently more scalable to large networks and fast random demands than the current shared-backup scheme because no signaling or state update relating to protection is required on the timescale of individual connection requests. Any such signaling arises only on the timescale of the non-stationary evolution of the traffic load pattern itself.","PeriodicalId":415896,"journal":{"name":"DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005.","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134458980","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

Quality surveillance algorithm for erbium-doped fiber amplifiers 掺铒光纤放大器的质量监控算法

DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005. Pub Date : 2005-12-27 DOI: 10.1109/DRCN.2005.1563855

L. Rapp

引用次数: 4

Impact of idle protection capacity reuse on multi-class optical networks 闲置保护容量复用对多级光网络的影响

DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005. Pub Date : 2005-12-27 DOI: 10.1109/DRCN.2005.1563858

A. Giorgetti, N. Andriolli, L. Valcarenghi, P. Castoldi

{"title":"Impact of idle protection capacity reuse on multi-class optical networks","authors":"A. Giorgetti, N. Andriolli, L. Valcarenghi, P. Castoldi","doi":"10.1109/DRCN.2005.1563858","DOIUrl":"https://doi.org/10.1109/DRCN.2005.1563858","url":null,"abstract":"In a multi-class traffic scenario spare resources can be utilized, under normal network conditions, for the transmission of low class traffic. In this way network resource utilization is improved but, upon failure occurrence, low class connections are preempted by recovered high class connections. On the other hand spare resources, allocated to protect high class connections but not utilized (i.e., idle) in a specific failure scenario, can be employed to recover failed low class connections. In this case low class connections resort to dynamic restoration because they carry traffic that tolerates not to be recovered or to experience long recovery time. In this study a scenario is envisioned where, besides high (i.e., gold) class connections, which are shared path protected, two alternative low class connections are present in the network: silver and bronze class connections. Both silver and bronze connections exploit dynamic restoration to overcome failures. The main difference is that silver connections utilize high class spare resources just after failure occurrence while bronze connections utilize high class spare resources before and after the failure. Numerical results show a tradeoff between provisioning and restoration performance of the different connection classes in the considered scenarios. If spare resources are exploited only after the failure (i.e., gold-silver scenario), low class connection survivability is high. If spare resources are used also during normal network operation (i.e., gold-bronze scenario), the provisioning performance of both connection classes is improved, but, upon failure occurrence, the low class survivability is low. In both scenarios, the inaccurate network state information after the failure slightly degrades survivability performance.","PeriodicalId":415896,"journal":{"name":"DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005.","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126104746","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

Internet failure protection using hamiltonian p-cycles found by ant-like agents 利用蚁类代理发现的哈密顿p环进行网络故障保护

DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005. Pub Date : 2005-12-27 DOI: 10.1109/DRCN.2005.1563904

O. Wittner, B. Helvik, V. Nicolat

{"title":"Internet failure protection using hamiltonian p-cycles found by ant-like agents","authors":"O. Wittner, B. Helvik, V. Nicolat","doi":"10.1109/DRCN.2005.1563904","DOIUrl":"https://doi.org/10.1109/DRCN.2005.1563904","url":null,"abstract":"'Link and node failures in the Internet are handled by restoration, i.e. by finding a new routing pattern. This may incur a considerable delay before the traffic flow may be reestablished. An immediate fault handling, i.e. protection, is desirable and required by some services and users. Protection cycles are a well known dependability measure and commonly applied In SDH networks with ring topologies. Applying protection cycles (known as p-cycles) in meshed network has recently been shown to provide good protection against failures. To be consistent with the Internet operational strategy, it is necessary to establish such rings dynamically, on line and In a distributed manner. Swarm intelligence is a distributed system construction concept which has shown promising results when applied to problems within the area of network and operational management. Swarm Intelligence systems are fully distributed (without central components), have high redundancy, are adaptable, and can find near optimal solutions to NP-hard problems. This paper describes a new swarm intelligence system based on the CE-ant algorithm developed by Helvik and Wittner. The system Is capable of finding near optimal Hamiltonian protection cycles in meshed networks. These are suited for protection in small to medium sized networks (ASs). To test and stress the concept, a case study is carried out mainly based on the topology, link loads and capacities of a real, diverse and rather large network. Results indicate that the agent system has a good ability to find good candidate p-cycles, and that in the network used as a case, approximately 80% of the link failures may be fully protected by the otherwise unused capacity in the network. With a good choice of p-cycle, even the very high capacity and high load links may have a substantial protection. Indexc Terms-Dependability, Protection in Internet, p-Cycles, Swarm Intelligence, CE-ants.","PeriodicalId":415896,"journal":{"name":"DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005.","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116361305","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}

引用次数: 13

Network protection design for MPLS networks MPLS网络的网络防护设计

DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005. Pub Date : 2005-12-27 DOI: 10.1109/DRCN.2005.1563912

G. Agrawal, Dijiang Huang, D. Medhi

引用次数: 5

Two design problems for the IP/MLPS over WDM networks WDM网络上IP/MLPS的两个设计问题

DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005. Pub Date : 2005-12-27 DOI: 10.1109/DRCN.2005.1563873

E. Kubilinskas, M. Pióro

引用次数: 16

Algorithms to evaluate the reliability of a network 评估网络可靠性的算法

DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005. Pub Date : 2005-12-27 DOI: 10.1109/DRCN.2005.1563849

J. Galtier, A. Laugier, P. Pons

引用次数: 15