[go: up one dir, main page]

WO1997004565A1 - Arbitrage des priorites lors de transmissions de point a point ou de point a plusieurs points - Google Patents

Arbitrage des priorites lors de transmissions de point a point ou de point a plusieurs points Download PDF

Info

Publication number
WO1997004565A1
WO1997004565A1 PCT/US1996/011945 US9611945W WO9704565A1 WO 1997004565 A1 WO1997004565 A1 WO 1997004565A1 US 9611945 W US9611945 W US 9611945W WO 9704565 A1 WO9704565 A1 WO 9704565A1
Authority
WO
WIPO (PCT)
Prior art keywords
point
multipoint
data
bandwidth
request
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.)
Ceased
Application number
PCT/US1996/011945
Other languages
English (en)
Other versions
WO1997004565A9 (fr
Inventor
Thomas A. Manning
Stephen A. Caldara
Stephen A. Hauser
Matthias L. Colsman
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.)
Fujitsu Ltd
Fujitsu Network Communications Inc
Ascom Nexion Inc
Original Assignee
Fujitsu Ltd
Fujitsu Network Communications Inc
Ascom Nexion Inc
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 Ltd, Fujitsu Network Communications Inc, Ascom Nexion Inc filed Critical Fujitsu Ltd
Priority to JP9506882A priority Critical patent/JPH11510011A/ja
Priority to AU65026/96A priority patent/AU6502696A/en
Priority to PCT/US1996/011945 priority patent/WO1997004565A1/fr
Publication of WO1997004565A1 publication Critical patent/WO1997004565A1/fr
Publication of WO1997004565A9 publication Critical patent/WO1997004565A9/fr
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/18—End to end
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F15/00—Digital computers in general; Data processing equipment in general
    • G06F15/16—Combinations 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/163—Interprocessor communication
    • G06F15/173—Interprocessor communication using an interconnection network, e.g. matrix, shuffle, pyramid, star, snowflake
    • G06F15/17356—Indirect interconnection networks
    • G06F15/17368—Indirect interconnection networks non hierarchical topologies
    • G06F15/17375—One dimensional, e.g. linear array, ring
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/02—Details
    • H04L12/16—Arrangements for providing special services to substations
    • H04L12/18—Arrangements for providing special services to substations for broadcast or conference, e.g. multicast
    • 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/4608—LAN interconnection over ATM networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems 
    • H04L12/56—Packet switching systems
    • H04L12/5601—Transfer mode dependent, e.g. ATM
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems 
    • H04L12/56—Packet switching systems
    • H04L12/5601—Transfer mode dependent, e.g. ATM
    • H04L12/5602—Bandwidth control in ATM Networks, e.g. leaky bucket
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/08—Configuration management of networks or network elements
    • H04L41/0896—Bandwidth or capacity management, i.e. automatically increasing or decreasing capacities
    • 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/26—Flow control; Congestion control using explicit feedback to the source, e.g. choke packets
    • H04L47/266—Stopping or restarting the source, e.g. X-on or X-off
    • 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
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/50—Queue scheduling
    • H04L47/62—Queue scheduling characterised by scheduling criteria
    • H04L47/621—Individual queue per connection or flow, e.g. per VC
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00—Packet switching elements
    • H04L49/10—Packet switching elements characterised by the switching fabric construction
    • H04L49/104—Asynchronous transfer mode [ATM] switching fabrics
    • H04L49/105—ATM switching elements
    • H04L49/106—ATM switching elements using space switching, e.g. crossbar or matrix
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00—Packet switching elements
    • H04L49/10—Packet switching elements characterised by the switching fabric construction
    • H04L49/104—Asynchronous transfer mode [ATM] switching fabrics
    • H04L49/105—ATM switching elements
    • H04L49/107—ATM switching elements using shared medium
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00—Packet switching elements
    • H04L49/15—Interconnection of switching modules
    • H04L49/1515—Non-blocking multistage, e.g. Clos
    • H04L49/153—ATM switching fabrics having parallel switch planes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00—Packet switching elements
    • H04L49/15—Interconnection of switching modules
    • H04L49/1553—Interconnection of ATM switching modules, e.g. ATM switching fabrics
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00—Packet switching elements
    • H04L49/15—Interconnection of switching modules
    • H04L49/1553—Interconnection of ATM switching modules, e.g. ATM switching fabrics
    • H04L49/1576—Crossbar or matrix
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00—Packet switching elements
    • H04L49/20—Support for services
    • H04L49/201—Multicast operation; Broadcast operation
    • H04L49/203—ATM switching fabrics with multicast or broadcast capabilities
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00—Packet switching elements
    • H04L49/25—Routing or path finding in a switch fabric
    • H04L49/253—Routing or path finding in a switch fabric using establishment or release of connections between ports
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00—Packet switching elements
    • H04L49/25—Routing or path finding in a switch fabric
    • H04L49/253—Routing or path finding in a switch fabric using establishment or release of connections between ports
    • H04L49/255—Control mechanisms for ATM switching fabrics
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00—Packet switching elements
    • H04L49/25—Routing or path finding in a switch fabric
    • H04L49/256—Routing or path finding in ATM switching fabrics
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00—Packet switching elements
    • H04L49/30—Peripheral units, e.g. input or output ports
    • H04L49/3081—ATM peripheral units, e.g. policing, insertion or extraction
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00—Packet switching elements
    • H04L49/30—Peripheral units, e.g. input or output ports
    • H04L49/3081—ATM peripheral units, e.g. policing, insertion or extraction
    • H04L49/309—Header conversion, routing tables or routing tags
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00—Packet switching elements
    • H04L49/45—Arrangements for providing or supporting expansion
    • H04L49/455—Provisions for supporting expansion in ATM switches
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00—Packet switching elements
    • H04L49/55—Prevention, detection or correction of errors
    • H04L49/552—Prevention, detection or correction of errors by ensuring the integrity of packets received through redundant connections
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00—Packet switching elements
    • H04L49/55—Prevention, detection or correction of errors
    • H04L49/555—Error detection
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
    • H04L69/30—Definitions, standards or architectural aspects of layered protocol stacks
    • H04L69/32—Architecture of open systems interconnection [OSI] 7-layer type protocol stacks, e.g. the interfaces between the data link level and the physical level
    • H04L69/322—Intralayer communication protocols among peer entities or protocol data unit [PDU] definitions
    • H04L69/324—Intralayer communication protocols among peer entities or protocol data unit [PDU] definitions in the data link layer [OSI layer 2], e.g. HDLC
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q11/00—Selecting arrangements for multiplex systems
    • H04Q11/04—Selecting arrangements for multiplex systems for time-division multiplexing
    • H04Q11/0428—Integrated services digital network, i.e. systems for transmission of different types of digitised signals, e.g. speech, data, telecentral, television signals
    • H04Q11/0478—Provisions for broadband connections
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/10—Flow control between communication endpoints
    • H04W28/14—Flow control between communication endpoints using intermediate storage
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04J—MULTIPLEX COMMUNICATION
    • H04J3/00—Time-division multiplex systems
    • H04J3/02—Details
    • H04J3/06—Synchronising arrangements
    • H04J3/0635—Clock or time synchronisation in a network
    • H04J3/0682—Clock or time synchronisation in a network by delay compensation, e.g. by compensation of propagation delay or variations thereof, by ranging
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04J—MULTIPLEX COMMUNICATION
    • H04J3/00—Time-division multiplex systems
    • H04J3/02—Details
    • H04J3/06—Synchronising arrangements
    • H04J3/0635—Clock or time synchronisation in a network
    • H04J3/0685—Clock or time synchronisation in a node; Intranode synchronisation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems 
    • H04L12/56—Packet switching systems
    • H04L12/5601—Transfer mode dependent, e.g. ATM
    • H04L2012/5614—User Network Interface
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems 
    • H04L12/56—Packet switching systems
    • H04L12/5601—Transfer mode dependent, e.g. ATM
    • H04L2012/5614—User Network Interface
    • H04L2012/5616—Terminal equipment, e.g. codecs, synch.
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems 
    • H04L12/56—Packet switching systems
    • H04L12/5601—Transfer mode dependent, e.g. ATM
    • H04L2012/5625—Operations, administration and maintenance [OAM]
    • H04L2012/5627—Fault tolerance and recovery
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems 
    • H04L12/56—Packet switching systems
    • H04L12/5601—Transfer mode dependent, e.g. ATM
    • H04L2012/5628—Testing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems 
    • H04L12/56—Packet switching systems
    • H04L12/5601—Transfer mode dependent, e.g. ATM
    • H04L2012/5629—Admission control
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems 
    • H04L12/56—Packet switching systems
    • H04L12/5601—Transfer mode dependent, e.g. ATM
    • H04L2012/5629—Admission control
    • H04L2012/5631—Resource management and allocation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems 
    • H04L12/56—Packet switching systems
    • H04L12/5601—Transfer mode dependent, e.g. ATM
    • H04L2012/5629—Admission control
    • H04L2012/5631—Resource management and allocation
    • H04L2012/5632—Bandwidth allocation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems 
    • H04L12/56—Packet switching systems
    • H04L12/5601—Transfer mode dependent, e.g. ATM
    • H04L2012/5629—Admission control
    • H04L2012/5631—Resource management and allocation
    • H04L2012/5632—Bandwidth allocation
    • H04L2012/5634—In-call negotiation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems 
    • H04L12/56—Packet switching systems
    • H04L12/5601—Transfer mode dependent, e.g. ATM
    • H04L2012/5629—Admission control
    • H04L2012/5631—Resource management and allocation
    • H04L2012/5632—Bandwidth allocation
    • H04L2012/5635—Backpressure, e.g. for ABR
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems 
    • H04L12/56—Packet switching systems
    • H04L12/5601—Transfer mode dependent, e.g. ATM
    • H04L2012/5638—Services, e.g. multimedia, GOS, QOS
    • H04L2012/564—Connection-oriented
    • H04L2012/5642—Multicast/broadcast/point-multipoint, e.g. VOD
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems 
    • H04L12/56—Packet switching systems
    • H04L12/5601—Transfer mode dependent, e.g. ATM
    • H04L2012/5638—Services, e.g. multimedia, GOS, QOS
    • H04L2012/564—Connection-oriented
    • H04L2012/5643—Concast/multipoint-to-point
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems 
    • H04L12/56—Packet switching systems
    • H04L12/5601—Transfer mode dependent, e.g. ATM
    • H04L2012/5638—Services, e.g. multimedia, GOS, QOS
    • H04L2012/5646—Cell characteristics, e.g. loss, delay, jitter, sequence integrity
    • H04L2012/5647—Cell loss
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems 
    • H04L12/56—Packet switching systems
    • H04L12/5601—Transfer mode dependent, e.g. ATM
    • H04L2012/5638—Services, e.g. multimedia, GOS, QOS
    • H04L2012/5646—Cell characteristics, e.g. loss, delay, jitter, sequence integrity
    • H04L2012/5647—Cell loss
    • H04L2012/5648—Packet discarding, e.g. EPD, PTD
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems 
    • H04L12/56—Packet switching systems
    • H04L12/5601—Transfer mode dependent, e.g. ATM
    • H04L2012/5638—Services, e.g. multimedia, GOS, QOS
    • H04L2012/5646—Cell characteristics, e.g. loss, delay, jitter, sequence integrity
    • H04L2012/5649—Cell delay or jitter
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems 
    • H04L12/56—Packet switching systems
    • H04L12/5601—Transfer mode dependent, e.g. ATM
    • H04L2012/5638—Services, e.g. multimedia, GOS, QOS
    • H04L2012/5646—Cell characteristics, e.g. loss, delay, jitter, sequence integrity
    • H04L2012/5651—Priority, marking, classes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems 
    • H04L12/56—Packet switching systems
    • H04L12/5601—Transfer mode dependent, e.g. ATM
    • H04L2012/5638—Services, e.g. multimedia, GOS, QOS
    • H04L2012/5646—Cell characteristics, e.g. loss, delay, jitter, sequence integrity
    • H04L2012/5652—Cell construction, e.g. including header, packetisation, depacketisation, assembly, reassembly
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems 
    • H04L12/56—Packet switching systems
    • H04L12/5601—Transfer mode dependent, e.g. ATM
    • H04L2012/5672—Multiplexing, e.g. coding, scrambling
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems 
    • H04L12/56—Packet switching systems
    • H04L12/5601—Transfer mode dependent, e.g. ATM
    • H04L2012/5678—Traffic aspects, e.g. arbitration, load balancing, smoothing, buffer management
    • H04L2012/5679—Arbitration or scheduling
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems 
    • H04L12/56—Packet switching systems
    • H04L12/5601—Transfer mode dependent, e.g. ATM
    • H04L2012/5678—Traffic aspects, e.g. arbitration, load balancing, smoothing, buffer management
    • H04L2012/5681—Buffer or queue management
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems 
    • H04L12/56—Packet switching systems
    • H04L12/5601—Transfer mode dependent, e.g. ATM
    • H04L2012/5678—Traffic aspects, e.g. arbitration, load balancing, smoothing, buffer management
    • H04L2012/5681—Buffer or queue management
    • H04L2012/5682—Threshold; Watermark
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems 
    • H04L12/56—Packet switching systems
    • H04L12/5601—Transfer mode dependent, e.g. ATM
    • H04L2012/5678—Traffic aspects, e.g. arbitration, load balancing, smoothing, buffer management
    • H04L2012/5681—Buffer or queue management
    • H04L2012/5683—Buffer or queue management for avoiding head of line blocking
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems 
    • H04L12/56—Packet switching systems
    • H04L12/5601—Transfer mode dependent, e.g. ATM
    • H04L2012/5685—Addressing issues
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L7/00—Arrangements for synchronising receiver with transmitter
    • H04L7/04—Speed or phase control by synchronisation signals
    • H04L7/041—Speed or phase control by synchronisation signals using special codes as synchronising signal
    • H04L7/046—Speed 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 point- to-point and point-to-multipoint arbitration, bandwidth 10 allocation and delay management within an asynchronous transfer mode switch.
  • 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
  • the appropriate output port for transmission of the cell is determined based on the cell header.
  • switches typically have buffers at either the inputs or outputs of the switch for temporarily storing cells prior to transmission.
  • buffer space may be inadequate and data lost. If the buffer size is insufficient, cells are
  • a cell In point-to-point transmission a cell is transmitted from a single input port to a single output port across the switch fabric. In point-to-multipoint transmission a cell is transmitted from a single input to multiple outputs across the switch fabric.
  • each of the designated outputs In order to execute such a transmission, each of the designated outputs must be available to receive the cell from the transmitting input, i.e. , have adequate buffer space. However, the likelihood that each of the designated outputs will be simultaneously prepared to receive the cell when the cell is enqueued decreases as traffic within the switch increases. In some circumstances this may result in delayed transmission. In the worst case, cells will be delayed indefinitely and incoming cells for that connection are discarded. It would therefore be desirable to facilitate transmission by reducing or eliminating delays and cell loss.
  • the ATM switch includes a bandwidth arbiter, a plurality of input ports including one To Switch Port Processor (“TSPP”) per input port and a plurality of output ports.
  • Each input port within the switch includes a switch allocation table ("SAT") which grants bandwidth to connections.
  • Each SAT includes a plurality of sequentially ordered cell time slots and a pointer which is directed to one of the slots.
  • the SAT pointers at each input port are synchronized such that, at any given point in time, each of the pointers is directed to the same slot location in the respective SAT with which the pointer is associated.
  • Each TSPP maintains a list of point-to-point connections, and more particularly maintains one such list for each output port in the switch.
  • the bandwidth arbiter maintains a bit vector for each port indicating requested output ports for transmission of point-to-point cells.
  • 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. Any cell time where the SAT entry is not valid or where the scheduling list does not contain a cell thus represents an unassigned bandwdith opportunity.
  • the switch To execute point-to-point operation the switch employs the point-to-point request bit vectors and round robin operations to grant dynamic bandwidth to point-to-point connections.
  • matches are determined in parallel for each bit in each selected request bit vector and granting is then executed according to a prioritization scheme begining at a first position. Granting opportunities are then provided to the other request bit vectors until granting opportunities have been provided for each request bit vector. A second position indicates an individual bit which receives priority for the granting opportunity. If bandwdith is not granted, granting opportunities are then provided to the other bits in the request bit vector.
  • the first position In the next cell time the first position is then at the next sequential request bit vector relative to the previous cell time if the output port designated by a second position was granted. Otherwise the first position is unchanged. In this manner each TSPP receives equal treatment over time.
  • the bandwidth arbiter To execute point-to-multipoint operation the bandwidth arbiter maintains a list of connections and bit vectors indicating the designated destination ports for a point-to- multipoint cell. The bandwidth arbiter list is then compared to an unassigned output port bit vector generated from the SATs to determine matches therebetween at which point-to- multipoint transmission may be made by utilizing the instantaneously unused bandwidth within the switch. The bandwidth arbiter may also assign priority to connections in the list.
  • the bandwidth arbiter may also include a combined arbiter mechanism for allocating dynamic bandwidth for both point-to-multipoint and point-to-point connections.
  • each type of connection i.e., point-to- multipoint and point-to-point
  • Dynamic bandwidth is then granted in four main steps.
  • dynamic bandwidth is granted to HI priority point-to-multipoint connections in the manner described above.
  • dynamic bandwidth remaining from the first step is granted to the HI priority point-to-point connections in the manner described above.
  • the bandwidth remaining from the second step is granted to the LO priority point-to-multipoint connections.
  • the bandwidth remaining from the third ⁇ tep is granted to the LO priority point-to-point connection ⁇ .
  • Switch efficiency is increased by utilizing instantaneously unused bandwidth.
  • available bandwidth decreases.
  • unutilized bandwidth will be present from time to time, and such bandwidth is wasted if not utilized. Therefore, point- to-point and point-to-multipoint transmissions which would otherwise be dropped are made using the otherwise unutilized bandwidth, and switch efficiency is increased. Such use is made possible by the arbitration techniques which reduce delay.
  • Fig. 1 is a block diagram of a switch which facilitates point-to-multipoint operation
  • Fig. 2 is a block diagram which illustrates operation of the switch allocation tables of Fig. 1;
  • Fig. 3 is a block diagram which illustrates operation of the bandwidth arbiter list
  • Fig. 4 is a flow diagram which illustrates matching between the request bit vectors and the unas ⁇ igned output port bit vector
  • Fig. 5 is a block diagram which illustrates round-robin allocation of bandwidth to TSPP requests
  • Fig. 6 is a flow diagram which illustrates a method of point-to-multipoint bandwidth arbitration
  • Figs. 7 & 8 are block diagrams which illustrates point- to-point bandwidth arbitration
  • Fig. 9 is block diagram which illustrates combined point-to-point and point-to-multipoint bandwidth arbitration; and Figs. 10A and 10B are flow diagrams which illustrate a method for combined point-to-point and point-to-multipoint bandwidth arbitration.
  • 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 ASIC ⁇ 15, a plurality of from switch port processor subsystems ("FSPP") 16, a plurality of To Switch Port Processor ASICs 17, a plurality of multipoint topology controllers (“MTC”) 18 and a plurality of switch allocation tables ("SAT") 20.
  • the NxN switch fabric which may be an ECL crosspoint switch fabric, is used for cell data transport, and yields Nx670 Mbps throughput.
  • the bandwidth arbiter controls switch fabric interconnection dynamically schedules momentarily unused bandwidth and resolves multipoint-to-point bandwidth contention.
  • Each TSPP 14 schedules transmission of cells 22 to the switch fabric from multiple connections. Not shown are the physical line interfaces between the input link and the TSPP 14.
  • 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 16.
  • the switch allocation table controls crossbar input to output mapping, connection bandwidth and the maximum delay through the switch fabric.
  • a cell 22 In order to traverse the switch, a cell 22 first enters the switch through an input port 24 and is buffered in a queue 26 of input buffers. The cell is then transmitted from the input buffer ⁇ to a queue 28 of output buffer ⁇ in an output port. From the output port 30, the cell is transmitted outside of the switch, for example, to another switch.
  • each input port 24 includes a TSPP 14, and each output port 30 includes an FSPP 16.
  • the TSPPs and FSPPs each include cell buffer RAM 32 which is organized into queues 26, 28. All cells in a connection pass through a ⁇ ingle queue at each port, one at the TSPP and one at the FSPP, for the life of the connection.
  • the queue ⁇ thu ⁇ preserve cell ordering by handling only one connection per queue. This strategy al ⁇ o allow ⁇ quality of service (“QoS”) guarantees on a per connection basi ⁇ .
  • QoS quality of service
  • TSPP and FSPP to implement flow control.
  • Flow control prevents cell los ⁇ within the switch, and is performed after arbitration, but before transmission of the data cell.
  • Flow control is implemented on a per connection basi ⁇ .
  • each TSPP within the switch includes an SAT 20 which manages bandwidth allocation.
  • the SAT is the basic mechanism behind cell scheduling.
  • Each SAT 20 includes a plurality of sequentially ordered cell time slots 50 and a pointer 52 which is directed to one of the slots. All of the pointers in the switch are synchronized such that at any given point in time each of the SAT pointers at each input port is directed to the same slot location in the respective SAT with which the pointer is as ⁇ ociated, e.g., the fir ⁇ t slot.
  • the pointers are advanced in lock-step, each slot being active for 32 clock cycles at 50 MHz.
  • the TSPP uses the corresponding entry 51 in the SAT to obtain a cell for launching into the switch fabric 10 and to begin flow control.
  • Each of the counters is incremented once for each cell time, and the pointer returns to the first slot after reaching the last slot.
  • the pointers scan the SAT ⁇ approximately every 6msec, thereby providing a maximum delay for transmi ⁇ sion opportunity of approximately 6msec.
  • the delay can be decreased by duplicating a given entry at a plurality of slots within the SAT.
  • the maximum delay that an incoming cell will experience corresponds to the number of slots between the pointer and the slot containing the entry which specifie ⁇ the destination of the cell.
  • the duplicate entrie ⁇ are therefore preferably spaced equidistantly within the SAT.
  • Maximum delay for transmis ⁇ ion opportunity therefore corresponds to the frequency and spacing of duplicate entries within the SAT.
  • the amount of bandwidth granted to a particular connection corresponds to the frequency at which a given entry appears in the SAT.
  • Each slot 50 provides 64Kbps of bandwidth. Since the pointers cycle through the SATs at a constant rate, the total bandwidth granted to a particular connection is equal to the product of 64Kbps and the number of occurrences of that entry. For example, connection identifier "g (4,6)," which occurs in five slots, is granted 320Kbps of bandwidth.
  • in ⁇ tantaneously unused bandwidth 60 will become available in the switch during operation. Such instantaneously unused bandwidth may occur because that bandwidth, i.e., that entry in the SAT, has not been allocated to any connection. Such bandwidth is referred to a ⁇ "unallocated bandwidth.” In ⁇ tantaneously unused bandwidth may also occur when the SAT entry is allocated to a connection, but the connection does not have a cell enqueued for transmission across the switch. Such bandwidth is referred to a ⁇ "unused-allocated" bandwidth. Both type ⁇ of bandwidth are collectively referred to as "dynamic" bandwidth, and some connections, such a ⁇ connections as ⁇ igned an Available Bit Rate (“ABR") QoS level utilize ⁇ uch dynamic bandwidth. The bandwidth arbiter operate ⁇ to increa ⁇ e efficiency within the switch by granting dynamic bandwidth to such connections.
  • ABR Available Bit Rate
  • a connection has no allocated bandwidth, or if the arriving cell rate is greater than the allocated rate as indicated by an input queue threshold, dynamic bandwidth may be employed.
  • the point-to-multipoint transmission described in the SAT entry 51 is entered into a list 53 maintained by the bandwidth arbiter as a "request" in order that the point-to- multipoint transmi ⁇ sion can be made at the next available opportunity.
  • the list 53 maintained by the bandwidth arbiter includes two fields for storing point-to-multipoint transmissions which utilize dynamic bandwidth.
  • a connection identifier field 56 is employed to store the connection identifier, e.g., "a,” and hence also indicates the port of origin.
  • a bit vector field 58 is employed to indicate the designated output port ⁇ for transmission.
  • the bit vector field is a bit mask which, in the case of an 8X8 switch, includes eight bits, each bit corresponding to a specific output port.
  • the list 53 contains "00000110" in the bit vector field (where the port numbers start from “1” rather than "0") .
  • the logic "1" values in the bit vector field indicate destination output ports "2" and “3,” and the logic "0" values indicate non- destination output ports.
  • the connections and bit vectors in the list 53 are entered ⁇ equentially in the order in which they are received.
  • point-to-multipoint connection ⁇ can be divided into ⁇ ub ⁇ ets.
  • the point-to- multipoint bit vector lookup would have an additional identifier indicating which subset to transfer the cell to.
  • the lists maintained at the bbandw3dith arbiter and TSPP would then contain both the connection identifier and the subset identifier.
  • the sub ⁇ et identifier i ⁇ called a ⁇ ubqueue.
  • connection identifier 56 and bit vector 58 corresponding to "a (2,3)" is entered into the list 53 so that the cell will be transmitted when a dynamic bandwidth opportunity become ⁇ available for ⁇ imultaneou ⁇ tran ⁇ mi ⁇ ion to each output port designated by the request.
  • the bandwidth arbiter first calculates an unassigned output port bit vector by ORing all allocated bit vectors from the SAT and toggling each resultant bit to provide a single unassigned output port bit vector.
  • the unassigned output port bit vector is then matched against each request. For a particular input port the entered requests are tested in parallel for a match, and for simplification matching may be made against only the first four requests in the list. If all of the bits in a request match the unassigned bit vector, a match is made.
  • a prioritization technique may be used in conjunction with the matching operation in the bandwidth arbiter in order to support switch traffic having different priority levels, such as QoS levels.
  • priority levels could be HI and LO levels, or include greater than two levels.
  • the bandwidth arbiter attempts to match higher priority requests before attempting to match lower priority request ⁇ . Since the unassigned bit vector contains les ⁇ unassigned bits as each sub ⁇ equent match i ⁇ made, the higher priority requests are then more likely to obtain a match and be transmitted than the lower priority requests. This higher likelihood for a match translates into a quicker response and greater bandwidth for such higher priority connection ⁇ .
  • the bandwidth arbiter may grant bandwidth to requesting TSPPs by attempting to match available bandwidth on a round-robin basis.
  • a pointer 67 is employed to select a TSPP with which matches are first attempted, e.g., TSPP i + 1.
  • HI and LO prioritization When HI and LO prioritization is employed, separate HI and LO round-robin operations are executed to grant bandwidth. Each of the round-robin operations operates in the same fashion, but matching is not attempted on the LO priority requests until a match has been attempted with each of the HI priority request ⁇ . Hence, a ⁇ eparate round robin operation i ⁇ executed for each priority level.
  • Fig. 6 illu ⁇ trate ⁇ a method of point-to-multipoint arbitration.
  • a bit vector representation of the SAT entry is entered 68 into the li ⁇ t as a connection identifier and output bit vector.
  • the allocated bit vector ⁇ are ORed and u ⁇ ed to generate 70 the unassigned bit vector.
  • An attempt is then made to match 72 the unassigned bit vector with request N in the list, where N is the oldest request in the list. If no match is made, N is incremented 74 and an attempt is made to match the unassigned bit vector with request N+l, i.e., the next oldest request in the list.
  • bit vector of the matched request is subtracted 76 from the unassigned bit vector to provide an updated unassigned bit vector.
  • the cell corresponding to the matched request is then transmitted 78, and a determination 80 is made a ⁇ to whether the end of the list maintained by the bandwidth arbiter has been reached. Flow ends if the end of the list has been reached, i.e., an attempt ha ⁇ been made to match the una ⁇ signed bit vector with each request in the list. If the end of the list has not been reached, N is incremented, and an attempt is made to match the next oldest request in the list with the una ⁇ signed bit vector.
  • the bandwidth arbiter 12 may also be employed to grant dynamic bandwidth for point-to- point tran ⁇ mission.
  • Each point-to-point transmission is made from a single input port to a single output port.
  • each TSPP 14 includes a connection list 82 corre ⁇ ponding to each output port in the switch, i.e., one connection li ⁇ t per output port, and the bandwidth arbiter includes a point-to-point request bit vector 84 corresponding to each TSPP in the switch, i.e., one request bit vector per TSPP.
  • connection lists which may be 16,384 deep, include a list of connections having cells enqueued for point-to-point transmission to the output port with which the connection list is associated.
  • Each request bit vector is a per-TSPP bitmask which indicate ⁇ with a logic "1" to which output port each individual TSPP i ⁇ reque ⁇ ting to transmit.
  • the connection lists and request bit vectors are employed to track the output ports for which cells are enqueued in each TSPP, and grant bandwidth based upon that information.
  • the point-to-point request bit vectors are set in response to signals from the TSPPs.
  • connection associated with that cell is loaded into the TSPP connection list and the TSPP send ⁇ a reque ⁇ t message 86 to the bandwidth arbiter containing a request to transmit to the output port specified by the connection.
  • connection "a" when connection "a" is enqueued in connection li ⁇ t 1, TSPP 0 transmits a request message to the bandwidth arbiter, and in response to the request message the bandwidth arbiter sets bit 1 of request bit vector 0 to a logic "1."
  • the bandwidth arbiter sets bit 1 of request bit vector 0 to a logic "1."
  • the bandwidth arbiter ⁇ et ⁇ the bit a ⁇ sociated with the request to a logic "0."
  • the Drop Request message is not sent to the bandwidth arbiter, and the request remain ⁇ in effect for the next enqueued connection.
  • the bandwidth arbiter employ ⁇ the point-to-point request bit vectors and nested round robin operations to grant dynamic bandwidth to point-to-point connections.
  • matches are determined in parallel for each bit in each selected request bit vector and granting is then executed according to a prioritization scheme begining at a first position such as po ⁇ ition 90. Granting opportunities are then provided to the other request bit vectors until granting opportunities have been provided for each request bit vector.
  • a second position 92 indicates an individual bit within the selected request bit vector which receives priority for the granting opportunity. If bandwdith is not granted, granting opportunities are then provided to the other bits in the request bit vector.
  • each TSPP receives equal treatment over time.
  • the bandwidth arbiter may include a combined arbiter mechanism for granting dynamic bandwidth for both point-to-multipoint and point-to-point connections.
  • both point-to- multipoint and point-to-point are prioritized into at least two levels of priority such as HI and LO.
  • Dynamic bandwidth is then granted in four main steps.
  • a first step 94 dynamic bandwidth is granted to HI priority point-to- multipoint connections in the manner de ⁇ cribed with re ⁇ pect to Figs. 1-6 above.
  • the dynamic bandwidth remaining from the first step is granted to the HI priority point-to-point connection ⁇ in the manner described with respect to Figs. 7-8 above.
  • a third step 98 the bandwidth remaining from the ⁇ econd ⁇ tep is granted to the LO priority point-to-multipoint connection ⁇ .
  • a fourth step 100 the bandwidth remaining from the third step is granted to the LO priority point-to-point connections.
  • Figs. 10A and 10B illustrate a method for allocating dynamic bandwidth to both point-to-multipoint and point-to- point connections.
  • a first matching step 102 an attempt is made to match the first HI priority point-to-multipoint request with the unas ⁇ igned output port bit vector representing unassigned output ports, i.e., dynamic bandwidth. If no match i ⁇ made, flow continue ⁇ to ⁇ tep 104 to determine if the end of the point-to-multipoint HI priority list has been reached. If a match is found in step 102, the HI priority point-to-multipoint cell bit vector is subtracted 106 from the una ⁇ signed output port bit vector and the cell is transmitted 108. Flow then continues to step 104. If the end of the list has not been reached, then flow continues to step 110 where the next request is loaded, and flow continue ⁇ at ⁇ tep 102. If the end of the li ⁇ t has been reached, flow continue ⁇ to a second matching step 112.
  • step 112 an attempt i ⁇ made to match the first HI priority point-to-point cell indicated by the first and second pointers. If no match i ⁇ made, flow continue ⁇ to step 114 where a determination is made whether an attempt ha ⁇ been made with each bit in the point-to-point request bit vector for the TSPP indicated by the first pointer. If each bit has not been tested, the second pointer is incremented 116 and flow continues to step 112. If a match is made in step 112, the selected bit is subtracted 118 from the unassigned output port bit vector and the cell is transmitted 120. The first pointer is then incremented 122. A determination is then made in step 124 whether each TSPP has been tested for matches. If not, flow return ⁇ to step 112. If each TSPP has been te ⁇ ted, flow continues to ⁇ tep 126 where the first and second pointers are reset in accordance with the no starvation policy above.
  • step 126 the LO priority point-to-multipoint requests are tested for matche ⁇ .
  • a third matching ⁇ tep 128 an attempt is made to match the first LO priority point- to-multipoint request with the unas ⁇ igned output port bit vector representing una ⁇ igned output ports, i.e., dynamic bandwidth. If no match i ⁇ made, flow continue ⁇ to ⁇ tep 130 to determine if the end of the point-to-multipoint LO priority list has been reached. If a match is found in step 128, the HI priority point-to-multipoint cell bit vector is subtracted 132 from the una ⁇ signed output port bit vector and the cell is transmitted 134. Flow then continues to step 130.
  • step 136 If the end of the li ⁇ t ha ⁇ not been reached, then flow continues to step 136 where the next request i ⁇ loaded, and flow continue ⁇ at ⁇ tep 128. If the end of the li ⁇ t ha ⁇ been reached, flow continues to a fourth matching step 138.
  • step 138 an attempt is made to match the first LO priority point-to-point cell indicated by the first and ⁇ econd pointers. If no match is made, flow continues to step 140 where a determination is made whether an attempt has been made with each bit in the point-to-point request bit vector for the TSPP indicated by the first pointer. If each bit has not been tested, the second pointer is incremented 142 and flow continues to step 138. If a match is made in step 138, the selected bit is subtracted 144 from the unassigned output port bit vector and the cell is transmitted 146. The fir ⁇ t pointer i ⁇ then incremented 148. A determination i ⁇ then made in ⁇ tep 150 whether each TSPP has been tested for matches.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Physics & Mathematics (AREA)
  • Computer Security & Cryptography (AREA)
  • Mathematical Physics (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 porte sur un commutateur de mode de transfert asynchrone et le procédé associé facilitant l'arbitrage des priorités lors de transmissions de point à point ou de point à plusieurs points. Pour exécuter les opérations de point à plusieurs points, un arbitre de largeur de bande (12) conserve une première liste de connexions et des vecteurs binaires indiquant des ports de destination attribués. La liste conservée par l'arbitre de largeur de bande est alors comparée à un vecteur binaire de port de sortie non attribué pour déterminer les correspondances entre eux pour lesquels la transmission de point à plusieurs points peut avoir lieu en utilisant la largeur de bande momentanément inutilisée du commutateur (18). Pour exécuter les opérations de point à point, chacun des ports d'entrée conserve une liste de connexions associées avec chacun des ports de sortie, et ces listes sont utilisées en conjonction avec les demandes d'informations des ports de sortie pour chacun des port d'entrée de l'arbitre de largeur de bande afin de correspondre aux demandes du vecteur binaire vers le port de sortie non attribué. L'arbitre de largeur de bande peut également attribuer des priorités de connexions à l'intérieur de la liste.
PCT/US1996/011945 1995-07-19 1996-07-18 Arbitrage des priorites lors de transmissions de point a point ou de point a plusieurs points Ceased WO1997004565A1 (fr)

Priority Applications (3)

Application Number Priority Date Filing Date Title
JP9506882A JPH11510011A (ja) 1995-07-19 1996-07-18 ポイントツーポイント及びマルチポイント伝送用優先度アービトレーション
AU65026/96A AU6502696A (en) 1995-07-19 1996-07-18 Priority arbitration for point-to-point and multipoint transmission
PCT/US1996/011945 WO1997004565A1 (fr) 1995-07-19 1996-07-18 Arbitrage des priorites lors de transmissions de point a point ou de point a plusieurs points

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/011945 WO1997004565A1 (fr) 1995-07-19 1996-07-18 Arbitrage des priorites lors de transmissions de point a point ou de point a plusieurs points

Publications (2)

Publication Number Publication Date
WO1997004565A1 true WO1997004565A1 (fr) 1997-02-06
WO1997004565A9 WO1997004565A9 (fr) 1997-08-28

Family

ID=38659713

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/US1996/011945 Ceased WO1997004565A1 (fr) 1995-07-19 1996-07-18 Arbitrage des priorites lors de transmissions de point a point ou de point a plusieurs points

Country Status (3)

Country Link
JP (1) JPH11510011A (fr)
AU (1) AU6502696A (fr)
WO (1) WO1997004565A1 (fr)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5448559A (en) * 1993-05-07 1995-09-05 Roke Manor Research Limited ATM communication system with interrogation of output port servers for available handing capacity
US5475679A (en) * 1994-12-08 1995-12-12 Northern Telecom Limited Large capacity ATM switch
US5577035A (en) * 1994-03-23 1996-11-19 Roke Manor Research Limited Apparatus and method of processing bandwidth requirements in an ATM switch

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5448559A (en) * 1993-05-07 1995-09-05 Roke Manor Research Limited ATM communication system with interrogation of output port servers for available handing capacity
US5577035A (en) * 1994-03-23 1996-11-19 Roke Manor Research Limited Apparatus and method of processing bandwidth requirements in an ATM switch
US5475679A (en) * 1994-12-08 1995-12-12 Northern Telecom Limited Large capacity ATM switch

Also Published As

Publication number Publication date
AU6502696A (en) 1997-02-18
JPH11510011A (ja) 1999-08-31

Similar Documents

Publication Publication Date Title
US5956342A (en) Priority arbitration for point-to-point and multipoint transmission
EP0872089B1 (fr) Planificateur pour commutateur de paquets de donnees
EP0817436B1 (fr) Système de communication à commutation par paquets
US6434155B1 (en) Weighted round robin engine used in scheduling the distribution of ATM cells
US6768717B1 (en) Apparatus and method for traffic shaping in a network switch
US20040151197A1 (en) Priority queue architecture for supporting per flow queuing and multiple ports
EP1111851B1 (fr) Système ordonnanceur pour l'ordonnancement de cellules ATM
EP0839422B1 (fr) Structures de listes enchainees pour niveaux multiples de commande dans un commutateur mta
EP0839420A4 (fr) Gestion de largeurs de bande attribuees et dynamiques
WO1997024904A1 (fr) Appareil de commutation
WO1997004565A1 (fr) Arbitrage des priorites lors de transmissions de point a point ou de point a plusieurs points
WO1997004562A1 (fr) Arbitrage pour transmission en point-a-multipoint
JPH11510009A (ja) 割付型並びに動的交換機フロー制御
EP0817434B1 (fr) Système de communication et procédé de mise en forme du trafic
WO1997004565A9 (fr) Arbitrage des priorites lors de transmissions de point a point ou de point a plusieurs points
JP4504606B2 (ja) ネットワークスイッチにおいてトラフィックを成形する装置及び方法
WO1997004561A1 (fr) Ordonnancement des liaisons
WO1997004542A2 (fr) Arbitrage multipoint a point dans un commutateur de reseau
JPH11510324A (ja) ペースカウンタを用いた帯域幅割付けの制御
JPH11510327A (ja) 非同期転送モードベースドサービス統合交換機
WO1997004541A2 (fr) Traitement des echos multipoint-a-multipoint dans un commutateur de reseau possedant des files d'attente de mise en memoire tampon de donnees

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A1

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

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

121 Ep: the epo has been informed by wipo that ep was designated in this application
CFP Corrected version of a pamphlet front page

Free format text: REVISED ABSTRACT RECEIVED BY THE INTERNATIONAL BUREAU AFTER COMPLETION OF THE TECHNICAL PREPARATIONS FOR INTERNATIONAL PUBLICATION

DFPE Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101)
COP Corrected version of pamphlet

Free format text: PAGES 1/10-10/10,DRAWINGS,REPLACED BY NEW PAGES BEARING THE SAME NUMBER;DUE TO LATE TRANSMITTAL BY THE RECEIVING OFFICE

ENP Entry into the national phase

Ref country code: JP

Ref document number: 1997 506882

Kind code of ref document: A

Format of ref document f/p: F

REG Reference to national code

Ref country code: DE

Ref legal event code: 8642

122 Ep: pct application non-entry in european phase
NENP Non-entry into the national phase

Ref country code: CA