2009 7th International Workshop on Design of Reliable Communication Networks最新文献

筛选
英文 中文
Whole fiber switched p-cycles 整个光纤切换p周期
2009 7th International Workshop on Design of Reliable Communication Networks Pub Date : 2009-11-20 DOI: 10.1109/DRCN.2009.5340026
Diane Prisca Onguetou, W. Grover
{"title":"Whole fiber switched p-cycles","authors":"Diane Prisca Onguetou, W. Grover","doi":"10.1109/DRCN.2009.5340026","DOIUrl":"https://doi.org/10.1109/DRCN.2009.5340026","url":null,"abstract":"In the design of survivable optical networks, the cost and complexity of wavelength assignment and conversion and wavelength-selective switching is always a dominant consideration. And yet, while nodes and single DWDM channels may fail, a pre-dominant source of unavailability is physical damage to optical cables. Thus, we have considered: If it is ultimately glass that fails, what if we just replace the glass directly? More specifically, what if p-cycles were used to rapidly, simply and efficiently provide for the direct replacement of failed fiber sections with whole replacement fibers? As long as the loss budgets are adequate, entire DWDM wavebands could be restored with no switching or manipulation of individual lightpaths. Following a substitution transient, the DWDM layer would never know the break happened. In environments where fiber switching devices are low cost, and ducts are full of dark fiber, this could provide a very low cost alternative to protect an entire DWDM transport layer (or working capacity envelope) against the single largest cause of outage. Here, we make a first proposal of considering this approach. A main motivation is to remove the complexity due to wavelength assignment and wavelength continuity constraints when configuring p-cycles in a fully transparent network context. Another objective is the overall real CAPEX and OPEX cost reductions.","PeriodicalId":227820,"journal":{"name":"2009 7th International Workshop on Design of Reliable Communication Networks","volume":"16 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121001049","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}
引用次数: 2
Performance of a cognitive radio network with tolerable service degradation 可容忍服务退化的认知无线网络性能
2009 7th International Workshop on Design of Reliable Communication Networks Pub Date : 2009-11-20 DOI: 10.1109/DRCN.2009.5340006
Shensheng Tang, B. L. Mark
{"title":"Performance of a cognitive radio network with tolerable service degradation","authors":"Shensheng Tang, B. L. Mark","doi":"10.1109/DRCN.2009.5340006","DOIUrl":"https://doi.org/10.1109/DRCN.2009.5340006","url":null,"abstract":"We analyze the performance of a cognitive radio wireless network, where secondary users opportunistically share the radio spectrum with primary users through spectrum sensing and may cause service degradation to the primary users due to unreliable spectrum sensing. When a secondary user occupying a channel detects the presence of a primary call arriving to the channel, it switches from its current channel to another channel, if one is available, to continue its service; however, if the secondary user fails to detect the presence of the primary call, it remains on the channel and both calls will receive degraded service. Based on a queueing network model, we derive closed-form solutions for the equilibrium system state in terms of generating functions, and derive several performance metrics of interest. In particular, we introduce the system supportability metric to evaluate the extent to which the system can support secondary users and the interference factor to evaluate the degree of service degradation imposed on primary users by the secondary users. Numerical results are presented to show the impact of system parameters on the derived performance metrics.","PeriodicalId":227820,"journal":{"name":"2009 7th International Workshop on Design of Reliable Communication Networks","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116154933","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
Protection for MPLS-TP multicast services MPLS-TP组播业务保护
2009 7th International Workshop on Design of Reliable Communication Networks Pub Date : 2009-11-20 DOI: 10.1109/DRCN.2009.5339994
Jiang Zhang, S. Ruepp, M. Berger, H. Wessing
{"title":"Protection for MPLS-TP multicast services","authors":"Jiang Zhang, S. Ruepp, M. Berger, H. Wessing","doi":"10.1109/DRCN.2009.5339994","DOIUrl":"https://doi.org/10.1109/DRCN.2009.5339994","url":null,"abstract":"This paper proposes three innovative point-to-multipoint protection schemes to provide efficient and reliable MPLS Transport Profile multicast services, which is particularly relevant for the fast growing IPTV broadcast service. The three proposed protection schemes are all based on the interconnected rings structure, which is a widely deployed topology of legacy networks and has the natural ability to support resiliency. The first protection scheme extends the protection methods defined in the latest IETF draft standard to the interconnected rings structure. The second protection scheme introduces an adapted OAM function, which has the ability to monitor the multicast service's status, such as configuration failures, software failures and performance degradation, to ensure the reliability of the whole branches and leaves of the multicast service. Furthermore, the interconnecting nodes of the rings make the protection switching decision, which releases the work to upgrade every node on the existing ring and thereby eases the MPLS Transport Profile network deployment. Instead of having one working path in one direction and the other direction being used as protection path, in the third protection scheme, the paths in both directions are used as working paths. When there is a failure, the two working paths protect each other, which increases the efficiency of the network resources. The traffic distribution on the ring is divided by these two separated working paths, which lowers the amount of affected entities when a failure occurs.","PeriodicalId":227820,"journal":{"name":"2009 7th International Workshop on Design of Reliable Communication Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116841842","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
Diverse routing based on shared risk link groups 基于共享风险链接组的不同路由
2009 7th International Workshop on Design of Reliable Communication Networks Pub Date : 2009-11-20 DOI: 10.1109/DRCN.2009.5340011
M. Kiese, V. Marcheva, J. Eberspächer, D. Schupke
{"title":"Diverse routing based on shared risk link groups","authors":"M. Kiese, V. Marcheva, J. Eberspächer, D. Schupke","doi":"10.1109/DRCN.2009.5340011","DOIUrl":"https://doi.org/10.1109/DRCN.2009.5340011","url":null,"abstract":"This paper investigates the diverse routing problem in the presence of shared risk link groups (SRLGs) and proposes two ILP models for partial SRLG-disjoint protection based on grouping of the individual SRLGs in classes. We demonstrate our approach with SRLGs constructed from seismic maps, hence reducing the likelihood of a single earthquake affecting large portions of the network. Compared with the traditional diverse routing, our two models provide higher survivability with no increase in the overall routing cost, measured in terms of the total number of edges used.","PeriodicalId":227820,"journal":{"name":"2009 7th International Workshop on Design of Reliable Communication Networks","volume":"05 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129416510","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
A wavelength sharing and assignment heuristic to minimize the number of wavelength converters in resilient WDM networks 弹性WDM网络中波长转换器数量最小化的波长共享和分配启发式算法
2009 7th International Workshop on Design of Reliable Communication Networks Pub Date : 2009-11-20 DOI: 10.1109/DRCN.2009.5339989
Shreejith Billenahalli, M. Razo, Wanjun Huang, Arularasi Sivasankaran, L. Tang, Hars Vardhan, P. Monti, M. Tacca, A. Fumagalli
{"title":"A wavelength sharing and assignment heuristic to minimize the number of wavelength converters in resilient WDM networks","authors":"Shreejith Billenahalli, M. Razo, Wanjun Huang, Arularasi Sivasankaran, L. Tang, Hars Vardhan, P. Monti, M. Tacca, A. Fumagalli","doi":"10.1109/DRCN.2009.5339989","DOIUrl":"https://doi.org/10.1109/DRCN.2009.5339989","url":null,"abstract":"With the successful introduction of reconfigurable optical add-drop multiplexers (ROADMs) and related technologies, WDM networks are now growing in the number of optical nodes, wavelengths, and lambda services supported. In addition, shared path protection mechanisms — whereby lambda services are allowed to share protection wavelength channels — are possible at the optical (WDM) layer. Efficient strategies must be devised to both determine the set of services that must share a common protection wavelength channel and assign wavelengths to every service. One objective of these strategies is to minimize the total number of wavelength converters (WCs), which are required every time the wavelength continuity constraint cannot be met. This paper presents a scalable and efficient heuristic, whose goal is to minimize the number of WCs in resilient WDM networks supporting static sets of shared path protection lambda services. The heuristic comprises a set of polynomial algorithms that are executed sequentially to obtain a sub-optimal solution. In small size instances of the problem, the heuristic is compared against the optimal solution obtained from ILP formulation. For large size instances — tens of thousands of lambda services and hundreds of nodes — the heuristic yields an average number of WCs that is close to be linear in the number of services, despite the fact that the wavelength sharing factor increases.","PeriodicalId":227820,"journal":{"name":"2009 7th International Workshop on Design of Reliable Communication Networks","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123999832","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
Survivable design of reconfigurable MPLS VPN networks 可重构MPLS VPN网络的生存性设计
2009 7th International Workshop on Design of Reliable Communication Networks Pub Date : 2009-11-20 DOI: 10.1109/DRCN.2009.5340021
R. Cotter, D. Medhi
{"title":"Survivable design of reconfigurable MPLS VPN networks","authors":"R. Cotter, D. Medhi","doi":"10.1109/DRCN.2009.5340021","DOIUrl":"https://doi.org/10.1109/DRCN.2009.5340021","url":null,"abstract":"MPLS has become an increasingly common technology for guaranteed transport services for carrying customer traffic. We consider the survivable design problem from the perspective of an MPLS VPN network provider where the data rate required is dynamically configurable based on customers' traffic demands. Network optimization formulations for global design and end-to-end fast reroute design are presented. For the global design model, we present two variations: global sequential redesign and selective sequential redesign. Through computational work, we observe that as networks get larger, the relative cost of making that network survivable goes down. Furthermore, as a network of a given number of nodes increases its connectivity, the cost of survivability goes down. Finally, the global sequential redesign and selective sequential redesign methods produce survivable design costs that are comparable, while they are approximately 28% less expensive than the end-to-end fast reroute design approach for survivability.","PeriodicalId":227820,"journal":{"name":"2009 7th International Workshop on Design of Reliable Communication Networks","volume":"113 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117308502","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
Lightweight scheme for generating stealthy probes 产生隐形探测器的轻量级方案
2009 7th International Workshop on Design of Reliable Communication Networks Pub Date : 2009-11-20 DOI: 10.1109/DRCN.2009.5340003
S. Ganesh, A. Sethi, R. Hardy
{"title":"Lightweight scheme for generating stealthy probes","authors":"S. Ganesh, A. Sethi, R. Hardy","doi":"10.1109/DRCN.2009.5340003","DOIUrl":"https://doi.org/10.1109/DRCN.2009.5340003","url":null,"abstract":"Probing based approaches have been effectively used for network monitoring in the past. Probes such as ICMP pings provide an effective tool for detecting compromised nodes which try to delay or drop traffic. But an intelligent attacker may evade detection by giving preferential treatment to probe traffic. This is usually possible because probe packets have a different format from regular application packets and are easily distinguishable. The solution to this problem is to create stealthy probes which are indistinguishable from normal application traffic. In this paper, we build upon our earlier work on the design approaches for stealthy probing, and we propose a lightweight and effective scheme for generating stealthy probes.","PeriodicalId":227820,"journal":{"name":"2009 7th International Workshop on Design of Reliable Communication Networks","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124955803","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}
引用次数: 1
Darkstar: Using exploratory data mining to raise the bar on network reliability and performance Darkstar:使用探索性数据挖掘来提高网络可靠性和性能
2009 7th International Workshop on Design of Reliable Communication Networks Pub Date : 2009-11-20 DOI: 10.1109/DRCN.2009.5340032
C. Kalmanek, Ihui Ge, Seungjoon Lee, C. Lund, Dan Pei, J. Seidel, J. Merwe, Jennifer Ates
{"title":"Darkstar: Using exploratory data mining to raise the bar on network reliability and performance","authors":"C. Kalmanek, Ihui Ge, Seungjoon Lee, C. Lund, Dan Pei, J. Seidel, J. Merwe, Jennifer Ates","doi":"10.1109/DRCN.2009.5340032","DOIUrl":"https://doi.org/10.1109/DRCN.2009.5340032","url":null,"abstract":"Networks have become a critical infrastructure, and performance requirements for network-based applications are becoming increasingly stringent. This trend challenges service providers to raise the bar on the performance and reliability of network services. To achieve this, new network and service management systems are needed that enable providers to continually improve performance, identify issues that are flying under the radar of network operations, and troubleshoot complex issues. This paper presents the Darkstar system, which allows analysts to address these challenges using exploratory data mining and sophisticated correlation tools. We present an overview of key applications that are built on top of the Darkstar system to illustrate the power of the approach.","PeriodicalId":227820,"journal":{"name":"2009 7th International Workshop on Design of Reliable Communication Networks","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130633099","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}
引用次数: 33
Model based evaluation of policies for end-node driven fault recovery 基于模型的终端节点驱动故障恢复策略评估
2009 7th International Workshop on Design of Reliable Communication Networks Pub Date : 2009-11-20 DOI: 10.1109/DRCN.2009.5339983
Jesper Grønbæk, H. Schwefel, T. Toftegaard
{"title":"Model based evaluation of policies for end-node driven fault recovery","authors":"Jesper Grønbæk, H. Schwefel, T. Toftegaard","doi":"10.1109/DRCN.2009.5339983","DOIUrl":"https://doi.org/10.1109/DRCN.2009.5339983","url":null,"abstract":"In evolving ubiquitous networking environments some end-nodes will rely on highly critical end-user services in infrastructure and ad-hoc networks. As future networks will be dominated by mobility and unreliable wireless links, providing such critical end-user services is a challenge. In this work we target the problem of managing faults in such networking systems by fault management driven by the end-node. We introduce a system model to evaluate recovery decision policies based on fault diagnosis capabilities. The model method is applied in a scenario of hand-over between wireless access points. Evaluated policies are (1) no fail-over, (2) fail-over at fault diagnosis and (3) time restricted fail-over. Comparison to detailed simulations show that the developed Markov model is suitable to maximize end-user service reliability - in this case for the example of an SCTP file transfer. The numerical results from the model allow to determine the best strategy and its parameters depending on properties of the fault-diagnosis component.","PeriodicalId":227820,"journal":{"name":"2009 7th International Workshop on Design of Reliable Communication Networks","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121126305","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}
引用次数: 4
Optimizing the IP router update process with traffic-driven updates 通过流量驱动更新优化IP路由器更新过程
2009 7th International Workshop on Design of Reliable Communication Networks Pub Date : 2009-11-20 DOI: 10.1109/DRCN.2009.5340018
W. Tavernier, D. Papadimitriou, D. Colle, M. Pickavet, P. Demeester
{"title":"Optimizing the IP router update process with traffic-driven updates","authors":"W. Tavernier, D. Papadimitriou, D. Colle, M. Pickavet, P. Demeester","doi":"10.1109/DRCN.2009.5340018","DOIUrl":"https://doi.org/10.1109/DRCN.2009.5340018","url":null,"abstract":"The update process in an IP router after a failure is detected, is a complex process involving more than just recalculating shortest paths. When statistics related to forwarded traffic are not taken into account, which is generally the case, we show that packet loss can be significantly higher than is strictly needed. In this paper we present a combined control and traffic-driven routing table update scheme which minimizes the packet loss during the switchover, based on an efficient use and planning of the central router process quantum. We discuss the parameters of the algorithm and show its value in a simulation environment.","PeriodicalId":227820,"journal":{"name":"2009 7th International Workshop on Design of Reliable Communication Networks","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123454723","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
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信