메뉴 건너뛰기




Volumn 83, Issue 1-3, 1998, Pages 157-178

Optimal layouts on a chain ATM network

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0000248576     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(98)80002-4     Document Type: Article
Times cited : (14)

References (26)
  • 3
    • 0000813380 scopus 로고
    • Routing with polynomial communication-space tradeoff
    • B. Awerbuch, D. Peleg, Routing with polynomial communication-space tradeoff, SIAM J. Discrete Math. 5 (2) (1992) 151-162.
    • (1992) SIAM J. Discrete Math. , vol.5 , Issue.2 , pp. 151-162
    • Awerbuch, B.1    Peleg, D.2
  • 5
    • 0026219174 scopus 로고
    • Broadband ISDN resource management: The role of virtual paths
    • J. Burgin, D. Dorman, Broadband ISDN resource management: the role of virtual paths, IEEE Commun. Mag. 29 (1991).
    • (1991) IEEE Commun. Mag. , vol.29
    • Burgin, J.1    Dorman, D.2
  • 6
    • 85026736709 scopus 로고
    • A scalable approach to routing in ATM network
    • G. Tel, P.M.B. Vitányi (Eds.), Terschelling, The Netherlands, October
    • I. Cidon, O. Gerstel, S. Zaks, A scalable approach to routing in ATM network, in: G. Tel, P.M.B. Vitányi (Eds.), The 8th International Workshop on Distributed Algorithms (LNCS 857), Terschelling, The Netherlands, October 1994, pp. 209-222.
    • (1994) The 8th International Workshop on Distributed Algorithms (LNCS 857) , pp. 209-222
    • Cidon, I.1    Gerstel, O.2    Zaks, S.3
  • 7
    • 0028583367 scopus 로고
    • Connection management and rerouting in ATM networks
    • R. Cohen, A. Segall, Connection management and rerouting in ATM networks, in: IEEE Infocom'94, 1994. pp. 184-191.
    • (1994) IEEE Infocom'94 , pp. 184-191
    • Cohen, R.1    Segall, A.2
  • 9
    • 3743052727 scopus 로고
    • Designing networks with compact routing tables
    • G.N. Frederickson, R. Janardan, Designing networks with compact routing tables, Algorithmica 3 (1988) 171-190.
    • (1988) Algorithmica , vol.3 , pp. 171-190
    • Frederickson, G.N.1    Janardan, R.2
  • 10
    • 0006983261 scopus 로고
    • Ph.D. Thesis, Department of Computer Science, Technion, Israel Inst. of Technology, December
    • O. Gerstel, Virtual path design in ATM networks, Ph.D. Thesis, Department of Computer Science, Technion, Israel Inst. of Technology, December 1995.
    • (1995) Virtual Path Design in ATM Networks
    • Gerstel, O.1
  • 11
    • 61849171894 scopus 로고
    • Dynamic maintenance of the virtual path layout
    • April
    • O. Gerstel, A. Segall, Dynamic maintenance of the virtual path layout, in: IEEE Infocom'95, April 1995, pp. 330-337.
    • (1995) IEEE Infocom'95 , pp. 330-337
    • Gerstel, O.1    Segall, A.2
  • 15
    • 0006935167 scopus 로고
    • Integrated broadband networks: An introduction to
    • Addison-Wesley, Reading, MA
    • R. Händler, M.N. Huber, Integrated Broadband networks: an Introduction to ATM-based networks, Addison-Wesley, Reading, MA, 1991.
    • (1991) ATM-based Networks
    • Händler, R.1    Huber, M.N.2
  • 16
    • 0042557493 scopus 로고
    • I series (B-ISDN)
    • November
    • ITU recommendation, I series (B-ISDN), Blue Book, November 1990.
    • (1990) Blue Book
  • 17
    • 0017416837 scopus 로고
    • Hierarchical routing for large networks; performance evaluation and optimization
    • L. Kleinrock, F. Kamoun, Hierarchical routing for large networks; performance evaluation and optimization, Comput. Networks 1 (1977) 155-174.
    • (1977) Comput. Networks , vol.1 , pp. 155-174
    • Kleinrock, L.1    Kamoun, F.2
  • 18
    • 84986946222 scopus 로고
    • Optimal clustering structures for hierarchical topological design of large computer networks
    • L. Kleinrock, F. Kamoun, Optimal clustering structures for hierarchical topological design of large computer networks, Networks 10 (1980) 221-248.
    • (1980) Networks , vol.10 , pp. 221-248
    • Kleinrock, L.1    Kamoun, F.2
  • 19
    • 0003657590 scopus 로고
    • Fundamental Algorithms, Addison-Wesley, Reading, MA
    • D.E. Knuth, The Art of Computer Programming, Vol. 1 - Fundamental Algorithms, Addison-Wesley, Reading, MA, 1968.
    • (1968) The Art of Computer Programming , vol.1
    • Knuth, D.E.1
  • 20
    • 0003657590 scopus 로고
    • Sorting and Searching, Addison-Wesley, Reading, MA
    • D.E. Knuth, The Art of Computer Programming, Vol. 3 - Sorting and Searching, Addison-Wesley, Reading, MA, 1973.
    • (1973) The Art of Computer Programming , vol.3
    • Knuth, D.E.1
  • 21
    • 0027852144 scopus 로고
    • Virtual path assignment and virtual circuit routing in ATM networks
    • F.Y.S. Lin, K.T. Cheng, Virtual path assignment and virtual circuit routing in ATM networks, in: IEEE Globecom'93, 1993, pp. 436-441.
    • (1993) IEEE Globecom'93 , pp. 436-441
    • Lin, F.Y.S.1    Cheng, K.T.2
  • 23
    • 33745594334 scopus 로고
    • A tradeoff between space and efficiency for routing tables
    • D. Peleg, E. Upfal, A tradeoff between space and efficiency for routing tables, in: 20th Symposium on Theory of Computing, 1988, pp. 43-52.
    • (1988) 20th Symposium on Theory of Computing , pp. 43-52
    • Peleg, D.1    Upfal, E.2
  • 24
    • 0025477009 scopus 로고
    • Broad-band ATM network architecture based on virtual paths
    • K.I. Sato, S. Ohta, I. Tokizawa, Broad-band ATM network architecture based on virtual paths, IEEE Trans. Commun. 38 (8) (1990) 1212-1222.
    • (1990) IEEE Trans. Commun. , vol.38 , Issue.8 , pp. 1212-1222
    • Sato, K.I.1    Ohta, S.2    Tokizawa, I.3
  • 25
    • 0026080304 scopus 로고
    • Virtual path and link capacity design for ATM networks
    • Y. Sato, K.I. Sato, Virtual path and link capacity design for ATM networks, IEEE J. Selected Areas Commun. 9 (1991).
    • (1991) IEEE J. Selected Areas Commun. , vol.9
    • Sato, Y.1    Sato, K.I.2


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