Choice of allocation granularity in multipath source routing schemes

Krishnan, R.; Silvester, J.A.

doi:10.1109/infcom.1993.253345

Cited by 70 publications

(36 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Classical studies of multipath routing in wireline networks has been focusing on the objectives of load balancing and fault tolerance [19]- [23]. Increasing end-to-end throughput is neither a design goal nor a major advantage of wireline multipath routing.…”

Section: Related Workmentioning

confidence: 99%

Improving Throughput in Multihop Wireless Networks

Li²

2006

IEEE Trans. Veh. Technol.

View full text Add to dashboard Cite

Abstract-One of the main characteristics of wireless ad hoc networks is their node-centric broadcast nature of communication, leading to interferences and spatial contention between adjacent wireless links. Due to such interferences, pessimistic concerns have been recently raised with respect to the decreasing network capacity in wireless ad hoc networks when the number of nodes scales to several orders of magnitude higher. Such studies assume uniformly distributed nodes in the network and randomized traffic patterns. In this paper, we argue that in all cases of end-to-end data communications-including one-to-k unicast and multicast data dissemination as well as k-to-one data aggregation-the maximum achievable end-to-end data throughput (measured on the sources) heavily depends on the strategy of arranging the topology of transmission between sources and destinations, as well as possible per-node operations such as coding. An optimal strategy achieves better end-to-end throughput than an arbitrary one. We present theoretical studies and critical insights with respect to how these strategies may be designed so that end-to-end throughput may be increased. After all, under all circumstances-in either a lightly loaded or a congested network-increasing end-to-end throughput from its baseline is always beneficial to applications using ad hoc networks to communicate.

show abstract

Section: Related Workmentioning

confidence: 99%

Improving Throughput in Multihop Wireless Networks

Li²

2006

IEEE Trans. Veh. Technol.

View full text Add to dashboard Cite

show abstract

“…When using single-path routing protocols, the traffic is distributed through one route and is therefore less flexible than in multi-path routing protocols. The problem of two entities communicating using multiple paths has been considered widely in various contexts for wired networks [1], [2], [3], [4], [5]. It was shown that multi-path routing mechanism provides better throughput than single-path routing protocols [2], [3].…”

mentioning

confidence: 99%

“…The problem of two entities communicating using multiple paths has been considered widely in various contexts for wired networks [1], [2], [3], [4], [5]. It was shown that multi-path routing mechanism provides better throughput than single-path routing protocols [2], [3]. Although research on multi-path routing protocols has been covered quite thoroughly in wired networks, similar research for wireless networks is still in its infancy.…”

mentioning

confidence: 99%

Performance analysis of reactive shortest path and multipath routing mechanism with load balance

Pham

Perreau

IEEE INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37

194

108

View full text Add to dashboard Cite

Abstract-Research on multi-path routing protocols to provide improved throughput and route resilience as compared with single-path routing has been explored in details in the context of wired networks. However, multi-path routing mechanism has not been explored thoroughly in the domain of ad hoc networks.In this paper, we analyze and compare reactive single-path and multi-path routing with load balance mechanisms in ad hoc networks, in terms of overhead, traffic distribution and connection throughput. The results reveals that in comparison with general single-path routing protocol, multi-path routing mechanism creates more overheads but provides better performance in congestion and capacity provided that the route length is within a certain upper bound which is derivable. The analytical results are further confirmed by simulation.Index Terms-ad-hoc networks, load balancing, multi-path routing, overheads.

show abstract

“…Finding multiple paths between a source and a destination has been proposed. Potential benefits of multiple paths include improved reliability (e.g., [8], [13], [17], [18], and [20]- [24]), load balancing (e.g., [7] and [16]), higher network throughput (e.g., [9] and [16]), and alleviation of congestion (e.g., [2] and [8]). It is desirable that multiple paths are link-and/or node-disjoint.…”

mentioning

confidence: 99%

Minimum-Cost Multiple Paths Subject to Minimum Link and Node Sharing in a Network

Zheng

Wang

Yang

et al. 2010

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

Abstract-In communication networks, multiple disjoint communication paths are desirable for many applications. Such paths, however, may not exist in a network. In such a situation, paths with minimum link and/or node sharing may be considered. This paper addresses the following two related fundamental questions. First, in case of no solution of disjoint multiple paths for a given application instance, what are the criteria for finding the best solution in which paths share nodes and/or links? Second, if we know the criteria, how do we find the best solution? We propose a general framework for the answers to these two questions. This framework can be configured in a way that is suitable for a given application instance. We introduce the notion of link shareability and node shareability and consider the problem of finding minimum-cost multiple paths subject to minimum shareabilities (MCMPMS problem). We identify 65 different link/node shareability constraints, each leading to a specific version of the MCMPMS problem. In a previously published technical report, we prove that all the 65 versions are mutually inequivalent. In this paper, we show that all these versions can be solved using a unified algorithmic approach that consists of two algorithm schemes, each of which can be used to generate polynomial-time algorithms for a set of versions of MCMPMS. We also discuss some extensions where our modeling framework and algorithm schemes are applicable.

show abstract

Choice of allocation granularity in multipath source routing schemes

Cited by 70 publications

References 20 publications

Improving Throughput in Multihop Wireless Networks

Improving Throughput in Multihop Wireless Networks

Performance analysis of reactive shortest path and multipath routing mechanism with load balance

Minimum-Cost Multiple Paths Subject to Minimum Link and Node Sharing in a Network

Contact Info

Product

Resources

About