2421 search results - page 121 / 485 » Approximate Flow-Aware Networking |
125
click to vote
INFOCOM
2010
IEEE
15 years 1 months ago
2010
IEEE
—This paper formally establishes that random access scheduling schemes, and, more specifically CSMA-CA, yields exceptionally good performance in the context of wireless multihop...
128
click to vote
INFOCOM
2010
IEEE
15 years 1 months ago
2010
IEEE
—Beaconing is a primitive communication task in which every node locally broadcasts a packet to all its neighbors within a fixed distance. Assume that all communications proceed...
142
Voted
INFOCOM
2010
IEEE
15 years 1 months ago
2010
IEEE
Abstract—We consider a cognitive radio network where multiple secondary users (SUs) contend for spectrum usage, using random access, over available primary user (PU) channels. Ou...
TCOM
2010
15 years 1 months ago
2010
Abstract—To gradually expand their networks, operators deploy new xDSL technologies from remote terminals (RT’s) closer to the customer. However, since xDSL lines deployed from...
106
click to vote
CP
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. We study the problem of maximizing the amount of stochastic diffusion in a network by acquiring nodes within a certain limited budget. We use a Sample Average Approximati...