[go: up one dir, main page]

WO2008012373A1 - Procédé pour la transmission d'un paquet de données et nœuds de réseau - Google Patents

Procédé pour la transmission d'un paquet de données et nœuds de réseau Download PDF

Info

Publication number
WO2008012373A1
WO2008012373A1 PCT/EP2007/057818 EP2007057818W WO2008012373A1 WO 2008012373 A1 WO2008012373 A1 WO 2008012373A1 EP 2007057818 W EP2007057818 W EP 2007057818W WO 2008012373 A1 WO2008012373 A1 WO 2008012373A1
Authority
WO
WIPO (PCT)
Prior art keywords
value
data packet
metric value
network
link
Prior art date
Application number
PCT/EP2007/057818
Other languages
German (de)
English (en)
Inventor
Matthias Kutschenreuter
Original Assignee
Siemens Aktiengesellschaft
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Siemens Aktiengesellschaft filed Critical Siemens Aktiengesellschaft
Publication of WO2008012373A1 publication Critical patent/WO2008012373A1/fr

Links

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/24—Traffic characterised by specific attributes, e.g. priority or QoS
    • H04L47/2408—Traffic characterised by specific attributes, e.g. priority or QoS for supporting different services, e.g. a differentiated services [DiffServ] type of service
    • 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
    • H04L47/2416—Real-time 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
    • H04L47/2458—Modification of priorities while in transit

Definitions

  • the invention relates to a method and a network node for transmitting a data packet.
  • a network allows the transmission of data packets between its nodes.
  • not all nodes of the network are directly connected to all other nodes. Therefore, a message from a sending node to a receiving node often needs to be forwarded through one or more intermediate nodes to get from the sending node to the receiving node.
  • the path from the sending node via the intermediate nodes to the receiving node is referred to as path or route.
  • connection quality can originate from different types of connection which make a different request for a connection quality .
  • Properties of the connection quality ⁇ ty are, for example. Throughput, packet loss rate, jitter and delay.
  • Connection quality is also referred to as quality of service, QoS.
  • Connections that have a QoS requirement are, for example, Voice over IP, VoIP connections.
  • Voice over IP Voice over IP
  • VoIP connections In order to provide acceptable voice quality at these, it is among other erfor ⁇ sary, a request concerning.
  • a packet loss rate ⁇ must be met, eg. Less than 3% or less than 5%.
  • the data throughput for the VoIP connection must also meet a requirement. For example. For a VoIP connection, a data throughput of 100kBit / s may be required. It is known to assign a priority based on the type of connection the pake ⁇ th of the connection. This can on the one hand ensure that a network node of the network preferably transmits data packets of this connection. On the other hand, the priority can mean that a network node receives preferred access to a transmission medium used for the network, for example to an air interface in a WLAN or adhoc network.
  • the object underlying the invention is to specify a method and a network node with which a higher quality for connections with a request for the connection quality is made possible.
  • a metric value is determined for at least part of the path, and a transmission priority value for the data packet is determined on the basis of the metric value.
  • the network can be a wired, eg Ethernet network or a wireless network.
  • wireless networks are an ad hoc network such as a WLAN network according to the IEEE 802.11 standard or a mesh network, e.g. according to the standard IEEE 802.11s.
  • the path in the network may be a link, i. act the direct connection between two network nodes of the network. It can also be a sequence of two or more links.
  • the metric value is the measure for evaluating the path.
  • This Bewer ⁇ processing can, for example, be the length of the path, eg. In the sense ei ⁇ ner number of links of the path of the so-called. Hop counts. It can also alternatively or additionally in a rating of a Transmission quality of the path. More Bewertun ⁇ gen that can enter into the metric value, consist, for example. In a delay, jitter, packet arrival probability and an expected packet repetition rate.
  • the metric value may, for example, consist of a number which is the measure for the evaluation of the path.
  • a low number means, for example, a path with a high transmission quality and a high number a path with low transmission quality. But it can also have a high number of high transmission quality ⁇ be interpreted and a low number of low transmission quality ⁇ ty. Although both possibilities exist, it is assumed below that a high metric value means a low transmission quality.
  • a transmission priority value is determined. This can, for example, take place in that values preparation ⁇ che be determined for the metric value, which is assigned a priority value Ü TRANSMISSION SYSTEM. If a metric value for a transmission link falls within a range, the assigned transmission priority value is used. There is also the possibility, for example.
  • a definable function ver ⁇ apply to determine the transmission priority value from the metric value.
  • the transmission priority value specifies a priority for the transmission of the data packet.
  • the priority of the As ⁇ tenps can eg. Ensure that the data packet is sent Compared to other data packets with different priority preferred o- the disadvantaged. Thus, for example.
  • the Mög ⁇ friendliness basically to send data packets higher priority before Since ⁇ tenunen lower priority.
  • the priority of the data packet can also ensure, for example, that a network node through which the data packet is to be sent has a lower or higher probability of gaining access to a transmission medium used.
  • An example of the transmission priority value is a so-called IEEE 802. ll-Access category.
  • TOS byte type-of-service byte
  • IP Internet Protocol
  • DSCP Differentiated Service Code Point
  • a high transmission priority value means a low priority for the data packet.
  • a high transmission priority value means a high priority for the data packet, ie a packet with a high Kochtra ⁇ confining priority value is preferred over a pa ⁇ ket low transmission priority value.
  • a first value is preferably determined when the metric value exceeds a threshold value over ⁇ , while a second value is determined in the case other than transmission priority value as the transmission priority value.
  • the first value is greater than the second value.
  • connection quality especially for connections over such paths, which have a bad metric value.
  • This is due to the fact that compounds which benefit from an increased priority, for example those with a poor metric value, are preferred, while other compounds thereby suffer no or only a small, detrimental disadvantage, for example those with a good metric value.
  • the transmission priority value is determined when the data packet o- of when a connection to which the data packet belongs, we ⁇ remedies a definable request to a kausqua ⁇ notes, in particular, a QoS, Quality of Service comprises ,
  • connections that have a request are VoIP connections, video telephony, video-on-demand, or streaming connections.
  • connections or data packets having the request By restricting a determination of the transmission priority value to connections or data packets having the request, a further preference of such connections or data packets is advantageously achieved.
  • Links without the requirement, so-called best-effort connections are disadvantaged. For disadvantaged connections, this results in a loss of quality, which may, for example, consist of a reduction in the average transmission rate or an increased delay. However, the loss of quality does not have the same effect on the less-favored best-effort connections or is more likely to be tolerated by a user of the connection.
  • the quality loss consists in an increased time, which is required for the download of the page.
  • the time difference does not have to be large and when the page is fully loaded there is no longer a disadvantage.
  • a sending network node that has generated the data packet determines the metric value and determines the transmission priority value, wherein the data packet is transmitted with the transmission priority value over the entire path.
  • the transmission priority value is determined only once by the sending network node.
  • the data packet then retains the path with the transmission priority value thus determined and is not changed with respect to the transmission priority value by further network nodes which are involved in the transmission, for example for forwarding.
  • At least one further network node which forwards the data packet, determines the met ⁇ value for at least part of the path and determines the transmission priority value, wherein the data packet with this transmission priority value least ⁇ sent by the other network node becomes.
  • the transmission priority value is thus redetermined by one or more further network nodes.
  • the metric value and the transmission priority value is preferably determined from all other network nodes which forward the data packet and be true ⁇ .
  • the metric value is determined at least for a preceding link of the path over which the data packet has already been transmitted.
  • This Wei ⁇ tertician has the advantage that a more senior network nodes also the history of a data packet be Wegsichti ⁇ gen may in determining the transmission priority value.
  • a network node to respond to the fact that a data packet on its way already a large delay he ⁇ take care (Delay), and through the provision of a high Ü TRANSMISSION SYSTEM priority value for a preferred forwarding the data packet.
  • the metric value for a next link of the path is determined via which the data packet is to be transmitted. This achieves precise control over the determination of the transmission priority value.
  • the preferred metric value a number of links of over ⁇ transmission link, in particular a hop count used.
  • the metric value is on a link metric value agrees based at least a link of the path loading, wherein the link metric value is a measure to the delegation ⁇ Cleaning quality of the link.
  • ETX Expected Transmission Count
  • the network node comprises a processing device which is configured such that for at least part of a path in a network, via which a data packet to übertra ⁇ gene, a metric value is calculated and based on the metric ⁇ value, a transmission priority level for the data packet be ⁇ votes. Furthermore, the network node of a transmitting / receiving device, which is configured such that the data packet is sent in consideration of the transmission priority value.
  • Such a network node may be, for example, a VoIP-enabled telephone, a laptop, a mobile phone, a PDA or a printer. Other possibilities exist in a router or a gateway.
  • the network has at least one network node according to the invention. It is preferably designed as an ad hoc network or as a mesh network, for example according to the standard IEEE 802.11g or IEEE 802.11s. Further details and advantages of the invention will be explained in more detail with reference to embodiments shown in the drawing. Show
  • FIG. 1 shows a mesh network with a gateway
  • Figure 2 is a schematic process flow.
  • the shown in Figure 1 includes a mesh network ers ⁇ th to fifth network node Kl ... 5 and a gateway G.
  • the network node Kl ... 5 and the gateway G are wirelessly connected to each other in ⁇ compound.
  • the network shown in Figure 1 is a mesh network.
  • the links Ll ... L6 are therefore connections via the air ⁇ interface.
  • the method according to the invention is independent of the type of links L 1... L 6 used. It is also used when one or more or all links Ll ... L6 are not connections over the air interface, son ⁇ countries conducted compounds, for example electrical ⁇ cal or optical connections.
  • the network nodes Kl ... 5 are telephones that can, for example, voice connections via voice over IP (VoIP) can build.
  • VoIP voice over IP
  • a first VoIP connection between the fifth and fourth network node K4, 5 should now exist.
  • the first VoIP connection causes data packets to be sent from the fifth network node K5 to the fourth network node K4 and in the opposite direction. the.
  • the data packets contain the voice information of the first VoIP connection.
  • the transmission of data packets from the fifth network node K5 to the fourth network node K4 requires the data packets to be forwarded by the third and first network nodes K3, 1.
  • the fifth, third and sixth links L5, 3, 6 are sent ver ⁇ spent.
  • connection for data transmission between the third network node K3 and the gateway G This is supposed to be a so-called best-effort connection, ie a connection in which data packets are only transmitted if free capacities exist at the transmitting network nodes K1... 5, ie if no data packets are higher Priority.
  • the connection of the As ⁇ tene for data transmission sent via the first and third link Ll, 3, ie the first network nodes Kl has to forward the data packets.
  • the following is a rule for calculating ei ⁇ nes metric value for a path from link metric values for the links of the path is considered.
  • the link metric values indicate in each case a transmission quality via the respective link Ll ... 6.
  • the metric value results from the addition of the link metric values.
  • a link metric value of 100 indicates a good link Ll ... 6, i. a link Ll ... 6 with perfect transmission quality. Larger values stand for a deteriorated transmission quality of the link Ll ... 6.
  • the links L1 ... 6 should have the following link metric values: First link Ll 110
  • a data packet of a VoIP connection is to be sent, then it is checked whether the metric value for the path that the data packet has to cover exceeds a threshold value.
  • the threshold value 150 is used. If the metric value is therefore greater than 150, the data packet receives a transmission priority value, referred to below as priority, of 7. Otherwise, the data packet receives a priority of 1.
  • the priority is performed by a determination of the so genann ⁇ th TOS byte priority.
  • An alternative, second embodiment of the invention shown SEN method results from the fact that the IEEE 802. ll-access category is used instead of the TOS byte priority. As a result, the corresponding network node K1... 5 is given an increased probability of accessing the air interface for the transmission of the corresponding data packet. In a third alternative embodiment of the invention, both priorities are shared.
  • the IEEE 802. llle access categories defined in the IEEE 802.11e standard only have the four values 0 ... 3. In ⁇ play, the following implementation of the desired priorities can to the IEEE 802. ll-Access category:
  • the priority value can define a variety of things: TOS, skb, DSCP, 802.11 Access category, etc.
  • a second VoIP connection is to exist between the second and first network nodes K2, 1.
  • Data packets of this second VoIP connection need only be sent via the second link L2.
  • a forwarding by another network node Kl ... 5 is not necessary.
  • the link-metric value of the second link L2, and thus the metric value for the path of the second VoIP connection should be 105. Therefore, because the metric value is less than 150, data packets of the second VoIP connection are given a priority of 1.
  • Data packets of the first VoIP connection between the fifth and fourth network nodes K5, 4 receive a priority of 7. This is due to the metric value of the path which results for the first VoIP connection from the fifth, sixth and third links L5, 3, 6 and over which the data packets must be transmitted.
  • the metric value is 603, which is more than 150.
  • the data packets of the first VoIP connection are compared with the transmission in the first network node Kl preferred those of the second VoIP connection.
  • those network nodes Kl, 3, 4, 5, which are involved in the first VoIP connection receive for sending a data packet of first VoIP connection an increased probability of access to the air interface ⁇ .
  • a further, fourth embodiment of the invention results if, instead of the metric value for the determination of the priority, only the link metric value is considered for that link L1 ... 6 over which the data packet is to be sent next.
  • the fourth embodiment can be arbitrarily combined with each of the three previous embodiments. In the case of the two VoIP connections considered in this example, this results in the data packets of the first VoIP connection being given only a priority of 7 during the transmission via the fifth and sixth links L5, 6, since the link metric value of these links L5, 6 is greater than 150. On the other hand, the link metric value of the third link L3 is less than 150 at 123. In the case of transmission via the third link L3, the data packets are therefore given a priority of 1.
  • a fifth embodiment of the invention which can be combined with the fourth one, results if the link metric value for the link L 1... 6 or those links L 1... 6 via which the data packet has already been transmitted is for the user consideration of the metric value.
  • a further, sixth embodiment of the invention results from the fact that the determination of the metric value and the determination of the priority are carried out exclusively by the transmitting network node, ie by the network node which generates the data packets.
  • these are the fourth and fifth network nodes K4, 5 for the first VoIP connection and the first and second network nodes K1, 2 for the second VoIP connection.
  • the following treatment results for the first network node K1.
  • Data packets of the second VoIP connection and data packets of the first VoIP connection, which are transmitted via the third link L3, are treated the same at the first network node K1.
  • data packets of the second VoIP connection, which are to be transmitted via the sixth link L6, are preferably treated at the first network node K1 in comparison with the previous data packets.
  • Another form of evaluation of the links L1 ... 6 and thus the path may also be used.
  • An example of this which is suitable for the first three embodiments of the invention, the use of the number of links Ll ... 6 as a path whose metric ⁇ value, the so-called. Hop count. This corresponds to the above pre ⁇ hen if you fix the link metric value of each link Ll ... 6 to 1.
  • the threshold value is a value of 1, for example. Expedient ⁇ SSIG. This leads in the given example to the fact that the data packets of the second VoIP connection, which only over the second
  • Link L2 leads, get a priority of 1, while the first VoIP connection Since ⁇ tename receive a priority of 7, since the first VoIP connection of the three links L3, 5, 6, that leads in particular over more than one link ,
  • the data packets of the first VoIP connection that can overcome a path with a higher metric value have preferential treatment against data packets of a VoIP connection with better metric value.
  • the connection quality of the first VoIP connection is thereby increased, whereby a moderate, verticiangbare deterioration of the transmission quality of the second VoIP connection is accepted. Both connections can meet their QoS requirements.
  • FIG. 2 schematically illustrates an exemplary implementation of the method.
  • a network ⁇ network node 5 receives Kl ... a data packet for transmission over a link Ll ... 6.
  • a second step of the method of network nodes Kl ... 5 determines whether the data packet originates a compound ent ⁇ , a QoS request, ie, a requirement for Quality of Service provides, for example, a VoIP connection. If this is not the case, the network node K1... 5 sets a priority of 0 for the data packet in a first determination step SF1.
  • a third step S3 the network node K1... 5 determines a metric value for the path or a part of the path over which the data packet must be transmitted and in a fourth step S4 checks whether the metric value exceeds the threshold value. If this is the case, the network node K1... 5 sets a priority of 7 in a second setting step SF2 for the data packet, otherwise in a third setting step SF3 a priority of 1.
  • the path that a data packet has to travel only partially ver ⁇ running within the network is when a compound of one of the network nodes Kl ... 5 through the gateway G in the attached ⁇ connected Internet.
  • the metric can be ⁇ value determined for the entire path.

Landscapes

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

Abstract

La présente invention concerne un procédé et un nœud de réseau dans lesquels une priorité de transmission pour un paquet de données ou une connexion, qui présente une requête QoS (Qualité de service), est définie à l'aide d'une valeur métrique d'un chemin pour le paquet de données. Si le chemin présente à l'aide de la valeur métrique une faible qualité de transmission, une priorité de transmission élevée est attribuée.
PCT/EP2007/057818 2006-07-28 2007-07-30 Procédé pour la transmission d'un paquet de données et nœuds de réseau WO2008012373A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
DE102006035098.7 2006-07-28
DE102006035098A DE102006035098A1 (de) 2006-07-28 2006-07-28 Verfahren zur Übertragung eines Datenpakets und Netzwerkknoten

Publications (1)

Publication Number Publication Date
WO2008012373A1 true WO2008012373A1 (fr) 2008-01-31

Family

ID=38462515

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/EP2007/057818 WO2008012373A1 (fr) 2006-07-28 2007-07-30 Procédé pour la transmission d'un paquet de données et nœuds de réseau

Country Status (2)

Country Link
DE (1) DE102006035098A1 (fr)
WO (1) WO2008012373A1 (fr)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030007454A1 (en) * 2001-07-09 2003-01-09 International Business Machines Corporation Traffic management in packet-based networks
US20030119556A1 (en) * 2001-12-24 2003-06-26 Irfan Khan Method of balancing backhaul delays for a series of daisy chained radio base stations
EP1528729A2 (fr) * 2003-11-03 2005-05-04 Alcatel Ordonnancement sensible à la distance de traffic TDM en paquets dans un réseau VPLS

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5224099A (en) * 1991-05-17 1993-06-29 Stratacom, Inc. Circuitry and method for fair queuing and servicing cell traffic using hopcounts and traffic classes
US20030000754A1 (en) * 2001-06-07 2003-01-02 Daudt Stephen William Powered lightweight personal transportation vehicle
US7616961B2 (en) * 2002-04-29 2009-11-10 Harris Corporation Allocating channels in a mobile ad hoc network
US7027426B2 (en) * 2002-08-05 2006-04-11 Harris Corporation Multi-channel mobile ad hoc network

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030007454A1 (en) * 2001-07-09 2003-01-09 International Business Machines Corporation Traffic management in packet-based networks
US20030119556A1 (en) * 2001-12-24 2003-06-26 Irfan Khan Method of balancing backhaul delays for a series of daisy chained radio base stations
EP1528729A2 (fr) * 2003-11-03 2005-05-04 Alcatel Ordonnancement sensible à la distance de traffic TDM en paquets dans un réseau VPLS

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
NAGHIAN S ET AL: "Semi-infrastructured mobile ad-hoc mesh networking", PERSONAL, INDOOR AND MOBILE RADIO COMMUNICATIONS, 2003. PIMRC 2003. 14TH IEEE PROCEEDINGS ON SEPT. 7-10, 2003, PISCATAWAY, NJ, USA,IEEE, vol. 2, 7 September 2003 (2003-09-07), pages 1069 - 1073, XP010679157, ISBN: 0-7803-7822-9 *

Also Published As

Publication number Publication date
DE102006035098A1 (de) 2008-01-31

Similar Documents

Publication Publication Date Title
DE602004008267T2 (de) Übertragung von überwachungspaketen zur steuerung von überlastung und verbindungsaufbau in paketbasierten netzen mit begrenzter bandbreite
DE60029513T2 (de) Ein auf Diensteklassen basiertes Internet-Protokoll(IP) Wegelenkungsverfahren
DE60127869T2 (de) Verfahren zum zuteilen von dienstparameterwerten an übertragungen, funkzugangsnetze und netzwerkelemente
DE69326903T2 (de) Verfahren zur überlastabwehr in frame-relay-netzen und ein knoten in einem solchen netz
DE60031776T2 (de) Verfahren und vorrichtung für ein kommunkationsnetz
DE60109809T2 (de) Verfahren und system für betriebsmittelreservierungen in einem multicast-netzwerk
DE60127120T2 (de) Verfahren und netzwerk zur ausbreitung von statusinformationen
DE69926477T2 (de) Verfahren und Vorrichtung zur dynamischen Steuerung der Bereitstellung von differenzierter Diensten
EP1593241A1 (fr) Controle d'acces a un reseau oriente paquet en fonction d'exigences de resilience
WO1997033409A1 (fr) Procede de transmission sur ethernet de paquets de donnees a classes de priorite predefinissables, entre un premier dispositif et au moins un deuxieme dispositif
EP1428361B1 (fr) Limitation de trafic pour reseau avec transmission a bon niveau de qualite de service
DE202004010729U1 (de) System zur Verwaltung von Funkressourcen in einem Zeitschlitze verwendenden Kommunikationssystem
DE202005014183U1 (de) Drahtlose Station für die Verwendung in einem Maschennetzwerk
DE60130587T2 (de) Asymmetrische bandbreitenzuteilung
EP1645101A1 (fr) Procede de commande de circuits de donnees
DE69921183T2 (de) Schnurloses teilnehmeranschluss-system und hierfür nützliches verfahren
WO2007012304A1 (fr) Procede de controle de ressources dans des elements d'un reseau de telecommunication
EP1700434B1 (fr) Procede pour determiner des valeurs limites pour un controle du trafic dans des reseaux de communication a controle d'acces
EP1249154B1 (fr) Procede et dispositif de commande d'acces a un reseau de communication
DE202006003829U1 (de) Maschennetz und Vorrichtung zum Übertragen von Paketen
WO2008012373A1 (fr) Procédé pour la transmission d'un paquet de données et nœuds de réseau
DE102016225164A1 (de) Verfahren zur Datenübertragung in einem Multihop-Netzwerk
DE10014522C2 (de) Verfahren und Anordnung zur Zulässigkeitsprüfung einer Dienstnutzung
EP1586180B1 (fr) Limitation du trafic dans des reseaux orientes paquets a l'aide de valeurs limites dependant des liaisons pour le trafic passant les limites du reseau
EP3364600B1 (fr) Surveillance de débits de données

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 07788025

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

NENP Non-entry into the national phase

Ref country code: RU

122 Ep: pct application non-entry in european phase

Ref document number: 07788025

Country of ref document: EP

Kind code of ref document: A1