Sciweavers

11371 search results - page 256 / 2275
» The network inhibition problem
Sort
View
TCS
2010
15 years 1 months ago
Window-games between TCP flows
We consider network congestion problems between TCP flows and define a new game, the Window-game, which models the problems of network congestion caused by the competing flows. An...
Pavlos S. Efraimidis, Lazaros Tsavlidis, George B....
MOBICOM
2012
ACM
13 years 9 months ago
Temporal reachability graphs
While a natural fit for modeling and understanding mobile networks, time-varying graphs remain poorly understood. Indeed, many of the usual concepts of static graphs have no obvi...
John Whitbeck, Marcelo Dias de Amorim, Vania Conan...
TIT
2011
149views more  TIT 2011»
15 years 1 months ago
Network Coding for Computing: Cut-Set Bounds
Abstract—The following network computing problem is considered. Source nodes in a directed acyclic network generate independent messages and a single receiver node computes a tar...
Rathinakumar Appuswamy, Massimo Franceschetti, Nik...
DEBS
2008
ACM
15 years 7 months ago
Availability models for underlay aware overlay networks
Availability of an overlay network is a necessary condition for event delivery in event based systems. The availability of the overlay links depends on the underlying physical net...
Madhu Kumar SD, Umesh Bellur
MASCOTS
2008
15 years 8 months ago
Network Information Flow in Network of Queues
Two classic categories of models exist for computer networks: network information flow and network of queues. The network information flow model appropriately captures the multi-ho...
Phillipa Gill, Zongpeng Li, Anirban Mahanti, Jingx...