390 search results - page 75 / 78 » Use It or Lose It |
INFOCOM
2006
IEEE
14 years 1 months ago
2006
IEEE
—Routing algorithms such as Distance Vector and Link States have the routing table size as ΩΩΩΩ (n), where n is the number of destination identifiers, thus providing only...
INFOCOM
2006
IEEE
14 years 1 months ago
2006
IEEE
— This paper examines congestion control issues for TCP flows that require in-network processing on the fly in network elements such as gateways, proxies, firewalls and even r...
IMC
2003
ACM
14 years 29 days ago
2003
ACM
Time-varying congestion on Internet paths and failures due to software, hardware, and configuration errors often disrupt packet delivery on the Internet. Many aproaches to avoidi...
SPAA
2003
ACM
14 years 29 days ago
2003
ACM
Link reversal algorithms provide a simple mechanism for routing in mobile ad hoc networks. These algorithms maintain routes to any particular destination in the network, even when...
ISCA
2002
IEEE
14 years 19 days ago
2002
IEEE
This paper investigates a class of main memory accesses (invalid memory traffic) that can be eliminated altogether. Invalid memory traffic is real data traffic that transfers inva...