EP1106003A1 - Procede et systeme de regulation d'encombrement par ordre de priorite dans une station centrale de commutation - Google Patents

Procede et systeme de regulation d'encombrement par ordre de priorite dans une station centrale de commutation

Info

Publication number
EP1106003A1
EP1106003A1 EP99940326A EP99940326A EP1106003A1 EP 1106003 A1 EP1106003 A1 EP 1106003A1 EP 99940326 A EP99940326 A EP 99940326A EP 99940326 A EP99940326 A EP 99940326A EP 1106003 A1 EP1106003 A1 EP 1106003A1
Authority
EP
European Patent Office
Prior art keywords
data
volume
predetermined threshold
transfer
transferred
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
EP99940326A
Other languages
German (de)
English (en)
Inventor
Richard John Knight
Trevor John Coleman
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.)
Madge Networks Ltd
Original Assignee
Madge Networks Ltd
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
Priority claimed from GBGB9818022.7A external-priority patent/GB9818022D0/en
Application filed by Madge Networks Ltd filed Critical Madge Networks Ltd
Publication of EP1106003A1 publication Critical patent/EP1106003A1/fr
Withdrawn legal-status Critical Current

Links

Classifications

    • 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/28—Routing or path finding of packets in data switching networks using route fault recovery
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/46—Interconnection of networks
    • H04L12/4604—LAN interconnection over a backbone network, e.g. Internet, Frame Relay
    • H04L12/462—LAN interconnection over a bridge based backbone
    • 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/24—Multipath
    • 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/26—Route discovery packet
    • 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/11—Identifying 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/17—Interaction among intermediate nodes, e.g. hop by hop
    • 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/10—Flow control; Congestion control
    • H04L47/30—Flow control; Congestion control in combination with information about buffer occupancy at either end or at transit nodes

Definitions

  • the present invention relates to a communications network capable of transferring data in accordance with a transfer priority number.
  • LANs local area networks
  • Carrier Sense Multiple Access Collision Detection type networks (CSMA/CD) , such as Ethernet, or token passing networks, such as Token Ring.
  • CSMA/CD networks communication between two end stations is by transferring data along a set transfer path defined by a number of network nodes. These nodes operate by receiving data from either a previous node, or an end station, determining the intended destination and transferring the data to the next node in the path.
  • the nodes are usually common to several paths and, as a result, when a large amount of data is to be transferred the nodes can become overloaded. When this occurs, the node is receiving data faster then the data can be retransmitted. Whilst some temporary storage space may be provided, this will be rapidly used up meaning that any incoming data will simply be lost.
  • the network nodes are configured to generate a stop signal when congestion occurs. As a result, all nodes which are transferring data to the congested node stop transmitting data, thereby allowing the node to clear any stored data . Once the congestion is cleared, the node transmits a start signal and the nodes resume the data transfer.
  • token passing networks operate by passing a token around each end station of the network in turn. End stations are then only able to transmit data if they are in possession of the token. Accordingly, the amount of data on the network at any one time tends to be limited, thereby reducing the risk of congestion.
  • token passing protocols also operate a priority system in which data is assigned a priority. Accordingly, if the network becomes busy, the end stations are configured such that only higher priority data is transmitted.
  • a communications network for transferring data in accordance with a transfer priority number, the network having a number of switching nodes which transfer data transmitted between end stations coupled to the network, each switching node comprising: a store for storing data prior to transfer; a monitor for monitoring the volume of data being transferred through the switching node; a comparator for comparing the volume of data to a predetermined threshold; and, a signal generator for generating a congestion signal if the respective volume of traffic exceeds the predetermined threshold, wherein the adjacent switching nodes and/or end stations are responsive to the congestion signal to temporarily store at least some of the data to be transferred via the respective switching node, the data for storage being selected in accordance with the priority number .
  • a method of transferring data via a communications network in accordance with a transfer priority number the network having a number of switching nodes adapted to transfer data transmitted between end stations coupled to the network, the method comprising the steps of: causing each switching node to monitor the volume of data being transferred therethrough; comparing the volume of data to a predetermined threshold; causing a switching node to generate a congestion signal if the respective volume of traffic exceeds the predetermined threshold, wherein the adjacent switching nodes and/or end stations are responsive to the congestion signal to temporarily store at least some of the data to be transferred via the respective switching node, the data for storage being selected in accordance with the priority number .
  • this method can advantageously be applied to a network which transfers data in accordance with both CSMA/CD and token passing protocols. This is can be achieved using the present priority indication implemented in token passing protocols. Furthermore, a notional priority can be assigned to data defined in accordance with alternative protocol, such as CSMA/CD traffic. Alternatively, the Ethernet data packets may be given a higher or lower priority such that they are transferred either in preference to, or in deference to the Token Ring data packets.
  • the priority numbers could be assigned to data in accordance with a number of different criteria.
  • the priority could be determined on the basis of the source and/or destination address of the data.
  • virtual LANs can be defined within the overall communications network, and the priority number can therefore be defined frames originating from or addressed to end stations or other devices within these virtual LANs identified by their priority number. This would allow traffic to and from certain end stations to be given priority over traffic to and from other, less important, end stations.
  • frame size This would allow, for example, large frame sizes to be transferred in preference to small frames.
  • the signal generator is adapted to generate an end-of-congestion signal when the respective volume of traffic falls below a second predetermined threshold, the adjacent switching nodes being responsive to the end-of- congestion signal to transfer the temporarily stored data, the data being accessed from the store in accordance with the priority number. This ensures that any stored data is transmitted once the congestion has cleared and that furthermore, the data is accessed in such a way as to maintain the priority of the transfer as far as possible.
  • the second threshold corresponds to a lower volume of traffic than the first predetermined threshold.
  • the second threshold may equal the first predetermined threshold.
  • the monitor monitors the amount of data stored in the store. This provides an indication of how much more data the switching node will be able to store before incoming data is lost.
  • the monitor could be adapted to monitor the absolute volume of data being transferred through the switching node. This would allow the congestion signal to be generated when the switching node is unable to transfer the incoming volume of data.
  • the predetermined threshold comprises a number of predetermined sub-thresholds, the congestion signal including an indication of the sub-threshold which has been exceeded, and wherein the data to be temporarily stored is selected based on the sub-threshold exceeded and the priority number.
  • the system of the invention can begin delaying the transfer of very low priority data at the first signs of congestion arising. This helps slow or even reverse the onset of congestion before it becomes a problem, thereby ensuring that the transfer of high priority data is always maintained. Data having a progressively increasing priority is then stored if congestion continues to increase, and subsequent sub-thresholds are exceeded. This helps increase the rate at which congestion is overcome.
  • an end station for coupling to a communications network which transfers data in accordance with a transfer priority number, the communications network being adapted to monitor the volume of data being transferred there through and to generate a congestion signal if the respective volume of traffic exceeds a predetermined threshold, the end station comprising: a store for storing data; an interface for coupling the end station to the communications network; and, a processor responsive to the congestion signal to cause the end station to temporarily store at least some of the data to be transferred to the communications network, the data for storage being selected in accordance with the priority number.
  • the present invention further provides an end station which helps further reduce the problem of congestion on communications networks.
  • the end station reduces the amount of data to be sent by temporarily storing data which has a low transmission priority, whilst maintaining the transmission of more important high priority data.
  • the end station is generally further adapted to respond to an end-of-congestion signal to transfer the temporarily stored data, the data being accessed from the store in accordance with the priority number.
  • the processor generates the data to be transferred.
  • the data to be transferred may generated by an alternative device, independent of the end station, or an alternative processor within the end station.
  • the data may be generated by the host processor of the end station, with an additional processor being used to control the data transfer.
  • the end station may be a computer, a LAN, or any suitable communications device.
  • Figure 1 shows in schematic form an example of a LAN operating in accordance with the present invention
  • Figure 2 shows one of the switching nodes of the LAN of Figure 1 in greater detail
  • Figure 3a shows an example of an Ethernet data packet suitable for transfer over the LAN of Figure 1;
  • Figure 3b shows an example of a Token Ring data packet suitable for transfer over the LAN of Figure 1;
  • Figure 4 shows in schematic form an example of an end station suitable for coupling to the LAN of Figure 1.
  • the LAN shown in Figure 1 includes a number of switching nodes 4a, 4b, 4c, 4d, 4e, 4f , 4g, 4h each having a number of ports 2. Some of the ports 2 are used to couple the switching nodes 4a, 4b, 4c, 4d, 4e, 4f, 4g, 4h together via connections 3, whilst the remainder are used for coupling end stations to the LAN. Each port 2 will include a port controller (not shown) which is used to configure the port for communication with the respective device.
  • Ethernet end stations 5 which operate in accordance with the Ethernet protocol
  • Token Ring end stations 6 which operate in accordance with a token passing protocol
  • Multigig end stations 7, which are capable of operating in accordance with either the Ethernet or Token Ring protocols.
  • Each end station 5,6,7 includes a respective end station port (not shown) for coupling the end station to the network.
  • the end station may take the form of a personal computer, a file server, a communications network or the like.
  • the LAN generally also includes a router 8, which is used for coordinating the transfer of data between the different end stations 5,6,7 and which is coupled to the network via one of the switching nodes 4.
  • the respective port controller determines the protocol with which the end station 5,6,7 can communicate and configures the port accordingly.
  • the port controller also sends an indication of the nature of the respective end station 5,6,7 to the router 8. This information, is then used to coordinate the transfer of data between end stations such that two end stations will always attempt to communicate using the same protocol.
  • This comprises a receive interface 20 and a transmit interface 21 both of which are coupled to the number of ports 2 via a bus 22.
  • the transmit and receive interfaces are also coupled to each other by a connection 23, as well as via a buffer memory 24.
  • a processor 25, which controls the overall operation of the switching node is also coupled to the transmit and receive interfaces 20,21 as well as the buffer memory 24.
  • data is transferred between end stations connected to the LAN, via the switching nodes 4, in the form of data packets .
  • the LAN is configured to transfer data packets generated in accordance with either the Ethernet or Token Ring protocols.
  • FIG. 3a An example of a suitable Ethernet data packet 40 is shown in Figure 3a and this comprises a packet header 41, including a destination address field 42 a payload 43, which contains the data to be transferred, and a preamble 44.
  • FIG. 3b An example of a suitable Token Ring type data packet 50 is shown in Figure 3b and this comprises a packet header 51, including a destination address field 52 and a priority number field 53 and a payload 54, which contains the data to be transferred.
  • the priority number contained in the priority number field 53 is used to indicate the quality of service that is required by the respective data and usually consists of a number between "0" and "7". In this case 0 indicates the highest priority and this data will be transferred in preference to data having a lower priority. It will however be realised that the present invention can be applied to any number of different protocols and should not be limited to CSMA/CD and token passing type protocols only.
  • the switching node 4 will receive a data packet from either an end station 5,6,7 or an alternative switching node 4 at a respective port 2.
  • the data packet is then transferred from the port 2, via the bus 22, to the receive interface 20 which acts to determine where the data packet is to be transferred to.
  • the first destination type is the processor 25 of the switching node itself.
  • the receive interface 20 removes the packet header and passes the payload onto the processor 25 for further processing.
  • the data packet is intended for transfer to an external destination, such as an alternative switching node 4 or an end station.
  • the receive interface uses the destination address field 42,52 in the packet header 41,51 to determine the intended external destination of the packet. The manner in which this is achieved will depend on the manner in which transfer of the data between end stations is coordinated.
  • data is transferred between two end stations on a point-to-point network such as the LAN, by establishing at least one path through the network, that links the two end stations.
  • the establishment of this path may be achieved by any one of a variety of methods, such as source routing, and will generally depend on the protocols being implemented by the network. However, once a path is determined, this will be defined in one of two ways.
  • each packet generated by the transmitting end station can include route information within the packet header. This would generally take the form of a list of the switching nodes forming the path. Accordingly, when the receive interface receives such a data packet, the receive interface 20 will simply examine the header and determine therefrom the next destination on the list.
  • the path information may be stored in a memory 26 which is coupled to the receive interface, with the data packet simply including an indication of the intended destination end station 5,6,7. Accordingly, upon receipt of such a data packet, the receive interface determines the intended destination of the data packet and then uses this information to look up the next destination on the transfer path from the memory 26.
  • the receive interface transfers the data packet to the transmit interface 21 either via the connection 23, or via the buffer memory 24 depending on the current status of the transmit interface 21. Simultaneously an indication of the intended data packet destination is transferred to the processor 25.
  • a request signal is sent to the processor 25 requesting a data packet for transmission.
  • the processor monitors the transfer of the data packets by maintaining a list of data packets stored in the buffer memory, along with an indication of their intended destination. This information is stored in a processor memory 26, which is coupled to the processor 25. Accordingly, if there are any data packets currently stored in the buffer memory 24, the processor causes a data packet to be read out of the buffer memory 24 whilst simultaneous transferring an indication of the intended destination of the data packet to the transmit interface 21.
  • the list of stored data packets is also updated.
  • the processor 25 will transfer the request signal to the receive interface 20. Accordingly, the receive interface simply transfers the received data packet directly to the transmit interface. The intended destination of the data packet is also passed directly to the transmit interface.
  • the processor 25 monitors the volume of data being transferred by the switching node 4. This may be achieved in one of two ways .
  • the processor 25 may simply determine the volume of data from the list of data packets stored in the buffer memory 24. Alternatively, the processor 25 may monitor the volume of incoming data, or even the ratio of the number of data packets being received compared to the number of packets being transmitted during a set period of time. In any event, either method allows the processor 25 to determine the current volume of traffic being transferred by the switching node 4. The processor 25 then compares this indication of the current volume of traffic to a predetermined threshold level .
  • the predetermined threshold level is an indication of substantially the maximum volume of traffic that the switching node 4 is successfully able to transfer.
  • it may represent the maximum (or at least near maximum) amount of data that can be stored in the buffer memory 24, or alternatively the maximum volume of incoming traffic that the receive interface 20 is able to handle. If the volume of traffic exceeds this predetermined threshold, then this indicates to the processor 25 that the switching node 4 is reaching an overload state in which it will be unable to successfully transfer all the data received at the ports 2.
  • the processor 25 generates a congestion data packet indicating that congestion is occurring within the node. This is then transferred immediately to the transmit interface 21 with an indication of the destinations to which the packet is to be transferred. The transmit interface then adds on a suitable header and transfers the signal to the adjacent switching nodes.
  • the congestion packet would be transferred to the adjacent switching nodes 4b, 4c which are coupled to the switching node 4a.
  • the adjacent switching nodes 4b, 4c which are identical to the switching node 4a, receive the congestion packet and transfer it to their respective processors via the receive interface.
  • the congestion packet indicates to the switching nodes 4b, 4c that the switching node 4a is congested and that therefore the amount of data to be transferred to the switching node 4a should be reduced.
  • the switching nodes 4b, 4c will store any data having a priority below a predetermined level in their respective buffer memories . Transfer of the higher priority data is maintained. As a result the amount of data received by the switching node 4a is reduced allowing the switching node 4a to clear any backlog of data stored in its buffer memory 24.
  • the processor 25 of the switching node 4a will continue to monitor the volume of traffic being transferred through the switching node.
  • a second threshold is defined which represents the volume of data that the switching node is able to successfully handle following a congestion problem. Accordingly, when the volume of data passes below this second threshold, the processor determines that the congestion has been overcome and accordingly generates a clear data packet. This is transferred via the transmit interface 21, the bus 22 and the respective ports 2 to the switching nodes 4b, 4c.
  • the second threshold generally corresponds to a lower volume of data than the first threshold. This ensures that the switching node 4a is able to transfer some of the data packets which are stored in the buffer memory 24 before full transfer of data to the switching node 4a is resumed. This prevents the switching node 4a simply returning to a congested state when the adjacent switching nodes 4b, 4c return to transferring all the data to be transferred.
  • the clear packet which is received by switching nodes 4b, 4c is passed to the respective processors which determine that the congestion has been cleared. Accordingly, the switching nodes 4b, 4c resume sending all the data packets to the switching node 4a, as required.
  • the Ethernet type data packets are assigned a notional mid- level priority, which, for example, will be the number "4".
  • the processors 25 of the switching nodes 4 are therefore configured to handle any Ethernet data packets as though they were Token Ring data packets having a priority number "4".
  • Ethernet data packets may be given a higher or lower priority such that they are transferred either in preference to, or in deference to the Token Ring data packets.
  • the adjacent switching nodes 4b, 4c Whilst the switching node 4a is in a congested state, the adjacent switching nodes 4b, 4c will only transmit data to the switching node 4a that has a priority above a predetermined level. Accordingly, the amount of data the adjacent end stations are able to transmit is limited. This means that the adjacent switching nodes 4b, 4c are more likely to enter a congested state themselves. Thus for example, switching node 4b may enter a congested state, in which case, it will generate a congestion packet which is transferred to the switching nodes 4a, 4d. Similarly, switching node 4c may become congested and generate a congestion packet which is transferred to the switching nodes 4a,4d,4e.
  • the congestion condition will propagate through the LAN. This is in fact desirable as it allows the original source of the congestion to clear more quickly than would otherwise be the case. With the original congestion source returning to a non-congested state, the remainder of the LAN soon also returns to an uncongested state. Furthermore, the back propagation helps reduce the loss of any data that occurs when uncontrolled congestion arises in the network. This occurs whilst the flow of the high priority data is maintained.
  • the end stations can be advantageously adapted to respond to congestion signals.
  • a network interface card which is used to link the end station to the LAN via the end station port, could be adapted to prevent the transmission of low priority data onto the network when a congestion packet is received.
  • An example of an end station 5,6,7 including a suitable network interface card is shown in Figure 4.
  • the end station comprises a receive interface 60 and a transmit interface 61 both of which are coupled to one of the switching nodes 4 via a bus 62 and an end station port 63.
  • the transmit and receive interfaces are also coupled to a host processor 64, via a bus 65 and respective buffer memories 66,67.
  • a connection 68 is provided between the receive and transmit interfaces .
  • the end station 5,6,7 will receive a data packet from one of the switching nodes 4 of the LAN, via the end station port 63.
  • the data will be transferred to the receive interface which acts to determine the intended destination of the data packet. If the end station is not the intended destination of the data packet, the data packet is simply transferred to the transmit interface via the connection 68 and retransmitted onto the LAN. If the data is intended for the end station, the receive interface removes the header from the data and transfers the packet payload to the host processor 64 for further processing.
  • the buffer memory 66 is provided for temporary storage of the data packet payloads in the event that the host processor 64 is unable to receive the data for immediate processing. Transmission is achieved by having the processor generate the data payload and transfer this to the transmit interface 61.
  • the transmit interface adds on the suitable header and transfers the data to the LAN. Again the buffer memory 67 is provided for temporary storage of the data in the event that the transmit interface is unable to transmit the data immediately.
  • the switching node 4 to which the end station 5,6,7 is connected generates a congestion data packet
  • this will be detected by the host processor 64. It will be realised that as the different end stations 5,6,7 operate in accordance with different protocols, it is necessary for the processor 25 and the transmit interface 21, of the switching node 4, to generate a congestion packet in accordance with the correct protocol . In the case where multiple end stations are coupled to a single switching node 4 , this may require the switching node to generate several different congestion packets in accordance with different protocols.
  • the host processor 64 responds to a congestion packet by storing any data having a priority below a predetermined level in the buffer memory 67. In the unlikely event that the amount of data in the buffer memory 67 exceeds a predetermined level, the processor 64 will halt processing of the low priority data to ensure that no data is lost .
  • the host processor 64 causes the low priority data to be transferred from the buffer memory 67 to the transmit interface. Processing of the low priority data by the host processor 64 can then be resumed.
  • the processors 25, of the switching nodes 4 would compare the volume of data currently being transferred to a number of sub-thresholds, with each sub-threshold corresponding to a different volume of data. In this case, when the lowest sub-threshold is exceeded, the processor 25 of the respective switching node 4 would generate a first congestion signal which causes adjacent nodes to stop transferring the lowest priority data only.
  • a sub- threshold is provided corresponding to each level of priority. This allows the amount of data for which transfer is halted to be progressively increased to thereby ensure that the disruption to the transmission of high priority data will be minimised as far as possible.
  • a corresponding number of second sub- thresholds will also be provided, with each second sub- threshold corresponding to level below which the volume of data being transferred must fall, in order to allow data transfer of a respective priority to be resumed.

Abstract

L'invention concerne un réseau de communications servant à transférer des données en fonction d'un numéro de priorité de transfert. Le réseau comporte des noeuds (4) de commutation qui transfèrent des données entre des stations (5, 6, 7) finales couplées au réseau. Chaque noeud (4) de commutation comporte une mémoire (24) pour stocker des données avant leur transfert, un moniteur pour surveiller le volume de données en cours de transfert dans le noeud de commutation, un comparateur pour comparer le volume de données à un seuil prédéterminé, et un générateur de signal pour produire un signal d'encombrement si le volume respectif de trafic dépasse le seuil prédéterminé. Dans ce cas, les noeuds (4) de commutation adjacents et/ou les stations (5, 6, 7) adjacentes répondent au signal d'encombrement en vue de stocker temporairement au moins certaines données à transférer via le noeud (4) de commutation respectif. Les données stockées sont sélectionnées en fonction de leur numéro de priorité.
EP99940326A 1998-08-18 1999-08-16 Procede et systeme de regulation d'encombrement par ordre de priorite dans une station centrale de commutation Withdrawn EP1106003A1 (fr)

Applications Claiming Priority (5)

Application Number Priority Date Filing Date Title
GB9818022 1998-08-18
GBGB9818022.7A GB9818022D0 (en) 1998-08-18 1998-08-18 Communications network
GBGB9822113.8A GB9822113D0 (en) 1998-08-18 1998-10-09 Communications network
GB9822113 1998-10-09
PCT/GB1999/002691 WO2000011841A1 (fr) 1998-08-18 1999-08-16 Procede et systeme de regulation d'encombrement par ordre de priorite dans une station centrale de commutation

Publications (1)

Publication Number Publication Date
EP1106003A1 true EP1106003A1 (fr) 2001-06-13

Family

ID=26314229

Family Applications (1)

Application Number Title Priority Date Filing Date
EP99940326A Withdrawn EP1106003A1 (fr) 1998-08-18 1999-08-16 Procede et systeme de regulation d'encombrement par ordre de priorite dans une station centrale de commutation

Country Status (2)

Country Link
EP (1) EP1106003A1 (fr)
WO (1) WO2000011841A1 (fr)

Families Citing this family (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7380272B2 (en) * 2000-05-17 2008-05-27 Deep Nines Incorporated System and method for detecting and eliminating IP spoofing in a data transmission network
US7058976B1 (en) 2000-05-17 2006-06-06 Deep Nines, Inc. Intelligent feedback loop process control system
US6930978B2 (en) 2000-05-17 2005-08-16 Deep Nines, Inc. System and method for traffic management control in a data transmission network
DE10197219B4 (de) * 2001-03-28 2011-12-22 Telefonaktiebolaget Lm Ericsson (Publ) Lastverteilung zwischen Knoten in Kommunikationsnetzwerken
US6513122B1 (en) 2001-06-29 2003-01-28 Networks Associates Technology, Inc. Secure gateway for analyzing textual content to identify a harmful impact on computer systems with known vulnerabilities
US20040146006A1 (en) * 2003-01-24 2004-07-29 Jackson Daniel H. System and method for internal network data traffic control
US7295519B2 (en) * 2003-06-20 2007-11-13 Motorola, Inc. Method of quality of service based flow control within a distributed switch fabric network
DE102006032332A1 (de) * 2006-07-12 2008-01-17 Combots Product Gmbh & Co. Kg Verfahren und Kommunikationssystem zur effizienten Übertragung von Kommunikationsdaten über Netzwerkknoten
JP5542068B2 (ja) * 2008-02-29 2014-07-09 コーニンクレッカ フィリップス エヌ ヴェ 利用可能だが可変である信号品質に基づく生理モニタリングの最適化
US8125909B2 (en) 2009-10-22 2012-02-28 Motorola Solutions, Inc. Methods and apparatus for controlling congestion in a communication network

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0712220A1 (fr) * 1994-11-08 1996-05-15 International Business Machines Corporation ContrÔle de débit noeud à noeud dans un réseau ATM
AU6501096A (en) * 1995-07-19 1997-02-18 Ascom Nexion Inc. Prioritized access to shared buffers

Non-Patent Citations (1)

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

Also Published As

Publication number Publication date
WO2000011841A1 (fr) 2000-03-02

Similar Documents

Publication Publication Date Title
US5473604A (en) Method for avoiding node overload in a packet switching network
US6118761A (en) Apparatus and method for generating rate control frames in a workgroup switch based on traffic contribution from a network switch port
Bux et al. Flow control in local-area networks of interconnected token rings
US7002911B1 (en) Flow control mechanism
US6115356A (en) Apparatus and method for generating flow control frames in a workgroup switch based on traffic contribution from a network switch port
US7239636B2 (en) Multiple virtual channels for use in network devices
US6192422B1 (en) Repeater with flow control device transmitting congestion indication data from output port buffer to associated network node upon port input buffer crossing threshold level
EP1137225B1 (fr) Commutateur et méthode de commutation
US7450509B2 (en) Adaptive flow control method and apparatus
JP3517245B2 (ja) パケットスイッチングネットワーク内のルーチングデバイス出力アクセス用調整方法および装置
AU676199B2 (en) Method for assigning priority to traffic between local area networks interconnected via a backbone network
EP1565828B1 (fr) Dispositif et procede de distribution d'informations d'etat de tampon dans une matrice de commutation
EP3484108B1 (fr) Procédé de distribution de données sur un réseau
US7423967B2 (en) Fairness scheme method and apparatus for pause capable and pause incapable ports
EP2050199B1 (fr) Appareil et procédés de gestion de trafic de communication accélérée
US7274660B2 (en) Method of flow control
US7573821B2 (en) Data packet rate control
US20030169688A1 (en) System and method for dynamic rate flow control
EP1411680B1 (fr) Système de réseau Metro-Ethernet avec une messagerie de pauses selective en amont
EP1941640B1 (fr) Procede, circuit et systeme de transmission des donnees a des debits differents
EP0685951A2 (fr) Interface de ligne pour réseau de paquets rapide
EP0607546A2 (fr) Dispositif pour un "by pass" dynamique d'une station dans un réseau à fibre avec interface de données distribuées, en utilisant des procédés de sauts
US7130271B1 (en) Relaying apparatus
WO2000011841A1 (fr) Procede et systeme de regulation d'encombrement par ordre de priorite dans une station centrale de commutation
KR100612437B1 (ko) 이더넷 망의 혼잡 여부를 알려주는 장치 및 방법

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

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LI LU MC NL PT SE

17Q First examination report despatched

Effective date: 20021204

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

RBV Designated contracting states (corrected)

Designated state(s): DE FR GB