We study a model of path-vector routing in which nodes’ routing policies are based on subjective cost assessments of alternative routes. The routes are constrained by the requir...
Joan Feigenbaum, David R. Karger, Vahab S. Mirrokn...
Abstract. We introduce and study the following model for routing uncertain demands through a network. We are given a capacitated multicommodity flow network with a single source an...
Hop-by-hop inter-domain routing protocols, such as BGP and IDRP, use independent route selection to realize domains' local policies. A domain chooses its routes based on path...
Routing table storage demands pose a significant obstacle for large-scale network simulation. On-demand computation of routes can alleviate those problems for models that do not r...
Routing is a black art in today's Internet. End users and ISPs alike have little control over how their packets are handled outside of their networks, stemming in part from l...