US5327428A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Collision-free insertion and removal of circuit-switched channels in a packet-switched transmission structure
Assignee: International Business Machines Corp
•
Filing: 1991-10-07
•
Granted: 1994-07-05
•
Expires: 2011-10-07
Abstract
Abstract This invention relates to a method and system for a collision free insertion and removal of circuit-switched channels in a self-adaptive transmission data structure carrying different classes of packet-switched traffic on a slotted Local Area Network (LAN). This network may have bus or ring topology. The different classes of traffic are asynchronous traffic (packet-switched), synchronous traffic (packet-switched, time sensitive), isochronous traffic (circuit-switched), and signalling on demand. The inventive self-adaptive transmission data structure permits an economic, flexible and bandwidth efficient integration of these different classes of traffic.
Inventors
- 👤 Harmen Van As
- 👤 Wolfram W. Lemppenau
- 👤 Erwin A. Zurfluh
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-27 11:48
CPC Classifications
H; H04; H04L; H04L12/00; H04L12/64; H04L12/6418; H04L2012/6424; H04L2012/6427; H04L2012/6445; H04L2012/6448; H04L2012/6462; H04L2012/6486
Claims Analysis
Total Claims: 21
Claim 1
Independent Claim
313 words
Data transmission method for different classes of traffic with different synchronization and/or delay requirements (multi-media communication), in a network comprising stations and interconnection media which carries information organized into slots of constant size and with predefined framing periods for circuit-switched (CS) transmission, said media carrying asynchronous, synchronous, and circuit-switched slots and signalling traffic, comprising the following steps: for asynchronous traffic (delay insensitive data traffic) embedding said asynchronous slots between a start-end delimiter pair characterizing and controlling said asynchronous traffic and indicating an address, and, if required, using a first insertion buffer means for delaying or bypassing said synchronous slots in said stations, for synchronous traffic (delay sensitive data traffic) embedding said synchronous slots between a start/end delimiter pair characterizing and controlling said synchronous traffic and indicating an address, and, if required, using a second insertion buffer means for delaying or bypassing said synchronous slots in said stations, for signalling traffic, which is inserted on demand, embedding signalling slots between a start/end delimiter pair characterizing and controlling the type of signalling and indicating an address, and delaying or bypassing it, if required, by using a third insertion buffer means, for circuit-switched traffic embedding circuit-switched slots, having individual channel sizes, between a start/end delimiter pair characterizing and controlling said circuit-switched traffic and containing a channel identifier, said circuit-switched slots being released instantaneously in every framing period by any of the stations as at a free allocatable position, and bypassing said first, second and third insertion buffer means, such that said circuit-switched traffic is transmitted in said free allocated position, fixed during at least one framing period, and permeated by asynchronous, synchronous and signalling traffic, and that the asynchronous, synchronous and signalling traffic are delayed or bypassed in accordance to a given hierarchy, and that the transmission of traffic is adapted to the current traffic demand by dynamic allocation among said asynchronous, synchronous and signalling traffic.
Claim 2
Dependent Claim
313 words
Data transmission method for different classes of traffic with different synchronization and/or delay requirements (multi-media communication), in a network comprising stations and interconnection media which carries information organized into slots of constant size and with predefined framing periods for circuit-switched (CS) transmission, said media carrying asynchronous, synchronous, and circuit-switched slots and signalling traffic, comprising the following steps: for asynchronous traffic (delay insensitive data traffic) embedding said asynchronous slots between a start-end delimiter pair characterizing and controlling said asynchronous traffic and indicating an address, and, if required, using a first insertion buffer means for delaying or bypassing said synchronous slots in said stations, for synchronous traffic (delay sensitive data traffic) embedding said synchronous slots between a start/end delimiter pair characterizing and controlling said synchronous traffic and indicating an address, and, if required, using a second insertion buffer means for delaying or bypassing said synchronous slots in said stations, for signalling traffic, which is inserted on demand, embedding signalling slots between a start/end delimiter pair characterizing and controlling the type of signalling and indicating an address, and delaying or bypassing it, if required, by using a third insertion buffer means, for circuit-switched traffic embedding circuit-switched slots, having individual channel sizes, between a start/end delimiter pair characterizing and controlling said circuit-switched traffic and containing a channel identifier, said circuit-switched slots being released instantaneously in every framing period by any of the stations as at a free allocatable position, and bypassing said first, second and third insertion buffer means, such that said circuit-switched traffic is transmitted in said free allocated position, fixed during at least one framing period, and permeated by asynchronous, synchronous and signalling traffic, and that the asynchronous, synchronous and signalling traffic are delayed or bypassed in accordance to a given hierarchy, and that the transmission of traffic is adapted to the current traffic demand by dynamic allocation among said asynchronous, synchronous and signalling traffic.
Claim 3
Dependent Claim
56 words
The method of claim 1, wherein new circuit-switched slots are generated by a scheduler at connection set-up and inserted into the information stream carried on said media by allocating it into a position depending on a current circuit-switched traffic on said media by delaying or removing asynchronous or synchronous slots and delaying already existing circuit-switched slots.
Claim 4
Dependent Claim
29 words
The method of claim 1 or 2, wherein circuit-switched slots waiting for transmission in said scheduler, are inserted again into said media by delaying removing asynchronous and synchronous slots.
Claim 5
Dependent Claim
23 words
The method of claim 1 or 2, wherein already existing circuit-switched slots are removed from said media by inserting asynchronous and synchronous slots.
Claim 6
Dependent Claim
29 words
The method of claim 1 or 2, wherein insertion of circuit-switched slots is compensated by a complementary removal process of asynchronous and synchronous slots, providing for constant ring latencies.
Claim 7
Dependent Claim
17 words
The method of claim 1, wherein said network is a LAN (Local Area Network) with ring topology.
Claim 8
Dependent Claim
14 words
The method of claim 1, wherein said network is a LAN with bus topology.
Claim 9
Dependent Claim
26 words
The method of claim 1, wherein said predefined framing periods has the length of about 125 μs according to a sample rate of about 8 kHz.
Claim 10
Independent Claim
35 words
The method of claims 6 or 7 or 8, wherein said network has a latency according to N times 125 μs framing period for circuit-switched transmission, with N being an integer number greater than zero.
Claim 11
Dependent Claim
38 words
The method of claim 1, wherein several of said slots (50; 64) are converted into multi-slots (52; 63.1, 63.2) at a source station (61) and divided again into said slots (64) in the same or another station (62).
Claim 12
Dependent Claim
35 words
The method of claim 10, wherein each said multi-slot (52) is embedded between a start/end delimiter pair and each of said former slots (50) in said multi-slot (52) is preceeded by a synchronization header (53).
Claim 13
Dependent Claim
43 words
The method of claim 2, wherein said asynchronous traffic has the lowest level in said hierarchy, followed by synchronous and circuit-switched traffic such, that said circuit-switched traffic may by-pass said asynchronous and synchronous traffic, and said synchronous traffic may by-pass said asynchronous traffic.
Claim 14
Dependent Claim
12 words
The method of claim 12, wherein by-passing takes place on slot boundaries.
Claim 15
Dependent Claim
35 words
The method of claim 1, wherein said start delimiter is a start-delimiter Atomic-Data-Unit (ADU; 165) comprising at least a start delimiter control codeword (SDEL; 160), a slot type-(170), a busy/free (173), and a priority-indicator (171).
Claim 16
Dependent Claim
32 words
The method of claim 1, wherein said end delimiter is a end-delimiter Atomic-Data-Unit (ADU; 166) comprising at least an end delimiter control codeword (EDEL; 161), a slot type-(170), and a priority-indicator (171).
Claim 17
Dependent Claim
272 words
Network for the transmission of different classes of traffic with different synchronization and/or delay requirements (multi-media communication network), comprising stations (e.g. PCs, Hosts, telephones, telefax, . . . ) and interconnection media with slots of constant size and predefined framing periods, in particular 125 μs periods for circuit-switched (CS) transmission, one of said stations operating as a scheduler, all stations comprising: decoder means coupled to said interconnection media for recognizing to which class of traffic the following slot belongs, and for recognizing if the following slots are integrated into a multi-slot, payload receiver means (98) coupled to said decoder means for removing payload from said interconnection media if said decoder means recognizes that this station is the addressee, basic-slot regenerator means (95) having an input coupled to said decoder means and an output for regenerating multi-slots into slots (basic-slots), bypass means, coupled to said output, for circuit-switched traffic, delay means (92), coupled to said output, for asynchronous traffic, delay means (91), coupled to said output, for synchronous traffic, payload transmitter means for sending payload, multiplexing means (93), coupled to the bypass means, the delay means, the payload transmitter means and the interconnection media, for integrating by-passed circuit-switched, asynchronous, synchronous, and payload traffic into said interconnection media control means, coupled to said bypass means, delay means, payload transmitter means and multiplexing means, for organizing transmission and bypass/delay with regard to a given hierarchy, said station operating as a scheduler (100) further comprising: delay means for circuit-switched traffic (101), being inserted into said bypass means for circuit-switched traffic, slot/ADU (Atomic-Data-Unit) generator means (105), coupled to said multiplexing means, for the generation of new slots.
Claim 18
Dependent Claim
272 words
Network for the transmission of different classes of traffic with different synchronization and/or delay requirements (multi-media communication network), comprising stations (e.g. PCs, Hosts, telephones, telefax, . . . ) and interconnection media with slots of constant size and predefined framing periods, in particular 125 μs periods for circuit-switched (CS) transmission, one of said stations operating as a scheduler, all stations comprising: decoder means coupled to said interconnection media for recognizing to which class of traffic the following slot belongs, and for recognizing if the following slots are integrated into a multi-slot, payload receiver means (98) coupled to said decoder means for removing payload from said interconnection media if said decoder means recognizes that this station is the addressee, basic-slot regenerator means (95) having an input coupled to said decoder means and an output for regenerating multi-slots into slots (basic-slots), bypass means, coupled to said output, for circuit-switched traffic, delay means (92), coupled to said output, for asynchronous traffic, delay means (91), coupled to said output, for synchronous traffic, payload transmitter means for sending payload, multiplexing means (93), coupled to the bypass means, the delay means, the payload transmitter means and the interconnection media, for integrating by-passed circuit-switched, asynchronous, synchronous, and payload traffic into said interconnection media control means, coupled to said bypass means, delay means, payload transmitter means and multiplexing means, for organizing transmission and bypass/delay with regard to a given hierarchy, said station operating as a scheduler (100) further comprising: delay means for circuit-switched traffic (101), being inserted into said bypass means for circuit-switched traffic, slot/ADU (Atomic-Data-Unit) generator means (105), coupled to said multiplexing means, for the generation of new slots.
Claim 19
Dependent Claim
26 words
The network of claim 16, wherein more than one station comprises the additional parts of said scheduler, and one of these stations is operated as scheduler.
Claim 20
Dependent Claim
175 words
Network for the transmission of different classes of traffic with different synchronization and/or delay requirements (multi-media communication network), comprising stations (e.g. PCs, Hosts, telephones, telefax, . . . ) and interconnection media with slots of constant size and predefined framing periods, in particular 125 μs periods for circuit-switched (CS) transmission, at least one of said stations comprising: decoder means for recognizing if this station is the addressee, for recognizing to which class of traffic the following slot belongs, and for recognizing if the following slots are integrated into a multi-slot, payload receiver means (98) for removing payload from said interconnection media if said decoder means recognizes that this station is the addressee, basic-slot regenerator means (95) for regenerating multi-slots into slots (basic-slots), bypass means for circuit-switched traffic, delay means (92) for asynchronous traffic, delay means (91) for synchronous traffic, payload transmitter means for sending payload, multiplexing means (93) for integrating by-passed circuit-switched, asynchronous, synchronous, and payload traffic into said interconnection media, and control means for organizing transmission and bypass/delay with regard to a given hierarchy.
Claim 21
Dependent Claim
175 words
Network for the transmission of different classes of traffic with different synchronization and/or delay requirements (multi-media communication network), comprising stations (e.g. PCs, Hosts, telephones, telefax, . . . ) and interconnection media with slots of constant size and predefined framing periods, in particular 125 μs periods for circuit-switched (CS) transmission, at least one of said stations comprising: decoder means for recognizing if this station is the addressee, for recognizing to which class of traffic the following slot belongs, and for recognizing if the following slots are integrated into a multi-slot, payload receiver means (98) for removing payload from said interconnection media if said decoder means recognizes that this station is the addressee, basic-slot regenerator means (95) for regenerating multi-slots into slots (basic-slots), bypass means for circuit-switched traffic, delay means (92) for asynchronous traffic, delay means (91) for synchronous traffic, payload transmitter means for sending payload, multiplexing means (93) for integrating by-passed circuit-switched, asynchronous, synchronous, and payload traffic into said interconnection media, and control means for organizing transmission and bypass/delay with regard to a given hierarchy.
References Cited (Backward Citations)
US4638476A
Cited
GB2177878A
Cited
US4761781A
Cited
US4933934A
Cited
US4970719A
Cited
US4893306A
Cited
US4858232A
Cited
EP0343319A2
Cited
US5153578A
Cited
US5164938A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1997-07-04 | 1998-01-03 | 1998-07-05 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2001-07-04 | 2002-01-03 | 2002-07-05 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2005-07-04 | 2006-01-03 | 2006-07-05 | $7700.00 | Window Closed / Lapsed |