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
  • H04L47/12—Avoiding congestion; Recovering from congestion
  • H04L47/122—Avoiding congestion; Recovering from congestion by diverting traffic away from congested entities
• • 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/10—Flow control; Congestion control
  • H04L47/12—Avoiding congestion; Recovering from congestion
• • 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/26—Flow control; Congestion control using explicit feedback to the source, e.g. choke packets
• • 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/26—Flow control; Congestion control using explicit feedback to the source, e.g. choke packets
  • H04L47/265—Flow control; Congestion control using explicit feedback to the source, e.g. choke packets sent by intermediate network nodes
• • 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/31—Flow control; Congestion control by tagging of packets, e.g. using discard eligibility [DE] bits
• • 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/33—Flow control; Congestion control using forward notification

Definitions

• the invention relates to a technique for obtaining, by a first node, information relating to a congestion of a road between this first node and a second node. More specifically, this route allows routing of packets from the first node to the second node.
• the invention is in the field of telecommunications and more particularly in the field of detecting congestion in packet communication networks.
• the invention finds a particularly advantageous application for session admission control in such packet communication networks.
• Congestion is likely to occur on any equipment located on the path of a package. More specifically, equipment may be congested at input or output memories, internal queues, etc.
• Congestion notification functions have been defined by standardization bodies for packet communication networks. These functions are based on a variety of mechanisms, including an explicit ECN congestion notification mechanism for Explicit Congestion Notification, an explicit forward congestion notification mechanism (FECN) for Forward Explicit Congestion Notification. mechanism for explicit backward congestion notification BECN, for "Backward Explicit Congestion Notification” or even combinations of these different mechanisms.
• FECN explicit forward congestion notification mechanism
• BECN forward Explicit Congestion Notification
• BECN backward congestion notification
• the term “before” corresponds to the direction of transmission of a packet, that is to say to the recipient of the packet
• backward corresponds to the opposite direction of transmission of the packet, that is to say to the sender of the packet.
• These different mechanisms use a header field of the data packets to carry information relating to the congestion of one of the nodes carrying the packet.
• RFC 3168 specifies the manner in which an IP packet carries an explicit ECN congestion notification in before. Such an IP packet is subsequently called a marked packet.
• TCP transport protocol for "Transmission Control Protocol", relying on the IP protocol, it is expected, for a TCP session established between a sending node and a receiving node, that the receiving node notifies the sending node of a TCP segment of the occurrence of congestion when sending an acknowledgment.
• the sending node can then modify certain parameters of the TCP protocol in an attempt to eliminate the congestion situation. No information on the location of congestion is available in this case.
• studies have been conducted to report backward congestion. For example, the June 1998 IETF draft-salim-jhsbnns-ecn-00 document proposes to use control plane messages to notify the occurrence of rearward congestion.
• the ICMP "Source Quench” control message for "Internet Control Message Protocol,” defined by RFC 792, is used to notify the packet sender.
• Such a message notably allows a node carrying a packet to implicitly notify the sender of the packet that it has been deleted or marked by the router.
• the message includes a part of the deleted package.
• Various optimizations have been proposed, for example in the article "Congestion Control in TCP / IP networks: a combined ECN and BECN approach" by F. Akujobi et al, published in the proceedings of the MILCOM 2003 conference, in order to limit the sending these ICMP "Source Quench” messages.
• One of the aims of the invention is to remedy the shortcomings / disadvantages of the state of the art and / or to make improvements thereto.
• the subject of the invention is a method for obtaining, by a first node, information relating to a congestion of a route allowing routing of packets from said first node to a second node in a network. packet communication, said congestion being capable of degrading said routing, said obtaining method comprising the following steps implemented by the second node:
• a step of obtaining said information from the first received packet a step of sending a second packet to the first node, said second packet carrying said control message and comprising said information obtained.
• This first packet is intended to trigger the transmission of the control message in the control plane.
• control plane allows the different nodes to exchange control information between them.
• the transfer plan is in charge of routing packets between the nodes.
• a route is used to route packets from a first node to a second node, also called a destination node.
• This road crosses one or more intermediate nodes.
• the congestion is likely to affect different resources of these intermediate nodes: it can be a congestion affecting a queue of the second node, a congestion affecting hardware resources of the second node, ...
• the road is located then also congested.
• the information relating to congestion in the downstream direction is determined in the transfer plan by one of the congested intermediate nodes and is intended to mark the packets in this sense.
• transmission once routed through the congested intermediate node.
• the information relating to congestion on the road, received in a first packet is copied into a second packet carrying a control message transmitted in response to the first packet.
• This second packet is transmitted to the first node in response to the first packet.
• this information relating to congestion of the road is provided solely on solicitation of the first node and is transmitted backwards, that is to say in the opposite direction to the transmission direction of the first packet.
• the load generated by the implementation of the method according to the invention is reduced both at the level of the hardware resources and processor of the second node at the level of the links taken to reach the first router.
• the first packet is a packet that is destined for the second node and that requires sending a response control message to the first node.
• the information relating to congestion of the road corresponds, for example, to the value taken by the CE bit of the ECN information field of the header of a packet, as specified in the IETF RFC 3168 document. value of "1" indicates congestion.
• Congestion notifications are not sent spontaneously, that is to say in the absence of solicitation, and it is thus possible for the first node to detect a lack of response to the sending of the first packet. The first node can then re-transmit the first packet to the second node. Congestion notifications are also out-of-band, that is, they do not require a TCP session.
• the obtaining method also offers an alternative to congestion detection using SNMP procedures for Simple Network Management Protocol. These procedures take into account traffic variations over longer periods of time by the update and export by the nodes of traffic counter values to central collectors according to the SNMP protocol. The reaction time required by these procedures is more important.
• the obtaining method it is thus possible for a network operator to know the level of congestion of certain elements of the network or segments by interrogation. This allows you to protect or modify ongoing sessions. This protection can go through the implementation of admission control procedures for new sessions or even rate modulation.
• rate modulation it is possible to use, for example, so-called scalable or scalable SVC coding techniques for Scalable Video Coding.
• a rate increase is then possible when the load conditions of the network allow it, for example an increase in the available flow or an absence of congestion.
• the first and second nodes implementing differentiated routing of packets according to classes of service, the first packet received comprises information relating to a given class of service and the information obtained relates to congestion affecting the service. least said class of service.
• the network operator can then take measures to protect the sessions corresponding to certain classes of service.
• the intermediate node can indicate congestion for all service classes higher than the given class of service. This allows a single request to obtain congestion information for a set of classes of service.
• control message sent corresponds to a response message to another control message received in the first packet.
• This other control message is an echo request transmitted from the first node to the second node.
• Such another control message is for example the "Echo Request” message associated with the "Echo Reply” message for the ICMP protocol.
• the header of the first packet indicates that a lifetime of said first packet has expired.
• the congestion information on a path using the utility program, known as "Traceroute", which makes it possible to determine the route taken by a data packet.
• the expected response to such a packet corresponds to an error check message.
• the second packet being transmitted to the first node via at least a fourth node, this fourth node does not modify the header of the second packet.
• the intermediate nodes When congestion is likely to also occur in the uplink direction, i.e. from the second node to the first node, the intermediate nodes should not change the header of the second packet in the transfer plan. It is thus sufficient to modify the operation of the intermediate nodes in the transfer plan for the control messages used in the implementation of the method of obtaining. The operation of the nodes in the control plane is not modified.
• the invention relates to a node in a packet communication network, arranged to exchange with another node control information in a control plane,:
• receiving means arranged to receive from the other node a first packet;
• means for processing said first packet in the control plane arranged to request a transmission of a control message to the other node at the end of the processing of the first packet;
• the invention relates to a communication system in a packet communication network, wherein first and second nodes exchange control information in a control plane, said system comprising:
• said first node comprising sending means arranged to send a first packet, for which the second node must send in response a control message;
• said second node being arranged as described above.
• the first packet is provided to trigger the transmission of a control message in the control plane.
• the invention also relates to a computer program comprising instructions for implementing the obtaining method according to the first aspect, implemented by a node of a packet communication network, when this program is executed by a processor.
• FIG. 1 is a simplified representation of a packet communication network according to a particular embodiment of the invention
• FIG. 2 represents a simplified diagram of the steps of the method of obtaining and a synoptic of the exchanges between the different entities implementing the method of obtaining according to a particular embodiment of the invention
• Figure 3 is a simplified reminder of the structure of a packet
• FIG. 4 represents a node according to a particular embodiment of the invention.
• FIG. 1 is shown schematically a network 1 packet communication.
• This network 1 comprises a plurality of node devices, of which five of them 10, 12, 14, 16, 18 are shown in FIG. 1. Thereafter, these node devices are simply called nodes.
• These nodes play the role of routers in the network 1, that is to say they are in charge of routing packets in a plane, called transfer plan.
• a route also called a path, allows routing of packets from a first node to a second node through other nodes as appropriate.
• the control plane the nodes exchange control information, for example using the protocol ICMP. It is understood that the connectivity of a node is not restricted to the simplified network as shown in Figures 1 and 2.
• a node is indeed able to route packets to a plurality of other nodes.
• information relating to a congestion of a road is called information that indicates the existence of congestion for at least one of the intermediate nodes of the road.
• This congestion is likely to degrade a routing packets along this route in the transfer plan.
• the packets are marked by the node before retransmission using an ECN information field, for "Explicit Congestion Notification”.
• This information field includes a CE information subfield, for "Experienced Congestion”. The packets are thus marked by setting the information subfield CE to the value one.
• the receiving node when a receiving node is to transmit a control message upon receipt of a first packet from a requesting node, the receiving node obtains the congestion information from the first received packet. and transmits the control message in a second packet, in which it copies this information.
• This thus enables the requesting node to receive downstream traffic congestion information, i.e. from the requesting node to the receiving node.
• the requesting node is able to determine on a route taken by the packets to the receiving node that at least one intermediate node is congested.
• a congestion notification mechanism provided in the transfer plane for a first communication direction is used to obtain information relating to congestion of the road and this information is looped back in a second direction of communication opposite to the first direction. This loopback only occurs for certain first particular packets that will trigger the transmission of given control messages. These first packets are detailed later in connection with FIG.
• the nodes 10, 12 and 14 implement the method of obtaining according to a particular embodiment. More specifically, information relating to congestion on the route of the node 10 to the node 14 is necessary at the node 10.
• FIG. 2 schematically shows the steps of the method of obtaining in this particular embodiment.
• the node 10 transmits a first packet PI to the node 14.
• FIG. 3 recalls the elements constituting the packets routed in the packet communication network 1.
• the header of the packet consists of a set of information fields from Party to @dst.
• the information field CoS 30 includes information relating to a class of service, when the communication network 1 implements differentiated routing of packets according to classes of service.
• the information field 31 corresponds to the ECN information field previously described.
• the TTL information field 32 for "Time-To-Live" indicates a number of nodes through which the packet can still be routed. Its value is decremented with each routing by a node. When its value becomes zero, the life of the package has expired.
• the information field 33 P makes it possible to determine from which protocol the packet originates.
• the information field 34 @src corresponds to the address of the sending node of the packet.
• the information field 35 @dst corresponds to the address of the destination node of the packet.
• the packet further comprises an information field 36 which contains the payload data of the packet. For example, it includes an IGMP type control message when the information field 33 indicates the value of two.
• This first packet passes through the node 12 in the transfer plane. This is where node 12 encounters congestion in its internal queues for routing packets to node 14.
• node 12 sets the information subfield CE to the value one in the header of the first packet PI and thus obtains a second packet P2 that it transmits to the node 14.
• the second packet P2 is received by the node 14 in a step F1.
• a step F2 the node 14 processes the second received packet P2 in the control plane.
• a control message must be sent to the sending node of the first packet, that is to say the node 10.
• the node 14 transfers the control message to the transfer plan so that it is routed.
• the node 14 obtains in a step F3 the information relating to congestion from the second received packet P2.
• the node 14 constitutes the header of a third packet P3 to the node 10 and copies the information relating to the congestion obtained in step F3.
• This third packet also includes the control message to be sent.
• the node 14 transmits the third packet P3 to the node 10.
• the third packet P3 is routed via one or more intermediate nodes.
• the node 10 receives the third packet P3 and has thus obtained information relating to the congestion of the road from itself and to the node 14.
• This information is not provided spontaneously or in association with a packet that was to be forwarded down but triggered by a requesting node only.
• the obtaining method can be integrated in a more general method, in which the node 10 successively interrogates the different nodes 14, 16 composing the path carrying packets to the node 18.
• a path can be obtained using a routing protocol. It can also be obtained using a utility program, called Traceroute, whose operation is detailed later in connection with a particular embodiment.
• the node 10 can then use this information relating to a congestion obtained for the route to the node 18 to admit or not a new session to a destination connected to the node 18.
• the node 10 can also use this information relating to a congestion to modulate communication rates.
• the node 10 can insert first IP packets according to certain rules, for example either regularly in the data stream, or regularly for a set of communications between itself and a set of destinations, for example all the clients connected to a network.
• same network node such as a DSLAM multiplexer, for "Digital Subscriber Line Access Multiplexer”.
• the first packet PI carries an ICMP control message "Echo request".
• the node 14 detects that it must send another control message in response to the ICMP control message "Echo Request”. This is an ICMP message "Echo Reply".
• the third packet P3 carrying the message "Echo Reply” is modified to allow to loop information congestion as received. The changes to be made to the nodes to implement the method of obtaining are thus limited.
• node 10 implements the previously mentioned Traceroute utility program.
• This program consists of sending packets indicating a TTL validity period, for "Time-To-Live", increasingly large. Each node retransmitting the packet decrements the validity period. When it becomes zero, the node does not transmits the packet but transmits an ICMP control message "Time exceeded" to node 10.
• the node 14 detects that it must issue a control message in response to the received packet. This is an ICMP "Time exceeded" control message.
• the third packet P3 carrying the ICMP control message "Time Exceeded" is modified to allow looping congestion information as received. It can be seen that in this second embodiment, the modifications to be made to the nodes are also limited.
• a new message corresponding to a request for providing the congestion information is provided for a control protocol, for example for the ICMP protocol.
• the first packet PI, and therefore the second packet P2 then carry this new control message.
• a response to the supply request is also provided to provide congestion information.
• the third packet P3 then carries this response message to the supply request.
• the initiating node 10 causing the transmission of the first packet PI and thus triggering the transmission of the third packet P3 can supervise the good reception of the latter.
• the implementation of the method of obtaining does not cause overloading of the communication network, these exchanges of first and third packets being punctual.
• the third packet P3 thus carries information relating to the congestion of the route of the node 10 to the node 14 which must not be modified by intermediate nodes carrying the third packet to the node 10.
• the intermediate node or nodes carrying the third packet P3 in the uplink direction verify in the transfer plan whether the third packet P3 carries a control message belonging to the group comprising an ICMP message "Echo Reply", an ICMP message "Time exceeded” or even the response to the supply request. If this is the case, the intermediate node does not modify the information field 31 of the third packet P3, even if it encounters a congestion situation on this upstream direction.
• a packet communication network 1 is set up in which the nodes implement differentiated routing of the packets according to classes of CoS services for "Class of Service".
• This is for example a communication network in Diffserv mode, for "Differenciated Services".
• the packets carry information relating to their class of service.
• a service class packet 1 has a higher priority level; a service class 4 packet has the lowest priority level.
• a variant allowing a node to obtain information relating to congestion for the routing of packets for a given class of service.
• a queue is generally provided for each class of service. A class of service can then be disrupted if the traffic generated by packets of this class is greater than the processing capabilities of the node.
• the first PI packet transmitted by the node 10 includes an information field 30 including the class of service for which the congestion information is requested.
• the node 10 can obtain information relating to the congestion of the given class of service for the route to the node 14.
• an intermediate node may also set the congestion information for all higher level service classes than the given class of service.
• the node 10 acts as a content server, providing the functions of an audiovisual service platform and integrating a control device.
• the control device may also be external to the content server.
• the content server 10 is able to deliver data packets forming a video stream to client terminals, for example the node 16, through the packet communication network 1 via the nodes 12, 14.
• the client terminal 16 corresponds for example to a residential gateway, forming the entry point to a residential network of a user.
• the node 12 corresponds to a router and the node 14 corresponds to a communication network access equipment, for example a DSLAM multiplexer, for "Digital Subscriber Access Line Multiplexer", which is connected to the client terminal 16.
• the node 18 corresponds to a piece of equipment of the residential network, for example a terminal of the PC type.
• the PC type terminal can be connected directly to the network without the intermediary of a gateway.
• node 16 may be the entry point of an enterprise network.
• Node 14 can be of any type DSLAM as already mentioned, or alternatively MSAN for "MultiService Access Node” in ADSL technology, for "Asymmetric Digital Subscriber Line", or FTTH optics, for "Fiber To The Home” .
• the IP communication network in Diffserv mode simultaneously supports priority services called "Premium” and non-priority "Best Effort".
• Premium priority services
• Best Effort priority services
• the simple prioritization of the data flows associated with "Premium” services on data flows associated with "Best Effort” flows ensures that the data flows associated with "Premium” services have a satisfactory level of service quality, possibly by removing some of the associated data flows "Best Effort" services when load rates become very high.
• the implementation of the obtaining method makes it possible to trigger the implementation of these functions.
• step El the content server 10 inserts ICMP "Echo Request” messages for the "Premium” services to the nodes 14, 16 forming the path to the final client.
• step F1 On reception (step F1) of a first packet PI carrying the ICMP message "Echo Request”, the destination node indicates (step F4) in a third packet P2 carrying an ICMP message "Echo Reply" a possible congestion affecting the downstream direction of the "Premium” services, that is from the content server 10 to the end customer. This is for example a threshold overflow in a queue.
• the content server 10 On receipt of this explicit notification, the content server 10 then implements the new communications admission control function for the "Premium” services and using the congested resource.
• the release of the content server 10 is done after a certain period without receiving congestion notifications.
• the "Best Effort" services are not affected by the implementation of the process for "Premium” services. Thus, even if a low priority class, for example for "Best Effort” services, reaches saturation, there is no impact on the "Echo Reply" messages transmitted for the higher priority class.
• the proposed solution is adapted and particularly suitable for systems in which are defined different classes of traffic with priority of certain classes on others.
• Node equipment of the packet communication network will now be described in connection with FIG. 4.
• Such node equipment notably comprises:
• a transmitting and receiving module 102 arranged to transmit and receive packets in the transfer plane
• control module 106 arranged to exchange control information in the control plane with another node equipment; a congestion detection module 108, arranged to detect congestion likely to degrade a routing by this node equipment of packets transmitted by the other node equipment.
• the control module 106 is furthermore arranged for:
• the module 102 is also arranged to process packets in the transfer plan, and in particular to obtain from the first packet PI, to which the control message responds, information relating to congestion of the route in the downstream direction, copy this information in a second packet to be sent.
• This second packet carries the control message transmitted by the control module 106.
• control module 106 is also arranged to trigger the sending of the first packet PI to any of the nodes of the communication network 1.
• the first PI packet may comprise an ICMP control message as described in connection with the first and third embodiments.
• the first PI packet may also be a packet for which the validity period expires, as described in connection with the second embodiment.
• the packet processing module 104 detects during the processing of the packet that the lifetime has expired and then transmits this information to the control module 106.
• the processing module 104 is also arranged not to modify the heading of second packets, when they carry a particular control message, as described above.
• the control module 106 of the node equipment is arranged to implement those steps of the previously described obtaining method executed by the node equipment.
• These are preferably software modules comprising software instructions for executing those of the steps of the method of obtaining described above, implemented by a node equipment.
• the invention therefore also relates to:
• a program for node equipment comprising program instructions intended to control the execution of those of the steps of the method of obtaining described above which are executed by said node equipment, when said program is executed by a processor thereof;
• the software modules can be stored in or transmitted by a data carrier.
• This may be a hardware storage medium, for example a CD-ROM, a magnetic diskette or a hard disk, or a transmission medium such as an electrical signal, optical or radio, or a telecommunications network.
• the invention also relates to a communication system in a packet communication network, wherein first and second nodes exchange control information in a control plane.
• the system includes:
• a first node comprising a control module 106 arranged to send to a second node a first packet, for which the second node must transmit in response a control message;

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=43920291

Family Applications (1)

Country Status (4)

Families Citing this family (4)

Family Cites Families (3)

• 2010
  • 2010-09-30 FR FR1057887A patent/FR2965689A1/fr not_active Withdrawn
• 2011
  • 2011-09-29 US US13/824,735 patent/US20130185454A1/en not_active Abandoned
  • 2011-09-29 WO PCT/FR2011/052273 patent/WO2012042176A1/fr active Application Filing
  • 2011-09-29 EP EP11779758.9A patent/EP2622802A1/de not_active Withdrawn

Non-Patent Citations (1)

Also Published As

Similar Documents

Legal Events