Algorithms for IP network design with end-to-end QoS constraints

Wille, Emílio C. G.; Mellia, Marco; Leonardi, E.; Marsan, Marco Ajmone

doi:10.1016/j.comnet.2005.09.005

Cited by 17 publications

(11 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Issues related to QoS and reliability design of packet networks have been addressed by mapping the end-user performance constraints into transport-layer performance constraints and then into network-layer performance constraints [11]. A collection of heuristic algorithms have also been presented and their performance has been validated against simulation.…”

Section: Related Workmentioning

confidence: 99%

Performance analysis of multimedia based web traffic with QoS constraints

Awan

Ahmad

2008

Journal of Computer and System Sciences

View full text Add to dashboard Cite

During the recent years, there has been a tremendous growth in the development and deployment of multimedia based networked applications such as video streaming, IP telephony, interactive games, among others. These applications, in contrast to elastic applications such as email and data sharing, are delay and delay jitter sensitive but can tolerate certain level of packet loss. A vital element of end-to-end delay and delay jitter is the random queueing delays in network switches and routers. Analysis of robust mechanisms for buffer management at network routers needs to be carried out in order to reduce end-to-end delay for traffic generated by multimedia applications. In this context, a threshold based buffer management scheme for accommodating multiple class multimedia traffic in network routers has been analysed. This technique effectively controls the allocation of buffer to various traffic classes according to their delay constraints. The forms of the joint state probabilities, as well as basic performance measures such as blocking probabilities are analytically established at equilibrium. Typical numerical experiments are included to illustrate the credibility of the proposed mechanism in the context of different quality of service (QoS) grades for various network traffic classes. This model, therefore, can be used as a powerful tool to provide a required grade of service to a particular class of multimedia based web traffic in any heterogeneous network.

show abstract

Section: Related Workmentioning

confidence: 99%

Performance analysis of multimedia based web traffic with QoS constraints

Awan

Ahmad

2008

Journal of Computer and System Sciences

View full text Add to dashboard Cite

show abstract

“…S corresponds to a set, with cardinality N s , of discrete capacities (constraints (5)). Delay sd is obtained following the procedure presented in [5]. We notice that the above stated DCA problem is a constrained combinatorial optimization problem, and its global optimum can be found using an exhaustive search method.…”

Section: The Discrete Capacity Assignment Problemmentioning

confidence: 99%

“…In order to consider the traffic burstiness induced by TCP, we choose a specific kind of queue to model each router inside the network topology [5]. Thus, we choose the M [X] /M/1 queue, i.e.…”

Section: Network and Queueing Modelsmentioning

confidence: 99%

“…In [5], the authors proposed a network design and planning approach that considers the dynamics of packet networks, as well as the effect of protocols at the different layers of the Internet architecture on the e2e QoS experienced by end-users. The proposed approach firstly maps the end-user performance constraints into transport-layer performance constraints, and then into network-layer performance constraints.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Discrete Capacity Assignment in IP networks using Particle Swarm Optimization

Wille

Yabcznski

Lopes

2011

Applied Mathematics and Computation

View full text Add to dashboard Cite

“…The model objective was to minimise cell loss subject to strict delay conditions. Alternatively, Wille et al (2006) showed models and algorithms considering at the same time the dynamics of packet network and the grade of service (GoS) user-layer requirements.…”

Section: Introductionmentioning

confidence: 99%

A Tabu Search algorithm for dynamic routing in ATM cell-switching networks

Cortés

Muñuzuri

Onieva

et al. 2011

Applied Soft Computing

View full text Add to dashboard Cite

This paper deals with the dynamic routing problem in ATM cell-switching networks. We present a mathematical programming model based on cell loss and a Tabu Search algorithm with short-term memory that is reinforced with a long-term memory procedure. The estimation of the quality of the solutions is fast, due to the specific encoding of the feasible solutions. The Tabu Search algorithm reaches good quality solutions, outperforming other approaches such as Genetic Algorithms and the Minimum Switching Path heuristic, regarding both cell loss and the CPU time consumption. The best results were found for the more complex networks with a high number of switches and links.

show abstract

Algorithms for IP network design with end-to-end QoS constraints

Cited by 17 publications

References 11 publications

Performance analysis of multimedia based web traffic with QoS constraints

Performance analysis of multimedia based web traffic with QoS constraints

Discrete Capacity Assignment in IP networks using Particle Swarm Optimization

A Tabu Search algorithm for dynamic routing in ATM cell-switching networks

Contact Info

Product

Resources

About