메뉴 건너뛰기




Volumn 29, Issue 1, 1997, Pages 11-28

Optimal Packet Fragmentation and Routing in Computer Networks

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0347140015     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0037(199701)29:1<11::AID-NET2>3.0.CO;2-F     Document Type: Article
Times cited : (5)

References (15)
  • 1
    • 0020087712 scopus 로고
    • The overheads of transnetwork fragmentation
    • C. J. Bennett, The overheads of transnetwork fragmentation. Comput. Net. 6(1) (1982) 21-36.
    • (1982) Comput. Net. , vol.6 , Issue.1 , pp. 21-36
    • Bennett, C.J.1
  • 3
    • 0025844461 scopus 로고
    • Minimum fragmentation internetwork routing
    • Bal Harbor, FL April
    • M. A. Bonuccelli. Minimum fragmentation internetwork routing. Proceedings of INFOCOM''91, Bal Harbor, FL (April 1991) pp. 289-294.
    • (1991) Proceedings of INFOCOM''91 , pp. 289-294
    • Bonuccelli, M.A.1
  • 4
    • 0016059991 scopus 로고
    • A protocol for packet network interconnection
    • V. G. Cerf and R. E. Kahn, A protocol for packet network interconnection. IEEE Trans. Commun. COM-22(5) (1974) 637-648.
    • (1974) IEEE Trans. Commun. , vol.COM-22 , Issue.5 , pp. 637-648
    • Cerf, V.G.1    Kahn, R.E.2
  • 5
    • 0021444735 scopus 로고
    • Shortest path algorithms: Taxonomy and annotation
    • N. Deo and C. Y. Pang, Shortest path algorithms: Taxonomy and annotation. Networks 14 (1984) 275-323.
    • (1984) Networks , vol.14 , pp. 275-323
    • Deo, N.1    Pang, C.Y.2
  • 6
    • 0015747007 scopus 로고
    • The flow deviation method: An approach to store and forward communication network design
    • L. Fratta, M. Gerla, and L. Kleinrock, The flow deviation method: An approach to store and forward communication network design. Networks 3(2) (1973) 97-133.
    • (1973) Networks , vol.3 , Issue.2 , pp. 97-133
    • Fratta, L.1    Gerla, M.2    Kleinrock, L.3
  • 7
    • 0017450139 scopus 로고
    • A minimum delay routing algorithm using distributed computation
    • R. G. Gallager, A minimum delay routing algorithm using distributed computation. IEEE Trans. Commun. COM-25(1) (1977) 73-85.
    • (1977) IEEE Trans. Commun. , vol.COM-25 , Issue.1 , pp. 73-85
    • Gallager, R.G.1
  • 10
    • 0019009080 scopus 로고
    • Internetwork protocol approaches
    • J. B. Postel, Internetwork protocol approaches. IEEE Trans. Commun. COM-28(4) (1980) 604-611.
    • (1980) IEEE Trans. Commun. , vol.COM-28 , Issue.4 , pp. 604-611
    • Postel, J.B.1
  • 11
    • 0004292408 scopus 로고
    • RFC 791. Defense Advanced Research Projects Agency, Information Processing Techniques Office September
    • J. B. Postel, Ed., Internet protocol, RFC 791. Defense Advanced Research Projects Agency, Information Processing Techniques Office (September 1981).
    • (1981) Internet Protocol
    • Postel, J.B.1
  • 13
    • 0017428570 scopus 로고
    • The modeling of adaptive routing in data-communication networks
    • A. Segall, The modeling of adaptive routing in data-communication networks. IEEE Trans. Commun. COM-25(1) (1977) 85-95.
    • (1977) IEEE Trans. Commun. , vol.COM-25 , Issue.1 , pp. 85-95
    • Segall, A.1
  • 14
    • 0018289221 scopus 로고
    • Optimal distributed routing for virtual line-switched data networks
    • A. Segall, Optimal distributed routing for virtual line-switched data networks. IEEE Trans. Commun. COM-27(1)(1979) 201-209.
    • (1979) IEEE Trans. Commun. , vol.COM-27 , Issue.1 , pp. 201-209
    • Segall, A.1
  • 15
    • 0018431238 scopus 로고
    • Packet fragmentation in internetwork protocols
    • J. F. Shoch, Packet fragmentation in internetwork protocols. Comput. Net. 3(1) (1979) 3.
    • (1979) Comput. Net. , vol.3 , Issue.1 , pp. 3
    • Shoch, J.F.1


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