Title of Invention

MULTI-LEVEL SCHEDULING METHOD SUPPORTING MULTIPLE PORTS AND MULTIPLE SERVICES

Abstract

A method supporting the multilevel schedule of multi-port and multi-traffic, includes: configuring the second-level queues of A, B, C traffic level in the user's port of the single resilient packet ring device, storing the data frames received by the user's port in the corresponding second-level queues according to the traffic classification identification; two-level scheduling the second-level queues in the user's port by using 'first the traffic level scheduling then the port weight scheduling'; sending the data frames that have been two-level scheduled to the first-level queues of A,B,C traffic level; ring scheduling the three kinds traffic of the first-level queues in the resilient packet ring. The present invention effectively resolves the schedule, which occurs when the traffic on the multiple user's ports need to be sent to the resilient packet ring and A, B, C traffic reach to each user's port at the same time. The present invention also satisfies the requirement of first scheduling the A traffic, then the B traffic, finally the C traffic, and consequently ensures the requirement of time delay and time delay jitter for A traffic and B traffic.

Full Text

FORM 2 THE PATENTS ACT, 1970 (39 of 1970) & THE PATENTS RULES, 2003 COMPLETE SPECIFICATION (See section 10, rule 13) MULTI-LEVEL SCHEDULING METHOD SUPPORTING MULTIPLE PORTS AND MULTIPLESERVICES" ZTE CORPORATION., of ZTE Plaza, Keji Road South, HiTech Industrial Park, Nanshan District, Shenzhen City, Guangdong Province 518057, P.R. China The following specification particularly describes the invention and the manner in which it is to be performed. 1 ZKsngli Lau Office FAX NO- :G&391199 Mar. 0? 2006 13:39 P3 Multi-level scheduling method supporting multiple ports and multiple services Field of the invention The present invention relates to data frame communication technology, specifically to the Resilient Packet Ring (abbreviated as RPR) technology in a metropolitan area network, and more specifically to the scheduling method of a RPR device with multiple user side ports and each user side ports supporting multiple services. Background of the invention The Resilient Packet Ring technology is a newly-emerged technology* the purpose of which is to build a data frame communication network where the bandwidth can be multiplexed, and each node has a fair algorithm to ensure the bandwidth occupancy, and with the capabilities of ring protection and QOS (Quality of Service), and is mainly directed to metropolitan area backbone ring networks and metropolitan area access ring network. In December 2000, the IEEE specifically set up an IEEE 802.17 standard group to formulate an IEEE 802.17 MAC (Media Access Control) level standard which is based on the RPR technology and capable of building a resilient packet ring. The key characteristic of the RPR technology is to classify all traffic into three classes: Class A is that of real time traffic; Class B is divided into two portions, with the B-CIR (committed information rate) being that of traffic of a guaranteed rate level, and the B-EIR (excess information rate) being that of traffic exceeding a guaranteed rate level; and Class C is that of best effort traffic. These three classes of traffic are distinguished by the ZhongzHLaid Office FftX NO. :66091199 Mar. 07 2006 13:39 P4 ServiceClass defined in the frame structure. The traffics to enter a RPR ring from an individual RPR node are shaped and scheduled according to their respective classes of A, B, or C, and then enter the RPR ring. As shown in Fig. 1, a RPR device typically comprises 2 RPR ring side ports and a set of user side ports, and the frames entering or leaving through the RPR ring side ports are RPR MAC frames having the traffic class IDs of A, B» or C, while the user side ports are mostly Ethernet ports, the frames entering or leaving through which are Ethernet frames with no traffic class IDs of A, B, or C within the frame structure. Multiple RPR devices are formed into a RPR through their RPR ring side ports. The user side ports of a prior art RPR device have no queues, and when a data frame enters a user side port, after some forwarding operation, it enters the A/B/C queue of a RPR ring, and then goes through the standard shaping and scheduling operations, eaters a pending send queue, and finally enters a RPR ring, as shown in Fig. 2. There are several problems in the above method of scheduling processing of frames received in the user side ports: Firstly, now that there are often multiple user side ports in a RPR device, the case may occur where some port has heavy traffic and some other port has light traffic, and in the prior art the scheduling is typically performed in a first-come first-serve manner, which may lead to a situation where the port with slight traffic is starved. Secondly, the traffic entering from a certain user side port may be Class A or B or C traffic, and if a large amount of Class C traffic enters first and Class A traffic enters subsequently, according to the first-come first-serve principle, a large amount of Class C traffic with lower priority will be processed first, and the Class A traffic with higher priority will only be processed after the Class C traffic has been processed, thus the problem of delay and delay jitter of Class A traffic cannot be solved. 3 -ROM :^hc^ngzi-LLau. Office FPX NO. :66091199 Mar. 07 2006 13:40 P5 Summary of the invention The technical problem to be solved by the present invention is to provide a multi-level scheduling method supporting multi-ports and multi-services, which is directed to overcome the drawback of the prior art unreasonable traffic scheduling among ports when the RPR device has multiple user side ports, in order to better meet the requirements of the RPR. The multi-level scheduling method supporting multi-ports and multi-services proposed in the present invention comprises the following steps: providing second level queues of traffic classes A, B, and C at each user side port of an individual RPR device, the data frames received at the user side port to be placed in the respective second level queues according to their traffic class IDs; performing a two level scheduling consisting of firstly traffic class scheduling and then port weight scheduling on the second level queues of the user side port; the data frames after the two level scheduling entering into first level queues of traffic classes A, B, and C respectively; and performing a RPR insert scheduling on the three classes of traffic in the first level queues. The minimum bandwidths of the three classes A, B and C of traffic allowed to be entered into the RPR ring from each user side port is configured by a user. The traffic class scheduling is performed in the priority order that class A traffic takes priority over class B traffic, and class B traffic takes priority over class C traffic; the port weight scheduling is performed I 2hon9iiLLaw Office FAX NO. :66091199 Mar. 07 2006 13:40 P6 according to the weight values of the respective classes of traffic of the respective user side ports. The weight value is derived from the ratio between the minimum bandwidth of class A, B or C traffic at a user side port and the bandwidth of the same class of traffic at all the user side ports of the RPR device. The weight values of different classes of traffic can be different. The step of performing a two level scheduling on the second level queues specifically comprises: Step 1, querying one by one whether the second level queues of traffic class A of the user side ports are empty, and if so, performing Step 2; otherwise proceeding to Step 3; Step 2, determining whether this user side port is the last user side port, and if so, proceeding to Step 5; otherwise returning to Step 1, querying the second level queue of traffic class A of the next user side port; Step 3, according to the weight value of class A traffic of the user side port, scheduling the class A traffic in the second level queue into the first level queue of traffic class A; Step 4, determining whether the first level queue of traffic class A is full, and if no, proceeding to Step 2; if yes, proceeding to Step 5; Step 5, querying one by one whether the second level queues of traffic class B of the user side ports are empty, and if so, performing Step 6; otherwise, proceeding to Step 7; Step 6, determining whether the user side port is the last user side port, and if so, proceeding to Step 9; otherwise returning to Step 5, querying the second level queue of traffic class B of the next user side port; Step 7, according to the weight value of class B traffic of the user side port, scheduling the class B traffic in the second level queue into the first level queue of traffic class B; 1 troy wn -^6091199 Mar. 07 2006 13:40 P7 £hongziu Law Office FAX NO. -66091199 Step 8, determining whether the first level queue of traffic class B is full, and if no, proceeding to Step 6; if yes, proceeding to Step 9; Step 9, querying whether the second level queues of traffic class C of the user side ports are empty, and if so, performing Step 10; otherwise, proceeding to Step 11; Step 10, determining whether the user side port is the last user side port, and if so, proceeding to Step 1; otherwise returning to Step 9, querying the second level queue of traffic class C of the next user side port; Step 11, according to the weight value of class C traffic of the user side port, scheduling the class C traffic in the second level queue into the first level queue of traffic class C; Step 12, determining whether the first level queue of traffic class C is full, and if no, proceeding to Step 10; if yes, proceeding to Step 1. The step of performing the insert scheduling on the three classes of traffic in the first level queues further comprises: shaping die three classes of traffic respectively, and then scheduling the data frames of the respective traffics to be outputted into the corresponding RPR ring. The shaping and scheduling are performed in the order that class A traffic takes priority over class B traffic, and class B traffic takes priority over class C traffic; The shaping is to shape the traffic of the corresponding class in the first level queues according to the credit value of each class of traffic. The credit value of each class of traffic is determined by the total bandwidth of class A, B, or C traffic allowed to enter into the RPR ring from the RPR device. The total bandwidth of class A, B or C traffic allowed to enter into the RPR ring from an individual RPR device is configured by users. The steps of the insert scheduling specifically comprises: FROM :ZhcingzitLau Office FPX NO. :66091199 Mar. 07 2006 13:41 P8 Step 1, shaping the class A traffic in the first level queue according to the credit value of class A traffic, consuming the corresponding credit value; Step 2, scheduling the shaped data frames of class A traffic to be outputted into the RPR ring; Step 3, determining whether the credit value of class A traffic is consumed up, and if no, returning to Step 1; if yes, suspending the shaping and scheduling of class A traffic, and performing Step 4; Step 4, shaping the class B traffic in the first level queue according to the credit value of class B traffic, consuming the corresponding credit value; Step 5, scheduling the shaped data frames of class B traffic to be outputted into the RPR ring; Step 6, determining whether the credit value of class B traffic is consumed up, and if no, returning to Step 4; if yes, suspending the shaping and scheduling of class B traffic, and performing Step 7; Step 7, shaping the class C traffic in the first level queue according to the credit value of class C traffic, consuming the corresponding credit value; Step 8, scheduling the shaped data frames of class C traffic to be Outputted to the RPR ring; Step 9, determining whether the credit value of class C traffic is consumed up, and if no, returning to Step 7; if yes, suspending the shaping and scheduling of class C traffic, and performing Step 1. The present invention, by providing the second level queues of three traffic classes A, B and C, and providing a two level scheduling mechanism where first a traffic class scheduling and then a port weigh scheduling are performed on the respective second level queues, is able to meet the 1. A resilient packet ring device supporting multi-level scheduling of data traffic, said device comprising: plurality of user side ports (port 1 to port N) receiving data; a secondary level queuing unit of traffic classes A, B and C being coupled to said each user side port for receiving the data frames and placing the same in respective second level queues according to their traffic IDs; a secondary level scheduling unit for scheduling the frames contained in the second level queues based firstly on traffic class and then based on port weight; a first level queuing unit receiving the data frames from the said second level scheduling unit and entering the same into first level queues of traffic classes A, B and C respectively; a first level scheduling unit for performing insert scheduling in the three classes of traffic in the first level queues, and a ring side port operatively connected to the first level queues for transmitting the queued data frames. 2. The resilient packet ring device as claimed in claim 1, wherein the minimum bandwidths of the three classes A, B and C of traffic allowed to be entered into the RPR ring from each user side port is configurable by users. 3. The resilient packet ring device as claimed in claim 1, wherein the secondary level scheduling unit performs the traffic class scheduling in the priority order that class A traffic takes priority over class B traffic, and class B traffic takes priority over class C traffic; the code weight scheduling is performed according to the weight values of the respective classes of traffic of the respective user side ports. 4. The resilient packet ring device as claimed in claim 1, wherein the weight value is derived from the ratio between the minimum bandwidth of class A, B or C traffic at the user side port and the bandwidth of the same class of traffic at all the user side ports of the RPR device. 5. The resilient packet ring device as claimed in claim 1, wherein the weight value of different classes of traffic can be different. 8 priority order that the class A traffics entering the ports are scheduled firstly, the class B traffics are scheduled secondly, and the class C traffics are scheduled finally, thus guaranteeing the delay and delay jitter requirements of class A traffic and class B traffic, and at the same time eliminating the starving phenomenon of the ports when they have the same class of traffic. The present invention effectively solves the scheduling policy in case where traffics of multiple user side ports need to enter the RPR ring, and each user side port has traffics of the three classes A, B and C at the same time. The present invention also provides a resilient packet ring device supporting multi-level scheduling of data traffic, said device comprising: plurality of user side ports (port 1 to port N) receiving data; a secondary level queuing unit of traffic classes A, B and C being coupled to said each user side port for receiving the data frames and placing the same in respective second level queues according to their traffic IDs; a secondary level scheduling unit for scheduling the frames contained in the second level queues based firstly on traffic class and then based on port weight; a first level queuing unit receiving the data frames from the said second level scheduling unit and entering the same into first level queues of traffic classes A, B and C respectively; a first level scheduling unit for performing insert scheduling in the three classes of traffic in the first level queues, and a ring side port operatively connected to the first level queues for transmitting the queued data frames. In an embodiment of the present invention, the minimum bandwidths of the three classes A, B and C of traffic allowed to be entered into the RPR ring from each user side port is configurable by users Ip another embodiment of the present invention, the secondary level $ scheduling unit performs the traffic class scheduling in the priority order that class A traffic takes priority over class B traffic, and class B traffic takes priority over class C traffic; the code weight scheduling is performed according to the weight values of the respective classes of traffic of the respective user side ports. In yet another embodiment of the present invention, the weight value is derived from the ratio between the minimum bandwidth of class A, B or C traffic at the user side port and the bandwidth of the same class of traffic at all the user side ports of the RPR device. In still another embodiment of the present invention, the weight value of different classes of traffic can be different. Description of the Drawings Fig. f is a schematic diagram of a RPR device; Kg. 2 is a schematic diagram of the framework of the prior art traffic scheduling; Fig. 3 is a schematic diagram of the multi-level scheduling of the present invention; Fig. 4 is a flow diagram of receiving traffic data frames of the present invention; Fig. 5 is a flow diagram of performing two-time' scheduling on the second level queues of the respective traffics of the present invention; and Fig.6 is a flow diagram of performing the insert scheduling of the present invention. Implementation pf the invention The technical solution of the present invention will be described below with reference to the accompanying drawings and embodiments. Fig. 1 and Fig. 2 in an introduction to the prior art, which has been described in detail in the background section above, and will not be FROM :Zhongzi Law Office FAX NO. :66091199 Mar. 07 2036 13:42 P10 repeated here. As shown in Fig. 3, at each user side port of the RPR device is provided three queues, as the second level queues of the three traffic classes A, B and C. The data frames received by the user side ports first enter the second level queues of the respective traffic classes, and a two level scheduling consisting of firstly traffic class scheduling and then port weight scheduling is performed on the data frames of various traffics in the second level queues, and the data frames after the two level scheduling enter into the first level queues of traffic classes A, B and C, and after being shaped by a shaper, the data frames enter into a pending send queue, and finally enter into the RPR ring. The total bandwidth of class A traffic, the total bandwidth of class B traffic, and the total bandwidth of class C traffic of an individual RPR device allowed to enter into the RPR ring, as well ^& the minimum bandwidth of class A traffic, the minimum bandwidth of class B traffic, the minimum bandwidth of class C traffic at each user side port allowed to enter into the RPR ring, can all be configured by users, wherein the sum of the minimum bandwidths of class A traffic allowed at each user side port is equal to the total bandwidth of class A traffic of the RPR device, and the same corresponding relationship holds true for class B traffic and class C traffic as well. The process flow of the user side ports receiving data frames is as shown in Fig. 4, where the respective user side port receives a data frame, then classify the data frame into the traffic class A, B or C according to the its class ID, and place the data frame into the second level queue of the corresponding traffic class belonging to the port The process flow of the two level scheduling is as shown in Fig. 5. Assuming that an individual RPR site has N user side ports, first the traffic 11 FROM :2hongzi Law D-Tfice FAX NO. :6G091199 Mar. 07 2006 13:42 Pll class scheduling of the first level is performed, that is, the scheduling is performed in the order of firstly class A traffic, then class B traffic, and finally class C traffic one by one. First, the second level queues of class A traffic of the user side ports 1-N are polled one by one, and if the polled second level queue of the current user side port is empty, the second level queue of class A traffic of the next user side port is polled subsequently, otherwise the traffic data frames in the second level queue of class A traffic of this user side port is scheduled into the first level queue of class A traffic according to the weight value of class A traffic of this user side port. The weight value of class A traffic is derived from the ratio between the bandwidth of class A traffic of the user side port as configured by a user and die bandwidth of class A traffic of the entire RPR device. If all the second level queues of class A traffic have been scheduled, or the first level queue of class A traffic is full, the scheduling of the second level queues of class B traffic is performed The scheduling method of the second level queues of class B traffic is the same as the above-described scheduling method of the second level queues of class A traffic, if all the second level queues of class B traffic have been scheduled, or the first level queue of class B traffic is full, the scheduling of the second level queues of class C traffic is performed. The scheduling method of the second level queues of class C traffic is the same as the above-described scheduling method of the second level queues of class A traffic. And the above steps are cycled through repeatedly. It should be noted that the port weight values of the three traffic classes A, B and C can be different. Fig. 6 depicts a flow diagram of the insert scheduling, wherein the normal RPR insert scheduling is performed on the traffics in the first level queues, including the shaping operation and scheduling process on the traffic data in the priority order of firstly class A traffic, then class B 12 _. FROM :ZKontjzi U. Office FQy kin .ccntn FAX NQ. :6609ligg M traffic, and finally class C traffic. As defined in the standard, traffic class A is further divided into class AO and class Al, wherein class AO is higher in priority, therefore when class A traffic is scheduled, the scheduling is performed in the order of firstly class AO traffic and then class Al traffic. When class AO traffic is scheduled, first the class A traffic in the first level queue is shaped according to the credit value of AO, consuming the corresponding credit value of AO, and the shaped data frames are sent to the pending send queue to enter into the RPR ring. When the credit value of AO is consumed up, the scheduling of class Al traffic is performed, wherein the class A traffic in the first level queue is shaped according to the credit value of At, consuming the corresponding credit value of Al, and then the shaped data frames go through a D shaper, consuming the corresponding credit value of D, and shaped data is sent to the pending send queue to enter into the RPR ring. When the credit value of Al is consumed up, the scheduling of class A traffic is suspended, and class B traffic is scheduled, and then class C traffic is scheduled subsequently, the process flow of scheduling class B traffic and class C traffic being the same as that of class A traffic. The credit values of different traffics are determined by the respective total bandwidths of class A, B or C traffic of the RPR device allowed to enter into the RPR ring. Although the traffic class classification method of the present invention has been illustrated and described, obviously the present invention is not limited thereby. And numerous modifications, substitutions, alterations, and alternative and equivalent elements would readily be contemplated by those skilled in the art without departing from the spirit and scope of the present invention as defined by the appended claims. 13 WE CLAIM: 1. A resilient packet ring device supporting multi-level scheduling of data traffic, said device comprising: plurality of user side ports (port 1 to port N) receiving data; a secondary level queuing unit of traffic classes A, B and C being coupled to said each user side port for receiving the data frames and placing the same in respective second level queues according to their traffic IDs; a secondary level scheduling unit for scheduling the frames contained in the second level queues based firstly on traffic class and then based on port weight; a first level queuing unit receiving the data frames from the said second level scheduling unit and entering the same into first level queues of traffic classes A, 6 and C respectively; a first level scheduling unit for performing insert scheduling in the three classes of traffic in the first level queues, and a ring side port operativety connected to the first level queues for transmitting the queued data frames. 2. The resilient packet ring device as claimed in claim 1, wherein the minimum bandwidths of the three classes A, B and C of traffic allowed to be entered into the RPR ring from each user side port is configurable by users. 3. The resilient packet ring device as claimed in claim 1, wherein the secondary level scheduling unit performs the traffic class scheduling in the priority order that class A traffic takes priority over class B traffic, and class B traffic takes priority over class C traffic; the code weight scheduling is performed according to the weight values of the respective classes of traffic of the respective user side ports. 4. The resilient packet ring device as claimed in claim 1, wherein the weight value is derived from the ratio between the minimum bandwidth of class A, B or C traffic at the user side port and the bandwidth of the same class of traffic at all the user side ports of the RPR device. 5. The resilient packet ring device as claimed in claim 1, wherein the weight value of different classes of traffic can be different. 6• A multi-level scheduling method supporting multi-ports and multi-services, characterized by comprising the following steps: providing second level queues of traffic classes A, B and C at each user side port of an individual RFR device, the data frames received at the user side port to be placed in the respective second level queues according to their traffic class IDs; performing a two level scheduling consisting of firstly traffic class scbedttfiag and then port weight scheduling on the second level queues of the user side port; entering the data frames after the two level scheduling into first level queues of traffic classes A, B, and C respectively; and performing a RPR insert scheduling for the three classes of traffic in the first level queues. 7 The method as recited in Claim £, characterized in that: the minimum bandwidths of the three classes A, B and C of traffic allowed to be entered into the RPR ring from each user side port is configurable by users. 8. The method as recited in Claim &, characterized in that; the traffic class scheduling is performed in the priority order that class A traffic takes priority over class B traffic, and class B traffic takes priority over class C traffic; the port weight scheduling is performed according to the weight values of the respective classes of traffic of the respective user side ports. 9. The method as recited in Claim 8, characterized in that: the weight value is derived from the ratio between the minimum bandwidth of class A, B or C traffic at the user side port and the bandwidth of the same class of traffic at all the user side ports of the RPR device. 10. The method as recited in Claim 9, characterized in that: the weight values of different classes of traffic can be different. 11. The method as recited in Claim Or characterized in that: the step of performing a two level scheduling on the second level queues specifically comprises: Step 1, querying one by one whether the second level queues of traffic class A of the user side ports are empty, and if so, performing Step 2; otherwise proceeding to Step 3; Step 2, determining whether this user side port is the last user side port; and If so, proceeding to Step 5; otherwise returning to Step 1, querying the second level queue of traffic class A of the next user side port; Step 3, according to the weight value of class A traffic of the user side port, scheduling the class A traffic in fee second level queue into the first level quene of traffic class A; Step 4, determining whether the first level queue of traffic class A is full, and if no, proceeding to Step 2; if yes, proceeding to Step 5; Step 5, querying one by one whether the second level queues of traffic class B of the user side ports are empty, and if so, performing Step 6; ■ otherwise, proceeding to Step 7; Step 6, determining whether this user side port is the last user side port, and if so, proceeding to Step 9; otherwise returning to Step 5, querying the second level queue of traffic class B of the next user side port; Step 7, according to the weight value of class B traffic of the user side port, scheduling the class B traffic in the second level queue into the first level queue of traffic class B; Step 8, determining whether the first level queue of traffic class B is full, and if NO, proceeding to Step 6; if yes, proceeding to Step 9; FROM tZhongzi Law Office FAX NO. :6G091199 Mar. 07 2006 13:44 P15 Step 9, querying whether the second level queues of traffic class C of the user side ports are empty, and if so, performing Step 10; otherwise, proceeding to Step 11; Step 10, determining whether this user side port is the last user side port, and if so, proceeding to Step 1; otherwise returning to Step 9, querying the second level queue of traffic class C of the next user side port; Step 11, according to the weight value of class C traffic of the user side port, scheduling the class C traffic in the second level queue into the first level queue of traffic class C; and Step 12, determining whether the first level queue of traffic class C is full, and if no, proceeding to Step 10; if yes, proceeding to Step 1. 12.The method as recited in claim 6, characterized performing the insert scheduling on the three classes of traffic in the first level queues further comprises: shaping the three classes of traffic respectively, and traffic scheduling the data frames of the respective traffics to be outputted into the corresponding RPR ring. 13 • The method as recited in Claim 14characterized in that: the shaping and scheduling are performed in the order that class A traffic takes priority over class B traffic, and class B traffic takes priority over class C traffic. 14 . The method as recited in Claim 13, characterized in that: the steps of the insert scheduling specifically comprises: Step 1, shaping the class A traffic in the first level queue according to the credit value of class A traffic, consuming the corresponding credit value; Step 2, scheduling the shaped data frames of class A traffic to be outputted into the RPR ring; Step 3, determining whether the credit value of class A traffic is FROM :Zho*gzi Law Office FflX NO. :66091199 Mar. 07 2006 13:45 consumed up, and if no, returning to Step 1; if yes, suspending the shaping and scheduling of class A traffic, and performing Step 4; Step 4, shaping the class B traffic in the first level queue according to the credit value of class B traffic, consuming the corresponding credit value; Step 5, scheduling the shaped data frames of class B traffic to be outputted into the RPR ring; Step 6, determining whether the credit value of class B traffic is consumed up, and if no, returning to Step 4; if yes, suspending the shaping and scheduling of class B traffic, and performing Step 7; Step 7, shaping the class C traffic in the first level queue according to the credit value of class C traffic, consuming the corresponding credit value; Step 8, scheduling the shaped data frames of class C traffic to be outputted to the RPR stag; Step 9, determining whether the credit value of class C traffic is consumed up, and if no, returning to Step 7; if yes, suspending the shaping and scheduling of class C traffic, and performing Step 1; I5. The method as recited in Claim 14 characterized in that: the credit value of each class of traffic is determined by the total bandwidth of class A, B, or C traffic allowed to enter into the RPR ring from the RPR device. 16. 11. The method as recited in Claim 10, characterized in that: the total bandwidth of class A, B or C traffic allowed to enter into the RPR ring from an individual RPR device is configured by users. 18 17. A resilient packet ring device supporting multi-level scheduling of data traffic and a multi-level scheduling method supporting multi-ports and multi-services, substantially as herein described and illustrated with reference to the accompanying drawings. Dated, this 11th day of March, 2006. -, (G. DEEPAK SRINIWAS) OF K&S PARTNERS AGENT FOR THE APPLICANT 19 FROM :ZKongzi Law Office FAX NO. :66091199 Mar. 07 2006 13:45 ABSTRACT A multi-level scheduling method supporting multi-ports and multi-services comprises: providing second level queues of traffic classes A, B, and C at each user side port of an individual RPR device, the data frames received at the user side port to be placed in the respective second level queues according to their traffic class IDs; performing a two level scheduling consisting of firstly traffic class scheduling and then port weight scheduling on the second level queues of the user side port; the data frames after the two level scheduling entering into first level queues of traffic classes A, B, and C respectively; and performing a RPR insert scheduling on the three classes of traffic in the first level queues. The present invention effectively solves the scheduling in case where the traffics of multiple user side ports need to eater the RPR ring and each user side port has the three classes A, B and C of traffic at the same time, meets the requirement that the class A traffics are scheduled firstly, the class B traffics are scheduled secondly, and the class C traffics are scheduled finally, thus guaranteeing the delay and delay jitter requirements of class A traffic and class B traffics.

Documents:

288-mumnp-2006-abstract(13-03-2006).pdf

288-MUMNP-2006-ABSTRACT(23-1-2009).pdf

288-mumnp-2006-abstract.doc

288-mumnp-2006-cancelled pages(13-03-2006).pdf

288-MUMNP-2006-CANCELLED PAGES(23-1-2009).pdf

288-MUMNP-2006-CLAIMS(23-1-2009).pdf

288-mumnp-2006-claims(granted)(13-03-2006).pdf

288-mumnp-2006-claims.doc

288-mumnp-2006-claims.pdf

288-mumnp-2006-correspondence(23-01-2009).pdf

288-MUMNP-2006-CORRESPONDENCE(23-1-2009).pdf

288-mumnp-2006-correspondence(ipo)-(03-02-2009).pdf

288-mumnp-2006-correspondence-received-ver-100306.pdf

288-mumnp-2006-correspondence-received-ver-200706.pdf

288-mumnp-2006-correspondence-received-ver-210606.pdf

288-mumnp-2006-correspondence-received.pdf

288-mumnp-2006-description (complete).pdf

288-MUMNP-2006-DESCRIPTION(COMPLETE)-(23-1-2009).pdf

288-mumnp-2006-drawing(13-03-2006).pdf

288-MUMNP-2006-DRAWING(23-1-2009).pdf

288-mumnp-2006-drawings.pdf

288-mumnp-2006-form 1(13-03-2006).pdf

288-mumnp-2006-form 1(15-05-2006).pdf

288-MUMNP-2006-FORM 1(15-5-2006).pdf

288-mumnp-2006-form 18(23-06-2006).pdf

288-mumnp-2006-form 2(23-1-2009).pdf

288-mumnp-2006-form 2(granted)-(13-03-2006).pdf

288-MUMNP-2006-FORM 2(TITLE PAGE)-(23-1-2009).pdf

288-mumnp-2006-form 26(08-05-2006).pdf

288-mumnp-2006-form 26(13-03-2006).pdf

288-mumnp-2006-form 3(13-03-2006).pdf

288-MUMNP-2006-FORM 3(13-3-2006).pdf

288-mumnp-2006-form 3(23-01-2009).pdf

288-mumnp-2006-form 3(23-06-2006).pdf

288-MUMNP-2006-FORM 3(23-1-2009).pdf

288-mumnp-2006-form 5(13-03-2006).pdf

288-MUMNP-2006-FORM 5(13-3-2006).pdf

288-mumnp-2006-form-1.pdf

288-mumnp-2006-form-2.doc

288-mumnp-2006-form-2.pdf

288-mumnp-2006-form-26.pdf

288-mumnp-2006-form-3.pdf

288-mumnp-2006-form-5.pdf

288-mumnp-2006-form-pct-isa-210(13-03-2006).pdf

288-mumnp-2006-pct-search report.pdf

288-MUMNP-2006-PETITION UNDER RUEL 137(23-1-2009).pdf

288-mumnp-2006-petition under rule 137(23-01-2009).pdf

abstract1.jpg