Transfer of messages in a multiplexed system

Abstract

A method and apparatus for transmitting variable length messages on a network in fixed length slots including the provision of a source identifier field in the header of each slot, the source identifier field including a code which is uniquely associated with the message to be transmitted. The fixed length slots are then transmitted on the network and reassembly of the slots by a reassembly machine is controlled in accordance with the identifier codes in the slot.

Description

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 communic...

AI Technical Summary

Benefits of technology

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 iden

Problems solved by technology

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.

The problem with the slot overhead is compounded by addressing requirements.

This approach to segmentation is clearly inefficient with small (less than 32 bytes) slot sizes.

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.

Images