Multiplex communications – Data flow congestion prevention or control
Reexamination Certificate
1999-03-16
2004-05-18
Vu, Huy D. (Department: 2665)
Multiplex communications
Data flow congestion prevention or control
C455S012100, C455S427000
Reexamination Certificate
active
06738346
ABSTRACT:
BACKGROUND OF THE INVENTION
1. Field of the Invention
This invention relates generally to a packet-switched satellite communication system and, more particularly, to a hiearchical downlink scheduler for a spot-beam processing satellite.
2. Discussion of the Related Art
A packet-switched network differs from a circuit-switched network in that the latter requires a physical circuit between communicating users. Thus, the circuit is committed, even if no information is being transmitted, until communcation ends between the users. Generally, the packet-switched concept avoids this inefficient use of a communication link resource by breaking communication into data packets (i.e., data cells) with address information, and then transmitting all of the data packets, regardless of source or destination, over the critical circuit. Routing is performed on the data packets as information passes between users.
Asynchronous transfer mode (ATM) is one of a class of packet-switching technologies that routes data packet traffic via an address contained within the packet. ATM is a fast packet or cell relay concept that uses a short (e.g., 53 byte) fixed-length cell to transmit information across networks. ATM is defined in the overall broadband ISDN standard by ANSI and ITU-T standards committees. While ATM is being deployed for terrestrial network systems, it is still an evolving technology within satellite communication systems.
In the context of satellite communication systems, an ATM-based satellite link has a limited number of circuits (e.g., uplinks and downlinks), and yet still handles large volumes of data packet traffic. An efficient and fair technique of passing the packets from the router (or cell switch) to the downlink is required in a satellite link. In this case, “efficient” refers to minimizing the downlink bandwidth that is unused among the various users and service classes, whereas “fair” refers to an approximate equal allocation of bandwidth to equal paying users. A scheduler for passing cells from the cell switch to the downlink modulator is the critical point for increasing the efficiency of the satellite link. There are several unique characteristics of a satellite system, such as hopping beams and different coding rates, which make the scheduler different from existing terrestial networks.
Therefore, it is desirable to provide an innovative hierarchical scheme for scheduling data cell throughput from the cell switch to the downlink modulator in a satellite system. A downlink scheduler implementing such a scheme will thus provide more efficient and fair scheduling of downlink resources, while maintaining certain Quality of Service guarantees. In addition, the scheduler enables real-time purchasing and selling of wholesale bandwidth based on the availability of resources and the demand of various customers.
SUMMARY OF THE INVENTION
In accordance with the present invention, a downlink scheduler is provided for scheduling the downlink transmission of data cells in a spot beam processing satellite. The downlink scheduler includes a beam selector for selecting one of the spot beams associated with the satellite, a plurality of wholesale selectors for selecting one of a plurality of wholesalers, such that each of the wholesale selectors is associated with one of the spot beams, and a plurality of retail selectors for selecting one of a plurality of retail connections, such that each of the retail selectors is associated with one of the wholesalers. The downlink scheduler then passes at least one data cell from a selected retail connection to a downlink modulator, thereby scheduling the downlink transmission of data cells in the satellite.
REFERENCES:
patent: 4491947 (1985-01-01), Frank
patent: 5736959 (1998-04-01), Patterson et al.
patent: 5850399 (1998-12-01), Ganmukhi et al.
patent: 5946602 (1999-08-01), Sayegh
patent: 5978363 (1999-11-01), Dimitrijevic et al.
patent: 6138261 (2000-10-01), Wilcoxson et al.
patent: 6233451 (2001-05-01), Noerpel et al.
patent: 6292659 (2001-09-01), Olds et al.
patent: 0820208 (1998-01-01), None
patent: 0889605 (1999-07-01), None
Jon C. R. Bennett and Hui Zhang; Hierarchical Packet Fair Queueing Algorithms; Proc. of the AMC-SIGCOMM 96, Palo Alto CA., Aug. 1996, pp. 143-156.*
Jon C. R. Bennett and Hui Zhang;Hierarchical Packet Fair Queueing Algorithms; Proc. of the AMC-SIGCOMM 96, Palo Alto CA., Aug. 1996, pp. 143-156.
Anujan Varma and Dimitrios Stiliadis;Hardware Implementation of Fair Queuing Algorithms for Asynchronous Transfer Mode Networks, IEEE Communications Magazine, Dec. 1997, p. 54-68.
Toutain, F.,Decoupled Generalized Processor Sharing: A Fair Queueing Principle for Adaptive Multimedia Applications, INFOCOM 1998, Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies, Proceedings IEEE, San Francisco, CA, USA, Mar. 29-Apr. 2, 1998, New York, NY, USA, pp. 291-298.
Bennett, Jon C. R.,WF2 Q:Worst-Case Fair Weighted Fair Queueing, Proceedings of IEEE INFOCOM 1996, Conference on Computer Communications, Fifteenth Annual Joint Conference of the IEEE Computer and Communications Societies, Networking the Next Generation, San Francisco, CA, USA, Mar. 24-28, 1996, vol. 1, Conf. 15, pp. 120-128.
Ohba, Yoshihiro,QLWFQ: A Queue Length Based Weighted Fair Queueing Algorithm in ATM Networks, INFOCOM 1997, Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies, Driving the Information Revolution, Proceedings IEEE, Kobe, Japan, Apr. 7-11, 1997, Los Alamitos, CA, USA, IEEE Comput. Soc., pp. 566-575.
Shrredhar, M. and George Varghese,Efficient Fair Queuing Using Deficit Round-Robin, IEEE, ACM Transactions on Networking, IEEE Inc., New York, USA, vol. 4, No. 3, Jun. 1, 1996, pp. 375-385.
Suri, Subhash, George Varghese and Girish Chandranmenon,Leap Forward Virtual Clock: A New Fair Queuing Scheme with Guaranteed Delays and Throughput Fairness, INFOCOM 1997, Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies, Driving the Information Revolution, Proceedings IEEE, Kobe, Japan, Apr. 7-11, 1997, Los Alamitos, CA, USA, IEEE Comput. Soc., pp. 557-565.
Kincaid Jason R.
Prieto, Jr. Jaime L.
Miller John A.
Northrop Grumman Corporation
Philpott Justin M
Vu Huy D.
Warn, Burgess & Hoffmann, P.C.
LandOfFree
Hierarchical downlink scheduler for a processed satellite... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Hierarchical downlink scheduler for a processed satellite..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Hierarchical downlink scheduler for a processed satellite... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3195848