Results 131 to 140 of about 891 (180)
Some of the next articles are maybe not open access.

On routes and multicast trees in the Internet

ACM SIGCOMM Computer Communication Review, 1998
Multicasting has an increasing importance for network applications such as groupware or videoconferencing. Several multicast routing protocols have been defined. However they cannot be used directly in the Internet since most inter-domain routers do no implement multicasting.
Jean-Jacques Pansiot, Dominique Grad
openaire   +1 more source

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   +2 more
openaire   +1 more source

Implicit Multicast Routing Protocol

Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services - (icas-isns'05), 2005
This paper describes the IMcast (implicit multicast) routing protocol, developed to address several problems that are responsible for the slow deployment of IP multicast. We focus on transparent integration with legacy routers and in improving the efficiency of the routing tree.
Thiruvengadam Venketesan   +1 more
openaire   +1 more source

Mobile Multicast Route Optimisation

2006 IEEE International Conference on Communications, 2006
The multiparty nature of multicast applications presents new challenges for Mobile IP users. Unfortunately, when a multicast receiver is mobile, it will experience additional delay in receiving multicast packets due to handover delay, join latency, and increased propagation delay to the new location. In this paper we propose a new solution to avoid the
Romdhani, Imed   +3 more
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   +2 more
openaire   +1 more source

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   +2 more
openaire   +1 more source

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   +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   +1 more source

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.   +1 more
openaire   +1 more source

Landscape analysis for multicast routing

Computer Communications, 2006
In recent years, methods based on local search have been utilized in off-line algorithms for multicast routing in communication networks. In multicast routing, several point-to-multipoint requests have to be scheduled under constraints associated with each link of the underlying network such as capacity and transmission costs.
Mohammed Saeed Zahrani   +3 more
openaire   +1 more source

Home - About - Disclaimer - Privacy