Computer Networks
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
48-bit absolute internet and Ethernet host numbers
SIGCOMM '81 Proceedings of the seventh symposium on Data communications
Pitfalls in the design of distributed routing algorithms
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
An algorithm for distributed computation of a spanningtree in an extended LAN
SIGCOMM '85 Proceedings of the ninth symposium on Data communications
| Hi-index | 0.00 |
Conventional routing protocols and algorithms work most efficiently on sparsely connected networks. Network topologies today include multiaccess links which include hundreds of nodes, all of which are capable of direct communication with each other. Some of these multiaccess links have broadcasting ability. This paper presents protocols and algorithms for efficiently dealing with the characteristics of various types of multiaccess links, when they are included as links in a general topology net.