The problem of computing bandwidth guaranteed paths for given flow requests in an ad-hoc network is complicated because neighboring links share the medium. We define the path wi...
Zhanfeng Jia, Rajarshi Gupta, Jean C. Walrand, Pra...
The vast majority of mobile ad hoc networking research makes a very large assumption: that communication can only take place between nodes that are simultaneously accessible withi...
We present a market-based approach to call routing in telecommunications networks. A system architecture is described that allows self-interested agents, representing various netwo...
M. A. Gibney, Nicholas R. Jennings, N. J. Vriend, ...
We present an approach to resource allocation in telecommunications networks based on the interaction of self-interested agents which have limited information about their environme...
Routing is one of the most challenging open problems in disruption-tolerant networks (DTNs) because of the shortlived wireless connectivity environment. To deal with this issue, r...