Datagram Switching

Datagram Switching is a type of packet-switching method in which each data unit, independently routed as a datagram, contains complete addressing information and is forwarded through the network without establishing a prior connection.

23

Publications

2.5K

Citations

38

Authors

17

Institutions

Publications per year

2017–2026

0

Authors

38

  1. JW
    John Wroclawski

    Massachusetts Institute of Technology, United States

    4 publications · 734 citations

    4

    h-index

  2. KS
    Karen Sollins

    Massachusetts Institute of Technology, United States

    4 publications · 734 citations

    4

    h-index

  3. DD
    David D. Clark

    Massachusetts Institute of Technology, United States

    4 publications · 734 citations

    4

    h-index

  4. RB
    Robert Braden

    University of Southern California, United States

    4 publications · 734 citations

    4

    h-index

  5. SS
    S.Z. Shaikh

    AT&T (United States), United States

    2 publications · 89 citations

    2

    h-index

1–5 of 38

Venues

  1. IEEE Transactions on Communications

    4 publications · 430 citations

    4

    h-index

  2. ACM SIGCOMM Computer Communication Review

    CCR · 2 publications · 64 citations

    2

    h-index

  3. IEEE Communications Magazine

    2 publications · 61 citations

    2

    h-index

  4. 1

    h-index

  5. IRE Transactions on Communications Systems

    1 publications · 40 citations

    1

    h-index

1–5