Conference Paper

Performance Analysis of End System Multicast,

September 2008

Conference: 1st IEEE International Workshop on Future Multimedia Networking (IEEE FNM 2008),
At: Cardiff, Wales

Authors:

Syed S Rizvi

Pennsylvania State University

Khaled Elleithy

University of Bridgeport

ResearchGate has not been able to resolve any citations for this publication.

ResearchGate has not been able to resolve any references for this publication.

Conference Paper

Self-healing group key distribution with extended revocation capability

January 2013

Self-healing group key distribution schemes (SH-GKDS) allow large and dynamic groups of users to establish group keys over an unreliable broadcast channel for secure multicast communications. In most existing schemes, total number of users that can be revoked during system lifetime is bounded by the degree of applied polynomials. In this paper we present a new revocation mechanism which overcomes ... [Show full abstract] this limitation. It allows to revoke a predefined number of users in each session, regardless of the number of users already revoked in the past sessions. To illustrate our approach, we propose SH-GKDS scheme with extended revocation capability which applies our revocation mechanism. Then, we conduct security and performance analyses of the scheme to show, that the proposed construction is efficient, achieves forward and backward secrecy, and resists collusion between the newly joined users and the revoked users.

Conference Paper

Performance analysis of superposition coding for mixed unicast and broadcast transmission using oppo...

January 2011

A scheme transmitting superposition coding (SC), which superimposes unicast data to multicast data, using opportunistic multicast scheduling (OMS) scheme, is proposed and its performance is evaluated and simulated in this paper. Although the scheme is a little weaker than traditional scheme using QPSK modulation method in bit error rate (BER) performance, its throughput and system time delay ... [Show full abstract] promote considerably. Numerical results show that when user channel condition is weak and signal to noise ratio (SNR) is not high, the new scheme can outperform the conventional scheme in terms of system performances.

Article

FCM-based clustering performance analysis in network topology

October 2008

This paper compared the clustering performance of the proposed FCM-based clustering scheme with HCM to the hierarchical topology optimization in overlay multicast. The paper firstly depicts the proposed scheme including 1) defining the clustering feature distance based on overlay path latency, 2) calculating the Euclidean distance within each pair of overlay nodes to construct the fuzzy ... [Show full abstract] membership matrix, and 3) dynamically adapting the fuzzy clustering threshold. Then it designed the experiments to analyze the clustering performance with HCM. The experiments illustrated that the FCM-based clustering scheme achieves better clustering performance for the topology optimization.

Article

Full-text available

Performance Evaluation of Network Coding in Wireless Ad Hoc Networks

May 2015

Broadcast and multicast operations which disseminate information network wide are important features in multi-hop wireless networks. This work shows how network coding can be applied in wireless in ad hoc networks. We focus on broadcast traffic and design a network coding-based scheme that we compare against simpler solutions, through extensive simulations. Our goal is to assess the performance ... [Show full abstract] of the proposed network coding scheme in wireless ad hoc networks in both realistic MAC and physical are considered and when mobility of nodes is considered as well. The performance analysis of the proposed network coding scheme on broadcasting traffic is strongly depends on the network node density and the generation size. Network coding brings no benefits to be implemented and run in sparse networks. On the other hand, network coding performs well and has significant gains in terms of end-to-end packet loss probability in dense networks. Moreover, achieved results show that the protocol delivers broadcast data reliably with minimal network overhead, by eliminating redundant data transmissions, even under adverse network conditions.

View full-text

Article

Nonlinear algorithm for video segmentation on interactive Video-On-Demand system

November 2003

To realize interactive performance of a Video-On-Demand system, a traditional method to segment a video with equal fragments for storage is adopted to implement limit interactive performance of a VODs. According to the reality of VODs, A nonlinear segmentation method (NLSM) is adopted. The key of NLSM is to realize nonlinear segmentation of a video in time axis. After computing the total area of ... [Show full abstract] time and frequency, NLSM will equally segment the product of interval and frequency of VCR-Requests arrival according to statistic sum of VCR operation in certain step width in a period of time. Comparing with periodical broadcasting by equal segmentation method (ESM) in simulations, we obtained good outcomes in the mean latency of VCR requests and the best performance of standard deviation of user latency, system defection probability and throughput of a channel. It is found that NLSM can make a data mining in historical information and reveal potential distribution law of users interest in video content. This scheme has good adaptive ability and learning intelligence. By the performance analysis and empirical results, it could be verified that the scheme is feasible and efficient.

Article

Coordinated Multicast Based on a MIMO Relay Station in a Single Frequency Network

January 2015 · IEEE Transactions on Vehicular Technology

In this paper, we present a coordinated multicast scheme via a relay station (RS) over a single frequency network (SFN). According to the type of feedback information delivered from the RS to the adjacent base stations (BSs) involved in the coordinated multicast, the schemes are classified into the phase coordination multicast based on the RS (PCMR) and the vector coordination multicast based on ... [Show full abstract] the RS (VCMR). For the performance analysis, we derive the mathematical upper bound of an achievable rate from the BSs to the RS for the coordinated multicast based on RS. Through this analysis, we demonstrate that the PCMR and the VCMR achieve more gains over the noncoordinated multicast in terms of the number of RS antennas, the number of adjacent BSs, and the number of BS antennas. Through simulation, we derive a range of distances between the home BS and the RS, the number of users, and the number of user antennas, providing evidence that the RS-based multicast outperforms the conventional multicast.

Article

Performance Analysis of Quality-Based Channel State Feedback Scheme for Wireless Multicast Systems W...

August 2015 · IEEE Communications Letters

Multi-group multicasting has recently attracted substantial attention. In this letter, we propose quality-based channel state information feedback (QCF) in multicast systems with greedy scheduling of multiple multicast groups, and present exact expressions for outage probability and average capacity of the multicast systems using QCF over independent Rayleigh fading channels. Further, we provide ... [Show full abstract] a method to determine the appropriate QCF threshold, and describe the relative feedback load of QCF with respect to full channel state information feedback. Our QCF scheme can significantly reduce the feedback load, simultaneously accomplishing negligible system performance loss.

Conference Paper

Full-text available

Performance analysis of multicast routing algorithms

February 2014

This paper provides a theoretical performance analysis of different classes of multicast routing algorithms, namely the Shortest Path Tree, the Steiner Tree, compact routing and greedy routing. Our motivation is to determine the routing scheme which would yield the best trade-off between the stretch of the multicast routing paths, the memory space required to store the routing information and ... [Show full abstract] routing table as well as the communication cost. For this purpose, we also confront these results to those obtained by simulation on the CAIDA map of the Internet topology comprising 32k nodes.

View full-text

Article

Countermeasures against Multicast attacks on Enhanced-On Demand Multicast Routing Protocol in MANETs

January 2012

Mobile Ad-hoc NETwork which shows promising applications have now gained significant importance in research as well as in practice, due to their autonomous and self-maintaining nature. Unlike other types of networks, MANETs are usually deployed without a centralized control unit. Hence, mutual cooperation amongst the participating entities forms the basis for determining the routes to the ... [Show full abstract] destination. This aspect along with the fact that MANET nodes are often constrained in power, storage and computational resources, make MANETs vulnerable to various communications security related attacks. Therefore, the direct application of the conventional routing algorithms is infeasible here. Numerous attempts can be found in the literature that concentrates on improving the security of the routing protocols for MANETs. However, according to our analysis, none of the routing protocols are complete by itself. Therefore, in this paper we focus on improving the Secure Enhanced-On Demand Multicast Routing Protocol (EODMRP) to safeguard it against flooding and blackhole attacks. The proposed solutions are implemented and tested using GloMoSim (2.03). The performance analysis carried out shows improvement in packet delivery ratio in presence of blackhole attack, with marginal rise in average end-to-end delay and normalized routing overhead. The proposed mechanism for flooding attack works even when the identity of the malicious nodes is unknown and does not use any additional network bandwidth. It is simple to implement and maintains or improves network throughput when there are no malicious nodes but the network is congested with excess traffic.

Conference Paper

A Compressed HARQ Feedback for Device-to-Device Multicast Communications

September 2012 · Vehicular Technology Conference, 1988, IEEE 38th

An efficient receiving status feedback in multicast communications can improve the system performance considerably. In this paper, we propose a novel compressed hybrid automatic repeat request (HARQ) mechanism for the reliable multicast services in the cellular network controlled Device-to-Device (D2D) communications. Closely located D2D cluster devices transmit the acknowledgement and negative ... [Show full abstract] acknowledgement (ACK/NACK) message to a cluster head through D2D links directly, after that the cluster head feeds back the whole D2D cluster receiving status using 2-bit ACK/NACK to the cellular network. Performance analysis and numerical simulation results reveal that the proposed HARQ feedback mechanism is better than the conventional D2D multicast mechanisms in terms of the error probability and signaling overhead.

Article

Real-time multicast with scalable reliability

October 1998 · Proceedings of SPIE - The International Society for Optical Engineering

This paper proposes and investigates a protocol or real-time multicast applications called MSR. Two essential features in MSR are its traffic shaping and scalable retransmission schemes. To minimize packet loss and delay in the network, MSR spaces out the transmission of bursty data at the source. Reliability is further enhanced with a scheme in which the receivers make use of NAC messages to ... [Show full abstract] request for retransmission of packets from the sender. To avoid the well-known NACK is issued among a group of receivers. Unlike previous multicast protocols which attempt to achieve 100 percent reliability by requiring a correct copy of a packet to reach all receivers before the retransmission process stops, a key feature in our scheme is that the level of reliability can be scaled in accordance with the maximum tolerable end-to-end delay, defined as the difference between the instant at which the real-time data must be presented to the user and the instant at which it is created at the sender. MSR attempts to make optimal use of measured parameters such as delay, round-trip delay, loss rate, etc. to scale the retransmission process and provide single NACK mechanism. We adopt the framework of the standard RTP and RTCP for the implementation of MSR. This paper present a proof to show that the time-out mechanism in MSR, which is required to effect retransmission request, would work even if the clocks of the sender and receivers are not synchronized, a situation not uncommon in the Internet. Many multimedia streaming protocols currently used on the Web either uses a 100 percent reliable protocol like TCP or unreliable protocol like UDP. The former sacrifices the 'real-timeness' and the latter sacrifices the quality of the presentation. Our rough performance analysis indicates that there is perhaps a better intermediate solution using a scalable protocol like MSR.

Article

Towards scalable key management for secure multicast communication

June 2012 · Information Technology and Control

Secure multicast communication allows a sender to deliver encrypted messages to a group of authorized receivers. A practical approach is that the sender uses a common key shared by the authorized receivers to encrypt the transmitted messages. The common key must be renewed to ensure forward/backward secrecy when group members leave/join the group, called the rekeying process. Thus, the rekeying ... [Show full abstract] problem is a critical issue for secure multicast communication. Many key management schemes have been proposed to improve the performance of the rekeying process. In 2010, Lin et al. proposed two key management schemes without the rekeying process. However, the transmission size required in their schemes increases linearly with the number of group members. In this article, we use the time-bound concept to propose two new key management schemes without the rekeying process. The point is that the required transmission size is constant. Performance analysis is given to demonstrate that our schemes have better performance as compared with the recently proposed key management schemes in terms of transmission size and computational cost. Under several security assumptions, we prove that the proposed schemes satisfy the requirements of secure multicast communication.

Performance Analysis of End System Multicast,

No full-text available

Recommended publications

Self-healing group key distribution with extended revocation capability

Performance analysis of superposition coding for mixed unicast and broadcast transmission using oppo...

FCM-based clustering performance analysis in network topology

Performance Evaluation of Network Coding in Wireless Ad Hoc Networks

Nonlinear algorithm for video segmentation on interactive Video-On-Demand system

Coordinated Multicast Based on a MIMO Relay Station in a Single Frequency Network

Performance Analysis of Quality-Based Channel State Feedback Scheme for Wireless Multicast Systems W...

Performance analysis of multicast routing algorithms

Countermeasures against Multicast attacks on Enhanced-On Demand Multicast Routing Protocol in MANETs

A Compressed HARQ Feedback for Device-to-Device Multicast Communications

Real-time multicast with scalable reliability

Towards scalable key management for secure multicast communication