Open Access. Powered by Scholars. Published by Universities.®

Computer Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 5 of 5

Full-Text Articles in Computer Engineering

On The Feasibility And Efficacy Of Protection Routing In Ip Networks, Kin Wah (Eric) Kwong, Lixin Gao, Roch A. Guérin, Zhi-Li Zhang Feb 2011

On The Feasibility And Efficacy Of Protection Routing In Ip Networks, Kin Wah (Eric) Kwong, Lixin Gao, Roch A. Guérin, Zhi-Li Zhang

Departmental Papers (ESE)

With network components increasingly reliable, routing is playing an ever greater role in determining network reliability. This has spurred much activity in improving routing stability and reaction to failures, and rekindled interest in centralized routing solutions, at least within a single routing domain. Centralizing decisions eliminates uncertainty and many inconsistencies, and offers added flexibility in computing routes that meet different criteria. However, it also introduces new challenges; especially in reacting to failures where centralization can increase latency. This paper leverages the flexibility afforded by centralized routing to address these challenges. Specifically, we explore when and how standby backup forwarding options ...


A Cross-Layer Modification To The Dsr Routing Protocol In Wireless Mesh Networks, Mustafa Ramadhan Sep 2010

A Cross-Layer Modification To The Dsr Routing Protocol In Wireless Mesh Networks, Mustafa Ramadhan

Doctoral

A cross-layer modification to the DSR routing protocol that finds high throughput paths in WMNs has been introduced in this work. The Access Efficiency Factor (AEF) has been introduced in this modification as a local congestion avoidance metric for the DSR routing mechanism as an alternative to the hop count (Hc) metric. In this modification, the selected path is identified by finding a path with the highest minimum AEF (max_min_AEF) value. The basis of this study is to compare the performance of the Hc and max_min_AEF as routing metrics for the DSR protocol in WMNs using the OPNET modeler. Performance ...


On The Feasibility And Efficacy Of Protection Routing In Ip Networks, Kin-Wah (Eric) Kwong, Lixin Gao, Roch A. Guérin, Zhi-Li Zhang Dec 2009

On The Feasibility And Efficacy Of Protection Routing In Ip Networks, Kin-Wah (Eric) Kwong, Lixin Gao, Roch A. Guérin, Zhi-Li Zhang

Departmental Papers (ESE)

With network components increasingly reliable, routing is playing an ever greater role in determining network reliability. This has spurred much activity in improving routing stability and reaction to failures, and rekindled interest in centralized routing solutions, at least within a single routing domain. Centralizing decisions eliminates uncertainty and many inconsistencies, and offers added flexibility in computing routes that meet different criteria. However, it also introduces new challenges; especially in reacting to failures where centralization can increase latency. This paper leverages the flexibility afforded by centralized routing to address these challenges. Specifically, we explore when and how standby backup forwarding options ...


Always Acyclic Distributed Path Computation, Saikat Ray, Roch A. Guérin, Kin Wah (Eric) Kwong, Rute Sofia Oct 2009

Always Acyclic Distributed Path Computation, Saikat Ray, Roch A. Guérin, Kin Wah (Eric) Kwong, Rute Sofia

Departmental Papers (ESE)

Distributed routing algorithms may give rise to transient loops during path recomputation, which can pose significant stability problems in high-speed networks. We present a new algorithm, Distributed Path Computation with Intermediate Variables (DIV), which can be combined with any distributed routing algorithm to guarantee that the directed graph induced by the routing decisions remains acyclic at all times. The key contribution of DIV, besides its ability to operate with any routing algorithm, is an update mechanism using simple message exchanges between neighboring nodes that guarantees loop-freedom at all times. DIV provably outperforms existing loop-prevention algorithms in several key metrics such ...


Optimisation Of Multicast Routing In Wireless Mesh Networks, Brian Keegan, Karol Kowalik, Mark Davis Oct 2008

Optimisation Of Multicast Routing In Wireless Mesh Networks, Brian Keegan, Karol Kowalik, Mark Davis

Conference papers

In recent years Wireless Mesh Networks have been deployed and grown in popularity in many metropolitan areas. The deployment of such networks has allowed clients to gain access to publicly available broadband networks. The implementation of wireless mesh networks requires that backhaul services (traditionally carried by wired networks) be maintained via wireless mesh points. Because of their structure, wireless mesh networks provide an excellent means for targeting a large group of end users or simply to relay data. This may be achieved by means of broadcasting or more specifically multicasting. The lack of standards and support for multicasting over wireless ...