Algorithms and Models for Problems in Networking
Many interesting theoretical problems arise from computer networks. In this thesis we will consider three of them: algorithms and data structures for problems involving distances in networks (in particular compact routing schemes, distance labels, and distance oracles), algorithms for wireless capac...
Main Author: | Dinitz, Michael |
---|---|
Format: | Others |
Published: |
Research Showcase @ CMU
2010
|
Subjects: | |
Online Access: | http://repository.cmu.edu/dissertations/9 http://repository.cmu.edu/cgi/viewcontent.cgi?article=1006&context=dissertations |
Similar Items
-
Evaluating security-enhanced interdomain routing protocols in full and partial deployment
by: Lychev, Robert D.
Published: (2014) -
Improving the convergence of IP routing protocols
by: Francois, Pierre
Published: (2007) -
Collaborative Network Security: Targeting Wide-area Routing and Edge-network Attacks
by: Hiran, Rahul Gokulchand
Published: (2016) -
SD-BROV: An Enhanced BGP Hijacking Protection with Route Validation in Software-Defined eXchange
by: Pang-Wei Tsai, et al.
Published: (2021-06-01) -
BGP-based interdomain traffic engineering
by: Quoitin, Bruno
Published: (2006)