Sharif Digital Repository

In this paper, we consider multiple multicast sessions with intra-session network coding where rates over all links are integer multiples of a basic rate. Although having quantized rates over communication links is quite common, conventional minimum cost network coding problem cannot generally result in quantized solutions. In this research, the problem of finding minimum cost transmission for multiple multicast sessions with network coding is addressed. It is assumed that the rate of coded packet injection at every link of each session takes quantized values. First, this problem is formulated as a mixed integer linear programming problem, and then it is proved that this problem is strongly... 

As the infrastructure-centric model of peer-to-peer streaming, recent overlay construction schemes compose a hierarchical topology of peers by grouping them into clusters. There is a server in each cluster that receives data from the source and relays it to its cluster members. In this paper, we propose an alternative infrastructure-centric peer-to-peer framework called BAHMO that constructs a hierarchical multicast tree. BAHMO does not utilize server bandwidth and rely only on peer bandwidth for data transfers. It achieves both the stability of the infrastructure-centric model and the bandwidth efficiency of the fully-distributed model. Bandwidth assignment for inter-cluster data transfers... 

The ability to perform multicast communication efficiently in parallel computing systems is increasingly becoming an essential feature of these systems. Therefore, any emerging parallel architecture must be able to provide effective multicasting performance. OTIS-based multi-computer systems are parallel systems that efficiently exploit optical connections between distant nodes, while using electronic connections for physically close processors. No previous work has attempted to determine an optimal multicast communication scheme for OTIS networks. This paper presents two approaches to implement efficient multicast communication in wormhole-routed OTIS networks, for the two different... 

The increasing use of multi-party web conferencing applications demands for suitable multicast protocols. Limited bandwidth of typical internet user requires the underlying multicast routing to be efficient. In this paper we present HOMA; an application layer multicast protocol which has been tailored for small-scale multi-party videoconferencing applications. Considering the requirements of such applications, HOMA uses a heuristic routing to construct efficient multicast trees on the application layer. We have evaluated the performance of the proposed routing algorithm through simulations. Experimental results indicate that the proposed algorithm performs better than the related algorithms... 

This paper presents a comparative performance analysis in more realistic scenario and more performance metrics of ADMR and ODMRP, two on-demand multicast routing protocols for Mobile Ad hoc Networks (MANETs) and Wireless Sensor Networks (WSNs). There are a few comparison works done between two multicast Ad hoc routing protocols, ADMR and ODMRP; these works are not complete in terms of both performance metrics and realistic scenarios. Simulation results show an unusual low number of control packets transmitted per data packet delivered in ADMR, this low number of control packet transmitted per data packet in ADMR has caused some comparison works to judge to better performance of ADMR than... 

In this paper, we introduce an efficient route discovery mechanism to enhance the performance and multicast efficiency of On-Demand Multicast Routing Protocol (ODMRP). Our framework, called limited flooding ODMRP, improves multicasting mechanism by efficiently managing flooding mechanism based on delay characteristics of the contributing nodes. In our model, only the nodes that satisfy the delay requirements can flood the Join-Query messages. We model the contributing nodes as M/M/1 queuing systems. Our framework considers the significant parameters in delay analysis, including random packet arrival, service process, and random channel access in the relying nodes, and exhibits its best... 

Multicast service is considered as a useful transmission mode for future mobile social services to deliver the traffic to multiple mobile users simultaneously. Device-to-device (D2D) multicast communication enables multiple proximate users to share the contents of their common interests directly. This paper aims to present a relay selection scheme for multi-source network-coded D2D multicast communication underlying heterogeneous cellular network which consists of macrocells and femtocells. We propose two methods for selecting efficient relays from the set of femtocell base stations (FBSs). The first method, named destination-blind relay selection, identifies those idle FBSs that can... 

Overlay multicast has gained much attention in recent years as an alternative method to network layer multicast, especially for mobile ad hoc networks (MANETs). In this paper, we propose a new overlay multicast protocol to achieve simplicity of deployment, rapid adaptation of overlay structure when nodes move, and reduced delay. In our algorithm, to join or leave a multicast group, it is only sufficient for a member node to inform its first upstream member node. This updates the tree structure more rapidly when nodes move. In addition, join and leave delays are reduced and this makes the protocol suitable for multimedia multicasting in MANETs. Simulation results compared to that of ODMRP and... 

The authors consider the problem of finding a minimum cost multicast sub-graph based on network coding, where delay values associated with each link, limited buffer-size of the intermediate nodes and link capacity variations over time are taken into account. The authors consider static multicast (where membership of the multicast group remains constant for the duration of the connection) in lossless wireline networks. For such networks, first the continuous-time (asynchronous packet transmissions) model is formulated. Subsequently, the discrete-time model for the synchronous packet transmissions scenario is derived. Then, by using an auxiliary time-expanded network, a decentralised algorithm... 

Multimedia multicast with two servers based on the mul- titerminal source coding is studied in some previous researches. Due to the possibility of providing an approach for practical code design for more than two correlated sources in IMTSC/CEO setup, in this paper, the framework of Slepian-Wolf coded quantization is extended and a practical code design is presented for IMTSC/CEO with the number of encoders greater than two. Then the multicast system based on the IMTSC/CEO is applied to the cases with three, four and five servers. Since the underlying code design approach for the IMTSC/CEO problem has the capability of applying to an arbitrary number of active encoders, the proposed MMBMSC... 

One of the main parts of peer-to-peer multicast is the structure of overlay network. Most of the existing works utilize some common parameters for constructing overlay tree. These parameters are bandwidth and delay. The mismatch between current overlay structure and underlying network topology causes severe link stress and then leads to high end to end latency. According to these problems, we propose a new overlay construction algorithm called OLT in this paper that finds the location of peers and tries to connect peers that are as close as possible. OLT exploits a number of heuristic techniques to reach an optimized tree even in case of peer heterogeneity and high churn rate. Our... 

In this paper, dynamic resource allocation and multicast routing algorithms are proposed for elastic optical networks (EONs). The proposed algorithms find the shortest path trees by modeling either the amount of free spectrum in each link or the link length as the cost function of routing method. The proposed algorithms are simulated in the dynamic operation scenario over the so called US Backbone topology. Simulation results reveal that by considering the cost function of routing algorithm based on the available spectrum in each link will improve the blocking probability while reduce the spectrum efficiency. On the other hand, by considering link length as the cost function, the blocking... 

This paper presents a new group key management protocol, CKC (Code for Key Calculation) for secure IP multicast. In this protocol which is based on logical key hierarchy, only the group key needs to be sent to new member at join. Then, using the group key current members and the new member calculate the necessary keys by node codes and one-way hash function. A node code is a random number assigned to each node to help users calculate necessary keys. Again, at leave server just sends the new group key to the remaining members. By this key, members calculate necessary keys using node codes and one-way hash function. The security of the keys is based on one-wayness of hash function. The results... 

A wireless coded caching (CC) setup is considered, where a multi-antenna transmitter delivers contents to multiple cache-enabled users. Exploiting multicasting opportunities provided by the coded caching paradigm, novel interference management schemes are proposed by assigning carefully designed beamforming vectors to different multicast messages. Thereby, the proposed design benefits from spatial multiplexing gain, improved interference management and the global CC gain, simultaneously. In addition, a novel multicast mode selection scheme is proposed which determines the optimum multicast group sizes providing the best complexity-performance tradeoff for a given SNR range. While the... 

Exponential growth of traffic and bandwidth demands in current data center networks requires low-latency high-throughput interconnection networks, considering power consumption. By considering growth of both multicast and unicast applications, power efficient communication becomes one of the main design challenges in today's data center networks. Addressing these demands, optical networks suggest several benefits as well as circumventing most disadvantages of electrical networks. In this paper, we propose an all-optical scalable architecture, named as OMUX, for communicating intra-data centers. This architecture utilizes passive optical devices and enables optical circuit switching without... 

In this paper, we consider the problem of Minimum-Cost Multicast (MCM) sub-graph optimization with network coding subject to uncertainty in link costs. A number of uncertainty sets such as ellipsoids and bounded polyhedral are taken into account. A robust optimization model is developed to obtain the optimal sub-graph by replacing an uncertain model of MCM by its Robust Counterpart (RC). Then, the analytic and computational optimization tools to obtain robust solutions of an uncertain MCM problem via solving the corresponding explicitly-stated convex RC program is developed and validated through simulations  

A single cell downlink scenario is considered, where a multiple-antenna base station delivers contents to cache-enabled user terminals. Depending on the available degrees of freedom, several multicast messages are transmitted in parallel to distinct subsets of users. In the multicast beamformer design, we restrict ourselves to linear receiver implementation, which does not require successive interference cancellation unlike in the more optimal baseline scheme. With a small loss in performance, the complexity of both the receiver and transmitter implementation can be significantly reduced. © 2018 IEEE  

The advent of various real-time multimedia applications in high-speed networks creates a need for quality of service (QoS) based multicast routing. Two important QoS constraints are the bandwidth constraint and the end-to-end delay constraint. The QoS based multicast routing problem is a known NP-complete problem that depends on (1) bounded end-to-end delay and link bandwidth along the paths from the source to each destination, and (2) minimum cost of the multicast tree. In this paper, we presents novel centralized algorithms to solve the bandwidth-delay-constrained least-cost multicast routing problem based on the harmony search (HS) algorithm. Our first algorithm uses modified Prüfer...