116 search results - page 21 / 24 » Fundamental Network Processor Performance Bounds |
FCT
1997
Springer
13 years 10 months ago
1997
Springer
A connection management protocol establishes a connection between two hosts across a wide-area network to allow reliable message delivery. Following previous work of Kleinberg et a...
PODC
2009
ACM
14 years 7 months ago
2009
ACM
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...
INFOCOM
1998
IEEE
13 years 11 months ago
1998
IEEE
The objective of recent research in fair queueing schemes has been to efficiently emulate a fluid-flow generalized (weighted) processor sharing (GPS) system, as closely as possibl...
ICMCS
2000
IEEE
13 years 11 months ago
2000
IEEE
In this paper, we propose to use a simple packet servicing algorithm suitable for servicing bursty real-time multimedia traffic streams in packet-switched networks. These real-tim...
CIKM
2006
Springer
13 years 10 months ago
2006
Springer
In this paper we introduce the distributed spatio-temporal similarity search problem: given a query trajectory Q, we want to find the trajectories that follow a motion similar to ...