WO1997004543A2 - Regulation du flux d'un commutateur bimode alloue/dynamique - Google Patents

Regulation du flux d'un commutateur bimode alloue/dynamique Download PDF

Info

Publication number
WO1997004543A2
WO1997004543A2 PCT/US1996/011942 US9611942W WO9704543A2 WO 1997004543 A2 WO1997004543 A2 WO 1997004543A2 US 9611942 W US9611942 W US 9611942W WO 9704543 A2 WO9704543 A2 WO 9704543A2
Authority
WO
WIPO (PCT)
Prior art keywords
queue
output
input
queues
xoff
Prior art date
Application number
PCT/US1996/011942
Other languages
English (en)
Other versions
WO1997004543A3 (fr
Inventor
Stephen A. Caldara
Stephen A. Hauser
Thomas A. Manning
Original Assignee
Fujitsu Network Communications, Inc.
Fujitsu Limited
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 Fujitsu Network Communications, Inc., Fujitsu Limited filed Critical Fujitsu Network Communications, Inc.
Priority to EP96927240A priority Critical patent/EP0839421A4/fr
Priority to PCT/US1996/011942 priority patent/WO1997004543A2/fr
Priority to AU67125/96A priority patent/AU6712596A/en
Priority to JP9506879A priority patent/JPH11510009A/ja
Publication of WO1997004543A2 publication Critical patent/WO1997004543A2/fr
Publication of WO1997004543A3 publication Critical patent/WO1997004543A3/fr

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/10Flow control; Congestion control
    • H04L47/18End to end
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F15/00Digital computers in general; Data processing equipment in general
    • G06F15/16Combinations of two or more digital computers each having at least an arithmetic unit, a program unit and a register, e.g. for a simultaneous processing of several programs
    • G06F15/163Interprocessor communication
    • G06F15/173Interprocessor communication using an interconnection network, e.g. matrix, shuffle, pyramid, star, snowflake
    • G06F15/17356Indirect interconnection networks
    • G06F15/17368Indirect interconnection networks non hierarchical topologies
    • G06F15/17375One dimensional, e.g. linear array, ring
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/28Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/46Interconnection of networks
    • H04L12/4604LAN interconnection over a backbone network, e.g. Internet, Frame Relay
    • H04L12/4608LAN interconnection over ATM networks
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/54Store-and-forward switching systems 
    • H04L12/56Packet switching systems
    • H04L12/5601Transfer mode dependent, e.g. ATM
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/54Store-and-forward switching systems 
    • H04L12/56Packet switching systems
    • H04L12/5601Transfer mode dependent, e.g. ATM
    • H04L12/5602Bandwidth control in ATM Networks, e.g. leaky bucket
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/08Configuration management of networks or network elements
    • H04L41/0896Bandwidth or capacity management, i.e. automatically increasing or decreasing capacities
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/10Flow control; Congestion control
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/10Flow control; Congestion control
    • H04L47/11Identifying congestion
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/10Flow control; Congestion control
    • H04L47/26Flow control; Congestion control using explicit feedback to the source, e.g. choke packets
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/10Flow control; Congestion control
    • H04L47/26Flow control; Congestion control using explicit feedback to the source, e.g. choke packets
    • H04L47/266Stopping or restarting the source, e.g. X-on or X-off
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/10Flow control; Congestion control
    • H04L47/29Flow control; Congestion control using a combination of thresholds
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/10Flow control; Congestion control
    • H04L47/30Flow control; Congestion control in combination with information about buffer occupancy at either end or at transit nodes
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/50Queue scheduling
    • H04L47/62Queue scheduling characterised by scheduling criteria
    • H04L47/621Individual queue per connection or flow, e.g. per VC
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00Packet switching elements
    • H04L49/10Packet switching elements characterised by the switching fabric construction
    • H04L49/104Asynchronous transfer mode [ATM] switching fabrics
    • H04L49/105ATM switching elements
    • H04L49/106ATM switching elements using space switching, e.g. crossbar or matrix
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00Packet switching elements
    • H04L49/10Packet switching elements characterised by the switching fabric construction
    • H04L49/104Asynchronous transfer mode [ATM] switching fabrics
    • H04L49/105ATM switching elements
    • H04L49/107ATM switching elements using shared medium
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00Packet switching elements
    • H04L49/15Interconnection of switching modules
    • H04L49/1515Non-blocking multistage, e.g. Clos
    • H04L49/153ATM switching fabrics having parallel switch planes
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00Packet switching elements
    • H04L49/15Interconnection of switching modules
    • H04L49/1553Interconnection of ATM switching modules, e.g. ATM switching fabrics
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00Packet switching elements
    • H04L49/15Interconnection of switching modules
    • H04L49/1553Interconnection of ATM switching modules, e.g. ATM switching fabrics
    • H04L49/1576Crossbar or matrix
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00Packet switching elements
    • H04L49/20Support for services
    • H04L49/201Multicast operation; Broadcast operation
    • H04L49/203ATM switching fabrics with multicast or broadcast capabilities
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00Packet switching elements
    • H04L49/25Routing or path finding in a switch fabric
    • H04L49/253Routing or path finding in a switch fabric using establishment or release of connections between ports
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00Packet switching elements
    • H04L49/25Routing or path finding in a switch fabric
    • H04L49/253Routing or path finding in a switch fabric using establishment or release of connections between ports
    • H04L49/255Control mechanisms for ATM switching fabrics
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00Packet switching elements
    • H04L49/25Routing or path finding in a switch fabric
    • H04L49/256Routing or path finding in ATM switching fabrics
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00Packet switching elements
    • H04L49/30Peripheral units, e.g. input or output ports
    • H04L49/3081ATM peripheral units, e.g. policing, insertion or extraction
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00Packet switching elements
    • H04L49/30Peripheral units, e.g. input or output ports
    • H04L49/3081ATM peripheral units, e.g. policing, insertion or extraction
    • H04L49/309Header conversion, routing tables or routing tags
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00Packet switching elements
    • H04L49/45Arrangements for providing or supporting expansion
    • H04L49/455Provisions for supporting expansion in ATM switches
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00Packet switching elements
    • H04L49/55Prevention, detection or correction of errors
    • H04L49/552Prevention, detection or correction of errors by ensuring the integrity of packets received through redundant connections
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00Packet switching elements
    • H04L49/55Prevention, detection or correction of errors
    • H04L49/555Error detection
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
    • H04L69/30Definitions, standards or architectural aspects of layered protocol stacks
    • H04L69/32Architecture of open systems interconnection [OSI] 7-layer type protocol stacks, e.g. the interfaces between the data link level and the physical level
    • H04L69/322Intralayer communication protocols among peer entities or protocol data unit [PDU] definitions
    • H04L69/324Intralayer communication protocols among peer entities or protocol data unit [PDU] definitions in the data link layer [OSI layer 2], e.g. HDLC
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04QSELECTING
    • H04Q11/00Selecting arrangements for multiplex systems
    • H04Q11/04Selecting arrangements for multiplex systems for time-division multiplexing
    • H04Q11/0428Integrated services digital network, i.e. systems for transmission of different types of digitised signals, e.g. speech, data, telecentral, television signals
    • H04Q11/0478Provisions for broadband connections
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04JMULTIPLEX COMMUNICATION
    • H04J3/00Time-division multiplex systems
    • H04J3/02Details
    • H04J3/06Synchronising arrangements
    • H04J3/0635Clock or time synchronisation in a network
    • H04J3/0682Clock or time synchronisation in a network by delay compensation, e.g. by compensation of propagation delay or variations thereof, by ranging
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04JMULTIPLEX COMMUNICATION
    • H04J3/00Time-division multiplex systems
    • H04J3/02Details
    • H04J3/06Synchronising arrangements
    • H04J3/0635Clock or time synchronisation in a network
    • H04J3/0685Clock or time synchronisation in a node; Intranode synchronisation
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/54Store-and-forward switching systems 
    • H04L12/56Packet switching systems
    • H04L12/5601Transfer mode dependent, e.g. ATM
    • H04L2012/5614User Network Interface
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/54Store-and-forward switching systems 
    • H04L12/56Packet switching systems
    • H04L12/5601Transfer mode dependent, e.g. ATM
    • H04L2012/5614User Network Interface
    • H04L2012/5616Terminal equipment, e.g. codecs, synch.
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/54Store-and-forward switching systems 
    • H04L12/56Packet switching systems
    • H04L12/5601Transfer mode dependent, e.g. ATM
    • H04L2012/5625Operations, administration and maintenance [OAM]
    • H04L2012/5627Fault tolerance and recovery
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/54Store-and-forward switching systems 
    • H04L12/56Packet switching systems
    • H04L12/5601Transfer mode dependent, e.g. ATM
    • H04L2012/5628Testing
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/54Store-and-forward switching systems 
    • H04L12/56Packet switching systems
    • H04L12/5601Transfer mode dependent, e.g. ATM
    • H04L2012/5629Admission control
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/54Store-and-forward switching systems 
    • H04L12/56Packet switching systems
    • H04L12/5601Transfer mode dependent, e.g. ATM
    • H04L2012/5629Admission control
    • H04L2012/5631Resource management and allocation
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/54Store-and-forward switching systems 
    • H04L12/56Packet switching systems
    • H04L12/5601Transfer mode dependent, e.g. ATM
    • H04L2012/5629Admission control
    • H04L2012/5631Resource management and allocation
    • H04L2012/5632Bandwidth allocation
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/54Store-and-forward switching systems 
    • H04L12/56Packet switching systems
    • H04L12/5601Transfer mode dependent, e.g. ATM
    • H04L2012/5629Admission control
    • H04L2012/5631Resource management and allocation
    • H04L2012/5632Bandwidth allocation
    • H04L2012/5634In-call negotiation
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/54Store-and-forward switching systems 
    • H04L12/56Packet switching systems
    • H04L12/5601Transfer mode dependent, e.g. ATM
    • H04L2012/5629Admission control
    • H04L2012/5631Resource management and allocation
    • H04L2012/5632Bandwidth allocation
    • H04L2012/5635Backpressure, e.g. for ABR
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/54Store-and-forward switching systems 
    • H04L12/56Packet switching systems
    • H04L12/5601Transfer mode dependent, e.g. ATM
    • H04L2012/5638Services, e.g. multimedia, GOS, QOS
    • H04L2012/564Connection-oriented
    • H04L2012/5642Multicast/broadcast/point-multipoint, e.g. VOD
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/54Store-and-forward switching systems 
    • H04L12/56Packet switching systems
    • H04L12/5601Transfer mode dependent, e.g. ATM
    • H04L2012/5638Services, e.g. multimedia, GOS, QOS
    • H04L2012/564Connection-oriented
    • H04L2012/5643Concast/multipoint-to-point
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/54Store-and-forward switching systems 
    • H04L12/56Packet switching systems
    • H04L12/5601Transfer mode dependent, e.g. ATM
    • H04L2012/5638Services, e.g. multimedia, GOS, QOS
    • H04L2012/5646Cell characteristics, e.g. loss, delay, jitter, sequence integrity
    • H04L2012/5647Cell loss
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/54Store-and-forward switching systems 
    • H04L12/56Packet switching systems
    • H04L12/5601Transfer mode dependent, e.g. ATM
    • H04L2012/5638Services, e.g. multimedia, GOS, QOS
    • H04L2012/5646Cell characteristics, e.g. loss, delay, jitter, sequence integrity
    • H04L2012/5647Cell loss
    • H04L2012/5648Packet discarding, e.g. EPD, PTD
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/54Store-and-forward switching systems 
    • H04L12/56Packet switching systems
    • H04L12/5601Transfer mode dependent, e.g. ATM
    • H04L2012/5638Services, e.g. multimedia, GOS, QOS
    • H04L2012/5646Cell characteristics, e.g. loss, delay, jitter, sequence integrity
    • H04L2012/5649Cell delay or jitter
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/54Store-and-forward switching systems 
    • H04L12/56Packet switching systems
    • H04L12/5601Transfer mode dependent, e.g. ATM
    • H04L2012/5638Services, e.g. multimedia, GOS, QOS
    • H04L2012/5646Cell characteristics, e.g. loss, delay, jitter, sequence integrity
    • H04L2012/5651Priority, marking, classes
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/54Store-and-forward switching systems 
    • H04L12/56Packet switching systems
    • H04L12/5601Transfer mode dependent, e.g. ATM
    • H04L2012/5638Services, e.g. multimedia, GOS, QOS
    • H04L2012/5646Cell characteristics, e.g. loss, delay, jitter, sequence integrity
    • H04L2012/5652Cell construction, e.g. including header, packetisation, depacketisation, assembly, reassembly
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/54Store-and-forward switching systems 
    • H04L12/56Packet switching systems
    • H04L12/5601Transfer mode dependent, e.g. ATM
    • H04L2012/5672Multiplexing, e.g. coding, scrambling
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/54Store-and-forward switching systems 
    • H04L12/56Packet switching systems
    • H04L12/5601Transfer mode dependent, e.g. ATM
    • H04L2012/5678Traffic aspects, e.g. arbitration, load balancing, smoothing, buffer management
    • H04L2012/5679Arbitration or scheduling
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/54Store-and-forward switching systems 
    • H04L12/56Packet switching systems
    • H04L12/5601Transfer mode dependent, e.g. ATM
    • H04L2012/5678Traffic aspects, e.g. arbitration, load balancing, smoothing, buffer management
    • H04L2012/5681Buffer or queue management
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/54Store-and-forward switching systems 
    • H04L12/56Packet switching systems
    • H04L12/5601Transfer mode dependent, e.g. ATM
    • H04L2012/5678Traffic aspects, e.g. arbitration, load balancing, smoothing, buffer management
    • H04L2012/5681Buffer or queue management
    • H04L2012/5682Threshold; Watermark
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/54Store-and-forward switching systems 
    • H04L12/56Packet switching systems
    • H04L12/5601Transfer mode dependent, e.g. ATM
    • H04L2012/5678Traffic aspects, e.g. arbitration, load balancing, smoothing, buffer management
    • H04L2012/5681Buffer or queue management
    • H04L2012/5683Buffer or queue management for avoiding head of line blocking
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/54Store-and-forward switching systems 
    • H04L12/56Packet switching systems
    • H04L12/5601Transfer mode dependent, e.g. ATM
    • H04L2012/5685Addressing issues
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L7/00Arrangements for synchronising receiver with transmitter
    • H04L7/04Speed or phase control by synchronisation signals
    • H04L7/041Speed or phase control by synchronisation signals using special codes as synchronising signal
    • H04L7/046Speed or phase control by synchronisation signals using special codes as synchronising signal using a dotting sequence

Definitions

  • the present invention is generally related to telecommunications networks, and more particularly to reduction of cell loss in network switches.
  • ATM networks such as asynchronous transfer mode (“ATM”) networks are used for transfer of audio, video and other data.
  • ATM networks deliver data by routing data units such as ATM cells from source to destination through switches.
  • Switches include input/output ("I/O") ports through which ATM cells are received and transmitted. The appropriate output port for transmission of the cell is determined based on the cell header.
  • a problem associated with ATM networks is loss of cells.
  • Cells are buffered within each switch before being routed and transmitted from the switch. More particularly, switches typically have buffers at either the inputs or outputs of the switch for temporarily storing cells prior to transmission. As network traffic increases, there is an increasing possibility that buffer space may be inadequate and data lost. If the buffer size is insufficient, cells are lost. Cell loss causes undesirable interruptions in audio and video data transmissions, and may cause more serious damage to other types of data transmissions. Avoidance of cell loss is therefore desirable.
  • SUMMARY OF THE INVENTION A method and apparatus are disclosed for eliminating cell loss within a network switch through the use of flow control.
  • the switch includes at least one input port, at least one output port, and input and output buffers associated with the respective input and output ports.
  • each queue includes multiple buffers, and each switch includes multiple input queues and multiple output queues. Upon entering the switch, each cell is loaded into a particular input queue for eventual transmission to a particular output queue. Individual queues are then assigned to traffic type groups in order to provide traffic type flow control if shared resources are being utilized. In an alternate implementation, each queue could be dedicated to a particular traffic type (sometimes referred to as a service class) such as the variable bit rate (“VBR”) service class and the available bit rate (“ABR”) service class.
  • VBR variable bit rate
  • ABR available bit rate
  • Flow control can then be implemented on a per traffic type basis. Further, flow control can be implemented on traffic sub-types and queues where each queue may be assigned to a particular connection, thereby providing flow control on a per connection as well as traffic subtype basis. Table 1 below shows possible flow control configurations. TABLE 1
  • Each connection is assigned bandwidth types based on the traffic type associated with the connection.
  • bandwidth There are two types of bandwidth to grant within the switch: allocated and dynamic.
  • Allocated bandwidth is bandwidth which is "reserved" for use by the connection to which the bandwidth is allocated.
  • a connection with allocated bandwidth is guaranteed access to the full amount of bandwidth allocated to that connection.
  • traffic types that need deterministic control of delay are assigned allocated bandwidth.
  • Dynamic bandwidth is bandwidth which i ⁇ "shared" by any of various competing connections. Because dynamic bandwidth is a shared resource, there is generally no guarantee that any particular connection will have access to a particular amount of bandwidth. For this reason dynamic bandwidth is typically assigned to connections with larger delay bounds. Other connections may be assigned a combination of dynamic and allocated bandwidth.
  • a digital feedback message with first and second bits is provided to facilitate flow control.
  • the feedback message may also include a REJECT message.
  • REJECT When REJECT is received by the requesting input queue, the cell is not transferred. However, further requests to transfer may be sent by the input queue.
  • the feedback message may also include a NO-OP/XOFF message.
  • An XOFF message can be received while transmitting via allocated bandwidth or dynamic bandwidth.
  • an XOFF (allocated) message may be received with regard to allocated bandwidth and an XOFF (dynamic) message may be received with regard to dynamic bandwidth.
  • An optional tagging technique may be employed to distinguish between requests for dynamic and allocated bandwidth.
  • the XOFF (dynamic) message temporarily halts transmission of requests to transfer via dynamic bandwidth.
  • Each input queue receiving XOFF (dynamic) from a particular output queue temporarily ceases submitting requests to transmit to that particular output queue via dynamic bandwidth until a specified event occurs.
  • the specified event could be passage of a predetermined amount of time or receipt of an XON signal which enables further requests to transfer to be sent.
  • the input queues could also be enabled with an XON signal on a regular basis, i.e., without regard to when each particular input queue was placed in the XOFF (dynamic) state. Such a regular basis could be, for example, every 100 msec. When the second bit of the two bit message equals 0, such indicates an NO-OP (no operation) signal. Each input queue receiving a NO-OP signal is not disabled.
  • the XOFF (allocated) feedback message temporarily halts transmission of requests to transfer via allocated bandwidth.
  • Each input queue receiving XOFF (allocated) from a particular output queue temporarily ceases submitting requests to transmit to that particular output queue via allocated bandwidth until a specified event occurs.
  • the specified event is typically receipt of an XON signal which enables further requests to transfer to be sent.
  • the input queues could also be enabled with an XON signal on a regular basis, i.e., without regard to when each particular input queue was placed in the XOFF (allocated) state. Such a regular basis could be, for example, every 100 msec. When the second bit of the two bit message equals 0, such indicates an NO-OP signal.
  • Each input queue receiving a NO-OP (no operation) signal is not disabled.
  • an XON signal is used to enable input queues which have been placed in either XOFF state.
  • Each input queue receiving XON from a particular output queue is enabled to submit requests to transmit to that output queue.
  • the XON resets both the XOFF (dynamic) and XOFF (allocated) states.
  • the XON signal can be used in conjunction with enabling on a regular basis to both reduce unnecessary switch traffic and prevent flow blockage due to errors.
  • Receipt of NO-OP and either ACCEPT or REJECT operates as described above. Receipt of either XOFF (dynamic) and ACCEPT or XOFF (allocated) and ACCEPT indicates that further requests to transfer via the designated bandwidth type should cease following transfer of one cell. Receipt of XOFF (dynamic) and REJECT or XOFF (allocated) and REJECT indicates that further requests to transfer via the designated bandwidth type should cease immediately and no cells may be transmitted. Thus, the XOFF commands effect future requests while the REJECT command provides for denial of the current request.
  • NO-OP/XOFF (dynamic) message is employed to reduce unnecessary feedback signaling within the switch.
  • Switch bandwidth is inefficiently used when REJECT is repeatedly asserted when a cell can not be transmitted through the switch.
  • XOFF (dynamic) is thus used to modify To Switch Port Processor ("TSPP") behavior to reduce the number of requests made to a full From Switch Port Processor (“FSPP”) queue.
  • TSPP To Switch Port Processor
  • FSPP Full From Switch Port Processor
  • Flow control with the feedback messages described above provides reliable point-to-multipoint transmission within the switch, i.e., transmission from a single input queue to multiple output queues.
  • the feedback messages from the multiple output queues to the single input queue are logically OR , d such that a single XOFF (dynamic) or REJECT message from any one of the plurality of output queues prevents transmission.
  • point-to- multipoint cells are transmitted at the rate of the slowest destination queue.
  • Flow control with the two bit feedback messages described above also provides reliable multipoint-to-point transmission within the switch, i.e., transmission from multiple input queues to a single output queue.
  • Each output queue has a threshold, and sends the XON message when the output queue drains to that threshold.
  • the XON threshold of the output queue is dynamically set to reserve sufficient space for each input queue to transmit to the output queue. For example, if there are eight input queues then the threshold is set to eight so that the output queue will free sufficient space to receive all of the cells contemporaneously in serial fashion.
  • Fig. 1 is a switch interconnect block diagram
  • Fig. 2 is a block diagram illustrating point-to-point operation, switch flow control and link flow control
  • Fig. 3 is a block diagram illustrating point-to- multipoint operation
  • Fig. 4 is a block diagram illustrating multipoint-to- point operation.
  • the switch includes an NxN switch fabric 10, a bandwidth arbiter 12, a plurality of To Switch Port Processor subsystems ("TSPP") 14, a plurality of To Switch Port Processor ASICs 15, a plurality of From Switch Port Processor subsystems ("FSPP") 16, a plurality of From Switch Port Processor ASICs 17 and a plurality of multipoint topology controllers 18.
  • the NxN switch fabric such as an ECL cross point switch fabric, is used for cell data transport, and yields N times 670 Mbps throughput.
  • the bandwidth arbiter controls switch fabric interconnection, dynamically schedules unassigned bandwidth and resolves multipoint-to-point bandwidth contention.
  • Each TSPP schedules transmission of cells to the switch fabric from multiple connections. Not shown are the physical line interfaces between the input link and the TSPP subsystem.
  • the FSPP receives cells from the switch fabric and organizes those cells onto output links. Not shown are the physical line interfaces between the output link and the FSPP subsystem.
  • the switch includes a plurality of input ports 20, a plurality of output ports 22, and input buffers 26 and output buffers 28 associated with the input ports and output ports, respectively.
  • a cell 24 enters the switch through an input port and is buffered in the input buffers. The cell is then transmitted from the input buffers to output buffers in an output port. From the output port the cell is transmitted outside of the switch, for example, to another switch 29.
  • a feedback message 30 is provided to the input ports to prevent transmission of cells from the input ports to the output buffers.
  • the feedback message 30 prevents cell loss within the switch. If the number of cells 24 transmitted to the output buffers is greater than the number of available output buffers 28 then cells are lost. However, in response to a transfer request, when the output buffers 28 become filled to the threshold level the feedback message is transmitted to the input ports 20 to prevent transmission of cells from the input buffers.
  • the threshold level is set to a value which prevents transmission of more cells than can be handled by the available output buffers. Hence, cell loss between the input buffers and the output buffers is prevented by the flow control feedback message.
  • the buffers 26, 28 are organized into queues 32, 34 respectively and flow control is implemented on a per queue basis.
  • Each queue includes multiple buffers, and each input port and output port includes multiple input queues 32 and multiple output queues 34.
  • each cell 24 Upon entering the switch, each cell 24 is loaded into a particular input queue 32 for eventual transmission to a particular output queue 34.
  • the queues are also assigned to traffic type groups in order to provide traffic type flow control if shared resources are being utilized. By assigning a unique queue per connection, flow control can then be implemented on a per connection basis.
  • nested queues of queues may be employed to provide per traffic type, per connection flow control.
  • a scheduling list is effectively a queue of queues where the queues have cells to be transmitted for that connection, and there is a scheduling list for each connection at the TSPP and the TSPP supports multiple connections.
  • a scheduling list may be considered an input queue, and the terms are hereafter used synonymously.
  • Each connection is assigned bandwidth types based on the traffic type associated with the connection.
  • bandwidth There are two types of bandwidth to grant within the switch: allocated and dynamic.
  • Allocated bandwidth is bandwidth which is "reserved" for use by the connection to which the bandwidth is allocated.
  • a connection with allocated bandwidth is guaranteed access to the full amount of bandwidth allocated to that connection.
  • traffic types that need deterministic control of delay are assigned allocated bandwidth.
  • Dynamic bandwidth is bandwidth which is "shared" by any of various competing connections. Because dynamic bandwidth is a shared resource, there is generally no guarantee that any particular connection will have access to a particular amount of bandwidth. For this reason dynamic bandwidth is typically assigned to connections with larger delay bounds. Other connections may be assigned a combination of dynamic and allocated bandwidth.
  • each transfer request is tagged. More particularly, transfer requests of a connection utilizing dynamic bandwidth are tagged with a bit in a first state and transfer requests of a connection utilizing allocated bandwidth are tagged with the bit in a second state. If the connection is above the allocated cell rate then the transfer request is tagged as dynamic. If the connection is operating at or below the allocated cell rate then the transfer request is tagged as allocated.
  • the feedback message 30 is provided in response to a request message 36.
  • the request message including the allocated/dynamic tag Prior to transmitting a cell from an input port 20 to an output port 22 the request message including the allocated/dynamic tag is sent from the input port to the output port to determine whether sufficient buffers 28 are available in the output port.
  • the feedback message 30 provides an indication of buffer status at the output port, and transmission proceeds accordingly.
  • the request message 36 always precedes cell transfer within the switch so that cells are only transferred under selected conditions.
  • the feedback message 30 from the output port to the input port includes several sub-type messages.
  • the feedback message includes an ACCEPT message which may be sent in response to the request message.
  • ACCEPT is received by the requesting input queue, the cell is transferred to the output queue.
  • the feedback message 30 may also include an XOFF (dynamic) message which temporarily halts transmission of request messages 36 via dynamic bandwidth.
  • XOFF dynamic
  • Each input queue 32 receiving XOFF (dynamic) from a particular output queue 34 temporarily ceases transmission of request messages for dynamic bandwidth to that particular output queue until a specified event occurs.
  • the specified event could be passage of a predetermined interval of time or receipt of another signal.
  • the feedback message may also include an XOFF (dynamic) message which temporarily halts transmission of request messages 36 via dynamic bandwidth.
  • Each input queue 32 receiving XOFF (dynamic) from a particular output queue 34 temporarily ceases transmission of request messages for dynamic bandwidth to that particular output queue until a specified event occurs.
  • the specified event could be passage of
  • Each input queue receiving XOFF (allocated) from a particular output queue temporarily ceases submitting requests to transmit to that particular output queue via allocated bandwidth until a specified event occurs.
  • the specified event is typically receipt of an XON signal which enables further requests to transfer to be sent.
  • the input queues could also be enabled with an XON signal on a regular basis, i.e., without regard to when each particular input queue was placed in the XOFF (allocated) state. Such a regular basis could be, for example, every 100 msec. In practice the request tagging technique allows use of a single XOFF message to designate either XOFF (dynamic) or XOFF (allocated) .
  • the request tagging technique tags requests for bandwidth with a tag bit based upon whether the request is for dynamic or allocated bandwidth.
  • the tag bit thus distinguishes allocated and dynamic requests and feedback, i.e., the XOFF transmitted in response to a request for dynamic bandwidth is XOFF (dynamic) .
  • various responses to each request message may be received by the requesting input queue. Such responses are interpreted as follows. Receipt of NO-OP and either ACCEPT or REJECT operates as described above. Receipt of XOFF (dynamic) and ACCEPT indicates that further requests to transfer should cease following transfer of one cell. Receipt of XOFF (dynamic) and REJECT indicates that further requests to transfer should cease immediately and no cells may be transmitted.
  • the XOFF (dynamic) command effects future requests while the REJECT command provides for denial of the current request.
  • the feedback message 30 may also include an XON message which enables further transmission of request messages.
  • the XON message occurs asynchronously to the request to transfer messages, and is not provided in response thereto.
  • the XON message is effective to remove both XOFF conditions.
  • Each input queue receiving XON from a particular output queue is enabled to submit requests to transmit to that output queue.
  • timeout type functions which will allow continued operation despite the removal or failure of internal elements such as ports.
  • an input queue 32 which has ceased transmission of request messages to a particular output queue 34 following receipt of an XOFF (dynamic or allocated) message may transmit a further request message to that output queue if an XON message is not received from that output queue within a predetermined interval of time.
  • input queues may periodically transmit request messages regardless of XOFF (dynamic or allocated) state.
  • each input port includes a TSPP 14, and each output port includes an FSPP 16.
  • the TSPPs and FSPPs each include cell buffer RAM which is organized into queues 32, 34, respectively. All cells in a connection 40 pass through a single queue at each port, one at the TSPP and one at the FSPP, for the life of the connection. The queues thus preserve cell ordering. This strategy also allows quality of service (“QoS”) guarantees on a per connection basis.
  • QoS quality of service
  • the request message 36 is a probe which is sent to the FSPP 16 from the TSPP 14 to determine whether sufficient buffers 34 are available for cell transmission.
  • a TSPP cannot transmit a cell to an FSPP unless there is buffer space available for that cell.
  • the probe communicates destination multiqueue numbers which indicate the FSPP queue or queues to which the cell is to be transmitted. For example, a destination multiqueue number could identify output queue 34a as the destination queue.
  • the FSPP responds to the probe with either or both of the "REJECT" and "XOFF (dynamic or allocated)" messages, as will be described below.
  • the Probe Crossbar 42 is an NxN crosspoint switch fabric which is used to transmit an FSPP multiqueue Number to each FSPP.
  • the multiqueue number identifies a plurality of destination queues for the cell for use in point-to-multipoint connections.
  • the FSPP uses the multiqueue number to direct the probe 36 to the appropriate output queue or queues 34 and thereby determine if there are enough output buffers available in the destination queues for receipt of the cell or cells.
  • the XOFF Crossbar 44 is an NxN serial crosspoint switch fabric which is used to communicate "Don't Send" type messages from the FSPP 16 to the TSPP 14.
  • Each TSPP includes multiple scheduling lists 48 which have queues of cells to be transmitted for each connection.
  • the first bit of the feedback message 30, namely XOFF is asserted to halt transmission of request message probes 36 from a particular TSPP's scheduling list, and is thus a state control bit which puts the receiving TSPP's scheduling list in an XOFF state, meaning that this TSPP's scheduling list 48 will not use dynamic bandwidth.
  • This TSPP's Scheduling List then remains in the XOFF state until receiving an XON message.
  • the second bit namely REJECT
  • REJECT REJECT
  • the TSPP responds to an asserted REJECT feedback message by not dequeueing the cell 24 through the data crossbar 47.
  • An idle cell denoted by a complemented CRC is transmitted instead.
  • the TSPP responds to an asserted XOFF (dynamic) feedback message by modifying the TSPP's scheduling list XOFF state bits.
  • the XOFF state bits prevent the TSPP from attempting to send a request message from that queue on that Scheduling List until notified by the FSPPs that cell buffers are available.
  • the XON Crossbar 46 is an NxN serial contention-based switch which is used to communicate "Enable Send" type messages. More particularly, the XON Crossbar is employed to communicate the XON message from the FSPP to the TSPP. When the number of buffered cells in the FSPP queue drops below an XON threshold, the XON message is sent from the FSPP to the TSPP. The XON message enables the TSPP Scheduling List to resume sending request messages.
  • Fig. 3 illustrates point-to-multipoint switch flow control, i.e., transmission from a single input queue 32 to multiple output queues 34.
  • the XOFF crossbar performs a logical OR function. More particularly, the XOFF crossbar performs a logical OR of the feedback messages 30 asserted by the FSPPs to provided a single feedback message.
  • the single resultant feedback message will be interpreted as asserting REJECT and/or XOFF respectively.
  • This technique limits the TSPP to transmission at the rate of the slowest destination queue. However, the technique also provides desirable contemporaneous serial transmission of cells.
  • a TSPP may receive multiple XON messages. Such is true because multiple XOFFs could be set by the FSPPs, i.e., more than one FSPP can assert XOFF on a transfer request. In such a case, XON messages received when the TSPP scheduling list XOFF state is clear are ignored. For example, when multiple XON messages are sent, the TSPP ignores the XONs received after the first received XON message. In the case of multipoint-to-point transmission the XON message is sent simultaneously to all TSPPs with scheduling lists transferring to an FSPP queue.
  • Fig. 4 illustrates multipoint-to-point switch flow control, i.e., transmission from multiple input queues 32 to a single output queue 34.
  • Each output queue has a threshold, and the XON message is sent when the output queue drains below that threshold.
  • the XON threshold of the output queue is dynamically set to reserve enough buffers for each input queue to transmit to the output queue. For example, if eight queues are transmitting, the threshold is set to eight so that the output queue will free sufficient buffers to receive all eight of the cells contemporaneously in serial fashion, and thereby insuring that each queue has an opportunity to transmit. Referring now to Figs.
  • the XON crossbar 46 is used to broadcast to all TSPPs in the switch, regardless of whether or not any of the TSPPs were transmitting to the asserting FSPP queue.
  • the multipoint topology controller 18 transmits a reverse broadcast channel number on behalf of the FSPP.
  • the receiving multipoint topology controller then performs a reverse broadcast channel to scheduling list number lookup to determine which scheduling list 48 to enable. Any TSPPs without queues transmitting to that particular FSPP queue are unaffected by the broadcast XON message since the reverse broadcast channel number look-up entry will be marked invalid.
  • an additional flow control enhancement provides for the queues to be organized on an hierarchical basis with multiple individual flows 52 at each hierarchical level and the feedback message 30 from the output queues to the input queues is made on the basis of the combined flow at each of the hierarchical levels.
  • Still another enhancement provides for the queues to be organized on an hierarchical basis with multiple individual flows at each of the hierarchical levels and the feedback message from the output queues to the input queues is made on the basis of each of the individual flows.
  • the Probe & XOFF communication paths operate in a pipeline fashion.
  • the TSPP 14 selects an input queue 34, and information associated with that queue is used to determine output ports for transmission, i.e., a destination output queue.
  • the bandwidth arbitrator reduces this information to a TSPP to FSPP connectivity map which is employed to control the Probe, XOFF, and data cross-points in sequence.
  • the FSPP multiqueue number is transmitted to the FSPP using the Probe crossbar 42.
  • the FSPP tests for buffer availability, and asserts REJECT and/or XOFF on the XOFF crossbar 44 if sufficient buffers are not available.
  • the TSPP transmits an idle cell if REJECT was asserted. If XOFF was asserted, the TSPP puts the Scheduling List into the XOFF state. If sufficient buffers are available, the TSPP transmits the cell to the FSPP output queue through the data crossbar 47.
  • Table 3 summarizes the policies used by the FSPP to assert REJECT and XOFF in response to requests tagged as utilizing dynamic bandwidth.
  • the policies are based upon two relationships: the traffic type cell count in relation to the cell count limit and the queue's dynamic buffer count in relation to the buffer count limit.
  • the traffic type cell count is a count of all cells shared by connections within a traffic type, e.g., "VBR.”
  • VBR traffic type
  • both REJECT and XOFF dynamic are asserted.
  • the traffic type cell count is greater than or equal to the limit and the queue's dynamic buffer count is not greater than or equal to buffer limit XOFF is not asserted but REJECT is asserted.
  • REJECT is asserted.
  • the traffic type cell count is greater than or equal to the limit and the queue's dynamic buffer count greater than or equal to the limit both REJECT and XOFF are asserted.
  • Table 4 summarizes the policies used by the FSPP to assert REJECT and XOFF in response to requests tagged to use allocated bandwidth.
  • the policies are based upon three relationships: the queue's allocated buffer-state count in relation to the buffer-state count limit, the traffic type cell count in relation to the cell count limit, and the queue's allocated buffer count in relation to the buffer count limit.
  • Link flow control uses a buffer-state counter to indicate cells in flight.
  • the allocated buffer-state counter is used to track cells in flight for the allocated component of a connection using link flow control.
  • Neither XOFF nor REJECT are asserted if the queue's allocated buffer- state count is greater than or equal to the count limit, the traffic type cell count is greater than or equal to the cell count limit, and the queue's allocated buffer count is greater than or equal to the count limit. Both XOFF and REJECT are asserted if the queue's allocated buffer count is greater than or equal to the buffer count limit. If the queue's allocated buffer count is not greater than or equal to the count limit, but either the queue's allocated buffer- state count is greater than or equal to the count limit or the traffic type cell count is greater than or equal to the cell count limit then REJECT is asserted and XOFF is not asserted. In all cases, if an FSPP queue has already sent an XOFF, that queue will reassert XOFF on the next probe.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Physics & Mathematics (AREA)
  • Mathematical Physics (AREA)
  • Computer Security & Cryptography (AREA)
  • Computer Hardware Design (AREA)
  • Theoretical Computer Science (AREA)
  • Software Systems (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

L'invention concerne un procédé et un appareil pour éliminer la perte de cellules dans un commutateur de réseau, par l'utilisation d'une régulation du flux des largeurs de bandes dynamiques et allouées. Quand les mémoires tampon de sortie (28) du commutateur sont remplies jusqu'à un niveau de seuil prédéterminé, un message (30) est fourni en retour aux mémoires tampon d'entrée (26) pour empêcher la transmission des cellules des mémoires tampon d'entrée aux mémoires tampon de sortie. Pour assurer les connexions et une séparation en fonction du trafic, les mémoires tampon sont groupées en files d'attente et la régulation du flux peut être assurée sur ces files d'attente. Le message de retour est un signal numérique comprenant un message ACCEPT/REJECT, et un message NO-OP/XOFF. Un message XOFF peut être reçu pendant la transmission par l'intermédiaire d'une largeur de bande allouée ou dynamique.
PCT/US1996/011942 1995-07-19 1996-07-18 Regulation du flux d'un commutateur bimode alloue/dynamique WO1997004543A2 (fr)

Priority Applications (4)

Application Number Priority Date Filing Date Title
EP96927240A EP0839421A4 (fr) 1995-07-19 1996-07-18 Regulation du flux d'un commutateur bimode alloue/dynamique
PCT/US1996/011942 WO1997004543A2 (fr) 1995-07-19 1996-07-18 Regulation du flux d'un commutateur bimode alloue/dynamique
AU67125/96A AU6712596A (en) 1995-07-19 1996-07-18 Allocated and dynamic switch flow control
JP9506879A JPH11510009A (ja) 1995-07-19 1996-07-18 割付型並びに動的交換機フロー制御

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
US149895P 1995-07-19 1995-07-19
US60/001,498 1995-07-19
PCT/US1996/011942 WO1997004543A2 (fr) 1995-07-19 1996-07-18 Regulation du flux d'un commutateur bimode alloue/dynamique

Publications (2)

Publication Number Publication Date
WO1997004543A2 true WO1997004543A2 (fr) 1997-02-06
WO1997004543A3 WO1997004543A3 (fr) 1997-04-17

Family

ID=38659691

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/US1996/011942 WO1997004543A2 (fr) 1995-07-19 1996-07-18 Regulation du flux d'un commutateur bimode alloue/dynamique

Country Status (4)

Country Link
EP (1) EP0839421A4 (fr)
JP (1) JPH11510009A (fr)
AU (1) AU6712596A (fr)
WO (1) WO1997004543A2 (fr)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0860960A2 (fr) * 1997-02-19 1998-08-26 Telefonaktiebolaget Lm Ericsson ContrÔle d'écoulement pour réseau de commutation
US7209441B2 (en) 2000-08-15 2007-04-24 Juniper Networks, Inc. Asynchronous transfer mode switch
GB2461693A (en) * 2008-07-07 2010-01-13 Virtensys Ltd Requesting permission to transmit selected packets from a plurality of ingress ports and selecting one of the requests at an egress port of a switching device
EP2328091A3 (fr) * 2001-10-03 2012-03-28 Global IP Solutions (GIPS) AB Lecture de média de réseau
WO2014014713A1 (fr) * 2012-07-20 2014-01-23 Cisco Technology, Inc. Pause intelligente pour système de matrice de commutation distribué

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108419072B (zh) * 2018-01-17 2020-08-04 深圳市绚视科技有限公司 一种裸眼3d显示屏的校正方法以及校正装置、存储介质

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5090011A (en) * 1988-12-23 1992-02-18 Hitachi, Ltd. Packet congestion control method and packet switching equipment
US5119372A (en) * 1989-05-10 1992-06-02 At&T Bell Laboratories Multi-access ATD multiplexer with congestion detection circuitry
US5412648A (en) * 1992-12-25 1995-05-02 Nec Corporation Packet switching system for forwarding packets from input buffers using idle/busy status of output buffers
US5493566A (en) * 1992-12-15 1996-02-20 Telefonaktiebolaget L M. Ericsson Flow control system for packet switches

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5090011A (en) * 1988-12-23 1992-02-18 Hitachi, Ltd. Packet congestion control method and packet switching equipment
US5119372A (en) * 1989-05-10 1992-06-02 At&T Bell Laboratories Multi-access ATD multiplexer with congestion detection circuitry
US5493566A (en) * 1992-12-15 1996-02-20 Telefonaktiebolaget L M. Ericsson Flow control system for packet switches
US5412648A (en) * 1992-12-25 1995-05-02 Nec Corporation Packet switching system for forwarding packets from input buffers using idle/busy status of output buffers

Non-Patent Citations (1)

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

Cited By (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0860960A2 (fr) * 1997-02-19 1998-08-26 Telefonaktiebolaget Lm Ericsson ContrÔle d'écoulement pour réseau de commutation
EP0860960A3 (fr) * 1997-02-19 1998-09-02 Telefonaktiebolaget Lm Ericsson Contrôle d'écoulement pour réseau de commutation
US6172963B1 (en) 1997-02-19 2001-01-09 Telefonaktiebolaget Lm Ericsson (Publ) Flow control for switching
US7209441B2 (en) 2000-08-15 2007-04-24 Juniper Networks, Inc. Asynchronous transfer mode switch
US7729251B2 (en) 2000-08-15 2010-06-01 Juniper Networks, Inc. Asynchronous transfer mode switch
EP2328091A3 (fr) * 2001-10-03 2012-03-28 Global IP Solutions (GIPS) AB Lecture de média de réseau
GB2461693A (en) * 2008-07-07 2010-01-13 Virtensys Ltd Requesting permission to transmit selected packets from a plurality of ingress ports and selecting one of the requests at an egress port of a switching device
US8040907B2 (en) 2008-07-07 2011-10-18 Virtensys Ltd. Switching method
GB2461693B (en) * 2008-07-07 2012-08-15 Micron Technology Inc Switching method
WO2014014713A1 (fr) * 2012-07-20 2014-01-23 Cisco Technology, Inc. Pause intelligente pour système de matrice de commutation distribué
CN104641605A (zh) * 2012-07-20 2015-05-20 思科技术公司 用于分布式交换结构系统的智能暂停

Also Published As

Publication number Publication date
JPH11510009A (ja) 1999-08-31
EP0839421A4 (fr) 2001-07-18
AU6712596A (en) 1997-02-18
EP0839421A2 (fr) 1998-05-06
WO1997004543A3 (fr) 1997-04-17

Similar Documents

Publication Publication Date Title
US5978359A (en) Allocated and dynamic switch flow control
US6212582B1 (en) Method for multi-priority, multicast flow control in a packet switch
EP0864244B1 (fr) Appareil et procedes servant a modifier des seuils afin d'empecher la congestion de commutateurs atm
US5457687A (en) Method and apparatus for backward explicit congestion notification (BECN) in an ATM network
CA2184830C (fr) Systeme de commutation a large bande
US5784358A (en) Broadband switching network with automatic bandwidth allocation in response to data cell detection
US5787072A (en) Flow control apparatus and flow control method
JPH10145382A (ja) Atm交換機のスイッチ制御回路
US6128278A (en) Cell queuing in ATM switches
US6574232B1 (en) Crossbar switch utilizing broadcast buffer and associated broadcast buffer management unit
US5398235A (en) Cell exchanging apparatus
US6172963B1 (en) Flow control for switching
US5742597A (en) Method and device for multipoint switching and arbitration in output-request packet switch
EP0669734A2 (fr) Méthode et dispositif de gestion de communication entre des systèmes de communication à plusieurs noeuds basés sur des quotas
WO1998025378A1 (fr) Procede de commande de l'ecoulement d'un trafic mta
CA2020132C (fr) Systeme de communication complementaire pour terminaux en mode de deconnexion dans un reseau asynchrone a multiplexage temporel
JPH04336728A (ja) リング状パケット通信網
EP0839421A2 (fr) Regulation du flux d'un commutateur bimode alloue/dynamique
US6819675B2 (en) Self-route multi-memory expandable packet switch with overflow processing means
EP0839422B1 (fr) Structures de listes enchainees pour niveaux multiples de commande dans un commutateur mta
US6212181B1 (en) Method for using the departure queue memory bandwidth to support additional cell arrivals in an ATM switch
WO1997004564A1 (fr) Gestion de largeurs de bande attribuees et dynamiques
EP0557910A2 (fr) Commutateur de cellules
WO1997004542A2 (fr) Arbitrage multipoint a point dans un commutateur de reseau
EP1183833A1 (fr) Appareil et procede de conditionnement du trafic dans un autocommutateur

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A2

Designated state(s): AL AM AT AU AZ BB BG BR BY CA CH CN CZ DE DK EE ES FI GB GE HU IL IS JP KE KG KP KR KZ LK LR LS LT LU LV MD MG MK MN MW MX NO NZ PL PT RO RU SD SE SG SI SK TJ TM TR TT UA UG US UZ VN AM AZ BY KG KZ MD RU TJ TM

AL Designated countries for regional patents

Kind code of ref document: A2

Designated state(s): KE LS MW SD SZ UG AT BE CH DE DK ES FI FR GB GR IE IT LU MC NL PT SE BF BJ CF CG CI CM GA

AK Designated states

Kind code of ref document: A3

Designated state(s): AL AM AT AU AZ BB BG BR BY CA CH CN CZ DE DK EE ES FI GB GE HU IL IS JP KE KG KP KR KZ LK LR LS LT LU LV MD MG MK MN MW KE

Kind code of ref document: A3

Designated state(s): AL AM AT AU AZ BB BG BR BY CA CH CN CZ DE DK EE ES FI GB GE HU IL IS JP KE KG KP KR KZ LK LR LS LT LU LV MD MG MK MN MW MX NO NZ PL PT RO RU SD SE SG SI SK TJ TM TR TT UA UG US UZ VN AM AZ BY KG KZ MD RU TJ TM

AL Designated countries for regional patents

Kind code of ref document: A3

Designated state(s): KE LS MW SD SZ UG AT BE CH DE DK ES FI FR GB GR IE IT LU MC NL PT SE BF BJ CF CG CI CM GA

DFPE Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101)
ENP Entry into the national phase

Ref country code: JP

Ref document number: 1997 506879

Kind code of ref document: A

Format of ref document f/p: F

WWE Wipo information: entry into national phase

Ref document number: 1996927240

Country of ref document: EP

WWP Wipo information: published in national office

Ref document number: 1996927240

Country of ref document: EP

REG Reference to national code

Ref country code: DE

Ref legal event code: 8642

NENP Non-entry into the national phase

Ref country code: CA

WWW Wipo information: withdrawn in national office

Ref document number: 1996927240

Country of ref document: EP