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
23
High-speed switch scheduling for local-area networks
Thomas E. Anderson, Susan Owicki, James B. Saxe et al. · ACM Transactions on Computer Systems · 1993 · 896 citations · Full text
Tussle in cyberspace: defining tomorrow's Internet
David D. Clark, John Wroclawski, Karen Sollins et al. · IEEE/ACM Transactions on Networking · 2005 · 417 citations
On Packet Switches with Infinite Storage
John Nagle · IEEE Transactions on Communications · 1987 · 381 citations
David D. Clark, John Wroclawski, Karen Sollins et al. · 2002 · 256 citations · Full text
1–5 of 23
38
4
h-index
4
h-index
4
h-index
4
h-index
2
h-index
1–5 of 38
17
AT&T (United States)
Bedminster, United States
3 h-index
5 publications
166 citations
University of California, Berkeley
Berkeley, United States
2 h-index
3 publications
960 citations
Columbia University
New York, United States
1 h-index
1 publications
40 citations
Massachusetts Institute of Technology
Cambridge, United States
1 h-index
3 publications
1.3K citations
Digital Equipment (Germany)
Hennef, Germany
1 h-index
3 publications
2.7K citations
University of Southern California
Los Angeles, United States
1 h-index
1 publications
417 citations
TeliaSonera (Sweden)
Stockholm, Sweden
1 h-index
2 publications
28 citations
The Aerospace Corporation
El Segundo, United States
1 h-index
1 publications
381 citations
1–8 of 17
4 publications · 430 citations
4
h-index
CCR · 2 publications · 64 citations
2
h-index
2 publications · 61 citations
2
h-index
1 publications · 49 citations
1
h-index
1 publications · 40 citations
1
h-index
1–5