45 search results - page 7 / 9 » Dynamic Packet Routing on Arrays with Bounded Buffers |
MOBIHOC
2003
ACM
14 years 7 months ago
2003
ACM
A central challenge in ad hoc networks is the design of routing protocols that can adapt their behavior to frequent and rapid changes in the network. The performance of proactive ...
INFOCOM
2008
IEEE
14 years 1 months ago
2008
IEEE
Abstract—Inference of the routing topology and link performance from a node to a set of other nodes is an important component of network monitoring and application design. In thi...
USS
2010
13 years 5 months ago
2010
Idle port scanning uses side-channel attacks to bounce scans off of a "zombie" host to stealthily scan a victim IP address and determine if a port is open or closed, or ...
STOC
2003
ACM
14 years 7 months ago
2003
ACM
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
INFOCOM
1999
IEEE
13 years 11 months ago
1999
IEEE
In general topology networks, routing from one node to another over a tree embedded in the network is intuitively a good strategy, since it typically results in a route length of O...