FI124649B - Method and system for finding the minimum hop-specific data transfer rate - Google Patents

Method and system for finding the minimum hop-specific data transfer rate Download PDF

Info

Publication number
FI124649B
FI124649B FI20125760A FI20125760A FI124649B FI 124649 B FI124649 B FI 124649B FI 20125760 A FI20125760 A FI 20125760A FI 20125760 A FI20125760 A FI 20125760A FI 124649 B FI124649 B FI 124649B
Authority
FI
Finland
Prior art keywords
network element
data
hop
data transfer
network
Prior art date
Application number
FI20125760A
Other languages
Finnish (fi)
Swedish (sv)
Other versions
FI20125760A (en
Inventor
Mika Silvola
Original Assignee
Tellabs Oy
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 Tellabs Oy filed Critical Tellabs Oy
Priority to FI20125760A priority Critical patent/FI124649B/en
Priority to EP13171954.4A priority patent/EP2680492B1/en
Priority to US13/928,768 priority patent/US10097468B2/en
Priority to CN201310272165.XA priority patent/CN103532871B/en
Publication of FI20125760A publication Critical patent/FI20125760A/en
Application granted granted Critical
Publication of FI124649B publication Critical patent/FI124649B/en

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/26—Flow control; Congestion control using explicit feedback to the source, e.g. choke packets
    • H04L47/263—Rate modification at the source after receiving feedback
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00—Arrangements for monitoring or testing data switching networks
    • H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
    • H04L43/0805—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters by checking availability
    • H04L43/0811—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters by checking availability by checking connectivity
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00—Arrangements for monitoring or testing data switching networks
    • H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
    • H04L43/0823—Errors, e.g. transmission errors
    • H04L43/0829—Packet loss
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00—Arrangements for monitoring or testing data switching networks
    • H04L43/10—Active monitoring, e.g. heartbeat, ping or trace-route
    • 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/18—End to end
    • 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/22—Traffic shaping
    • 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/25—Flow control; Congestion control with rate being modified by the source upon detecting a change of network 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/10—Flow control; Congestion control
    • H04L47/41—Flow control; Congestion control by acting on aggregated flows or links

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Environmental & Geological Engineering (AREA)
  • Health & Medical Sciences (AREA)
  • Cardiology (AREA)
  • General Health & Medical Sciences (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Description

A method and a system for finding smallest hop-specific data transfer speed Field of the invention
The invention relates to a method and a system for finding the smallest of hop-5 specific data transfer speeds related to a data transfer path. Furthermore, the invention relates to a data transfer system and to a network element, e.g. a router or a switch, of a data transfer system. Furthermore, the invention relates to a computer program for controlling a network element.
Background 10 A data transfer path from an originator network element to a destination network element may comprise multiple successive hops each being between two network elements located on the above-mentioned data transfer path and interconnected with a data transfer link that can be e.g. a copper wire link, a fiber link, or a radio link. These two network elements can be, for example, Ethernet switches operat-15 ing on the Open System Interconnection “OSI” Level 2, i.e. on the “L2 data link layer”. The originator network element and the destination network element can be, for example, Internet Protocol “IP” routers operating, in addition to the L2 data link layer, on the Open System Interconnection “OSI” Level 3, i.e. on the “L3 network layer”. The data transfer speed available on each hop depends on the data 20 transfer speed of the data transfer link being used and/or on other factors such as, ^ for example, a transmitter shaper at the transmission-end of the hop under con- o ™ sideration and/or a receiver shaper at the reception-end of the said hop. Further ed 9 more, one or more of the hops of the data transfer path may have dynamically o ° changing data transfer speed. A hop having dynamically changing data transfer
X
£ 25 speed can be, for example, a hop implemented with an adaptive microwave “MW” § Ethernet radio link whose data transfer speed is adapted according to weather ou conditions. The data transfer speed of an adaptive microwave Ethernet radio link ° may vary, for example, from 100 Mbits/sec to 500 Gbits/sec depending on weather conditions. Yet furthermore, buffering capacity available at a transmission-end of 30 an adaptive microwave Ethernet radio link can be quite limited. The above- 2 mentioned viewpoints complicate the control and the management of the end-to-end quality of service “QoS” provided by the data transfer path.
Publication US20120076029 describes a system where maintenance entities may be defined between customer and provider points to allow performance manage-5 ment to take place on an Ethernet network. The maintenance entities may be defined for access links, intra-domain, and inter-domain, and may be defined on a link or service basis. Performance parameters, including availability metrics, may be collected for the maintenance entities. Use of this system for controlling and managing the end-to-end quality of service “QoS” provided by data transfer paths 10 of the kind described above is, however, complicated.
Summary
The following presents a simplified summary in order to provide a basic understanding of some aspects of various invention embodiments. The summary is not an extensive overview of the invention. It is neither intended to identify key or criti-15 cal elements of the invention nor to delineate the scope of the invention. The following summary merely presents some concepts of the invention in a simplified form as a prelude to a more detailed description of exemplifying embodiments of the invention.
In accordance with the first aspect of the invention there is provided a new method 20 for finding the smallest of hop-specific data transfer speeds related to a data transfer path from a first network element to a second network element. The method is 'ίο based on extending Ethernet Operations, Administration, and Management “OAM” ώ functionality for finding the smallest of the hop-specific data transfer speeds, g Background information about Ethernet OAM functionality can be found, for exam- x 25 pie, from the following technical specifications: IEEE 802.1 ag - Connectivity Fault ^ Management and ITU-T SG 13 Q5 WG: Y.1731 - OAM Functions and Mediani nisms for Ethernet Based Networks, where IEEE = Institute of Electrical and Elec- m ^ tronics Engineers, and ITU-T SG 13 Q5 WG = International Telecommunication
C\J
Union, Telecommunication Standardization Sector, Study Group 13, Question 5 30 Working Group.
3
The method for finding the smallest of the hop-specific data transfer speeds comprises: - transmitting, from the first network element to the second network element, first data comprising an Ethernet OAM message, 5 - updating, in at least one third network element located on the data transfer path, the first data to indicate so far smallest of the hop-specific data transfer speeds, and - in response to reception of the first data at the second network element, transmitting, from the second network element to the first network element, 10 second data indicating the smallest of the hop-specific data transfer speeds, wherein the Ethernet OAM message represents a request for the second data.
With the aid of the above-described method, the first network element can be made aware of the smallest of the hop-specific data transfer speeds, and trans-15 mission speed of a data flow transmitted from the first network element to the second network element can be limited on the basis of the above-mentioned second data indicating the smallest of the hop-specific data transfer speeds in order to avoid loss of data frames on the data transfer path and thereby to maintain the end-to-end quality of service “QoS”.
^ 20 A method according to an advantageous exemplifying embodiment of the inven- ^ tion comprises transmitting the first data repeatedly from the first network element § to the second network element and, as a consequence, transmitting also the re- § sponding second data repeatedly from the second network element to the first £ network element. In this case, the first network element can be kept up-to-date Q_ 0 25 aware of the currently smallest of the hop-specific data transfer speeds. This
CD
[£ makes it possible to adapt the transmission speed of a data flow transmitted from C\l 5 the first network element to the second network element according to dynamic changes of one or more of the hop-specific data transfer speeds.
4
In accordance with the second aspect of the invention there is provided a new system for finding the smallest of hop-specific data transfer speeds related to a data transfer path from a first network element to a second network element. In the system: 5 - the first network element is configured to transmit, to the second network element, first data comprising an Ethernet OAM message, - each of one or more third network elements located on the data transfer path is configured to update the first data to indicate so far smallest of the hop-specific data transfer speeds, and 10 - the second network element is configured to transmit, in response to recep tion of the first data at the second network element, second data to the first network element, the second data indicating the smallest of the hop-specific data transfer speeds, wherein the Ethernet OAM message represents a request for the second data.
15 In accordance with the third aspect of the invention there is provided a new network element that comprises a processing system configured to: - control the network element to transmit first data to another network element via a data transfer path from the network element to the other network element, the first data comprising an Ethernet OAM message, ^ 20 - form, on the basis of second data received from the other network element,
CM
^ a first limit value indicating the smallest of hop-specific data transfer speeds
O
^ related to the data transfer path, and 0 1 - control transmission speed of a data flow transmitted from the network ele- o ment to the other network element to be limited on the basis the first limit
CD
to 25 value,
CM
δ ™ wherein the Ethernet OAM message represents a request for the second data.
5
In accordance with the fourth aspect of the invention there is provided a new data transfer system comprising a first network element, a second network element, and one or more third network elements on a data transfer path from the first network element to the second network element. In the data transfer system: 5 - the first network element is configured to transmit, to the second network element, first data comprising an Ethernet OAM message, and to control transmission speed of a data flow transmitted from the first network element to the second network element to be limited on the basis second data received from the second network element and indicating the smallest of hop-10 specific data transfer speeds related to the data transfer path, - each of the third network elements is configured to update the first data to indicate so far smallest of the hop-specific data transfer speeds, and - the second network element is configured to transmit, in response to reception of the first data at the second network element, the second data to the 15 first network element, wherein the Ethernet OAM message represents a request for the second data.
In accordance with the fifth aspect of the invention there is provided a new computer program for controlling a network element. The computer program comprises computer executable instructions for controlling a programmable processor to: ^ 20 - control the network element to transmit first data to another network ele- ° ment via a data transfer path from the network element to the other network § element, the first data comprising an Ethernet OAM message, o 0 - form, on the basis of second data received from the other network element,
1 ’ CC
“ a first limit value indicating the smallest of hop-specific data transfer speeds § 25 related to the data transfer path, and m
C\J
δ - control transmission speed of a data flow transmitted from the network ele- C\J 1 ment to the other network element to be limited on the basis the first limit value, 6 wherein the Ethernet OAM message represents a request for the second data.
A computer program product according to the invention comprises a non-volatile computer readable medium, e.g. a compact disc (“CD”), encoded with a computer program according to the invention.
5 A number of non-limiting exemplifying embodiments of the invention are described in accompanied dependent claims.
Various non-limiting exemplifying embodiments of the invention both as to constructions and to methods of operation, together with additional objects and advantages thereof, will be best understood from the following description of specific 10 exemplifying embodiments when read in connection with the accompanying drawings.
The verbs “to comprise” and “to include” are used in this document as open limitations that neither exclude nor require the existence of unrecited features. The features recited in depending claims are mutually freely combinable unless otherwise 15 explicitly stated.
Brief description of figures
The exemplifying embodiments of the invention and their advantages are explained in greater detail below in the sense of examples and with reference to the accompanying drawings, in which: ? 20 figure 1 shows a schematic illustration of an exemplifying data transfer system ac- c\j ^ cording to an exemplifying embodiment of the invention, o o figure 2 shows a schematic block diagram of an exemplifying network element ac- | cording to an exemplifying embodiment of the invention, and o figure 3 shows a flow chart of a method according to an exemplifying embodiment n 25 of the invention for finding the smallest of hop-specific data transfer speeds of a 00 data transfer path from a first network element to a second network element.
7
Description of exemplifying embodiments
Figure 1 shows a schematic illustration of an exemplifying data transfer system that comprises a first network element 101, second network elements 102 and 116, and third network elements 103, 104, 105, 106, and 107. In the exemplifying 5 case shown in figure 1, it is assumed that the network elements 103-107 are network elements operating on the Open System Interconnection “OSI” Level 2, i.e. on the “L2 data link layer”. These network elements 103-107 can be, for example but not necessarily, Ethernet switches. It is further assumed that the network elements 101, 102, and 116 are operating, in addition to the L2 data link layer, also 10 on the Open System Interconnection “OSI” Level 3, i.e. on the “L3 network layer”. These network elements 101,102, and 116 can be, for example but not necessarily, Internet Protocol “IP” routers. Each of the network elements 101-107, and 116 can be configured to support also other data transfer protocols such as, for example, the Multiprotocol Label Switching “MPLS”. The network elements 101-107 and 15 data links between these network elements form a first data transfer path from a data source 114 to a destination 115, and the network elements 101,103-105, and 116 and data links between these network elements form a second data transfer path from the data source 114 to a destination 117. The data source 114 can be, for example, a storage containing data to be transferred. The destinations 115 and 20 117 can be, for example, user terminal devices such as personal computers. The first data transfer path from the network element 101 to the network element 102 comprises successive hops 108, 109, 110, 111, 112, and 113 each being between two of the network elements 101-107. The second data transfer path from the ° network element 101 to the network element 116 comprises successive hops 108, o 25 109,110, and 118 each being between two of the network elements 101,103-105, 0 and 116. In the exemplifying case shown in figure 1, the network element 104 is 1 connected to the network element 105 with a first radio link, and correspondingly o the network element 105 is connected to the network element 106 with a second
CD
ίο radio link. The first and second radio links can be, for example, adaptive micro- o 30 wave “MW” Ethernet radio links whose data transfer speeds are adapted according to weather conditions.
8
The data transfer system shown in figure 1 comprises a system according to an exemplifying embodiment of the invention for finding the smallest of the data transfer speeds available on the hops 108-113. The system for finding the smallest of the hop-specific data transfer speeds is implemented in the network elements 101-5 107 and it is based on extending the Ethernet Operations, Administration, and
Management “OAM” functionality. The data transfer system shown in figure 1 may further comprise a similar system for finding the smallest of the data transfer speeds available on the hops 108-110, and 118 which belong to the second data transfer path from the network element 101 to the network element 116. Without 10 limiting the generality, we can consider the first data transfer path from the network element 101 to the network element 102. The network 101 element is configured to transmit, to the network element 102, first data comprising an Ethernet OAM message. Each of the network elements 103-107 is configured to update the first data to indicate so far smallest of the hop-specific data transfer speeds when the 15 first data passes through these network elements 103-107. The network element 102 is configured to transmit, in response to reception of the first data, second data to the network element 101, where the second data indicates the smallest of the hop-specific data transfer speeds.
The above-described procedure for delivering to the network element 101 the se-20 cond data indicating the smallest of the hop-specific data transfer speeds can be implemented in various ways. For example, each of the network elements 103-107 can be configured check whether a speed value contained by the first data is greater than appropriate forwarding speed available at the network element under ° consideration, and, if yes, overwrite the speed value with the value of the above- § 25 mentioned forwarding speed. In this case, the second data may comprise the 0 speed value contained by the first data when the first data was received at the 1 network element 102. For a second example, each of the network elements 103- o 107 can be configured write, to the first data, a speed value indicating the forward-
CO
[n ing speed available at the network element under consideration, and the network
C\J
o 30 element 102 can be configured to select the smallest of the speed values contained by the first data. In this case, the second data may comprise the selected speed value. For a third example, each of the network elements 103-107 can be 9 configured write, to the first data, a speed value indicating the forwarding speed available at the network element under consideration, and the network element 102 can be configured to send the speed values contained by the first data to the network element 101 that is, in turn, configured to select the smallest of the speed 5 values. It is also possible that the first data is updated, in each of the network elements 103-107, not only on the basis of the appropriate forwarding speed available at the network element under consideration but also on the basis of limitations directed to reception speed of data that arrives from the preceding network element on the first data transfer path from the network element 101 to the network 10 element 102. Limitations directed to the reception speed can be caused by, for example, possible ingress shapers.
The network elements 103-107 may have less quality-of-service “QoS” capabilities and buffering capabilities than the network elements 101 and 102. The second data indicating the smallest of the hop-specific data transfer speeds allows control-15 ling or restricting a data flow transferred from the network element 101 to the network element 102 so that use of bandwidth for carrying data traffic which is going to be dropped later on the first data transfer path can be avoided or at least reduced. For example, parameters of a shaper of the network element 101 can be set so that the peak transmission speed, i.e. the peak information rate “PIR”, of the 20 data flow from the network element 101 to the network element 102 is limited to be at most the smallest of the hop-specific data transfer speeds related to the first data transfer path.
o In a system according to an exemplifying embodiment of the invention for finding
CvJ
£ the smallest of the hop-specific data transfer speeds, each of the network ele- o c), 25 ments 103-107 is further configured to update the first data to indicate buffer ca- o x pacity available at a transmission-end related to the so far smallest of the hop- tr specific data transfer speeds when the first data passes through these network o elements 103-107. The network element 102 is configured to include, to the se-
Lo ™ cond data, information indicating the buffer capacity available at the transmission- o 00 30 end related to the smallest of the hop-specific data transfer speeds. In this case, the parameters of the shaper of the network element 101 can be set so that the average transmission speed, e.g. the committed information rate “CIR”, of the data 10 flow from the network element 101 to the network element 102 is limited to be at most the smallest of the hop-specific data transfer speeds, and a burst size of the data flow is limited to be at most the buffer capacity available at the transmission-end related to the smallest of the hop-specific data transfer speeds. The burst size 5 can be defined to be a difference between amount of data transmitted and amount of data transmittable at the smallest of the hop-specific data transfer speeds within an arbitrary time window.
In a system according to an exemplifying embodiment of the invention for finding the smallest of the hop-specific data transfer speeds, the network element 101 is 10 configured to transmit the first data repeatedly to the network element 102 via the first data transfer path, and correspondingly the network element 102 is configured to transmit the responding second data repeatedly to the network element 101 so as to keep the network element 101 up-to-date aware of the currently smallest of the hop-specific data transfer speeds. This makes it possible to adapt the trans-15 mission speed and/or the burst size of the data flow transmitted from the network element 101 to the network element 102 according to dynamic changes of one or more of the data transfer speeds available on the hops 108-113.
The Ethernet OAM message of the first data can be, for example, a Continuity Check Message “CCM” suitable for detecting loss of continuity and incorrect net-20 work connections. In this case, each of the network elements 103-107 can be configured to write, to the first data passing through the data transfer path, a speed value indicating the forwarding speed available at the network element under con- 't 5 sideration. For another example, the Ethernet OAM message of the first data can
C\J
^ be, for example, a Link Trace Message “LTM” suitable for tracking the data trans- o ^ 25 fer path from the network element 101 to other network elements. LTM can be o x used for probing network topology and link speeds. Information about the network cr topology can be used for forming shaping configurations which match the network o topology. For the sake of illustration, we consider an exemplifying case where the m ^ hop 111 has the smallest of the hop-specific data transfer speeds related to the o 00 30 first data transfer path from the network element 101 to the network element 102, and the hop 110 has the smallest of the hop-specific data transfer speeds related to the second data transfer path from the network element 101 to the network el- 11 ement 116. In this exemplifying case, the parameters of the shaper of the network element 101 can be set so that 1) the transmission speed of the aggregate of the data flow from the network element 101 to the network element 102 and the data flow from the network element 101 to the network element 116 is limited to be at 5 most the data transfer speed available on the hop 110, and 2) the transmission speed of the data flow from the network element 101 to the network element 102 is limited to be at most the data transfer speed available on the hop 111. The principle presented above in conjunction with the simple exemplifying topology shown in figure 1 where routes of the first and second data transfer paths branch off from 10 each other, can be used for building shaping groups for more complicated topologies.
Figure 2 shows a schematic block diagram of an exemplifying network element 201 according to an exemplifying embodiment of the invention. The network element can be, for example, an Internet Protocol “IP” router, an Ethernet switch, 15 and/or a Multiprotocol Label Switching “MPLS” switch. The network element comprises ingress ports 222, 223, and 224, and egress ports 225, 226 and 227 for connecting to other network elements of a data transfer system. The network element comprises a processing system 220 configured to control the network element to transmit first data to a first other network element via a first data transfer 20 path from the network element to the first other network element. The first data comprises an Ethernet Operations, Administration, and Management “OAM” message that can be, for example, a Continuity Check Message “CCM” suitable for ^ detecting loss of continuity and incorrect network connections or a Link Trace ° Message “LTM” suitable for tracking data transfer paths from the network element o 25 to other network elements. The processing system 220 is configured to form, on 0 the basis of second data received from the first other network element, a first limit 1 value indicating the smallest of hop-specific data transfer speeds related to the o above-mentioned first data transfer path. The processing system 220 is configured
CD
[n to control transmission speed of a first data flow transmitted from the network ele-
C\J
δ 30 ment to the first other network element to be limited on the basis the first limit val-
C\J
ue.
12
In a network element according to an exemplifying embodiment of the invention, the processing system 220 is configured to control the network element to transmit the first data repeatedly to the first other network element via the first data transfer path, and to update the first limit value on the basis of the second data received 5 repeatedly in response to repeating transmissions of the first data.
In a network element according to an exemplifying embodiment of the invention, the processing system 220 is configured to update a shaper 228 of the network element to limit peak transmission speed of the first data flow from the network element to the first other network element to be at most the first limit value.
10 In a network element according to an exemplifying embodiment of the invention, the processing system 220 is configured to: - update the shaper 228 of the network element to limit average transmission speed of the first data flow from the network element to the first other network element to be at most the first limit value, 15 - form, on the basis of the second data received from the first other network element, a first burst limit value indicating buffer capacity available at a transmission-end related to the smallest of the hop-specific data transfer speeds related to the first data transfer path, and - update the shaper of the network element to limit burst size of the first data 20 flow to be at most the first burst limit value, the burst size being a difference between amount of transmitted data of the first data flow and amount of da-o ™ ta transmittable at the smallest of the hop-specific data transfer speeds re- co 9 lated to the first data transfer path within an arbitrary time window.
CD
o
In a network element according to an exemplifying embodiment of the invention,
CL
0 25 the processing system 220 is further configured to:
CD
m ™ - control the network element to transmit the first data to a second other net- δ ^ work element via a second data transfer path from the network element to the second other network element, 13 - form, on the basis of third data received from the second other network element, a second limit value indicating smallest of hop-specific data transfer speeds related to the above-mentioned second data transfer path, and - control transmission speed of a second data flow transmitted from the net- 5 work element to the second other network element to be limited on the ba sis the second limit value, and - control transmission speed of an aggregate of the first data flow and the second data flow to be limited on the basis of the first limit value when the first limit value is related to a hop belonging to both of the first and second data 10 transfer paths, and on the basis of the second limit value when the second limit value is related to a hop belonging to both of the first and second data transfer paths.
The processing system 220 shown in figure 2 can be implemented with one or more programmable processor circuits, one or more dedicated hardware circuits 15 such as an application specific integrated circuit “ASIC”, one or more field programmable logic circuits such as a field programmable gate array “FPGA”, or a combination of these. Furthermore, it is also possible that the processing system is implemented with the aid of same processor hardware 221 that is used for performing forwarding- and/or control-plane processes related to data transfer proto-20 cols being used, e.g. IP, Ethernet, MPLS.
Figure 3 shows a flow chart of a method according to an exemplifying embodiment o of the invention for finding the smallest of hop-specific data transfer speeds of a cd data transfer path from a first network element to a second network element. The o g method comprises the following actions:
X
£ 25 - action 301: transmitting, from the first network element to the second net- § work element, first data comprising an Ethernet Operations, Administration, cu and Management “OAM” message, δ C\l 14 - action 302: updating, in at least one third network element located on the data transfer path, the first data to indicate so far smallest of the hop-specific data transfer speeds, and - action 303: in response to reception of the first data at the second network 5 element, transmitting, from the second network element to the first network element, second data indicating the smallest of the hop-specific data transfer speeds.
A method according to an exemplifying embodiment of the invention comprises transmitting the first data repeatedly from the first network element to the second 10 network element, as illustrated by an arrow 304 in figure 3.
In a method according to an exemplifying embodiment of the invention, the Ethernet OAM message is a Continuity Check Message “CCM” suitable for detecting loss of continuity and incorrect network connections. In a method according to another exemplifying embodiment of the invention, the Ethernet OAM message is 15 a Link Trace Message “LTM” suitable for tracking the data transfer path from the network element to the other network element.
A method according to an exemplifying embodiment of the invention further comprises: - updating, in the at least one third network element located on the data 20 transfer path, the first data to indicate buffer capacity available at a transit mission-end related to the so far smallest of the hop-specific data transfer o ™ speeds, and
CD
o g - including, to the second data, information indicating the buffer capacity available at the transmission-end related to the smallest of the hop-specific
CL
0 25 data transfer speeds.
CD
m ™ A method according to an exemplifying embodiment of the invention for controlling δ ^ a network element comprises: 15 - carrying out a method according to an exemplifying embodiment of the invention for finding the smallest of hop-specific data transfer speeds related to a data transfer path from the network element to another network element, and 5 - controlling transmission speed of a data flow transferred from the network element to the other network element to be limited on the basis of the smallest of the hop-specific data transfer speeds related to the data transfer path.
The controlling of the transmission speed may comprise, for example, updating a 10 shaper of the network element to limit peak transmission speed of the data flow to be at most the smallest of hop-specific data transfer speeds related to the data transfer path. For another example, the controlling of the transmission speed may comprise: - updating the shaper of the network element to limit average transmission 15 speed of the data flow to be at most the smallest of the hop-specific data transfer speeds related to the data transfer path, and - updating the shaper of the network element to limit burst size of the data flow to be at most buffer capacity available at the transmission-end related to the smallest of the hop-specific data transfer speeds related to the data 20 transfer path, the burst size being a difference between amount of transmit ted data of the data flow and amount of data transmittable at the smallest of o the hop-specific data transfer speeds related to the data transfer path within cd an arbitrary time window.
σ> ° A method according to an exemplifying embodiment of the invention for controlling
X
EE 25 a network element comprises: o
CD
- carrying out a method according to an exemplifying embodiment of the in-
C\J
o vention for finding the smallest of hop-specific data transfer speeds related
C\J
to a first data transfer path from the network element to a first other network element, 16 - controlling transmission speed of a first data flow transferred from the network element to the first other network element to be limited on the basis of the smallest of the hop-specific data transfer speeds related to the first data transfer path, 5 - carrying out a method according to an exemplifying embodiment of the in vention for finding smallest of hop-specific data transfer speeds related to a second data transfer path from the network element to a second other network element, - controlling transmission speed of a second data flow transferred from the 10 network element to the second other network element to be limited on the basis of the smallest of the hop-specific data transfer speeds related to the second data transfer path, and - controlling transmission speed of an aggregate of the first data flow and the second data flow to be limited on the basis of the smallest of the hop- 15 specific data transfer speeds related to the first data transfer path when a hop having the smallest of the hop-specific data transfer speeds related to the first data transfer path belongs also to the second data transfer path, and on the basis of the smallest of the hop-specific data transfer speeds related to the second data transfer path when a hop having the smallest of 20 the hop-specific data transfer speeds related to the second data transfer path belongs also to the first data transfer path.
o A computer program according to an exemplifying embodiment of the invention for cö controlling a network element comprises computer executable instructions for con- g trolling a programmable processor to carry out a method according to any of the x 25 above-described exemplifying embodiments of the invention for controlling a net-
CL
work element, o
CO
N- oj A computer program according to an exemplifying embodiment of the invention ™ comprises software modules for controlling a programmable processor to control a network element. The software modules comprise computer executable instruc-30 tions for controlling the programmable processor to: 17 - control the network element to transmit first data to another network element via a data transfer path from the network element to the other network element, the first data comprising an Ethernet Operations, Administration, and Management message, 5 - form, on the basis of second data received from the other network element, a first limit value indicating smallest of hop-specific data transfer speeds related to the data transfer path, and - control transmission speed of a data flow transmitted from the network element to the other network element to be limited on the basis the first limit 10 value.
The software modules can be, for example, subroutines and functions generated with a suitable programming language.
A computer program product according to an exemplifying embodiment of the invention comprises a non-volatile computer readable medium, e.g. a compact disc 15 (“CD”), encoded with the above-mentioned software modules.
A signal according to an exemplifying embodiment of the invention is encoded to carry information defining a computer program according to an embodiment of the invention.
The specific examples provided in the description given above should not be con- ^ 20 strued as limiting the applicability and/or the interpretation of the appended claims, δ
C\J
CD
O
CD
O
X
IX
CL
o
CD
m C\l δ
CM

Claims (23)

1. Verkkoelementti (201), joka käsittää prosessointijärjestelmän (220), joka on konfiguroitu: - ohjaamaan verkkoelementti lähettämään ensimmäinen data ensimmäiseen 5 muuhun verkkoelementtiin verkkoelementistä ensimmäiseen muuhun verk koelementtiin johtavan ensimmäisen datansiirtoväylän kautta, joka ensimmäinen data käsittää Ethernet Operations, Administration, and Management -viestin, - muodostamaan ainakin osittain ensimmäisestä muusta verkkoelementistä 10 vastaanotetun toisen datan perusteella ensimmäinen raja-arvo, joka ilmai see ensimmäistä datansiirtoväylää koskevista hyppykohtaisista datansiirto-nopeuksista pienimmän, ja - ohjaamaan verkkoelementistä ensimmäiseen muuhun verkkoelementtiin lähetetyn ensimmäisen datavirran siirtonopeus tulemaan rajoitetuksi ensim- 15 mäisen raja-arvon perusteella, tunnettu siitä, että mainittu Ethernet Operations, Administration, and Management -viesti edustaa pyyntöä saada mainittu toinen data.A network element (201) comprising a processing system (220) configured to: - direct the network element to send the first data to the first 5 other network elements via a first data transmission bus from the network element to the first other network element, the first data comprising Ethernet Operations, Administration, and Management; message, - at least in part, based on the second data received from the first other network element 10, establish a first threshold value indicating the lowest of the hop-specific data rates for the first data transmission path, and - direct the first data stream transmitted from the network element value, characterized in that said Ethernet Operations, Administration, and Management message represents a request to obtain said second data. 2. Patenttivaatimuksen 1 mukainen verkkoelementti, jossa prosessointijärjestelmä on konfiguroitu ohjaamaan verkkoelementti lähettämään ensimmäinen data toistu- 20 vasti ensimmäiseen muuhun verkkoelementtiin ensimmäisen datansiirtoväylän ° kautta. i COThe network element of claim 1, wherein the processing system is configured to control the network element to repeatedly send the first data to the first other network element via the first data transmission path °. i CO ^ 3. Patenttivaatimuksen 1 tai 2 mukainen verkkoelementti, jossa Ethernet Opera- O tions, Administration, and Management -viesti on Continuity Check -viesti, joka on CC sopiva jatkuvuuden menettämisen ja epäkorrektien verkkoyhteyksien ilmaisemi- § 25 seksi, m C\JA network element according to claim 1 or 2, wherein the Ethernet Operations, Administration, and Management message is a Continuity Check message which is CC suitable for detecting loss of continuity and incorrect network connections, m C \ J 4. Patenttivaatimuksen 1 tai 2 mukainen verkkoelementti, jossa Ethernet Opera tions, Administration, and Management -viesti on Link Trace -viesti, joka on sopiva 26 verkkoelementistä muuhun verkkoelementtiin johtavan datansiirtoväylän jäljittämiseksi.The network element according to claim 1 or 2, wherein the Ethernet Operations, Administration, and Management message is a Link Trace message suitable for tracing the data transmission path from the 26 network elements to the other network element. 5. Jonkin patenttivaatimuksen 1-4 mukainen verkkoelementti, jossa prosessointi-järjestelmä on konfiguroitu päivittämään verkkoelementin muokkain (228) ensim- 5 mäisen datavirran huippusiirtonopeuden rajoittamiseksi korkeintaan ensimmäiseksi raja-arvoksi.The network element according to any one of claims 1 to 4, wherein the processing system is configured to update the network element editor (228) to limit the peak data rate of the first data stream to a maximum of a first threshold. 6. Patenttivaatimuksen 1-4 mukainen verkkoelementti, jossa prosessointijärjestel-mä on konfiguroitu: - päivittämään verkkoelementin muokkain (228) rajoittamaan ensimmäisen 10 datavirran keskimääräinen siirtonopeus korkeintaan ensimmäiseksi raja- arvoksi, - muodostamaan toisen data perusteella purskeraja-arvo, joka ilmaisee ensimmäistä datansiirtoväylää koskevista hyppykohtaisista datansiirtonopeuk-sista pienimpään liittyvän, lähetyspäässä käytettävissä olevan puskurikapa- 15 siteetin, ja - päivittämään verkkoelementin muokkain rajoittamaan ensimmäisen datavirran purskekoko korkeintaan purskeraja-arvoksi, jolloin purskekoko on mielivaltaisen aikaikkunan puitteissa lähetetyn ensimmäisen datavirran määrän ja sen datamäärän, joka on lähetettävissä ensimmäistä raja-arvoa vastaa- 20 valla nopeudella mielivaltaisen aikaikkunan puitteissa, välinen ero.The network element according to claims 1-4, wherein the processing system is configured to: - update the network element modifier (228) to limit the average data rate of the first 10 data streams to a maximum of the first limit value, - generate a burst threshold indicating second hop data specific and - updating the network element modifier to limit the burst size of the first data stream to a maximum burst value, the burst size being the first data stream transmitted within the arbitrary time window and - at 20 speeds within an arbitrary time window, the difference. ° 7. Jonkin patenttivaatimuksen 1-6 mukainen verkkoelementti, jossa prosessointi- § järjestelmä on konfiguroitu: i O) - ohjaamaan verkkoelementti lähettämään ensimmäinen data toiseen muu- CC hun verkkoelementtiin verkkoelementistä toiseen muuhun verkkoelementtiin § 25 johtavan toisen datansiirtoväylän kautta, m c\j δ - muodostamaan toisesta muusta verkkoelementistä vastaanotetun kolman- CVJ nen datan perusteella toinen raja-arvo, joka ilmaisee yllä mainittua toista 27 datan si i rto väylää koskevista hyppykohtaisista datansiirtonopeuksista pienimmän, ja - ohjaamaan verkkoelementistä toiseen muuhun verkkoelementtiin lähetetyn toisen datavirran siirtonopeus tulemaan rajoitetuksi toisen raja-arvon perus- 5 teella, ja - ohjaamaan ensimmäisen datavirran ja toisen datavirran kokonaisuuden siirtonopeus tulemaan rajoitetuksi ensimmäisen raja-arvon perusteella silloin kun ensimmäinen raja-arvo koskee ensimmäisestä ja toisesta datansiirto-väylästä molempiin kuuluvaa hyppyä ja toisen raja-arvon perusteella silloin 10 kun toinen raja-arvo koskee ensimmäisestä ja toisesta datansiirtoväylästä molempiin kuuluvaa hyppyä.The network element according to any one of claims 1 to 6, wherein the processing system is configured: i) to control the network element to send the first data to the other network element via the second data transmission bus from the network element to the other network element, mc \ j - on the basis of the third CVJ data received from the other network element, form a second threshold value indicating the lowest of the above 27 data transmission hop-per-hop data transfer rates, and - direct the second data stream transmitted from the network element to the other network element to - 5 paths, and - control the transmission rate of the first data stream and the second data stream entity to be limited based on the first limit value when the first limit value applies to the first and second data bus m and based on the second limit value, 10 when the second limit applies to both of the first and second data links. 8. Jonkin patenttivaatimuksen 1-7 mukainen verkkoelementti, jossa verkkoelementti on ainakin yksi seuraavista: Internet Protocol (”IP”) -reititin, Ethernet-kytkin, Multiprotocol Label Switching (“MPLS”) -kytkin.The network element of any one of claims 1 to 7, wherein the network element is at least one of an Internet Protocol ("IP") router, an Ethernet switch, a Multiprotocol Label Switching ("MPLS") switch. 9. Datansiirtojärjestelmä, joka käsittää ensimmäisen verkkoelementin (101), toisen verkkoelementin (102) ja yhden tai useamman kolmannen verkkoelementin (104, 105) ensimmäisestä verkkoelementistä toiseen verkkoelementtiin johtavalla da-tansiirtoväylällä, jossa järjestelmässä: - ensimmäinen verkkoelementti on jonkin patenttivaatimuksen 1-8 mukainen 20 verkkoelementti, ^ - kukin kolmansista verkkoelementeistä on konfiguroitu päivittämään ensim- § mäinen data ilmaisemaan ensimmäistä datansiirtoväylää koskevista hyppy- § kohtaisista datansiirtonopeuksista siihen mennessä pienin, ja CC - toinen verkkoelementti on konfiguroitu vasteena sille, että ensimmäinen da-o fo 25 ta on vastaanotettu toiseen verkkoelementtiin, lähettämään toinen data en in ™ simmäiseen verkkoelementtiin, joka mainittu toinen data ilmaisee hyppy- δ ™ kohtaisista datansiirtonopeuksista pienimmän. 28A data transmission system comprising a first network element (101), a second network element (102) and one or more third network elements (104, 105) on a data transmission path from a first network element to a second network element, wherein: - the first network element according to any one of claims 1-8. 20 network elements, ^ - each of the third network elements is configured to update the first data to indicate the lowest data rate per hop for the first data bus, and CC - the second network element is configured in response to the first da-o fo 25 network element, to transmit the second data en in ™ to the first network element, said second data indicating the lowest data rate for hopping δ ™. 28 10. Patenttivaatimuksen 9 mukainen datansiirtojärjestelmä, jossa toinen data käsittää Ethernet Operations, Administration, and Management -viestin.The data transmission system of claim 9, wherein the second data comprises an Ethernet Operations, Administration, and Management message. 11. Menetelmä ensimmäisestä verkkoelementistä toiseen verkkoelementtiin johtavaa datansiirtoväylää koskevista hyppykohtaisista datansiirtonopeuksista pienim- 5 män löytämiseksi, jossa menetelmässä: - lähetetään (301) ensimmäisestä verkkoelementistä toiseen verkkoelementtiin ensimmäinen data, joka käsittää Ethernet Operations, Administration, and Management -viestin, - päivitetään (302) datansiirtoväylälle sijoitetussa ainakin yhdessä kolman- 10 nessa verkkoelementissä ensimmäinen data hyppykohtaisista datansiirto- nopeuksista siihen mennessä pienimmän ilmaisemiseksi, ja - vasteena sille, että ensimmäinen data on vastaanotettu toiseen verkkoelementtiin, lähetetään (303) toisesta verkkoelementistä ensimmäiseen verkkoelementtiin toinen data, joka ilmaisee hyppykohtaisista datansiirtonope- 15 uksista pienimmän, tunnettu siitä, että mainittu Ethernet Operations, Administration, and Management -viesti edustaa pyyntöä saada mainittu toinen data.A method for finding a minimum of data rate hops for data transmission from a first network element to a second network element, the method comprising: - transmitting (301) a first data comprising an Ethernet Operations, Administration, and Management2 message from the first network element to the second network element, in the at least one third network element disposed on the data transmission path, the first data of the hopping-specific data transmission rates so far indicating the lowest, and - in response to the first data being received in the second network element, a second data indicating a hyp the smallest of the two, characterized in that said Ethernet Operations, Administration, and Management message represents a request to obtain said second da ta. 12. Patenttivaatimuksen 11 mukainen menetelmä, jossa menetelmässä lähetetään ensimmäinen toistuvasti (304) ensimmäisestä verkkoelementistä toiseen verk- 20 koelementtiin. δ CNJThe method of claim 11, wherein the method is repeatedly transmitting (304) a first network element to a second network element. δ CNJ ^ 13. Patenttivaatimuksen 11 tai 12 mukainen menetelmä, jossa Ethernet Opera- O ^ tions, Administration, and Management -viesti on Continuity Check -viesti, joka on O sopiva jatkuvuuden menettämisen ja epäkorrektien verkkoyhteyksien ilmaisemi- cr seksi. o CD [o 25The method of claim 11 or 12, wherein the Ethernet Operations, Administration, and Management message is a Continuity Check message, which is O suitable for detecting loss of continuity and incorrect network connections. o CD [o 25 14. Patenttivaatimuksen 11 tai 12 mukainen menetelmä, jossa Ethernet Opera- o tions, Administration, and Management -viesti on Link Trace -viesti, joka on sopiva verkkoelementistä muuhun verkkoelementtiin johtavan datansiirtoväylän jäljittämiseksi. 29The method of claim 11 or 12, wherein the Ethernet Operations, Administration, and Management message is a Link Trace message suitable for tracing a data transmission path from a network element to another network element. 29 15. Jonkin patenttivaatimuksen 11-14 mukainen menetelmä, jossa menetelmässä lisäksi: - päivitetään datansiirtoväylälle sijoitetussa ainakin yhdessä kolmannessa verkkoelementissä ensimmäinen data hyppykohtaisista datansiirtonopeuk- 5 sista siihen mennessä pienimpään liittyvän, lähetyspäässä käytettävissä olevan puskurikapasiteetin ilmaisemiseksi, ja - sisällytetään toiseen dataan informaatio, joka ilmaisee hyppykohtaisista da-tansiirtonopeuksista pienimpään liittyvän, lähetyspäässä käytettävissä olevan puskurikapasiteetin.The method of any one of claims 11 to 14, further comprising: updating, in at least one third network element located on the data transmission path, the first data of the hopping-specific data rates to indicate the lowest associated buffer capacity available at the transmission end, and the lowest transfer rate available at the transmitting end. 16. Menetelmä verkkoelementin ohjaamiseksi, jossa menetelmässä: - suoritetaan jonkin patenttivaatimuksen 11-15 mukainen menetelmä verkkoelementistä ensimmäiseen muuhun verkkoelementtiin johtavaa ensimmäistä datansiirtoväylää koskevista hyppykohtaisista datansiirtonopeuksista pienimmän löytämiseksi, ja 15. ohjataan verkkoelementistä ensimmäiseen muuhun verkkoelementtiin siir retyn ensimmäisen datavirran siirtonopeus tulemaan rajoitetuksi ensimmäistä datansiirtoväylää koskevista hyppykohtaisista datansiirtonopeuksista pienimmän perusteella.A method for controlling a network element, the method comprising: performing a method according to any one of claims 11 to 15, for finding a minimum of jump data rates for a first data transfer path from a network element to a first other network element, and based on the lowest data rates. 17. Patenttivaatimuksen 16 mukainen menetelmä, jossa menetelmässä päivite- ^ 20 tään verkkoelementin muokkain rajoittamaan ensimmäisen datavirran huippusiir- ^ tonopeus ensimmäistä datansiirtoväylää koskevista hyppykohtaisista datansiirto- § nopeuksista korkeintaan pienimmäksi. i O) oThe method of claim 16, wherein the method comprises updating the network element modifier to limit the peak data rate of the first data stream to a maximum of a minimum of the hop rate data transmission rates for the first data bus. i O) o 18. Patenttivaatimuksen 16 mukainen menetelmä, joka on patenttivaatimuksen 15 CC mukainen ja jossa menetelmässä: o CD [o 25 - päivitetään verkkoelementin muokkain rajoittamaan ensimmäisen datavir- o ran keskimääräinen siirtonopeus ensimmäistä datansiirtoväylää koskevista hyppykohtaisista datansiirtonopeuksista korkeintaan pienimmäksi, ja 30 - päivitetään verkkoelementin muokkain rajoittamaan ensimmäisen datavirran purskekoko korkeintaan ensimmäistä dataväylää koskevista hyppykoh-taisista datansiirtonopeuksista pienimpään liittyväksi, lähetyspäässä käytettävissä olevaksi puskurikapasiteetiksi, jolloin purskekoko on mielivaltaisen 5 aikaikkunan puitteissa lähetetyn ensimmäisen datavirran määrän ja sen da tamäärän, joka on lähetettävissä ensimmäistä datansiirtoväylää koskevista hyppykohtaisista datansiirtonopeuksista pienimmällä mielivaltaisen aikaikkunan puitteissa, välinen ero.The method of claim 16, as in claim 15 CC, wherein: - CD_025 - updating the network element editor to limit the average data stream of the first data stream to a maximum of the lowest data rate hopping data rates on the first data bus, and 30 - updating the network element editor a data stream burst size of up to a minimum associated with a buffer capacity available at the transmission end, from the highest data rate of the first data stream to the smallest data stream of the first data stream transmitted within the arbitrary 5 time windows 19. Jonkin patenttivaatimuksen 16-18 mukainen menetelmä, jossa menetelmässä: Ί0 - suoritetaan jonkin patenttivaatimuksen 11-15 mukainen menetelmä verkkoelementistä toiseen muuhun verkkoelementtiin johtavaa toista datansiirtoväylää koskevista hyppykohtaisista datansiirtonopeuksista pienimmän löytämiseksi, - ohjataan verkkoelementistä toiseen muuhun verkkoelementtiin siirretyn toi- 15 sen datavirran siirtonopeus tulemaan rajoitetuksi toista datansiirtoväylää koskevista hyppykohtaisista datansiirtonopeuksista pienimmän perusteella, ja - ohjaamaan ensimmäisen datavirran ja toisen datavirran kokonaisuuden siirtonopeus tulemaan rajoitetuksi ensimmäistä datansiirtoväylää koskevista 20 hyppykohtaisista datansiirtonopeuksista pienimmän perusteella silloin kun ^ ensimmäistä datansiirtoväylää koskevista hyppykohtaisista datansiirtono- ^ peuksista pienimmän omaava hyppy kuuluu myös toiseen datansiirto- § väylään ja toista datansiirtoväylää koskevista hyppykohtaisista datansiirtoja nopeuksista pienimmän perusteella silloin kun toista datansiirtoväylää kosii 25 kevista hyppykohtaisista datansiirtonopeuksista pienimmän omaava hyppy o kuuluu myös ensimmäiseen datansiirtoväylään. CD LOThe method of any one of claims 16-18, wherein the method: Ί0 - performing the method of any one of claims 11 to 15 to find the lowest of the hop data rates for the second data path to the other network element, - directing the network element to the other network element. limited to the lowest data rate for the second data transfer hopper, and - to control the transmission rate of the first data stream and the second data stream entity to be limited to the lowest data rate of the first data transfer hopper to the lowest data rate when the first data stream and another data bus based on the smallest of the data transfer rates of the hops, when the second data transfer bus is called by the smallest jump o of the 25 data transfer rates of the spring, also belongs to the first data transfer bus. CD LO ^ 20. Järjestelmä ensimmäisestä verkkoelementistä (101) toiseen verkkoelementtiin o w (102) johtavaa datansiirtoväylää koskevista hyppykohtaisista datansiirtonopeuksis ta pienimmän löytämiseksi, jossa järjestelmässä: 31 - ensimmäinen verkkoelementti on konfiguroitu lähettämään toiseen verkkoelementtiin ensimmäinen data, joka käsittää Ethernet Operations, Administration, and Management -viestin, - kukin datansiirtoväylälle sijoitetusta yhdestä tai useammasta kolmannesta 5 verkkoelementistä (104, 105) on konfiguroitu päivittämään ensimmäinen data hyppykohtaisista datansiirtonopeuksista siihen mennessä pienimmän ilmaisemiseksi, ja - toinen verkkoelementti on konfiguroitu vasteena sille, että ensimmäinen data on vastaanotettu toiseen verkkoelementtiin, lähettämään toinen data en- 10 simmäiseen verkkoelementtiin, joka mainittu toinen data ilmaisee hyppy kohtaisista datansiirtonopeuksista pienimmän, tunnettu siitä, että mainittu Ethernet Operations, Administration, and Management -viesti edustaa pyyntöä saada mainittu toinen data.A system for detecting a minimum of hop rates for data transfer from a first network element (101) to a second network element ow (102), wherein: - the first network element is configured to send a first data comprising the Ethernet Operations, Administration, and Management to the second network element. each of one or more of the third network elements (104, 105) disposed on the data transmission path is configured to update the first data from the hopping-specific data rates so far to indicate the lowest, and the second network element is configured to transmit the second data to the second network element To the top 10 network elements, said second data indicating the lowest hop rate per hop, characterized in that said Etherne t The Operations, Administration, and Management message represents a request to obtain said second data. 21. Patenttivaatimuksen 20 mukainen järjestelmä, jossa ensimmäinen verkkoele-15 mentti on konfiguroitu lähettämään ensimmäinen data toistuvasti toiseen verkkoelementtiin.The system of claim 20, wherein the first network element is configured to repeatedly transmit the first data to the second network element. 22. Tietokoneohjelma verkkoelementin ohjaamiseksi, joka tietokoneohjelma käsittää tietokoneella suoritettavia käskyjä ohjelmoitavan prosessorin ohjaamiseksi: - ohjaamaan verkkoelementti lähettämään ensimmäinen data johonkin muu- ^ 20 hun verkkoelementtiin verkkoelementistä kyseiseen muuhun verkkoele- ° menttiin johtavan datansiirtoväylän kautta, joka ensimmäinen data käsittää § Ethernet Operations, Administration, and Management -viestin, i O) o - muodostamaan kyseisestä muusta verkkoelementistä vastaanotetun toisen CC datan perusteella ensimmäinen raja-arvo, joka ilmaisee datansiirtoväylää O fo 25 koskevista hyppykohtaisista datansiirtonopeuksista pienimmän, ja m CVJ o - ohjaamaan verkkoelementistä kyseiseen muuhun verkkoelementtiin lähete tyn datavirran siirtonopeus tulemaan rajoitetuksi ensimmäisen raja-arvon perusteella, 32 tunnettu siitä, että mainittu Ethernet Operations, Administration, and Management -viesti edustaa pyyntöä saada mainittu toinen data.A computer program for controlling a network element, the computer program comprising computer executable instructions for controlling a programmable processor: - directing the network element to send the first data to another network element via a data transmission bus leading to the other network element, the first data comprising § Ethernet Operations, and Management message, i O) o - based on the second CC data received from said other network element, form a first limit value indicating the lowest of the hop data rates for hop data transfer bus O fo 25, and m CVJ o - direct the data stream transmitted from the network element to said other network element restricted by the first threshold, 32 characterized in that said Ethernet Operations, Administration, and Management message represents a request for a second data mentioned. 23. Tietokoneohjelmatuote, joka käsittää ei-transitorisen tietokoneluettavan välineen, johon on koodattu patenttivaatimuksen 22 mukainen tietokoneohjelma. δ CvJ CD cp o o X X Q. o CD 1^ LO CvJ δ CvJA computer program product comprising a non-transistor computer readable medium encoded by a computer program according to claim 22. δ CvJ CD cp o o X X Q. o CD 1 ^ LO CvJ δ CvJ
FI20125760A 2012-06-29 2012-06-29 Method and system for finding the minimum hop-specific data transfer rate FI124649B (en)

Priority Applications (4)

Application Number Priority Date Filing Date Title
FI20125760A FI124649B (en) 2012-06-29 2012-06-29 Method and system for finding the minimum hop-specific data transfer rate
EP13171954.4A EP2680492B1 (en) 2012-06-29 2013-06-14 A method and a system for finding smallest hop-specific data transfer speed
US13/928,768 US10097468B2 (en) 2012-06-29 2013-06-27 Method and a system for finding smallest hop-specific data transfer speed
CN201310272165.XA CN103532871B (en) 2012-06-29 2013-07-01 For the method and system for the data transfer rate specific to jump for finding minimum

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
FI20125760 2012-06-29
FI20125760A FI124649B (en) 2012-06-29 2012-06-29 Method and system for finding the minimum hop-specific data transfer rate

Publications (2)

Publication Number Publication Date
FI20125760A FI20125760A (en) 2013-12-30
FI124649B true FI124649B (en) 2014-11-28

Family

ID=48625863

Family Applications (1)

Application Number Title Priority Date Filing Date
FI20125760A FI124649B (en) 2012-06-29 2012-06-29 Method and system for finding the minimum hop-specific data transfer rate

Country Status (4)

Country Link
US (1) US10097468B2 (en)
EP (1) EP2680492B1 (en)
CN (1) CN103532871B (en)
FI (1) FI124649B (en)

Family Cites Families (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5367517A (en) * 1992-12-16 1994-11-22 International Business Machines Corporation Method and system of requesting resources in a packet-switched network with minimal latency
CN1759577A (en) * 2003-01-10 2006-04-12 松下电器产业株式会社 Method for transmitting data stream via wireless medium across a wireless network and a wireless network
US8045475B2 (en) 2003-11-10 2011-10-25 Nortel Networks Limited Method and apparatus for providing availability metrics for measurement and management of ethernet services
US20050157646A1 (en) 2004-01-16 2005-07-21 Nokia Corporation System and method of network congestion control by UDP source throttling
CA2648197A1 (en) * 2006-03-31 2007-10-11 Gridpoint Systems Inc. Smart ethernet edge networking system
JP4701152B2 (en) * 2006-10-20 2011-06-15 富士通株式会社 Data relay apparatus, data relay method, and data relay program
WO2009093322A1 (en) * 2008-01-24 2009-07-30 Mitsubishi Electric Corporation Band-guarantee communication system
US8305899B2 (en) 2008-05-28 2012-11-06 Microsoft Corporation Pull-based data transmission approach
AU2009347050B2 (en) * 2009-05-29 2014-07-17 Telefonaktiebolaget Lm Ericsson (Publ) Failure localisation in a MPLS-TP network
US9167477B2 (en) 2010-04-15 2015-10-20 Nec Corporation Transmission device, transmission method and computer program
CN102918814B (en) * 2010-05-28 2016-06-29 日本电气株式会社 Transmission equipment and band width control method
JP5722705B2 (en) * 2011-05-26 2015-05-27 富士通株式会社 Transmission apparatus, transmission method, and transmission program

Also Published As

Publication number Publication date
US20140003235A1 (en) 2014-01-02
US10097468B2 (en) 2018-10-09
CN103532871A (en) 2014-01-22
FI20125760A (en) 2013-12-30
CN103532871B (en) 2018-03-30
EP2680492A1 (en) 2014-01-01
EP2680492B1 (en) 2020-02-12

Similar Documents

Publication Publication Date Title
US10673741B2 (en) Control device discovery in networks having separate control and forwarding devices
US10097469B2 (en) Network traffic shaping for low power and lossy networks
KR102071439B1 (en) Method and network node for obtaining the target transmission path
US7978682B2 (en) Methods, systems, and computer-readable media for optimizing the communication of data packets in a data network
US8862774B2 (en) Dynamic keepalive parameters for reverse path validation in computer networks
US9485181B2 (en) Dynamic bandwidth adjustment in packet transport network
US11108678B2 (en) Inspired path computation in a network
WO2010090311A1 (en) Path control system, path control device, communication device, path control method, and program
RU2509447C2 (en) Method of reporting throughput information, service processing method, network node and communication system
CN109314676B (en) Method for distributing and aggregating resource data in network domain
EP2869506B1 (en) Congestion avoidance and fairness in data networks with multiple traffic sources
KR20140088206A (en) Service assurance using network measurement triggers
US8897295B2 (en) Method and system for providing traffic engineering interworking
CN105515998A (en) Method for communicating third-level domain and second-level domain in software-defined packet transport network (SPTN) domain and system
WO2022194023A1 (en) Packet processing method, network device, and controller
CN110663223A (en) Determining quality of service for network tunnels
JPWO2010106941A1 (en) Network communication system, communication apparatus, network cooperation method and program
Mliki et al. A comprehensive survey on carrier ethernet congestion management mechanism
Medhi QoS routing computation with path caching: a framework and network performance
CN114095448A (en) Method and equipment for processing congestion flow
FI124649B (en) Method and system for finding the minimum hop-specific data transfer rate
Siddiqi et al. Improving network convergence time and network stability of an OSPF-routed IP network
Moravejosharieh et al. Bandwidth reservation approach to improve quality of service in software-defined networking: A performance analysis
Hasan et al. Development of performance of OSPF network by using SDN concepts
Nakayama Rate-based path selection for shortest path bridging in access networks

Legal Events

Date Code Title Description
FG Patent granted

Ref document number: 124649

Country of ref document: FI

Kind code of ref document: B

PC Transfer of assignment of patent

Owner name: CORIANT OY

MM Patent lapsed