Algorithms for clustering data
Algorithms for clustering data
SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
An architecture for wide-area multicast routing
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Iolus: a framework for scalable secure multicasting
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
KHIP—a scalable protocol for secure multicast routing
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Secure group communications using key graphs
IEEE/ACM Transactions on Networking (TON)
Data Structures, Algorithms, and Applications in C++
Data Structures, Algorithms, and Applications in C++
Scalable application layer multicast
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Distributed Clustering for Ad Hoc Networks
ISPAN '99 Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks
Tree-based group key agreement
ACM Transactions on Information and System Security (TISSEC)
Connectivity restrictions in overlay multicast
NOSSDAV '04 Proceedings of the 14th international workshop on Network and operating systems support for digital audio and video
Vivaldi: a decentralized network coordinate system
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Constructing internet coordinate system based on delay measurement
IEEE/ACM Transactions on Networking (TON)
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
IEEE Transactions on Dependable and Secure Computing
Distributed collaborative key agreement and authentication protocols for dynamic peer groups
IEEE/ACM Transactions on Networking (TON)
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
Lateral error recovery for media streaming in application-level multicast
IEEE Transactions on Multimedia
Adaptive clustering for mobile wireless networks
IEEE Journal on Selected Areas in Communications
A case for end system multicast
IEEE Journal on Selected Areas in Communications
Application-layer multicasting with Delaunay triangulation overlays
IEEE Journal on Selected Areas in Communications
Distributed servers approach for large-scale secure multicast
IEEE Journal on Selected Areas in Communications
Multicast with network coding in application-layer overlay networks
IEEE Journal on Selected Areas in Communications
Key management approaches to offer data confidentiality for secure multicast
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.00 |
Application layer multicast (ALM) has been proposed to overcome current limitations in IP multicast for large-group multimedia communication. We address offering data confidentiality tailored for ALM. To achieve confidentiality, a node may need to continuously re-encrypt packets before forwarding them downstream. Furthermore, keys have to be changed whenever there is a membership change, leading to rekey processing overhead at the nodes. For a large and dynamic group, these reencryption and rekeying operations incur high processing overhead at the nodes. We propose and analyze a scalable scheme called Secure Overlay Multicast (SOM) which clusters ALM peers so as to localize rekeying within a cluster and to limit re-encryption at cluster boundaries, thereby minimizing the total nodal processing overhead. We describe the operations of SOM and compare its nodal processing overhead with two other basic approaches, namely, host-to-host encryption and whole group encryption. We also present a simplified analytic model for SOM and show that there exists an optimal cluster size to minimize the total nodal processing overhead. By comparing with a recently proposed ALM scheme (DT protocol), SOM achieves a substantial reduction in nodal processing overhead with similar network performance in terms of network stress and delay.