Multiplex communications – Pathfinding or routing – Store and forward
Reexamination Certificate
1999-09-28
2002-10-08
Yao, Kwang Bin (Department: 2664)
Multiplex communications
Pathfinding or routing
Store and forward
Reexamination Certificate
active
06463070
ABSTRACT:
BACKGROUND OF THE INVENTION
I. Field of the Invention
This invention relates generally to communication systems. More specifically, the invention relates to a communication system having multiple processors to process data.
II. Description of the Related Art
The use of wireless communication systems for the transmission of digital data is becoming more and more pervasive. In a typical wireless system, a digital data network is connected to a plurality or remote units via a hub station and satellite. The satellite receives signals from the remote units and forwards them to the hub station. The hub station then transmits the signals to the digital data network. The path from the remote units to the digital network is referred to as a reverse link.
According to the prior art, each processor in the hub station is assigned to service a fixed group of channel buffers. In order to prevent overflow of the channel buffers, the processing resources of the processor assigned to a group of channel buffers must exceed the worst case expected processing demands of the group of channel buffers. However, by providing a processor which has more processing resources than the worst case processing demand of the group of channel buffers to which it is assigned, some of the processor's resources will remain unutilized at all times. When as the number of groups of channels increases, the unutilized processor resources increases proportionately. In some cases, the cumulative unutilized processing resources in a system can exceed the processing resources provided by multiple processors.
For example, in a system in which the worst case processing demands of a group of 3 channel buffers is 2.1 Mega-instructions per second and the processor assigned to service the group of channel buffers is 2.5 Mega-instructions per second, 400 kila-instuctions per second of the processor's resources remain unutilized at all times. If the same system has 300 channel buffers, 100 processors are used to service 100 groups of channels. In such a case, the cumulative unutilized processing resource is 40 Mega-instructions per second or the equivalent processing power of about 16 processors. Such extravagant under-utilization of processing resources increases the cost, power consumption, size and heat dissipation requirements of the system.
Therefore, there is a need for a system and method of reducing the amount of un-utilized processing power that are present in the hub station, yet ensuring that data communications being routed through the hub station are handled in a timely manner.
SUMMARY
One embodiment of the invention includes a system comprising a communication system, comprising at least one remote unit, a satellite in operable communication with the at least one remote unit, a hub station in operable communication with the satellite, the hub station comprising a plurality of channel buffers for storing databits received from the satellite at the hub station, each of the channel buffers having an associated last-processed time, and a plurality of processors, wherein each of the processors respectively analyzes each of the plurality of channel buffers, and wherein each of the plurality of processors determines with respect to a currently selected channel buffer whether the currently selected channel buffer has sufficient amount of databits to process, the determining comprising determining a current time, and determining whether the difference in time between the current time and the last-processed time associated with the currently selected channel buffer is greater than a threshold, and wherein each of the processors processes the databits upon the determination that the currently selected channel buffer for the processor has a sufficient amount of databits to process, and wherein the each of the processors determines whether the databits have been processed by another one of the processors by performing a compare/exchange command with respect to the last-processed time that is associated with the selected channel buffer.
Another embodiment of the invention includes a method of identifying one or more databits for processing in a communication system, the method comprising successively storing one or more databits in a channel buffer, wherein the databits collectively comprise a data stream, determining a data rate for the data stream, determining a start location in the channel buffer, the art of determining based at least in part upon the data rate, a last-processed time that is associated with the channel buffer, and the size of the channel buffer, and determining an end location in the channel buffer.
Yet another embodiment of the invention includes a system for identifying one or more databits for processing in a communication system, the system comprising means for successively storing one or more databits in a channel buffer, wherein the databits collectively comprise a data stream, means for determining a data rate for the data stream, means for determining a start location in the channel buffer, the determining means acting based at least in part upon the data rate, a last-processed time that is associated with the channel buffer, and the size of the channel buffer, and means for determining an end location in the channel buffer.
REFERENCES:
patent: 3611435 (1971-10-01), Cooper
patent: 3818453 (1974-06-01), Schmidt et al.
patent: 4543574 (1985-09-01), Takagi et al.
patent: 4545061 (1985-10-01), Hileman
patent: 4555782 (1985-11-01), Alaria et al.
patent: 4736371 (1988-04-01), Tejima et al.
patent: 4763325 (1988-08-01), Wolfe et al.
patent: 4774707 (1988-09-01), Raychaudhuri
patent: 4811200 (1989-03-01), Wagner et al.
patent: 4837786 (1989-06-01), Gurantz et al.
patent: 4841527 (1989-06-01), Raychaudhuri et al.
patent: 4868795 (1989-09-01), McDavid et al.
patent: 4974223 (1990-11-01), Ancheta et al.
patent: 5012469 (1991-04-01), Sardana
patent: 5121387 (1992-06-01), Gerhardt et al.
patent: 5159592 (1992-10-01), Perkins
patent: 5166929 (1992-11-01), Lo
patent: 5172375 (1992-12-01), Kou
patent: 5216427 (1993-06-01), Yan et al.
patent: 5218680 (1993-06-01), Farrell et al.
patent: 5239677 (1993-08-01), Jasinski
patent: 5276703 (1994-01-01), Budin et al.
patent: 5297144 (1994-03-01), Gilbert et al.
patent: 5345583 (1994-09-01), Davis
patent: 5381443 (1995-01-01), Borth et al.
patent: 5384777 (1995-01-01), Ahmadi et al.
patent: 5420864 (1995-05-01), Dahlin et al.
patent: 5448706 (1995-09-01), Fleming et al.
patent: 5471473 (1995-11-01), Tejima
patent: 5485464 (1996-01-01), Strodtbeck et al.
patent: 5490087 (1996-02-01), Redden et al.
patent: 5537397 (1996-07-01), Abramson
patent: 5539730 (1996-07-01), Dent
patent: 5541924 (1996-07-01), Tran et al.
patent: 5550992 (1996-08-01), Hashimoto
patent: 5566168 (1996-10-01), Dent
patent: 5570355 (1996-10-01), Dail et al.
patent: 5577024 (1996-11-01), Malkamaki et al.
patent: 5586121 (1996-12-01), Moura et al.
patent: 5596581 (1997-01-01), Saeijs et al.
patent: 5612703 (1997-03-01), Mallinckrodt
patent: 5613195 (1997-03-01), Ooi
patent: 5615212 (1997-03-01), Ruszczyk et al.
patent: 5621752 (1997-04-01), Antonio et al.
patent: 5638361 (1997-06-01), Ohlson et al.
patent: 5642354 (1997-06-01), Spear
patent: 5644576 (1997-07-01), Bauchot et al.
patent: 5651009 (1997-07-01), Perreault et al.
patent: 5652892 (1997-07-01), Ugajin
patent: 5673322 (1997-09-01), Pepe et al.
patent: 5677909 (1997-10-01), Heide
patent: 5678208 (1997-10-01), Kowalewski et al.
patent: 5696903 (1997-12-01), Mahany
patent: 5704038 (1997-12-01), Mueller et al.
patent: 5706278 (1998-01-01), Robillard et al.
patent: 5719867 (1998-02-01), Borazjani
patent: 5732328 (1998-03-01), Mitra et al.
patent: 5734833 (1998-03-01), Chiu et al.
patent: 5745485 (1998-04-01), Abramson
patent: 5758088 (1998-05-01), Bezaire et al.
patent: 5768254 (1998-06-01), Papadopoulos et al.
patent: 5774467 (1998-06-01), Herrera Van Der Nood et al.
patent: 5790533 (1998-08-01), Burke et al.
patent: 5790535 (1998-08-01), Kou
patent: 5790551 (1998-08-01), Chan
patent: 5790939 (1998-08-01), Malcolm et al.
patent: 5790940 (1998-0
Carneal Bruce L.
Lee Christopher M.
Jones Prenell
Knobbe Martens & Olson Bear LLP.
Tachyon, Inc.
Yao Kwang Bin
LandOfFree
System and method for clock correlated data flow in a... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with System and method for clock correlated data flow in a..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System and method for clock correlated data flow in a... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2927671