N.F. Maxemchuk. Dispersity routing. In IEEE Proceeding ICC '75, pages 41--10--41-- 13, Jun 1975.  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... loss characteristics or can be deployed over best e ort networks (as these are considerations in our work as well) Earlier e orts on dealing with losses through the use of multiple independent paths (although at lower layers of the network) include dispersity routing, as proposed by Maxemchuk [11 13]. The focus in this work was on reducing delay, which includes reducing the number of retries needed to deliver a message without error, by sending the pieces of the data over multiple independent paths. Addition of redundant information is also possible under such a scheme. An important di erence ....

N. F. Maxemchuk. Dispersity routing. In the IEEE International Conference on Communications, San Francisco, California, June 1975.

.... error correction [4] 5] 6] In the context of the erasure channel, Wolf et al. used Reed Solomon codes in an explicit construction to achieve channel capacity in their postal channel [7] In packet switched communication networks, the technique of disper sit l routit9 introduced by Maxemchuk [8] offers the advantages of a significantly smaller average delay and variance, less sensitivity to link utilization variations, and smaller buffer sizes for a given message loss probability due to buffer overflow. A similar idea has been suggested for lost packet recovery in high speed networks ....

N. F. Maxemchuk, "Dispersity routing," Proceedigs of the Iteratioal Commuicatios Cotzferetzce, pp. 41.10 41.13, 1975.

....traffic needs to be addressed 2 by network traffic management layer. One solution to enhance the immunity of bursty traffic on heterogeneous networks is traffic dispersion . Traffic dispersion was initially proposed for load balancing and fault tolerance purposes in storeand forward networks [12]. Recent studies, 6, 7, 8, 9, 4, 13, 11, 17, 2] have also introduced different dispersion strategies and their effects from various points of view. The basic idea of traffic dispersion is to divide each message into a group of sub messages, and send them through disjoint channels, or paths. ....

N. F. Maxemchuk. Dispersity routing. Proc. ICC '75, pages 41.10--41.13, 1975.

....reservation. The other interpretation of multipath routing is to select a set of paths instead of a single one for a connection. When there does not exist a feasible path with sufficient resources, the algorithm tries to find multiple paths whose combined resources satisfy the requirement [4,35,45]. Transmitting contiguous data (audio and video) along multiple paths arises the problem of synchronization. In addition, it demands more buffer space at the receiving end to absorb the delay jitter between different paths. Routing QoS and best effort traffic: QoS traffic and besteffort traffic ....

N. F. Maxemchuk, Dispersity Routing. IEEE ICC'75, San Francisco, California, June 1975.

....reconstruct the source data. The key property of a digital fountain is that the source data can be reconstructed intact from any subset of the encoding packets equal in total length to the source data. The digital fountain concept is similar to ideas found in the seminal works of Maxemchuk [13] [14] and Rabin [21] Our approach is to construct better approximations of a digital fountain as a basis for protocols that perform reliable distribution of bulk data. We emphasize that the digital fountain concept is quite general and can be applied in diverse network environments. For example, our ....

....multiple paths in the network. Those packets that experience congestion are delayed, but the destination can recover the data once a sufficient number of packets arrive, irrespective of the paths they took. This application dates back to the seminal works on dispersity routing by Maxemchuk [13] [14] and information dispersal by Rabin [21] Both suggested using standard erasure codes. We expect Tornado codes will lead to improved practical dispersity routing schemes. Another application for which the Tornado code approximation might be useful arises in the context of mirrored data. ....

N. F. Maxemchuk, "Dispersity Routing." Proceedings of ICC '75, San Francisco, CA, pp. 41-10 -- 41-13, 1975.

....Figure 9. Performance with varying packet rates. high rates, the network is already under saturation (almost 40 packets are dropped by both protocols) and in an overall sense, AOMDV still performs better as it gives lower end to end delay. 5 Related Work Multipath routing and its applications [4, 18] have been well studied in the networking literature, in particular for wired networks. In a broad sense, multipath routing enables fault tolerance and also facilitates load balancing. An early work by Maxemchuk [18] on an application of multipath routing known as dispersity routing discusses how ....

....lower end to end delay. 5 Related Work Multipath routing and its applications [4, 18] have been well studied in the networking literature, in particular for wired networks. In a broad sense, multipath routing enables fault tolerance and also facilitates load balancing. An early work by Maxemchuk [18] on an application of multipath routing known as dispersity routing discusses how a message can be dispersed along multiple paths by splitting it in order to achieve smaller average delay and delay variance. Since then, there has been a significant amount of work done on multipath routing for both ....

N. F. Maxemchuk. Dispersity Routing. In Proceedings of the IEEE ICC, pages 41:10--41:13, 1975.

....network infrastructure using TCP as well. A. Related Work Although the idea of parallel access to multiple mirror sites is quite straightforward, it has apparently received little attention in the literature. The most relevant related work includes Maxemchuk s work on dispersity routing [14] [15] and Rabin s work on information dispersal (IDA) 21] For example, the idea of Rabin s IDA scheme is to break a file into several pieces, where each piece also includes some redundant information. By dispersing these pieces among different nodes in the network, one guarantees fault tolerance ....

N. F. Maxemchuk, "Dispersity Routing." In Proc. of the International Conference on Communications, pp. 41-10 -- 41-13, 1975.

....can take advantage of multiple routes through multiple descriptions coding [14] Such coding schemes distribute information among multiple outgoing streams so that reduced quality content can still be provided in the presence of route failure. In addition, diversity dispersity coding [15,16] can be performed in conjunction with APR at the network layer (see figure 2) Error control coding across multiple paths can provide perfect data recovery in the presence of a limited number of route failures. The potential for APR to address load balancing and survivability makes it an ....

N.F. Maxemchuk, Dispersity Routing, IEEE ICC'75, San Francisco, CA, June 1975.

....1 2 3 p Figure 1: A message traversing multiple hops We consider a discrete time model, where time is divided into uniform slots. The link failure model for each link is an independent Bernoulli process, where p i is the probability that hop i is up or available in a given time slot. In Maxemchuk [7], each hop is assumed to have identical average interarrival times as well as identical average service times. In a multi hop wireless environment with extreme multi path distortion, this may not be a valid assumption. Complementary to the link being up or available, we have 1 Gamma p i as the ....

....2. Use Theorem 1 with p i = p for all i = 1; 2; Delta Delta Delta ; n. Intuitively, when all the link probabilities are equal to p, we could have obtained an upper bound average delay by using the single hop result of 1 p and multiplying this by n. This is in the spirit of the results in [7] for exponentially distributed interarrival and service times where a message may be restricted from traversing multiple hops in a single time slot. Moreover, Maxemchuk s use of the Kleinrock model [5] is perhaps too restrictive by modeling M=M=1 queues which do not translate well for modeling the ....

[Article contains additional citation context not shown here]

N.F. Maxemchuk. Dispersity routing. In IEEE Proceeding ICC '75, pages 41--10--41-- 13, Jun 1975.

....routing, which selects among paths) focusing on the intra message granularity. Its main contribution is the selective exploitation of redundant data in order to minimize the overload brought about by the redundant traffic while retaining the benefits of redundancy. A. Dispersity routing In [1], Maxemchuk proposed dispersity routing, whereby a message is partitioned into several (m) packets, which are then sent to the destination over different paths in a store andforward network (see Fig. 1) Dispersal assists in balancing the load among network links. Also, multiple packets can be ....

N. Maxemchuk, "Dispersity routing," in Proc. Int. Commun. Conf., pp. 41.10--41.13, 1975.

....with TCP friendly regulatory mechanisms. 1.1 Related Work Although the idea of parallel access to multiple mirror sites is quite straightforward, it has apparently received little attention in the literature. The most relevant related work includes Maxemchuk s work on dispersity routing [14, 15] and Rabin s work on information dispersal (IDA) 21] For example, the idea of Rabin s IDA scheme is to break a file into several pieces, where each piece also includes some redundant information. By dispersing these pieces among different nodes in the network, one guarantees fault tolerance ....

N. F. Maxemchuk, "Dispersity Routing." In Proc. of the International Conference on Communications, pp. 41-10 -- 41-13, 1975.

....such as real time video. The same problem is present in satellite and deep space communications, where open loop error correction techniques are preferred to ARQ [1] In 1975, Maxemchuk suggested the use of Forward Error Correction (FEC) to reduce the end to end delay for datagram based services [2]. In a similar manner, it has been suggested to use FEC in high speed networks, in particular ATM networks, to improve reliability without increasing packet delay [3] 12] In ATM, the basic unit of transport, switching, and queueing is a 53 octet cell composed of a 5 octet header and a 48 octet ....

N.F. Maxemchuk, \Dispersity routing," Proc. ICC'75 , pp. 41.10-41.13, San Francisco, CA, June 1975.

....P s2[t;t T ] s) h will be called a time redundancy schedule over [t; t T ] with weight h. Our results are based on uniform which, to some extent, achieve decorrelation to counteract the tendency of packet drops to occur in bursts. A third scheduling variable is to use dispersity routing [41] a form of space redundancy scheduling to achieve decorrelation over space; the latter, however, requires assistance from the internetworking layer to access routing decisions. In this paper, we concentrate on pure end to end mechanisms. 4.2 Redundancy Recovery Rate Relation 4.2.1 Unimodal ....

N. Maxemchuk. Dispersity routing. In Proc. ICC '75, 1975.

No context found.

N. F. Maxemchuk, "Dispersity Routing," Proceedings of ICC '75, San Francisco CA, June 1975, pg. 41-10, 41-13.

No context found.

N. F. Maxemchuk, "Dispersity Routing," Proceedings of ICC '75, San Francisco CA, June 1975, pg. 41-10, 41-13.

No context found.

N.F. Maxemchuk. Dispersity routing. In IEEE Proceeding ICC '75, pages 41--10--41-- 13, Jun 1975.

No context found.

N. F. Maxemchuk, "Dispersity routing," in Proceedings of IEEE Internationl Communications Conferenece ICC'75, Sna Francisco, CA, June 1975, pp. 41.10--41.13.

No context found.

N. F. Maxemchuk, "Dispersity routing," in Proceedings of IEEE Internationl Communications Conferenece ICC'75, Sna Francisco, CA, June 1975, pp. 41.10--41.13.

No context found.

N. Maxemchuk. Dispersity Routing. In Proceedings of ICC, pages 41-10|41-13, San Francisco, CA, June 1975.

No context found.

N. Maxemchuk. Dispersity Routing. In Proceedings of ICC, pages 41--10---41--13, San Francisco, CA, June 1975.

No context found.

N. F. Maxemchuk. Dispersity Routing. In Proc. IEEE ICC '75, pages 10--13, June 1975.

No context found.

N. F. Maxemchuk. Dispersity routing. In the IEEE International Conference on Communications, San Francisco, California, June 1975.

No context found.

Nicholas F. Maxemchuk. Dispersity routing. In Proceedings of IEEE Internationl Communications Conferenece ICC'75, pages 41.10--41.13, Sna Francisco, CA, June 1975.

No context found.

N. Maxemchuk. Dispersity Routing. In Proceedings of ICC, pages 41-10|41-13, San Francisco, CA, June 1975.

No context found.

N. F. Maxemchuk. Dispersity routing. In Proc. ICC, pages 41.10--41.13, 1975.

First 50 documents

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC