Sciweavers

13214 search results - page 310 / 2643
» Pseudorandomness for network algorithms
Sort
View
ISCC
2005
IEEE
16 years 10 days ago
A Label Space Reduction Algorithm for P2MP LSPs Using Asymmetric Tunnels
- Traffic Engineering objective is to optimize network resource utilization. Although several works have been published about minimizing network resource utilization, few works hav...
Fernando Solano, Ramón Fabregat, Yezid Dono...
PAM
2005
Springer
16 years 7 days ago
Applying Principles of Active Available Bandwidth Algorithms to Passive TCP Traces
Abstract. While several algorithms have been created to actively measure the end-to-end available bandwidth of a network path, they require instrumentation at both ends of the path...
Marcia Zangrilli, Bruce Lowekamp
VLDB
2005
ACM
115views Database» more  VLDB 2005»
16 years 6 days ago
KLEE: A Framework for Distributed Top-k Query Algorithms
This paper addresses the efficient processing of top-k queries in wide-area distributed data repositories where the index lists for the attribute values (or text terms) of a query...
Sebastian Michel, Peter Triantafillou, Gerhard Wei...
ECUMN
2004
Springer
15 years 10 months ago
Fast Handoff Algorithm Using Access Points with Dual RF Modules
With the spread of portable computers, mobile users rapidly increase and have growing interests in wireless LAN (WLAN). However, when a mobile node (MN) moves, handoff can frequent...
Chun-Su Park, Hye-Soo Kim, Sang-Hee Park, Kyunghun...
CCR
2008
94views more  CCR 2008»
15 years 6 months ago
Probabilistic lossy counting: an efficient algorithm for finding heavy hitters
Knowledge of the largest traffic flows in a network is important for many network management applications. The problem of finding these flows is known as the heavy-hitter problem ...
Xenofontas A. Dimitropoulos, Paul Hurley, Andreas ...