2497 search results - page 220 / 500 » Requirements for models of achievable routing |
183
click to vote
IPSN
2009
Springer
16 years 1 months ago
2009
Springer
We consider a scenario in which there are resources at or near nodes of a network, which are either static (e.g. fire stations, parking spots) or mobile (e.g. police cars). Over ...
188
click to vote
MOBICOM
2006
ACM
16 years 17 days ago
2006
ACM
In this paper, we consider the problem of mitigating interference and improving network capacity in wireless mesh networks from the angle of temporal-spatial diversity. In a nutsh...
227
click to vote
SIGCOMM
2005
ACM
16 years 5 days ago
2005
ACM
Hash table is used as one of the fundamental modules in several network processing algorithms and applications such as route lookup, packet classification, per-flow state manage...
229
click to vote
ADBIS
2009
Springer
15 years 11 months ago
2009
Springer
Scaling up web applications requires distribution of load across multiple application servers and across multiple database servers. Distributing load across multiple application se...
167
click to vote
CN
2007
15 years 6 months ago
2007
A practical and robust inter-domain marking scheme for IP traceback is proposed. We first identify six drawbacks of Probabilistic Packet Marking (PPM), and then contrive a synerg...