Fast restoring gigabit wireless networks using a directional mesh architecture

Computer Communications

Volumn 26, Issue 17, 2003, Pages 1957-1964

  Wu, Yiwen ^a   Hui, Joseph ^a   Sun, Hongxia ^a  

^a AZ 85281   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BROADBAND NETWORKS; COMPUTER SIMULATION; TELECOMMUNICATION LINKS; WIRELESS TELECOMMUNICATION SYSTEMS;

OPTICAL BANDS;

TELECOMMUNICATION NETWORKS;

EID: 0042863418     PISSN: 01403664     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0140-3664(03)00160-9     Document Type: Article

References (20)

1. Metz C. IP protection and restoration. IEEE Internet Computing. 4:(2):2000;97-102.
2. Iraschko R.R., Grover W.D. A highly efficient path-restoration protocol for management of optical network transport integrity. IEEE Journal on Selected Area in Communications. 18:(5):2000.
3. Lumetta S.S., Medard M., Tsenf Y.-C. Capacity versus robustness: a tradeoff for link restoration in mesh networks. Journal of Lightwave Technology. 18:(12):2000.
4. Lumetta S.S., Medard M. Towards a deeper understanding of link restoration algorithms for mesh networks, INFOCOM 2001. Proceedings, IEEE. 1:2001;367-375.
5. A. Fumagalli, I. Cerutti, M. Tacca, F.Masetti, R.Jaganathan, S. Alagar, Survivable networks based on optimal routing and WDM self-healing ring, INFOCOM 1999, Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies, Proceedings, IEEE Piscataway, NJ 2, pp. 726-733, 1999.
6. Kodialam M., Lakshman T.V. Dynamic routing of locally restorable bandwidth guaranteed tunnels using aggregated link usage information, INFOCOMM 2001. Proceedings, IEEE. 1:2001;376-385.
7. Aidarous S., Plevyak T. Telecommunication network management into the 21st century, Distributed Restoration of the Transport Network. 1994;337-419 IEEE Press.
8. Iraschko R.R., Grover W.D. A highly efficient path-restoration protocol for management of optical network transport integrity. IEEE Journal on Selected Areas in Communications. 18:2000;779-794.
9. Oh H., Chen T.M., Kennington T.L. Fault restoration and spare capacity allocation with QoS constraints for MPLS networks. IEEE Global Telecommunications Conference, 2000 (GLOBECOM'00). 3:2000;1731-1735.
10. Fumagalli A., Valcarenghi L. The preplanned weighted restoration scheme, high performance switching and routing. IEEE Workshop. 2001;36-41.
11. C.E. Chow, J. Bicknell, S. McCaughey, S. Syed, A fast distributed network restoration algorithm, in Proceedings on 12th International Phoenix Conference, Computers and Communications, pp. 261-267, March 1993.
12. Johnson D., Johnson G.N., Beggs S.L., Botham C., Hawker I., Chng R.S.K., Sinclair M.C., O'Mahony M.J. Distributed restoration strategies in telecommunications networks. Proceedings on IEEE International Conference Communications. 1:1994;483-488.
13. Moy J. OSPF version 2. Draft Standard RFC 1583. 1994.
14. D. Eppstein, Finding the k shortest paths, In Proceedings on 35th IEEE Symposium on Foundations of Computer Science, pp. 154-165, 1994.
15. Franciosa P., Frigioni D., Giaccio R. Semi-real-time shortest paths and breadth-first search in digraph. Theoretical Computer Science. 116:1993;359-371.
16. Narvaez P., Siu K.-Y., Tzeng H.-Y. New real-time algorithms for shortest path tree computation. IEEE/ACM Transactions on Networking. 8:(6):2000.
17. Fumagalli A., Valcarenghi L. The preplanned weighted restoration scheme, high performance switching and routing. IEEE Workshop. 2001;36-41.
18. Awduche D., Rekhter Y. Multiprotocol lambda switching: combining MPLS traffic engineering control with optical crossconnects. IEEE Communications Magazine. 39:(3):2001;111-116.
19. Stamatelakis D., Grover W.D. Theoretical underpinnings for the efficiency of restorable networks using pre-configured cycles (p-cycles). IEEE Transaction on Communications. 48:(8):2000;1262-1265.
20. Bicknell J., Chow C.E., Syed S. Performance analysis of fast distributed network restoration algorithms. Proceedings on Globecom'93. 3:1993;1596-1600.