Share Email Print
cover

Proceedings Paper

Minimum capacity dimensioning in diff-serv-aware MPLS networks
Author(s): Fang Rong; Lemin Li; Hongfang Yu; Dan Liao; Hongbin Luo
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

This paper focuses on minimizing the capacity of DiffServ/MPLS networks taking into account two widely deployed bandwidth constraint models: the maximum allocation model (MAM) and the Russion doll model (RDM). With the given physical network and traffic demands, by optimizing Label Switched Paths (LSPs) resource allocation, route distribution, our designs aim at minimizing the link capacity of the total network. The optimization problems are formulated as integer linear programming (ILP) models first, and then, since the ILP formulation is not adapted for large-scale network, two novel fast algorithms are proposed. Numerous simulation results for a variety of networks indicate that the performances of our proposed algorithms are close to the optimal results.

Paper Details

Date Published: 19 November 2008
PDF: 9 pages
Proc. SPIE 7137, Network Architectures, Management, and Applications VI, 71371D (19 November 2008); doi: 10.1117/12.803238
Show Author Affiliations
Fang Rong, Univ. of Electronic Science and Technology of China (China)
Lemin Li, Univ. of Electronic Science and Technology of China (China)
Hongfang Yu, Univ. of Electronic Science and Technology of China (China)
Dan Liao, Univ. of Electronic Science and Technology of China (China)
Hongbin Luo, Univ. of Electronic Science and Technology of China (China)


Published in SPIE Proceedings Vol. 7137:
Network Architectures, Management, and Applications VI
Weisheng Hu; Shoa-Kai Liu; Ken-ichi Sato; Lena Wosinska, Editor(s)

© SPIE. Terms of Use
Back to Top