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

Computer Engineering Commons

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

Digital Communications and Networking

Routing

2009

Articles 1 - 3 of 3

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 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 ...


Evaluating The Vulnerability Of Network Traffic Using Joint Security And Routing Analysis, Patrick Tague, David Slater, Jason Rogers, Radha Poovendran Mar 2009

Evaluating The Vulnerability Of Network Traffic Using Joint Security And Routing Analysis, Patrick Tague, David Slater, Jason Rogers, Radha Poovendran

Patrick Tague

Joint analysis of security and routing protocols in wireless networks reveals vulnerabilities of secure network traffic that remain undetected when security and routing protocols are analyzed independently. We formulate a class of continuous metrics to evaluate the vulnerability of network traffic as a function of security and routing protocols used in wireless networks. We develop two complementary vulnerability definitions using set theoretic and circuit theoretic interpretations of the security of network traffic, allowing a network analyst or an adversary to determine weaknesses in the secure network. We formalize node capture attacks using the vulnerability metric as a nonlinear integer programming ...