Stavros D. Nikolopoulos, Andreas Pitsillides, David Tipper  Home/Search
Context Related
| cs.ucy.ac.cy/networksgr...INFOCOM97.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.ucy.ac.cy/netwo...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Due to the increasing reliance of our society on the timely and reliable transfer of large quantities of information (such as voice, data, and video) across high speed communication networks, it is becoming important for a network to offer survivability, or at least graceful degradation, in the event of network failure. In this paper we aim to offer a solution in the selection of the K-best disjoint paths through a network by using graph theoretic techniques. The basic approach is to map an... (Update)
Context of citations to this paper: More
...cost network flow (MCNF) algorithm. However, the algorithm can only be applied in a trellis graph. Recently Nikolopoulos et al. [9] provided an algorithm to transfer an arbitrary graph to a trellis graph and then to obtain the k best paths by Castanon s Algorithm. The...
Cited by: More
K-Best Paths Algorithm for Highly Reliable Communication Networks - Wu (1999) (Correct)
Similar documents (at the sentence level):
29.1%: On Network Survivability Algorithms based on Trellis.. - Louca, Pitsillides.. (1999) (Correct)
Active bibliography (related documents): More All
2.8: Addressing Network Survivability Issues by Finding.. - Nikolopoulos.. (1997) (Correct)
2.8: Addressing Network Survivability Issues by Finding - The Best Paths (1997) (Correct)
0.3: A New Pruning/Merging Algorithm for MHT Multitarget Tracking - Buckley, Vaddiraju, Perry (2000) (Correct)
Similar documents based on text: More All
0.1: Comparative Study on Restoration Schemes of Survivable ATM.. - Murakami, Kim (1997) (Correct)
0.1: Transportation Performance, Disaster Vulnerability, and Long-Term.. - Chang (2000) (Correct)
0.1: Extracting Key Paragraph .based on Topic and Event.. - Fumiyo Fukumoto And (Correct)
BibTeX entry: (Update)
S.D. Nikolopoulos, A. Pitsillides, and D. Tipper, "Addressing network survivability issues by finding the K-best paths through a trellis graph," Proc. IEEE INFOCOM, Kobe, Japan, 1997. http://citeseer.ist.psu.edu/nikolopoulos77addressing.html More
@inproceedings{ nikolopoulos97addressing,
author = "Stavros D. Nikolopoulos and Andreas Pitsillides and David Tipper",
title = "{Addressing network survivability issues by finding the $K$-best paths through a trellis graph}",
booktitle = "Proc. 16th Joint. Conf. {IEEE} Computer {\&} Communications Socs.",
volume = "1",
pages = "370--377",
year = "1997",
url = "citeseer.ist.psu.edu/nikolopoulos77addressing.html" }
Citations (may not include all citations):474 Graph Theory (context) - Harary - 1969
109 Applied Dynamic Programming (context) - Bellman, Dreyfus - 1962
51 Disjoint paths in a network (context) - Suurballe - 1974
31 A quick method for finding shortest pairs of disjoint paths (context) - Suurballe, Tarjan - 1984
9 Optimal diverse routing in telecommunication fiber networks (context) - Bhandari - 1994
9 Span-disjoint paths for physical diversity in networks (context) - Shaikh - 1995
9 Finding the Best Set of K Paths Through a Trellis with Appli.. (context) - Wolf, Viterbi et al. - 1989
6 Algorithms and Architectures for Dynamic Programming on Mark.. (context) - Bliss, Scharf - 1989
5 Design method of highly reliable communication network by th.. (context) - Tanaka, Rui-xue et al. - 1987
5 Efficient Algorithms for Finding the K Best Paths Through a .. (context) - Castanon - 1990
4 Towards Network Survivability by Finding the K-best Paths th.. (context) - Nikolopoulos, Pitsillides - 1996
3 Comparison og k-shortest paths and maximum flow routing for .. (context) - Dunn, Grover et al. - 1994
3 Sob-optimal Approach to Track Detection for Real-time System.. (context) - Nikolopoulos, Samaras - 1995
3 A recursive matrxi-calculation method for disjoint path sear.. (context) - Oki, Yamanaka - 1995
3 Parallel Block-finding using Distance Matrices (context) - Nikolopoulos - 1996
3 Track Detection using Graph Theoretic Concepts (context) - Nikolopoulos - 1990
Documents on the same site (http://www.cs.ucy.ac.cy/networksgroup/publications.htm): More
Estimation of the Number of Virtual Connections in a.. - Pitsillides, Ioannou, .. (2003) (Correct)
Computational Intelligence in Management of ATM.. - Sekercioglu.. (2001) (Correct)
Overview of Fuzzy-RED in Diff-Serv Networks - Rossides, Chrysostomou.. (2002) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC