On the self-similar nature of Ethernet traffic (extended version)
IEEE/ACM Transactions on Networking (TON)
Dynamic Perfect Hashing: Upper and Lower Bounds
SIAM Journal on Computing
Probability, stochastic processes, and queueing theory: the mathematics of computer performance modeling
Wide area traffic: the failure of Poisson modeling
IEEE/ACM Transactions on Networking (TON)
Internet traffic characterization
Internet traffic characterization
Computer architecture (2nd ed.): a quantitative approach
Computer architecture (2nd ed.): a quantitative approach
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Data networks as cascades: investigating the multifractal nature of Internet WAN traffic
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Fast and scalable layer four switching
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
High-speed policy-based packet forwarding using efficient multi-dimensional range matching
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Packet classification on multiple fields
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
On the nonstationarity of Internet traffic
Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Skewed Associativity Improves Program Performance and Enhances Predictability
IEEE Transactions on Computers
Uniprocessor Garbage Collection Techniques
IWMM '92 Proceedings of the International Workshop on Memory Management
A framework for optimizing the cost and performance of next-generation IP routers
IEEE Journal on Selected Areas in Communications
Billing users and pricing for TCP
IEEE Journal on Selected Areas in Communications
Wide-area Internet traffic patterns and characteristics
IEEE Network: The Magazine of Global Internetworking
MMNS '02 Proceedings of the 5th IFIP/IEEE International Conference on Management of Multimedia Networks and Services: Management of Multimedia on the Internet
Minimizing the overhead in implementing flow-aware networking
Proceedings of the 2005 ACM symposium on Architecture for networking and communications systems
On the Benefit of Caching Traffic Flow Data in the Link Buffer
SAMOS '08 Proceedings of the 8th international workshop on Embedded Computer Systems: Architectures, Modeling, and Simulation
Subsidized RED: an active queue management mechanism for short-lived flows
Computer Communications
| Hi-index | 14.98 |
Provision of QoS-related router functions such as traffic regulation, policy routing, and usage-based accounting requires that a flow table store state information for active flows. The design of such a flow table is not trivial for a high-speed Internet router (e.g., 100+ Gbps) with a large number of active flows (e.g., tens of millions) and a high packet arrival rate (e.g., tens of millions of packets per second). Targeting two different models (centralized and distributed) of router design, we propose a software-based design to be implemented on individual line cards, which is suitable for the distributed model, and a hardware-based design to be implemented in the main forwarding engine of a router, which is suitable for the centralized model. The software-based design, adapted from the hash table data structure, employs a practical and effective technique to solve the garbage collection problem caused by the expired flows. The hardware-based design, adapted from the architecture of an N-way set-associative cache, employs a novel dynamic set-associative scheme to reduce the overflow ratio that a traditional set-associative scheme incurs, by a high percentage, and a pipelined design to achieve a throughput of 100+ Gbps. The performance evaluation results from both trace-driven simulation and statistical analysis demonstrate that both designs are cost-effective for their targeted router models.