메뉴 건너뛰기




Volumn 6, Issue 4, 1998, Pages 475-484

A study of isochronous channel reuse in DQDB metropolitan area networks

Author keywords

Approximation algorithm; Bandwidth allocation; Destination release; DQDB; Isochronous; NP completeness; Slot reuse

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BANDWIDTH; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; CONGESTION CONTROL (COMMUNICATION); DATA COMMUNICATION SYSTEMS; QUEUEING THEORY; TELECOMMUNICATION TRAFFIC;

EID: 0032141360     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/90.720912     Document Type: Article
Times cited : (15)

References (14)
  • 1
    • 30844473706 scopus 로고
    • CCITT Recommendation I.211
    • B-ISDN Service Aspects, CCITT Recommendation I.211, 1991.
    • (1991) B-ISDN Service Aspects
  • 3
    • 0025890491 scopus 로고
    • A new scheme for dynamic management of isochronous channels in integrated rings
    • Bal Harbour, FL, Apr.
    • R. Cohen and A. Segall, "A new scheme for dynamic management of isochronous channels in integrated rings," in IEEE INFOCOM'91, Bal Harbour, FL, Apr. 1991, pp. 1031-1040.
    • (1991) IEEE INFOCOM'91 , pp. 1031-1040
    • Cohen, R.1    Segall, A.2
  • 8
    • 0024016040 scopus 로고
    • Isochronous communication in an integrated circuit/packet metropolitan area network
    • May
    • R. Kositpaiboo and N. D. Georganas, "Isochronous communication in an integrated circuit/packet metropolitan area network," IEEE Trans. Commun. vol. 36, pp. 621-625, May 1988.
    • (1988) IEEE Trans. Commun. , vol.36 , pp. 621-625
    • Kositpaiboo, R.1    Georganas, N.D.2
  • 9
    • 0025791186 scopus 로고
    • An optimal greedy heuristic to color interval graphs
    • S. Olariu, "An optimal greedy heuristic to color interval graphs," Inf. Processing Lett., vol. 37, pp. 21-25, 1991.
    • (1991) Inf. Processing Lett. , vol.37 , pp. 21-25
    • Olariu, S.1
  • 11
    • 0027540546 scopus 로고
    • A simple scheme for slot reuse without latency for a dual bus configuration
    • Feb.
    • O. Sharon and A. Segall, "A simple scheme for slot reuse without latency for a dual bus configuration," IEEE/ACM Trans. Networking, vol. 1, pp. 96-104, Feb. 1993.
    • (1993) IEEE/ACM Trans. Networking , vol.1 , pp. 96-104
    • Sharon, O.1    Segall, A.2
  • 12
    • 0031163916 scopus 로고    scopus 로고
    • A proof for lack of starvation in DQDB with and without slot reuse
    • June
    • O. Sharon, "A proof for lack of starvation in DQDB with and without slot reuse," IEEE/ACM Trans. Networking, vol. 5, pp. 410-419, June 1997.
    • (1997) IEEE/ACM Trans. Networking , vol.5 , pp. 410-419
    • Sharon, O.1
  • 13
    • 0028374119 scopus 로고
    • On the efficiency of slot reuse in the dual bus configuration
    • Feb.
    • O. Sharon and A. Segall, "On the efficiency of slot reuse in the dual bus configuration," IEEE/ACM Trans. Networking, vol. 2, pp. 89-100, Feb. 1994.
    • (1994) IEEE/ACM Trans. Networking , vol.2 , pp. 89-100
    • Sharon, O.1    Segall, A.2
  • 14
    • 0024888630 scopus 로고
    • Bandwidth allocation for bursty isochronous traffic in a hybrid switching system
    • Dec.
    • M. Zukerman, "Bandwidth allocation for bursty isochronous traffic in a hybrid switching system," IEEE Trans. Commun., vol. 37, pp. 1367-1371, Dec. 1989.
    • (1989) IEEE Trans. Commun. , vol.37 , pp. 1367-1371
    • Zukerman, M.1


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