Fast restoring gigabit wireless networks using a directional mesh architecture

Fourth Generation (4G) wireless networking may involve gigabit per second transmission based on a mesh network architecture. These networks may use Extremely High frequency or optical bands. The network is formed in an ad hoc manner. For this directional mesh network, we present a new restoration algorithm for broadband wireless optical networks. A special restoration strategy, called local recovery for local failure is applied in the proposed algorithm. Specifically, each node initializes the recovery process independently of other nodes in the network when the failed link is local to the node. This algorithm is a hybrid restoration scheme, consisting of a route pre-planning phase and a real-time rerouting phase. Transient link/node failure, lasting only a short duration is typical in wireless communications and specially handled in our algorithm. We explore the response times of the proposed restoration algorithm. Simulation results over typical network structures show that we could achieve a full recovery of single-link failure, nearly 100% recovery of single-node failure, as well as around 99.5% recovery of double-link failure.

[1]  Andrea Fumagalli,et al.  Survivable networks based on optimal routing and WDM self-healing rings , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[2]  D. Awduche,et al.  Multiprotocol lambda switching: combining MPLS traffic engineering control with optical crossconnects , 2001, IEEE Commun. Mag..

[3]  Jeffery L. Kennington,et al.  Fault restoration and spare capacity allocation with QoS constraints for MPLS networks , 2000, Globecom '00 - IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137).

[4]  Muriel Médard,et al.  Towards a deeper understanding of link restoration algorithms for mesh networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[5]  Wayne D. Grover,et al.  Theoretical underpinnings for the efficiency of restorable networks using preconfigured cycles ("p-cycles") , 2000, IEEE Trans. Commun..

[6]  John B. Shoven,et al.  I , Edinburgh Medical and Surgical Journal.

[7]  David Eppstein,et al.  Finding the k shortest paths , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[8]  Murali S. Kodialam,et al.  Dynamic routing of locally restorable bandwidth guaranteed tunnels using aggregated link usage information , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[9]  Murali S. Kodialam,et al.  Dynamic routing of restorable bandwidth-guaranteed tunnels using aggregated network resource usage information , 2003, TNET.

[10]  Luca Valcarenghi,et al.  The preplanned weighted restoration scheme , 2001, 2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552).

[11]  Kai-Yeung Siu,et al.  New dynamic algorithms for shortest path tree computation , 2000, TNET.

[12]  Salah Aidarous,et al.  Distributed Restoration of the Transport Network , 1994 .

[13]  John Moy,et al.  OSPF Version 2 , 1998, RFC.

[14]  Wayne D. Grover,et al.  A highly efficient path-restoration protocol for management of optical network transport integrity , 2000, IEEE Journal on Selected Areas in Communications.

[15]  C. E. Chow,et al.  Performance analysis of fast distributed network restoration algorithms , 1993, Proceedings of GLOBECOM '93. IEEE Global Telecommunications Conference.

[16]  M. Medard,et al.  Capacity versus robustness: a tradeoff for link restoration in mesh networks , 2000, Journal of Lightwave Technology.

[17]  Alberto Marchetti-Spaccamela,et al.  Dynamic algorithms for shortest paths in planar graphs , 1993, Theor. Comput. Sci..

[18]  Daniele Frigioni,et al.  Semi-Dynamic Shortest Paths and Breadth-First Search in Digraphs , 1997, STACS.

[19]  M.J. O'Mahony,et al.  Distributed restoration strategies in telecommunications networks , 1994, Proceedings of ICC/SUPERCOMM'94 - 1994 International Conference on Communications.

[20]  J. Bicknell,et al.  A fast distributed network restoration algorithm , 1993, Proceedings of Phoenix Conference on Computers and Communications.