A telecommunications switching system employing multi-protocol routing optimization which utilizes predetermined and measured parameters in accordance with a set of user priorities in determining the selection of a telecommunications path to be utilized for transmitting a data file to a remote destination. The switching system has a first memory for storing the data file to be transferred, a second memory for storing predetermined parameters such as cost data associated with each of the telecommunications paths, a third memory for storing a set of user priorities regarding the transmission of data files, and means for measuring the value of variable parameters such as file transfer speed associated with each of the telecommunications paths. Processor means are operatively associated with the second and third memories and the variable parameter measuring means for determining which of the plurality of telecommunications paths should be utilized for transferring the data file in accordance with the set of user priorities, the predetermined telecommunications path parameters, and the measured variable parameters. The switching system further comprises input means for allowing a user to change the user priorities in the third memory prior to transmitting a file.

Multi-protocol telecommunications routing optimization

A packet network routing method and system based on geographic coordinate identifiers is described. Each node in a network is uniquely identified by absolute geographical coordinates or by a code indicating absolute location in an external coordinate-based reference system (node coordinates), and such absolute geographical coordinates or the equivalent are employed as part of a packet identifier for each packet generated for use in making routing decisions. The node coordinates of a local node and its neighboring nodes and the packet coordinates are used by means at each node through which a packet is routed for determining a desired forwarding route of a data packet. The routing may be prioritized according to preselected criteria, preferably achieving maximum forward progress using the least amount of power. The packet routing protocol according to the invention requires no routing directory or table to perform data routing. Each node of the network collects in a table or is otherwise provided with information about the quality of communication between itself and its neighboring nodes. When a data packet has been received at a node, it is routed further through the network based on criteria derived from the history of communication between the local node and its neighbors.

Method for routing packets in a packet communication network

A packet network routing method and system based on geographic coordinate identifiers is described. Each node in a network is uniquely identified by absolute geographical coordinates or by a code indicating absolute location in an external coordinate-based reference system (node coordinates), and such absolute geographical coordinates or the equivalent are employed as part of a packet identifier for each packet generated for use in making routing decisions. The node coordinates of a local node and its neighboring nodes and the packet coordinates are used by means at each node through which a packet is routed for determining a desired forwarding route of a data packet. The routing may be prioritized according to preselected criteria, preferably achieving maximum forward progress using the least amount of power. The packet routing protocol according to the invention requires no routing directory or table to perform data routing.

Method and system for routing packets in a packet communication network

This invention is suited for a packet network that carries bursty data. A mechanism is coupled to an edge node for coding bursty information into a digital format at either a first coding rate of a second coding rate which is less than the first rate. A mechanism senses traffic overload of one or more intermediate nodes carrying the bursty informaton. A mechanism which is responsive to the overload sensing mechanism causes the coding mechanism to switch from the first rate to the second rate while a traffic overload is sensed. Thus, network demand requirements are reduced and the overload will be alleviated.

Dynamic encoding rate control minimizes traffic congestion in a packet network

Flow of data packets through virtual circuits in a multinode packet switching network is controlled by authorizing packets to enter and to leave each node When a packet entering a node does not have an authorization (credit) to leave, it is placed in a pool of buffers common to all virtual circuits to await reception of an output credit for the virtual circuit To avoid buffer congestion, a count is maintained of packets presently stored in and being processed through the node and packets that the node anticipates it will receive If the count exceeds a predetermined threshold, a packet cannot get an authorization to enter the node unless it has a credit to leave If the count is below the threshold, credits are granted for packets to enter the node even though there is no authorization to leave

Data packet flow control scheme for switching networks

A packet switching network in which the data transmitted from a data sending terminal is temporarily stored in a packet switching exchange connected to a data sender where the data is divided into a plurality of units each of which is called a packet and the data in turn is transferred with each packet unit to a packet switching exchange connected to a data receiver, through a number of transmit switching exchanges, and then those packets are reassembled into the original format of the data which finally is transmitted to a data receiving terminal, the above-mentioned packet switching network employing a data sending and receiving system in which a character oriented transmission control procedure for communicating with its associated terminals is used in the packet switching network, and the packet switching network involves data terminals each having a single communication link connected with the packet switching network, whereby the data sending and receiving system is effectively effected and a flow control for the switching network can be achieved without using any special procedure in the control.

Data sending and receiving system for packet switching network

Paketsutokokanmoni okeru deetasojushinhoshiki

PURPOSE:To remove factors such as a data error which cause the lowering of the efficiency of the whole of the system, by making the connection state of branch lines controllable to disconnect unnecessary data terminals. CONSTITUTION:A center computer 1 is connected to terminals 41 and 42 through branching devices 31 and 32 by a full duplex basic trunk 2. Internal connections of branching devices 31 and 32 are changed by the code of an address field 51 and a control field 52 in the frame to disconnect or connect terminals 41 and 42 and the full duplex basic trunk 2 or fold and connect the full duplex basic trunk 2 in a specific branching device. Thus, a terminal having no transmission panel is prevented from transmitting data to the full duplex basic trunk 2. Further, by setting a terminal disconnection code to the control field 52, a faulty terminal is disconnected to ensure the communication between other terminals and the center computer 1.

Data communication device

PURPOSE:To increase the processing ability as exchanging network and to decrease the set time, by setting the path between the specific exchange station and the outgoing exchange station with the call connection finish signal including the selection information of the path transmitted from the specific exchange station to the outgoing exchange station. CONSTITUTION:Call connection request signal is transmitted from the outgoing exchange station 102 receiving the call set request signal of the outgoing subscriber 101 to the specific exchange station 103, and the exchnage station 103 at least selects the incoming exchange station 105 and transmits the call connection request signal including the selection information of path. Further, the call connection finish signal including the selection information of the path transmitted from the exchange station 105 to the exchange station 102 sets the path for the exchange stations 102 and 105. thus, the path is set without transmitting signal between the outgoing subscriber 101 and the exchange station 103, to increase the processing ability as the exchange station and to decrease the set time.

Hayashi Kazuyuki

Papers

Data sending and receiving system for packet switching network

Paketsutokokanmoni okeru deetasojushinhoshiki

Data communication device

Path selection system in exchanging network