KR100221317B1 - Apparatus and method of the dynamic priority queueing dscipline using the per-session frame defined by the synchronus counter operation in atm networks - Google Patents

Abstract

According to the present invention, the jitter is adjusted at each node using a frame for each connection in the ATM network, the deadline is given to the cells of each connection, and then the cells are selected and serviced in order of closeness so that the bandwidth usage efficiency is increased. The present invention relates to a dynamic priority queue service apparatus using a frame for each connection defined by counter interworking in a conventional ATM network, and a service method thereof, wherein a counter (C _{i, j} ) is installed as a per-session for each node. In the dynamic priority queue service apparatus using a frame for each connection defined by the counter interworking in the ATM network in which the counter (C _{i, j} ) is counted by the slot unit by the individual frame is defined in the connection unit, Jitter adjusting means (9 to n) for adjusting jitter of the cell data of the frame from each connection-specific virtual channel VC0 to VCn; It is characterized in that it is composed of a dynamic priority scheduler 20 which serves the cells in the order in which the deadlines are close after giving a deadline for the cells of each connection from the jitter adjusting means 9 to n.

Description

Dynamic Priority Queue Service Apparatus and Connection Method Using Frames by Connections Defined by Counter Interworking in ATM Networks

The present invention relates to a dynamic priority queue service apparatus using a connection-specific frame defined by a counter interworking in an ATM network, and a service method thereof. In particular, jitter is adjusted at each node using a connection-specific frame in an ATM network. Dynamic priority queue service device using frame-by-connection frame defined by counter interworking in ATM network which increases bandwidth usage efficiency by giving deadline for cell of frame of each connection and selecting cell to service frame, and It relates to the service method.

In general, a broadband integrated service digital network (B-ISDN) connects subscribers and service providers that are concentrated or discrete based on broadband transmission and switching technology to provide continuous real-time services with a wide bandwidth distribution and clustered data services. It is a digital communication network that comprehensively provides various services.

As such, in order to effectively process various services, ITU-T adopts an asynchronous transfer mode (ATM) as a communication method of BISDN. The asynchronous transmission mode communication method is a packet transfer method using an asynchronous time division multiplexing method, and various services can be uniformly processed by the advantages of the existing circuit switching method and the packet switching method.

In the future of ATM networks, many services will emerge that are unpredictable at present, and will have very different traffic characteristics, both qualitatively and quantitatively. In general, the service has various quality of service requirements for yield, delay, jitter, loss rate, etc., and in the network, the quality of service requirement must be guaranteed. In particular, as real-time services such as video and audio become the main services of broadband networks, the requirements for delay and jitter become very strict.

In real-time services, when information is not delivered within the time limit, it has the same effect as loss, and it is becoming very important to effectively satisfy the requirements for delay and jitter. On the other hand, in the ATM network, as cells from different connections interact in the switch, the cells must be properly controlled to guarantee the quality of service to the user.

1 is a diagram illustrating a call connection state through a node in a general ATM network. In this figure, reference numerals i-1 to i + n denote ATM network nodes, and A to F denote subscribers.

The ATM network consists of a collection of interconnected nodes, and data is transmitted from a source to a destination through the network of nodes. The figure illustrates the concept of data transmission, in which a node is connected to a transmission path. On the other hand, when data is input from the predetermined subscriber to the network, the data is reached through the predetermined node to reach a predetermined destination.

For example, when data is transmitted from subscriber A to subscriber D, it is first sent to node i-1 and then through node i and node i + 1 or node i + 2. To D).

In general, the queue service method determines the transmission order of cells in consideration of the relationship between cells stored in the queue. The queue service method manages three resources of the network, that is, bandwidth, delay limit, and buffer space, and these three resources are directly related to yield and delay loss rate, which are performance parameters of a service required by a user. Therefore, when the queue service method is effectively used and the three resources are used flexibly, the quality of service of the user can be guaranteed.

In addition, the queue service method is largely divided into work-conserving and nonwork-conserving. In the work preservation method, when a cell exists in a queue, the server never rests. In non-work preservation, even if a cell exists in the queue, it can not be serviced.

On the other hand, in the past, average delay and average yield were the main parameters of performance. In the past, the study on the preservation method of these parameters was the most important problem. This makes the thresholds for delay and jitter quite important.

In using the work preservation scheme, a big problem is that clustering gradually occurs as traffic passes through the network, which wastes network resources, thereby significantly reducing the jitter characteristic of the traffic. On the contrary, in the non-work preservation method, the server utilization rate is reduced because the server is not properly utilized, but the end-to-end support is sufficiently supported by a small amount of resources through the network with almost the traffic characteristics maintained. The jitter characteristic is improved. Thus, the non-work preservation scheme is more suitable for supporting continuity real-time services.

In recent years, many non-working scheduling algorithms have been proposed to effectively support real-time services. However, these algorithms become quite inefficient by using packet headers or frame structures that are not actually supported in ATM networks. The algorithm may include a hierarchical round robin (HRR) algorithm, a stop-and-go algorithm, an jitter earlyliest-due-date algorithm, a rate-controlled static priority algorithm (RCSP). Etc.

The hierarchical turn algorithm and the stop-and-go algorithm both use a frame technique. In this hierarchical turn algorithm, the number of cells that can be serviced in one frame period for each connection is limited. Cell rate jitter is guaranteed. However, the frame used in the algorithm is defined independently without interaction with neighboring nodes so that the delay occurring when the cell passes through the node varies from cell to cell, thereby preventing end-to-end delay jitter.

In the stop-and-go algorithm, a cell is transmitted in a one-to-one correspondence between frames of an input link and frames of an output link at an exchange node. Almost the same delay occurs in all cells belonging to such a connection, and end-to-end delay jitter is generated only by position translation in the frame, which is ensured by a fairly small amount.

FIG. 2A is a view showing a switching node i having an output link l connected to input links l 'and l' 'in the conventional stop-and-go queue service method, and FIG. 2B is shown in FIG. It is a figure which shows the frame structure in each shown link.

Both algorithms have inherent problems caused by the adoption of the frame technique, such as the problem of coupling between delay limits and band allocation units, and both algorithms employ a layered frame structure. The structure is a bit different.

In the hierarchical ordering algorithm, a frame of a lower level is defined by passing a part of a time slot of a higher level, and thus, a process of selecting a cell to be serviced is simplified because one time slot belongs to a frame of a specific level. . However, the number of time slots that can be allocated at each level is limited, so that even if there is extra bandwidth, a new connection may not be accepted.

In the stop-and-go algorithm, a plurality of frames of a higher level are added together to form a frame of a lower level. Therefore, the complexity of the implementation is increased by increasing the number of levels by using the static priority of the level unit in the process of selecting a cell to be serviced because one time slot is simultaneously included in the frames of several levels. In each level, the extra bandwidth is fully utilized, thereby preventing the degradation of bandwidth usage efficiency caused by the sequential algorithm.

In both algorithms, a layered frame structure is introduced to solve the coupling problem to some extent, but the coupling problem at each level still exists.

3 illustrates a delay jitter control method in a general packet communication network.

To date, non-working conservation algorithms use jitter to control jitter by scheduling using frame structures, or jitter at each node by transmitting jitter information using packet headers.

In the hierarchical ordering algorithm and the stop-and-go algorithm, the frame scheme is adopted to simplify the implementation. However, a coupling problem occurs, resulting in poor bandwidth allocation and delay limit allocation characteristics. In addition, the jitter EDD algorithm and the RCSP algorithm can separate the allocation of the bandwidth and the delay limit, but the scheduling-related information is sent for every packet, resulting in an overhead. This is a big problem for networks with small packet sizes.

On the other hand, in a non-working queue service method, such as a cell rate control service or a jitter control service method, the server is conceptually divided into two components, for example, a jitter adjuster and a scheduler. The jitter adjuster compensates for the distortion of traffic generated in the network. In addition, the scheduler determines the service order among the distortion-compensated cells. This functional separation allows delay limits to be flexibly allocated regardless of bandwidth, and greatly improves end-to-end jitter.

When the traffic is partially or totally reconfigured at each node so that the distortion of the traffic can be compensated for, the original traffic characteristic passes through the network without being greatly distorted. Therefore, the required buffer space can be reduced to save network resources, and the jitter characteristic of the transmitted traffic becomes good, thereby reducing the burden of jitter compensation processing on the receiving side.

In case of reconfiguring the traffic characteristics, the virtual arrival time or the estimated arrival time of the cell is calculated for the cell, and the temporary arrival time is temporarily stored in the jitter controller until the time is reached. The output will be sent to the scheduler. In other words, the cell is not scheduled as soon as it arrives, but as if the cell has not arrived until the virtual arrival time of the cell.

The jitter adjuster is divided into a rate jitter adjuster and a delay jitter adjuster according to a method of calculating the virtual arrival time. The rate jitter adjuster defines a virtual arrival time based on a distance from a previous cell, while the delay jitter adjuster is a previous node. Based on the deadline at, the virtual arrival time is calculated to completely reconstruct the traffic.

On the other hand, in the scheduler, the service order is determined by the delay requirements so that each cell performs the service within the delay limit. The scheduling method is a first-in-first-out (FCFS) method, a static priority method, and a dynamic method. It is classified in a dynamic priority manner.

The first-in, first-out method is the simplest to implement, but only one delay limit is provided regardless of the type of traffic, making it difficult to use in various network characteristics, and the fixed priority method is fixed after dividing the traffic into different classes. Service will be provided at the priorities provided to provide the delay limits for each class. However, there is a limit to the efficiency that can be achieved since fixed priorities are always used regardless of network conditions.

In the dynamic priority method, priority is provided in units of cells, and then services are provided from the highest priority. This method is the most efficient, but it causes the hassle of sorting all the cells in the queue in order for the highest priority cell to be selected.

In general, the non-working preservation algorithm can be interpreted by the jitter adjustment service method, and the jitter adjusters and schedulers adopted by the existing non-work preservation algorithm are listed in Table 1 below.

Queue service method Jitter adjuster Scheduler HRR Frame Technique (Cell Rate Jitter) Sequence number (RR) Stop-and-go Frame Technique (Delay Jitter) First in, first out (FCFS) Jitter EDD Use Packet Header (Delay Jitter) Deadline Priority (EDD) RCSP Use Packet Header (Delay Jitter) Fixed Priority (SP)

In general, the conventional jitter control service method is divided into two types according to the jitter control method, one of which is to control jitter by transmitting information related to scheduling to one node by using one section of the packet header. The other is a method in which jitter is adjusted by transmitting and exchanging cells in units of frames by a frame technique.

On the other hand, since there is no spare section for transmitting scheduling related information in the ATM cell header, the first method cannot be applied to an ATM network, and the second method can be used in an ATM network, but there are various problems. Moreover, the efficiency is degraded by the coupling nature between delay limits and bandwidth allocation units, which are inherent by the adoption of the frame technique, and the problem can be alleviated to some extent if a layered frame technique is used, but still resolved. This is a difficult problem.

Accordingly, the present invention is to solve the above problems, in the ATM network using the frame for each connection to adjust the jitter at each node, giving a deadline for the cell of the frame of each connection, and then select a cell to service the frame Accordingly, the present invention relates to a dynamic priority queue service apparatus using a frame for each connection defined by a counter interworking in an ATM network in which bandwidth usage efficiency is increased, and a service method thereof.

The present invention for achieving the above object is, in the ATM network in which an individual frame is defined in units of connections by the counter is installed in the per-session of each node and the counter performs a count in units of slots A dynamic priority queue service apparatus using frame-by-connection frames defined by counter linking, comprising: jitter adjusting means for adjusting jitter of cell data of a frame from each connection-specific virtual channel; And a dynamic priority scheduler that provides the cell data of the frame in order after giving a deadline for the cells of the frame of each connection from the jitter adjusting means.

According to the present invention configured as described above, bandwidth use efficiency is achieved by adjusting jitter at each node using frames per connection in an ATM network, giving a deadline for a cell of a frame of each connection, and then selecting a cell to be serviced in a frame. Will increase.

1 is a diagram illustrating a call connection state through a node in a typical ATM network;

FIG. 2A shows a switching node i having an output link l connected to input links l ', l' 'in a conventional stop-and-go queue service scheme. FIG.

FIG. 2B is a view showing a frame structure in each link shown in FIG. 2A; FIG.

3 illustrates a delay jitter control method in a general packet communication network.

4 is a diagram showing an example of a method for delivering jitter information by linking a counter in an ATM network;

5 is the size of the frame (j, j ', j'') for each connection in the dynamic priority queue service apparatus using the frame for each connection defined by the counter interworking in the ATM network according to the present invention. ),

6 is a block diagram showing an embodiment of a dynamic priority queue service apparatus using a frame for each connection defined by counter interworking in an ATM network according to the present invention;

FIG. 7 is a flowchart illustrating an embodiment of a method of operating each jitter regulator shown in FIG. 6;

FIG. 8 is a flowchart illustrating an embodiment of a method of operating the dynamic priority scheduler illustrated in FIG. 6.

* Explanation of symbols for the main parts of the drawings

9: data traffic queue, 10-n: first-n-th jitter regulator,

20: dynamic priority scheduler, i-1 to i + n: node,

A to F: Subscriber.

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

First, the method of transmitting jitter information by linking counters in an ATM network will be described.

Therefore, in order for the jitter to be adjusted by the method of interlocking jitter information by the interlocking method of the counter, the node i in the network has a qualified time of the cell through interaction with the previous node i-1 regardless of the neighboring cells. To be defined. That is, it defines the eligible time as if the cell has experienced the maximum allowable delay, e.g., the size of the frame, at the previous node (i-1). And the qualified time of cell (k) in connection j for the node after the source node ( ) Is defined in the following equation (where i = 1, 2, ..., N).

Τ _i denotes a propagation delay between the previous node i-1 and node i, Denotes the frame size of connection j. Equation 1 shows that the qualified time of the k-th cell arriving at node i is determined by the previous node i-1 of the cell. This means that the previous node i-1 should output the qualified time information of the k-th cell to the node i. In the conventional method, the information is loaded on the header of the k-th cell.

However, the jitter information transfer method by the counter linkage can be known by itself as soon as the cell arrives at the node without having to send the information each time. That is, for connection j By operating the per-session counter (C _{i, j} ) to establish the relationship between ), The value of the counter is read out and immediately known. Thus, only one counter per connection can be used to know the virtual arrival times for all cells of the connection so that delay jitter can be effectively adjusted.

Therefore, each node has one counter per-session, and each counter is counted in slot units to define individual frames. The counter decrements the counter value by 1 for each slot, and is initialized again by the size value of the frame as soon as the counter value becomes "0". The counter is interlocked by accurately reflecting the transmission delay between neighboring nodes. That is, when the cell starting when the value of the counter in the previous node (i-1) is "c" arrives at the node (i), the value of the counter of the instant node (i) is also linked to "c", This is made possible by synchronizing the operation of the counter in the neighboring node upon accepting the connection.

The value of the counter has two meanings, which means the time remaining until the deadline for the cells in the scheduler and the time remaining until the qualified time for the cells in the jitter adjuster. Thereafter, as the value of the counter becomes "0", the service deadline of the cell in the scheduler becomes a service, and the cell in the scheduler must be serviced before the counter becomes "0".

For example, if a service is performed when the value of the counter is "3", then the cell is serviced before the 3 slots of the deadline, and when the cell arrives at the next node, the value of the counter at that time is "3". Cell will be stored in the jitter regulator for three slots. If it is stored for 3 slots in the jitter controller and then output to the scheduler, it is the same as having received the deadline service from the previous node and reaching the scheduler of this node.

FIG. 4 is a diagram illustrating an example of a method of transmitting jitter information by counter linkage in an ATM network, and illustrates a case where a size of a frame transmitted is 10. FIG. And, as shown in FIG. 4, regardless of when a given cell is serviced by a previous node, a time point input to the scheduler of the next node is always constant, and after all cells have experienced the maximum delay at the node, the service is performed. Is performed so that delay jitter is completely removed.

On the other hand, in the jitter information transmission method by the counter interworking, it can be effectively applied to adjust jitter in a high-speed communication network that has a small packet size and does not support the transmission of scheduling-related information as in an ATM network. It is entirely dependent on the operation of the counter, so that the transmission delay can be used only in a synchronization network.

As described above, in the jitter information transfer method by counter interworking in an ATM network, a cell is serviced using a frame for each connection, and a separate frame counter must be operated for each connection to define a frame for each connection of all connections. Therefore, in each node, one counter exists for each connection for each frame, and each counter counts in units of slots to define individual frames.

The counter decrements the value of the counter by 1 for each slot, and then initializes it back to the size of the frame as soon as the value of the counter becomes "0". In addition, the operation of the counter is interlocked by accurately reflecting the transmission delay between neighboring nodes. In this interlocking operation, the cell which started when the counter value at node i-1 of the frame counter is "c" is a node. The counter value at the moment of arrival at (i) is also linked to be "c". This is made possible by synchronizing the operation of the frame counter by sending information about the frame counter to neighboring nodes upon accepting the connection.

FIG. 5 is a view illustrating the size of a frame (j, j ', j'') frame per connection in a dynamic priority queue service apparatus using a frame for each connection defined by counter interworking in an ATM network according to the present invention. ). Here, the size of the frame for each connection (j, j ', j'') ( ) Is different for each definition.

FIG. 6 is a block diagram illustrating an embodiment of a dynamic priority queue service apparatus using a frame for each connection defined by a counter interworking in an ATM network according to the present invention. As shown, the queue service device comprises a data traffic queue 9, first through nth jitter regulators 10 through n, and a dynamic priority scheduler 20, such as an Earliest-due-data (EDD) scheduler. Consists of

On the other hand, the jitter information transmission unit has counted as a counter (C _{i, j)} installed as a connection-specific (per-session) for each node in the counter slots (C _{i, j)} by the counter works in ATM Networks By doing so, individual frames are defined in units of connections. In the data traffic queue 9 and the first to nth jitter regulators 10 to n, cell data from each connection-specific virtual channel VC0 to VCn is stored until a virtual arrival time and Deadline information will be saved.

In addition, the dynamic priority scheduler 20 performs a service by comparing cell deadlines from the first to nth jitter regulators 10 to n and then selecting cell data closest to the deadline.

At this time, the dynamic priority scheduler 20 outputs a connection identifier (CID) for the order of cell data close to the deadline. As described above, the dynamic priority queue service apparatus according to the present invention includes a plurality of jitter adjusters using a pre-synchronized frame for each connection and a scheduler of a dynamic priority method.

First, when a cell arrives, the cell is sent to the jitter regulator of the connection, after which the jitter regulator is temporarily stored until the virtual arrival time of the cell. Therefore, at the moment when the virtual arrival time arrives, for example, each jitter controller uses a frame technique, the virtual arrival time of the cell is the cell where the jitter controller is stored and the dead time information of the cell at the end of the frame to which the cell belongs. Will be sent to the dynamic priority scheduler.

The dynamic priority scheduler, for example, the EDD scheduler, compares the deadlines of the cells and preferentially selects the cells closest to the deadlines to serve. Therefore, the dynamic priority queue service apparatus of this embodiment defines individual frames using a plurality of counters that operate independently at all nodes on the path, and needs to assume that all nodes in the network are synchronized. In addition, when accepting a connection, jitter is adjusted based on aligned frames between neighboring nodes, and it is necessary to assume that the transmission delay between nodes must be constant.

Subsequently, in order to ensure end-to-end delay and delay jitter of the real-time connection by the dynamic priority queue service device, it is necessary for the user network interface (UNI) and all nodes on the path to cooperate with each other. In the user network interface (UNI), cell rate jitter is controlled by limiting the number of cells entering each network from each traffic in units of time intervals of the corresponding frame. The node on the path then adjusts the delay jitter for the rate-controlled traffic so that the cell experiences the same delay each time it passes through the node.

On the other hand, even if the user generates traffic while complying with the negotiated rules when accepting the connection, the traffic actually entering the network may be concentrated within a certain range by multiplexing with other traffic. Therefore, if the end-to-end delay and jitter is guaranteed for each of the traffics in the network, the bandwidth utilization of the network is greatly reduced, thereby smoothing the traffic through a traffic shaper before entering the network. It becomes necessary.

After that, each node smooths traffic before and defines the virtual arrival time through interaction with the previous node regardless of the relationship between neighboring cells. In other words, it defines the virtual arrival time as if the cell experienced the maximum allowable delay, e.g., frame size, at the previous node. Then, for the node after the source node, the virtual arrival time of cell k in connection j ( , i = 1,2,… , N) is defined as in Equation 2 below.

here, Denotes the transmission delay between node (i-1) and node (i), Denotes the delay caused by the slot mismatch when the cell sent from node i-1 arrives at node i.

Equation 2 shows that the virtual arrival time of the k-th cell arriving at node i is determined by the virtual arrival time of the previous node of the cell. This means that node i-1 should transmit the virtual arrival time information of the k-th cell to node i. In the general method, the information is carried in the header of the k-th cell, but the dynamic priority scheduler of the present embodiment can know itself at the moment when the cell arrives at the node without transmitting the information each time.

That is, for connection j Frame counters per connection to ensure that ) So that the value of the frame counter at the moment the cell arrives is immediately known. Therefore, using only one frame counter per connection, the virtual arrival time for all cells of the connection can be known, effectively delaying jitter.

As described above, each node has one counter for individual frames for each connection, and the counter is counted in units of slots to define individual frames. In each slot, the counter decreases the value by one, and when the value of the counter becomes "0", the counter resets to the size value of the frame. In this case, the frame counter accurately interworks with the transmission delay between neighboring nodes.

That is, when the cell starting when the value of the counter in the previous node (i-1) is "c" arrives at the node (i), it interlocks so that the value of the counter of the node (i) is also "c", This is made possible by synchronizing the operation of the counter in the neighboring node upon accepting the connection.

The value of the counter has two meanings, which means the time remaining until the deadline for the cells in the scheduler and the time remaining until the qualified time for the cells in the jitter adjuster. Then, as the time when the value of the counter becomes "0" is the service deadline of the cell in the scheduler, the cell in the scheduler must be serviced before the counter becomes "0".

For example, if a service is performed when the value of the counter is "3", then the cell is serviced before the 3 slots of the deadline, and when the cell arrives at the next node, the value of the counter at that time is "3". Cell will be stored in the jitter regulator for three slots. If it is stored for 3 slots in the jitter controller and then output to the scheduler, it is the same as having received the deadline service from the previous node and reaching the scheduler of this node.

Therefore, regardless of when the cell was serviced by the previous node, the time to enter the next node's scheduler is always the same, so that all cells are serviced after the maximum delay at the node, thus eliminating delay jitter completely. do.

In the EDD scheduler, the cells are given the highest priority in descending order of the deadlines, so to select the cells to be serviced, the deadlines of all the cells in the scheduler are compared one by one to select the cell closest to the deadline. Done. The use of such an EDD scheduler has the disadvantage that the implementation is somewhat complicated, but the bandwidth utilization efficiency can be achieved by almost 100%, which has the advantage of accepting more connection setup requirements.

FIG. 7 is a flowchart illustrating an embodiment of a method of operating each jitter regulator illustrated in FIG. 6. Here, the jitter adjustment method of the dynamic priority queue service apparatus using the frame for each connection defined by the counter interworking in the ATM network is as follows.

First, in a tenth step S10, a predetermined cell k arrives, and in an eleventh step S11, it is determined whether the cell k is cell data of data traffic. If the cell data of the data traffic is moved to step 14 (S14).

In the twelfth step S12, when the cell k is not data traffic as a result of the determination in the eleventh step S11, the cell k outputs power to the jitter adjusting means 10 to n, In the thirteenth step S13, the jitter adjusting means 10-n causes the cell k to reach a counter value upon arrival of the cell. ], And outputs the cell k to the dynamic priority scheduler 20 in step S14.

FIG. 8 is a flowchart illustrating an embodiment of a method of operating the dynamic priority scheduler illustrated in FIG. 6. Here, the dynamic priority scheduling method of the dynamic priority queue service apparatus using the frame for each connection defined by the counter interworking in the ATM network is as follows.

First, in the twentieth step S20, it is determined whether the real-time cell data of the connection exists when the predetermined connection is accepted. In the twenty-first step S21, as a result of the determination of the twentieth step S20, the connection is made in real time. If there is cell data, the deadlines of all cells in the dynamic priority scheduler 20 are calculated.

In addition, in the twenty-second step S22, the cell data having the fastest deadline time is selected and serviced based on the dead time calculated in the twenty-first step S21, and in the twenty-third step S23, the twentieth step S20. As a result of the determination, when real time cell data does not exist in the connection, it is determined whether cell data of data traffic exists and then terminates when cell data of data traffic does not exist.

In addition, in the twenty-fourth step S24, if the cell data of the data traffic exists as the determination result of the twenty-third step S23, the corresponding cell data is selected to perform a service.

On the other hand, the reference numerals written in the components of the claims of the present application to facilitate the understanding of the present invention, and are not written in the intention to limit the technical scope of the present invention to the embodiments shown in the drawings.

Explained above

Claims (4)

In the ATM network, where a counter (C _{i, j} ) is installed as a per-session of each node and this counter (C _{i, j} ) counts in units of slots, an individual frame is defined in units of connections. In the dynamic priority queue service apparatus using the frame for each connection defined by the counter linkage, Jitter adjusting means (9 to n) for adjusting jitter of the cell data of the frame from each connection-specific virtual channel VC0 to VCn; A counter in an ATM network comprising a dynamic priority scheduler 20 which provides a cell with a sequence of frames after giving a deadline for each cell of the connection from the jitter adjusting means 9 to n. Dynamic priority queue service device using frames per connection defined by interworking. In a dynamic priority scheduling method of a dynamic priority queue service apparatus using a frame for each connection defined by counter interworking in an ATM network, A twentieth step (S20) of determining whether real-time cell data of the connection exists upon acceptance of a predetermined connection; A twenty-first step (S21) of calculating deadlines of all cells in the dynamic priority scheduler when there is real-time cell data in the connection as a result of the determination of the twenty-step (S20); A twenty-second step (S22) of selecting and serving the cell data having the fastest deadline based on the deadline time calculated in the twenty-first step (S21); A twenty-third step of determining if there is no cell data of data traffic when there is no real-time cell data in the connection as a result of the determination in the twentieth step (S20); S23) and; As a result of the determination of the twenty-third step (S23), if cell data of data traffic exists, the twenty-fourth step (S24) of selecting a corresponding cell data to perform a service is defined by counter interworking in an ATM network. Dynamic priority queue service method using frames per connection. 3. The dynamic priority order according to claim 2, wherein the deadline of a cell in the scheduler is determined by a frame counter value of a connection to which the cell belongs. Queue service method. 4. A connection as defined in claim 2 or 3, wherein the jitter adjustment and deadline calculation is performed for all cells of the connection using one frame counter per connection. Dynamic priority queue service method using separate frames.