Sciweavers

5079 search results - page 996 / 1016
» Hidden-Action in Network Routing
Sort
View
OPODIS
2008
14 years 11 months ago
Computing and Updating the Process Number in Trees
The process number is the minimum number of requests that have to be simultaneously disturbed during a routing reconfiguration phase of a connection oriented network. From a graph ...
David Coudert, Florian Huc, Dorian Mazauric
CIC
2006
140views Communications» more  CIC 2006»
14 years 11 months ago
An Efficient Update Algorithm for Supporting Mobility in Structured P2P Systems
Structured peer to peer (P2P) systems organize a large number of nodes in well-defined structures and provide efficient and scalable search functionalities. They have been used as ...
Boxuan Gu, Hu Wang, Zongming Fei
IADIS
2004
14 years 11 months ago
Speculative TCP Connection Admission Using Connection Migration in Cluster-Based Servers
This paper presents speculative TCP connection admission, a mechanism for improving sub-optimal request distribution decisions in cluster-based servers. Overloaded server nodes in...
Vlad Olaru, Walter F. Tichy
USENIX
2001
14 years 11 months ago
Flexible Control of Parallelism in a Multiprocessor PC Router
SMP Click is a software router that provides both flexibility and high performance on stock multiprocessor PC hardware. It achieves high performance using device, buffer, and queu...
Benjie Chen, Robert Morris
IM
2008
14 years 9 months ago
Fast and Efficient Restricted Delaunay Triangulation in Random Geometric Graphs
Let G = G(n, r) be a random geometric graph resulting from placing n nodes uniformly at random in the unit square (disk) and connecting every two nodes if and only if their Euclide...
Chen Avin