Knapsack problems: algorithms and computer implementations
Knapsack problems: algorithms and computer implementations
IEEE/ACM Transactions on Networking (TON)
ONE-IP: techniques for hosting a service on a cluster of machines
Selected papers from the sixth international conference on World Wide Web
Router plugins: a software architecture for next-generation routers
IEEE/ACM Transactions on Networking (TON)
ACM Transactions on Computer Systems (TOCS)
Deterministic Processor Scheduling
ACM Computing Surveys (CSUR)
VERA: an extensible router architecture
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue on programmable networks
The Multiple Subset Sum Problem
SIAM Journal on Optimization
A taxonomy of scheduling in general-purpose distributed computing systems
IEEE Transactions on Software Engineering
Discrete Applied Mathematics - Special issue: Algorithmic aspects of communication
A Single System Image Server Cluster using Duplicated MAC and IP Addresses
LCN '01 Proceedings of the 26th Annual IEEE Conference on Local Computer Networks
Distributed Packet Rewriting and its Application to Scalable Server Architectures
ICNP '98 Proceedings of the Sixth International Conference on Network Protocols
A clustering and traffic-redistribution scheme for high-performance IPsec VPNs
HiPC'05 Proceedings of the 12th international conference on High Performance Computing
Issues and trends in router design
IEEE Communications Magazine
Technologies and building blocks for fast packet forwarding
IEEE Communications Magazine
Hi-index | 0.24 |
Next-generation Internet gateways are expected to deal with higher volume of network traffic and also perform more sophisticated tasks besides packet forwarding. As the scale-up approach does not escape from the tradeoff between functionality and performance, architectural improvements such as clustering become necessary in the design of future Internet gateways. In this paper, we investigate different clustering architectures for high-performance, feature-rich Internet gateways and formally define the optimization problem behind these architectures as Multiple Gateway Traffic-Distribution Problem, both in a discrete and a continuous form. In addition to proposing various algorithms that solve the problem exactly and approximately, we also develop an on-line, self-adjusting scheme based on the solution algorithms. The numerical results of simulation suggest that the proposed approximate solution algorithms are effective and efficient, and the derived adaptive scheme is able to make the best decision on traffic distribution when dealing with the dynamic nature of network traffic in practice.