메뉴 건너뛰기




Volumn 31, Issue 2, 1985, Pages 264-273

Delay Analysis of Interval-Searching Contention Resolution Algorithms

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION THEORY - COMMUNICATION CHANNELS; MATHEMATICAL TECHNIQUES - INTEGRAL EQUATIONS; RADIO TRANSMISSION - MULTIPLEX SYSTEMS;

EID: 0022037579     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/TIT.1985.1057016     Document Type: Article
Times cited : (30)

References (10)
  • 1
    • 0003267137 scopus 로고
    • Conflict resolution in random access broadcast networks
    • Provincetown, MA, Sept
    • R. G. Gallager, “ Conflict resolution in random access broadcast networks,” in Proc. AFOSR Workshop Communications Theory and Applications, Provincetown, MA, Sept. 17–20, 1978, pp. 74–76.
    • (1978) Proc. AFOSR Workshop Communications Theory and Applications , pp. 17-20
    • Gallager, R.G.1
  • 2
    • 0041373881 scopus 로고
    • Some tools for the study of channel-sharing algorithms
    • G. Longo, Ed., CISM Course and Lecture Series New York: Springer-Verlag
    • G. Ruget, “Some tools for the study of channel-sharing algorithms,” in Multi-User Communications, G. Longo, Ed., CISM Course and Lecture Series, no. 265. New York: Springer-Verlag; 1981, pp. 201–231.
    • (1981) Multi-User Communications , Issue.265 , pp. 201-231
    • Ruget, G.1
  • 4
    • 0021461359 scopus 로고
    • Random multiple-access communication and group testing
    • July
    • T. Berger, N. Mehravari, D. Towsley, and J. K. Wolf, “Random multiple-access communication and group testing,” IEEE Trans. Commun., vol. COM-32, pp. 769–779, July 1984.
    • (1984) IEEE Trans. Commun. , vol.COM-32 , pp. 769-779
    • Berger, T.1    Mehravari, N.2    Towsley, D.3    Wolf, J.K.4
  • 5
    • 0018522043 scopus 로고
    • Tree algorithm for packet broadcast channels
    • Sept
    • J. I. Capetanalds, “Tree algorithm for packet broadcast channels,” IEEE Trans. Inform. Theory, vol. IT-25, no. 5, pp. 505–515, Sept. 1978.
    • (1978) IEEE Trans. Inform. Theory , vol.IT-25 , Issue.5 , pp. 505-515
    • Capetanalds, J.I.1
  • 7
    • 85068944824 scopus 로고
    • Interval-searching algorithms for multiaccess contention resolution: Delay and throughput
    • Cornell Univ., Ithaca, NY, Jan
    • J. C. Huang, “Interval-searching algorithms for multiaccess contention resolution: Delay and throughput,” Ph.D. dissertation, School of Electrical Engineering, Cornell Univ., Ithaca, NY, Jan. 1985.
    • (1985) Ph.D. dissertation, School of Electrical Engineering
    • Huang, J.C.1
  • 9
    • 85068944823 scopus 로고    scopus 로고
    • private communication, Nov
    • J. L. Massey, private communication, Nov. 1984.
    • Massey, J.L.1
  • 10
    • 84555217663 scopus 로고
    • Upper bound for the delay in a multiple-random-access system with a splitting algorithm
    • Oct.—Dec
    • B. S. Tsybakov and N. B. Likhanov, “Upper bound for the delay in a multiple-random-access system with a splitting algorithm,” Problemy Peredachi Informatsii, vol. 18, no. 4, pp. 76–84, Oct.—Dec., 1982.
    • (1982) Problemy Peredachi Informatsii , vol.18 , Issue.4 , pp. 76-84
    • Tsybakov, B.S.1    Likhanov, N.B.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.