WO2004066566A1 - Verfahren zur bestimmung von grenzen für eine verkehrskontrolle in kommunikationsnetzen mit zugangskontrolle. - Google Patents
Verfahren zur bestimmung von grenzen für eine verkehrskontrolle in kommunikationsnetzen mit zugangskontrolle. Download PDFInfo
- Publication number
- WO2004066566A1 WO2004066566A1 PCT/EP2004/000213 EP2004000213W WO2004066566A1 WO 2004066566 A1 WO2004066566 A1 WO 2004066566A1 EP 2004000213 W EP2004000213 W EP 2004000213W WO 2004066566 A1 WO2004066566 A1 WO 2004066566A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- traffic
- network
- pairs
- limit values
- overload situation
- Prior art date
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/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
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/12—Avoiding congestion; Recovering from congestion
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/29—Flow control; Congestion control using a combination of thresholds
-
- 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/74—Admission control; Resource allocation measures in reaction to resource unavailability
- H04L47/746—Reaction triggered by a failure
-
- 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/83—Admission control; Resource allocation based on usage prediction
Definitions
- the invention relates to a method for a balanced setting of limit values for traffic restriction in a communication network with access controls, the communication network being formed with nodes and connection sections and at least for part of the traffic which is to be transmitted between peripheral nodes via an access control by means of a Limit value is made.
- Controlling or restricting traffic - data traffic and voice traffic - is a central problem for connectionlessly operating communication networks when traffic with high service quality requirements, e.g. Voice data should be transmitted.
- Suitable mechanisms for controlling traffic are currently being investigated by network specialists, switching technicians and Internet experts.
- IP Internet Protocol
- real-time traffic e.g. voice or video data via data networks while observing quality of service features
- IP Internet Protocol
- the transmission of so-called real-time traffic, e.g. voice or video data via data networks while observing quality of service features is a prerequisite for successful network convergence.
- IP Internet Protocol
- One possibility for real-time transmission over data networks while observing quality of service features is to set up a connection through the entire network, that is, prior to the service, determining and reserving the required operating resources or resources.
- the provision of sufficient resources to guarantee the service features is then monitored for each connection section (also referred to as the English word "link"). Technologies which operate in this way are, for example, the ATM (asynchronous transfer mode) method or that MPLS protocol
- MPLS Multiprotocol Label Switching
- dif-serv concept One method that avoids the complexity of checking or checking resources in sections is the so-called dif-serv concept. This concept is called “stateless” in English, which means that no status information about connections or flows along the transmission path has to be kept. Instead, the diff-serv concept only provides access control
- the object of the invention is to provide an optimized method for setting limit values for traffic limitation in a communication network.
- the object is achieved by a method according to claim 1.
- limit values for restricting traffic in a communication network are set.
- a communication network for example an IP network
- For data transmission via the communication network at least for part of the traffic to be transmitted - for example for one or more traffic classes - it is provided that access control is carried out before network resources are used for the transmission.
- the access control takes place at edge nodes of the communication network formed with nodes and connection sections.
- An edge node on a network of access points also known as ingress node
- a network output node also known as egress node called
- one in the communications network findiere end or start node loading of data transmission, • that is a node of the network, a source or depression in terms of traffic.
- edge node in the word edge node does not refer to the network but to the transmission path of data packets.
- the invention is based on the consideration that a balanced treatment for traffic, which is subjected to an access control before network resources are made available for the traffic, is present when the probability of non-admission or rejection of the traffic is as independent as possible from peripheral nodes (e.g. network access node and network output node) or the transmission path.
- peripheral nodes e.g. network access node and network output node
- a plurality of pairs formed by edge nodes are considered in the invention.
- a pair of edge nodes can be associated with the set of possible paths through the network that run between the two edge nodes.
- Pairs of edge nodes can consist, for example, of a network access node and a network output node, a network access node and a network node which is the recipient or addressee of transmitted data, and of a network node which functions as a transmitter and a network output node.
- the probability of non-admission of traffic or flows that are subjected to an admission test at a peripheral node can be estimated with the help of traffic models. It is assumed that the probabilities of rejecting traffic - hereinafter referred to as blocking probability - are determined using a traffic model.
- a traffic model provides, for example, values for the average traffic volume between two peripheral nodes and specifies a relationship for taking traffic fluctuations into account. For example, one can assume that traffic fluctuations obey a Poisson distribution, which can be used to estimate the probability (in our case, the blocking probability). the limit for access control is exceeded.
- the blocking probabilities and the limit values for the access control are interrelated and can usually be converted into each other.
- the blocking probabilities are set as an initialization step for a plurality of pairs formed from edge nodes by defining the limit values for the access control in such a way that they are essentially the same.
- the initial blocking probabilities are chosen large enough that there are no overload situations in the network. This definition corresponds to a fair treatment of the data streams transmitted between the peripheral nodes in that they are accepted or rejected with practically the same probability.
- this specification does not guarantee that the resources made available by the network will be used efficiently.
- the method according to the invention provides for the blocking probabilities to be reduced, ie for the approval control thresholds to be increased accordingly until an overload situation occurs.
- the blocking probabilities are lowered or the limit values for the admission control are increased in such a way that the blocking probabilities for the pairs of edge nodes remain essentially the same.
- the blocking probabilities are essentially set to the value at which the overload situation is caused by the raising of the limit values.
- the blocking probabilities are gradually reduced and the value of the blocking probabilities, and thus the value of the corresponding limit values, is then set for the pairs contributing to the overload situation to the value they had in the step immediately before the overload situation occurred.
- Limits set For the pairs that were not involved in the occurrence of the first overload situation, the blocking probability is further reduced simultaneously for all remaining pairs until a second overload situation occurs. For the pairs involved in the occurrence of the overload situation, the blocking probabilities or the limit values are essentially frozen or retained at the value that they had when the overload situation occurred or just before it occurred. This step is then iterated until limit values have been set for all pairs, i.e. the blocking probability is increased simultaneously for the remaining pairs until an overload situation occurs in which the blocking probability is recorded for the pairs involved in the overload situation until the blocking probability is determined for all pairs.
- the training leads to an assignment of blocking probabilities or limit values for all pairs, because a blocking probability of zero for a pair would mean that one could transmit an infinite amount of traffic between the edge points of the pair without causing an overload situation, which obviously not the case for real networks.
- the blocking probability or limit values for all pairs of the plurality of pairs are determined in such a way that a lowering of the blocking probability for any pair from the plurality would lead to an overload situation. In this sense is an optimal one Utilization of the resources available from the network.
- the plurality of pairs includes, for example, all pairs of network access nodes and network output nodes.
- Communication networks have physical limitations on the transmission capacity over the links or links encompassed by the network.
- the maximum transmission capacity of the individual links defines an upper limit for the traffic that can be transmitted via the respective link.
- Limits on the volume of traffic on the individual links are often set lower than the maximum physical capacity in order to have reserves on the one hand and to prevent network faults on the other. In the latter case, the resilience of a network is frequently kept in mind, ie the ability to ensure interference-free transmission even in the event of network element failures.
- the limits for the traffic on the individual links can be selected, for example, in such a way that the failure of one (or more) links does not lead to the physical limits for the capacity of the other links being exceeded, ie even if one link fails the traffic that has been subjected to an admission control can cope.
- An overload situation in the sense of the method according to the invention can then be defined by connecting to a section or a link of the network could exceed the limits set for traffic on this link.
- the communication network can be checked for the possibility of an overload situation, for example with the aid of a model for load distribution within the network.
- a simulation program is used to check whether there are links in the communication network for which a maximum traffic load within the defined limits would lead to the traffic volume permitted for the links being exceeded.
- Another, slightly modified definition would be that the limit on the traffic volume on the individual links would be exceeded with a high, predeterminable probability.
- the pairs of edge nodes that contribute to an overload situation given by exceeding a limit value for the traffic on a link would then be the ones to which one could assign paths that run over the link that causes the overload situation.
- traffic pattern is used to describe the actual (currently) traffic at the network entrance. The check for an overload situation can then be carried out by checking whether or not the traffic patterns permitted by the borders lead to an overload in view of the routing carried out in the network.
- a network formed from nodes and links is shown in the figure.
- the edge nodes Rl to RIO are identified by filled circles.
- the inner nodes are represented by open circles.
- Links are illustrated by connections between nodes.
- Various types of boundary conditions can be defined for the network, which guarantee admission control at the network edge. The kind of
- Boundary conditions can, for example, be selected depending on the topology of the network.
- the shape of the boundary conditions decide by in which blocking probabilities Ü berlastsituation in the inventive process occur. Possible boundary conditions are:
- Limit values result, with two limit values, an input limit value and an output limit value, being assigned to an edge node. For a flow that is to be transmitted from the input node Ri to the output node Rj, it would then be checked whether the node would exceed the input limit for Ri or the output limit for Rj. If this is exceeded, rejection would result.
- limit values of form 1 are assumed below.
- a traffic model is used which allows the determination of an average traffic volume between two edge nodes Ri and Rj.
- the mean traffic between two edge nodes Ri and Rj is referred to as Vij for the sake of simplicity.
- the Gij is the limit value for traffic transmitted from the input node Ri to the output node Rj.
- a flow to be transmitted from Ri to Rj is permitted if the aggregated traffic between Ri and Rj would not exceed the Gij limit. Thereby always apply j, ie ⁇ 1, .., 10 ⁇ .
- the traffic model uses the middle one Market values Vij and assumptions about the statistical fluctuations, which for example obey a Poisson distribution.
- the limit values Gij are set (low) in such a way that the blocking probabilities are the same for all pairs (Ri, Rj) and that there is also no overload situation.
- the check for an overload situation can occur, for example, by determining the traffic load of the individual links for the maximum traffic load permitted by the limit values, including routing within the network, and comparing them with the limits or capacities of the links.
- the blocking probabilities are reduced in the same percentage ratio and the limit values Gij are increased accordingly.
- a corresponding set of limit values Gij (analytical or numerical) is determined for a set of reduced, identical values of the blocking probability, which - within the framework of the traffic model - stipulate a non-admission with the reduced blocking probability for all pairs (Ri, Rj).
- a check forsupervisede.rlast follows. If there is no overload, the blocking probability is further reduced simultaneously for all communication relationships. This can be done, for example, by gradually lowering it by 10% of the initial value. In one, for example the fifth step, a bottleneck or an overload situation occurs on the
- Link L on i.e. the capacity limit on this link would be exceeded by choosing the limit in step 5.
- the pairs (R1, R2), (R2, R1), (R1, R3), (R3, R1), (R1, R4) and (R4, R1) contribute to this overload situation.
- Blocking probability set to its value in step 4. the procedure for the remaining pairs (Ri, Rj) is continued until limits Gij are set for all pairs (Ri, Rj).
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
Description
Claims
Priority Applications (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
EP04701935A EP1586179A1 (de) | 2003-01-20 | 2004-01-14 | Verfahren zur bestimmung von grenzen f r eine verkehrskontro lle in kommunikationsnetzen mit zugangskontrolle. |
US10/542,723 US7929434B2 (en) | 2003-01-20 | 2004-01-14 | Method for determining limits for controlling traffic in communication networks with access control |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
DE10301966A DE10301966B4 (de) | 2003-01-20 | 2003-01-20 | Verfahren zur Bestimmung von Grenzen für eine Verkehrskontrolle in Kommunikationsnetzen mit Zugangskontrolle |
DE10301966.9 | 2003-01-20 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2004066566A1 true WO2004066566A1 (de) | 2004-08-05 |
Family
ID=32667675
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/EP2004/000213 WO2004066566A1 (de) | 2003-01-20 | 2004-01-14 | Verfahren zur bestimmung von grenzen für eine verkehrskontrolle in kommunikationsnetzen mit zugangskontrolle. |
Country Status (5)
Country | Link |
---|---|
US (1) | US7929434B2 (de) |
EP (1) | EP1586179A1 (de) |
CN (1) | CN100499571C (de) |
DE (1) | DE10301966B4 (de) |
WO (1) | WO2004066566A1 (de) |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
GB2417852A (en) * | 2004-04-14 | 2006-03-08 | Siemens Aktiengesellschaft | Network data flow control |
EP2273730A1 (de) * | 2008-04-02 | 2011-01-12 | Alcatel Lucent | Verfahren und vorrichtung zum verarbeiten des zugangs eines benutzerendgeräts in einem festzugangsnetz |
Families Citing this family (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
DE102004041013B3 (de) * | 2004-08-24 | 2006-04-13 | Siemens Ag | Verfahren und Vorrichtung zur Optimierung der Auslastung eines Kommunikationsnetzes |
DE102004045980B3 (de) * | 2004-09-22 | 2006-05-18 | Siemens Ag | Automatische Nachführung von Netzparametern bei Veränderungen der Verkehrslast |
DE102004057496B4 (de) * | 2004-11-29 | 2006-08-24 | Siemens Ag | Verfahren und Vorrichtung zur automatischen Neueinstellung von Grenzen für Zugangskontrollen zur Beschränkung des Verkehrs in einem Kommunikationsnetz |
DE102006041058B4 (de) | 2006-09-01 | 2008-09-11 | Nokia Siemens Networks Gmbh & Co.Kg | Verfahren zur Nachführung von Netzparametern |
US8380850B1 (en) | 2011-03-22 | 2013-02-19 | Amazon Technologies, Inc. | System and method for damping overload state oscillations |
US8392558B1 (en) | 2011-03-22 | 2013-03-05 | Amazon Technologies, Inc. | System and method for determining overload state for service requests |
US8429282B1 (en) | 2011-03-22 | 2013-04-23 | Amazon Technologies, Inc. | System and method for avoiding system overload by maintaining an ideal request rate |
Citations (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2001028167A1 (en) * | 1999-10-14 | 2001-04-19 | Telefonaktiebolaget Lm Ericsson (Publ) | Link capacity sharing for throughput-blocking optimality |
Family Cites Families (9)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4872157A (en) * | 1988-03-31 | 1989-10-03 | American Telephone And Telegraph Company, At&T Bell Laboratories | Architecture and organization of a high performance metropolitan area telecommunications packet network |
US5727051A (en) * | 1995-07-14 | 1998-03-10 | Telefonaktiebolaget Lm Ericsson (Publ.) | System and method for adaptive routing on a virtual path broadband network |
EP1013131A2 (de) * | 1997-03-13 | 2000-06-28 | Urizen Ltd. | Vorrichtung und verfahren zum ausbau von kommunikationsnetzen |
US6788646B1 (en) * | 1999-10-14 | 2004-09-07 | Telefonaktiebolaget Lm Ericsson (Publ) | Link capacity sharing for throughput-blocking optimality |
US6904017B1 (en) * | 2000-05-08 | 2005-06-07 | Lucent Technologies Inc. | Method and apparatus to provide centralized call admission control and load balancing for a voice-over-IP network |
US6795445B1 (en) * | 2000-10-27 | 2004-09-21 | Nortel Networks Limited | Hierarchical bandwidth management in multiservice networks |
US6862291B2 (en) * | 2000-11-03 | 2005-03-01 | Telcordia Technologies, Inc. | Method and system for quality of service provisioning for IP virtual private networks |
US7206284B2 (en) * | 2002-11-27 | 2007-04-17 | International Business Machines Corporation | Method and apparatus for automatic congestion avoidance for differentiated service flows |
US7450845B2 (en) * | 2002-12-11 | 2008-11-11 | Nortel Networks Limited | Expandable universal network |
-
2003
- 2003-01-20 DE DE10301966A patent/DE10301966B4/de not_active Expired - Fee Related
-
2004
- 2004-01-14 US US10/542,723 patent/US7929434B2/en not_active Expired - Fee Related
- 2004-01-14 EP EP04701935A patent/EP1586179A1/de not_active Withdrawn
- 2004-01-14 CN CNB2004800024829A patent/CN100499571C/zh not_active Expired - Fee Related
- 2004-01-14 WO PCT/EP2004/000213 patent/WO2004066566A1/de active Application Filing
Patent Citations (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2001028167A1 (en) * | 1999-10-14 | 2001-04-19 | Telefonaktiebolaget Lm Ericsson (Publ) | Link capacity sharing for throughput-blocking optimality |
Non-Patent Citations (2)
Title |
---|
DE NITTO PERSONE V., GRASSI V.: "Optimal access control for integrated services wireless networks", COMPUTER COMMUNICATIONS - ELSEVIER, 25 November 1998 (1998-11-25), NETHERLANDS, pages 1559 - 1570, XP002284845, Retrieved from the Internet <URL:http://www.sciencedirect.com/science?_ob=MImg&_imagekey=B6TYP-3VHWJ36-6-3Y&_cdi=5624&_orig=search&_coverDate=11%2F25%2F1998&_sk=999789982&view=c&wchp=dGLbVlz-zSkzV&_acct=C000049880&_version=1&_userid=987766&md5=daf08459f2b4fa98cca24eba9b0760ba&ie=f.pdf> [retrieved on 20040616] * |
RANDHAWA T S ET AL: "PERFORMANCE EVALUATION OF BANDWIDTH PARTITIONING IN BROADBAND NETWORKS", PROCEEDINGS OF THE IEEE CONFERENCE 2000 ON HIGH PERFORMANCE SWITCHING AND ROUTING. HEIDELBERG, GERMANY, JUNE, 26 - 29, 2000, PROCEEDINGS OF THE IEEE CONFERENCE ON HIGH PERFORMANCE SWITCHING AND ROUTING, NEW YORK, NY : IEEE, US, 26 June 2000 (2000-06-26), pages 411 - 418, XP001075729, ISBN: 0-7803-5884-8 * |
Cited By (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
GB2417852A (en) * | 2004-04-14 | 2006-03-08 | Siemens Aktiengesellschaft | Network data flow control |
EP2273730A1 (de) * | 2008-04-02 | 2011-01-12 | Alcatel Lucent | Verfahren und vorrichtung zum verarbeiten des zugangs eines benutzerendgeräts in einem festzugangsnetz |
EP2273730A4 (de) * | 2008-04-02 | 2014-01-01 | Alcatel Lucent | Verfahren und vorrichtung zum verarbeiten des zugangs eines benutzerendgeräts in einem festzugangsnetz |
Also Published As
Publication number | Publication date |
---|---|
DE10301966A1 (de) | 2004-08-05 |
EP1586179A1 (de) | 2005-10-19 |
US7929434B2 (en) | 2011-04-19 |
DE10301966B4 (de) | 2005-06-16 |
CN1739268A (zh) | 2006-02-22 |
CN100499571C (zh) | 2009-06-10 |
US20060056299A1 (en) | 2006-03-16 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
EP1428408B1 (de) | Verteilte übermittlung von informationen in einem verbindungslosen, paketorientierten kommunikationsnetz | |
EP1593241B1 (de) | Zugangskontrolle für ein paketorientiertes netz unter berücksichtigung von resilience anforderungen | |
DE60016977T2 (de) | Verfahren und system zur datenübertragung über einen optimierten datenpfad in einem netzwerk | |
EP1428361B1 (de) | Verkehrsbegrenzung mittels zulässigkeitsprüfung für ein paketorientiertes verbindungsloses netz mit qos niveau übertragung | |
DE102006041058B4 (de) | Verfahren zur Nachführung von Netzparametern | |
EP1529384A2 (de) | Zugangskontrolle bei paketorientierten netzen | |
DE102011003321A1 (de) | Verfahren zum Erhöhen der Qualität der Datenübertragung in einem paketbasierten Kommunikationsnetz | |
WO2004107677A1 (de) | Verfahren für eine verkehrsverteilung mittels hash-codes entsprechend einer soll-verkehrsverteilung in einem paketorientierten netz mit mehrwegerouting | |
DE10301966B4 (de) | Verfahren zur Bestimmung von Grenzen für eine Verkehrskontrolle in Kommunikationsnetzen mit Zugangskontrolle | |
DE102006014378B4 (de) | Verfahren und Netzsteuerungseinheit zum Deaktivieren einer Netzwerkkomponente | |
DE102004001008B3 (de) | Verfahren zur Bestimmung von Grenzwerten für eine Verkehrskontrolle in Kommunikationsnetzen mit Zugangskontrolle | |
DE60302846T2 (de) | Vorrichtung und Verfahren zur Planung der Konfiguration eines Telekommunikationsnetzwerkes mittels Vorhersage des Wandels | |
DE102004057496B4 (de) | Verfahren und Vorrichtung zur automatischen Neueinstellung von Grenzen für Zugangskontrollen zur Beschränkung des Verkehrs in einem Kommunikationsnetz | |
EP1588234A2 (de) | Zuordnung von verteilungsgewichten zu verbindungsabschnitten in einem paketnetz mit verkehrsverteilung | |
DE69217556T2 (de) | Anordnung einer mehrzahl von verwaltungseinheiten zur parameterverwaltung des zellverkehrsflusses in einem atm-vermittlungsnetz und verfahren dafür | |
EP1794947B1 (de) | Automatische nachführung von netzparametern bei veränderungen der verkehrslast | |
EP0711055B1 (de) | Verfahren und Vorrichtung zur Messung charakteristischer Grössen eines Stroms von Datenpaketen fester Länge in einem digitalen Übertragungssystem | |
WO2004021648A1 (de) | Zugangskontrolle bei paketorientierten netzen | |
DE102004041013B3 (de) | Verfahren und Vorrichtung zur Optimierung der Auslastung eines Kommunikationsnetzes | |
DE602005005463T2 (de) | Ein verfahren zur ermittlung von verzögerungen in einem optischen adaptivwegnetz | |
EP1530852B1 (de) | Verteilungsfächer für eine effiziente, ausfallsichere verkehrsverteilung in einem paketnetz | |
EP1586180A2 (de) | Verkehrsbeschränkung bei paketorientierten netzen mittels linkabhängiger grenzwerte für den die netzgrenzen passierenden verkehr | |
DE10220213B4 (de) | Verfahren zur Übertragung von Daten | |
DE102005039338A1 (de) | Kommunikationsnetzwerk, Kommunikationsrechner und Verfahren zum Betreiben eines Kommunikationsnetzwerks | |
DE60037270T2 (de) | Optimierung der durchsatzblockierung durch gemeinsame nutzung der verbindungskapazität |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AK | Designated states |
Kind code of ref document: A1 Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BW BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EC EE EG ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NA NI NO NZ OM PG PH PL PT RO RU SC SD SE SG SK SL SY TJ TM TN TR TT TZ UA UG US UZ VC VN YU ZA ZM ZW |
|
AL | Designated countries for regional patents |
Kind code of ref document: A1 Designated state(s): BW GH GM KE LS MW MZ SD SL SZ TZ UG ZM ZW AM AZ BY KG KZ MD RU TJ TM AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IT LU MC NL PT RO SE SI SK TR BF BJ CF CG CI CM GA GN GQ GW ML MR NE SN TD TG |
|
121 | Ep: the epo has been informed by wipo that ep was designated in this application | ||
WWE | Wipo information: entry into national phase |
Ref document number: 2004701935 Country of ref document: EP |
|
ENP | Entry into the national phase |
Ref document number: 2006056299 Country of ref document: US Kind code of ref document: A1 |
|
WWE | Wipo information: entry into national phase |
Ref document number: 20048024829 Country of ref document: CN Ref document number: 10542723 Country of ref document: US |
|
WWP | Wipo information: published in national office |
Ref document number: 2004701935 Country of ref document: EP |
|
WWP | Wipo information: published in national office |
Ref document number: 10542723 Country of ref document: US |