메뉴 건너뛰기




Volumn , Issue , 2000, Pages 131-140

The use of hop-limits to provide survivable ATM group communications

Author keywords

Group Communication; Multicast; Self Healing; Survivability

Indexed keywords

COMPUTER SIMULATION; DATA COMMUNICATION SYSTEMS; MULTICASTING; OPTIMIZATION; ROUTERS; SENSORS;

EID: 0034593035     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/354644.354662     Document Type: Conference Paper
Times cited : (2)

References (25)
  • 1
    • 0031378814 scopus 로고    scopus 로고
    • A fast VP restoration scheme using ring-shaped sharable backup VPs
    • S. Ahn, A Fast VP Restoration Scheme Using Ring-Shaped Sharable Backup VPs in Proc. of IEEE Global Telecomm. Conf (Globecom'97), 1383-1387.
    • Proc. of IEEE Global Telecomm. Conf (Globecom'97) , pp. 1383-1387
    • Ahn, S.1
  • 4
    • 0028445776 scopus 로고
    • Comparison of capacity efficiency of DCS network restoration routing techniques
    • R. Doverspike and B. Wilson, Comparison of Capacity Efficiency of DCS Network Restoration Routing Techniques. J. of Network and Systems Mgmt., Vol. 2, No. 2, 1994, 95-123.
    • (1994) J. of Network and Systems Mgmt. , vol.2 , Issue.2 , pp. 95-123
    • Doverspike, R.1    Wilson, B.2
  • 6
  • 7
    • 0032003182 scopus 로고    scopus 로고
    • Multicommodity flow models, failure propagation, and reliable loss network design
    • Feb.
    • A. Girard and B. Sanso, Multicommodity Flow Models, Failure Propagation, and Reliable Loss Network Design. IEEE/ACM Trans. on Networking, Vol. 6, No. 1, Feb. 1998, 82-93.
    • (1998) IEEE/ACM Trans. on Networking , vol.6 , Issue.1 , pp. 82-93
    • Girard, A.1    Sanso, B.2
  • 10
    • 0029533861 scopus 로고    scopus 로고
    • The hop-limit approach for spare-capacity assignment in survivable networks
    • M. Herzberg, S.J. Bye, and A. Utano, The Hop-Limit Approach for Spare-Capacity Assignment in Survivable Networks. IEEE/ACM Trans. on Networking, Vol. 3, No. 6, 775-784.
    • IEEE/ACM Trans. on Networking , vol.3 , Issue.6 , pp. 775-784
    • Herzberg, M.1    Bye, S.J.2    Utano, A.3
  • 11
    • 0002540105 scopus 로고
    • An optimal spare-capacity assignment model for survivable networks with hop-limits
    • San Francisco CA
    • M. Herzberg and S.J. Bye, An Optimal Spare-Capacity Assignment Model for Survivable Networks with Hop-Limits in Proc. of IEEE Global Telecomm. Conf (Globecom'94), San Francisco CA., 1994, 1601-1606.
    • (1994) Proc. of IEEE Global Telecomm. Conf (Globecom'94) , pp. 1601-1606
    • Herzberg, M.1    Bye, S.J.2
  • 12
    • 0020175940 scopus 로고
    • The complexity of finding maximum disjoint paths with length constraints
    • A. Itai, Y. Perl, and Y. Shiloach. The Complexity of Finding Maximum Disjoint Paths with Length Constraints in Networks, Vol. 12, 1982, 277-286.
    • (1982) Networks , vol.12 , pp. 277-286
    • Itai, A.1    Perl, Y.2    Shiloach, Y.3
  • 15
    • 0013137162 scopus 로고    scopus 로고
    • Models for network design, servicing, and monitoring of ATM networks based on the virtual path concept
    • D. Medhi, Models for Network Design, Servicing, and Monitoring of ATM Networks Based on the Virtual Path Concept. Computer Networks and ISDN Systems, Vol. 29, 1997, 373-386.
    • (1997) Computer Networks and ISDN Systems , vol.29 , pp. 373-386
    • Medhi, D.1
  • 16
    • 0028375488 scopus 로고    scopus 로고
    • A unified approach to network survivability for teletraffic networks: Models, algorithms and analysis
    • D. Medhi, A Unified Approach to Network Survivability for Teletraffic Networks: Models, Algorithms and Analysis. IEEE Trans. on Comm., Vol. 42, No. 2/3/4, 534-548.
    • IEEE Trans. on Comm. , vol.42 , Issue.2-4 , pp. 534-548
    • Medhi, D.1
  • 17
    • 0026372257 scopus 로고
    • Diverse routing for survivability in a fiber-based sparse network
    • Denver CO
    • D. Medhi, Diverse Routing for Survivability in a Fiber-Based Sparse Network in Proc. of IEEE Intl. Conf on Comm. (ICC'91), Denver CO, 1991, 672-676.
    • (1991) Proc. of IEEE Intl. Conf on Comm. (ICC'91) , pp. 672-676
    • Medhi, D.1
  • 18
    • 0031117331 scopus 로고    scopus 로고
    • Reliable concurrent multicast from bursty sources
    • April
    • Y. Ofek and B. Yener, Reliable Concurrent Multicast From Bursty Sources. IEEE J. on Sel. Areas in Comm., Vol. 15, No. 3, April 1997, 434-444.
    • (1997) IEEE J. on Sel. Areas in Comm. , vol.15 , Issue.3 , pp. 434-444
    • Ofek, Y.1    Yener, B.2
  • 19
    • 0029305861 scopus 로고    scopus 로고
    • A recursive matrix-calculation method for disjoint path search with hop link number constraints
    • E. Oki and N. Yamanaka, A Recursive Matrix-Calculation Method for Disjoint Path Search with Hop Link Number Constraints. IEICE Trans. Comm., Vol. E78-B, No. 5, 769-774.
    • IEICE Trans. Comm. , vol.E78-B , Issue.5 , pp. 769-774
    • Oki, E.1    Yamanaka, N.2
  • 20
    • 0032048168 scopus 로고    scopus 로고
    • Service-specific control architecture for ATM
    • April
    • J.E. van der Merwe and I.M. Leslie, Service-Specific Control Architecture for ATM. IEEE J. on Sel. Areas in Comm., Vol 16, No. 3, April 1998, 424-436.
    • (1998) IEEE J. on Sel. Areas in Comm. , vol.16 , Issue.3 , pp. 424-436
    • Van Der Merwe, J.E.1    Leslie, I.M.2
  • 22
    • 0000000968 scopus 로고
    • An economic feasibility study for a broadband virtual path SONET/ATM selfhealing ring architecture
    • Dec.
    • T-H. Wu, D.T. Kong and R.C. Lau, An Economic Feasibility Study for a Broadband Virtual Path SONET/ATM SelfHealing Ring Architecture. IEEE J. on Sel. Areas in Comm., Vol. 10, No. 9, Dec. 1992, 1459-1473.
    • (1992) IEEE J. on Sel. Areas in Comm. , vol.10 , Issue.9 , pp. 1459-1473
    • Wu, T.-H.1    Kong, D.T.2    Lau, R.C.3
  • 23
    • 0031338514 scopus 로고    scopus 로고
    • Combinatorial design of congestion-free networks
    • Dec.
    • B. Yener, Y. Ofek, and M. Yung, Combinatorial Design of Congestion-Free Networks. IEEE/ACM Trans. on Networking, Vol. 5, No. 6, Dec. 1997, 989-1000.
    • (1997) IEEE/ACM Trans. on Networking , vol.5 , Issue.6 , pp. 989-1000
    • Yener, B.1    Ofek, Y.2    Yung, M.3


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