Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

IPPS
2000
IEEE

favoriteEmaildiscussreport

91views Distributed And Parallel Com...» more IPPS 2000»

Distributed Models and Algorithms for Survivability in Network Routing

13 years 8 months ago

Distributed Models and Algorithms for Survivability in Network Routing

Download www.ece.uc.edu

Fred S. Annexstein, Kenneth A. Berman

Real-time Traffic

Distributed And Parallel Computing | IPPS 2000 |

claim paper

Related Content

» A Hybrid Algorithm for Dynamic Lightpath Protection in Survivable WDM Optical Networks

» On Survivable Access Network Design Complexity and Algorithms

» Resource Efficient Survivable Clustering for Wireless Sensor Networks

» Evaluation of Secure PeertoPeer Overlay Routing for Survivable SCADA Systems

» A Scalable Algorithm for Survivable Routing in IPOverWDM Networks

» A Novel Graph Model for Maximum Survivability in Mesh Networks under Multiple Generic Risk...

» Bandwidth Clustering for Reliable and Prioritized Network Routing Using Split AgentBased M...

» Provisioning Algorithms in Survivable Optical Networks with Shared Protection

» Survivable Online Routing for MPLS Traffic Engineering

Post Info
More Details (n/a)

Added	31 Jul 2010
Updated	31 Jul 2010
Type	Conference
Year	2000
Where	IPPS
Authors	Fred S. Annexstein, Kenneth A. Berman

Comments (0)