Nowa wersja platformy, zawierająca wyłącznie zasoby pełnotekstowe, jest już dostępna.
Przejdź na https://bibliotekanauki.pl

PL EN


Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników
Czasopismo
2006 | Vol. 32, no 3 | 5-14
Tytuł artykułu

Network protection by single and failure-dependent backup paths - modelling and efficiency comparison

Warianty tytułu
Języki publikacji
EN
Abstrakty
EN
The paper deals with traffic recovery in IP/MPLS network carrying traffic of different priority classes. Two off-line network design problems are presented employing two different recovery mechanisms - single backup path and failure-dependent backup path protection. Also, two routing strategies are studied in this paper. A network design problem with failure-dependent path protection mechanism combined with the routing strategy implying both load balancing and path length minimization is proposed in this paper. The efficiency of the approach proposed is tested by combining optimization and simulation tools. Numerical experiments show that using the proposed protection mechanism allows more traffic to be accommodated in the network and decreases the number of disrupted LSPs in case of failure, as compared to other recovery options considered.
Słowa kluczowe
Wydawca

Czasopismo
Rocznik
Strony
5-14
Opis fizyczny
Bibliogr. 12 poz., rys.
Twórcy
autor
autor
autor
Bibliografia
  • [1] Frederic M.T., Somani A.K., A single-fault recovery strategy for optical networks using subgraph routing, 7th IFIP Working Conf. Optical Network Design and Modelling (ONDM-2003), Budapest, Hungary, February 2003, 3, 6.
  • [2] Gruber C.G., Roster A.M.C.A., Orlowski S., Wessaly R., Zymolka A., A new model and computational study for demand-wise shared protection. Tech. Rep. ZIB-Report 05-55, Konrad-Zuse-Zentrum fur Informationnstechnik Berlin, Berlin-Dahlem, Germany, December 2005, 2, 3.
  • [3] Jain V., Alagar S., Baig S.I., Venkatesan S., Optimal quasi-path restoration in telecom backbone networks, 13th Int. Conf. System Engineering, pp. CS-175-CS-180, Las Vegas, USA, August 1999, 2, 3.
  • [4] Kodialam M.S., Lakshman T.V., Minimum interference routing with applications to MPLS traffic engineering, Proc. INFOCOM (2), 2000, 7, pp. 884-893.
  • [5] Kelly P.P., Maluoo A.K., Tan D.H.K., Rate control for communication networks: Shadow prices, proportional fairness and stability, J. Operations Research Society, 49, 8, 1997, 2006-2017.
  • [6] Kubilinskas E., Pióro M., Nilsson P., Design models for multi-layer next generation Internet core network carrying elastic traffic, Proc. 4th Int. Workshop Design of Reliable Communication Networks, DRCN 2003, Banff, Canada, 2003, 9.
  • [7] Mohan H., Siva Ram Murthy C., Somani A.K., Efficient algorithms for routing dependable connections in WDM optical networks, IEEE/ACM Transactions on Networking, 9 (5), October 2001, 553-566.
  • [8] Patel M., Chandrasekaran R., Venkatesan S., Improved quasi-path restoration scheme and spare capacity assignment in mesh networks. Tech. Rep. UTDCS-14-03. University of Texas at Dallas. Richardson, TX, USA, April 2003.
  • [9] Patel M., Chandrasekaran R., Venkatesan S., A comparative study of restoration schemes and spare capacity assignment in mesh networks, 12th Int. Conf. Computer Communications and Networks, ICCCN 2003, Dallas, TX, USA, 2003, pp. 399-404.
  • [10] Pióro M., Medhi D., Routing Flow and Capacity Design in Communication and Computer Networks, Morgan Kaufmann, 2004.
  • [11] Pióro M., Dzida M., Kubilinskas E., Nilsson P., Ogryczak W., Tomaszewski A., Zagożdżon M., Applications of the max—mill fairness principle in telecommunication network design. First Conf. Next Generation Internet Networks Traffic Engineering, NGI 2005, Rome, Italy, 18-20 April 2005, 8.
  • [12] Ramasubramanian S., On failure dependent protection in optical grooming networks. Int. Conf. Dependable System and Networks, DSN’04, Florence, Italy, June 28-July 1, 2004, 3, pp. 440-449.
Typ dokumentu
Bibliografia
Identyfikatory
Identyfikator YADDA
bwmeta1.element.baztech-article-BAT5-0027-0066
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.