Research challenges in QoS routing

Masip-Bruin, X.; Yannuzzi, M.; Domingo‐Pascual, Jordi; Fonte, Alexandre; Curado, Marília; Monteiro, Edmundo; Kuipers, Fernando A.; Mieghem, Piet Van; Avallone, Stefano; Ventre, Giorgio; Aranda-Gutiérrez, Pedro A.; Hollick, Matthias; Steinmetz, Ralf; Iannone, Luigi; Salamatian, Kavé

doi:10.1016/j.comcom.2005.06.008

Cited by 85 publications

(52 citation statements)

References 61 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The general problem of multicast routing has received significant research attention in the area of computer networks and algorithmic network theory [1,2,3]. It is defined as sending messages from a source to a set of destinations that belong to the same multicast group.…”

Section: Introductionmentioning

confidence: 99%

A Variable Neighborhood Descent Search Algorithm for Delay-Constrained Least-Cost Multicast Routing

Kendall

2009

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. The rapid evolution of real-time multimedia applications requires Quality of Service (QoS) based multicast routing in underlying computer networks. The constrained Steiner Tree, as the underpinning mathematical structure, is a well-known NP-complete problem. In this paper we investigate a variable neighborhood descent (VND) search, a variant of variable neighborhood search, for the delay-constrained leastcost (DCLC) multicast routing problem. The neighborhood structures designed in the VND approaches are based on the idea of path replacement in trees. They are simple, yet effective operators, enabling a flexible search over the solution space of this complex problem with multiple constraints. A large number of simulations demonstrate that our algorithm is highly efficient in solving the DCLC multicast routing problem in terms of the tree cost and execution time. To our knowledge, this is the first study of VND algorithm on the DCLC multicast routing problem. It outperforms other existing algorithms over a range of problem instances.

show abstract

Section: Introductionmentioning

confidence: 99%

A Variable Neighborhood Descent Search Algorithm for Delay-Constrained Least-Cost Multicast Routing

Kendall

2009

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…The control messages used in AODV protocol is modified. PAAODV [21] works in two phases that is route-discovery and link-by-link power adjustment [8][9]13]. In the route discovery process, different power levels are used to determine a route consuming minimum power for transmission of packets.…”

Section: Paaodv Protocolmentioning

confidence: 99%

Power Aware Routing in Mobile Ad Hoc Networks by using Power Aware Matrices

Upadhyay¹,

Soni²,

Kumar³

2017

IJCA

View full text Add to dashboard Cite

Power consumption is a crucial design concern in Wireless ad hoc networks since wireless nodes are typically battery limited. It might not be possible to replace/recharge a mobile node that is powered by batteries. To take full advantage of life time of nodes, traffic should be routed in a way that power consumption is minimized. Power Aware Routing is a consideration in a way that it minimizes the energy consumption while routing the traffic, aims at minimizing the total power consumption of all the nodes in the network, minimizing the overhead etc. and thus, at maximizing the lifespan of the network using some Power Aware Routing Protocols. They minimize either the active communication energy required to transmit or receive packets or the inactive energy consumed when a mobile node stays idle but listens to the wireless medium for any possible communication requests from other nodes. Transmission power control, load distribution and power management approaches are used to minimize active communication energy.

show abstract

“…The overall effect of service performance which decides the level of contentment of a user of the service can be defined as Quality of Service (QoS) [1]. In communication systems, service performance is closely related to network performance.…”

Section: Introductionmentioning

confidence: 99%

“…The queue is finite and the corresponding queuing system's behaviour is explained as multi-dimensional continuous time skip-free to the left Markov chain. In most of the studies, in performance analysis of integrated systems, Poisson process is used for the inter-arrival time of voice and data calls and exponential distributions are used for the service times of the channels [1], [5], [6], [7], [8].…”

Section: Introductionmentioning

confidence: 99%