𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Link-disjoint paths for reliable QoS routing

✍ Scribed by Yuchun Guo; Fernando Kuipers; Piet Van Mieghem

Book ID
102142338
Publisher
John Wiley and Sons
Year
2003
Tongue
English
Weight
240 KB
Volume
16
Category
Article
ISSN
1074-5351

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

The problem of finding link/node‐disjoint paths between a pair of nodes in a network has received much attention in the past. This problem is fairly well understood when the links in a network are only specified by a single link weight. However, in the context of quality of service routing, links are specified by multiple link weights and restricted by multiple constraints. Unfortunately, the problem of finding link/node disjoint paths in multiple dimensions faces different conceptual problems. This paper presents a first step to understanding these conceptual problems in link‐disjoint quality of service routing and proposes a heuristic link‐disjoint QoS algorithm that circumvents these problems. Copyright Β© 2003 John Wiley & Sons, Ltd.

πŸ“œ SIMILAR VOLUMES

An adaptive framework for QoS routing th
An adaptive framework for QoS routing through multiple paths in ad hoc wireless networks
✍ S.K. Das; A. Mukherjee; S. Bandyopadhyay; D. Saha; K. Paul πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 235 KB

We propose an adaptive framework for computing multiple paths in temporal and spatial domains to transmit a large volume of data packets from a source s to a destination d in ad hoc wireless networks. The objective is to achieve quality of service (QoS) by minimizing end-to-end delay for packet deli

Location-based localized alternate, disj
Location-based localized alternate, disjoint and multi-path routing algorithms for wireless networks
✍ Xu Lin; Ivan Stojmenovic πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 201 KB

Recently, several fully distributed (localized) location-based routing protocols for a mobile ad hoc network were reported in literature. They are variations of directional (DIR), geographic distance (GEDIR) or progress-based (MFR) routing methods. In DIR methods, each node A (the source or intermed

On-line disjoint path routing for networ
On-line disjoint path routing for network capacity maximization in energy-constrained ad hoc networks
✍ Weifa Liang; Yuzhen Liu πŸ“‚ Article πŸ“… 2007 πŸ› Elsevier Science 🌐 English βš– 290 KB

In this paper we consider on-line disjoint path routing in energy-constrained ad hoc networks. The objective is to maximize the network capacity, i.e. maximize the number of messages routed successfully by the network without any knowledge of future disjoint path connection request arrivals and gene