A Stack Protocol of CTM Type with Quartet Feedback

Chen Yong-yi; You Chuan-hua

Article Contents

Article Navigation > Applied Mathematics and Mechanics > 1988 > 9(9): 825-834

Chen Yong-yi, You Chuan-hua. A Stack Protocol of CTM Type with Quartet Feedback[J]. Applied Mathematics and Mechanics, 1988, 9(9): 825-834.

Citation:

Chen Yong-yi, You Chuan-hua. A Stack Protocol of CTM Type with Quartet Feedback[J]. Applied Mathematics and Mechanics, 1988, 9(9): 825-834.

Citation:

Chen Yong-yi, You Chuan-hua. A Stack Protocol of CTM Type with Quartet Feedback[J]. Applied Mathematics and Mechanics, 1988, 9(9): 825-834.

PDF( 616 KB)

A Stack Protocol of CTM Type with Quartet Feedback

Lanzhou University, Lanzhou

Received Date: 1987-09-15
Publish Date: 1988-09-15

Abstract

Abstract

In this paper, we analysed a stack protocol of the CTM(Capetanakis-Tsybakov-Mikhailov)type with quartet feedback. We obtained the explicit expression of the expectation of CRI(Collision Resolution Interval)duration for the delayed access case. By means of numerical calculation we gave respectively the maximal capacities of channel of 0.4140 and 0.41445 packets/slot for both the delayed case and immediate cases.

FullText(HTML)

References(13)

References

[1]	Abramson,N.,The ALOHA system-another alternative for computer communications,Proc.AFIPS Conf.Fall Joint Comp.Conf.,37(1970),281-285.
[2]	Capetanakis,J.I.,Tree Algorithms for packet Broadcast Channels,IEEE Trans.Inf.Th.,IT-25,5(1979),505-515.
[3]	Tsybakov,B.S.and V.A.Mikhailov,Free Synchronous Packet Access in a Broadcast Channel with FeedbaCk,Proc.of Inf.Trans.,14,Oct.-Dec.(1978),32-59.
[4]	Mehravari,N.and T.Berger,Poisson multiple-access contention with binary feedback,IEEE Trans.Inf.Th.,IT-30,5(1985),745-751.
[5]	Hofri,M.,Stack Algorithms for Collision-Detecting Channels and Their Analysis: A limited survey,Proceedings of the International Seminar,Paris,France edited by F.Baccelli and G.Fayolle,Springer-Verlag,January(1983).
[6]	Fayolle,G.and M.Hofri,On the capacity ora collision resolution channel under stack-based collision resolution algorithms,Technion,Haifa,Israel,Rep.237,Oct.(1983).
[7]	Fayolle,G.,P.Flajolet,M.Hofri,and P.Jacquet,Analysis of a stack algorithm for random multiple-access communication,IEEE Trans.Inf.Th.,IT-31,2,March(1985),244-254.
[8]	Mathys,P.and P.Elajolet,Q-ary collision resolution algorithms in random-access system with free or blocked channel access,IEEE Trans.Inf.Th.,IT-31,2,March(1985),217-243.
[9]	Fayolle,G.,P.Flajolet,and M.Hofri,On a functional equation arising in the analysis of a protocol for a multi-access broadcast channel,Internal Rep.131,INRIA,France,Apr.(1982).
[10]	Massey,J.L.and P.Mathys,The collision channel without feedback,IEEE Trans.Inf.Th.,IT-31,2,March(1985),192-204.
[11]	Tsybakov,B.S.,Resolution of conflict with known multiplicity,Problem Peredach.Inform.,16,2.Apr.-June(1980),69-82.(in Russian)
[12]	Georgiadis,L.and P.Papantoni-Kazakos,A collision resolution protocol for random access channel with energy detectors,IEEE Trans.Com.,Com-30,11(1982),2413-2420.
[13]	Tsybakov,B.S.,Survey of USSS contributions to random multiple-access communications,IEEE Trans.Inf.Th.,IT-31,2,March(1985).