Pub Date : 2009-11-20DOI: 10.1109/DRCN.2009.5340026
Diane Prisca Onguetou, W. Grover
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.
{"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}
Pub Date : 2009-11-20DOI: 10.1109/DRCN.2009.5340006
Shensheng Tang, B. L. Mark
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.
{"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}
Pub Date : 2009-11-20DOI: 10.1109/DRCN.2009.5339994
Jiang Zhang, S. Ruepp, M. Berger, H. Wessing
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.
本文提出了三种创新的点对多点保护方案，以提供高效可靠的MPLS传输配置文件组播服务，这与快速发展的IPTV广播业务特别相关。提出的三种保护方案都基于互连环结构，这是一种广泛部署的传统网络拓扑结构，具有支持弹性的天然能力。第一个保护方案将最新IETF标准草案中定义的保护方法扩展到互连环结构。第二种保护方案引入了自适应的OAM功能，该功能能够监控组播服务的状态，如配置故障、软件故障和性能下降，以确保组播服务的整个分支和叶子的可靠性。此外，环上的互连节点做出保护交换决策，从而减少了对现有环上每个节点的升级工作，从而简化了MPLS Transport Profile网络的部署。在第三种保护方案中，不再使用一个方向上的一条工作路径，而使用另一个方向上的路径作为保护路径，而是使用两个方向上的路径作为工作路径。当发生故障时，两条工作路径相互保护，提高了网络资源的使用效率。环路上的流量分布由这两条独立的工作路径划分，从而减少了故障发生时受影响实体的数量。
{"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}
Pub Date : 2009-11-20DOI: 10.1109/DRCN.2009.5340011
M. Kiese, V. Marcheva, J. Eberspächer, D. Schupke
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.
{"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}
Pub Date : 2009-11-20DOI: 10.1109/DRCN.2009.5339989
Shreejith Billenahalli, M. Razo, Wanjun Huang, Arularasi Sivasankaran, L. Tang, Hars Vardhan, P. Monti, M. Tacca, A. Fumagalli
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.
{"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}
Pub Date : 2009-11-20DOI: 10.1109/DRCN.2009.5340021
R. Cotter, D. Medhi
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.
{"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}
Pub Date : 2009-11-20DOI: 10.1109/DRCN.2009.5340003
S. Ganesh, A. Sethi, R. Hardy
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.
{"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}
Pub Date : 2009-11-20DOI: 10.1109/DRCN.2009.5340032
C. Kalmanek, Ihui Ge, Seungjoon Lee, C. Lund, Dan Pei, J. Seidel, J. Merwe, Jennifer Ates
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.
{"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}
Pub Date : 2009-11-20DOI: 10.1109/DRCN.2009.5339983
Jesper Grønbæk, H. Schwefel, T. Toftegaard
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.
{"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}
Pub Date : 2009-11-20DOI: 10.1109/DRCN.2009.5340018
W. Tavernier, D. Papadimitriou, D. Colle, M. Pickavet, P. Demeester
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.
{"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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：