Results 161 to 170 of about 29,223 (187)
Some of the next articles are maybe not open access.
Implicit Multicast Routing Protocol
Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services - (icas-isns'05), 2005This 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.
T. Venketesan, W.-H.F. Leung
openaire +1 more source
Multicast Steganography Using Routing Protocols
2017The strengthening of security solutions for computer networks increases the interests in new methods for the transfer of hidden information. In this paper, we considered the use of routing protocols for transmission of steganographic messages. We evaluated such approach using proactive and reactive routing protocols by analyzing the amount of sent data,
Miralem Mehic +2 more
openaire +1 more source
Optimal multicast route packing
European Journal of Operational Research, 2009zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kang, J, Park, K, Park, S Park, Sungsoo
openaire +2 more sources
MILCOM 97 MILCOM 97 Proceedings, 2002
With the growing interests in distributed applications, efficient and scalable multicast is of great concern. Widely used multicast routing protocols, represented by the DVMRP, however become very inefficient when used over large scale internetworks.
null Changdong Liu +2 more
openaire +1 more source
With the growing interests in distributed applications, efficient and scalable multicast is of great concern. Widely used multicast routing protocols, represented by the DVMRP, however become very inefficient when used over large scale internetworks.
null Changdong Liu +2 more
openaire +1 more source
Multicast Routing by Multiple Tree Routes
2000A 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
Scalable Internet multicast routing
Proceedings of Fourth International Conference on Computer Communications and Networks - IC3N'95, 2002In 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.
M. Parsa, J.J. Garcia-Luna-Aceves
openaire +1 more source
ACM SIGCOMM Computer Communication Review, 1998
Bandwidth-sensitive multicast delivery controlled by routing criteria pertinent to the actual traffic flow is very costly in terms of router state and control overhead and it scales poorly towards larger, wide-area networks. PIM-SM (Protocol-independent Multicast - Sparse Mode) has been introduced as a simple, flexible and scalable concept for Internet-
openaire +1 more source
Bandwidth-sensitive multicast delivery controlled by routing criteria pertinent to the actual traffic flow is very costly in terms of router state and control overhead and it scales poorly towards larger, wide-area networks. PIM-SM (Protocol-independent Multicast - Sparse Mode) has been introduced as a simple, flexible and scalable concept for Internet-
openaire +1 more source
1998
The goal in shortest path tree (SPT) algorithm is to compute a tree rooted at the sender and spanning all the receivers such that the distance between the sender and each receiver along the tree is minimum. The two most well-known algorithms for computing shortest path trees are due to Bellman-Ford and Dijktra [BG92]. These techniques are equivalent to
openaire +1 more source
The goal in shortest path tree (SPT) algorithm is to compute a tree rooted at the sender and spanning all the receivers such that the distance between the sender and each receiver along the tree is minimum. The two most well-known algorithms for computing shortest path trees are due to Bellman-Ford and Dijktra [BG92]. These techniques are equivalent to
openaire +1 more source
Metaheuristics for Multicast Routing
2011Approximation algorithms or simple heuristics are the normal way to go when we need fast results for a combinatorial optimization problem. However, when higher accuracy is needed and there is sufficient time to run a more detailed search algorithm, metaheuristics allow us to consistently find better solutions Martins and Ribeiro [2006].
Carlos A. S. Oliveira, Panos M. Pardalos
openaire +1 more source
Hop by hop multicast routing protocol
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications, 2001IP Multicast is facing a slow take-off although it is a hotly debated topic since more than a decade. Many reasons are responsible for this status. Hence, the Internet is likely to be organized with both unicast and multicast enabled networks. Thus, it is of utmost importance to design protocols that allow the progressive deployment of the multicast ...
Maciel Kosmalski Costa, Luís Henrique +2 more
openaire +1 more source