QoS-based cooperative algorithm for integral multi-commodity flow problem

Ghatee, Mehdi

doi:10.1016/j.comcom.2010.09.003

Cited by 6 publications

(3 citation statements)

References 25 publications

(59 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Therefore, the authors of [7] try to augment the genetic algorithm for a QoS multicast routing problem with a tabu-search technique, that has the opposite character: converges longer but depends of the starting point choice. In neither of the papers, however, very much can be precisely said about the solution quality and time, moreover, the experiments in [6] show an unsmooth, jumpy dependence of the solution time of problem sizes, while a predictable dependence is needed for our application.…”

Section: Related Workmentioning

confidence: 97%

“…The complex problem of QoS multicommodity routing has been also treated with genetic algorithms. An interesting example is contained in [6], where the chromosomes encode some internal flows. The author tries to preserve the feasibility of chromosomes over the iterations.…”

Section: Related Workmentioning

confidence: 99%

“…Modification 2. We add the following constraints: (6) where a parameter ξ v denotes the Protocol Data Unit per second (PDU/s) throughput of node v, and a parameter κ c denotes the size of a class c PDU, expressed in the used units of link capacity multiplied by one second. This modification expresses the limitations of the number of PDUs incoming in a second that the nodes can process.…”

Section: Problem Statementmentioning

confidence: 99%

See 2 more Smart Citations

A Practical Approach to Traffic Engineering using an Unsplittable Multicommodity Flow Problem with QoS Constraints

Białoń

2016

JTIT

View full text Add to dashboard Cite

The paper presents a practical approach to calculating intra-domain paths within a domain of a content-aware network (CAN) that uses source routing. This approach was used in the prototype CAN constructed as a part of the Future Internet Engineering project outcome. The calculated paths must satisfy demands for capacity (capacity for a single connection and for aggregate connections using the given path are considered distinctly) and for a number of path-additive measures like delay, loss ratio. We state a suitable variant of QoS-aware unsplittable multicommodity ow problem and present the solving algorithm. The algorithm answers to the needs of its immediate application in the constructed system: a quick return within a short and fairly predictable time, simplicity and modiability, good behavior in the absence of a feasible solution (returning approximately-feasible solutions, showing how to modify demands to retain feasibility). On the other hand, a certain level of overdimensioning of the network is explored, unlike in a typical optimization algorithm. The algorithm is a mixture of: (i) shortest path techniques, (ii) simpli ed reference-level multicriteria techniques and parametric analysis applied to aggregate the QoS criteria (iii) penalty and mutation techniques to handle the common constraints. Numerical experiments assessing various aspects of the algorithm behavior are given.

show abstract

Section: Related Workmentioning

confidence: 97%

Section: Related Workmentioning

confidence: 99%

Section: Problem Statementmentioning

confidence: 99%

See 1 more Smart Citation