Results 161 to 170 of about 245,202 (213)

Scalable Internet Multicast Routing

Proceedings of Fourth International Conference on Computer Communications and Networks - IC3N'95, 2002
In distributed network applications such as multiparty teleconferencing, users often need to send the same message to several other users. To achieve such one-to-many or many-to-many communication efficiently in wide-area internetworks, it is imperative to support multicasting, i.e., concurrent sending of messages from one source to multiple receivers.
Mehrdad Parsa, J. J. Garcia-Luna-Aceves
openaire   +2 more sources

Multicast Routing by Multiple Tree Routes

2000
A solution to reduce the cost of multicast paths is presented, where the traffic is split over multiple paths to obtain an overall lower cost. Optimal conditions for this split operation are provided and two different algorithms are presented. The methods were shown to work on problems with many different types of simultaneous multicast traffic ...
Koohyun Park, Yong-Sik Shin, Hyun-Chan Lee   +2 more
openaire   +1 more source

The global multicast routing protocol - a new architecture for hierarchical multicast routing

IEEE International Conference on Communications, 2003. ICC '03., 2004
This paper presents a new inter-domain multicast protocol, the global multicast routing protocol (GMRP), that has the potential to be highly scalable and efficient, and, at the same time is simple to implement. GMRP minimizes signaling traffic, optimizes bandwidth use and remains unaffected by the group dynamics.
Gaurav Agrawal, Jagan Agrawal
openaire   +1 more source

Multicast routing in self-routing multistage networks

Proceedings of INFOCOM '94 Conference on Computer Communications, 2002
The authors present a study on multicast routing algorithms for the self-routing multistage networks. This work is based on the use of the cube concept which consists of a group of outlets reachable in one pass through the network. A multicast connection is decomposed into associated cubes such that each cube can be self-routed through the network. The
CHEN XIAOQIANG, KUMAR VIJAY POCHAMPALLI
openaire   +2 more sources

A multitree approach for multicast routing

Proceedings of the 3rd international IFIP/ACM Latin American conference on Networking - LANC '05, 2005
This paper presents a new traffic engineering multitree-multiobjective multicast routing algorithm (M-MMA). Multitree traffic engineering uses several trees to transmit one multicast demand between a source and a set of destinations. The purpose of the M-MMA is to balance the traffic load and optimize the utilization of the network resources.
Joel Prieto, Benjamín Barán, Jorge Crichigno   +2 more
openaire   +2 more sources

Optimal multicast route packing

European Journal of Operational Research, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kang, J, Park, K, Park, S Park, Sungsoo
openaire   +2 more sources

On-demand multicast routing protocol

WCNC. 1999 IEEE Wireless Communications and Networking Conference (Cat. No.99TH8466), 2003
This paper presents a novel multicast routing protocol for mobile ad hoc wireless networks. The protocol, termed ODMRP (on-demand multicast routing protocol), is a mesh-based, rather than a conventional tree-based multicast scheme and uses a forwarding group concept (only a subset of nodes forwards the multicast packets via scoped flooding). It applies
Sung-Ju Lee, Mario Gerla, Ching-Chuan Chiang   +2 more
openaire   +1 more source

On properties of multicast routing trees

International Journal of Communication Systems, 2006
SUMMARY In the last several years we witnessed the proliferation of multimedia applications on the Internet. One of the unavoidable techniques to support this type of communication is multicasting. However, even a decade after its initial proposal, multicast is still not widely deployed. One of the reasons is the lack of a solid business model.
Milena Janic, Piet Van Mieghem
openaire   +2 more sources

Dynamic multicast routing in VLSI

Computer Communications, 2000
As real-time applications requiring dynamic group communication emerges, existing multicast routing algorithms must be improved to cater for high-speed routing decisions. Most of the reported efficient multicast routing algorithms for real-time applications construct a multicast tree using the Dijkstra's algorithm.
Siew Kei Lam, Thambipillai Srikanthan
openaire   +2 more sources

Optimum routing of multicast streams

Proceedings of INFOCOM '94 Conference on Computer Communications, 2002
The authors show that the problem of optimally routing multicast streams can be formulated as an integer programming problem. They propose an efficient solution technique, composed of two parts: (i) an extension to the decomposition principle, to speed up the linear relaxation of the problem, and (ii) enhanced value-fixing rules, to prune the search ...
Ciro Aloisio Noronha Jr., Fouad A. Tobagi   +1 more
openaire   +2 more sources