Pub Date : 2005-12-27DOI: 10.1109/DRCN.2005.1563870
Arnold Farkas, J. Szigeti, T. Cinkler
In multi-domain networks, the domains are typically run by different operators, which do not want to share all the internal information with competitors. Furthermore, broadcasting all the internal informations would unnecessarily overload the network with state messages. We decompose the multi-domain resilience problem into two sub-problems, namely the higher level inter-domain protection, and the lower level intra-domain protection. Building p-cycles at the higher level is accomplished by certain tasks at the lower level including straddling link connection, capacity allocation, and path selection. We show that p-cycles offer high availability and acceptable resource usage without the knowledge of paths that makes p-cycles very good candidate for protecting inter-domain traffic.
{"title":"P-cycle based protection schemes for multi-domain networks","authors":"Arnold Farkas, J. Szigeti, T. Cinkler","doi":"10.1109/DRCN.2005.1563870","DOIUrl":"https://doi.org/10.1109/DRCN.2005.1563870","url":null,"abstract":"In multi-domain networks, the domains are typically run by different operators, which do not want to share all the internal information with competitors. Furthermore, broadcasting all the internal informations would unnecessarily overload the network with state messages. We decompose the multi-domain resilience problem into two sub-problems, namely the higher level inter-domain protection, and the lower level intra-domain protection. Building p-cycles at the higher level is accomplished by certain tasks at the lower level including straddling link connection, capacity allocation, and path selection. We show that p-cycles offer high availability and acceptable resource usage without the knowledge of paths that makes p-cycles very good candidate for protecting inter-domain traffic.","PeriodicalId":415896,"journal":{"name":"DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005.","volume":"17 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":"114642147","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}
Pub Date : 2005-12-27DOI: 10.1109/DRCN.2005.1563859
T. Kárász, Z. Pándi, T. Jakab
Fast provisioning capabilities enabled by signalling intelligence and automated switching flexibility are becoming fundamental features of next generation networks based on optical transport. Throughout the recent years numerous research and development projects, standardisation activities, and a large number of publications have been devoted to fast provisioning enabled optical networks. However, in the related research activities less attention has been paid to network state evolution during provisioning. The main scope of the paper is to propose a consolidation based lifecycle for network design and development of provisioning oriented optical networks in order to improve the performance of networks of this type. The proposal is motivated by the identified inherent lack of capacity efficiency of optical channel provisioning processes.
{"title":"Network consolidation - how to improve the efficiency of provisioning oriented optical networks","authors":"T. Kárász, Z. Pándi, T. Jakab","doi":"10.1109/DRCN.2005.1563859","DOIUrl":"https://doi.org/10.1109/DRCN.2005.1563859","url":null,"abstract":"Fast provisioning capabilities enabled by signalling intelligence and automated switching flexibility are becoming fundamental features of next generation networks based on optical transport. Throughout the recent years numerous research and development projects, standardisation activities, and a large number of publications have been devoted to fast provisioning enabled optical networks. However, in the related research activities less attention has been paid to network state evolution during provisioning. The main scope of the paper is to propose a consolidation based lifecycle for network design and development of provisioning oriented optical networks in order to improve the performance of networks of this type. The proposal is motivated by the identified inherent lack of capacity efficiency of optical channel provisioning processes.","PeriodicalId":415896,"journal":{"name":"DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005.","volume":"13 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":"125364497","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}
Pub Date : 2005-12-27DOI: 10.1109/DRCN.2005.1563844
Z. Lakatos, P. Szegedi
The idea that is discussed in this paper is a possible solution, which allows that the shared capacity oriented restoration scheme can be tailored according to the recovery time requirement of the delay sensitive applications, thus the efficient resource usage can be optimized under a recovery time constraint. This paper seems to be interesting, especially as an introduction for people that would approach the problem of recovery time constraints in resilient networks and also for showing the relationship between the amount of additional resource allocation needed by the restoration and the recovery time constraint fulfillment. This paper gives simple analytical models for the implementation options of the optical control plane signaling, shows some reference linear programming formulations for different resilience strategies and finally shows some illustrative numerical comparisons to support the aforementioned efforts.
{"title":"Effective resilience design for recovery time restricted applications","authors":"Z. Lakatos, P. Szegedi","doi":"10.1109/DRCN.2005.1563844","DOIUrl":"https://doi.org/10.1109/DRCN.2005.1563844","url":null,"abstract":"The idea that is discussed in this paper is a possible solution, which allows that the shared capacity oriented restoration scheme can be tailored according to the recovery time requirement of the delay sensitive applications, thus the efficient resource usage can be optimized under a recovery time constraint. This paper seems to be interesting, especially as an introduction for people that would approach the problem of recovery time constraints in resilient networks and also for showing the relationship between the amount of additional resource allocation needed by the restoration and the recovery time constraint fulfillment. This paper gives simple analytical models for the implementation options of the optical control plane signaling, shows some reference linear programming formulations for different resilience strategies and finally shows some illustrative numerical comparisons to support the aforementioned efforts.","PeriodicalId":415896,"journal":{"name":"DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005.","volume":"52 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":"125722463","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}
Pub Date : 2005-12-27DOI: 10.1109/DRCN.2005.1563863
R. Prinz, A. Autenrieth, D. Schupke
In this paper we present and compare different multilayer protection mechanisms which enable the client to protect its connections against dual failures in the server layer. In multilayer networks based on overlay or augmented model, the client is not aware of the routing information of the server layer. Therefore, some resilience mechanisms need new functions that have to be provided by the User Network Interface (UNI). Based on generic building blocks for surviving dual failures we propose four multilayer protection models. We extend our existing simulation software for analyzing resilience options and evaluate the selected operation scenarios.
{"title":"Dual failure protection in multilayer networks based on overlay or augmented model","authors":"R. Prinz, A. Autenrieth, D. Schupke","doi":"10.1109/DRCN.2005.1563863","DOIUrl":"https://doi.org/10.1109/DRCN.2005.1563863","url":null,"abstract":"In this paper we present and compare different multilayer protection mechanisms which enable the client to protect its connections against dual failures in the server layer. In multilayer networks based on overlay or augmented model, the client is not aware of the routing information of the server layer. Therefore, some resilience mechanisms need new functions that have to be provided by the User Network Interface (UNI). Based on generic building blocks for surviving dual failures we propose four multilayer protection models. We extend our existing simulation software for analyzing resilience options and evaluate the selected operation scenarios.","PeriodicalId":415896,"journal":{"name":"DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005.","volume":"26 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":"116543900","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}
Pub Date : 2005-12-27DOI: 10.1109/DRCN.2005.1563839
G. Maier, A. D. Giglio, G. Ferraris, M. Quagliotti, S. D. Patre, L. Savastano
In this paper, a method for planning and analyzing a dynamic optical transport network is described. The method is "event based" and a relative time scale is adopted. Events include setting up/tearing down optical channels and failure/restoration of network elements. Each connection demand is characterized by its own type of protection, routing strategy and priority, independently of the correspondent attributes of the other demands. The method works in two main modes: Design and Analysis. In Design mode the network is sized according to the offered demand while in the Analysis mode the network resources are assigned beforehand and the behavior of the network (traffic lost in case of lack of resources or failures) can be evaluated. The method is implemented by a computer program based on a new particular representation of the network, specifically conceived to effectively model optical transport networks. The paper will also include an example of design and analysis of a realistic Italian Optical network.
{"title":"An approach for dynamic optical transport network planning and analysis","authors":"G. Maier, A. D. Giglio, G. Ferraris, M. Quagliotti, S. D. Patre, L. Savastano","doi":"10.1109/DRCN.2005.1563839","DOIUrl":"https://doi.org/10.1109/DRCN.2005.1563839","url":null,"abstract":"In this paper, a method for planning and analyzing a dynamic optical transport network is described. The method is \"event based\" and a relative time scale is adopted. Events include setting up/tearing down optical channels and failure/restoration of network elements. Each connection demand is characterized by its own type of protection, routing strategy and priority, independently of the correspondent attributes of the other demands. The method works in two main modes: Design and Analysis. In Design mode the network is sized according to the offered demand while in the Analysis mode the network resources are assigned beforehand and the behavior of the network (traffic lost in case of lack of resources or failures) can be evaluated. The method is implemented by a computer program based on a new particular representation of the network, specifically conceived to effectively model optical transport networks. The paper will also include an example of design and analysis of a realistic Italian Optical network.","PeriodicalId":415896,"journal":{"name":"DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005.","volume":"1 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":"133030346","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}
Pub Date : 2005-12-27DOI: 10.1109/DRCN.2005.1563838
Tianjian Li, Bin Wang
We study the optimal survivability design problem under a scheduled traffic model in wavelength convertible WDM optical mesh networks. In this model, a set of demands is given, and the setup time and teardown time of a demand are known in advance. We formulate the joint routing and wavelength assignment problems into integer linear programs that maximally exploit network resource reuse in both space and time. To solve large problems, the joint RWA problems are divided to a routing subproblem and wavelength assignment subproblems which are then solved individually. The overall objective is to minimize the total number of wavelength-links used by working paths and protection paths of all traffic demands while 100% restorability is guaranteed against any single failures. Our simulation results indicate that the optimization of resource sharing in space and time enabled by our connection-holding-time-aware protection schemes can achieve significantly better resource utilization than schemes that are holding time unaware.
{"title":"On optimal survivability design in WDM optical networks under a scheduled traffic model","authors":"Tianjian Li, Bin Wang","doi":"10.1109/DRCN.2005.1563838","DOIUrl":"https://doi.org/10.1109/DRCN.2005.1563838","url":null,"abstract":"We study the optimal survivability design problem under a scheduled traffic model in wavelength convertible WDM optical mesh networks. In this model, a set of demands is given, and the setup time and teardown time of a demand are known in advance. We formulate the joint routing and wavelength assignment problems into integer linear programs that maximally exploit network resource reuse in both space and time. To solve large problems, the joint RWA problems are divided to a routing subproblem and wavelength assignment subproblems which are then solved individually. The overall objective is to minimize the total number of wavelength-links used by working paths and protection paths of all traffic demands while 100% restorability is guaranteed against any single failures. Our simulation results indicate that the optimization of resource sharing in space and time enabled by our connection-holding-time-aware protection schemes can achieve significantly better resource utilization than schemes that are holding time unaware.","PeriodicalId":415896,"journal":{"name":"DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005.","volume":"15 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":"132620359","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}
Pub Date : 2005-12-27DOI: 10.1109/DRCN.2005.1563920
M. Beghdadi, Yang Cao
This white paper explores enhancements to existing metro architectures that can serve as a catalyst for a broader modernization and optimization of incumbent carriers' service infrastructures. Included in this white paper are strategies for the optimal use of existing capital resources, and pragmatic migration steps to ease and facilitate network evolution. With the gradual adoption of new and more intelligent networking technologies, incumbent carriers can accelerate migration toward the more dynamic and data-centric service architectures that will fuel future network growth and increase competitive differentiation. These service architectures must support the cost-effective deployment of new service offerings such as gigabit Ethernet over SDH. Key technology enablers for these agile network architectures, including optical routing and signaling, virtual concatenation (VC: G.707), link capacity adjustment scheme (LCAS: G.7042) and generic framing procedure (GFP: G.7041), are also discussed.
{"title":"Evolving metro transport and switching infrastructures: path to efficient Ethernet services for carrier networks","authors":"M. Beghdadi, Yang Cao","doi":"10.1109/DRCN.2005.1563920","DOIUrl":"https://doi.org/10.1109/DRCN.2005.1563920","url":null,"abstract":"This white paper explores enhancements to existing metro architectures that can serve as a catalyst for a broader modernization and optimization of incumbent carriers' service infrastructures. Included in this white paper are strategies for the optimal use of existing capital resources, and pragmatic migration steps to ease and facilitate network evolution. With the gradual adoption of new and more intelligent networking technologies, incumbent carriers can accelerate migration toward the more dynamic and data-centric service architectures that will fuel future network growth and increase competitive differentiation. These service architectures must support the cost-effective deployment of new service offerings such as gigabit Ethernet over SDH. Key technology enablers for these agile network architectures, including optical routing and signaling, virtual concatenation (VC: G.707), link capacity adjustment scheme (LCAS: G.7042) and generic framing procedure (GFP: G.7041), are also discussed.","PeriodicalId":415896,"journal":{"name":"DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005.","volume":"25 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":"132710002","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}
Pub Date : 2005-12-27DOI: 10.1109/DRCN.2005.1563869
J. Doucette, Peter A. Giese, W. Grover
We develop three new design models for combined node and span protection with a single set of node-encircling p-cycles (NEPCs). In a simple reference model each node is protected by a single dedicated NEPC. In the second model NEPCs can be shared by multiple nodes as needed, and each node is allowed to make use of as many different NEPCs as needed for a capacity-efficient design. To manage the complexity, protection routing is assumed to be evenly split in both directions around the NEPC, resulting in a slight over-provisioning of NEPCs and spare capacity. The final model is the most capacity efficient by virtue of also determining in which direction protection routing should proceed around each NEPC for each light-path affected by a node failure. The models can also permit a specified level of restorability below 100% so that a carrier could offer node-failure restorability on a differentiated service basis. A significant finding is that in test case networks 25% node restorability can be achieved in addition to 100% span restorability with a single integrated set of p-cycles that require as little as 4.1% more spare capacity than for conventional protection only against span-failures.
{"title":"Combined node and span protection strategies with node-encircling p-cycles","authors":"J. Doucette, Peter A. Giese, W. Grover","doi":"10.1109/DRCN.2005.1563869","DOIUrl":"https://doi.org/10.1109/DRCN.2005.1563869","url":null,"abstract":"We develop three new design models for combined node and span protection with a single set of node-encircling p-cycles (NEPCs). In a simple reference model each node is protected by a single dedicated NEPC. In the second model NEPCs can be shared by multiple nodes as needed, and each node is allowed to make use of as many different NEPCs as needed for a capacity-efficient design. To manage the complexity, protection routing is assumed to be evenly split in both directions around the NEPC, resulting in a slight over-provisioning of NEPCs and spare capacity. The final model is the most capacity efficient by virtue of also determining in which direction protection routing should proceed around each NEPC for each light-path affected by a node failure. The models can also permit a specified level of restorability below 100% so that a carrier could offer node-failure restorability on a differentiated service basis. A significant finding is that in test case networks 25% node restorability can be achieved in addition to 100% span restorability with a single integrated set of p-cycles that require as little as 4.1% more spare capacity than for conventional protection only against span-failures.","PeriodicalId":415896,"journal":{"name":"DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005.","volume":"43 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":"124782565","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}
Pub Date : 2005-12-27DOI: 10.1109/DRCN.2005.1563852
S. Nariai, D.P. Kroese
We apply the cross-entropy method to a network design problem with multi-type links and nodes, in which the network's reliability is to be maximized subject to a fixed budget. Numerical experiments illustrate the simplicity and effectiveness of the method.
{"title":"On the design of multi-type networks via the cross-entropy method","authors":"S. Nariai, D.P. Kroese","doi":"10.1109/DRCN.2005.1563852","DOIUrl":"https://doi.org/10.1109/DRCN.2005.1563852","url":null,"abstract":"We apply the cross-entropy method to a network design problem with multi-type links and nodes, in which the network's reliability is to be maximized subject to a fixed budget. Numerical experiments illustrate the simplicity and effectiveness of the method.","PeriodicalId":415896,"journal":{"name":"DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005.","volume":"5 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":"117054229","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}
Pub Date : 2005-12-27DOI: 10.1109/DRCN.2005.1563916
J. P. T. Vilela, J. M. Valenzuela
In this work, a network based on wireless sensing modules has been developed to measure strains, temperature and accelerations in multiple points of the vehicle. The obtained data of each sensor is prepared, processed, stored and transmitted in time intervals towards a receiver. The receiver in turn sends the information to an Internet server through GSM cellular technology using the GPRS protocol. In the server, the data is stored and analyzed as it is received so it can be visualized as close as real time as possible by anyone with access to the Internet.
{"title":"Design and implementation of a wireless remote data acquisition system for mobile applications","authors":"J. P. T. Vilela, J. M. Valenzuela","doi":"10.1109/DRCN.2005.1563916","DOIUrl":"https://doi.org/10.1109/DRCN.2005.1563916","url":null,"abstract":"In this work, a network based on wireless sensing modules has been developed to measure strains, temperature and accelerations in multiple points of the vehicle. The obtained data of each sensor is prepared, processed, stored and transmitted in time intervals towards a receiver. The receiver in turn sends the information to an Internet server through GSM cellular technology using the GPRS protocol. In the server, the data is stored and analyzed as it is received so it can be visualized as close as real time as possible by anyone with access to the Internet.","PeriodicalId":415896,"journal":{"name":"DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005.","volume":"16 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":"116968016","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：