Real-time causal message ordering in multimedia systems

Adelstein, Frank; Singhal, Mukesh

doi:10.1109/icdcs.1995.500000

Cited by 45 publications

(17 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…8, when M 1 is delivered to P 4 , P 4 knows that future messages sent to P 2 should be delivered only after M has been delivered to P 2 , i.e., CB 4 [2] = f(1; 1)g. M 2 , sent by P 2 to P 3 after the delivery of M 1 to P 2 , carries information about M 1 's delivery in its causal barrier vector. Specifically, CB M2 [2] = f(1; 1)g is received with the message M 2 at P 3 .…”

Section: Suboptimality Situationsmentioning

confidence: 99%

See 1 more Smart Citation

An Adaptive Causal Ordering Algorithm Suited to Mobile Computing Environments

Prakash

Raynal

Singhal

1997

Journal of Parallel and Distributed Computing

View full text Add to dashboard Cite

Section: Suboptimality Situationsmentioning

confidence: 99%

“…A less severe form of ordering of message transmission and reception, called causal ordering, is sufficient for a variety of applications like management of replicated data, observation of a distributed system, resource allocation, multimedia systems, and teleconferencing [2,4,15].…”

Section: Introductionmentioning

confidence: 99%

An Adaptive Causal Ordering Algorithm Suited to Mobile Computing Environments

Prakash

Raynal

Singhal

1997

Journal of Parallel and Distributed Computing

View full text Add to dashboard Cite

“…Since most real-time applications can tolerate some data loss but cannot tolerate the delay associated with retransmissions, they either accept some loss of data or use forward error correction for minimizing such loss. Multicasting of multimedia information has been recently receiving a great deal of attention [YM93][SM94] [AS95]. However, the main objective of these multicast protocols is to guarantee quality of service by reducing end-to-end delay at the cost of reliability.…”

Section: Introductionmentioning

confidence: 99%

Reliable Multicast Transport Protocol (RMTP)

Paul¹

1998

Multicasting on the Internet and Its Applications

View full text Add to dashboard Cite

This paper presents the design, implementation and performance of a reliable multicast transport protocol called RMTP. RMTP is based on a hierarchical structure in which receivers are grouped into local regions or domains and in each domain there is a special receiver called a Designated Receiver (DR) which is responsible for sending acknowledgments periodically to the sender, for processing acknowledgements from receivers in its domain and for retransmitting lost packets to the corresponding receivers. Since lost packets are recovered by local retransmissions as opposed to retransmissions from the original sender, end-to-end latency is significantly reduced, and the overall throughput is improved as well. Also, since only the DRs send their acknowledgments to the sender, instead of all receivers sending their acknowledgments to the sender, a single acknowledgement is generated per local region, and this prevents acknowledgement implosion. Receivers in RMTP send their acknowledgments to the DRs periodically, thereby simplifying error recovery. In addition, lost packets are recovered by selective repeat retransmissions, leading to improved throughput at the cost of minimal additional buffering at the receivers. This paper also describes the implementation of RMTP and its performance on the Internet.

show abstract

“…Since most real-time applications can tolerate some data loss but cannot tolerate the delay associated with retransmissions, they either accept some loss of data or use forward error correction for minimizing such loss. Multicasting of multimedia information has been recently receiving a great deal of attention [4].However, the main objective of these multicast protocols is to guarantee quality of service by reducing end-to-end delay at the cost of reliability. In contrast, the objective of our protocol in this paper is to guarantee reliability achieving high throughput, maintaining low end-to-end delay.…”

mentioning

confidence: 99%

Reliable Multicast Transport Protocol: RMTP

Jawandhiya¹,

Husain²,

M.R.Parate³

et al. 2010

IJACSA

View full text Add to dashboard Cite

Abstract-This paper presents the design, implementation, and performance of a reliable multicast transport protocol (RMTP). RMTP is based on a hierarchical structure in which receivers are grouped into local regions or domains and in each domain there is a special receiver called a designated receiver (DR) which is responsible for sending acknowledgments periodically to the sender, for processing acknowledgment from receivers in its domain, and for retransmitting lost packets to the corresponding receivers. Since lost packets are recovered by local retransmissions as opposed to retransmissions from the original sender, end-to-end latency is significantly reduced, and the overall throughput is improved as well. Also, since only the DR's send their acknowledgments to the sender, instead of all receivers sending their acknowledgments to the sender, a single acknowledgment is generated per local region, and this prevents acknowledgment implosion. Receivers in RMTP send their acknowledgments to the DR's periodically, thereby simplifying error recovery. In addition, lost packets are recovered by selective repeat retransmissions, leading to improved throughput at the cost of minimal additional buffering at the receivers. This paper also describes the implementation of RMTP and its performance on the Internet.

show abstract

Real-time causal message ordering in multimedia systems

Cited by 45 publications

References 8 publications

An Adaptive Causal Ordering Algorithm Suited to Mobile Computing Environments

An Adaptive Causal Ordering Algorithm Suited to Mobile Computing Environments

Reliable Multicast Transport Protocol (RMTP)

Reliable Multicast Transport Protocol: RMTP

Contact Info

Product

Resources

About