Results 141 to 150 of about 1,390 (180)

QoS negotiation for multicast communications

1994
This paper deals with the Quality of Service (QoS) negotiation for multicast connections. First, we show that in the multicast case, the QoS parameters may be separated into two classes, namely the parameters whose scope is the whole multicast connection and those whose scope is limited to each receiver separately.
Mathy, Laurent, Bonaventure, Olivier
openaire   +1 more source

Multicast Communications with Varying Bandwidth Constraints

IEEE INFOCOM 2021 - IEEE Conference on Computer Communications, 2021
To find a maximum number of communication requests that can be satisfied concurrently, is a fundamental network scheduling problem. In this work we investigate the problem of finding a maximum number of multicast requests that can be scheduled simultaneously in a tree network in which the edges and links have heterogeneous bandwidth limitations.This ...
Yuval Emek, Shay Kutten, Mordechai Shalom, Shmuel Zaks   +3 more
openaire   +1 more source

Leaker Identification in Multicast Communication

2012
Multicast is a communication mode in which data is exchanged among multiple end systems. An important concern in multicast communications is the protection of copyrights. While preventing copyright violations seems very difficult, tracing copyright violators (leaker identification) is more feasible and can be used as a deterrence alternative.
Emad Eldin Mohamed, Driss Guerchi
openaire   +1 more source

Dimensioning multicast‐enabled communications networks

Networks, 2002
AbstractThis paper concerns the network design problem of dimensioning capacity, available in discrete, nonuniform levels, for multicast traffic in a backbone communications network. An integer programming model, which includes embedded models for the Steiner tree problem in graphs, is proposed.
Mikael Prytz, Anders Forsgren
openaire   +2 more sources

Gossiping in the multicasting communication environment

Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001, 2002
The gossiping problem consists of an n processor communication network N, in which every processor has to broadcast a single message. We present an efficient algorithm to generate a communication schedule with total communication time at most n+r, where r is the radius of the network, when message multicasting is allowed.
openaire   +1 more source

Hierarchies of keys in secure multicast communications

Journal of Computer Security, 2010
This work considers key management for secure multicast in the Logical Key Hierarchy (LKH) model and proposes a methodology to establish the minimal key bit length that guarantees a specified degree of confidentiality for the multicast communications managed within this model.
Roberto Di Pietro, Luigi V. Mancini, Alessandro Mei   +2 more
openaire   +3 more sources

On multicasting in a communication network

Proceedings of Fourth International Conference on Computer Communications and Networks - IC3N'95, 2002
An important problem in communication networks is to be able to efficiently multicast information to a group of network sites. Multicasting reduces the transmission overhead of the network and the time it takes for all the nodes in the subset to receive the information.
K. Makki, N. Pissinou, O. Frieder
openaire   +1 more source

Multicast Session Management and QoS Management for Multicast Group Communications

2008 International Conference on Information Networking, 2008
Conventional multicast group communications need a dynamic mechanism for group management according to the join/leave of receivers and for the modification of membership information and a QoS management for a reliable multicast group communication.
Jung-Jin Park, Su-Jin Lee, Hyun-Kook Kahng   +2 more
openaire   +1 more source

Optimal State Allocation for Multicast Communications With Explicit Multicast Forwarding

IEEE Transactions on Parallel and Distributed Systems, 2008
In this paper, we propose a scalable and adaptive multicast forwarding mechanism based on explicit multicast (Xcast). This mechanism optimizes the allocation of forwarding states in routers and can be used to improve the scalability of traditional IP multicast and source-specific multicast. Compared with previous work, our mechanism needs fewer routers
De-Nian Yang, Wanjiun Liao
openaire   +1 more source

Wireless Network Virtualization with Multicast Communications

2018 IEEE International Conference on Communications (ICC), 2018
As a flexible network sharing mechanism, wireless network virtualization (WNV) can significantly improve the resource utilization and reduce the overall expense for the next generation wireless networks. Considering the users' common interests on popular contents, we introduce wireless multicast into wireless virtual networks.
Bingtao He, Jian Chen 0002, Yonghong Kuo, Long Yang 0002, Lu Lv   +4 more
openaire   +1 more source