Multiplex communications – Channel assignment techniques – Combining or distributing information via time channels...
Reexamination Certificate
1997-09-04
2002-03-19
Hsu, Alpus H. (Department: 2662)
Multiplex communications
Channel assignment techniques
Combining or distributing information via time channels...
C370S447000, C370S461000, C370S462000
Reexamination Certificate
active
06359899
ABSTRACT:
BACKGROUND OF THE INVENTION
Contention-based networks, including local area networks such as Ethernet® networks, were originally designed with bursty data transmission in mind. More recently, such networks have been looked toward to support real-time applications such as voice and video. However, using contention-based networks to carry real-time traffic may be problematic because of such networks' inability to guarantee a maximum, or bounded, delay service and thus their inability to guarantee a desired level of service quality for real-time applications.
In order to address this issue, techniques have been proposed which give a certain degree of priority to real-time traffic. One approach is a pre-emptive approach wherein a station desiring to transmit a real-time packet simply comes on to the network's communications medium, e.g., coaxial cable, and transmits a fixed-length preamble. This causes a collision with any then existing traffic. Pursuant to conventional protocol schemes, the station that was transmitting the existing traffic ceases transmitting upon detecting that the collision occurred. At that point the real-time station which caused to collision simply continues with the transmission of its real-time packet. While serving to provide immediate access for the real-time station, this approach has the disadvantage that any packet that was being transmitted at the time of the collision will have to be retransmitted, thereby reducing the overall efficiency of the network. Moreover, the probability of such a collision increases with increasing network load, thereby increasing the number of collisions and further reducing efficiency at higher network loads.
A more efficient approach is that described for example, in I. Chlamtac, “An Ethernet Compatible Protocol for Real-Time Voice/Data Integration,”
Computer Networks and ISDN Systems
, 10 (1985), Elsevier Science Publishers B.V. (North-Holland), pp. 81-96, in which the various currently active real-time stations establish an order of transmission among themselves and use, for example, the notion of a succession, or chain, wherein the real-time stations transmit one after the other in a way which does not allow the medium to be perceived by the non-real-time stations as being idle. It is only after all the real-time stations have had an opportunity to transmit packets they then have ready that the medium again becomes idle, and thus available to any station then having data to send. See also, for example, Szabo, “An Ethernet compatible protocol to support real time traffic and multimedia applications,”
Computer Networks and ISDN Systems
, Vol. 29, page 335-42, 1997.
Disadvantageously, as more and more real-time stations are added to the chain, the average delay suffered by non-real-time traffic increases due to the reduced time available for such traffic; an increase in the duration of the continuous period over which the non-real-time stations are precluded from getting access to the medium; and an increase in the probability of collisions involving non-real-time stations once the stations of the chain have all finished transmitting. Indeed, given a desired maximum such delay, and especially at high network loads, an upper limit exists on the number of real-time stations that can be allowed to be simultaneously active.
SUMMARY OF THE INVENTION
Networks embodying the principles of the invention support the existence of multiple chains. This approach, we have found, allows the network to, in turn, support a higher level of traffic than when only a single chain is allowed, at least at high network loads, given any particular constraint on the acceptable delays for non-real-time traffic.
Preferred embodiments of the invention include a mechanism for enforcing the time separation between the various chains and also include a mechanism for enforcing a predetermined maximum number of stations that each chain can have, in order to allow non-real-time stations to obtain timely access to the medium. Moreover, preferred embodiments account for the fact that the time separation between any two of the chains, even if initially set at an amount which does provide for timely access for non-real-time stations, is subject to change over time due to such factors as stations becoming active and inactive and, in the case of non-pre-emptive systems, due further to the fact that the initiation of the access to the medium by a particular chain may be delayed by the presence of a non-real-time data transmission. In particular, preferred embodiments include mechanisms providing what we call “list maintenance,” this involving such actions as joining, or consolidating, chains when their time separation is less than a specified value (as long as the resulting chain does not exceed the above-mentioned length limit), and otherwise increasing to an acceptable value the separation of chains which are close together and not candidates for being joined. List maintenance also includes such actions as a) maintaining the various chains as near as possible to the aforementioned maximum size and b) recovering robustly from non-anticilated,interruptions,as taught in our co-pending U.S. patent application Ser. No. 08/923,302 filed of even date herewith.
REFERENCES:
patent: 5237695 (1993-08-01), Skokan et al.
patent: 5404353 (1995-04-01), Ben-Michael et al.
patent: 5519834 (1996-05-01), Kamerman et al.
patent: 5579486 (1996-11-01), Oprescu et al.
patent: 5663960 (1997-09-01), Le Guen et al.
patent: 5740174 (1998-04-01), Somer
patent: 5768350 (1998-06-01), Venkatakrishnan
patent: 5844890 (1998-12-01), Delp et al.
patent: 5875309 (1999-02-01), Itkowsky et al.
U.S. application Ser. No. 08/792,327, filed Mar. 8, 1996 by Krishnakumar et al., entitled “A Wireless Lan Distributed Access Procedure Providing Priority For Voice Transmissions.”.
I. Chlamtac, “An Ethernet Compatible Protocol for Real-Time Voice/Data Integration,”Networks and ISDN Systems10 (1985) 81-96, Elsevier Science Publishers B.V. (North Holland).
Krishnakumar Anjur Sundaresan
Sobrinho Joao Luis
Hsu Alpus H.
Lager Irena
Lucent Technologies - Inc.
Slusky Ronald D.
Weinick Jeffrey M.
LandOfFree
Priority access for real-time traffic in contention-based... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Priority access for real-time traffic in contention-based..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Priority access for real-time traffic in contention-based... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2835885