We introduce a game theoretic model of network formation in an effort to understand the complex system of business relationships between various Internet entities (e.g., Autonomou...
Elliot Anshelevich, F. Bruce Shepherd, Gordon T. W...
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...
— After identifying that current GMPLS specifications only allow for the implementation of a call blocking mode of operation that handles immediate-request calls (not book-ahead...
Abstract— Inferring AS-level end-to-end paths can be a valuable tool for both network operators and researchers. A widely known technique for inferring end-to-end paths is to per...
— In this paper, we investigate the outage performance of cognitive wireless relay networks where source nodes communicate to their destinations via multiple hops facilitated by ...