Load-balanced agent activation for value-added network services

Authors:
Chao Gong;Kamil Sarac;Ovidiu Daescu;Balaji Raghavachari;Raja Jothi
Affiliations:
Department of Computer Science, University of Texas at Dallas, Richardson, TX 75083, USA;Department of Computer Science, University of Texas at Dallas, Richardson, TX 75083, USA;Department of Computer Science, University of Texas at Dallas, Richardson, TX 75083, USA;Department of Computer Science, University of Texas at Dallas, Richardson, TX 75083, USA;Department of Computer Science, University of Texas at Dallas, Richardson, TX 75083, USA
Venue:
Computer Communications
Year:
2006

Citing 16
Cited 0

The algorithm design manual

The algorithm design manual
Incremental deployment of a router-assisted reliable multicast scheme

COMM '00 Proceedings of NGC 2000 on Networked group communication
The cache location problem

IEEE/ACM Transactions on Networking (TON)
Approximation algorithms for metric facility location and k-Median problems using the primal-dual schema and Lagrangian relaxation

Journal of the ACM (JACM)
Network support for IP traceback

IEEE/ACM Transactions on Networking (TON)
On the use and performance of content distribution networks

IMW '01 Proceedings of the 1st ACM SIGCOMM Workshop on Internet Measurement
Controlling high bandwidth aggregates in the network

ACM SIGCOMM Computer Communication Review
Single-packet IP traceback

IEEE/ACM Transactions on Networking (TON)
Denial-of-Service Attacks Rip the Internet

Computer
On the topology of multicast trees

IEEE/ACM Transactions on Networking (TON)
Hierarchical placement and network design problems

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Tracetree: a scalable mechanism to discover multicast tree topologies in the internet

IEEE/ACM Transactions on Networking (TON)
Hierarchical Reliable Multicast: Performance Analysis and Optimal Placement of Proxies

Computer Communications
Modeling Internet topology

IEEE Communications Magazine
The evolution of multicast: from the MBone to interdomain multicast to Internet2 deployment

IEEE Network: The Magazine of Global Internetworking
The PGM reliable multicast protocol

IEEE Network: The Magazine of Global Internetworking

Quantified Score

Hi-index	0.24

Visualization

Abstract

In relation to its growth in size and user population, the Internet faces new challenges that have triggered the proposals of value-added network services, e.g., IP multicast, IP traceback, DiffServ, IntServ, etc. In addition, recent advances in processor and hardware techniques have enabled the production of high speed and powerful routers. Therefore, it is not unreasonable to expect the Internet to provide a variety of value-added network services other than packet forwarding in the near future. Depending on their purposes, value-added services may improve the scalability and efficiency of end user applications or may enhance the reliability and security of the network infrastructure. On the other hand, they may incur non-trivial overhead on the routers providing these services. It is a thorny problem to reach a balance between the performance of value-added services and the incurred overhead. In this paper, we study this problem in the context of both reliable multicast and distributed denial-of-service (DDoS) defense. In either scenario, a software agent is activated at some routers in a tree topology to provide the required functionality. We formulate the problem as load-balanced agent activation problem (LBAAP). Our goal is to develop a mechanism to activate value-added service agents in the network for the purpose of reaching a balance between the performance and overhead. We develop a polynomial time algorithm to solve the LBAAP problem in single tree case, and propose a heuristic for the LBAAP problem in the case where multiple trees exist in the network, a problem we conjecture is NP-hard. Finally we evaluate the performances of various approaches for activating value-added service agents through simulation.