CN101212417B - Time granularity based internet QoS assurance method - Google Patents
Time granularity based internet QoS assurance method Download PDFInfo
- Publication number
- CN101212417B CN101212417B CN2007103040814A CN200710304081A CN101212417B CN 101212417 B CN101212417 B CN 101212417B CN 2007103040814 A CN2007103040814 A CN 2007103040814A CN 200710304081 A CN200710304081 A CN 200710304081A CN 101212417 B CN101212417 B CN 101212417B
- Authority
- CN
- China
- Prior art keywords
- packet
- real time
- time
- formation
- router
- 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.)
- Expired - Fee Related
Links
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a method for assuring quality of internet service based on time granularity; by adding a delay-control extension header which is used for recording state information of a data packet into a packet head of the real-time service data packet, a relative time-limit mark in the real-time service data packet is set by an edge route according to a current token number; according to the received relative time-limit value of the data packet, the data packet is distributed into delay queues with different granularity by a core route; the data packet in the queues is sent in sequence; by the method of sending a real-time service test data packet , the edge route can measure a congestion degree of the network, thereby making a decision whether to receive a new call. The invention can well ensure an end-to-end delay of the data packet and has low computational complexity in the core route, which improves the service quality and has strong expansibility at the same time.
Description
Technical field
The present invention relates to a kind of method for ensuring service quality of packet switching network, be specifically related to a kind of internet QoS assurance method, belong to data communication field based on time granularity.
Background technology
The Internet begins to provide real-time multimedia business such as visual telephone, video conference and IPTV at present, and the network delay that these business needs are lower guarantees scheme but the Internet also lacks a kind of effective service quality at present.The Internet attempts to adopt integrated service method to guarantee for real time business provides service quality the earliest, it is with RSVP (ResourceReSerVation Protocol, RSVP, reference: R.Braden, Resource ReSerVation Protocol (RSVP), RFC2205, September 1997) be as call signaling, with Weighted Fair Queuing (Weighted Fair Queuing, WFQ, reference: Abhay K.Patekh, " A Generalized Processor Sharing ApproachFlow Control in Integrated Services Networks:The Single-Node Case ", IEEE/ACM Trans.on Network, Vol 1, No.3, June 1993.) etc. queue scheduling algorithm as the control device of datum plane, for each session stream provides the service quality that is not less than the reservation level.Because RSVP adopts the calling system of soft state, need regularly to upgrade and maintenance of state information, make its retainable call number be subjected to bigger restriction.The computation complexity of WFQ queue scheduling algorithm is 0 (N), and wherein N is current call number.Though level and smooth repeating query (Smoothed Round Robin, SRR, reference: Chuanxiong Guo, SRR:An O (1) Time ComplexityPacket Scheduler for Flows in Multi-Service Packet Networks, IEEE/ACMTransactions on Networking, Volume:12, Issue:6 On page (s): 1144-1155, Dec.2004) computation complexity is 0 (1), but this method still needs filter is flow through in each session, and preserves the state of each session stream.In order to overcome the scaling concern of integrated service, a large amount of at present methods that adopt Differentiated Services.The thinking of Differentiated Services is to set up the enforcement territory of a Differentiated Services, on the border in this enforcement territory data flow is divided into limited several types, only need provide corresponding service to get final product for it according to the type of packet on the core router of Differentiated Services.This method need not safeguarded the state of each session stream on the core router of Differentiated Services, so treatment effeciency is higher, and computation complexity is lower.Though Differentiated Services has some based on bandwidth broker (Bandwidth Broker, BB, reference: K.Nichols, A Two-bitDifferentiated Services Architecture for the Internet, RFC2638, July 1999) calling-control method, but still do not have standardized call control protocol.On datum plane, though the Differentiated Services computation complexity is low, provide, but still can't guarantee for real time business provides service quality than best effort good quality of service.The overall situation is preferential (Global Earliest Deadline First of time limit the earliest, GEDF, reference: Matthew Andrews, LisaZhang, Minimizing End-to-End Delay in High-Speed Networks with a SimpleCoordinated Schedule, IEEE INFOCOM 1999) and core shake dummy clock (Core-Jitter VirtualClock, CJVC, reference: Ion Stoica, Hui Zhang, PProviding, Guaranteed Services WithoutPer Flow Management, ACM SIGCOMM 1999) etc. dispatching algorithm is encoded to the lag characteristic of each packet in the packet header of packet, core router no longer keeps the state information of each session, but according to the lag characteristic of each packet, order sends, the computation complexity of this class algorithm is 0 (logN), and wherein N is the data packet number in the formation.
Summary of the invention
In view of this, the present invention is devoted to provide a kind of internet QoS assurance method based on time granularity.
This method adopts the basic ideas of Differentiated Services, router in this territory is divided into edge router and core router, stick the relative delay mark at edge router for each real time business packet, core router is according to the relative delay mark of receiving the real time business packet, control the queueing delay of this packet, thereby ensure the end-to-end time delay of real time business.
Edge router is preserved the session information of each real time business, adopt the flow of token controller control real time business, and the relative time limit that is provided with in the real time business packet according to current residual token quantity identifies, both relations are that current residual token quantity is many more, and the value in time limit is just more little relatively.Limit value represented that for just this packet arrives this router in advance when router was received packet relative, otherwise, represent that then this packet postpones to have arrived.Limit value is big more during packet relative, and in repeating process thereafter, sustainable queueing delay is also big more.Packet through a router after, its relative time limit can change.When packet was exported from core router, the time limit need deduct its queuing delay relatively, adds the forward delay constant.
Core router with than the littler duration of forward delay constant as the basic unit that postpones, with basic delay unit or its integral multiple time limit span as waiting list, according to the relative time limit of the packet that enters core router, can calculate the route time limit of this packet; Core router is assigned packet according to the route time limit of packet, is inserted into the tail of the queue of respective queue.During transmission, the route time limit, low formation preferentially sent, and in each inner queue, the sequencing that arrives router according to packet sends.The waiting list of setting up at core router is divided into two kinds of different time granularities, and as its time limit span, the formation of M coarseness postpones unit as its time limit span so that N is doubly basic to the individual fine-grained formation of N with basic delay unit.N fine-grained formation receives the relative time limit from 0 to N basic packet that postpones unit, wherein formation R (n) be used to receive the route time limit belong to [(n-1) * u, the packet of n * u); The packet waiting list of M time coarseness is used to receive the common real time business packet of route time limit greater than U, and wherein formation T (m) is used to receive the route time limit and belongs to [m * U, packet (m+1) * U).When core router enters congestion state, just abandon follow-up test packet, remove up to congestion state.Every through the doubly basic duration that postpones unit of n, just the allocation of packets in first coarseness formation in the fine granularity formation, remaining coarseness formation is promoted forward successively.
Calling out aspect the control, at the output interface of each router, distributes certain RSVP, and provide higher dispatching priority for this partial service to real time business.Before sending the real time business data, the edge router of transmitting terminal sends the real time business test packet to the edge router of receiving terminal; When the real time business packet is received in the edge router inspection of receiving terminal,, just refuse this calling if found real time business test crash packet; Otherwise, set up this real time business.
The present invention is achieved by the following technical solutions:
A kind of internet QoS assurance method based on time granularity comprises:
1) in the packet header of real time business packet, increases a delay control extension header that is used for record data bag state information; Described real time business packet comprises general service packet, real time business test packet and real time business test crash packet;
2) edge router is transmitted the common real time business packet of receiving, and the relative time limit of this packet is set according to current residual token quantity;
3) core router calculates the route time limit of this packet according to the relative time limit of common real time business packet;
4) core router is set up the packet waiting list according to the route time limit of each common real time business packet; Described waiting list is divided into two kinds of different time granularities, N fine-grained formation with basic delay unit as its time limit span, the formation of M coarseness postpones unit as its time limit span so that N is doubly basic, every through the doubly basic duration that postpones unit of N, just the allocation of packets in first coarseness formation in the fine granularity formation, remaining coarseness formation is promoted forward successively;
5) core router relative time limit of sending common real time business packet and upgrading this packet.
Prolate-headed data structure is controlled in described delay: the type in next packet header, prolate-headed length, prolate-headed version, test sign, the grade of service, relative time limit.
Common real time business packet that the edge router forwarding is received in the described method and the method that the relative time limit of each packet is set are:
1) edge router disposes its maximum token depth delta and token arrival rate α for each real time business distributes a token controller, and the described maximum token degree of depth is greater than the length of maximum data packet;
2) length is the common real time business packet of L when arriving edge router, if current residual token quantity δ during greater than L, then sends this packet, it is set is limited to β=(Δ-δ)/α, and current residual token quantity reduced L when relative; Otherwise after waiting for that current residual token quantity δ is greater than L, send this packet again.
Core router according to the method that the route time limit r of each common real time business packet sets up the packet waiting list is in the described method:
1) two kinds of time granularities are set in core router, fine granularity is the basic u of unit of delay, and the length of coarseness U is N fine granularity, i.e. U=N * u;
2) will be divided into K the busy period and upgrade the period, every section time span is U, writes down the starting point moment B (k) of each period;
3) calculate the route time limit r that upgrades the common real time business packet that arrives in the period at k, r=t-B (k)+β+σ, wherein t is a current time, in the relative time limit when β enters this core router for this packet, σ is the forward delay constant;
4) in core router, set up N fine-grained packet waiting list of time, being used to receive the route time limit belongs to [0, the common real time business packet of N * u), n the formation R (n) in the above-mentioned N formation be used to receive the route time limit belong to [(n-1) * u, the packet of n * u); The route time limit span of fine-grained packet waiting list of described time is the basic u of unit of delay;
5) in core router, set up the packet waiting list of M time coarseness, being used to receive the route time limit belongs to [U, (M+1) * U) common real time business packet, m formation T (m) in the above-mentioned M formation is used to receive the route time limit and belongs to [m * U, (m+1) * U) packet, the route time limit span of the packet waiting list of described time coarseness is U;
6) set up first formation F and tail formation Z, first formation F is used to receive minus packet of route time limit, and tail formation Z is used to receive the packet of route time limit greater than (M+1) * U;
7) foundation of transmit queue is followed successively by fine-grained packet waiting list of formation F, a N time, the packet waiting list of a M time coarseness, tail formation Z in proper order.
The described basic u of delay unit is less than described forward delay constant σ.
Core router sends the method for common real time business packet and is in the described method:
1) the packet waiting list of fine-grained packet waiting list of transmit queue F, a N time, a M time coarseness, the packet among the tail formation Z successively; Variable initial value returns to form after transmission finishes;
When 2) updated time B (k) arrives, join the afterbody of formation F successively according to sending order for the packet that does not send in the fine-grained packet waiting list of time;
When 3) updated time B (k) arrives, also need the allocation of packets among the packet waiting list T (1) of first time coarseness in fine-grained packet waiting list of time, the packet waiting list of remaining time coarseness is promoted forward successively, and qualified packet among the formation Z is joined formation T (M).
Core router upgrades the method in common relative time limit of real time business packet and is in the described method:
1) the transmitting time t_snd of the core router record data bag t_arv time of advent and packet;
Upgrade it when 2) core router sends this packet and be limited to β+σ-(t_snd-t_arv), the relative time limit when wherein β enters this core router for this packet when relative.
In the described method, at non-congestion state, the real time business test packet is identical with the processing procedure of common real time business packet in core router, but under congestion state, core router changes to real time business test crash packet to the real time business test packet, and is placed into the best effort rear of queue; Core router is transmitted real time business test crash packet by the best effort formation.
The method for building up of described real time business is:
1), distributes certain RSVP to give real time business, and be this partial service setting transmission priority at the output interface of each router;
2) before sending the real time business data, the edge router of transmitting terminal sends the real time business test packet to the edge router of receiving terminal;
3) the edge router inspection of receiving terminal receive the real time business packet time, if found real time business test crash packet, just refuse this calling; Otherwise, set up this real time business.
The method for routing foundation of described real time business is: add a newly-built attribute field in the routing table of router, when the route entry of router changes, it is effective that router is provided with the newly-built sign of this route entry, after waiting for the effective duration τ of newly-built sign, router just upgrades this route entry newly-built be masked as invalid; When router was exported common real time business packet, if the newly-built of corresponding route entry is masked as effectively, then this packet is set was the real time business test packet to router.
The present invention has following technique effect:
1, the queue scheduling algorithm that proposes in the present invention is low at the computation complexity of core router.In core router, limit value is grouped into several limited formations during according to packet relative, and between these formations, order sends, and computation complexity only is 0 (1).
2, the queue scheduling algorithm that proposes in the present invention is also lower at the computation complexity of edge router, only needs according to the token degree of depth in the token controller to be set the relative time limit of mark and gets final product.This method is simple than core shake dummy clock method, does not need edge router to calculate the slack variable of every paths.
3, the queue scheduling algorithm of the present invention's proposition can be controlled the queueing delay of each packet at router, thereby guarantees transmission delay end to end.
4, the queue scheduling algorithm of the present invention's proposition is higher than simple fifo queue dispatching algorithm bandwidth usage efficient, can provide bigger assurance bandwidth for real time business under same network environment.
5, the present invention propose based on the access control technology of measuring, can guarantee the end-to-end time delay of the queue scheduling of coarseness.
6, the present invention propose based on the access control technology of measuring, need on core router, not safeguard the state information of each session, have stronger extensibility.
7, the present invention can protect the service quality of real time business preferably when the network route changes; When Internet resources are sufficient, can provide good service quality for the real time business that transmission path changes; When Internet resources are not enough, can end the real time business that transmission path changes automatically, thereby guarantee the service quality of other real time business.
Description of drawings
Fig. 1 controls prolate-headed cut-away view for the delay of packet among the present invention;
Fig. 2 is network equipment annexation figure of the present invention;
Fig. 3 is an edge device cut-away view of the present invention;
Fig. 4 is nucleus equipment internal queues scheduling structure figure of the present invention;
Fig. 5 is call control procedure figure of the present invention;
Fig. 6 is a method flow diagram of the present invention.
Embodiment
The present invention is described in detail below in conjunction with the drawings and specific embodiments.
Method flow diagram of the present invention as shown in Figure 6, present embodiment is based on the IPv6 network environment, realizes that this service quality guarantees system.
Protocol extension
In order to satisfy the requirement that service quality guarantees, need the existing IPv6 standard of expansion, in IP packet header, increase by one and postpone the control extension header, its value is tentative to be 102, corresponding keyword is DLCT.After edge router is received user's real time business packet, in data packet head, increase delay control extension header; Arrive the edge router of Correspondent Node when the real time business packet after, the edge router deletion postpones the control extension header, is transmitted to the user of Correspondent Node again.As shown in Figure 1, this prolate-headed form is as follows:
First eight bits group is the type in next packet header;
Second eight bit group is prolate-headed length, indicates the prolate-headed length of token level, represents with the quantity of eight bit groups, and do not comprise 8 eight bit groups that begin most; Its value is 0;
The 3rd eight bit group is prolate-headed version (Message Version), and its value is 1, shows that current version is 1, and other is worth reservation;
Preceding four bits of the 4th eight bit group are the test signs, and 0B1000 is the real time business test packet, and 0B1100 is a real time business test crash packet, and 0B0000 is common real time business packet; Four bits in back are the grade of service (Service Level), and its value is positive integer, show the grade of real time business;
Five, six, seven is relative time limit (Relative Deadline) with eight eight bit groups, and span is an integer, and unit is 100 microseconds.
Fig. 2 is the structure of IPv6 network environment, and service quality guarantees that system is distributed on edge router and the core router.The basic u of delay unit that native system limits each core router is 800 microseconds, and forward delay constant σ is 3 milliseconds, limits and transmits jumping figure end to end less than 16, and queueing delay just guarantees in 48 milliseconds so end to end.
Queue scheduling
The method for ensuring service quality that this patent proposes adopts the thinking of Differentiated Services, router in the zone is divided into edge router and core router, edge router is preserved the state information of each data flow, and limit information is encoded in the delay control extension header of packet relatively the time, the state information of each session of core router Maintenance free only need get final product according to the relative time limit information processing data bag in the data packet head.
This method is not considered the jumping figure of circuit transmission delay and data transfer path, and these problems all are responsible for by the network planning and terminal system.This method makes it to guarantee the end-to-end transmission delay of packet less than forward delay constant σ by limiting the queueing delay of real time business packet in core router.
Because the variation of offered load, packet may shift to an earlier date or delay the arrival next hop router, and this paper calls the relative time limit to this time difference β.Just be limited in the time of relatively, expression arrives in advance; Be limited to negatively in the time of relatively, expression postpones to arrive.For the packet that arrives in advance, its time of waiting in formation can be greater than the forward delay constant, but should be less than forward delay constant and relative time limit sum.Core router allows littler packet of other relative time limit send earlier by allowing the packet that arrives in advance wait for the longer time in formation, thereby improves the bulk delay performance of network system.
For each real time business distributes a token controller, as shown in Figure 3, dispose its maximum token depth delta at edge router, token arrival rate α, wherein the maximum token depth delta must be greater than the length of maximum data packet.
When length is that the common real time business packet of L is when arriving edge router, if the current residual token quantity δ of token controller just sends this packet greater than the length L of current data packet, the relative time limit β that identifies this packet is (Δ-δ)/α, and current residual token quantity reduced L.Otherwise, the current residual token quantity of waiting for token controller greater than data packet length after, send this packet again, the relative time limit β that identifies this packet is (Δ-δ)/α, and current residual token quantity reduced L.
When packet arrives core router, core router writes down the time that the reaches t_arv of this packet, transmitting time t_snd with packet, and be limited to β+σ-(t_snd-T_arv), the relative time limit when wherein β enters this core router for this packet when when sending, upgrading this packet relative;
As shown in Figure 4,, set up 34 formations at the output interface of core router, be respectively F, R (1), R (2) ..., R (16), T (1), T (2) ..., T (16), Z.Pointer PR value is 1,2 ..., 16 o'clock, the current transmit queue of indication be respectively R (1), R (2) ..., R (16), value is 0, represents that this pointer is invalid, the initial value of pointer PR is 0.Pointer PT value is 1,2 ..., 16 o'clock, the current transmit queue of indication be respectively T (1), T (2) ..., T (16), value is 0, represents that this pointer is invalid, the initial value of pointer PT is 0.
During initialization, 34 formations on the core router output interface all are empty, the time that its busy period begins is 0, the time that busy period finishes is E, this busy period is divided into length is K of U (12.8 milliseconds) and upgrades the period, the starting point of K period is 0 constantly, B (1), B (2) ..., B (K-1).
When common real time business packet p arrived in k the renewal period at router, the router time limit r of this packet deducts k the B zero hour (k) that upgrades the period for current time t, add the relative time limit when this packet enters core router, add forward delay constant σ.
If this router time limit r is less than zero, then this packet is put into formation F,
If this router time limit r is less than n * 800 microseconds, more than or equal to (n-1) * 800 microsecond, then this packet is put into formation R (n); If current pointer PR is zero, then upgrading pointer PR is n; If current pointer PR value is non-vanishing, and n is less than pointer PR, and then the value of PR changes to n;
If this router time limit r is less than (m+1) * 12800 microsecond, more than or equal to m * 12800 microseconds, then this packet is put into formation T (m); If current pointer PT is zero, then upgrading pointer PT is m; If current pointer PT value is non-vanishing, and m is less than pointer PT, and then the value of PT changes to m;
Otherwise then this packet is put into formation Z;
When sending, interface selects packet to send from these 34 formations, and its system of selection is such.
If formation F is not empty, then the team of a transmit queue F packet;
Be not equal to zero if formation F is sky and pointer PR, just check whether formation R (PR) is empty.If formation R (PR) is not empty, then team's packet of transmit queue R (PR); Otherwise pointer PR adds one, and whether test R (PR) once more is empty; If up to R (16) all is empty, then putting pointer PR is zero;
When formation F is empty, pointer PR is zero and pointer PT when being not equal to zero, just checks formation T (PT).When if formation T (PT) is not empty, with regard to the packet of transmit queue T (PT); Whether if when formation T (PT) was empty, pointer PT added one, reexamining formation T (PT) is empty.If up to T (16) all is empty, then putting pointer PT is zero;
When formation F is empty, pointer PR is zero and pointer PT when also being zero, just checks whether formation Z is empty.If formation Z is not empty then team's packet of transmit queue Z; Otherwise router just is through with this busy period, and PT and PR become initial value of zero.
When updated time B (k) arrives, if formation R (1), R (2) ..., still have among the R (16) packet to fail to send, just these packets are joined successively the afterbody of formation F according to sending order.Then the packet among the formation T (1) according to its router time limit, be assigned to 16 time fine granularity formation R (1), R (2) ..., among the R (16).And with formation T (2), T (3) ..., T (16) be updated to formation T (1), T (2) ..., T (15), at last the partial data bag that belongs to T (16) among the formation Z is moved among the formation T (16), and PT and PR is become initial value of zero.
At process of transmitting, formation R (1), R (2) ..., the qualification of R (16) constantly D (1), D (2) ..., D (16) is respectively 800,1600 ..., 12800 microseconds, if D (i) has arrived constantly, but R (1), R (2) ..., the packet that do not send in addition in this i of R (i) formation, then core router enters congestion state.After core router enters congestion state, when D (j) has constantly arrived, formation R (1), R (2) ..., this j of R (j) formation packet to be sent such as all do not have, then core router enters non-congestion state.Under congestion state, core router changes to 0B1100 to the test sign in the real time business test packet packet header, thereby this packet is changed to real time business test crash packet, and is placed into the best effort rear of queue; Core router is transmitted real time business test crash packet by the best effort formation.At non-congestion state, core router adopts and the identical processing method of common real time business packet, handles the real time business test packet.Core router adopts with the method for best effort and handles real time business test crash packet.
Call out control
At the output interface of each router, distribute certain RSVP to give real time business, and provide higher dispatching priority for this partial service.This method adopts RSVP as the call signaling between terminal and the edge router.As shown in Figure 5, before sending the real time business data, transmit leg sends Path message earlier to edge router, and sets up relevant state information at edge router.The edge router of transmitting terminal is transmitted Path message again to the edge router of receiving terminal, and 1 second thereafter kind in the time, and the resource characteristics that requires according to Path is to the real time business test packet of the edge router sending order numbering of receiving terminal.
The real time business packet that the edge router inspection of receiving terminal is received is just refused this calling if found real time business test crash packet, otherwise, transmit Path message to receiving terminal.The edge router of receiving terminal is received the Resv message that terminal is returned, and is transmitted to the edge router of transmitting terminal again, and is transmitted to transmitting terminal.Transmitting terminal sends acknowledge message ResvConf at last and gives receiving terminal, and calling has just been set up like this.
After treating conversation end, terminal sends PathTear or ResvTear, is released in the edge router reserved resource.
Routing change
In the route entry of router, increase newly-built attribute field, when increasing or change route entry, the newly-built of this route entry is set to be masked as effectively, and start newly-built sign valid timing device, the length of newly-built sign valid timing device is 1 second kind, after newly-built sign valid timing device is overtime, be provided with newly-built be masked as invalid.When router was exported common real time business packet, if the newly-built of corresponding route entry is masked as effectively, then this packet is set was the real time business test packet to router.In the normal course of operation of real time business,, just end this real time communication business if receive real time business test crash packet.
Claims (10)
1. the internet QoS assurance method based on time granularity the steps include:
1) in the packet header of real time business packet, increases a delay control extension header that is used for record data bag state information; Described real time business packet comprises general service packet, real time business test packet and real time business test crash packet;
2) edge router is transmitted the common real time business packet of receiving, and the relative time limit of this packet is set according to current residual token quantity;
3) core router calculates the route time limit of this packet according to the relative time limit of common real time business packet;
4) core router is set up the packet waiting list according to the route time limit of each common real time business packet; Described waiting list is divided into two kinds of different time granularities, N fine-grained formation with basic delay unit as its time limit span, the formation of M coarseness postpones unit as its time limit span so that N is doubly basic, every through the doubly basic duration that postpones unit of N, just the allocation of packets in first coarseness formation in the fine granularity formation, remaining coarseness formation is promoted forward successively;
5) core router relative time limit of sending common real time business packet and upgrading this packet.
2. the method for claim 1 is characterized in that described delay controls prolate-headed data structure and be: the type in next packet header, prolate-headed length, prolate-headed version, test sign, the grade of service, time limit relatively.
3. method as claimed in claim 2 is characterized in that edge router is transmitted the common real time business packet of receiving and the method that the relative time limit of each packet is set is:
1) edge router disposes its maximum token depth delta and token arrival rate α for each real time business distributes a token controller, and the described maximum token degree of depth is greater than the length of maximum data packet;
2) length is the common real time business packet of L when arriving edge router, if current residual token quantity δ during greater than L, then sends this packet, it is set is limited to β=(Δ-δ)/α, and current residual token quantity reduced L when relative; Otherwise after waiting for that current residual token quantity δ is greater than L, send this packet again.
4. method as claimed in claim 3 is characterized in that the method that core router is set up the packet waiting list according to the route time limit of each common real time business packet is:
1) two kinds of time granularities are set in core router, fine granularity is the basic u of unit of delay, and the length of coarseness U is N fine granularity, i.e. U=N * u;
2) will be divided into K the busy period and upgrade the period, every section time span is U, writes down the starting point moment B (k) of each period;
3) calculate the route time limit r that upgrades the common real time business packet that arrives in the period at k, r=t-B (k)+β+σ, wherein t is a current time, in the relative time limit when β enters this core router for this packet, σ is the forward delay constant;
4) in core router, set up N fine-grained packet waiting list of time, being used to receive the route time limit belongs to [0, the common real time business packet of N * u), n the formation R (n) in the above-mentioned N formation be used to receive the route time limit belong to [(n-1) * u, the packet of n * u); The route time limit span of fine-grained packet waiting list of described time is the basic u of unit of delay;
5) in core router, set up the packet waiting list of M time coarseness, being used to receive the route time limit belongs to [U, (M+1) * U) common real time business packet, m formation T (m) in the above-mentioned M formation is used to receive the route time limit and belongs to [m * U, (m+1) * U) packet, the route time limit span of the packet waiting list of described time coarseness is U;
6) set up first formation F and tail formation Z, first formation F is used to receive minus packet of route time limit, and tail formation Z is used to receive the packet of route time limit greater than (M+1) * U;
7) foundation of transmit queue is followed successively by fine-grained packet waiting list of formation F, a N time, the packet waiting list of a M time coarseness, tail formation Z in proper order.
5. method as claimed in claim 4 is characterized in that the described basic u of delay unit is less than described forward delay constant σ.
6. method as claimed in claim 5 is characterized in that the method that core router sends common real time business packet is:
1) the packet waiting list of fine-grained packet waiting list of transmit queue F, a N time, a M time coarseness, the packet among the tail formation Z successively; Variable initial value returns to form after transmission finishes;
When 2) updated time B (k) arrives, join the afterbody of formation F successively according to sending order for the packet that does not send in the fine-grained packet waiting list of time;
When 3) updated time B (k) arrives, also need the allocation of packets among the packet waiting list T (1) of first time coarseness in fine-grained packet waiting list of time, the packet waiting list of remaining time coarseness is promoted forward successively, and qualified packet among the formation Z is joined formation T (M).
7. method as claimed in claim 4 is characterized in that core router upgrades the method in common relative time limit of real time business packet and is:
1) the transmitting time t_snd of the core router record data bag t_arv time of advent and packet;
Upgrade it when 2) core router sends this packet and be limited to β+σ-(t_snd-t_arv), the relative time limit when wherein β enters this core router for this packet when relative.
8. as claim 6 or 7 described methods, it is characterized in that at non-congestion state, the real time business test packet is identical with the processing procedure of common real time business packet in core router, but under congestion state, core router changes to real time business test crash packet to the real time business test packet, and is placed into the best effort rear of queue; Core router is transmitted real time business test crash packet by the best effort formation.
9. method as claimed in claim 2 is characterized in that the method for building up of described real time business is:
1), distributes certain RSVP to give real time business, and be this partial service setting transmission priority at the output interface of each router;
2) before sending the real time business data, the edge router of transmitting terminal sends the real time business test packet to the edge router of receiving terminal;
3) the edge router inspection of receiving terminal receive the real time business packet time, if found real time business test crash packet, just refuse this calling; Otherwise, set up this real time business.
10. method as claimed in claim 2, the method for routing foundation that it is characterized in that described real time business is: add a newly-built attribute field in the routing table of router, when the route entry of router changes, it is effective that router is provided with the newly-built sign of this route entry, after waiting for the effective duration τ of newly-built sign, router just upgrades this route entry newly-built be masked as invalid; When router was exported common real time business packet, if the newly-built of corresponding route entry is masked as effectively, then this packet is set was the real time business test packet to router.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2007103040814A CN101212417B (en) | 2007-12-25 | 2007-12-25 | Time granularity based internet QoS assurance method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2007103040814A CN101212417B (en) | 2007-12-25 | 2007-12-25 | Time granularity based internet QoS assurance method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101212417A CN101212417A (en) | 2008-07-02 |
| CN101212417B true CN101212417B (en) | 2010-04-21 |
Family
ID=39612102
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2007103040814A Expired - Fee Related CN101212417B (en) | 2007-12-25 | 2007-12-25 | Time granularity based internet QoS assurance method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101212417B (en) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104009935B (en) * | 2013-02-22 | 2018-01-09 | 中兴通讯股份有限公司 | A kind of priority dispatching method and device |
| CN104734991B (en) * | 2013-12-19 | 2017-09-15 | 中国科学院沈阳自动化研究所 | A kind of end-to-end time delay towards industrial backhaul network ensures transmission dispatching method |
| CN107526643A (en) * | 2017-07-20 | 2017-12-29 | 郑州云海信息技术有限公司 | The method and system that a kind of message delay is sent |
| CN107637052A (en) * | 2017-08-02 | 2018-01-26 | 福建联迪商用设备有限公司 | A kind of business data processing method, client, service end and system |
| CN107979535B (en) * | 2017-10-31 | 2021-03-02 | 新华三技术有限公司 | Message forwarding method and device |
| EP3981133B1 (en) * | 2019-07-22 | 2024-09-25 | Huawei Technologies Co., Ltd. | Control device, switch device, methods and computer-readable storage medium |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6738387B1 (en) * | 2000-06-15 | 2004-05-18 | National Science Council | Design of scalable techniques for quality of services routing and forwarding |
| CN1881899A (en) * | 2006-04-30 | 2006-12-20 | 国家数字交换系统工程技术研究中心 | Network flow monitoring system and method |
| CN101075968A (en) * | 2007-07-23 | 2007-11-21 | 中兴通讯股份有限公司 | Method and apparatus for providing region-classifying service |
-
2007
- 2007-12-25 CN CN2007103040814A patent/CN101212417B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6738387B1 (en) * | 2000-06-15 | 2004-05-18 | National Science Council | Design of scalable techniques for quality of services routing and forwarding |
| CN1881899A (en) * | 2006-04-30 | 2006-12-20 | 国家数字交换系统工程技术研究中心 | Network flow monitoring system and method |
| CN101075968A (en) * | 2007-07-23 | 2007-11-21 | 中兴通讯股份有限公司 | Method and apparatus for providing region-classifying service |
Non-Patent Citations (2)
| Title |
|---|
| Andrews, M.等.Minimizing End-to-end Delay in High-speed Networks witha Simple Coordinated Schedule.INFOCOM ＇99. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE1.1999,1380-388. * |
| Ion Stoica等.Providing guaranteed services without per flow management.Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication ,1999.1999,81-94. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101212417A (en) | 2008-07-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| KR100431191B1 (en) | An apparatus and method for scheduling packets by using a round robin based on credit | |
| Ramabhadran et al. | Stratified round robin: A low complexity packet scheduler with bandwidth fairness and bounded delay | |
| Guérin et al. | Quality-of-service in packet networks: basic mechanisms and directions | |
| US7142513B2 (en) | Method and multi-queue packet scheduling system for managing network packet traffic with minimum performance guarantees and maximum service rate control | |
| GB2324678A (en) | An earliest deadline first communications cell scheduler | |
| CN101212417B (en) | Time granularity based internet QoS assurance method | |
| Ramabhadran et al. | The stratified round robin scheduler: design, analysis and implementation | |
| US5933414A (en) | Method to control jitter in high-speed packet-switched networks | |
| EP1471694B1 (en) | Method for dimensioning bandwidth in voice-over-IP networks | |
| Francini et al. | A weighted fair queueing scheduler with decoupled bandwidth and delay guarantees for the support of voice traffic | |
| Kaur et al. | Core-stateless guaranteed throughput networks | |
| Mowbray et al. | Capacity reservation for multimedia traffic | |
| JPH10322368A (en) | Method for impartiality loss arrangement of packet | |
| JP4087279B2 (en) | BAND CONTROL METHOD AND BAND CONTROL DEVICE THEREOF | |
| Chiussi et al. | Implementing fair queueing in ATM switches. I. a practical methodology for the analysis of delay bounds | |
| Millan-Lopez et al. | Using the imprecise-computation technique for congestion control on a real-time traffic switching element | |
| Bakiras et al. | Quality of service support in differentiated services packet networks | |
| Wu | Link-sharing method for ABR/UBR services in ATM networks | |
| Li et al. | A new smoothed fair scheduling algorithm based on timeslot reservation | |
| Liu et al. | A fair queueing algorithm for multiple-streams delay-bounded services | |
| Zhu et al. | A new scheduling scheme for resilient packet ring networks with single transit buffer | |
| Graffi et al. | Taxonomy of message scheduling strategies in context of peer-to-peer scenarios | |
| Le Pocher et al. | An application‐and management‐based approach to ATM scheduling | |
| Tu et al. | Enhanced bulk scheduling for supporting delay sensitive streaming applications | |
| Sharafeddine et al. | A dimensioning strategy for almost guaranteed quality of service in voice over IP 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 | ||
| C17 | Cessation of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20100421 Termination date: 20121225 |