We address two different mechanisms used to make reliable an unreliable multicast over IP. The first mechanism uses an ARQ technique in each router of the multicast network. The second mechanism uses a peer-to-peer network where the peers are the destination nodes of the multicast tree to make reliable the unreliable multicast. We report an analytical model for the packet loss probability in a generic multicast network. We present an analytical model for the ARQ reliable multicast and an analytical model for the unreliable multicast with a peer- to-peer reliability network. Eventually we compare the two mechanisms through a simulator with respect to the average access time
Today's large-scale distributed systems consist of a collection of nodes that have highly variable a...
Abstract — The capacity gain of network coding has been extensively studied in wired and wireless ne...
Group collaboration and media distribution ap- plications have attracted more interest during recent...
Traditionally, reliable multicast protocols are deterministic in nature. It is precisely this determ...
AbstractAs computer systems have been widely used, Internet, which is a network-of-network, has been...
Increases in Internet bandwidth have spurred interest in using it to coordinate geographically distr...
Traditionally, reliable multicast protocols are deterministic in nature. It is precisely this determ...
Reliability is an important requirement in network communication. Many distributed applications rely...
Characteristics of ad hoc networks and even their existence depend on the nodes forming them. Thus, ...
Multicast is positioned to save bandwidth by reducing redundant data and getting the same informatio...
Characteristics of ad hoc networks and even their existence depend on the nodes forming them. Thus, ...
When striving for reliability, multicast protocols are most commonly designed as deterministic solut...
There are many methods for making a multicast protocol "reliable". At one end of t...
Abstract—Reliability of tree-like multicast overlays caused by nodes ’ abrupt failures is considered...
Many multicast applications require reliable delivery of data packets to multiple receivers. Scalabi...
Today's large-scale distributed systems consist of a collection of nodes that have highly variable a...
Abstract — The capacity gain of network coding has been extensively studied in wired and wireless ne...
Group collaboration and media distribution ap- plications have attracted more interest during recent...
Traditionally, reliable multicast protocols are deterministic in nature. It is precisely this determ...
AbstractAs computer systems have been widely used, Internet, which is a network-of-network, has been...
Increases in Internet bandwidth have spurred interest in using it to coordinate geographically distr...
Traditionally, reliable multicast protocols are deterministic in nature. It is precisely this determ...
Reliability is an important requirement in network communication. Many distributed applications rely...
Characteristics of ad hoc networks and even their existence depend on the nodes forming them. Thus, ...
Multicast is positioned to save bandwidth by reducing redundant data and getting the same informatio...
Characteristics of ad hoc networks and even their existence depend on the nodes forming them. Thus, ...
When striving for reliability, multicast protocols are most commonly designed as deterministic solut...
There are many methods for making a multicast protocol "reliable". At one end of t...
Abstract—Reliability of tree-like multicast overlays caused by nodes ’ abrupt failures is considered...
Many multicast applications require reliable delivery of data packets to multiple receivers. Scalabi...
Today's large-scale distributed systems consist of a collection of nodes that have highly variable a...
Abstract — The capacity gain of network coding has been extensively studied in wired and wireless ne...
Group collaboration and media distribution ap- plications have attracted more interest during recent...