Transfer of messages in a multiplexed system

Details Transfer of messages in a multiplexed system Transfer of messages in a multiplexed system

1993-09-17

2002-01-01

Hsu, Alpus H. (Department: 2731)

Multiplex communications

Pathfinding or routing

Switching a message which includes an address header

C370S471000, C370S474000, C340S870030, C340S870030

Reissue Patent

active

RE037494

ABSTRACT:

This invention relates to a transfer of messages in a multiplexed system.
More particularly, the invention relates to a method for the transfer of messages in a time multiplexed slotted environment such as a communications network. The network can be of the type disclosed in International Publication No. WO 86/03639 and that disclosure is incorporated herein by cross-reference.
Generally speaking, the invention provides an efficient method for the connectionless or connection oriented transfer of messages of arbitrary but finite length in a time multiplexed slotted environment with constrained destination resources.
The method provides for the efficient support of any type of addressing (short or extended, hierarchical or non-hierarchical) in the one environment, even in a system with short slots.
In the one environment, the method can guarantee delivery of messages or provide a more efficient transfer at the expense of occasional message loss. In either case, there are minimal communication overheads and the utilisation of destination resources is maximised. Thus the method provides a wide range of options and considerable scope for achieving a range of performance-cost objectives.
BACKGROUND ART
In the data communications environment, information is generally exchanged in units called packets. These consist of an overhead necessary for the control and addressing of the unit through the data switch and of the actual information. Typically the size of the information unit is not fixed but depends upon the message and the amount of information to be transferred.
Early packet switches handled the variable length packets as a whole unit, allocating all its communication resource to the transfer of the packet until its completion. There are a number of new packet switch designs emerging that switch only small fixed length slots. These switches are commonly referred to as Fast Packet Switches. Such switches are an improvement since they are generally simpler, may operate at higher speeds and allow for the support of real-time traffic.
If the Fast Packet Switch is to carry packet communications of variable length then it is necessary that the original packet message be segmented for transmission over the switch and reassembled at the destination. The segmentation function is relatively simple only requiring that the message be divided into units of size equal to or smaller than the slot size. The transmission of the segments over the packet switch however requires much more since it is necessary that the destination can receive and order all of the segments of the message. Thus it is required that there be a logical association between all of the slots of a single message. The reassembly function then reconstructs the original variable length message from all of the received segments. Special care may need to be taken in the reassembly function to allow for the possibility that more than one message may need to be reassembled concurrently.
Some schemes have been developed to perform the segmentation and reassembly function. However, these are limited either in the efficiency of the transport in the switch or in the performance of the reassembly function. The efficiency of the transport is typically limited by the overheads that are carried on each slot. These overheads are required to route the slot to the destination and to control the reassembly of the message at the destination. An example of this is the Slotted Ring protocol where 13 bytes of overhead are required in each slot as described in I.E.E.E. 802.6 Draft Standard Proposal “Slotted Ring” Sept. 1986. The overheads in that case include addressing, sequence indication, and length indication.
The problem with the slot overhead is compounded by addressing requirements. The common address field sizes used in data communications are 16 to 48 bits. With 48 bit addressing there is an overhead of 12 bytes per slot (source and destination address) in addition to the reassembly overheads. This approach to segmentation is clearly inefficient with small (less than 32 bytes) slot sizes.
The overhead problem can be reduced by logically associating the segments of the same message by the use of a count scheme, as suggested in an article by K. Yukimatsu, N. Watanabe, T. Honda “Multicast Communication Facilities in a High Speed Packet Switching Network”, Proc. ICCC 86 Munich Sept. 1986. pp 276-281. In this approach the segments of the message are transmitted with a two octet i.e. 16 bits overhead, a count field. The count field gives the number of slots separation between two consecutive segments of the same message. By the use of this count the destination can determine all slots of the message. The limitation with this approach is that the number of slots between consecutive segments of the message is limited by the maximum value of the count field. Also, in the case of a multiple access switch, the source cannot transmit more than one message at a time. This reduces the efficiency of transfer when connection orientated reassembly schemes are used.
BRIEF DESCRIPTION OF THE INVENTION
According to the present invention there is provided a method of transmitting variable length messages on a network from a source to a destination in fixed length slots which include a header field and a message segment, said method including the steps of providing a source identifier field in the header field of each slot, said source identifier field including a source identifier code which is uniquely associated with the message to be transmitted, transmitting the slots on the network, and controlling the reassembly of slots at the destination in accordance with the source identifier codes of the slots received at the destination.
The invention also provides an apparatus for transmitting variable length messages on a network from a source to a destination in fixed length slots said apparatus including:
a segmentation machine for segmenting the message into fixed length slots which include a header field and a message segment, said machine including coding means for providing a source identifier field in the header of each slot, said source identifier field including a source identifier code which is uniquely associated with the message to be transmitted, and a reassembly machine located, in use, at the destination, said reassembly machine including control means for controlling reassembly of slots in accordance with the source identifier codes of the slots.


REFERENCES:
patent: 3988545 (1976-10-01), Kuemmerle et al.
patent: 4156798 (1979-05-01), Doelz
patent: 4168469 (1979-09-01), Parikh et al.
patent: 4225919 (1980-09-01), Kyu et al.
patent: 4354252 (1982-10-01), Lamb et al.
patent: 4369443 (1983-01-01), Giallanza et al.
patent: 4379946 (1983-04-01), Mizuno et al.
patent: 4410889 (1983-10-01), Bryant et al.
patent: 4517669 (1985-05-01), Freeburg et al.
patent: 4570257 (1986-02-01), Olson et al.
patent: 4703475 (1987-10-01), Dretzka et al.
patent: 4774706 (1988-09-01), Adams
patent: 0055674 (1982-07-01), None
patent: 0079426 (1983-05-01), None
patent: 0212701 (1987-03-01), None
patent: 1326569 (1973-08-01), None
patent: 1427662 (1974-10-01), None
Conference Record from International Conference on Communications, Gadre, “Comparison of multiple access protocols for packet switching in satellite-switched multi-beamsystems,” Jun. 18-20, 1980, Department of Electrical Engineering, Columbia University, New York, N.Y.; 8 pp.
Conference literatue from IEEE Infocom '86, Pavey et al., “A Performance Evaluation of the PDAMA Satellite Access Protocol” Apr. 8-10, 1986, E-Systems, Inc., ECI Division, St. Petersburg, FL; 12 pp.
Literature from IEEE International Conference on Communications '88, Wong et a;., “The Controlled-SRMA Protocol for Packet Satellite Communication”, Jun. 12-15, 1988, Department of Electronics, The Chinese University of Hong Kong, Shatin, Hong Kong, 9 pp.
Literature, Chitre, “Capacity Allocation Scheme for Transmission of Packerts Over Satelitte Links”, 1983, Communications Satellite Corporation 1983, 20 pp.
Literature, Benelli et al.,

Affiliated with

Also associated with

Rating

Transfer of messages in a multiplexed system does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Transfer of messages in a multiplexed system, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Transfer of messages in a multiplexed system will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2849722