Delay-Tolerant Networking
[Burgess-Gallagher-Jensen-Levine-2006 .]
John Burgess, Brian Gallagher, David Jensen, Brian Neil Levine,
“MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks”,
in Proc. IEEE INFOCOM, April 2006
Abstract: “Disruption-tolerant networks (DTNs) attempt to route network messages via intermittently connected nodes. Routing in such environments is difficult because peers have little information about the state of the partitioned network and transfer opportunities between peers are of limited duration. In this paper, we propose MaxProp, a protocol for effective routing of DTN messages. MaxProp is based on prioritizing both the schedule of packets transmitted to other peers and the schedule of packets to be dropped. These priorities are based on the path likelihoods to peers according to historical data and also on several complementary mechanisms, including acknowledgments, a head-start for new packets, and lists of previous intermediaries. Our evaluations show that MaxProp performs better than protocols that have access to an oracle that knows the schedule of meetings between peers. Our evaluations are based on 60 days of traces from a real DTN network we have deployed on 30 buses. Our network, called UMassDieselNet, serves a large geographic area between five colleges. We also evaluate MaxProp on simulated topologies and show it performs well in a wide variety of DTN environments.”
ResiliNets Keywords: delay-tolerance
Notes:
[Ott-Kutscher-2004 .]
Jörg Ott, Dirk Kutscher,
“Drive-thru Internet: IEEE 802.11b for Automobile Users”,
IEEE Infocom 2004 Conference, 2004
Abstract: “This paper reports on measurement results for the use of IEEE 802.11 networks in drive-thru scenarios: we have measured transmission characteristics for sending and receiving high data volumes using UDP and TCP in vehicles moving at different speeds that pass one or more IEEE 802.11 access points at the roadside. We discuss possibilities and limitations for the use of scattered WLAN cells by devices in fast moving vehicles and provide an analysis of the performance that can be expected for the communication in such scenarios. Based on these observations, we discuss implications for higher-layer protocols and applications.”
ResiliNets Keywords: delay-tolerance
Notes:
[Warthman-2003 .]
Warthman, F.;
“Delay-Tolerant Networks”,
ResiliNets Keywords: delay-tolerance, bundling
Notes: Independent, but useful work in understanding DTNs
[[Abdulla-Simon-2006] (doi) .]
M. Abdulla, R. Simon
“A Simulation Analysis of Multicasting in Delay Tolerant Networks”,
Proceedings of the Winter Simulation Conference, 2006. WSC 06. , 3-6 Dec. 2006 Page(s): 2234 - 2241
Abstract: “Delay tolerant networks (DTNs) are a class of systems that experience frequent and long-duration partitions. As in all distributed systems, DTN multicasting is a desirable feature for applications where some form of group communication is needed. The topological impairments experienced within a DTN pose unique challenges for designing effective DTN multicasting protocols. In this paper, we examine multicasting in DTNs. Unlike earlier work we assume no knowledge of node connectivity or mobility patterns. We propose the use of both single-copy and multi-copy routing DTN routing algorithms. We also explore the use of gossiping and core nodes in DTNs to decrease the number of redundant messages while maintaining high message delivery ratios. We have performed extensive evaluations of our proposed methods. Our results show that with careful protocol parameter selection it is possible to achieve high delivery rates for various system scenarios ”
ResiliNets Keywords:
Notes:
[Chuah-Ma-2006 (doi) .]
M.C. Chuah, W.B. Ma
“Integrated Buffer and Route Management in a DTN with Message Ferry”,
Military Communications Conference, 2006. MILCOM 2006 , 23-25 Oct. 2006 Page(s): 1 - 7
Abstract: “Unlike normal wireless ad hoc networks, end-to-end connection may not exist in DTNs. Thus, the message ferrying (MF) scheme has been proposed as a strategy for providing connectivity in disruption tolerant network (DTN)s, where a set of nodes called ferries are responsible for carrying messages for all nodes in the networks. In such store-and-forward networks, buffers at ferry and regular nodes become critical resources and need to be allocated fairly among different users. In this paper, we propose a max-min fairness model for a DTN with a message ferry. Based on this model, we propose a buffer allocation scheme that can achieve fairness among different sessions. We also design an integrated buffer and routing management scheme called buffer efficient routing scheme (BERS). Via simulations, we demonstrate that our fair buffer allocation scheme assigns buffers fairly to different sessions. Our simulation studies also show that BERS can achieve higher session throughput and lower packet delivery latency than the only-store-and-forward routing scheme that is typically used in a message ferry system ”
ResiliNets Keywords:
Notes:
[Chuah-Yang-2005 (doi) .]
M.C. Chuah, P. Yang
“A Message Ferrying Scheme with Differentiated Services”,
Military Communications Conference, 2005. MILCOM 2005 , 17-20 Oct. 2005 Page(s): 1521 - 1527
Abstract: “Routing in partitioned ad-hoc networks is a challenging problem since end-to-end connectivity may not exist. A message ferrying (MF) (W. Zhao and M.H. Ammar, 2003) scheme has been proposed recently for non-real-time applications where certain mobile nodes referred to as message ferries are designated to collect and deliver packets. In R. Viswanathan et al. (2005), we have investigated a message ferrying scheme that allows urgent messages with more stringent delay requirement to be delivered earlier than regular messages. In this paper, we analyze a system where these two types of messages arrive according to an arrival distribution and that the buffer sizes at the ferry and the nodes are limited. We also assume that the nodes move and that the urgent/regular messages have different delivery deadlines. We design an elliptical zone forwarding (EZF) scheme for the ferry route. Then, we study how three buffer allocation schemes affect the fraction of delivered urgent messages that meet the deadlines as well as the dropping rates of urgent and regular messages due to buffer contention when used together with the EZF scheme. Our results indicate that the soft-partitioning scheme allows more urgent messages to be delivered while keeping the drop rate of regular messages low. Next, we compared the system performance achieved by the EZF scheme with the ferry initiated message ferry with nearest neighbor scheme presented in W. Zhao et al. (2004) assuming the FIFO scheme is used for the buffer allocation. Our simulation studies show that the EZF scheme we design achieves better performance than the FFM-NN scheme. The EZF routing scheme combined with the buffer allocation scheme can be used to intelligently disseminate information in military networks. ”
ResiliNets Keywords:
Notes:
[Chuah-Yang-Davidson-Cheng-2006 (doi) .]
M.C. Chuah, P. Yang, B.D. Davison, L. Cheng
“Store-and-Forward Performance in a DTN”,
IEEE 63rd Vehicular Technology Conference, 2006. VTC 2006-Spring. , 2006 Page(s): 187 - 191
Abstract: “Delay and disruption tolerant networks have been proposed to address data communication challenges in network scenarios where an instantaneous end-to-end path between a source and destination may not exist, and the links between nodes may be opportunistic, predictably connectable, or periodically-(dis)connected. In this paper, we describe the store-and-forward and custody transfer concepts that are used in DTNs. Then, we present simulation results that illustrate the usefulness of the custody transfer feature, and a message ferry in improving the end-to-end message delivery ratio in a multihop scenario where link availability can be as low as 20%. In particular, our results indicate that one can achieve a delivery ratio as high as 90-99% with appropriate buffer allocations. We also provide some preliminary insights on the design factors that influence the end to end delivery ratio, e.g., the link availability patterns and buffer allocation strategies. ”
ResiliNets Keywords:
Notes:
[[Ip-Lau-Yue-2007] (doi) .]
Y.K. Ip, W.C. Lau, O.C. Yue
“Forwarding and Replication Strategies for DTN with Resource Constraints”,
IEEE 65th Vehicular Technology Conference, 2007. VTC2007-Spring., 2007 Page(s): 1260 - 1264
Abstract: “Disruption tolerant network (DTN) refers to the type of sparse mobile ad hoc network where the nodes are connected intermittently. A common strategy to cope with intermittent network connectivity is to use multiple-copy routing for message delivery. However, the resultant replicates of messages incur significant burden on the bandwidth and storage requirements of each node. In this paper, we investigate the effect of excessive message-replications in multiple-copy routing in DTNs under communication bandwidth and buffer constraints. By modeling the message delivery process as a Markov chain, we first analytically derive the delivery latency as a function of message-replication limit for the single-message-delivery case. The performance of the multiple-message-multiple-flow case is then evaluated via extensive simulations. For the latter, we observe that there is an optimal value for the message-replication limit of each message beyond which network performance will degrade. Finally, we propose an alternative forwarding and message-dropping strategy to address the problem of unfairness found in the basic FIFO-with-blocking strategy. Our results show that the average message delivery delay can be reduced by as much as 25% with the proposed scheme. ”
ResiliNets Keywords:
Notes:
[Pelusi-Passarella-Conti-2006 (doi) .]
L. Pelusi, A. Passarella, M. Conti
“Opportunistic Networking: Data Forwarding in Disconnected Mobile Ad Hoc Networks”,
IEEE Communications Magazine, Volume 44, Issue 11, Nov. 2006 Page(s): 134 - 141
Abstract: “Opportunistic networks are one of the most interesting evolutions of MANETs. In opportunistic networks, mobile nodes are enabled to communicate with each other even if a route connecting them never exists. Furthermore, nodes are not supposed to possess or acquire any knowledge about the network topology, which (instead) is necessary in traditional MANET routing protocols. Routes are built dynamically, while messages are en route between the sender and the destination(s), and any possible node can opportunistically be used as next hop, provided it is likely to bring the message closer to the final destination. These requirements make opportunistic networks a challenging and promising research field. In this article we survey the most interesting case studies related to opportunistic networking and discuss and organize a taxonomy for the main routing and forwarding approaches in this challenging environment. We finally envision further possible scenarios to make opportunistic networks part of the next-generation Internet ”
ResiliNets Keywords:
Notes:
[Wu-Yang-Dai-2007 (doi) .]
J. Wu, S. Yang, F. Dai
“Logarithmic Store-Carry-Forward Routing in Mobile Ad Hoc Networks”,
IEEE Transactions on Parallel and Distributed Systems, Volume 18, Issue 6, June 2007 Page(s): 735 - 748
Abstract: “Two schools of thought exist in terms of handling mobility in mobile ad hoc networks (MANETs). One is the traditional connection-based model, which views node mobility as undesirable and tries to either remove (through recovery schemes) or mask (through tolerant schemes) the effect of mobility. The other is the mobility-assisted model, which considers mobility as a desirable feature, where routing is based on the store-carry-forward paradigm with random or controlled movement of mobile nodes (called ferries). It is well known that mobility increases the capacity of MANETs by reducing the number of relays in routing. Surprisingly, only two models, diameter hop count in the connection-based model and constant hop count in the mobility-assisted model, which correspond to two extremes of the spectrum, have been systematically studied. In this paper, we propose a new routing model that deals with message routing, as well as trajectory planning, of the ferries that carry the message. A logarithmic number of relays are enforced to achieve a good balance among several contradictory goals, including increasing network capacity, increasing ferry sharing, and reducing moving distance. The model considers the dynamic control of ferries in terms of the number of ferries, trajectory planning of ferries, and node communication and synchronization. The effectiveness of the proposed model is evaluated analytically, as well as through simulation ”
ResiliNets Keywords:
Notes:
[Zhao-Ammar-Zegura-2005 (doi) .]
W. Zhao, M. Ammar, E. Zegura
“Controlling the Mobility of Multiple Data Transport Ferries in a Delay-Tolerant Network”,
in Proc. IEEE INFOCOM, March 2005
Abstract: “As technology rapidly progresses, more devices will combine both communication and mobility capabilities. With mobility in devices, we envision a new class of proactive networks that are able to adapt themselves, via physical movement, to meet the needs of applications. To fully realize these opportunities, effective control of device mobility and the interaction between devices is needed. In this paper, we consider the message ferrying (MF) scheme which exploits controlled mobility to transport data in delay-tolerant networks, where end-to-end paths may not exist between nodes. In the MF scheme, a set of special mobile nodes called message ferries are responsible for carrying data for nodes in the network. We study the use of multiple ferries in such networks, which may be necessary to address performance and robustness concerns. We focus on the design of ferry routes. With the possibilities of interaction between ferries, the route design problem is challenging. We present algorithms to calculate routes such that the traffic demand is met and the data delivery delay is minimized. We evaluate these algorithms under a variety of network conditions via simulations. Our goal is to guide the design of MF systems and understand the tradeoff between the incurred cost of multiple ferries and the improved performance. We show that the performance scales well with the number of ferries in terms of throughput, delay and resource requirements in both ferries and nodes. ”
ResiliNets Keywords:
Notes:
[[Acer-Kalyanaraman-Abouzeid-2007] (doi) .]
U. G. Acer, S. Kalyanaraman, A. A. Abouzeid
“Weak state routing for large scale dynamic networks”,
in Proc. ACM Mobicom, September 2007
Abstract: “Routing in communication networks involves the indirection from a persistent name (or ID) to a locator and delivering packets based upon the locator. In a large-scale, highly dynamic network, the ID-to-locator mappings are both large in number, and change often. Traditional routing protocols require high overhead to keep these in directions up-to-date. In this paper, we propose Weak State Routing (WSR), a routing mechanism for large-scale highly dynamic networks. WSR's novelty is that it uses random directional walks biased occasionally by weak indirection state information in intermediate nodes. The indirection state information is weak, i.e. interpreted not as absolute truth, but as probabilistic hints. Nodes only have partial information about the region a destination node is likely to be. This method allows us to aggregate information about a number of remote locations in a geographic region. In other words, the state information maps a set-of-IDs to a it geographical region. The intermediate nodes receiving the random walk use a method similar to longest-prefix-match in order to prioritize their mappings to decide how to bias and forward the random walk. WSR can also be viewed as an unstructured distributed hashing technique. WSR displays good rare-object recall with scalability properties similar to structured DHTs, albeit with more tolerance to dynamism and without constraining the degree distribution of the underlying network.
Through simulations, we show that WSR offers a high packet delivery ratio, more than 98%. The control packet overhead incurred in the network scales as O(N) for N-node networks. The number of mappings stored in the network appears to scale as Θ(N(3/2)). We compare WSR with Dynamic Source Routing (DSR) and geographic forwarding (GPSR) combined with Grid Location Service (GLS). Our results indicate that WSR delivers more packets with less overhead at the cost of increased path length.”
ResiliNets Keywords:
Notes:
[Ramanathan-Hansen-Basu-Hain-Krishnan-2007 (doi) .]
R. Ramanathan, R. Hansen, P. Basu, R. R. Hain, R. Krishnan
“Prioritized Epidemic Routing for Opportunistic Networks”,
in Proc. ACM MobiOpp, June 2007
Abstract: “We describe PRioritized EPidemic (PREP) for routing in opportunistic networks. PREP prioritizes bundles based on costs to destination, source, and expiry time. Costs are derived from per-link "average availability" information that is disseminated in an epidemic manner. PREP maintains a gradient of replication density that decreases with increasing distance from the destination. Simulation results show that PREP outperforms AODV and Epidemic Routing by a factor of about 4 and 1.4 respectively, with the gap widening with decreasing density and decreasing storage. We expect PREP to be of greater value than other proposed solutions in highly disconnected and mobile networks where no schedule information or repeatable patterns exist.”
ResiliNets Keywords:
Notes:
[Tariq-Ammar-Zegura-2006 (doi) .]
M.M.B. Tariq, M. Ammar, E. Zegura
“Message Ferry Route Design for Sparse Ad hoc Networks with Mobile Nodes”,
in Proc. ACM MobiHoc, May 2006
Abstract: “Message ferrying is a networking paradigm where a special node, called a message ferry, facilitates the connectivity in a mobile ad hoc network where the nodes are sparsely deployed. One of the key challenges under this paradigm is the design of ferry routes to achieve certain properties of end-to-end connectivity, such as, delay and message loss among the nodes in the ad hoc network. This is a difficult problem when the nodes in the network move arbitrarily. As we cannot be certain of the location of the nodes, we cannot design a route where the ferry can contact the nodes with certainty. Due to this difficulty, prior work has either considered ferry route design for ad hoc networks where the nodes are stationary, or where the nodes and the ferry move pro-actively in order to meet at certain locations. Such systems either require long-range radio or disrupt nodes' mobility patterns which can be dictated by non-communication tasks. We present a message ferry route design algorithm that we call the Optimized Way-points, or OPWP, that generates a ferry route which assures good performance without requiring any online collaboration between the nodes and the ferry. The OPWP ferry route comprises a set of way-points and waiting times at these way-points, that are chosen carefully based on the node mobility model. Each time that the ferry traverses this route, it contacts each mobile node with a certain minimum probability. The node-ferry contact probability in turn determines the frequency of node-ferry contacts and the properties of end-to-end delay. We show that OPWP consistently outperforms other naive ferry routing approaches. ”
ResiliNets Keywords:
Notes:
[Zhao-Ammar-Zegura-2004 (doi) .]
W. Zhao, M. Ammar, E. Zegura
“A Message Ferrying Approach for Data Delivery in Sparse Mobile Ad Hoc Networks ”,
in Proc. ACM MobiHoc, May 2004
Abstract: “Mobile Ad Hoc Networks (MANETs) provide rapidly deployable and self-configuring network capacity required in many critical applications, e.g., battlefields, disaster relief and wide area sensing. In this paper we study the problem of efficient data delivery in sparse MANETs where network partitions can last for a significant period. Previous approaches rely on the use of either long range communication which leads to rapid draining of nodes' limited batteries, or existing node mobility which results in low data delivery rates and large delays. In this paper, we describe a Message Ferrying (MF) approach to address the problem. MF is a mobility-assisted approach which utilizes a set of special mobile nodes called message ferries (or ferries for short) to provide communication service for nodes in the deployment area. The main idea behind the MF approach is to introduce non-randomness in the movement of nodes and exploit such non-randomness to help deliver data. We study two variations of MF, depending on whether ferries or nodes initiate proactive movement. The MF design exploits mobility to improve data delivery performance and reduce energy consumption in nodes. We evaluate the performance of MF via extensive ns simulations which confirm the MF approach is efficient in both data delivery and energy consumption under a variety of network conditions. ”
ResiliNets Keywords:
Notes:
[[Zhang-2006] (doi) .]
Z. Zhang
“Routing in intermittently connected mobile ad hoc networks and delay tolerant networks: overview and challenges”,
Communications Surveys & Tutorials, IEEE, Volume 8, Issue 1, First Quarter 2006 Page(s): 24 - 37
Abstract: “Recently there has been much research activity in the emerging area of intermittently connected ad hoc networks and delay/disruption tolerant networks (DTN). There are different types of DTNs, depending on the nature of the network environment. Routing in DTNs is one of the key components in the DTN architecture. Therefore, in the last few years researchers have proposed different routing protocols for different types of DTNs. In this article we capture the state of the art in routing protocols in DTNs. We categorize these routing protocols based on information used. For deterministic time evolving networks, three main approaches are discussed: the tree approach, the space and time approach, and the modified shortest path approach. For stochastic time evolving networks, the following approaches are discussed: the epidemic or random forwarding approach, predication or history based approach (including per contact routing based on one hop information only and per contact routing based on average end to end information), the model based routing approach, as well as approaches that control the movement of certain special nodes. Recent developments in erasure coding and network coding applied to DTNs are also discussed. The article also identifies open research issues and intends to motivate new research and development in this area.”
ResiliNets Keywords:
Notes:
Delay Tolerance Architecture
[Fall-2003 (doi)]
Kevin Fall
“A Delay-Tolerant Network Architecture for Challenged Internets”,
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Karlsruhe, 2003.
ResiliNets Keywords: DTN architecture
Keywords:
Abstract: "The highly successful architecture and supporting protocols of today’s Internet operate poorly when faced with operating environments characterized by very long delay paths and frequent network partitions. These problems are exacerbated by end nodes that have severe power or memory constraints. Often deployed in mobile and extreme environments lacking “always-on” infrastructure, many such networks have their own specialized protocols, and do not utilize IP. To achieve interoperability between them, we propose a network architecture and application interface structured around optionally-reliable asynchronous message forwarding, with limited expectations of end-to-end connectivity and node resources. The architecture operates as an overlay above the transport layers of the networks it interconnects, and provides key services such as in-network data storage and retransmission, interoperable naming, authenticated forwarding and a coarse-grained class of service."
Delay Tolerant Routing
[Jain-Fall-Patra-2004 (doi)]
S. Jain, K. Fall, R. Patra
“Routing in a delay tolerant network”,
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Portland, Oregon, USA, 2004
ResiliNets Keywords: DTN routing
Keywords:
Abstract: "We formulate the delay-tolerant networking routing problem, where messages are to be moved end-to-end across a connectivity graph that is time-varying but whose dynamics may be known in advance. The problem has the added constraints of finite buffers at each node and the general property that no con- temporaneous end-to-end path may ever exist. This situation limits the applicability of traditional routing approaches that tend to treat outages as failures and seek to find an existing end-to-end path. We propose a framework for evaluating rout- ing algorithms in such environments. We then develop several algorithms and use simulations to compare their performance with respect to the amount of knowledge they require about network topology. We find that, as expected, the algorithms using the least knowledge tend to perform poorly. We also find that with limited additional knowledge, far less than complete global knowledge, efficient algorithms can be constructed for routing in such environments. To the best of our knowledge this is the first such investigation of routing issues in DTNs."
[Spyropoulos-Psounis-Raghavendra-2005 (doi)]
T. Spyropoulos, K. Psounis, C. Raghavendra
“Spray and wait: an efficient routing scheme for intermittently connected mobile networks",
WDTN '05 Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
New York, NY, USA 2005
ResiliNets Keywords: DTN routing
Keywords:
Abstract: "Intermittently connected mobile networks are sparse wireless networks where most of the time there does not exist a complete path from the source to the destination. These networks fall into the general category of Delay Tolerant Networks. There are many real networks that follow this paradigm, for example, wildlife tracking sensor networks, military networks, inter-planetary networks, etc. In this context, conventional routing schemes would fail.To deal with such networks researchers have suggested to use flooding-based routing schemes. While flooding-based schemes have a high probability of delivery, they waste a lot of energy and suffer from severe contention, which can significantly degrade their performance. Furthermore, proposed efforts to significantly reduce the overhead of flooding-based schemes have often be plagued by large delays. With this in mind, we introduce a new routing scheme, called Spray and Wait, that "sprays" a number of copies into the network, and then "waits" till one of these nodes meets the destination.Using theory and simulations we show that Spray and Wait outperforms all existing schemes with respect to both average message delivery delay and number of transmissions per message delivered; its overall performance is close to the optimal scheme. Furthermore, it is highly scalable retaining good performance under a large range of scenarios, unlike other schemes. Finally, it is simple to implement and to optimize in order to achieve given performance goals in practice."
Delay Tolerant Transport
[Harras-Almeroth-2006(doi).]
Khaled A. Harras, Kevin C. Almeroth
“Transport Layer Issues in Delay Tolerant Mobile Networks”,
Networking 2006. Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems, Lecture Notes in Computer Science, Springer Berlin / Heidelberg, pp. 463-475, 2006
Abstract: “The tremendous increase in wireless devices and user mobility have ultimately resulted in a new set of networking challenges that previously did not exist. Some of these challenges include large delays, intermittent connectivity and most importantly, the absence of an end-to-end path from sources to destinations. Networks characterized by one or more of these challenges are called Delay Tolerant Networks (DTNs). Researchers have studied DTNs with a major focus on routing issues in such extreme environments. As a result, in this paper, we shift this focus towards addressing and studying transport layer issues in extreme networking environments. We particularly concentrate on investigating and comparing several reliability approaches in a specific category of DTNs known as Delay Tolerant Mobile Networks (DTMNs). We present four different reliability approaches in DTMNs. We also evaluate these approaches under various network conditions via simulation. Our goals from this study are to examine the impact of these reliability approaches, understand the tradeoffs between them, and open the way for further work in transport layer issues in delay tolerant networks.”
ResiliNets Keywords: delay-tolerance, Delay Tolerant Networks (DTNs), Delay Tolerant Mobile Networks (DTMNs), reliability
Notes:
[[Ali-Altman-Chahed-Panda-Sassatelli-2011](ACM).]
Arshad Ali, Eitan Altman, Tijani Chahed, Manoj Panda, Lucile Sassatelli
“ A New Reliable Transport Scheme in Delay Tolerant Networks Based on Acknowledgments and Random Linear Coding”,
Proceedings of the 23rd International Teletraffic Congress, pp. 214-221, 2011
Abstract: “We propose a new reliable transport scheme for Delay Tolerant Networks (DTNs) based on the use of acknowledgments (ACKs) as well as coding. We, specifically, develop a fluid-limit model to derive expressions for the delay performance of the proposed reliable transport scheme and derive the optimal setting of the parameters which minimize the file transfer time. Our results yield optimal values for the number of outstanding random linear combinations to be sent before time-out as well as the optimal value of the time-out itself, which, in turn, minimize the file transfer time.”
ResiliNets Keywords: delay-tolerance, Delay Tolerant Networks, DTNs, reliable transport scheme, random linear coding
Notes:
[[Akan-Fang-Akyildiz-2004](doi).]
Ozgur B. Akan, Jian Fang, and Ian F. Akyildiz
“TP-Planet: A Reliable Transport Protocol for Interplanetary Internet”,
Selected Areas in Communications, IEEE Journal on , vol.22, no.2, pp. 348-361, Feb. 2004
Abstract: “Space exploration missions are crucial for acquisition of information about space and the Universe. The entire success of a mission is directly related to the satisfaction of its communications needs. For this goal, the challenges posed by the InterPlaNetary (IPN) Internet need to be addressed. Current transmission control protocols (TCPs) have very poor performance in the IPN Internet, which is characterized by extremely high propagation delays, link errors, asymmetrical bandwidth, and blackouts. The window-based congestion control, which injects a new packet into the network upon an ACK reception, is responsible for such performance degradation due to high propagation delay. Slow start algorithms of the existing TCPs further contribute to the performance degradation by wasting long time periods to reach the actual data rate. Moreover, wireless link errors amplify the problem by misleading the TCP source to unnecessarily throttle the congestion window. The recovery from erroneous window decrease takes a certain amount of time, which is proportional to the round-trip time (RTT) and further decreases the network performance. In this paper, a reliable transport protocol (TP-Planet) is presented for data traffic in the IPN Internet. It is intended to address the challenges and to achieve high throughput performance and reliable data transmission on deep-space links of the IPN Backbone Network. TP-Planet deploys a rate-based additive-increase multiplicative-decrease (AIMD) congestion control, whose AIMD parameters are tuned to help avoid throughput degradation. TP-Planet replaces the inefficient slow start algorithm with a novel Initial State algorithm, which allows the capture of link resources in a very fast and controlled manner. A new congestion detection and control mechanism is developed, which decouples congestion decisions from single packet losses in order to avoid the erroneous congestion decisions due to high link errors. In order to reduce the effects of blackout conditions on the throughput performance, TP-Planet incorporates the blackout state procedure into the protocol operation. The bandwidth asymmetry problem is addressed by the adoption of delayed selective acknowledgment (SACK). Simulation experiments show that the TP-Planet significantly impr- oves the throughput performance and addresses the challenges posed by the IPN Backbone Network.”
ResiliNets Keywords: delay-tolerance, InterPlaNetary (IPN) Internet, bandwidth asymmetry, reliable transport protocol, additive-increase multiplicative-decrease (AIMD) congestion control, selective acknowledgement (SACK)
Notes:
[[Psaras-Papastergiou-Tsaoussidis-Peccia-2008](doi).]
Ioannis Psaras, Giorgos Papastergiou, Vassilis Tsaoussidis, Nestor Peccia
“DS-TP: Deep-Space Transport Protocol”,
Aerospace Conference, 2008 IEEE, vol., no., pp.1-13, 1-8 March 2008
Abstract: “We present deep-space transport protocol (DS- TP), a new reliable protocol for deep-space communication links. DS-TP's main advantage is its ability to complete file transfers faster than conventional TCP, SCPS-TP and Saratoga. Therefore, missions with small connectivity time are greatly favored. Deep space communication links are characterized by long propagation delays, high BERs, intermittent connectivity (i.e., blackouts) and bandwidth asymmetries. Common approaches to deal with the above unique characteristics are: rate-based, open-loop protocols to deal with huge propagation delays; regular retransmissions to deal with high BERs; transmission suspension to deal with blackouts; SNACKs to deal with bandwidth asymmetries. We adopt some of the above approaches, namely, the open-loop, rate-based transmission and the SNACKs and focus on the optimization of the rest, namely, the retransmission strategy of the transport protocol to deal either with high BERs or with blackouts. More precisely, DS-TP includes the Double Automatic Retransmission (DAR) technique. DAR sends each packet twice, importing some intentional delay (Rd) between the original transmission and the retransmission. Therefore, in the presence of communication gaps (i.e., errors or blackouts), corrupted packets will eventually be replaced by the same correct packets that arrive with delay Rd. Rd, however, is much smaller than the traditional TCP-RTO value. Our theoretical performance evaluation results reveal that DS-TP presents high potential for deploy ability. In particular, we show that for PER=50%, DS-TP completes a file transfer in half time of a conventional protocol.”
ResiliNets Keywords: delay-tolerance, reliable transport protocol, deep-space communication, Double Automatic Retransmission (DAR) technique, SNACKs
Notes:
