CN101179487A - Computer network data packet forwarding queue management method - Google Patents
Computer network data packet forwarding queue management method Download PDFInfo
- Publication number
- CN101179487A CN101179487A CNA2006101387074A CN200610138707A CN101179487A CN 101179487 A CN101179487 A CN 101179487A CN A2006101387074 A CNA2006101387074 A CN A2006101387074A CN 200610138707 A CN200610138707 A CN 200610138707A CN 101179487 A CN101179487 A CN 101179487A
- Authority
- CN
- China
- Prior art keywords
- queue
- formation
- packet
- available
- virtual monitor
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention relates to a queue management method of a computer network data packet transmission. The queue of storage receiving or transmission data packet is classified and free and available queues are differentiated from the data packets. The method includes the following steps: the computer network node puts the received data packet into the available or free queue of the node, and changes the free queue into the available queue, at the same time, the available queue is examined timely, and the available queue into which not any data packet is put for a certain time is changed into the free queue; the computer network node is triggered according to a timer or received data packet, and calls and transmits the data packet from the available queue in the node. The method in which the free queue is sealed up and kept only provides an available queue for a node scheduling module in the computer network, thus simplifying an operation of a dispatching module and improving the speed and the efficiency of the data packet transmission.
Description
Technical field
The present invention relates to computer network communication, be specifically related in a kind of Internet protocol IP network to realizing that service quality guarantees to improve the queue management method of forward efficiency and speed.
Background technology
Along with Internet fast development, the business function that network provides is gradually improved, and the service quality of network becomes Virtual network operator, and the emphasis that the network device manufacturers and the network user pay close attention to also is developer's a research focus.
The researcher has designed the service quality that multiple device and dispatching algorithm guarantee network, various devices comprise Congestion Avoidance, message classification, congestion management, traffic shaping etc., the different phase that the present service quality of the acting body of various devices guarantees, for example Congestion Avoidance is to filter to avoid transmit queue to occur congested in the data porch to packet; Message classification is after receiving packet, sends into before the formation, is the basis of cohort design; When being queue scheduling, congestion management determines the packet in the transmit queue in which way; Traffic shaping is that the flow of a certain connection of a certain network is monitored, in case the burst of fluid stopping amount.Dispatching method comprises Fair Queue Fair Queuing scheduling, be called for short the FQ scheduling, the Priority Queuing of priority query scheduling, be called for short the PQ scheduling, custom queuing Custom Queuing scheduling is called for short the CQ scheduling, Weighted Fair Queuing Weighted Fair Queuing scheduling, be called for short WFQ scheduling and class-based Weighted Fair Queuing Class Based Weighted Fair Queuing scheduling, be called for short CBWFQ scheduling etc.Every kind of dispatching method is all at different network service requests, to guarantee corresponding network service quality.For example Fair Queue is dispatched to the dispatcher meeting identical with all formations; Priority Queuing carries out simple classification with data flow according to priority and implements queue scheduling based on priority; The scheduling ratio that the custom queuing scheduling is different to the different queue assignment of distributing to of resource according to the user; Weighted Fair Queuing is to guarantee treating with a certain discrimination service with different priority levels on the fair basis.Class-based Weighted Fair Queuing is equivalent to CQ, and the combination of PQ and WFQ provides Real-Time Scheduling formation and weighting formation.Every kind of scheduling queue all has its advantage and deficiency, and the scope of application also all has certain restriction, need select at concrete situation.
But the management to formation in the existing method does not also give special concern.Can allow user configured service quality to guarantee that the number of formation lacks to tens as many as hundreds of bars in the general router, how effectively manage these formations, the forwarding speed that improves router is had very big influence.In addition, network traffics all are paroxysmal, have in a period of time often to continue and a large amount of flow processes, and other times do not have flow, and therefore management and the scheduling to service queue should not be unalterable yet.
Chinese invention patent, application number CN01117978, " dispatching method in a kind of integrated service of suitable realization router services quality " proposes a kind of queue management method.The major technique content of this patent of invention queue management is that packet classification is entered three kinds of service queues, comprise the service queue of doing one's best, controlled service queue of load and assurance service queue can comprise many formations in every kind of formation, deposit the packets of different classification; This method only provides three types of service queues, and formation is included in described three types, does not but effectively monitor and manages, and therefore satisfiable quality of service requirement is also fewer.
Summary of the invention
The technical issues that need to address of the present invention provide the queue management method that a kind of computer network data bag is transmitted, on the basis that formation is classified, thus further management improve packet forwarding speed and efficient, provide high-quality network service quality to guarantee.
Above-mentioned technical problem of the present invention solves like this, the queue management method that provides a kind of computer network data bag to transmit, and the formation that receives or send packet with depositing is classified, and distinguishes wherein free time and available queue, comprises following corresponding step:
A) join the team: available queue or affiliated idle queues and change it into available queue under the computer network node is put into the packet that receives; The described available queue of described node regular check does not have new packet to be placed into according to it within a certain period of time, then this available queue is changed into idle queues;
B) go out team: the computer network node triggers according to the packet of timer or reception, calls and transmit packet from described available queue.
According to queue management method provided by the invention, described classification comprises the service queue of doing one's best, the controlled service queue of load, the formation of high-quality statistic multiplexing, one or more in statistic multiplexing formation and the assurance service queue in proportion; Described criteria for classification can be based on class, stream or pass-through mode: point-to-point or put multiple spot.
According to queue management method provided by the invention, the described steps A of joining the team) regular check is by finishing alone jointly with each class corresponding virtual monitoring group in, described virtual monitor group comprises the service queue of doing one's best, one or more in controlled service queue of load and the assurance service queue virtual monitor group.
According to queue management method provided by the invention, described certain hour can be made as fixed value, also can be disposed by the user.
According to queue management method provided by the invention, the described group step B of going out) available queue supplies by you can well imagine with each class corresponding virtual monitoring component in, described virtual monitor group comprises the service queue of doing one's best, one or more in controlled service queue of load and the assurance service queue virtual monitor group.
According to queue management method provided by the invention, described formation and described classification, promptly the virtual monitor group can dispose or delete.
According to queue management method provided by the invention, the configuration of described formation comprises affiliated classification, i.e. virtual monitor group, configuration.
According to queue management method provided by the invention, described classification, i.e. virtual monitor group, deletion comprise whole deletions of its internal queues.
According to queue management method provided by the invention, the traffic classification of described configuration packet includes network and bandwidth application or release.
According to queue management method provided by the invention, described net flow assorted comprises according to priority of data packets carries out packet classification, perhaps source address and the destination address according to packet carries out packet classification, perhaps carries out packet classification according to some field of packet.
According to queue management method provided by the invention, described computer network node can be a router; Described formation is a virtual queue.
The queue management method that computer network data bag provided by the invention is transmitted, adopt the virtual monitor group that formation is monitored and managed, the virtual monitor group is sealed idle queues up for safekeeping, only provide available queue to computer network node scheduling module, the operation of scheduler module has been simplified in this processing, has improved speed and efficient that packet is transmitted.
Description of drawings
Further the present invention is described in detail below in conjunction with the drawings and specific embodiments.
Fig. 1 is the schematic diagram that concerns of each intermodule in the router of the present invention.
Fig. 2 is an available queue cellular construction schematic diagram of the present invention.
Fig. 3 for the structure of virtual monitor pack module in the router of the present invention and with the schematic diagram that concerns of formation.
Fig. 4 is the schematic diagram that concerns of interface management modular structure in the router of the present invention and virtual monitor pack module.
Fig. 5 is the process chart of virtual monitor group and formation during user's configuration service quality assurance formation in the implementation method of the present invention.
The process chart of virtual monitor group and formation when Fig. 6 joins the team for packet in the implementation method of the present invention.
The process chart that Fig. 7 regularly monitors formation for virtual monitor group in the implementation method of the present invention.
Fig. 8 is the queue scheduling process chart of implementation method of the present invention.
Embodiment
At first, computer network node apparatus provided by the invention is described, this device comprises with lower module:
The packet receiving module is used for receiving packet from physical interface;
Sort module is used for packet is classified, and just selects suitable formation for packet;
The virtual monitor pack module, be used for unified management is carried out in some formation with same alike result, simplify scheduling process, the priority VCGPro that comprises this virtual monitor group in each virtual monitor group, the number QueueNum of formation, the transmitting-receiving bag statistics that also comprises this virtual monitor formation that group is had jurisdiction over simultaneously in the virtual monitor group, the summation of the packet to be sent in the formation of having jurisdiction in this virtual monitor group, a QueueHead of queue pointer of this virtual monitor formation that group is had jurisdiction over, and a UsableQueueHead of queue pointer of the available queue had jurisdiction over of this virtual monitor group, and the pointer NextVCG of next virtual monitor group etc.;
Further, all have a space to be used for writing down the pointer of next formation in each formation, be called NextQueue, in this device, NextQueue is used for writing down the next formation that belongs to a virtual monitor group together, has so just formed a formation chain;
Further, the position of formation in the formation chain determines that by the time that the user disposes this formation the formation meeting of configuration earlier is placed on the front of formation chain.When certain formation is deleted by the user, the deleted position of formation in the formation chain filled up in formation meeting following closely.
Further, the available queue described in the step B is meant the current formation that packet to be sent is arranged.Because network traffics are paroxysmal, often there is a large amount of flow of continuing to need to transmit a certain period, other times then do not have flow, so for the current formation that does not have packet to be sent, the present invention is referred to as idle queues; On the contrary, the current formation that packet to be sent is arranged, the present invention is referred to as available queue.In each formation, all distribute a space to be used for writing down this formation and belong to available queue or idle queues, be called QueueStatus;
Further, among the present invention a formation is called the forward upset from the phenomenon that idle queues becomes available queue, a formation is called reverse flip from the phenomenon that available queue becomes idle queues;
Further, the time that among the present invention a formation generation forward upset back is continued this state calls the available duration;
Further, in each formation, establish the pointer that a space is used for writing down next available queue in addition, be called NextUsableQueue.Just, if the A formation is current available, the B formation also is current available, but the available duration of A formation is bigger than B formation, and then the NextUsableQueue that is called of A formation just points to the B formation.Like this, all available queues will form an available queue chain under certain virtual monitor group;
Further, the formation that is positioned at formation chain head or available queue chain head becomes a formation;
Further, have a space to be used for writing down the pointer NextVCG that priority is lower than the next virtual monitor group of this virtual monitor group in the virtual monitor group, all virtual monitor groups of configuration can be formed a virtual monitor group chain under certain interface like this;
The interface management module, be used to store the transmitting-receiving bag statistics of certain interface, the configured number VCGNum of virtual monitor group under the interface, the virtual monitor group CurVCG that this interface the last time calls, the head pointer VCGHead of virtual monitor group chain, the allocated bandwidth size of this interface, the number of data packets that this interface is to be sent, the statistics of this interface transceive data bag etc.;
The formation module is used to deposit packet to be sent, comprise in the formation module with good grounds user's the formation that configuration generated;
Scheduler module is used for taking out packet to be sent from formation, and sends this packet, and scheduler module adopts different dispatching algorithms at the different configuration of user;
Wherein, described packet receiving module is the inlet of network packet, sort module is implemented the classification of the packet operation of joining the team, the formation module comprises user configured all formations, the virtual monitor pack module is the nucleus module of queue management, enforcement is to the classification monitoring and the management of formation, and scheduler module is dispatched forwarding according to scheduling mode accesses virtual monitoring pack module and formation module that the user selects;
Further, the packet receiving module is handled the packet that this interface receives according to different physical interface type, and packet is integrated into unified structure, makes things convenient for the back module that the unified of packet handled;
Further, described sort module can have multiple criteria for classification and rule, for example according to priority of data packets classification, perhaps according to the destination address of packet and source address classification etc.;
Further, join the team be meant with packet put under formation, may deposit a plurality of packets in each formation, the new packet that arrives can be placed on rear of queue, and all packets are according to the principle of the first-in first-out module schedules that is scheduled successively in each formation;
Further, formation is exactly the formation of real storage packet to be sent, the virtual monitor group is some set with same characteristic features formation, and itself is not stored packet, but it manages all formations that belong to this virtual monitor group and the packet in the formation;
Further, scheduling is meant the team that of packet, certain packet that scheduling is adopted certain algorithm to decide when to get certain formation often.
The second, queue management method of the present invention is described, comprising:
Steps A. the user was configured the network traffics that need service quality to guarantee before using the service quality assurance function, and system generates and the corresponding formation of various traffic classes in advance according to user's configuration;
Further, the collocation method that the user carries out the service quality assurance comprises net flow assorted and bandwidth application or release, wherein net flow assorted comprises according to priority of data packets and carries out packet classification, perhaps source address and the destination address according to packet carries out packet classification, or carries out packet classification etc. according to some field of packet; Bandwidth application or release are to be provided with or to delete in the maximum bandwidth that certain node place of network allows for each network traffics.If bandwidth is provided with, then requirement, the bandwidth of this flow can not surpass maximum bandwidth;
Further, write down the bandwidth allocation information of interface in the interface management module, if the bandwidth of user applies surpasses the distribution capability of interface remaining bandwidth, user's bandwidth application will be failed, the user also can fail to the configuration of these network traffics, can not generate corresponding formation;
Further, the user comprises interpolation and deletes two kinds of operations the configuration of service quality assurance;
Step B. virtual monitor pack module is according to the quality of service requirement of deployment queue and the number of the virtual monitor group that the real-time adjustment of classification situation has been created, and upgrades the various information in the virtual monitor group; Guarantee formation if the user has added a service quality, then carry out step C; If the user deletes a service quality and guarantees formation, then carry out step D;
Step C. virtual monitor group searching available queue chain searches the afterbody of this chain, adds user configured formation to last-of-chain; Then, virtual monitor group searching formation chain searches the afterbody of this chain, adds user configured formation chain to the formation last-of-chain;
Step D. virtual monitor group searching available queue chain finds the formation that the user will delete, this node of deletion from the available queue chain;
Step e. the packet receiving module receives packet from physical interface;
Step F. sort module is classified to the packet that receives, and puts into corresponding formation:
Further, criteria for classification can be according to priority of data packets, and perhaps some field in the data message is classified, and provides class-based service quality to guarantee; Also can be source address according to packet, destination address, source port and destination interface are classified, and provide the service quality based on stream to guarantee; Can also be to classify according to destination address and/or source address, the service quality assurance that point-to-point is provided or puts multiple spot;
Step G. scheduler module triggers by timer, perhaps triggers by packet receiving, calls and transmit packet from formation.The dispatching algorithm of scheduler module can be looked the user WFQ, CQ, PQ or FQ scheduling algorithm are adopted in the requirement that service quality guarantees.Scheduler module begins to visit available queue from the available queue head formation of virtual monitor group record, and needn't visit idle queues.Because the realization of queue scheduling algorithm is not an emphasis of the present invention, so do not do detailed description;
Step H. packet receiving module receives packet, and it is classified, and determines the formation that this packet is affiliated, if this formation is an idle queues, then carries out the operation of two steps: 1) this formation is added to the afterbody of available queue chain, 2) packet is put into this formation; If this formation is an available queue, then directly packet is put into this formation.
Step I. virtual monitor group meeting available queue that regular check is had jurisdiction over if certain available queue does not have new packet to arrive within a certain period of time, is then judged this formation is deleted from the available queue chain, and this formation is labeled as idle queues;
Further, a period of time described in the step I, should decide according to the network concrete condition, can be made as fixed value, also can dispose by the user, claim among the present invention that this time is NullTime;
At last, further describe the inventive method in conjunction with the specific implementation of the present invention in router:
(1) router of the present invention, structure comprise packet receiving module 11 as shown in Figure 1, sort module 12, CAR module 13, token computation module 14, virtual monitor pack module 15, interface management module 16 and scheduler module 17.
Packet receiving module 11 is used for receiving packet from physical interface, abandons vicious packet, and the active data bag is sent to sort module.
Sort module 12 is used for classifying according to the packet that the good criteria for classification of user's configured in advance is sent here the packet receiving module, judges the pairing formation of this packet.
Virtual monitor pack module 14, be used to monitor and manage all formations with equal priority, it comprises the transmitting-receiving bag statistics of this virtual monitor formation that group is had jurisdiction over, the number QueueNum of this virtual monitor formation that group is had jurisdiction over, the summation of the packet to be sent in the formation of having jurisdiction in this virtual monitor group, a QueueHead of queue pointer of the formation of having jurisdiction over, a UsableQueueHead of queue pointer of the available queue of having jurisdiction over etc., the virtual monitor group is simplified the scheduling process of scheduler module, improves the speed that queue scheduling and packet are transmitted.
Scheduler module 16 is implemented the forwarding of queue scheduling and packet.
Packet receiving module 11 is inlets that service quality guarantees flow process, sort module 12 is finished the classification to packet, virtual monitor pack module 14 and interface module 15 generate the configuration of network traffics according to the user, and real-time update on stream, formation module 13 is used for storing packet, and scheduler module 16 is implemented the forwarding with packet of calling to formation.
(2) as shown in Figure 2, formation module 13 is according to the user classification and the configuration of network traffics to be generated in real time, and packet to be sent is end to end discharging in formation.NextQueue in the formation points to the next formation of this formation in the formation chain.If a formation is an available queue, then NextUsableQueue is effectively, and points to the next available queue of this formation in the available queue chain; If this formation is an idle queues, then NextUsableQueue is invalid.QueueStatus shows that a formation is available queue or idle queues.What couple together with thick dashed line among Fig. 3 is the available queue chain, and what couple together with heavy line is the idle queues chain.A formation may belong in two chains simultaneously, but be not to be copied into two parts, but adds or withdraw from certain chain by pointer.
(3) as shown in Figure 4, write down the number VCGNum of the virtual monitor group that is generated according to user's configuration under this interface in the interface management module 15, the pointer VCGHead of first virtual monitor group, the size of the bandwidth that this interface has distributed, this interface is had jurisdiction over the summation of virtual monitor group packet to be sent, nearest invoked virtual monitor group CurVCG, and this interface is had jurisdiction over the summation of virtual monitor group transceive data bag.
(4) when user's configuration service quality assurance formation, the alignment processing flow process of virtual monitor group and formation specifically as shown in Figure 5, may further comprise the steps:
501) user formation is configured to service quality.
502) judge that adding formation still deletes formation.If the user adds formation, then jump, otherwise jump toward step 512 toward step 503.
503) size that disposed of the interface bandwidth in the fetch interface administration module is made as bandwidth1, and the user is the bandwidth bandwidth2 of the formation of configuration this time.Total bandwidth bandwidth=bandwidth1+bandwidth2.
504) total bandwidth of establishing physical interface is totalband.Judge that whether bandwidth is greater than totalband.If.Then jump, otherwise jump toward step 506 toward step 505.
505), forbid that the user carries out configuration this time because user configured total bandwidth has surpassed interface bandwidth.
506) judge that the service quality that the user this time adds guarantees whether affiliated virtual monitor group generates.Be then to jump, otherwise jump toward step 507 toward step 511.
507) distribute a virtual monitor group space.According to the priority of this virtual monitor group, the virtual monitor group chain under its insertion interface.
508) whether priority is the highest to judge this virtual monitor group, is, then jumps toward step 409, otherwise jumps toward step 410.
509) VCGHead of modification interface management module is the pointer of this virtual monitor group.
510) distribute a formation, this formation is put into the begin chain of formation chain in the virtual monitor group, and this queue pointer is write the QueueHead of virtual monitor group.
511) distribute a formation, this formation is put into the last-of-chain of formation chain in the virtual monitor group.
512) user deletes a formation, and this formation is deleted from the formation chain of virtual monitor group.
513) judge whether this formation is positioned at the head of formation chain.Be, then jump, otherwise jump toward step 515 toward step 514.
514) QueueHead of modification virtual monitor group is the NextQueue of this formation.
515) do you judge whether available queue of this formation? be, then look into the distance, otherwise jump toward step 519 toward step 516.
516) this formation head of available queue chain whether? be, then jump, otherwise jump toward step 517 toward step 518.
517) this formation is deleted from the available queue chain.
518) QueueUsableHead of virtual monitor group is updated to the NextUsableQueue of this available queue.
519) this interface has distributed the size of bandwidth in the updating interface administration module.
520) do you judge whether this virtual monitor group also has formation to exist? be, then look into the distance, otherwise jump toward 522 toward step 521.
521) this virtual monitor group of deletion the virtual monitor group chain under interface.
522) finish user's configuration.
(5) when the reception packet was joined the team, the alignment processing flow process of virtual monitor group and formation specifically as shown in Figure 6, may further comprise the steps:
601) there is packet to arrive from physical interface.
602) by sort module this packet is classified.
603) judge whether to accept the formation of this packet, be, then jump, otherwise jump toward step 609 toward step 604.
604) judge that the QueueStatus of formation (being designated as the A formation) is available or idle under this packet.If available, jump toward step 608, otherwise jump toward step 605.
605) judge whether the affiliated virtual monitor group of A formation has the available queue chain.Be, then jump, otherwise jump toward step 607 toward step 606.
606) in the available queue chain of this virtual monitor group, find last formation, be designated as the B formation, the NextUsableQueue of B formation is updated to the A formation.
607) UsableQueueHead with this virtual monitor group is updated to the A formation.
608) packet is put in the A formation, is positioned at after other packets to be sent.
609) this formation is deleted from the formation chain of virtual monitor group.
610) directly transmit this packet.
(6) the virtual monitor group is regularly monitored handling process to formation, specifically as shown in Figure 7, may further comprise the steps:
701) timer triggering virtual monitor group triggers the linchpin formation.
702) the VCGHead value under the fetch interface administration module finds the highest virtual monitor group of priority.
703) check a formation of the available queue chain of this virtual monitor group.
704) establish this moment system time be systick, be droptick user configured ineffective time.Systick-lasttick＞droptime? be, then jump, otherwise jump toward step 708 toward step 705.
705) do you judge that this available queue is a formation of available queue? be, jump, otherwise jump toward step 707 toward step 706.
706) establishing this formation is the B formation, and the NextUsableQueue of A formation is the C formation.The UsableQueueHead of virtual monitor group is recorded as the C formation.
If this formation does not have NextUsableQueue, then with the UsableQueueHead zero clearing of virtual monitor group.
707) establishing this formation is the B formation, and previous available queue is the A formation, and the NextUsableQueue of A formation is the C formation.The NextUsableQueue of A formation is recorded as the C formation.If this formation does not have NextUsableQueue, then with the NextUsableQueue zero clearing of A formation.
708) judge whether this formation has NextUsableQueue.Be, then jump, otherwise jump toward step 709 toward step 704.
709) do you judge that this virtual monitor group has NextVCG? be, then jump, otherwise jump toward step 711 toward step 710.
710) check next virtual monitor group.
711) finish inspection this time.
(7) the queue scheduling handling process of implementation method of the present invention specifically as shown in Figure 8, comprises following step:
801) scheduler module is triggered.
802) VCGHead of fetch interface administration module.
803) judge whether VCGHead is effective.Be, then jump, otherwise jump toward step 809 toward step 804.
804) read the UsableQueueHead of this virtual monitor group, determine a formation of available queue chain.
805) transmit the packet of this formation, and read the NextUsableQueue of this formation.
806) whether NextUsableQueue is effective.Be, then jump, otherwise jump toward step 807 toward step 805.
807) read the NextVCG of this virtual monitor group.
808) judge whether NextVCG is effective, is, then jump, otherwise jump toward step 809 toward step 804.
809) this scheduling finishes.
Virtual queue among Fig. 5,6,7 and 8 is formation.
Claims (10)
1. the queue management method transmitted of a computer network data bag, the formation that receives or send packet with depositing is classified, and it is characterized in that, distinguishes wherein free time and available queue, comprises that following correspondence joins the team and go out group step:
A) join the team: under the computer network node is put into the packet that receives available queue or put under idle queues and quene state is changed into available, move to available queue from the idle queues chain; The described available queue of described node regular check does not have new packet to be placed into according to it within a certain period of time, then this available queue state is changed into idle queues, moves to idle queues from the available queue chain;
B) go out team: the computer network node triggers according to the packet of timer or reception, calls and transmit packet from each classifies described available queue.
2. according to the described queue management method of claim 1, it is characterized in that described classification comprises the service queue of doing one's best, the controlled service queue of load, the formation of high-quality statistic multiplexing, one or more in statistic multiplexing formation and the assurance service queue in proportion; Described criteria for classification can be based on class, stream or pass-through mode.
3. according to claim 1 or 2 described queue management methods, it is characterized in that, the described steps A of joining the team) regular check is by finishing alone jointly with each class corresponding virtual monitoring group in, described virtual monitor group comprises the service queue of doing one's best, one or more in controlled service queue of load and the assurance service queue virtual monitor group.
4. according to the described queue management method of claim 1, it is characterized in that described certain hour can be made as fixed value, also can dispose by the user.
5. according to claim 1 or 2 described queue management methods, it is characterized in that, the described group step B of going out) available queue supplies by you can well imagine with each class corresponding virtual monitoring component in, described virtual monitor group comprises the service queue of doing one's best, one or more in controlled service queue of load and the assurance service queue virtual monitor group.
6. according to claim 1 or 2 described queue management methods, it is characterized in that described formation and described classification can be disposed or delete.
7. according to the described queue management method of claim 6, it is characterized in that the configuration of classification under the configuration of described formation comprises.
8. according to the described queue management method of claim 6, it is characterized in that the deletion of described classification comprises whole deletions of its internal queues.
9. according to the described queue management method of claim 6, it is characterized in that the traffic classification of described configuration packet includes network and bandwidth application or release.
10. according to the described queue management method of claim 9, it is characterized in that, described net flow assorted comprises according to priority of data packets carries out packet classification, perhaps source address and the destination address according to packet carries out packet classification, perhaps carries out packet classification according to some field of packet.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2006101387074A CN101179487B (en) | 2006-11-10 | 2006-11-10 | Computer network data packet forwarding queue management method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2006101387074A CN101179487B (en) | 2006-11-10 | 2006-11-10 | Computer network data packet forwarding queue management method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101179487A true CN101179487A (en) | 2008-05-14 |
| CN101179487B CN101179487B (en) | 2011-05-11 |
Family
ID=39405580
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2006101387074A Expired - Fee Related CN101179487B (en) | 2006-11-10 | 2006-11-10 | Computer network data packet forwarding queue management method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101179487B (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104836750A (en) * | 2015-05-04 | 2015-08-12 | 大连理工大学 | Data center network flow scheduling method based on round-robin |
| CN107231317A (en) * | 2016-03-25 | 2017-10-03 | 重庆邮电大学 | A kind of packet mixed scheduling strategy for 6LoWPAN and Internet Interworking GateWays |
| WO2017219993A1 (en) * | 2016-06-22 | 2017-12-28 | 新华三技术有限公司 | Packet scheduling |
| CN110098977A (en) * | 2019-04-12 | 2019-08-06 | 中国科学院声学研究所 | Real-time protocol (RTP) identifies the network packet under background sequentially storage method and system |
| CN117938776A (en) * | 2024-02-19 | 2024-04-26 | 北京光润通科技发展有限公司 | Network congestion reverse avoiding method and network congestion reverse avoiding network card |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1165184C (en) * | 2001-05-08 | 2004-09-01 | 华为技术有限公司 | A Scheduling Method in Integrated Services Suitable for Implementing Router Quality of Service |
-
2006
- 2006-11-10 CN CN2006101387074A patent/CN101179487B/en not_active Expired - Fee Related
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104836750A (en) * | 2015-05-04 | 2015-08-12 | 大连理工大学 | Data center network flow scheduling method based on round-robin |
| CN104836750B (en) * | 2015-05-04 | 2017-12-05 | 大连理工大学 | A kind of data center network stream scheduling method based on round-robin |
| CN107231317A (en) * | 2016-03-25 | 2017-10-03 | 重庆邮电大学 | A kind of packet mixed scheduling strategy for 6LoWPAN and Internet Interworking GateWays |
| WO2017219993A1 (en) * | 2016-06-22 | 2017-12-28 | 新华三技术有限公司 | Packet scheduling |
| CN110098977A (en) * | 2019-04-12 | 2019-08-06 | 中国科学院声学研究所 | Real-time protocol (RTP) identifies the network packet under background sequentially storage method and system |
| CN110098977B (en) * | 2019-04-12 | 2020-11-06 | 中国科学院声学研究所 | Network data packet in-sequence storage method, computer device and storage medium |
| CN117938776A (en) * | 2024-02-19 | 2024-04-26 | 北京光润通科技发展有限公司 | Network congestion reverse avoiding method and network congestion reverse avoiding network card |
| CN117938776B (en) * | 2024-02-19 | 2024-12-20 | 北京光润通科技发展有限公司 | Network congestion reverse avoiding method and network congestion reverse avoiding network card |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101179487B (en) | 2011-05-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101179486B (en) | Computer network data packet forwarded CAR queue management method | |
| US6914882B2 (en) | Method and apparatus for improved queuing | |
| US6757249B1 (en) | Method and apparatus for output rate regulation and control associated with a packet pipeline | |
| EP3955550B1 (en) | Flow-based management of shared buffer resources | |
| US6934250B1 (en) | Method and apparatus for an output packet organizer | |
| US6882642B1 (en) | Method and apparatus for input rate regulation associated with a packet processing pipeline | |
| CN100562006C (en) | The system and method for difference queuing in the route system | |
| CN110493145A (en) | A kind of caching method and device | |
| Awerbuch et al. | Distributed control for PARIS | |
| US20060291495A1 (en) | Hardware self-sorting scheduling queue | |
| CN101179487B (en) | Computer network data packet forwarding queue management method | |
| CN102368741A (en) | Method supporting hierarchical queue scheduling and flow shaping and apparatus thereof | |
| CN102833151B (en) | User individuation priority routing algorithm based on content coverage and feedback mechanism | |
| CN106302228B (en) | A task-aware transmission control method in data center network | |
| EP1509008B1 (en) | Resource time adaptive internet protocol routing system and method | |
| CN102387076A (en) | Shaping-combined hierarchical queue scheduling method | |
| CN101188547A (en) | Router for improving forward efficiency based on virtual monitoring group and CAR rate limit | |
| CN100466593C (en) | A Realization Method of Integrated Queue Scheduling Supporting Multiple Services | |
| CN102780630B (en) | A kind of method and apparatus realizing QoS queue based on FPGA queue | |
| CN101193051A (en) | Router for improving forward speed and efficiency based on virtual monitoring group | |
| Nahrstedt et al. | Coexistence of QoS and best-effort flows | |
| US6904056B2 (en) | Method and apparatus for improved scheduling technique | |
| CN108989233A (en) | Congestion management and device | |
| CN1503512A (en) | System and method for communication device scheduling data traffic flow | |
| Lenzini et al. | Eligibility-based round robin for fair and efficient packet scheduling in wormhole switching networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20110511 Termination date: 20171110 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |