Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- ArticleAugust 2003
Stratified round Robin: a low complexity packet scheduler with bandwidth fairness and bounded delay
SIGCOMM '03: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communicationsAugust 2003, pp 239–250https://doi.org/10.1145/863955.863983Fair queuing is a well-studied problem in modern computer networks. However, there remains a gap between scheduling algorithms that have provably good performance, and those that are feasible and practical to implement in high speed routers. In this ...
- ArticleAugust 2003
Packet classification using multidimensional cutting
SIGCOMM '03: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communicationsAugust 2003, pp 213–224https://doi.org/10.1145/863955.863980This paper introduces a classification algorithm called phHyperCuts. Like the previously best known algorithm, HiCuts, HyperCuts is based on a decision tree structure. Unlike HiCuts, however, in which each node in the decision tree represents a ...
- ArticleAugust 2003
Automatically inferring patterns of resource consumption in network traffic
SIGCOMM '03: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communicationsAugust 2003, pp 137–148https://doi.org/10.1145/863955.863972The Internet service model emphasizes flexibility -- any node can send any type of traffic at any time. While this design has allowed new applications and usage models to flourish, it also makes the job of network management significantly more ...
- ArticleAugust 2003
The impact of address allocation and routing on the structure and implementation of routing tables
SIGCOMM '03: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communicationsAugust 2003, pp 125–136https://doi.org/10.1145/863955.863971The recent growth in the size of the routing table has led to an interest in quantitatively understanding both the causes (eg multihoming) as well as the effects (eg impact on router lookup implementations) of such routing table growth. In this paper, ...