Sciweavers

321 search results - page 45 / 65
» Approximate Models for General Cache Networks
Sort
View
INFOCOM
2009
IEEE
14 years 3 months ago
A Queueing Model Framework of PCE-Based Inter-Area Path Computation
Abstract—Path computation elements (PCE’s) are used to compute end-to-end paths across multiple areas. Multiple PCE’s may be dedicated to each area to provide sufficient path...
Juanjuan Yu, Yue He, Kai Wu, Marco Tacca, Andrea F...
INFOCOM
2009
IEEE
14 years 3 months ago
Link Scheduling with QoS Guarantee for Wireless Relay Networks
—The emerging wireless relay networks (WRNs) are expected to provide significant improvement on throughput and extension of coverage area for next-generation wireless systems. W...
Chi-Yao Hong, Ai-Chun Pang
MOBIHOC
2007
ACM
14 years 8 months ago
Scalable routing in delay tolerant networks
The non-existence of an end-to-end path poses a challenge in adapting the traditional routing algorithms to delay tolerant networks (DTNs). Previous works include centralized rout...
Cong Liu, Jie Wu
SENSYS
2004
ACM
14 years 1 months ago
Simulating the power consumption of large-scale sensor network applications
Developing sensor network applications demands a new set of tools to aid programmers. A number of simulation environments have been developed that provide varying degrees of scala...
Victor Shnayder, Mark Hempstead, Bor-rong Chen, Ge...
ICDE
2007
IEEE
111views Database» more  ICDE 2007»
14 years 9 months ago
Proof Sketches: Verifiable In-Network Aggregation
Recent work on distributed, in-network aggregation assumes a benign population of participants. Unfortunately, modern distributed systems are plagued by malicious participants. In...
Minos N. Garofalakis, Joseph M. Hellerstein, Petro...