EP1428360A1 - Method for selecting useful routes in a router for even traffic distribution in a communication network - Google Patents
Method for selecting useful routes in a router for even traffic distribution in a communication networkInfo
- Publication number
- EP1428360A1 EP1428360A1 EP02776690A EP02776690A EP1428360A1 EP 1428360 A1 EP1428360 A1 EP 1428360A1 EP 02776690 A EP02776690 A EP 02776690A EP 02776690 A EP02776690 A EP 02776690A EP 1428360 A1 EP1428360 A1 EP 1428360A1
- Authority
- EP
- European Patent Office
- Prior art keywords
- routes
- router
- communication network
- network
- criteria
- Prior art date
- Legal status (The legal status 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 status listed.)
- Withdrawn
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/2425—Traffic characterised by specific attributes, e.g. priority or QoS for supporting services specification, e.g. SLA
- H04L47/2433—Allocation of priorities to traffic types
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/54—Store-and-forward switching systems
- H04L12/56—Packet switching systems
- H04L12/5601—Transfer mode dependent, e.g. ATM
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/302—Route determination based on requested QoS
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/12—Avoiding congestion; Recovering from congestion
- H04L47/125—Avoiding congestion; Recovering from congestion by balancing the load, e.g. traffic engineering
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/54—Store-and-forward switching systems
- H04L12/56—Packet switching systems
- H04L12/5601—Transfer mode dependent, e.g. ATM
- H04L2012/5619—Network Node Interface, e.g. tandem connections, transit switching
- H04L2012/562—Routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/54—Store-and-forward switching systems
- H04L12/56—Packet switching systems
- H04L12/5601—Transfer mode dependent, e.g. ATM
- H04L2012/5629—Admission control
- H04L2012/5631—Resource management and allocation
- H04L2012/5632—Bandwidth allocation
Definitions
- the invention relates to a method according to the preamble of claim 1.
- QoS - also called quality of service - is defined differently depending on the context and subsequently evaluated with different metrics.
- metrics for measuring quality of service are the number of information transmitted (bandwidth), the number of information not transmitted (loss rate), the - possibly averaged - time delay in the transmission (delay), the - possibly averaged - deviation from the otherwise usual distance between two information transmissions (delay jitter), or the number of information not allowed for transmission at all (blocking rate).
- Line-oriented voice networks are designed for the transmission of continuously flowing (voice) information (conversation, call or session). This information is usually transmitted with a high quality of service. For example, a minimal delay (delay, for example ⁇ 200 ms) without fluctuations in the delay time (delay jitter) is important for speech, since speech requires a continuous flow of information in the receiving device. A loss of information cannot therefore be compensated for by retransmitting the non-transmitted information and usually leads to one in the receiving device acoustically perceptible crackling.
- the transmission of speech is also generally referred to as a 'real-time (transmission) service' or as a 'real-time service'.
- the quality of service is achieved by appropriate dimensioning and planning of the voice networks, whereby the transmission capacity is not subject to fluctuations even due to the line orientation.
- Packet-oriented data networks are designed for the transmission of data packet streams or packet streams.
- no high quality of service has to be guaranteed.
- the data packet streams are transmitted e.g. with delays fluctuating over time, since the individual data packets of the data packet streams are usually transmitted in the order of their network access, i.e. The more delays are to be transmitted from a data network, the greater the time delays (non-realtime service).
- the best known data network at the moment is the Internet.
- the Internet is designed as an open (wide area) data network with open interfaces for connecting (mostly local and regional) data networks from different manufacturers. So far, the main focus has been on providing a manufacturer-independent transport platform. Adequate mechanisms to guarantee quality of service play a secondary role.
- ATM networks are suitable for securing service quality (QoS) in data networks.
- QoS service quality
- ATM is a connection-oriented technology. All cells (packets) of a connection (VP, VC) follow the same path.
- VP connection-oriented technology
- VC connection-oriented technology
- the Internet uses the principle of 'routes'.
- the routes implicitly determine which route the data packets of a communication relationship (flow) should take through the network.
- the router autonomous and individually selects a route that it enters in its routing tables and then uses for all subsequent data packets of this flow.
- These routes can (for the purpose of increasing the available bandwidth) comprise several physical lines (links), but as a rule all of these links (with the same 'length' or delay) end at the same neighboring node.
- This principle is intended to ensure that the packet sequences are not swapped, since many TCP applications are very sensitive to swapping due to the lack of implemented resequencing mechanisms. However, this does not distribute the traffic evenly across all nodes.
- Distribution of the incoming traffic to an outgoing bundle with priorities (advance distribution of the traffic into individual priority queues per port, multi-server principle with one queue per priority class).
- a pointer for identifying the respective data packet is stored in a usually common data memory.
- the order of operation results implicitly from the order of the entries in the queue (e.g. according to the FIFO principle) or from the upstream procedure for selecting the queue to be operated next (e.g. according to priority and with the same priority cyclically or longest (or short-est) queue first, after weighting (WFQ), ).
- the object of the invention is now to provide a method of how the traffic in the network nodes of a communication network operating without a connection can be distributed as optimally as possible to the outgoing connecting lines.
- the advantage of the invention is a simple and economically efficient solution to be implemented.
- the network nodes act independently on the basis of predefined rules and information flowing to them. In particular, they are able to independently dynamically determine the required branching pattern and any distribution criteria to be applied.
- routing protocols are exchanged in the communication network between all routers, which contain information regarding the network configuration.
- an assignment of the destination addresses to possible physical routes via which the data packets reach the destination is determined locally in each router. From these possible paths, a selection is then made in accordance with quality criteria and stored in a router's own database.
- the quality criteria can be criteria relating to the quality of service, criteria relating to route information or cost criteria. In any case, loops must be avoided.
- the criteria should be selected in such a way that the conventional Internet protocol methods (best effort, shortest path) are also possible.
- a communication network K which is formed from a plurality of routers meshed with one another.
- the routers are divided into edge routers ER or core routers CR, depending on whether they are arranged at the edge of or within the communication network.
- each router receives knowledge of the network configuration by exchanging routing protocols with all other routers. This is the preferred solution, since in this case the network operator does not have to do any additional effort when inserting a new router into the network.
- each router could also receive the network configuration via a higher-level control device. This means that each of the routers has a current image of the currently valid network configuration. The addition or removal of routers (failure) will therefore be stored in all databases of the router in question after a certain settling time.
- each router can take a data packet to the actual destination when leaving the router CR.
- these are routes 1, 2, 3, 4, 5 for the (core) router CR. This means that physically possible routes are assigned to the destination address.
- Not all physically possible routes are also e.g. B. useful to guarantee the quality of service. According to the figure, this applies, for example, to paths 1, 4, 5 to the edge routers ER X , ER 2 , ER 3 .
- a selection is made from the physically possible routes.
- criteria relating to the quality of service should be used as a criterion. This can include, for example, the criterion that the delay time for the transmission (delay) in the communication network K should be as short as possible. In this case, paths 2, 3 are taken into account in this selection.
- paths to the edge routers can generally be excluded on the net.
- a path can be selected which, in the past, statistically has the best behavior with regard to the number of information transmitted (bandwidth), the number of data not transmitted
- loss rate that has - possibly averaged - deviation from the otherwise usual interval between two information transmissions (delay jitter), or the number of information not even permitted to be transmitted (blocking rate).
- Cost criteria can be used as further selection criteria. If services are chosen for which the delay time is less important than the cost aspect, the routes that ensure these lower costs must be selected.
- the solution serves every data packet with the minimum possible delay (as long as an abort of already started operations / packet transfers is excluded) and thus enables the best possible quality, for example for interactive real-time applications.
- the use of an additional 'timestamp' when buffering (queuing) the data packets can be implemented both in SW and in HW with simple means and with relatively little additional effort. Since this mechanism is only relevant locally, there are no problems with network use, not even in 'mixed' networks. The same applies to the alternatives and variants mentioned and shown.
- Both the 'preferred' solution based on the basic principle and the (simpler) alternative specified for it aim to distribute traffic as evenly as possible, taking appropriate prioritization into account.
- the variants shown show how a desired 'skewed' distribution can also be achieved with or without a delay criterion.
- the proposed adaptive readjustment irrespective of whether it is controlled locally in the node or by a higher-level entity, enables idealized traffic distribution according to predetermined target values (even or 'skewed') even if there are interferences between one another (only) partially overlapping the individual distributions in the individual bundles lead to disturbances of the desired balance (the system 'adjusts itself').
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
Description
Claims
Applications Claiming Priority (5)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
DE10146349 | 2001-09-20 | ||
DE10146349 | 2001-09-20 | ||
DE10161547 | 2001-12-14 | ||
DE10161547 | 2001-12-14 | ||
PCT/DE2002/003537 WO2003026228A1 (en) | 2001-09-20 | 2002-09-20 | Method for selecting useful routes in a router for even traffic distribution in a communication network |
Publications (1)
Publication Number | Publication Date |
---|---|
EP1428360A1 true EP1428360A1 (en) | 2004-06-16 |
Family
ID=26010190
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
EP02776690A Withdrawn EP1428360A1 (en) | 2001-09-20 | 2002-09-20 | Method for selecting useful routes in a router for even traffic distribution in a communication network |
Country Status (7)
Country | Link |
---|---|
US (2) | US20050243797A1 (en) |
EP (1) | EP1428360A1 (en) |
AU (1) | AU2002339307B2 (en) |
BR (1) | BR0206043A (en) |
CA (1) | CA2460993A1 (en) |
RU (1) | RU2004111798A (en) |
WO (1) | WO2003026228A1 (en) |
Families Citing this family (11)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
DE10324370B4 (en) * | 2003-05-28 | 2009-04-23 | Nokia Siemens Networks Gmbh & Co.Kg | Network node of a packet-switched communication network and method for traffic distribution of data traffic in a packet-switched communication network |
US7272496B2 (en) * | 2003-06-12 | 2007-09-18 | Temic Automotive Of North America, Inc. | Vehicle network and method of communicating data packets in a vehicle network |
JP4320734B2 (en) * | 2004-09-07 | 2009-08-26 | 横河電機株式会社 | Mobile communication system |
ATE459045T1 (en) * | 2006-06-13 | 2010-03-15 | British Telecomm | PEER-TO-PEER QUALITY OF SERVICE REPUTATION REPORTING SYSTEM |
US8244857B2 (en) * | 2006-06-13 | 2012-08-14 | British Telecommunications Plc | Computer network |
US20080288654A1 (en) * | 2007-05-17 | 2008-11-20 | Nokia Corporation | Node and method to provide and keep real-time up-to-date data in a distributed hash table |
US9473398B2 (en) | 2013-10-23 | 2016-10-18 | International Business Machines Corporation | Devolved routing in software-defined networks |
RU2573267C2 (en) * | 2014-05-19 | 2016-01-20 | Государственное казенное образовательное учреждение высшего профессионального образования Академия Федеральной службы охраны Российской Федерации (Академия ФСО России) | Method for comparative evaluation of information computer network structures |
RU2622842C1 (en) * | 2016-05-23 | 2017-06-20 | федеральное государственное казенное военное образовательное учреждение высшего образования "Военная академия связи имени Маршала Советского Союза С.М. Буденного" Министерства обороны Российской Федерации | Method for masking the structure of telecommunication network |
RU2645292C2 (en) * | 2016-06-21 | 2018-02-19 | федеральное государственное казенное военное образовательное учреждение высшего образования "Краснодарское высшее военное училище имени генерала армии С.М. Штеменко" Министерства обороны Российской Федерации | Method for masking structure of telecommunication network |
RU2626099C1 (en) * | 2016-11-21 | 2017-07-21 | федеральное государственное казенное военное образовательное учреждение высшего образования "Краснодарское высшее военное училище имени генерала армии С.М. Штеменко" Министерства обороны Российской Федерации | Method of comparative estimation of communication network structures |
Family Cites Families (8)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6130889A (en) * | 1996-10-02 | 2000-10-10 | International Business Machines Corporation | Determining and maintaining hop-count for switched networks |
US6069895A (en) * | 1997-08-29 | 2000-05-30 | Nortel Networks Corporation | Distributed route server |
JP3645734B2 (en) * | 1999-02-24 | 2005-05-11 | 株式会社日立製作所 | Network relay device and network relay method |
DE19923245A1 (en) * | 1999-05-20 | 2000-11-23 | Siemens Ag | Route selection method especially for ATM |
US6366577B1 (en) * | 1999-11-05 | 2002-04-02 | Mci Worldcom, Inc. | Method for providing IP telephony with QoS using end-to-end RSVP signaling |
WO2001058084A2 (en) * | 2000-02-04 | 2001-08-09 | Hrl Laboratories, Llc | System and method for pricing-based quality of service |
EP1133112B1 (en) * | 2000-03-10 | 2005-02-09 | Siemens Aktiengesellschaft | Method for balancing the data transfer load of a communication network and corresponding communication network |
JP3501093B2 (en) * | 2000-04-18 | 2004-02-23 | 日本電気株式会社 | QoS path calculator |
-
2002
- 2002-09-20 BR BR0206043-4A patent/BR0206043A/en not_active IP Right Cessation
- 2002-09-20 US US10/432,040 patent/US20050243797A1/en not_active Abandoned
- 2002-09-20 EP EP02776690A patent/EP1428360A1/en not_active Withdrawn
- 2002-09-20 RU RU2004111798/09A patent/RU2004111798A/en not_active Application Discontinuation
- 2002-09-20 WO PCT/DE2002/003537 patent/WO2003026228A1/en not_active Application Discontinuation
- 2002-09-20 AU AU2002339307A patent/AU2002339307B2/en not_active Ceased
- 2002-09-20 CA CA002460993A patent/CA2460993A1/en not_active Abandoned
-
2008
- 2008-01-07 US US11/970,205 patent/US20080101245A1/en not_active Abandoned
Non-Patent Citations (1)
Title |
---|
See references of WO03026228A1 * |
Also Published As
Publication number | Publication date |
---|---|
WO2003026228A1 (en) | 2003-03-27 |
AU2002339307B2 (en) | 2005-03-17 |
CA2460993A1 (en) | 2003-03-27 |
BR0206043A (en) | 2003-11-11 |
US20080101245A1 (en) | 2008-05-01 |
US20050243797A1 (en) | 2005-11-03 |
RU2004111798A (en) | 2005-05-10 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
EP1593241B1 (en) | Access control for a packet-oriented network, taking into account resilience requirements | |
DE69728630T2 (en) | Process and system for increasing the service quality at or below a limit tariff | |
EP1133112B1 (en) | Method for balancing the data transfer load of a communication network and corresponding communication network | |
EP1529384B1 (en) | Access control for packet-oriented networks | |
DE60132437T2 (en) | METHOD AND DEVICE FOR CONTROLLING INFORMATION USING CALENDARS | |
EP1428361B1 (en) | Traffic restriction for a network with qos transmission | |
DE60208955T2 (en) | Bandwidth warranty system, relay device, and network management server | |
EP1433352B1 (en) | Distributed transmission of traffic flows in communication networks | |
EP1428360A1 (en) | Method for selecting useful routes in a router for even traffic distribution in a communication network | |
DE69431859T2 (en) | Burst server switching system and method | |
EP1249154B1 (en) | Method and device for controlling access to a communications network | |
DE60037317T2 (en) | Method for sharing excess bandwidth between output and input modules of a switching network | |
EP1529385B1 (en) | Access control for packet-oriented networks | |
DE602004013247T2 (en) | Method and apparatus for priority planning with request / approval | |
EP1266496B1 (en) | Method and arrangement for checking whether the use of a service is permissible | |
EP0998093B1 (en) | Method to transmit reverse channel data on a connection between a terminal and a server in a packet switched network | |
DE10357522A1 (en) | Data transmission method and network | |
WO2002041583A2 (en) | Method for selecting communication networks by means of dynamically adjustable selection criteria for controlling a link set up between two terminals | |
WO2002045342A2 (en) | Unit for distributing and processing data packets | |
WO2005122477A1 (en) | Method for the broadband transmission, complementary to xdsl technology, of return channel data in a connection between a server of a packet switching network and a terminal thereon | |
EP1586180A2 (en) | Traffic restriction in packet-oriented networks by means of link-dependent limiting values for the traffic passing the network boundaries | |
WO2000069210A2 (en) | Method for evaluating routes in a communications network | |
EP1062835A1 (en) | Tm- | |
DE10148893A1 (en) | Method for transmitting streams of traffic in a connectionless packet-oriented communications network uses transmission nodes interconnected so as to create multiple paths between the nodes. | |
DE10133649A1 (en) | Estimation of the transmission quality in a packet-oriented network, method and system for data transmission in a packet-oriented network |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PUAI | Public reference made under article 153(3) epc to a published international application that has entered the european phase |
Free format text: ORIGINAL CODE: 0009012 |
|
17P | Request for examination filed |
Effective date: 20030508 |
|
AK | Designated contracting states |
Kind code of ref document: A1 Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR IE IT LI LU MC NL PT SE SK TR |
|
AX | Request for extension of the european patent |
Extension state: AL LT LV MK RO SI |
|
RAP1 | Party data changed (applicant data changed or rights of an application transferred) |
Owner name: NOKIA SIEMENS NETWORKS GMBH & CO. KG |
|
RAP3 | Party data changed (applicant data changed or rights of an application transferred) |
Owner name: NOKIA SIEMENS NETWORKS S.P.A. |
|
17Q | First examination report despatched |
Effective date: 20071109 |
|
RAP3 | Party data changed (applicant data changed or rights of an application transferred) |
Owner name: NOKIA SIEMENS NETWORKS GMBH & CO. KG |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: THE APPLICATION IS DEEMED TO BE WITHDRAWN |
|
18D | Application deemed to be withdrawn |
Effective date: 20080320 |