KR100525345B1 - Class Updater and Class Updating Method In Differentiated Services Network - Google Patents

Abstract

The present invention relates to a technique for providing a packet-based differential service (DiffServ) in the Internet, and more particularly, to an apparatus and method for updating a class in a differential service network. The apparatus of the present invention includes a timer task module for updating a timer table and generating a message requesting generation of a marker packet according to a predetermined algorithm; A differential service control module for managing various tables and lists; An input module for processing a packet received from a previous node; A marker generation and class update module for generating a marker packet upon receiving a message from the timer task module and updating a class of a packet input through the input module with reference to the table and list according to a predetermined procedure; And a scheduler module for scheduling an input packet according to the output of the marker generation and class update module and transmitting the same to a next node.

Therefore, when using the differential service class updater according to the present invention on the Internet, it is possible to satisfy end-to-end delay and loss requirements for each flow concluded by agreement between subscribers and service providers, and dynamic differential service and class load distribution according to the current load. It offers the advantage of enabling this.

Description

Class Updater and Class Updating Method In Differentiated Services Network}

The present invention relates to a technology for providing a packet-based differential service in the Internet, and more particularly, to an apparatus and method for updating a class in a differential service network.

In recent years, the standardization of IPv6 technology in the Internet field has been centered on the IETF. The basic header and extension header format for IPv6 has been defined in RFC2460, and RFC2474, RFC as a standard for guaranteeing quality of service (QoS) in IPv6. 2475 has been standardized.

As a next-generation Internet structure that can guarantee the QoS required by the user, the Differentiated Services (DiffServ) method defines a Per Hop Behavoir (PHB) for IP packets using a DiffServ Code Point (DSCP). If DSCP is specified for user flow packets arriving at the differential service domain, all packets with the same DSCP code are processed in the same way.

As such, traffic composed of a plurality of different flows is classified into classes. In other words, the standardization technique for the service of classifying specific flow groups into classes has suggested a framework that can provide the agreement quality for bandwidth, delay, jitter, and loss required for each class.

However, in the conventional method, the processing of class update of the flow between classes is not provided, but only the fixed class is processed. Therefore, the flexibility of the data flow is reduced, which shows the limitations in operation. There is a problem that results in not meeting the treatment criteria.

In other words, the delay characteristic as a requirement is that, in the case of unidirectional delay, that is, the time required from the time of receiving one IP packet in the ingress POP to the transmission in the egress POP is four components. It comprises a propagation delay (PD), switching / processing delay (SPD), scheduling / queuing delay (SQD), and serialization delay (SD). 5ms per 1000km for PD, 10-20ms per packet for SPD, and 6ms for 2Mbps 1500byte packets, 6ms for STM-1 80ms and STM-64 1.25ms for SPD. In ITU G.114, the one-way delay limit target for VoIP services is set to 150ms, and in real business data applications, it is common to have a round trip time (RTT) of 250ms. In this regard, even if the router forwards the packet using the queuing delay ratio for each class, such other components cause in-network delay.

As such, the processing load in the core network node is reduced by assigning and processing each flow as an aggregated flow for each specific flow, which maintains an extensive state table for the flow. By arranging and managing the network traffic, frequent route changes and failures occur due to the congestion of router traffic caused by a particular class of bursts, resulting in inefficient and delayed network operation, resulting in poor quality of end-to-end communication.

It is an object of the present invention to provide a class updating apparatus and a class updating method in a differential service network that will be in charge of class update processing of a flow in order to solve the above problems of the prior art. That is, when using the class updater of the present invention, it is possible to prevent burst congestion due to a specific class as well as load balancing, and to solve the inverse function of the end-to-end delay caused by the complicated admission control processing at the edge node as in the prior art. .

In order to achieve the above object, the flow class updating apparatus in the differential service network of the present invention manages a timer task module, various tables and lists for generating a message for updating a timer table and generating a marker packet according to a predetermined algorithm. A differential service control module for processing, an input module for processing a packet received from a previous node, a marker packet when a message is received from the timer task module, and generating the marker packet by referring to the table and list according to a predetermined procedure. It characterized in that it comprises a marker generation and class updating module for updating the class of the packet input through the scheduler module for transmitting the input packet to the next node according to the output of the marker generation and class update module.

In addition, the flow class update method in the differential service network of the present invention, in the method for updating the class of the flow in the differential service network, the step of assigning a class to the flow input from the differential service network, the timer for the flow Generating a marker packet when there is a delay calculation request from a task, calculating an end-to-end average delay value, and updating a corresponding table; and determining whether the flow is a marker packet when there is no delay calculation request from the timer task for the flow. And updating the class.

Hereinafter, with reference to the accompanying drawings, preferred embodiments of the present invention will be described in detail.

1 is a diagram illustrating a differential service providing network including a differential service class updater according to an embodiment of the present invention, that is, a DS region including DS domains 110 and 120 in an environment to which differential service code points (DSCP) is applied. 100) is shown.

Referring to FIG. 1, the DS area 100 includes two DS domains 110 and 120 and a network management server 102 that provides a network management function to provide an Internet differential service. A service level agreement (SLA) server 104 is included.

The first DS domain 110 is composed of a router 130, a core node 140, and edge nodes 150 to connect an external network (internet: 160). 106 is connected. The second DS domain 120 is composed of a router 130, a core node 140, and edge nodes 150 for connecting to another domain, and subscriber stations 106 are connected to the edge node 150. have.

Here, the edge node 150 or the core node 140 is implemented as a switching system having a differential service class updater of the present invention, and the edge node 150 is connected to an ingress edge switching node according to a function. It can be divided into an egress edge switching node, and a core node or a boundary router connects edge nodes.

2 is an overall configuration block diagram of a differential service class updater according to the present invention. In the differential service environment as shown in FIG. 1, it is necessary to process load balancing of a differential service class in order to process packets smoothly without load balancing and traffic congestion. As shown in FIG. 2, the differential service class update apparatus 200 according to the present invention includes an input module 210, a marker generation / class update module 220, a scheduler module 230, and a differential service control module 240. , The table and list unit 250, the timer task module 260, the delay calculation module 270, and the one-way distribution module 280 handle load balancing of the differential service class.

2, the input module 210 processes a packet received from a previous node to identify a marker packet and processes an input. The marker generation / class update module 220 generates a marker packet and updates the class class according to the request of the timer task module 260. The scheduler module 230 actually operates the processed result and transmits the packet to the next node.

That is, the input module 210 opens a basic defined port, waits for input of IP packets, and performs error verification on the input packet. If there is no error, the marker generation / class update module 220 generates a marker according to the marker insertion request of the timer task module 260, and processes the marker based on the related tables 252 and 254 and the lists 256 and 258. Becomes All packets processed in the processing of the message are sent to the next node through the processing of the scheduler module 230.

The differential service control module 240 performs various control functions of a system for processing class-based load balancing. The differential service control module 240 not only manages global variables related to system operation, but also manages various list tables, and manages overall system operation and failure. That is, a matching function with the external network management server 102 and the SLA server 104, a traffic conditioning agreement (TCA) matching function, and an operator command matching function are performed.

The table / list unit 250 is composed of a flow table 252, a measurement state timer table 254, a class delay ratio list 256, and a class band / delay list 258 necessary for class update processing. The timer task module 260 performs a marker packet generation function. The timer task module 260 is activated at a predetermined period according to a class delay priority cycle, and the period can be processed in association with the input module 210.

The differential service control module 240 operates the flow table 252 to manage flows. The flow table 252 has a field “Fi”, which is a flow identification number to be managed, as shown in Table 1 below. The "DC" field, the "DR" field for delay requirements, the "MD" field for delay measurements, and the "MDC" field for handling the maximum delay class are operated.

Flow table Fi DC RD MD MDC

In the measuring status timer table, as shown in Table 2, time values set by the timer task module 260 are set.

Measurement state timer table ST (i) ST (i-1) .... .... ST (i-n)

Meanwhile, the Class Delay Ratio List is shown in Table 3 below, and the Class Bandwidth / Delay List is shown in Table 4 below.

Class delay ratio list S (i) S (i-1) ..... .... S (i-n)

Class band / delay list B (i) B (i-1) .... .... B (i-n)

3 is a format of a marker packet according to the present invention. The marker packet format 300 uses a hop-by-hop extension header, which is processed by the input module 210 when the IP packet arrives at an incoming edge node of the differential service domain. In response to the request of the timer task module 260, the marker generation module 220 is activated to fill the necessary fields and then encoded.

Referring to FIG. 3, the marker packet header 300 is located after the IP header, and the next header 310 of the IP header fills a zero value indicating the marker header. The first four octets (0 through 31) of the marker packet are identical to the contents of the IPv6 extension header of the IETF. The first start bit "D" 350 field of the selector (Options) indicates the path direction of the packet flow. If "0", the delay value is calculated. The 7-bit QoS identifier 360 field may represent 128 applications with the same source, and the Request IDentifier 370 field is an identifier for recording a resource requirement or delay counter value continuing from the next octet. In the case of the marker packet of the present invention, the local delay delay counter (380) field, which is a local octet total delay counter of 4 octets, is represented by a nano second delay. The remaining fields 320, 330, and 340 apply in the same manner as the IETF extension header specification. Some of the modules of FIG. 2 may be implemented and function in a host.

4 is a flowchart illustrating an operation procedure of a differential service class updater according to the present invention.

Referring to FIG. 4, in step 401, a packet input is waited and processed. In step 402, it is determined whether a delay calculation request message arrives from the timer task module 260, and when a message arrives, a marker is generated in step 403. In step 405, a delay sum is inserted and a corresponding table is updated.

If there is no delay calculation request, the packet type is determined in step 406, and if it is a marker packet, it is determined in step 408 whether it is an edge node. If the D bit is an edge node and the bit is 1, the class is updated in step 410. If the D bit is 0, the delay sum is inserted in step 412 and the table is updated. In step 413, the marker packet is returned. If the marker packet is not an edge node and the D bit is 0, a delay sum is inserted in step 412, the table packet is updated, and a marker packet return is processed in step 413.

After the return process or if it is not a marker packet or not an edge node and the D bit is not 0, the input packet is transmitted to the next node (step 414).

As such, if the packet is a marker and its node is the edge router that sent the original marker, it checks the D bit. If the D bit is 1, step 410, which is a class update process, is performed.

In addition, in the case of the core router other than the edge in step 408, the step D 411 of checking the D bit of the marker packet is calculated, and when the D bit is 0, the local delay value and the related table value are calculated and updated (step 412). If not 0 in step 411, the scheduler transmits to the next node (step 414).

On the other hand, after the step 412, a packet return process is performed in which the source and destination addresses of the IP are replaced and the D bit of the marker packet is set to 1 (413).

As described above, the present invention is an algorithm for calibrating a class of a flow, and an estimate of an end-to-end average delay value for the flow and a delay class of the flow so that the value matches the average delay value that the flow can take and is required. Change it. Therefore, the marker packet is measured using the QoS ID 360 field and the Request ID 370 field of the marker packet format to measure the marker packet and corresponding to the corresponding Fi in the flow table 252 upon return arrival. Replace field values with measurements.

This correction algorithm resides in and executes a router (node) in the differential service network of FIG. At this time, the class update module 220 calculates an end-to-end average delay value for each flow using a marker. If this value exceeds the requested value DR, change to the next higher delay class within the maximum delay class (MDC) of the flow.

On the other hand, when the flow is changed to the lower delay class, the average delay for the lower class is obtained by using the delay ratio of the delay ratio list 256 for each class, and as a result, it is changed only when the condition of the following Equation 1 is satisfied. do.

Where d is a delay value, i is a delay class, i-1 is a lower delay class, f is a flow, and RD is an average delay request value. That is, in the delay class update process 410, the uniform distribution module 280 of FIG. 2 is started to exclude a case in which the delay class is changed but the profits that need to be changed quickly are less. "K" in the equation is a value between randomly chosen random variables (0,1) forming a uniform distribution.

5 is a flowchart illustrating a timer task operation procedure of the differential service class updater according to the present invention.

Referring to the drawing, the timer task module 260 calculates an average burst size for each input flow while passing through an infinite loop, and corrects the marker packet generation module driving table value for each flow when the limit value is exceeded and applies the newly applied value. The delay calculation control request message informs the system process.

First, the processor waits while performing an infinite loop until the timer event is processed (step 501), and measures the average burst size for each flow when operated by the timer event (step 502). Check if the average burst size exceeds the set threshold (503) and change the timer value of the measurement state timer (254) if exceeded (step 504). Thereafter, a message for notifying delay calculation is generated (step 505). At this time, for the flow that does not exceed the check result limit of step 503, the marker packet is left as it is generated by the preset timer table 254, and waits for an event for the next flow.

As described above, according to the present invention, when using the differential service class updater according to the present invention on the Internet, it is possible to satisfy end-to-end delay and loss requirements for each flow concluded by agreement between the subscriber and the service provider, and the current load To provide dynamic differential service and class load balancing. In addition, the present invention provides reliability to eliminate the error of round trip time (RTT) due to the asymmetrical characteristics, and when the class update is applied, frequent occurrence of reciprocation between classes due to the flow of more than necessary flows due to class adjustment and You can avoid exceeding the delay limit.

In addition, it is possible to provide differential services without the need for additional agents such as bandwidth brokers (BBs), while maintaining a proportional differential service framework, but guaranteeing end-to-end service quality to adapt to real-time services such as VoIP services. In addition, the marker packet can be flexibly applied to the absolute differential model.

What has been described above is only one embodiment that describes a flow class update device and an update method in a differential service network according to the present invention, and the present invention is not limited to the above-described embodiment, and is claimed in the following claims. Without departing from the gist of the present invention, any person having ordinary knowledge in the field of the present invention will have the technical idea of the present invention to the extent that various modifications can be made.

1 is a configuration diagram of a differential service providing network including a differential service class updater according to the present invention;

2 is an overall configuration diagram of a differential service class updater according to the present invention;

3 is a format of a marker packet according to the present invention;

4 is a flowchart illustrating an operation procedure of a differential service class updater according to the present invention;

5 is a flowchart illustrating a timer task operation procedure of the differential service class updater according to the present invention.

Explanation of symbols on main parts of drawing

100: DS area (differential service area) 102: network management server

104: SLA server 106: subscriber terminal

110: first DS domain 120: second DS domain 130: router 140: core node 150: edge node 210: input module 220: marker generation / class update module

delete

delete

230: scheduler 240: differential service control module

250: Table and List 260: Timer Task Module

270: delay calculation module 280: Ilyang distribution module

Claims (12)

A timer task module for updating a timer table according to a predetermined algorithm and generating a message requesting generation of a marker packet; A differential service control module for managing various tables and lists; An input module for processing a packet received from a previous node; A marker generation and class update module for generating a marker packet upon receiving a message from the timer task module and updating a class of a packet input through the input module with reference to the table and list according to a predetermined procedure; And And a scheduler module for scheduling an input packet according to the output of the marker generation and class update module and transmitting the same to a next node. The apparatus of claim 1, wherein the class updater further comprises a uniform distribution module for excluding a change in a frequent delay class. 2. The apparatus of claim 1, wherein the table comprises a flow table and a timer table, and the list is a class delay ratio list and a class band / delay list. The format of claim 1, wherein the format of the marker packet is The first four octets consist of the next header, the header extension length, the type, and the length. The second four octets of the option consist of a 1-bit D field, a 7-bit quality of service identifier, and a 3-octet request identifier. An apparatus for updating a flow class in a differential service network, characterized in that a structure of four octets is a local delay sum counter. 5. The apparatus of claim 4, wherein the D field indicates a path direction of a packet flow, and calculates a delay value when "0" and bypasses it when "1". delete delete delete In the method of updating the flow class in the differential service network, Assigning a class to a flow input from the differential service network; Updating a table by generating a marker packet and calculating an end-to-end average delay value when there is a delay calculation request from a timer task for the flow; And Updating the class by determining whether the flow is a marker packet when there is no delay calculation request from the timer task for the flow; The class update method of the flow in the differential service network comprising a. The method of claim 9, wherein updating the class comprises: Determining whether the flow is an edge node when the flow is a marker packet and transmitting to the next node when the flow is not a marker packet; In this step, if the marker packet is an edge node and the D bit is 1, the class is updated. If the D is 0 while the marker packet is not the edge node, a delay sum is inserted to update the table and then the marker packet is returned. Method of updating the class of the flow in the differential service network, characterized in that consisting of The method of claim 9, wherein updating the class comprises: If the measured delay time of the flow is greater than the request delay time, update to the next higher delay class within the maximum delay class range; and if the delay time is smaller than the request delay time, update to the lower delay class. How to update a class of flows in. The method of claim 11, wherein the updating of the lower delay class, A method for updating a class of a flow in a differential service network, wherein the average delay for the lower class is obtained and updated when the following equation is satisfied. Where d is the delay value, i is the delay class, i-1 is the lower delay class, f is the flow, RD is the average delay request value, and k is a randomly chosen random variable (0,1) with a uniform distribution. )