ALPHA transport

ABSTRACT

The control of the resources of a packet switching network is a very difficult problem to solve.1 Past attempts to solve this problem have been handicapped primarily by lack of an adequate means to quantify the user demands and then assign distributed resources to the demands in a globally coherent way. This paper presents a new approach to control the resources of packet switching networks. The key to this control is a new network transport scheme called alpha transport. Alpha transport combines the TDM circuit switching concept and packet switching technology. It is easy to implement and particularly cost effective to carry the subnet traffic of meshed packet switching networks. Alpha transport is robust, enables high utilization of the subnet bandwidth, reduces the subnet delay, and provides fairness.

REFERENCES

• 1: L. Kleinrock, "Principles and lessons in packet communication," Proc. of the IEEE, Vol. 66, No. 11, pp. 1320'-i32g, NOVember 1978.
• 2: W. Chou and M. Gerla, "A unified flow and congestion control model for packet networks," Proc. Third Int. Conf. on Computer Communication, ICCC, Toronto, Canada, August 1976.
• 3: V. Cerf and R. Kahn "A protocol for packet network intercommunication," IEEE Trans. on Communication, COM 22, May 1974.
• 4: M. Gerla, "Routing and flow control in "IEEE Magazine, November computer networks, .......... 1984.

INDEX TERMS

Primary Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.1 Network Architecture and Design
          Subjects: Packet-switching networks

Additional Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS

General Terms:
Management, Theory