Routing in a delay tolerant network

Jain, Shailendra Pratap; Fall, Kevin; Patra, Rabin

doi:10.1145/1015467.1015484

Cited by 1,182 publications

(527 citation statements)

References 9 publications

Supporting

Mentioning

507

Contrasting

Unclassified

Order By: Relevance

“…Link delays resulting from congestion due to the intensive use 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 of network resources may be difficult to conceal [159]. When the problem is less severe, routing algorithms may solve part of the problem, as shown by Heller et al [47] and Hock et al [49].…”

Section: Disruption Tolerancementioning

confidence: 99%

Resilience support in software-defined networking: A survey

et al. 2015

View full text Add to dashboard Cite

Software-Defined Networking (SDN) is an architecture for computer networking that provides a clear separation between network control functions and forwarding operations. The abstractions supported by this architecture are intended to simplify the implementation of several tasks that are critical to network operation, such as routing and network management. Computer networks have an increasingly important societal role, requiring them to be resilient to a range of challenges. Previously, research into network resilience has focused on the mitigation of several types of challenges, such as natural disasters and attacks. Capitalising on its benefits, including increased programmability and a clearer separation of concerns, significant attention has recently focused on the development of resilience mechanisms that use software-defined networking approaches. In this article, we present a survey that provides a structured overview of the resilience support that currently exists in this important area. We categorize the most recent research on this topic with respect to a number of resilience disciplines. Additionally, we discuss the lessons learned from this investigation, highlight the main challenges faced by SDNs moving forward, and outline the research trends in terms of solutions to mitigate these challenges . 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 This article presents a survey on the support for network resilience in SoftwareDefined Networking (SDN). This has been the subject of intense investigation by the academic and industrial community in the past few years, as evidenced by the number of papers included in our survey (159 references in total). Capitalizing on the benefits of SDN, including increased programmability and a clearer separation of concerns, significant attention has recently focused on the development of resilience mechanisms that use software-defined networking approaches. Thus, a wide range of solutions to classical network problems have been revisited using this architecture, but many problems continue to be challenging.Our survey investigates the resilience support that currently exists in this important area, and categorizes the most recent research on this topic with respect to a number of resilience disciplines. Additionally, we discuss the lessons learned from this investigation, highlight the main challenges faced by SDNs moving forward, and outline the research trends in terms of solutions to mitigate these challenges. The aim of the survey is to offer to the reader a structured view of network resilience in the SDN spectrum, and how resilience aspects are supported in these architectures.We believe that this subject material is closely aligned with the objectives of the journal. Please be assured that:1. This paper has not been published or accepted for publication w...

show abstract

Section: Disruption Tolerancementioning

confidence: 99%

Resilience support in software-defined networking: A survey

et al. 2015

View full text Add to dashboard Cite

show abstract

“…In other words, a runtime self-adaptation of the weightings is used for this evaluation process that could be categorized as a typical autonomic mechanism (Jain et al, 2004). A simple solution to this problem is the introduction of adaptive weights a i into the previous formula, in order to modify the utility function according to the variation of the context Eq.…”

Section: Automatic Adaptation Of the Utility Functionsmentioning

confidence: 99%

Efficient Broadcasting in Mobile Ad Hoc Networks Using Context Aware Adaptive Routing Protocol during Network Partitions

Bavithiraja¹

2012

Journal of Computer Science

View full text Add to dashboard Cite

Problem statement:In mobile ado network, broadcasting is a common operation for route establishment and for sending control and emergency messages. Reliable Broadcasting in mobile ad hoc networks requires delivery of messages from different sources to all the nodes of the network within bounded time. The nodes are highly mobile and the network is highly dynamic and decentralized. Most of the existing routing protocols in MANET have the assumption that a path exists between the sender and the receiver. But the decentralized mobile ad hoc network is characterized by frequent network partitions. Providing reliable broadcasting is a challenging task. Approach: In study, a new context aware adaptive routing protocol is designed for broadcasting. The protocol is based on the idea of exploiting nodes as carriers of messages among network partitions to achieve guaranteed delivery. The choice of the best carrier is made dynamically by using Kalman filter based prediction techniques and utility theory. Results: Simulation results show that the proposed protocol achieves better packet deliver ratio with reduced control overhead and packet loss during network partition. Conclusion: The proposed routing protocol chooses the carrier node dynamically based on the context information, it provides reliable broadcasting to all the nodes with minimum packet loss and control overhead.

show abstract

“…Mechanisms that provide information to predict the device and traffic behavior, and which are difficult or impossible to gather in realistic scenarios, are known as oracles [7]. Provided that the information is accurate, strategies can make very efficient use of network resources by forwarding a flow along the best path.…”

Section: Related Workmentioning

confidence: 99%

“…When we look through the available routing protocols in the research arena, we can find big variances in the motivations, approaches and methodologies used. Jain, Fall and Patra [7] have proposed several oracles with future insight. Although, such methods are unrealistic, they can help to understand the nature and behavior of underlying networks, such as to reveal the hidden complexities of the propagation of messages that are not perceivable otherwise.…”

Section: Introductionmentioning

confidence: 99%

“…On the other hand, the realistic protocols mostly consist of history based methods that utilized the past behavior shown by devices to predict their future pattern. Motivated by the work in [7,8] we have performed max-flow computations on three different opportunistic networks and then compared the results by performing max-flow computations on history generated by the respective networks. We have varied the historical information available to devices in the network to observe its effects on the maxflow throughput.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Analyzing History Quality for Routing Purposes in Opportunistic Network Using Max-Flow

Islam

Waldvogel

2012

WET

View full text Add to dashboard Cite

Most of the existing opportunistic network routing protocols are based on some type of utility function that is directly or indirectly dependent on the past behavior of devices. The past behavior or history of a device is usually referred to as contacts that the device had in the past. Whatever may be the metric of history, most of these routing protocols work on the realistic premise that node mobility is not truly random. In contrast, there are several oracles based methods where such oracles assist these methods to gain access to information that is unrealistic in the real world. Although, such oracles are unrealistic, they can help to understand the nature and behavior of underlying networks. In this paper, we have analyzed the gap between these two extremes. We have performed max-flow computations on three different opportunistic networks and then compared the results by performing max-flow computations on history generated by the respective networks. We have found that the correctness of the history based prediction of history is dependent on the dense nature of the underlying network. Moreover, the history based prediction can deliver correct paths but cannot guarantee their absolute reliability.

show abstract

Routing in a delay tolerant network

Cited by 1,182 publications

References 9 publications

Resilience support in software-defined networking: A survey

Resilience support in software-defined networking: A survey

Efficient Broadcasting in Mobile Ad Hoc Networks Using Context Aware Adaptive Routing Protocol during Network Partitions

Analyzing History Quality for Routing Purposes in Opportunistic Network Using Max-Flow

Contact Info

Product

Resources

About