See this document in CiteSeerX!

Protection through Thrifty Configuration  (Make Corrections)  
Tibor Cinkler, Peter Laborczi, Akos Horvath



  Home/Search   Context   Related

 
View or download:
opt.tmit.bme.hu/~cinkler/MYPU...itc5.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  opt.tmit.bme.hu/~cinkler/...index (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: An efficient, network-flow-theory based model with an algorithm is proposed for configuration of networks. The configuration results in a structure of paths which can survive any single link failure. (Update)

Active bibliography (related documents):   More   All
1.8:   Stochastic Algorithms for Design of Thrifty.. - Cinkler, Henk, Gordos (2000)   (Correct)
0.5:   Heuristic Algorithms for Joint Configuration of the.. - Cinkler, Marx.. (2000)   (Correct)
0.3:   Modeling, Algorithms and Analysis of Survivable VP Planning in.. - Wu, Lee (1999)   (Correct)

Similar documents based on text:   More   All
0.3:   Efficient Algorithms for Physically-Disjoint Routing in.. - Laborczi, Cinkler (2004)   (Correct)
0.2:   Quadratic Shading and its Hardware Implementation - Mohamed, Szirmay-Kalos.. (2001)   (Correct)
0.2:   Learning Semantic Functions of Attribute Grammars - Gyimóthy, Horváth (1996)   (Correct)

BibTeX entry:   (Update)

@misc{ cinkler-protection,
  author = "Tibor Cinkler and Peter Laborczi and Akos Horvath",
  title = "Protection through Thrifty Configuration",
  url = "citeseer.ist.psu.edu/713615.html" }
Citations (may not include all citations):
75   Linear Programming and Network Flows (context) - Bazara, Jarvis et al. - 1990
51   Fiber Network Service Survivability (context) - Wu - 1992
51   Disjoint Paths in a Network (context) - Suurballe - 1974
41   Multi-Commodity Network Flows (context) - Hu - 1963
34   Telecommunications Network Design Algorithms (context) - Kershenbaum - 1993
16   Automatic Protection Switching for Link Failures in Optical .. (context) - Ellinas, Stern - 1996
8   Optimal Resource Allocation for Path Restoration in Mesh Typ.. (context) - Herzberg, Wells et al. - 1997
7   Theory of Nets: Flows in Networks (context) - Chen - 1990
3   Optimal Assignment of Spare Capacity to Back-up VPs in Survi.. (context) - Herzberg, Utano - 1996
3   Annotated Bibliographies in Combinatorial Optimization (context) - by, Dell'Amico et al. - 1997
2   Two Techniques for Spare Capacity Assignment in Mesh Surviva.. (context) - Van Caenegem, Wauters et al. - 1997
2   Computers and Intractability \Gamma A Guide to the Theory of.. (context) - Garey, Johnson - 1979
2   Issues for Protection Switching in ATM Networks (context) - Aylott, Safaei - 1996
1   VP reconfiguration through Simulaed Allocation (context) - Gajowniczek, Pi'oro et al. - 1996
1   Network Flows (context) - Magnati - 1993
1   Robust Design Problems in Telecommunication Networks (context) - Pi'oro - 1997
1   Greedy Algorithms for Topological Design (context) - Cinkler, Andersson et al. - 1998
1   Joint Planning of the Phisical and Logical Configuration of .. (context) - Farag'o, Cinkler et al. - 1996

Documents on the same site (http://opt.tmit.bme.hu/~cinkler/MYPUB/index.html):   More
On the Evolution of the Optical Infrastructure - Cinkler, Bjornstad, Careglio, .. (2002)   (Correct)
Efficient Algorithms for Physically-Disjoint Routing in.. - Laborczi, Cinkler (2004)   (Correct)
Planning Reliable UMTS Terrestrial Access Networks - Szlovencsak, Godor.. (2001)   (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