M. Medard, S. Finn, R. Barry, and R. Gallager. Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs. IEEE/ACM Transactions on Networking, 7(5):641--652, Oct. 1999. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Constrained Random Walks on Random Graphs: Routing Algorithms.. - Servetto (2002) (8 citations) (Correct)
....Yet among all these paths (disjoint or braided) there is one path that is considered primary , whereas the other ones are maintained as backups to deal with node failures. In the context of a different network though, a similar idea of maintaining backup routes had also been proposed in [20]. In our work, we do away entirely with the concept of maintaining route information. There exist multiple routes between source and destination, but each node is completely unaware of this, each node simply randomly chooses one of its neighbors to forward a packet how to compute locally the pdf ....
M. Medard, S. G. Finn, R. A. Barry, and R. G. Gallager. Redundant Trees for Preplanned Recovery in Arbitrary Vertex-Redundant or Edge-Redundant Graphs. IEEE/ACM Trans. Networking, 7(5):641--652, 1999.
Partial Path Protection for WDM Networks: End-to-End.. - Wang, Modiano, Medard (2002) (2 citations) Self-citation (Medard) (Correct)
No context found.
Muriel Medard, Steven G. Finn, Richard A. Barry, and Robert G. Gallager, Redundant Trees for Preplanned Recovery in Arbitrary Vertex-Redundant Graphs, IEEE/ACM Transactions on Networking, vol. 7, no. 5, PP. 641-652, Oct. 1999.
Partial Path Protection for WDM Networks: End-to-End.. - Wang, Modiano, Medard (2002) (2 citations) Self-citation (Medard) (Correct)
No context found.
Muriel Medard, Steven G. Finn, Richard A. Barry, and Robert G. Gallager, Redundant Trees for Preplanned Recovery in Arbitrary Vertex-Redundant Graphs, IEEE/ACM Transactions on Networking, vol. 7, no. 5, PP. 641-652, Oct. 1999.
A Network Management Architecture for Robust Packet Routing.. - Médard, Lumetta Self-citation (Medard) (Correct)
....upon redundant trees, i.e. pairs of trees in which each node is connected to at least one tree root even after failure of a single link or node. Such pairs of trees were first introduced in [IR88, ZI89] using s t numberings ( LEC66] and a more general method of constructing them was given in [MFBG99] This paper extends the work in [MFBG99] to permit separation of the two tree roots, which allows the possibility of recovering from the failure of either root node. For the access protocol within our network management architecture, we address only the mechanism by which nodes can transmit and ....
....in which each node is connected to at least one tree root even after failure of a single link or node. Such pairs of trees were first introduced in [IR88, ZI89] using s t numberings ( LEC66] and a more general method of constructing them was given in [MFBG99] This paper extends the work in [MFBG99] to permit separation of the two tree roots, which allows the possibility of recovering from the failure of either root node. For the access protocol within our network management architecture, we address only the mechanism by which nodes can transmit and receive. As mentioned before, our goal ....
[Article contains additional citation context not shown here]
M. Medard, S. G. Finn, R. A. Barry, and R. G. Gallager. Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs. October 1999.
Generalized Loop-back Recovery in Optical Mesh Networks - Médard, Barry, Finn, He.. (2002) (1 citation) Self-citation (Edard Finn Barry) (Correct)
....any such cycle, a path can be added as above, and subsequent paths can be added, in arbitrary ways, until all nodes are included. It is less simple to choose the direction of the added paths, and hence the B and R directed sub graphs. The technique we present relies in part on results presented [MFBG99, MFB97, FMB97, MFGB98] We now present the algorithm followed by the proof of its correctness. ALGORITHM FOR SELECTING DIRECTIONS TO RECOVER FROM NODE FAILURES 1. Set j = 1. Pick an arbitrary edge e = s; t] and assign v(s) V 0 and v(t) 0. 2. a) Choose any cycle (s; c 1 ; c k 1 ....
M. Medard, S. G. Finn, R. A. Barry, and R. G. Gallager. Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs. IEEE/ACM Transactions on Networking, 7(5):641-652, October 1999.
Robust Routing for Local Area Optical Access Networks - Médard (2000) Self-citation (Medard) (Correct)
....no arcs with the primary tree, and such that removal of any edge (and its two associated arcs) leaves the root connected to every node on at least one of the trees. Such trees were first introduced in [1, 4] using s t numberings ( 2] and a more general method of constructing them was given in [3]. A single wavelength, used in both directions, is sufficient to construct the primary and secondary trees. The roots of the primary and secondary tree must therefore be able to perform wavelength conversion, by placing the traffic from the collection routing onto the distribution trees. We only ....
M. Medard, S. G. Finn, R. A. Barry, R. G. Gallager, "Redundant Trees for Preplanned Recovery in Arbitrary Vertex-Redundant or Edge-Redundant Graphs," in IEEE/ACM Transactions on Networking, 1999.
A Scalable Overlay Multicast Architecture for Large-Scale.. - Lao, Cui, Gerla (2004) (Correct)
No context found.
M. Medard, S. Finn, R. Barry, and R. Gallager. Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs. IEEE/ACM Transactions on Networking, 7(5):641--652, Oct. 1999.
An Architecture for Scalable, Efficient and Fast.. - Cui, Faloutsos, Gerla (2004) (Correct)
No context found.
M. Medard, S. Finn, R. Barry, and R. Gallager. Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs. IEEE/ACM Transactions on Networking, 7(5):641 --652, Oct. 1999.
On Disjoint Path Pairs with Wavelength Continuity.. - Andersen, Chung, Sen.. (2004) (Correct)
No context found.
M. M edard, S.G. Finn, R.A. Barry and R.G. Gallager, Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs, IEEE/ACM Trans. on Networking, Vol. 7(1999), pp. 641--652.
A Scalable Overlay Multicast Architecture for Large-Scale.. - Lao, Cui, Gerla (2004) (Correct)
No context found.
M. Medard, S. Finn, R. Barry, and R. Gallager. Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs. IEEE/ACM Transactions on Networking, 7(5):641--652, Oct. 1999.
An Architecture for Scalable, Efficient and Fast.. - Cui, Faloutsos, Gerla (Correct)
No context found.
M. Medard, S. Finn, R. Barry, and R. Gallager. Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs. IEEE/ACM Transactions on Networking, 7(5):641 --652, Oct. 1999.
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