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/10—Flow control; Congestion control
• • 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/60—Queue scheduling implementing hierarchical scheduling

Definitions

• the present invention relates to the processing of data packets in a communications network supporting a plurality of importance levels and classes of service for the data packets. It finds a general application in communication services of the voice, video and / or application data type, and more particularly in Voice over IP type communications still called VoIP for "Voice over Internet Protocol".
• VoIP Under VoIP, especially under the MPLS ("Multiple Protocol Label Switching") protocol, data packets representing voice, video, and / or application data are typically transmitted by routers that can introduce a processing delay or delete the data.
• MPLS Multiple Protocol Label Switching
• data packets representing voice, video, and / or application data are typically transmitted by routers that can introduce a processing delay or delete the data.
• commercial routers process the VoIP data packets according to separate priority queues or queues in which the highest priority packets, for example clock clock data packets, may be treated first, while others can be treated later or deleted to decongest the network, for example, architecture is based on eight queues associated respectively with eight classes of service, one queue for each class of service.
• the classes of service may also be processed according to customer-related criteria so as to preferentially treat certain customers who have subscribed to a particular service to the detriment of customers who have not subscribed to it.
• customer-related criteria so as to preferentially treat certain customers who have subscribed to a particular service to the detriment of customers who have not subscribed to it.
• DiffServ differentiated services
• a so-called "priority" processing queue also has larger memory resources than the other non-priority queues for processing the data packets in a discriminatory manner according to a predefined priority scheme.
• the present invention overcomes these disadvantages. It thus aims to further improve the processing of data packets in a communication network supporting a plurality of importance levels and classes of services of the packets and this independently of the source (port) of the data packets, the client, the memory space of the queues or the nature of the data packet (voice, video, applications).
• It relates to a method of processing data packets in a communications network supporting a plurality of importance levels and classes of service for the data packets.
• the method comprises the following steps: receiving data packets each having a chosen importance level and a chosen class of service; providing a plurality of tails each dedicated to a selected level of importance; each queue having a plurality of storage areas each dedicated to a selected class of service;
• the communication network supports six levels of importance and eight classes of service for the data packets.
• each data packet comprises a field dedicated to the importance level and a field dedicated to the service class of said packet.
• the field dedicated to the importance level and the field dedicated to the class of service are contained in the TOS field.
• the field dedicated to the importance level is the Cos field and the field dedicated to the class of service is contained in the tag field.
• the present invention also relates to a device for processing data packets in a communications network supporting a plurality of importance levels and classes of service for the data packets.
• the device comprises:
• receiving means for receiving data packets each having a chosen importance level and a selected class of service; a plurality of tails each dedicated to a selected level of importance; each queue having a plurality of storage areas each dedicated to a selected class of service; storage means for storing the current data packet in the storage area corresponding to the service class of said data packet thus processed and belonging to the corresponding importance level queue; and
• processing means able, for each data packet thus stored, to apply a processing algorithm depending on the importance level and the service class of said packet.
• FIG. 1 schematically illustrates a plurality of tails able to discriminate the data packets according to the level of importance and the class of service of said packets according to the invention
• FIG. 2 is a variant of implementation of the tails according to the invention.
• the present invention finds application in a communication network supporting multiple levels of importance and several classes of service for data packets.
• data routing uses a protocol that can be IP, MPLS or the like.
• the six levels of importance are, in descending order of importance: override override flash, override flash, flash, immediate, priority, and routine.
• the importance level can be established during the call by means of a specific button or a specific action performed from a menu displayed on the terminal, or during the establishment of the call, or physically attached to the terminal (most likely).
• a call server (“Call server”) is responsible for establishing the call and configures the importance level and the class of service. Call related information, including IP address, negotiated bandwidth, importance level, is loaded into the router for use as filtering and rating information.
• a router comprises a plurality of PE input ports, individualized PE1 to PEN, and connected to data sources of different nature (voice, video, application data).
• Each input port PE is connected to a processing chain including in particular a packet processor CL (individualized in CL1 to
• CLN of the "classifier" type adapted to detect a field in the header of the packet that identifies the importance level and the service class of said packet.
• Each CL classifier sends packets to processors of "policer / shaper" POS type processing, individualized in POSij, with i the number of importance levels here 6, and j the number of service classes here. presence of 6 levels of importance and 8 classes of services per level, the router includes for each port of entry PE 48 processors of police type / shaper POS. It will be seen with reference to FIG. 2 that the number of relevant classes to be processed may be less than eight.
• the router further comprises 6 priority tails Q, individualized in Q1 to Q6.
• Tail Q1 is associated with importance level "Flash override override”
• tail Q2 is associated with importance level “Flash override”
• the queue Q3 is associated with the importance level” Flash
• the queue Q4 is associated with the importance level” Immediate
• the queue Q5 is associated with the importance level” priority
• the queue Q6 is associated at the level of importance "routine”.
• Each priority queue Q includes Z storage areas
• the "override override flash" level of level includes 8 individual Z11 to Z18 storage areas, the Z11 zone being associated with the "NC" class of service, the Z12 zone being associated with the "H1" class of service Z13 being associated with the service class "EF express forwarding", the Z14 zone being associated with the service class "H2”, the zone Z15 being associated with the service class "L1”, the zone Z16 being associated with the service class "assured forwarding AF", the zone Z17 being associated with the service class "L2”, and the zone Z18 being associated with the class "best effort service BE".
• Each storage area Z comprises a buffer memory.
• the current data packet is stored in the storage area Z corresponding to the service class of said data packet thus processed and belonging to the corresponding importance level queue.
• the data packet having the importance level "flash” and service class "best effort" is stored in the storage area Z38.
• Packets entering and leaving the tails are counted by elementary counters SH, individualized in SH1 to SH6, and each dedicated to a respective tail.
• a general counter CG counts the incoming and outgoing packets of the six elementary counters.
• a processing mechanism called “scheduling” is adapted, for each data packet thus stored, to apply a processing algorithm according to the importance level and the service class of said packet. The result of the mechanism is applied to the PS output port of the router.
• NC and H 1 service classes are the highest priority classes. They only contain internal network control packets (protocols, 3) that are not the result of end-user communications. It is therefore not necessary to discriminate them by the tails Q1 to Q6.
• each data packet includes a field dedicated to the importance level and a field dedicated to the service class of said packet.
• the field dedicated to the importance level and the field dedicated to the class of service are contained in the TOS field.
• the field dedicated to the importance level is the Cos field and the field dedicated to the class of service is contained in the label field.

Landscapes

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

Applications Claiming Priority (2)

Publications (1)

Family

ID=39539649

Family Applications (1)

Country Status (3)

• 2007
  • 2007-10-17 FR FR0758371A patent/FR2922704A1/fr not_active Withdrawn
• 2008
  • 2008-10-10 EP EP08840910A patent/EP2215786A2/de not_active Withdrawn
  • 2008-10-10 WO PCT/FR2008/051849 patent/WO2009053636A2/fr not_active Ceased

Non-Patent Citations (1)

Also Published As

Similar Documents

Legal Events