4 citations found. Retrieving documents...
I. Cidon and M. Sidi, "Conflict multiplicity estimation and batch resolution algorithms," IEEE Transactions on Information Theory 34(1), pp. 101-110 (Jan. 1988).

 Home/Search   Document Details and Download   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Scalable Feedback for Large Groups - Nonnenmacher, Biersack (1999)   (25 citations)  (Correct)

....20, 21] Are an inherent solution to the feedback implosion problem and ensure a limited number of FBMs by accumulation filtering in subgroups. ffl Approaches based on MAC protocols [22, 23, 3, 4] The feedback problem in multicast communication is related to the problem of Medium Access Control [24]: The multicast channel constitutes the shared medium and messages sent on the multicast channel are seen by every connected group member. A token mechanism as in token ring is proposed in [22] and random timers with exponential back off as in CSMA CD [25] are used in XTP [23] or the SRM protocol ....

Israel Cidon and Moshe Sidon, "Conflict multiplicity estimation and batch resolution algorithms," IEEE Transactions on Information Theory, vol. 34, no. 1, pp. 101--110, January 1988.


Conflict Resolution Algorithms and their Performance Analysis - Molle, Polyzos (1993)   (4 citations)  (Correct)

....with some (additive) channels. The idea of energy level detectors was applied to the nothing something feedback model by Mehravari [Mehra88] who developed an interval mixing CRA for the case of nothing something something else feedback. Greenberg et al. Green87] and Cidon and Sidi [Cidon88] present and analyze algorithms that allow stations to compute cooperatively a stochastic estimate of the conflict multiplicity as a function of the (ternary) feedback history. Combining this estimation procedure with a CRA leads to hybrid protocols, the most efficient of which resolve conflicts ....

I. Cidon and M. Sidi, "Conflict multiplicity estimation and batch resolution algorithms," IEEE Transactions on Information Theory 34(1), pp. 101-110 (Jan. 1988).


Multiple Access Schemes - Sidi (2003)   Self-citation (Sidi)   (Correct)

....errors. Collision resolution protocols that operate in presence of noise errors, erasures and captures have been studied in [9] 10] 12] 42] 54] Collision resolution protocols yielding high throughputs for general arrival processes (even if their statistics are unknown) were developed in [11], 21] The expected packet delay of the binary tree protocol has been derived in [15] 51] Bounds on the expected packet delay of the algorithm with the epoch mechanism have been obtained in [20] 52] ....

I. Cidon and M. Sidi, Conflict Multiplicity Estimation and Batch Resolution Algorithms, IEEE Trans. on Inf. Theory, 34 (1), 101-110, January 1988.


Conflict Resolution Algorithms and their Performance Analysis - Molle, Polyzos (1993)   (4 citations)  (Correct)

No context found.

I. Cidon and M. Sidi, "Conflict multiplicity estimation and batch resolution algorithms," IEEE Transactions on Information Theory 34(1), pp. 101-110 (Jan. 1988).

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC