메뉴 건너뛰기




Volumn 11, Issue 1, 2003, Pages 111-124

On achieving fairness and efficiency in high-speed shared medium access

Author keywords

Broadcast networks; Collision resolution; Multiple access; Tree splitting

Indexed keywords

BANDWIDTH; BROADCASTING; COMMUNICATION CHANNELS (INFORMATION THEORY); NETWORK PROTOCOLS; QUEUEING NETWORKS; REAL TIME SYSTEMS;

EID: 0037296767     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2002.808402     Document Type: Article
Times cited : (25)

References (23)
  • 2
    • 0033100186 scopus 로고    scopus 로고
    • Medium-access control protocols for space and satellite communications
    • Mar.
    • H. Peyravi, "Medium-access control protocols for space and satellite communications," IEEE Commun. Mag., vol. 37, pp. 62-71, Mar. 1999.
    • (1999) IEEE Commun. Mag. , vol.37 , pp. 62-71
    • Peyravi, H.1
  • 3
    • 0018522043 scopus 로고
    • Tree algorithm for packet broadcasting channel
    • Sept.
    • J. I. Capetanakis, "Tree algorithm for packet broadcasting channel," IEEE Trans. Inform. Theory, vol. IT-25, pp. 505-515, Sept. 1979.
    • (1979) IEEE Trans. Inform. Theory , vol.IT-25 , pp. 505-515
    • Capetanakis, J.I.1
  • 4
    • 0002876117 scopus 로고
    • Collision resolution algorithm and random-access communications
    • G. Longo, Ed. New York: Springer Verlag
    • J. L. Massey, "Collision resolution algorithm and random-access communications," in Multiuser Communication Systems, G. Longo, Ed. New York: Springer Verlag, 1981, pp. 73-137.
    • (1981) Multiuser Communication Systems , pp. 73-137
    • Massey, J.L.1
  • 6
    • 0019067999 scopus 로고
    • Random multiple packet access: Part-and-try algorithm
    • Oct.-Dec.
    • B. S. Tsybakov and V. A. Mikhailov, "Random multiple packet access: part-and-try algorithm," Probl. Inform. Transmission, vol. 16, no. 4, pp. 305-317, Oct.-Dec. 1980.
    • (1980) Probl. Inform. Transmission , vol.16 , Issue.4 , pp. 305-317
    • Tsybakov, B.S.1    Mikhailov, V.A.2
  • 7
    • 0019539629 scopus 로고
    • Bounds on performance of protocols for a multiple-access broadcast channel
    • Mar.
    • N. Pippenger, "Bounds on performance of protocols for a multiple-access broadcast channel," IEEE Trans. Inform. Theory, vol. IT-27, pp. 145-151, Mar. 1981.
    • (1981) IEEE Trans. Inform. Theory , vol.IT-27 , pp. 145-151
    • Pippenger, N.1
  • 8
    • 0020207168 scopus 로고
    • A collision resolution protocol for random-access channel with energy detectors
    • Nov.
    • L. Georgiadis and P. Papantoni-Kazakos, "A collision resolution protocol for random-access channel with energy detectors," IEEE Trans. Commun., vol. COM-30, pp. 2413-2420, Nov. 1982.
    • (1982) IEEE Trans. Commun. , vol.COM-30 , pp. 2413-2420
    • Georgiadis, L.1    Papantoni-Kazakos, P.2
  • 9
    • 0019006384 scopus 로고
    • Resolution of conflict with known multiplicity
    • Apr.-June
    • B. S. Tsybakov, "Resolution of conflict with known multiplicity," Probl. Inform. Transmission, vol. 16, no. 2, pp. 69-82, Apr.-June 1980.
    • (1980) Probl. Inform. Transmission , vol.16 , Issue.2 , pp. 69-82
    • Tsybakov, B.S.1
  • 10
    • 0022116456 scopus 로고
    • Tree based multiaccess where collision multiplicities are known
    • Sept.
    • E. Gulko, "Tree based multiaccess where collision multiplicities are known," IEEE Trans. Commun., vol. COM-33, pp. 999-1001, Sept. 1985.
    • (1985) IEEE Trans. Commun. , vol.COM-33 , pp. 999-1001
    • Gulko, E.1
  • 11
    • 0023380487 scopus 로고
    • Upper bound on the capacity of random multiple-access system
    • July-Sept.
    • B. S. Tsybakov and N. B. Likhanov, "Upper bound on the capacity of random multiple-access system," Probl. Inform. Transmission, vol. 23, no. 3, pp. 224-236, July-Sept. 1987.
    • (1987) Probl. Inform. Transmission , vol.23 , Issue.3 , pp. 224-236
    • Tsybakov, B.S.1    Likhanov, N.B.2
  • 12
    • 0020843560 scopus 로고
    • Pretested random tree protocol for packet conflict resolution
    • June
    • J. Huang and B. Xu, "Pretested random tree protocol for packet conflict resolution," IEEE Trans. Inform. Theory, vol. IT-29, pp. 910-913, June 1983.
    • (1983) IEEE Trans. Inform. Theory , vol.IT-29 , pp. 910-913
    • Huang, J.1    Xu, B.2
  • 13
    • 0022037579 scopus 로고
    • Delay analysis of interval searching contention resolution algorithm
    • Mar.
    • J. C. Huang and J. C. Berger, "Delay analysis of interval searching contention resolution algorithm," IEEE Trans. Inform. Theory, vol. IT-31, pp. 264-273, Mar. 1985.
    • (1985) IEEE Trans. Inform. Theory , vol.IT-31 , pp. 264-273
    • Huang, J.C.1    Berger, J.C.2
  • 14
    • 0021002434 scopus 로고
    • Multiaccess of a slotted channel using a control mini-slot
    • L. Merakos and D. Kazakos, "Multiaccess of a slotted channel using a control mini-slot," in Proc. Int. Conf. Communications, 1983, pp. C5.3.1-C5.3.6.
    • (1983) Proc. Int. Conf. Communications
    • Merakos, L.1    Kazakos, D.2
  • 15
    • 0022147832 scopus 로고
    • Announced retransmission random-access protocols
    • Nov.
    • D. Raychaudhuri, "Announced retransmission random-access protocols," IEEE Trans. Commun., vol. COM-33, pp. 1183-1190, Nov. 1985.
    • (1985) IEEE Trans. Commun. , vol.COM-33 , pp. 1183-1190
    • Raychaudhuri, D.1
  • 16
    • 0023346572 scopus 로고
    • Announced arrival random-access protocols
    • May
    • T. Towsley and P. O. Vales, "Announced arrival random-access protocols," IEEE Trans. Commun., vol. COM-35, pp. 513-521, May 1987.
    • (1987) IEEE Trans. Commun. , vol.COM-35 , pp. 513-521
    • Towsley, T.1    Vales, P.O.2
  • 17
    • 84904362659 scopus 로고
    • A distributed queueing random-access protocol for broadcast channel
    • San Francisco, CA, Sept.
    • W. Xu and G. Campbell, "A distributed queueing random-access protocol for broadcast channel," in Proc. ACM SIGCOMM '93, San Francisco, CA, Sept. 1993, pp. 13-17.
    • (1993) Proc. ACM SIGCOMM '93 , pp. 13-17
    • Xu, W.1    Campbell, G.2
  • 19
    • 0012365265 scopus 로고    scopus 로고
    • Collision avoidance and resolution multiple access (CARMA)
    • _, "Collision avoidance and resolution multiple access (CARMA)," Cluster Comput., vol. 1, pp. 197-212, 1998.
    • (1998) Cluster Comput. , vol.1 , pp. 197-212
  • 20
    • 0032687846 scopus 로고    scopus 로고
    • Collision avoidance and resolution multiple access with transmission queues
    • _, "Collision avoidance and resolution multiple access with transmission queues," ACM Wireless Netw. J., vol. 5, no. 2, pp. 95-109, 1999.
    • (1999) ACM Wireless Netw. J. , vol.5 , Issue.2 , pp. 95-109
  • 21
    • 0031674956 scopus 로고    scopus 로고
    • A near-optimum channel-access protocol based on incremental collision resolution and distributed transmission queues
    • San Francisco, CA
    • _, "A near-optimum channel-access protocol based on incremental collision resolution and distributed transmission queues," in Proc. IEEE INFOCOM, San Francisco, CA, 1998, pp. 158-165.
    • (1998) Proc. IEEE INFOCOM , pp. 158-165
  • 22
    • 0012367868 scopus 로고    scopus 로고
    • On IEEE 802.14 medium-access control protocol
    • Sept.
    • Y. Lin, "On IEEE 802.14 medium-access control protocol," IEEE Commun. Surveys, Sept. 1998.
    • (1998) IEEE Commun. Surveys
    • Lin, Y.1
  • 23
    • 0002885014 scopus 로고    scopus 로고
    • A review of contention resolution algorithms for IEEE 802.14 networks
    • N. Golmie, Y. Saintillan, and D. Su, "A review of contention resolution algorithms for IEEE 802.14 networks," IEEE Commun. Surveys, 1999.
    • (1999) IEEE Commun. Surveys
    • Golmie, N.1    Saintillan, Y.2    Su, D.3


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