EP1784957A1 - Procede et dispositif pour optimiser l'utilisation d'un reseau de communication - Google Patents

Procede et dispositif pour optimiser l'utilisation d'un reseau de communication

Info

Publication number
EP1784957A1
EP1784957A1 EP05774138A EP05774138A EP1784957A1 EP 1784957 A1 EP1784957 A1 EP 1784957A1 EP 05774138 A EP05774138 A EP 05774138A EP 05774138 A EP05774138 A EP 05774138A EP 1784957 A1 EP1784957 A1 EP 1784957A1
Authority
EP
European Patent Office
Prior art keywords
traffic
admission
quality
probability
determined
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
Application number
EP05774138A
Other languages
German (de)
English (en)
Inventor
Joachim Charzinski
Uwe Walter
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Nokia Solutions and Networks GmbH and Co KG
Original Assignee
Siemens AG
Nokia Siemens Networks GmbH and Co KG
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 AG, Nokia Siemens Networks GmbH and Co KG filed Critical Siemens AG
Publication of EP1784957A1 publication Critical patent/EP1784957A1/fr
Withdrawn legal-status Critical Current

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/70—Admission control; Resource allocation
    • H04L47/82—Miscellaneous aspects
    • H04L47/822—Collecting or measuring resource availability data
    • 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/15—Flow control; Congestion control in relation to multipoint 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
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H04L47/80—Actions related to the user profile or the type of traffic
    • H04L47/805—QOS or priority aware

Definitions

  • the invention relates to a method for determining an admission threshold optimized in terms of traffic transmission in a communication network with access restriction and a device having means for carrying out such a method.
  • bandwidths reserved for a traffic transmission are higher than the capacity actually utilized by the traffic.
  • a peak or upper bound is usually specified that is not or only briefly reached by the transported traffic.
  • the occupancy of the network with traffic is generally lower than the number of reservations that have been added up.
  • more traffic is therefore often permitted for transmission over the network, as it would be possible in the conservative approach of not allowing the overall reservations to exceed the available bandwidth.
  • the overbooking factor which is the ratio of the aggregated bandwidth or capacity reservation to the total available capacity, is used as a measure of the overrun. In the conservative approach, this factor would be at most one.
  • MBAC measurement-based admission control
  • EBAC Experience Based Admission Control
  • the object is achieved by a method according to claim 1 and a device having means for carrying out this method according to claim 9.
  • the probability that traffic is not permitted should be minimized as far as possible.
  • the least possible traffic or packets should be affected by violation of the quality of service characteristics to be maintained (for example delay times, loss rate, etc.).
  • the optimization according to the invention consists of determining and weighting the blocking probability as a function of the admission threshold used for the admission of traffic and also of determining and also weighting the probability of violation of at least one quality of service feature in the transmission of traffic also depending on the admission threshold , Based on these weighted quantities, the optimal approval threshold or optimum limit for the authorized traffic is then determined.
  • Determination can be carried out, for example, in the form of a minimum search of a curve given by addition of the two weighted probabilities.
  • the inventive method provides a systematic approach for the optimization of network utilization. This can take place, for example, according to business criteria, so that an optimized operating point of the network is given by the optimized admission threshold.
  • the method according to the invention can obviously be extended to different traffic classes and / or different types of quality-of-service violations.
  • the traffic class or quality-of-service violation is assigned its own weighting and the sum of the weighted probabilities is determined as a function of the admission threshold (s).
  • the admission threshold s
  • the method according to the invention has a high degree of flexibility for adaptation to diverse network conditions or network operator preferences.
  • Weighting can be carried out by means of a weighting value or, more flexibly, by means of a weighting function.
  • a trivial weighting is to set the weights equal to each other, i. practically
  • the weighting can also be used to efficiently differentiate between different situations. For example, different types of quality of service violations can be weighted differently.
  • the weighting can be used to introduce boundary conditions in the optimization for non-compliance with a quality-of-service feature or also (in practice of lesser relevance) for the blocking probability.
  • One then calculates the so-called 1% quantile, ie the value in the event space to which a value of 1% of the distribution function is assigned. In this case, the maximum approval threshold or overbooking for which the probability that on average 5% of the packets violate the quality of service is ⁇ or 1%.
  • the method can also be used to automatically set the optimal traffic load of the network by regularly determining the optimal admission threshold and automatically adjusting the access restriction of the communication network accordingly.
  • the method is applied to interference scenarios of the communication network.
  • an optimal approval threshold for interference scenarios ie network topologies, in which one or more failures have been taken into account can be determined. These results can then be used to provide redundant capacity to intercept failures.
  • the limits for the access restriction are set in such a way that, in the event of a disruptive scenario, operation of the network is possible at the optimum operating point or optimal admission threshold determined for this case.
  • the subject of the invention also comprises a device with means for carrying out a method according to the invention.
  • a device may e.g. be given by a server for controlling the access restriction of the communication network, by a network management system or a Divêtungssys ⁇ tem.
  • a server for controlling the access restriction or a so-called network control server one would have a realization on an independent platform which can communicate with control authorities for admission control, routers and network management. Since each network has a network management system, it is also appropriate to localize the functionality for carrying out a method according to the invention there.
  • a service control which normally performs service-specific functions such as, for example, the discovery of a called telephone subscriber.
  • Fig. 1 Principle relationship between Zumiks ⁇ threshold, blocking probability and Wahr ⁇ probability for a quality of service violation.
  • FIG. 2 shows a surface for an operator with inventive means for determining an optimal overbooking and for setting the overbuffering factor.
  • the solid line from FIG. 1 shows the probability of blocking
  • the dashed line the probability of a violation of the quality of service or of the so-called quadrant.
  • lity of service QOS
  • Both quantities are shown as a function of the approval threshold or the limit for the approval control. If the admission threshold approaches zero, the chances of being blocked or not being granted are very high, there is no risk of a quality-of-service violation. If the admission threshold is very high, the probability of non-compliance with a quality-of-service feature increases significantly. On the other hand, virtually all traffic can be served, so that the blocking probability at the edge of the network drops to zero.
  • the optimum is determined, which in the given case corresponds to the determination of the minimum of the addition of both curves.
  • This value must be set to the admission threshold for optimum utilization of the network with regard to the two criteria, blocking and quality-of-service violation.
  • FIG. 2 shows a surface for setting the overbuffering factor.
  • the curves do not show probabilities, but costs, i. E. the probabilities have been changed, e.g. weighted by economic criteria.
  • the solid line shows the costs for the blocking or non-admission of traffic, the dotted line those for the violation of Divü- te.
  • the minimum indicates the optimal overbooking factor.
  • a bar by means of which the overbooking factor can be set manually. An operator can generate this interface on his control computer from his operating station and, for example, readjust the overburden factor corresponding to the displayed minimum by means of a mouse click and moving the marking on the bar.

Abstract

L'invention concerne un procédé et un dispositif pour déterminer un seuil d'autorisation optimisé pour la transmission du trafic dans un réseau de communication à limitation d'accès. Selon l'invention, la probabilité d'une non-autorisation de trafic est déterminée et pondérée en fonction du seuil d'autorisation. La probabilité du non-respect d'au moins une caractéristique de qualité de service lors de la transmission du trafic est également déterminée et pondérée en fonction du seuil d'autorisation. Le seuil d'autorisation optimal pour le trafic est ensuite déterminé en fonction des probabilités pondérées.
EP05774138A 2004-08-24 2005-08-17 Procede et dispositif pour optimiser l'utilisation d'un reseau de communication Withdrawn EP1784957A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
DE102004041013A DE102004041013B3 (de) 2004-08-24 2004-08-24 Verfahren und Vorrichtung zur Optimierung der Auslastung eines Kommunikationsnetzes
PCT/EP2005/054037 WO2006021535A1 (fr) 2004-08-24 2005-08-17 Procede et dispositif pour optimiser l'utilisation d'un reseau de communication

Publications (1)

Publication Number Publication Date
EP1784957A1 true EP1784957A1 (fr) 2007-05-16

Family

ID=35004242

Family Applications (1)

Application Number Title Priority Date Filing Date
EP05774138A Withdrawn EP1784957A1 (fr) 2004-08-24 2005-08-17 Procede et dispositif pour optimiser l'utilisation d'un reseau de communication

Country Status (5)

Country Link
US (1) US20080019375A1 (fr)
EP (1) EP1784957A1 (fr)
CN (1) CN101048983A (fr)
DE (1) DE102004041013B3 (fr)
WO (1) WO2006021535A1 (fr)

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8224384B2 (en) * 2006-02-27 2012-07-17 Genband Us Llc Methods, systems, and computer program products for oversubscription of wireless media gateway resources
US7760643B2 (en) * 2007-04-09 2010-07-20 Telcordia Technologies, Inc. Automatic policy change management scheme for DiffServ-enabled MPLS networks
US7990856B2 (en) * 2008-10-29 2011-08-02 Verizon Patent And Licensing Inc. Method and apparatus for reflecting forwarding plane utilization in control plane
US9424429B1 (en) * 2013-11-18 2016-08-23 Amazon Technologies, Inc. Account management services for load balancers

Family Cites Families (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6144639A (en) * 1996-09-03 2000-11-07 Sbc Technology Resources, Inc. Apparatus and method for congestion control in high speed networks
US6067287A (en) * 1997-09-15 2000-05-23 Accton Technology Neural fuzzy connection admission controller and method in a node of an asynchronous transfer mode (ATM) communication network
US6633544B1 (en) * 1998-06-24 2003-10-14 At&T Corp. Efficient precomputation of quality-of-service routes
US6385172B1 (en) * 1999-03-19 2002-05-07 Lucent Technologies Inc. Administrative weight assignment for enhanced network operation
US6647413B1 (en) * 1999-05-28 2003-11-11 Extreme Networks Method and apparatus for measuring performance in packet-switched networks
US20020191247A1 (en) * 2001-04-30 2002-12-19 Xiang Lu Fast restoration in optical mesh network
US6917812B2 (en) * 2001-12-03 2005-07-12 Telefonaktiebolaget Lm Ericsson (Publ) Air interface scheduler for wireless communication networks
KR100446516B1 (ko) * 2002-04-24 2004-09-04 삼성전자주식회사 패킷 교환망에서의 트래픽 감시 방법
DE10301966B4 (de) * 2003-01-20 2005-06-16 Siemens Ag Verfahren zur Bestimmung von Grenzen für eine Verkehrskontrolle in Kommunikationsnetzen mit Zugangskontrolle

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See references of WO2006021535A1 *

Also Published As

Publication number Publication date
US20080019375A1 (en) 2008-01-24
CN101048983A (zh) 2007-10-03
DE102004041013B3 (de) 2006-04-13
WO2006021535A1 (fr) 2006-03-02

Similar Documents

Publication Publication Date Title
EP1820308B1 (fr) Procede et dispositif de redefinition automatique de limites pour des controles d'acces en vue de restreindre le trafic dans un reseau de communication
DE602004005604T2 (de) Verfahren zur dienstqualitätsdifferenzierung in paketmodus-mobilkommunikationsnetzen
DE102006041058B4 (de) Verfahren zur Nachführung von Netzparametern
DE60306723T2 (de) Warteschlangensystem für Diffserv Router mit mehreren Betriebsmodi
EP1428361B1 (fr) Limitation de trafic pour reseau avec transmission a bon niveau de qualite de service
EP1451980A1 (fr) Procede de transmission de donnees d'application avec une qualite differente
DE60124324T2 (de) Verfahren und vorrichtung zum dienstequalitätsbasierten dimensionieren der kapazität einer zelle
DE10357582A1 (de) Klassenbasierte Ratensteuerung unter Verwendung eines Leaky Bucket mit einer Vielzahl von Grenzwerten
EP1908234B1 (fr) Procede de controle de ressources dans des elements d'un reseau de telecommunication
DE102007016062A1 (de) Netzwerksystem mit dynamischer Steuerung des Datenflusses, und zugehöriges Verfahren
WO2006021535A1 (fr) Procede et dispositif pour optimiser l'utilisation d'un reseau de communication
DE102004001008B3 (de) Verfahren zur Bestimmung von Grenzwerten für eine Verkehrskontrolle in Kommunikationsnetzen mit Zugangskontrolle
WO2003088592A1 (fr) Procede pour le controle commun des largeurs de bande d'un groupe de flux d'informations individuels
EP1794947B1 (fr) Poursuite automatique de parametres de reseau en cas de modifications de la charge de trafic
DE60110892T2 (de) Adaptives Verfahren zur Schwellwertbestimmung für den verschiedenartigen Zugriff auf Netzressourcen
EP1586179A1 (fr) Procede pour fixer des limites afin de restreindre le trafic dans des reseaux de communication au moyen d'un controle d'acces
DE60207757T2 (de) Verfahren und vorrichtung zur verwaltung von guthaben für den zugang zu information in einem telekommunikationsnetzwerk
WO2007113109A1 (fr) Commande d'accès réseau avec catégorie de trafic supplémentaire dans un réseau de communication
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
EP1470678A2 (fr) Procede de commande d'acces a un reseau de communication
DE10315066B4 (de) Verfahren zur Steuerung der Übertragung von Daten
DE10220213B4 (de) Verfahren zur Übertragung von Daten
DE102004038475A1 (de) Verfahren und System zur Zugangskontrolle für einen Datenstrom zu einem klassenbasierten paketvermittelnden Netzwerk
DE10216283A1 (de) Verfahren zu gemeinsamen Kontrolle der Bandbreiten einer Gruppe von einzelnen Informationsflüssen
DE102005039338A1 (de) Kommunikationsnetzwerk, Kommunikationsrechner und Verfahren zum Betreiben eines Kommunikationsnetzwerks

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: 20070326

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 HU IE IS IT LI LT LU LV MC NL PL PT RO SE SI SK TR

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.

DAX Request for extension of the european patent (deleted)
RAP3 Party data changed (applicant data changed or rights of an application transferred)

Owner name: NOKIA SIEMENS NETWORKS GMBH & CO. KG

17Q First examination report despatched

Effective date: 20101216

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: 20110301