2007 6th International Workshop on Design and Reliable Communication Networks最新文献_第2页

Integrally indecomposable polytopes and the survivable network design problem 整体不可分解多面体与可生存网络设计问题

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

Elke Eisenschmidt, M. Köppe

引用次数: 2

A model for robust capacity planning for telecommunications networks under demand uncertainty 需求不确定性下电信网络稳健容量规划模型

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

A. Ouorou, J. Vial

引用次数: 49

Incremental availability evaluation model for p-cycle protected connections p环保护连接的增量可用性评估模型

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

J. Szigeti, T. Cinkler

{"title":"Incremental availability evaluation model for p-cycle protected connections","authors":"J. Szigeti, T. Cinkler","doi":"10.1109/DRCN.2007.4762278","DOIUrl":"https://doi.org/10.1109/DRCN.2007.4762278","url":null,"abstract":"QoS routes need availability assurance. Regardless of the applied protection scheme, there are several heuristic algorithms that can approximate the availability of connections based on the availability parameters of network components along the connection path. Accurate approximation can be achieved with simple and fast calculation only for the most basic protection schemes, the more complex the protection scheme is the more complex and long running calculation is required to get the result. Though, the inaccuracy of the heuristic algorithms is negligible in the most cases of practical usage. In this paper we present an availability calculation method for p-cycles that exploits the special properties of the p-cycle protection scheme and provides accurate results without enumerating all the possible network or protection configuration states. The method evaluates the availability of the connection along the working path link-by-link incrementally, pre-calculating also those conditional availabilities of the connection-part that may be used in latter calculations. Theoretically, the complexity of the algorithm is still O(2n), however, in fact n does not get high, moreover, it can be kept moderate low if the size of the cycles is constrained.","PeriodicalId":347030,"journal":{"name":"2007 6th International Workshop on Design and Reliable Communication Networks","volume":"6 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":"128528649","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

A multicast QoS Control scheme and system in EPON system EPON系统中的组播QoS控制方案及系统

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

YaLing Nie

引用次数: 2

Optimal placement of monitoring equipment in transparent optical networks 透明光网络中监控设备的优化配置

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

C. Mas Machuca, M. Kiese

引用次数: 13

A composition language for programmable traffic flow monitoring in multi-service self-managing networks 多业务自管理网络中可编程交通流监控的组合语言

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

R. Chaparadza

引用次数: 6

Exploiting connection-holding time for an efficient dynamic traffic grooming 利用连接保持时间进行有效的动态流量疏导

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

M. Tornatore, A. Baruffaldi, Hongyue Zhu, B. Mukherjee, A. Pattavina

{"title":"Exploiting connection-holding time for an efficient dynamic traffic grooming","authors":"M. Tornatore, A. Baruffaldi, Hongyue Zhu, B. Mukherjee, A. Pattavina","doi":"10.1109/DRCN.2007.4762265","DOIUrl":"https://doi.org/10.1109/DRCN.2007.4762265","url":null,"abstract":"Progress in network technologies and protocols is paving the road towards flexible optical transport networks, in which dynamic leasable circuits could be set up and released on a short-term basis according to customers requirements. Recently, new solutions for automatized network management promise to allow customers to on-line specify the terms of the Service Level Agreement (SLA) to be guaranteed by the service provider. Since this new information is made available, we propose to exploit the knowledge of connection holding time, among the other Service Level Specifications (SLS), to improve the routing efficiency. In this work we consider that a typical electronic-layer (e.g. SDH or MPLS) demand requires only a fraction of the capacity of the single wavelength bandwidth and we investigate a new algorithm for traffic grooming of sub-wavelength connections in an optical mesh network. We rely on the knowledge of the holding time of connection requests to efficiently exploit lightpath capacity and hence to achieve significant reduction in blocking probability for the traffic grooming problem. For a typical US nationwide network, we compare holding-time aware to holding-time-unaware, but otherwise efficient, approaches, obtaining remarkable reduction of blocking probability for practical scenarios.","PeriodicalId":347030,"journal":{"name":"2007 6th International Workshop on Design and Reliable Communication Networks","volume":"57 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":"128487944","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

Robust pre-provisioning of local protection resources in MPLS networks 支持MPLS网络中本地保护资源的鲁棒预发放

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

O. Klopfenstein

引用次数: 7

Design and performance evaluation of protected Super-EPON Access networks using a dedicated protection ring architecture 采用专用保护环架构的受保护Super-EPON接入网的设计与性能评估

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

J. Santos, Orlando Quadros, J. Pires, J. Pedro

引用次数: 3

Failure-specific self-protecting multipaths — increased capacity savings or overengineering? 特定于故障的自我保护多路径——增加容量节省还是过度设计?

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

M. Menth, Rüdiger Martin, Ulrich Spörlein

引用次数: 5