IEEE/ACM Transactions on Networking (TON)
Lightweight network support for scalable end-to-end services
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
On the Optimal Placement of Web Proxies in the Internet: The Linear Topology
HPN '98 Proceedings of the IFIP TC-6 Eigth International Conference on High Performance Networking
Hierarchical placement and network design problems
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Light-weight multicast services (LMS): a router-assisted scheme for reliable multicast
IEEE/ACM Transactions on Networking (TON)
Hierarchical Reliable Multicast: Performance Analysis and Optimal Placement of Proxies
Computer Communications
An O(pn2) algorithm for the p -median and related problems on tree graphs
Operations Research Letters
Reliable multicast transport protocol (RMTP)
IEEE Journal on Selected Areas in Communications
Proxy location for minimizing delivery delay in HRM networks
Computer Communications
Efficient placement of proxies for hierarchical reliable multicast
Computer Communications
Reducing delivery delay in HRM tree
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part II
| Hi-index | 0.00 |
In reliable multicast, receivers use negative acknowledgments (NAKs) to inform the sender about their packet loss. The growth in the number of NAK messages received by the sender results in the well-known feedback (or NAK) implosion problem. Therefore, one important issue for reliable multicast protocols is to utilize an effective mechanism to collect NAK messages from the receivers. One way to avoid feedback implosion at the sender site is to place NAK-suppression agents on the internal nodes (routers) of the network. These agents will forward a single copy of the incoming NAK messages toward the sender site and will suppress additional redundant copies coming from the receivers.In this paper, we consider an agent placement (activation) problem for reliable multicast. First, we assume a network environment where a number of internal nodes (routers) have NAK-suppression capabilities. Then, we try to select a subset of these nodes for NAK suppression task for a given reliable multicast application. Our main selection criteria is to choose a minimum number of such nodes for the task and have a notion of load-balancing among them. In this context, we study two agent activation problems: the Load-Balanced Agent Activation Problem (LBAAP) and the Budgeted Agent Activation Problem (BAAP) and present efficient algorithms for optimal activation of agents. The problems that we consider in this paper are generalized versions of the respective problems introduced by Daescu et al. [3].