Sciweavers

249 search results - page 5 / 50
» Approximating the Bandwidth of Caterpillars
Sort
View
SSD
2009
Springer
233views Database» more  SSD 2009»
14 years 4 months ago
Approximate Evaluation of Range Nearest Neighbor Queries with Quality Guarantee
The range nearest-neighbor (NN) query is an important query type in location-based services, as it can be applied to the case that an NN query has a spatial region, instead of a lo...
Chi-Yin Chow, Mohamed F. Mokbel, Joe Naps, Suman N...
NETWORKING
2004
13 years 11 months ago
Call-Burst Blocking Probabilities of ON-OFF Traffic Sources under the Bandwidth Reservation Policy
Abstract. We calculate call and burst blocking probabilities (CBP and BBP respectively) in a single link loss system accommodating service-classes of ONOFF traffic calls, either of...
Ioannis D. Moscholios, Michael D. Logothetis
NCA
2005
IEEE
14 years 3 months ago
A Probabilistic Approach for Achieving Fair Bandwidth Allocations in CSFQ
The fair bandwidth allocations can isolate flows and protect well-behaved flows from ill-behaved ones. CSFQ (Core Stateless Fair Queueing) achieves the approximate fairness by d...
Peng Wang, David L. Mills
JCM
2007
79views more  JCM 2007»
13 years 9 months ago
Time Slot Assignment for Maximum Bandwidth in a Mobile Ad Hoc Network
—Time slot assignment is essential to provide the calculated bandwidth in a TDMA (Time Division Multiple Access)-based mobile ad hoc network (MANET), which is a focus of attentio...
Jianping Li, Yasushi Wakahara
SIGCOMM
2000
ACM
14 years 2 months ago
Measuring link bandwidths using a deterministic model of packet delay
We describe a deterministic model of packet delay and use it to derive both the packet pair [2] property of FIFO-queueing networks and a new technique (packet tailgating) for acti...
Kevin Lai, Mary Baker