Arrangement for bounding jitter in a priority-based switching sy

Multiplex communications – Wide area network – Packet switching

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

370 79, 370 856, H04L 1254

Patent

active

052873471

ABSTRACT:
An arrangement where a switching system receives parameter(s) concerning the traffic expected on a call from a first user to a second user, the system determines a priority for the call based on the expected traffic parameter(s), and information is transmitted to the second user during the call based on the determined priority and with less than a maximum jitter. The priority is selected from a predefined priority table based on expected traffic parameters. The priority table is usable for both constant bit rate and statistical calls.

REFERENCES:
patent: 3428946 (1969-02-01), Batcher
patent: 4516238 (1985-05-01), Huang et al.
patent: 4912702 (1990-03-01), Verbiest
patent: 5016248 (1991-05-01), Kudoh
patent: 5040171 (1991-08-01), Osaki
patent: 5083269 (1992-01-01), Syobatake et al.
patent: 5121383 (1992-06-01), Golestani
patent: 5132966 (1992-07-01), Hayano et al.
patent: 5150358 (1992-09-01), Punj et al.
patent: 5179549 (1993-01-01), Joos et al.
H. Kuwahara et al., "A Shared Buffer Memory Switch for an ATM Exchange", IEEE Int'l. Conf. on Comms., vol. 1 (Jun. 11-14, 1989), pp. 4.4.1-4.4.5.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Arrangement for bounding jitter in a priority-based switching sy does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Arrangement for bounding jitter in a priority-based switching sy, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Arrangement for bounding jitter in a priority-based switching sy will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-1213037

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.