Showing papers on "Packet loss published in 1977"

Heuristic design algorithm for computer communication networks with different classes of packets

Abstract: A typical operating environment of a packet switching (store-and-forward) computer communication network is that it is shared by many users with different classes of packets. Packets may be classified in a very general fashion by types of users, messages, applications, transactions, response time requirements, packet parameters such as packet rate and length, and by network parameters such as source-destination and path length. A well-designed network must provide access and performance assurance to all packet classes. This paper presents a heuristic algorithm for designing such a communication network. The algorithm presented contains heuristic algorithms for discrete link capacity assignment, priority assignment, and flow assignment problems with an additional feature which allows one to alter network topology interactively. Sample results from application of the overall network design are also given.

A Reliable Control Protocol for High-Speed Packet Transmission

Abstract: This paper describes a control protocol for high-speed transfers between transceivers in a data communication system. One particularly suitable application of current topical interest would be to control lines linking nodes in a local area packet-switching system. The protocol applies for fixed-length data packets which must ultimately be received at their destination in sequence. With these specifications, a set of rules which is easy to implement in practice is established. The result is a packet interlock method of numbering packet transmissions and jumping back to retransmit a series of packets under error conditions. Problems associated with multiple errors, dummy packets, initial synchronization and resynchronization are investigated and found to be readily overcome by the proposed protocol.