13214 search results - page 76 / 2643 » Pseudorandomness for network algorithms |
192
click to vote
CCR
2006
15 years 6 months ago
2006
The identification of network applications through observation of associated packet traffic flows is vital to the areas of network management and surveillance. Currently popular m...
152
click to vote
ITCC
2003
IEEE
15 years 11 months ago
2003
IEEE
In this paper, a new algorithm to route traffic efficiently is proposed. The proposed algorithm finds additional routes to the destination and identifies the critical links in the...
182
click to vote
NETWORKS
2006
15 years 6 months ago
2006
Abstract. The Steiner tree problem is to find a shortest subgraph that spans a given set of vertices in a graph. This problem is known to be NP-hard and it is well known that a pol...
174
click to vote
INFOCOM
2000
IEEE
15 years 10 months ago
2000
IEEE
—This paper considers the design of handoff rerouting algorithms for reducing the overall session cost in personal communication systems (PCS). Most modern communication systems ...
141
click to vote
CORR
2000
Springer
15 years 6 months ago
2000
Springer
Network firewalls and routers use a rule database to decide which packets will be allowed from one network onto another. By filtering packets the firewalls and routers can improve...