Classifications

• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L47/00—Traffic control in data switching networks
  • H04L47/70—Admission control; Resource allocation
  • H04L47/80—Actions related to the user profile or the type of traffic
  • H04L47/805—QOS or priority aware
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L47/00—Traffic control in data switching networks
  • H04L47/70—Admission control; Resource allocation
  • H04L47/80—Actions related to the user profile or the type of traffic
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L12/00—Data switching networks
  • H04L12/54—Store-and-forward switching systems 
  • H04L12/56—Packet switching systems
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L47/00—Traffic control in data switching networks
  • H04L47/10—Flow control; Congestion control
  • H04L47/15—Flow control; Congestion control in relation to multipoint traffic
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L47/00—Traffic control in data switching networks
  • H04L47/10—Flow control; Congestion control
  • H04L47/24—Traffic characterised by specific attributes, e.g. priority or QoS
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L47/00—Traffic control in data switching networks
  • H04L47/50—Queue scheduling
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L47/00—Traffic control in data switching networks
  • H04L47/50—Queue scheduling
  • H04L47/52—Queue scheduling by attributing bandwidth to queues
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L47/00—Traffic control in data switching networks
  • H04L47/50—Queue scheduling
  • H04L47/52—Queue scheduling by attributing bandwidth to queues
  • H04L47/522—Dynamic queue service slot or variable bandwidth allocation
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L47/00—Traffic control in data switching networks
  • H04L47/50—Queue scheduling
  • H04L47/56—Queue scheduling implementing delay-aware scheduling
  • H04L47/564—Attaching a deadline to packets, e.g. earliest due date first
  • H04L47/566—Deadline varies as a function of time spent in the queue
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L47/00—Traffic control in data switching networks
  • H04L47/50—Queue scheduling
  • H04L47/62—Queue scheduling characterised by scheduling criteria
  • H04L47/624—Altering the ordering of packets in an individual queue
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L47/00—Traffic control in data switching networks
  • H04L47/50—Queue scheduling
  • H04L47/62—Queue scheduling characterised by scheduling criteria
  • H04L47/625—Queue scheduling characterised by scheduling criteria for service slots or service orders
  • H04L47/626—Queue scheduling characterised by scheduling criteria for service slots or service orders channel conditions
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L47/00—Traffic control in data switching networks
  • H04L47/70—Admission control; Resource allocation
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L47/00—Traffic control in data switching networks
  • H04L47/70—Admission control; Resource allocation
  • H04L47/72—Admission control; Resource allocation using reservation actions during connection setup
  • H04L47/724—Admission control; Resource allocation using reservation actions during connection setup at intermediate nodes, e.g. resource reservation protocol [RSVP]
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L47/00—Traffic control in data switching networks
  • H04L47/70—Admission control; Resource allocation
  • H04L47/76—Admission control; Resource allocation using dynamic resource allocation, e.g. in-call renegotiation requested by the user or requested by the network in response to changing network conditions
  • H04L47/762—Admission control; Resource allocation using dynamic resource allocation, e.g. in-call renegotiation requested by the user or requested by the network in response to changing network conditions triggered by the network

Definitions

• the present invention refers to a procedure for dynamic management of telecommunications system resources based on the quality of service and the type of service, and is oriented to a multi-user multipoint to multipoint digital data transmission system. In the method of the invention, the methods chosen to store the packets are waiting for their subsequent transmission.
• the invention allows to dynamically manage the resources among all the nodes (or user equipment) and to prioritize, both in the transmission of packets and in the storage of said packets pending transmission, allowing different configurations of said storage, so that , before a full memory queue, you can decide to glue a new package taking into account the priority, age or both parameters of the packages already stored.
• BACKGROUND OF THE INVENTION In the prior art it is known to use linked cell systems forming queues for the storage of communication information. In each cell it is possible to store an information package. In addition, storage is necessary to be able to support, for example, reception recognition protocols, which requires the generation of a signal by the receiving user to release a packet stored in the transmitting user.
• an application when it is expressed that an application requires a type of CBR service it means that the application generates a traffic with bandwidth constant. Furthermore, when it is pointed out that an application requires a type of VBR service, it means that the application generates traffic with variable bandwidth and, finally, when it is indicated that an application requires a type of UBR service, it means that the application generates a traffic with undetermined bandwidth. Also in memory the term cell is used as a self-contained logical unit to which a destination, a packet, an antiquity can be associated, that is the time it takes in a queue pending transmission, and a priority taking into account In addition, the type of service to which the package belongs.
• the method of the invention allows each remote user to have a quantity of cells reserved for him, a number of cells to share with a group of users, and a number of cells that he shares with all users. Finally, said maximum cell configuration is dynamically adjusted to suit the communication needs.
• the invention consists of a procedure for dynamic management of telecommunication system resources depending on the quality of service and the type of service, in which there is a plurality of user nodes communicated through links with different latency and bandwidth requirements, a cell being a self-contained unit with a priority, a destination, an age, and an associated package; and a queue an ordered set of cells.
• the procedure is characterized in that the origin node manages the traffic and resources to the destination nodes, dynamically distributes the resources between the destination nodes, and reserves a memory capacity in its queues depending on the class of service and the quality of service required; and because one or more different cell insertion and extraction configurations of the ordered queues is used. It is also characterized in that the origin node manages the quality of service of each destination node and selectively reserves a number of cells for itself, shares a number of cells with a group of destination nodes, shares a number of cells with all destination nodes, or Well perform several of these actions at once.
• the origin node manages the type of service associated with each packet, and configures the quality of service of each destination node that is selectively different for each destination node and different from that configured in the sense opposite of transmission in a two-way communication between the destination node and the origin, and adjusts said quality of service dynamically.
• the origin node configures the number of destination nodes and the number of cells and selectively modifies said configuration during the management process, or keeps it fixed during the process, and said origin node selectively uses information related to priority, the amount of cells used by each destination node, or both to decide the next destination node.
• the invention provides for different queue management configurations based on different aspects selected from: - a queue management configuration based on the age of the queue cells, that is, how long a cell has been in a queue; so that it is extracted from a queue, to be transmitted the packet contained in it, the cell that has been in it for a longer time and a cell is inserted into a queue as long as the queue is not full. - a queue management configuration based on priority, that is, based on the value of a certain field carried by the packets that are introduced into the cells; so that, defining Pl as the highest priority and P2 as the lowest priority among all the cells in the queue, one of the priority cells Pl is always removed from the queue
• a queue management configuration that is based on both the priority and the age of the cells in the queue ; so that, defining Pl as the highest priority and P2 as the lowest priority among all the cells in the queue, the oldest cell of priority Pl is extracted from a queue and a new cell is inserted into a queue (which we will call, in general, cell X) with priority PX only when PX is greater than the priority P2, having to extract the least old cell, that is, the one that takes less time in the queue, of priority P2 to be able to insert cell X.
• the process of the invention defines four global maximums: a maximum of system cells (MAX), a maximum of cells of a first type (MAX_A), a maximum of cells of a second type ( MAX_B), a maximum of cells of a third type (MAX_C) and a maximum of cells of the set of the second and third type
• MAX_B_0 (MAX_B_0. These values follow a series of relationships such as MAX is equal to the sum of MAX_A and MAX_B_C, that a cell of the first type is available when the number of free cells of the first type is less than MAX_A, than a cell of the second type is available when the number of Free second type cells is less than MAX_B and the number of free second type cells plus the number of free third type cells is less than MAX_B_C, which a third type cell is available when the number of free third type cells is less than MAX_C and the number of cells of the second free type plus the number of cells of the third free type is less than MAX_B_C, and that any of the maximums, MAX_A, MAX_B or MAX_B_C can be zero as long as MAX_A and MAX_B_C are not zero at Same time.
• the procedure also defines two maximums for each destination node (MAX_A_NODO, MAX_B_NODO), these maximums being different for each node and having values greater than or equal to zero and selectively indicating the possibility of using cells of the third type (USAR_C) and the no use of said cells of the third type (NO_USAR_C).
• the procedure is also characterized by certain values and certain relationships between these values, such as MAX_A_NODO is the maximum number of cells of the first type that a certain destination node can have; MAX_B_NODO is the maximum number of cells of the second type available to this node, as long as there are cells of the second type available; that the sum of the MAX_A_NODO of all the destination nodes has to be less than or equal to MAX_A, that the sum of the MAX_B_NODO of all the destination nodes can be greater than MAX_B; and that a node with the possibility of using cells of the third type (USAR_C) can use cells of the third type as long as cells of this type are available.
• MAX_A_NODO is the maximum number of cells of the first type that a certain destination node can have
• MAX_B_NODO is the maximum number of cells of the second type available to this node, as long as there are cells of the second type available
• the procedure is also characterized because using the maximum and node configuration per node, CBR traffic is guaranteed using the MAX_A_NODO, VBR traffic using the MAX_B_NODO and UBR traffic using the USAR_C or DO NOT USE C .
• the procedure provides for the dynamic adjustment of the defined values, so that the global and local maximums vary dynamically to adjust to the variations in the configuration of the destination nodes, the bandwidth required by the applications, the conditions of the channel used in the communication, and to the quality of service required by the applications or types of traffic that the applications require, such as CBR, VBR or UBR.
• the main advantage of the invention is the greater control of access to packet queues.
• FIGURES Figure 1. Represents a system where a user node 1 wants to transmit to other user nodes 2, 3,
• Figure 2. Represents the moments of storage and transmission of new cells to the different user nodes.
• DESCRIPTION OF AN EXAMPLE OF EMBODIMENT OF THE INVENTION Next, a description of an example of the invention is made, referring to the numbering adopted in the figures.
• a multipoint digital data transmission system is presented to bidirectional multipoint, in which a user node communicates with several user nodes through a series of links. In this system before transmitting, packets are stored in cells.
• Figure 1 shows this example of embodiment, in which nodes (1), (2), (3), (4) and (5) are any of the user nodes of the system, and a node (1 ) communicates with the rest of the nodes through a series of links (6), (7), (8) and (9).
• the process of the invention provides for global maximums, which were described in the description section of the invention, and which are indicated below together with the values established for this embodiment: a maximum of equal cells of the first type (MAX_A) at 15, a maximum of cells of the second type (MAX_B) equal to 5, a maximum of joint cells of the second type plus the third type (MAX_B_C) equal to 32, and a maximum of cells of the third type (MAX_C) equal to 30
• the first type of cells is called type A, the second type B and the third type C.
• the transmitting node (1) has a link configured with the node (2) with CBR traffic (6), this that is, with traffic with a constant bandwidth being necessary to reserve a fixed number of cells that are always available to store the packages pending to be sent from the node (1) to the node (2).
• the procedure defines two maximums for each destination node (MAX_A_NOD0).
• node (2) has a MAX_A_N0D0_2 equal to ten. This maximum has been set taking into account the bandwidth of the application with CBR traffic and taking into account the current conditions of the channel, concluding in this exemplary embodiment that CBR traffic can be supported with ten cells.
• a queue of cells is used to store the traffic pending to be transmitted from node (1) to node (2) and is managed using a storage configuration based on seniority and priority, which was described in the description section of the invention.
• the transmitting node (1) has configured the link with the node (3) with VBR traffic (7), that is, with traffic with a variable bandwidth so that a maximum number of cells MAX_B_NODO_3 equal to five can be reserved , being able to share with node (4) three of those five cells, according to the maximums in this embodiment.
• the queue of packets pending to be transmitted from node (1) to node (3) is managed with an age setting.
• the transmitting node (1) has configured the link with the node (4) with VBR traffic (8) assigning a MAX_B_NODO_4 equal to three. But, in addition, the link from node (1) to node (4) is given access to those of the third type (C) in order to support UBR traffic, that is, traffic with an undetermined bandwidth limiting in this exemplary embodiment at values between 0 and 30 cells.
• the queue of pending packets to be transmitted from node (1) to node (4) is managed with storage configuration by seniority.
• the link (9) of the node (1) to the node (5) only has access to the cells of the third type (C), the storage configuration used in this communication being novelty and priority.
• the following table presents a summary of the layout of the links and cells according to the embodiment example. This configuration can be modified dynamically over time, to follow the communication needs and changes in the communications channel.
• the node (1) has to transmit a packet for the node (2), whereby a cell of the first type (A) is used to store it, being available for transmissions to the node (2) , 9 cells of the first type (A) although there are 14 cells of the first type (A) free in total.
• the priority information of the new packet will be used using, for example, the field that indicates the type of traffic, to decide if a package already stored is deleted to incorporate the new one or if the new package is deleted. In this case, all the cells in the packet queue will be searched for node (2), if there are any of these cells that contain a lower priority package than the new package. If there are packages of lower priority, the package in the cell that has been in the queue for less time and whose stored package is the lowest priority among all cells is removed.
• the node (1) has to transmit a packet to the node (3), whereby a cell of the second type (B) will be used to store it, leaving, at the disposal of the node (3), 4 cells of type B. Then, at a certain time (14), A cell for node (4) must be stored, so that a type B cell will be used, only 3 cells of the second type (B) being available to the node (3) and 2 cells of the node (4) available second type (B), although node (4) can use all cells of the third type (C) that are free. In this way, nodes (3) and (4) are sharing a number of cells taking into account that they have a variable bandwidth and do not need to always have a fixed number of cells at their disposal.
• the packets are transmitted to the user nodes (4) and (3), the 5 cells of the second type (B) will be free again, which is done in the instant (17).
• twenty-nine packets must be sent to the user node (5) for which twenty-nine cells of the third type (C) will be used.
• three packets must be transmitted to the user node (3) using three cells of the second type (B) (19).
• another packet must be sent to the user node (5), taking into account that the total set of cells of the second and third type used is 32, there is no cell where this packet can be stored .
• the storage configuration of the user node (5) is novelty and priority, all the lowest priority cells in the packet queue to the node (5) will be searched, and the information contained in the cell that takes more time in the queue to be able to store the new package.

Landscapes

• Engineering & Computer Science (AREA)
• Computer Networks & Wireless Communication (AREA)
• Signal Processing (AREA)
• Data Exchanges In Wide-Area Networks (AREA)
• Telephonic Communication Services (AREA)

Priority Applications (9)

Applications Claiming Priority (2)

Related Child Applications (1)

Publications (1)

Family

ID=34072907

Family Applications (1)

Country Status (14)

Families Citing this family (6)

Citations (6)

Family Cites Families (10)

• 2003
  • 2003-07-15 ES ES200301663A patent/ES2229917B1/es not_active Expired - Fee Related
• 2004
  • 2004-06-14 KR KR1020067001060A patent/KR20070009963A/ko not_active Ceased
  • 2004-06-14 CA CA002532465A patent/CA2532465A1/en not_active Abandoned
  • 2004-06-14 BR BRPI0412653-0A patent/BRPI0412653A/pt not_active IP Right Cessation
  • 2004-06-14 EP EP04736753A patent/EP1650906A1/en not_active Withdrawn
  • 2004-06-14 WO PCT/ES2004/000271 patent/WO2005008972A1/es not_active Ceased
  • 2004-06-14 AU AU2004301230A patent/AU2004301230A1/en not_active Abandoned
  • 2004-06-14 CN CNA2004800265948A patent/CN1853382A/zh active Pending
  • 2004-06-14 JP JP2006519938A patent/JP2007535192A/ja active Pending
  • 2004-06-14 EA EA200600253A patent/EA008956B1/ru not_active IP Right Cessation
  • 2004-06-14 MX MXPA06000527A patent/MXPA06000527A/es active IP Right Grant
  • 2004-07-08 TW TW093120503A patent/TWI295129B/zh not_active IP Right Cessation
• 2006
  • 2006-01-13 US US11/332,490 patent/US20060171319A1/en not_active Abandoned
  • 2006-01-15 IL IL173155A patent/IL173155A0/en unknown

Patent Citations (6)

Also Published As

Similar Documents

Legal Events