Sciweavers

3637 search results - page 679 / 728
» On Dynamic Bit-Probe Complexity
Sort
View
DASFAA
2006
IEEE
121views Database» more  DASFAA 2006»
14 years 3 months ago
Distributed Network Querying with Bounded Approximate Caching
Abstract. As networks continue to grow in size and complexity, distributed network monitoring and resource querying are becoming increasingly difficult. Our aim is to design, build...
Badrish Chandramouli, Jun Yang 0001, Amin Vahdat
GLOBECOM
2006
IEEE
14 years 3 months ago
Efficient Approximations for Call Admission Control Performance Evaluations in Multi-Service Networks
—Several dynamic call admission control (CAC) schemes for cellular networks have been proposed in the literature to reserve resources adaptively to provide the desired quality of...
Emre A. Yavuz, Victor C. M. Leung
ICAS
2006
IEEE
171views Robotics» more  ICAS 2006»
14 years 3 months ago
Adaptive Approach to Information Dissemination in Self-Organizing Grids
The size, complexity, heterogeneity, and dynamism of largescale computational grids make autonomic grid services and solutions necessary. In particular, grid schedulers must map a...
Deger Cenk Erdil, Michael J. Lewis, Nael B. Abu-Gh...
ICMCS
2006
IEEE
154views Multimedia» more  ICMCS 2006»
14 years 3 months ago
Implementation and Evolution of Packet Striping for Media Streaming Over Multiple Burst-Loss Channels
Modern mobile devices are multi-homed with WLAN and WWAN communication interfaces. In a community of nodes with such multihomed devices — locally inter-connected via high-speed ...
Gene Cheung, Puneet Sharma, Sung-Ju Lee
ICNP
2006
IEEE
14 years 3 months ago
Orthogonal Rendezvous Routing Protocol for Wireless Mesh Networks
— Routing in multi-hop wireless networks involves the indirection from a persistent name (or ID) to a locator. Concepts such as coordinate space embedding help reduce the number ...
Bow-Nan Cheng, Murat Yuksel, Shivkumar Kalyanarama...