Compressing Two-Dimensional Routing Tables 1

@inproceedings{Suri2003CompressingTR,
  title={Compressing Two-Dimensional Routing Tables 1},
  author={Subhash Suri and Tuomas Sandholm and Priyank Ramesh Warkhede},
  year={2003}
}
We consider an algorithmic problem that arises in the context of routing tables used by Internet routers. The Internet addressing scheme is hierarchical, where a group of hosts are identified by a prefix that is common to all the hosts in that group. Each host machine has a unique 32-bit address. Thus, all traffic between a source group s and a destination group d can be routed along a particular route c by maintaining a routing entry (s, d, c) at all intermediate routers, where s and d are… CONTINUE READING
Highly Cited
This paper has 17 citations. REVIEW CITATIONS