On the multidensity gateway location problem for a multilevel high speed internetwork

Saha, Debashis; Mukherjee, Amitava

doi:10.1016/s0140-3664(97)00016-9

Cited by 6 publications

(4 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…(Note that a decision analog of this formulation is an NP-hard problem.) The techniques used are Lagrangean relaxation [7] and subgradient heuristics [9,15].…”

Section: Solution Using Lagrangean Relaxation and Subgradient Heuristicsmentioning

confidence: 99%

See 1 more Smart Citation

An adaptive framework for QoS routing through multiple paths in ad hoc wireless networks

Das

Mukherjee

Bandyopadhyay

et al. 2003

Journal of Parallel and Distributed Computing

View full text Add to dashboard Cite

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 delivery. We consider two aspects in this framework. The first aspect is to perform preemptive route rediscoveries before the occurrence of route errors while transmitting a large volume of data from s to d: This helps us to find out dynamically a series of possible paths in temporal domain to complete the data transfer. The second aspect is to select multiple paths in spatial domain for data transfer at any instant of time, and to distribute the data packets in sequential blocks over those paths in order to reduce congestion and end-to-end delay. A notion of link stability and path stability is also defined, and a unified mechanism is proposed to address the above two aspects that relies on evaluating a path based on link and path stability. Our solution method uses Lagrangean relaxation and subgradient heuristics to solve an optimization formulation of the problem in order to compute the paths and the corresponding data distribution, both in temporal and spatial domains. Simulation experiments demonstrate that the proposed framework helps in significantly reducing the end-to-end delay and the required number of routerediscoveries.

show abstract

“…(Note that a decision analog of this formulation is an NP-hard problem.) The techniques used are Lagrangean relaxation [7] and subgradient heuristics [9,15].…”

Section: Solution Using Lagrangean Relaxation and Subgradient Heuristicsmentioning

confidence: 99%

“…A detailed description is given in [15]. The subgradient heuristic technique is outlined in the appendix.…”

Section: Solution Using Lagrangean Relaxation and Subgradient Heuristicsmentioning

confidence: 99%

An adaptive framework for QoS routing through multiple paths in ad hoc wireless networks

Das

Mukherjee

Bandyopadhyay

et al. 2003

Journal of Parallel and Distributed Computing

View full text Add to dashboard Cite

show abstract

“…Such formulated problem is NP-complete as more general than the CFA problem with discrete cost-capacity function which is NP-complete [2,3]. Some algorithms for hierarchical network design can be found in [4,5]. However, problem presented in [5] is limited to tree topology of hierarchical network.…”

Section: Introductionmentioning

confidence: 99%

“…Some algorithms for hierarchical network design can be found in [4,5]. However, problem presented in [5] is limited to tree topology of hierarchical network. Algorithm for router location minimizing total cost of the network without constraints on quality indices and without assigning capacities to channels is presented in the paper [4].…”

Section: Introductionmentioning

confidence: 99%

An Approximate Algorithm for the Minimal Cost Gateways Location, Capacity and Flow Assignment in Two-Level Hierarchical Wide Area Networks

Ryba

Kasprzak

2006

Computational Science – ICCS 2006

View full text Add to dashboard Cite

In the paper the problem of designing two-level hierarchical structure of wide area network is considered. The goal is to select gateways location, channel capacities and flow routes in order to minimize total cost of leasing capacities of channels of 2nd level network, subject to delay constraint. An approximate algorithm is proposed. Some results following from computational experiment are reported.

show abstract

The Gateways Location and Topology Assignment Problem in Hierarchical Wide Area Networks: Algorithms and Computational Results

Ryba

Kasprzak

2006

Computational Science and Its Applications - ICCSA 2006

View full text Add to dashboard Cite

On the multidensity gateway location problem for a multilevel high speed internetwork

Cited by 6 publications

References 15 publications

An adaptive framework for QoS routing through multiple paths in ad hoc wireless networks

An adaptive framework for QoS routing through multiple paths in ad hoc wireless networks

An Approximate Algorithm for the Minimal Cost Gateways Location, Capacity and Flow Assignment in Two-Level Hierarchical Wide Area Networks

The Gateways Location and Topology Assignment Problem in Hierarchical Wide Area Networks: Algorithms and Computational Results

Contact Info

Product

Resources

About