Iraschko, R.R., Grover, W. D., MacGregor, M. H., "A Distributed Real Time Path Restoration Protocol with Performance close to Centralized Multi-commodity Max Flow", Proc. First Int. Workshop on Design or Reliable Communication Networks (DRCN'98), IMEC, U.Ghent (organizers), Brugge, Belgium, May 17-20, 1998.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....or more signal units which were terminated on it (in the SONET sense of path termination) it enters the Sender state if its name has higher ordinal rank than its O D peer. The other node becomes Chooser for this O D pair. In the case of 6. Interestingly, in work leading up to the present protocol [23, 43], we found that bi directional flooding, which on average halves the protocol forward flooding and reverse linking time [31,37] seems fundamentally also to require a third logical phase for path confirmation and locking, which the present unidirectional protocol does not require. Once the Sender ....

....fundamentally also to require a third logical phase for path confirmation and locking, which the present unidirectional protocol does not require. Once the Sender sees a reverse linking event, it is assured that the path is locked end to end. Thus, the bi directional version of the present DRA [23, 43] is slower than the unidirectional implementation presented here. We suspect this may be true in general. preprint of paper to appear in IEEE Journal on Selected Areas in Communications, Special Issue on Recent Advances in Network Management and Operations scheduled to appear in 2nd Quarter, ....

[Article contains additional citation context not shown here]

Iraschko, R.R., Grover, W. D., MacGregor, M. H., "A Distributed Real Time Path Restoration Protocol with Performance close to Centralized Multi-commodity Max Flow", Proc. First Int. Workshop on Design or Reliable Communication Networks (DRCN'98), IMEC, U.Ghent (organizers), Brugge, Belgium, May 17-20, 1998.

....(adapted from [1] Fig. 3. Example of a span restoration path set for span cut (6 7) only the reserve network is shown (adapted from [25] be solved in a self organizing way. Recently, however, significant progress has been made toward development of a corresponding path restoration process [13]. The pathrestoration process, however, is strongly based on the same techniques and principles that are used for self organizing span restoration. We proceed, therefore, to devote the present coverage primarily to span restoration. This is a necessary step to appreciating the issues and ....

....interprocessor communication links. A statelet is not 2 In prior work for example, in [19] 25] these were called signatures. This turned out to be rather a misnomer for the way these information tags are actually used. Coincident with new work on extension of the SHN to path restoration [13], we adopted the term statelet. It is more descriptive of the small fragment of global network state that each link bears. addressed to a destination, as a message is; it arrives at whatever node and in whichever port to which the transport signal is connected. Similarly, a node applying a ....

[Article contains additional citation context not shown here]

R. R. Iraschko, W. D. Grover, and M. H. MacGregor, "A distributed real-time path restoration protocol with performance close to centralized multi-commodity max flow," U.S. patent pending. See also Proc. IEEE ICC'98, to be published.

No context found.

R.R. Iraschko, W.D. Grover, and M.H. MacGregor. "A Distributed Real-Time Path Restoration Protocol with Performance Close to Centralized Multi-Commodity Maxflow". In 1 Intl. Workshop on Design of Reliable Communication Networks, 1998.

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