233 search results - page 18 / 47 » Flows on Few Paths: Algorithms and Lower Bounds |
SPAA
2005
ACM
14 years 1 months ago
2005
ACM
We study the admission control problem in general networks. Communication requests arrive over time, and the online algorithm accepts or rejects each request while maintaining the...
CISS
2007
IEEE
14 years 2 months ago
2007
IEEE
— The problem of detecting encrypted information flows using timing information is considered. An information flow consists of both information-carrying packets and irrelevant ...
CISS
2008
IEEE
14 years 2 months ago
2008
IEEE
Abstract— We consider the network control problem for wireless networks with flow level dynamics under the general k-hop interference model. In particular, we investigate the co...
SIGECOM
2005
ACM
14 years 1 months ago
2005
ACM
We address the problem of lowering the buyer’s expected payments in shortest path auctions, where the buyer’s goal is to purchase a path in a graph in which edges are owned by...
GLOBECOM
2006
IEEE
14 years 1 months ago
2006
IEEE
— This paper examines burst contention resolution problems in optical burst switching (OBS) networks. Since burst contentions take place i) when the network is congested by incre...