Pub Date : 2009-11-20DOI: 10.1109/DRCN.2009.5340022
Shensheng Tang, B. L. Mark
We study the potential threat for virus spread in wireless sensor networks (WSNs). Using epidemic theory, we proposed a new model, called Susceptible-Infective-Recovered with Maintenance (SIR-M), to characterize the dynamics of the virus spread process from a single node to the entire network. By introducing a maintenance mechanism in the sleep mode of WSNs, the SIR-M model can improve the network's anti-virus capability and enable the network to adapt flexibly to different types of viruses, without incurring additional computational or signaling overhead. The proposed model can capture both the spatial and temporal dynamics of the virus spread process. We derive explicit analytical solutions for the model and discuss some practical applications of interest. Extensive numerical results are presented to validate our analysis. The proposed model is applicable to the design and analysis of information propagation mechanisms in communication networks.
{"title":"Analysis of virus spread in wireless sensor networks: An epidemic model","authors":"Shensheng Tang, B. L. Mark","doi":"10.1109/DRCN.2009.5340022","DOIUrl":"https://doi.org/10.1109/DRCN.2009.5340022","url":null,"abstract":"We study the potential threat for virus spread in wireless sensor networks (WSNs). Using epidemic theory, we proposed a new model, called Susceptible-Infective-Recovered with Maintenance (SIR-M), to characterize the dynamics of the virus spread process from a single node to the entire network. By introducing a maintenance mechanism in the sleep mode of WSNs, the SIR-M model can improve the network's anti-virus capability and enable the network to adapt flexibly to different types of viruses, without incurring additional computational or signaling overhead. The proposed model can capture both the spatial and temporal dynamics of the virus spread process. We derive explicit analytical solutions for the model and discuss some practical applications of interest. Extensive numerical results are presented to validate our analysis. The proposed model is applicable to the design and analysis of information propagation mechanisms in communication networks.","PeriodicalId":227820,"journal":{"name":"2009 7th International Workshop on Design of Reliable Communication Networks","volume":"90 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":"131244680","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.5340016
William Liu, H. Sirisena, K. Pawlikowski, Allan McInnes
In studies of survivable networks, it is important to be able to differentiate network topologies by means of a robust numerical measure that indicates the levels of immunity of these topologies to failures of their nodes and links. Ideally, such a measure should be sensitive to the existence of nodes or links which are more important than others, for example, if their failures cause the network's disintegration. In this paper, we suggest using an algebraic connectivity metric, adopted from spectral graph theory, namely the 2nd smallest eigenvalue of the Laplacian matrix of the network topology, instead of the average nodal degree that is usually used to characterize network connectivity in studies of the spare capacity allocation problem. Extensive simulation studies confirm that this metric is a more informative and more accurate parameter than the average nodal degree for characterizing network topologies in survivability studies.
{"title":"Utility of algebraic connectivity metric in topology design of survivable networks","authors":"William Liu, H. Sirisena, K. Pawlikowski, Allan McInnes","doi":"10.1109/DRCN.2009.5340016","DOIUrl":"https://doi.org/10.1109/DRCN.2009.5340016","url":null,"abstract":"In studies of survivable networks, it is important to be able to differentiate network topologies by means of a robust numerical measure that indicates the levels of immunity of these topologies to failures of their nodes and links. Ideally, such a measure should be sensitive to the existence of nodes or links which are more important than others, for example, if their failures cause the network's disintegration. In this paper, we suggest using an algebraic connectivity metric, adopted from spectral graph theory, namely the 2nd smallest eigenvalue of the Laplacian matrix of the network topology, instead of the average nodal degree that is usually used to characterize network connectivity in studies of the spare capacity allocation problem. Extensive simulation studies confirm that this metric is a more informative and more accurate parameter than the average nodal degree for characterizing network topologies in survivability studies.","PeriodicalId":227820,"journal":{"name":"2009 7th International Workshop on Design of Reliable Communication Networks","volume":"37 4 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":"124191582","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.5339995
A. Mereu, D. Cherubini, A. Fanni, A. Frangioni
The paper describes an optimization model which aims at minimizing the maximum link utilization of IP telecommunication networks under the joint use of the traditional IGP protocols and the more sophisticated MPLS-TE technology. The survivability of the network is taken into account in the optimization process implementing the path restoration scheme. This scheme benefits of the Fast Re-Route (FRR) capability allowing service providers to offer high availability and high revenue SLAs (Service Level Agreements). The hybrid IGP/MPLS approach relies on the formulation of an innovative Linear Programming mathematical model that, while optimizing the network utilization, provides optimal user performance, efficient use of network resources, and 100% survivability in case of single link failure. The possibility of performing an optimal exploitation of the network resources throughout the joint use of the IGP and MPLS protocols provides a flexible tool for the ISP (Internet Service Provider) networks traffic engineers. The efficiency of the proposed approach is validated by a wide experimentation performed on synthetic and real networks. The obtained results show that a limited number of LSP tunnels have to be set up in order to significantly reduce the congestion level of the network while at the same time guaranteeing the survivability of the network.
本文描述了在传统IGP协议和更复杂的MPLS-TE技术联合使用的情况下，以最小化IP通信网络的最大链路利用率为目标的优化模型。在实现路径恢复方案的优化过程中，考虑了网络的生存性。该方案得益于快速重路由(FRR)功能，允许服务提供商提供高可用性和高收益sla(服务水平协议)。IGP/MPLS混合方式依靠创新的线性规划数学模型的制定，在优化网络利用率的同时，提供最佳的用户性能，有效利用网络资源，并在单链路故障情况下提供100%的生存能力。通过IGP和MPLS协议的联合使用，实现网络资源最优利用的可能性，为ISP (Internet Service Provider)网络流量工程师提供了一个灵活的工具。在合成网络和真实网络上进行的大量实验验证了该方法的有效性。研究结果表明，在保证网络生存能力的同时，必须建立有限数量的LSP隧道，才能显著降低网络的拥塞程度。
{"title":"Primary and backup paths optimal design for traffic engineering in hybrid IGP/MPLS networks","authors":"A. Mereu, D. Cherubini, A. Fanni, A. Frangioni","doi":"10.1109/DRCN.2009.5339995","DOIUrl":"https://doi.org/10.1109/DRCN.2009.5339995","url":null,"abstract":"The paper describes an optimization model which aims at minimizing the maximum link utilization of IP telecommunication networks under the joint use of the traditional IGP protocols and the more sophisticated MPLS-TE technology. The survivability of the network is taken into account in the optimization process implementing the path restoration scheme. This scheme benefits of the Fast Re-Route (FRR) capability allowing service providers to offer high availability and high revenue SLAs (Service Level Agreements). The hybrid IGP/MPLS approach relies on the formulation of an innovative Linear Programming mathematical model that, while optimizing the network utilization, provides optimal user performance, efficient use of network resources, and 100% survivability in case of single link failure. The possibility of performing an optimal exploitation of the network resources throughout the joint use of the IGP and MPLS protocols provides a flexible tool for the ISP (Internet Service Provider) networks traffic engineers. The efficiency of the proposed approach is validated by a wide experimentation performed on synthetic and real networks. The obtained results show that a limited number of LSP tunnels have to be set up in order to significantly reduce the congestion level of the network while at the same time guaranteeing the survivability of the network.","PeriodicalId":227820,"journal":{"name":"2009 7th International Workshop on Design of Reliable Communication Networks","volume":"8 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":"128036073","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.5339987
P. Chołda, A. Mykkeltveit, B. Helvik, A. Jajszczyk
The paper advocates that in some communication service providing settings, it is more appropriate to focus on the continuity of a connection as the prime reliability attribute for defining requirements and establishing Service Level Agreements, rather than the traditionally used availability. The justification for this approach and types of services where continuity is relevant are given. For illustration, a transport network with an optical control plane for a utility grid along with some theoretical background is studied.
{"title":"Continuity-based resilient communication","authors":"P. Chołda, A. Mykkeltveit, B. Helvik, A. Jajszczyk","doi":"10.1109/DRCN.2009.5339987","DOIUrl":"https://doi.org/10.1109/DRCN.2009.5339987","url":null,"abstract":"The paper advocates that in some communication service providing settings, it is more appropriate to focus on the continuity of a connection as the prime reliability attribute for defining requirements and establishing Service Level Agreements, rather than the traditionally used availability. The justification for this approach and types of services where continuity is relevant are given. For illustration, a transport network with an optical control plane for a utility grid along with some theoretical background is studied.","PeriodicalId":227820,"journal":{"name":"2009 7th International Workshop on Design of Reliable Communication Networks","volume":"23 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":"133728907","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.5340017
T. Farley, C. Colbourn
Network reliability, specifically k-terminal reliability, gives the probability that k specified nodes in a network are connected. Multi-terminal network resilience measures the average k-terminal reliability over all node sets of size k. This is the expectation that a randomly chosen set of k nodes is connected. One may also ask for the probability that any k nodes are connected. This leads to three ways to require a set of k nodes be connected: the nodes are provided as input to the problem (as in reliability), they are randomly chosen (as in resilience), or they can be any k nodes. Certain problems may require a set constructed by some combination of the three. We introduce new measures to cover these possibilities, and reduce all measures to two general expressions that capture them. These expressions permit the consideration of decades of work on reliability to solve them. Additionally, we introduce six component-based network measures, and demonstrate how they can be solved alongside reliability and resilience. The component based measures admit even more variability in problem definition. In the end, we have thirteen distinct measures, and solve them simultaneously. An algorithm and example results are provided.
{"title":"Multiterminal measures for network reliability and resilience","authors":"T. Farley, C. Colbourn","doi":"10.1109/DRCN.2009.5340017","DOIUrl":"https://doi.org/10.1109/DRCN.2009.5340017","url":null,"abstract":"Network reliability, specifically k-terminal reliability, gives the probability that k specified nodes in a network are connected. Multi-terminal network resilience measures the average k-terminal reliability over all node sets of size k. This is the expectation that a randomly chosen set of k nodes is connected. One may also ask for the probability that any k nodes are connected. This leads to three ways to require a set of k nodes be connected: the nodes are provided as input to the problem (as in reliability), they are randomly chosen (as in resilience), or they can be any k nodes. Certain problems may require a set constructed by some combination of the three. We introduce new measures to cover these possibilities, and reduce all measures to two general expressions that capture them. These expressions permit the consideration of decades of work on reliability to solve them. Additionally, we introduce six component-based network measures, and demonstrate how they can be solved alongside reliability and resilience. The component based measures admit even more variability in problem definition. In the end, we have thirteen distinct measures, and solve them simultaneously. An algorithm and example results are provided.","PeriodicalId":227820,"journal":{"name":"2009 7th International Workshop on Design of Reliable Communication Networks","volume":"3 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":"131687372","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.5340008
Tae-Hoon Kim, D. Tipper, P. Krishnamurthy, A. L. Swindlehurst
In order to effectively deploy survivability techniques to improve the resilience of mobile ad hoc networks, one must be able to identify all the weak points of the network topology. The weak or critical points of the topology are those links and nodes whose failure results in partitioning of the network. Here we propose a new algorithm based on results from algebraic graph theory, that can find the critical points in the network for single and multiple failure cases. Utilizing this algorithm we present numerical results that examine how the number of critical points varies with nodal density. Secondly, we propose three localized topological control schemes to improve the network connectivity around critical points to lessen their importance and improve the network resilience. Numerical studies to evaluate the proposed schemes under node and link failure network conditions are presented.
{"title":"Improving the topological resilience of mobile ad hoc networks","authors":"Tae-Hoon Kim, D. Tipper, P. Krishnamurthy, A. L. Swindlehurst","doi":"10.1109/DRCN.2009.5340008","DOIUrl":"https://doi.org/10.1109/DRCN.2009.5340008","url":null,"abstract":"In order to effectively deploy survivability techniques to improve the resilience of mobile ad hoc networks, one must be able to identify all the weak points of the network topology. The weak or critical points of the topology are those links and nodes whose failure results in partitioning of the network. Here we propose a new algorithm based on results from algebraic graph theory, that can find the critical points in the network for single and multiple failure cases. Utilizing this algorithm we present numerical results that examine how the number of critical points varies with nodal density. Secondly, we propose three localized topological control schemes to improve the network connectivity around critical points to lessen their importance and improve the network resilience. Numerical studies to evaluate the proposed schemes under node and link failure network conditions are presented.","PeriodicalId":227820,"journal":{"name":"2009 7th International Workshop on Design of Reliable Communication Networks","volume":"13 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":"114217457","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.5340009
Peera Pacharintanakul, D. Tipper
Survivability is a critical requirement for reliable services in any network. As the Internet moves towards a three layer architecture consisting of Overlay on top of IP on top of WDM-based networks incorporating the interaction between and among network layers is crucial for efficient and effective implementation of survivability. This paper highlights the challenges of providing survivability in three-layer networks and develops a novel approach crosslayer survivable mapping to offer such survivability in an efficient way. We investigate the impacts of overlay network dependency on lower layer network layout in terms of the capacity allocated to overlay paths. The results demonstrate the impact due to layer dependency that it is more severe than initially anticipated making it clear that single layer network design is inadequate to assure service guarantees and efficient capacity allocation.
{"title":"Crosslayer survivable mapping in Overlay-IP-WDM networks","authors":"Peera Pacharintanakul, D. Tipper","doi":"10.1109/DRCN.2009.5340009","DOIUrl":"https://doi.org/10.1109/DRCN.2009.5340009","url":null,"abstract":"Survivability is a critical requirement for reliable services in any network. As the Internet moves towards a three layer architecture consisting of Overlay on top of IP on top of WDM-based networks incorporating the interaction between and among network layers is crucial for efficient and effective implementation of survivability. This paper highlights the challenges of providing survivability in three-layer networks and develops a novel approach crosslayer survivable mapping to offer such survivability in an efficient way. We investigate the impacts of overlay network dependency on lower layer network layout in terms of the capacity allocated to overlay paths. The results demonstrate the impact due to layer dependency that it is more severe than initially anticipated making it clear that single layer network design is inadequate to assure service guarantees and efficient capacity allocation.","PeriodicalId":227820,"journal":{"name":"2009 7th International Workshop on Design of Reliable Communication Networks","volume":"54 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":"124875126","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.5340002
Diego Lucerna, M. Tornatore, B. Mukherjee, A. Pattavina
Recently, new solutions for automatized management in optical networks promise to allow customers to specify on-demand the terms of the Service Level Agreement (SLA) to be guaranteed by the Service Provider (SP). For a WDM mesh network that provides shared-path-protection we exploit the knowledge, among the other Service Level Specifications (SLS), of the connection holding time to dynamically manage the availability provided by the network to the connection during its lifetime. We monitor the actual availability provided to the connection, considering, e.g., the actual downtime experienced by the connection, and, every time the network status changes (typically, for a fault occurrence, or a connection departure or arrival), we evaluate the maximal availability that can be provided to the connection based on our knowledge of all the predictable network state changes, i.e., the future connection departures. Since some of the connection will be ahead of their stipulated availability (credit), while other connections will be behind their availability requirements (debit), we propose a mechanism that allows to “trade” availability “credits” and “debits”, by increasing or decreasing the shareability level of the backup capacity. So, we introduce an holding-time-aware approach which permits to manage in a more flexible manner the availability provided during the connection lifetimes. For a typical wavelength-convertible US nationwide network, our approach obtains significative savings on Blocking Probability (BP), while reducing the penalties due to SLA violations.
{"title":"Availability target redefinition for dynamic connections in WDM networks with shared path protection","authors":"Diego Lucerna, M. Tornatore, B. Mukherjee, A. Pattavina","doi":"10.1109/DRCN.2009.5340002","DOIUrl":"https://doi.org/10.1109/DRCN.2009.5340002","url":null,"abstract":"Recently, new solutions for automatized management in optical networks promise to allow customers to specify on-demand the terms of the Service Level Agreement (SLA) to be guaranteed by the Service Provider (SP). For a WDM mesh network that provides shared-path-protection we exploit the knowledge, among the other Service Level Specifications (SLS), of the connection holding time to dynamically manage the availability provided by the network to the connection during its lifetime. We monitor the actual availability provided to the connection, considering, e.g., the actual downtime experienced by the connection, and, every time the network status changes (typically, for a fault occurrence, or a connection departure or arrival), we evaluate the maximal availability that can be provided to the connection based on our knowledge of all the predictable network state changes, i.e., the future connection departures. Since some of the connection will be ahead of their stipulated availability (credit), while other connections will be behind their availability requirements (debit), we propose a mechanism that allows to “trade” availability “credits” and “debits”, by increasing or decreasing the shareability level of the backup capacity. So, we introduce an holding-time-aware approach which permits to manage in a more flexible manner the availability provided during the connection lifetimes. For a typical wavelength-convertible US nationwide network, our approach obtains significative savings on Blocking Probability (BP), while reducing the penalties due to SLA violations.","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":"130413685","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.5339982
M. Berger, H. Wessing, S. Ruepp
This tutorial addresses how Carrier Ethernet technologies can be used in the transport network to provide resilience to the packet layer. Carrier Ethernet networks based on PBB-TE and T-MPLS/MPLS-TP are strong candidates for reliable transport of triple-play services. These technologies offer Operation, Administration and Management (OAM) functionalities and support for Quality of Service (QoS), required to obtain carrier grade quality. This tutorial provides an overview of the current level of standardization followed by an exhaustive survey of Carrier Ethernet reliability. A number of enhancements are still required to make Carrier Ethernet ready for large scale deployments of reliable point-to-multipoint services. The tutorial highlights the necessary enhancements and shows possible solutions and directions towards reliable multicast. Explicit focus is on OAM for multicast, where the signalling to identify faults is described. Finally, best practises from a Danish National project are shown.
{"title":"Proposal for tutorial: Resilience in carrier Ethernet transport","authors":"M. Berger, H. Wessing, S. Ruepp","doi":"10.1109/DRCN.2009.5339982","DOIUrl":"https://doi.org/10.1109/DRCN.2009.5339982","url":null,"abstract":"This tutorial addresses how Carrier Ethernet technologies can be used in the transport network to provide resilience to the packet layer. Carrier Ethernet networks based on PBB-TE and T-MPLS/MPLS-TP are strong candidates for reliable transport of triple-play services. These technologies offer Operation, Administration and Management (OAM) functionalities and support for Quality of Service (QoS), required to obtain carrier grade quality. This tutorial provides an overview of the current level of standardization followed by an exhaustive survey of Carrier Ethernet reliability. A number of enhancements are still required to make Carrier Ethernet ready for large scale deployments of reliable point-to-multipoint services. The tutorial highlights the necessary enhancements and shows possible solutions and directions towards reliable multicast. Explicit focus is on OAM for multicast, where the signalling to identify faults is described. Finally, best practises from a Danish National project are shown.","PeriodicalId":227820,"journal":{"name":"2009 7th International Workshop on Design of Reliable Communication Networks","volume":"11 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":"127201534","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-10-28DOI: 10.1109/DRCN.2009.5340007
S. Dabideen, Bradley R. Smith, J. Garcia-Luna-Aceves
We present a new approach to secure routing in MANETs and argue that the same approach can lead to more reliable routing in the face of node and link failure. Prior solutions to security in networks is inapplicable to routing in MANETs because of node mobility and the relative scarcity of bandwidth. Furthermore, path discovery does not necessarily translate into data delivery. We argue that secure routing in MANETs must be based on the end-to-end verification of physical-path characteristics aided by the exploitation of path diversity to find secure paths. We apply this approach to the design of the Secure Routing through Diversity and Verification (SRDV) protocol, a secure routing protocol that we show to be as efficient as unsecured on-demand or proactive routing approaches in the absence of attacks and capable of defending against a variety of attacks. Redundancy, through diversity, not only can be used to provide security, but it is also crucial to the survivability of the network thus establishing an insightful link between security and survivability of the network.
{"title":"An end-to-end solution for secure and survivable routing in MANETs","authors":"S. Dabideen, Bradley R. Smith, J. Garcia-Luna-Aceves","doi":"10.1109/DRCN.2009.5340007","DOIUrl":"https://doi.org/10.1109/DRCN.2009.5340007","url":null,"abstract":"We present a new approach to secure routing in MANETs and argue that the same approach can lead to more reliable routing in the face of node and link failure. Prior solutions to security in networks is inapplicable to routing in MANETs because of node mobility and the relative scarcity of bandwidth. Furthermore, path discovery does not necessarily translate into data delivery. We argue that secure routing in MANETs must be based on the end-to-end verification of physical-path characteristics aided by the exploitation of path diversity to find secure paths. We apply this approach to the design of the Secure Routing through Diversity and Verification (SRDV) protocol, a secure routing protocol that we show to be as efficient as unsecured on-demand or proactive routing approaches in the absence of attacks and capable of defending against a variety of attacks. Redundancy, through diversity, not only can be used to provide security, but it is also crucial to the survivability of the network thus establishing an insightful link between security and survivability of the network.","PeriodicalId":227820,"journal":{"name":"2009 7th International Workshop on Design of Reliable Communication Networks","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126196900","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
扫码关注我们
求助内容：
应助结果提醒方式：