http://iet.metastore.ingenta.com
1887

Single-path and multi-path label switched path allocation algorithms with quality-of-service constraints: performance analysis and implementation in NS2

Single-path and multi-path label switched path allocation algorithms with quality-of-service constraints: performance analysis and implementation in NS2

For access to this article, please select a purchase option:

Buy article PDF
$19.95
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IET Communications — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

The choice of the path computation algorithm is a key factor to design efficient traffic engineering strategies in multi-protocol label switching networks and different approaches have been proposed in the literature. The effectiveness of a path computation algorithm should be evaluated against its ability to optimise the utilisation of network resources as well as to satisfy both current and future label switched paths allocation requests. Although powerful and flexible simulation tools might be useful to assist a network manager in the selection of proper algorithms, state-of-the-art simulators and network planning tools do not currently offer a suitable support. This study deals with the design and performance evaluation of multi-constraints path computation algorithms. To this aim, ad hoc software modules have been developed and integrated within the MTENS simulator. New single-path and multi-path computation algorithms have been proposed and compared in terms of number of accepted requests, success probability, network resources utilisation and execution time. Finally, some guidelines and recommendations for the selection of path computation algorithms have also been provided.

References

    1. 1)
      • E. Rosen , A. Viswanathan , R. Callon . (2001) Multiprotocol label switching architecture.
    2. 2)
      • D. Awduche , J. Malcolm , J. Agogbua . (1999) Requirements for traffic engineering over MPLS.
    3. 3)
      • Lai, W.: `Traffic engineering for MPLS', Internet Performance and Control of Network Systems III Conf., July 2002, Boston, Massachusetts, USA.
    4. 4)
      • A. Farrel , J.-P. Vasseur , J. Ash . (2006) A path computation element (PCE)-based architecture.
    5. 5)
      • OPNET simulator home page: http://www.opnet.com/, available 9 September 2011.
    6. 6)
      • OMNeT++ discrete event simulation system home page: http://www.omnetpp.org/, available 9 September 2011.
    7. 7)
      • The network simulator version 2.26 (NS2) home page: www.isi.edu/nsnam/dist/, available 9 September 2011.
    8. 8)
      • The MTENS network simulator home page: http://netgroup-serv.iet.unipi.it/software/mtens/, available 9 September 2011.
    9. 9)
    10. 10)
      • Li, Z., Zhang, Z., Wang, L., Novel, A.: `QoS routing scheme for MPLS traffic engineering', Int. Conf. on Communication Technology (ICCT), April 2003, Beijing, China.
    11. 11)
    12. 12)
      • Lee, J., Kim, B.: `Multi-path constraint-based routing algorithms for MPLS traffic engineering', IEEE Int. Conf. on Communications (ICC), May 2003, Anchorage, Alaska, USA.
    13. 13)
      • R.G. Michael , S.J. David . (1979) Computers and intractability: a guide to the theory of NP-completeness.
    14. 14)
      • S. Martello , P. Toth . (1990) Knapsack problems: algorithms and computer implementations.
    15. 15)
      • BRITE, available at: http://www.cs.bu.edu/brite/, available 9 September 2011.
    16. 16)
    17. 17)
      • J.Y. Le Boudec , P. Thiran . (2001) Network calculus – a theory of deterministic queuing systems for the Internet.
    18. 18)
      • Adami, D., Callegari, C., Giordano, S., Pagano, M.: `A new path computation algorithm and its implementation in NS2', IEEE Int. Conf. on Communications (ICC), June 2007, Glasgow, Scotland.
    19. 19)
      • Zegura, E.W., Calvert, K.L., Bhattacharjee, S.: `How to model an internetwork', IEEE INFOCOM '96, 1996, San Francisco, p. 594–602, vol. 2.
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-com.2010.0875
Loading

Related content

content/journals/10.1049/iet-com.2010.0875
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address