US5764636A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Color blocking logic mechanism for a high-performance network switch
Assignee: Cisco Technology Inc
•
Filing: 1996-03-28
•
Granted: 1998-06-09
•
Expires: 2016-03-28
Abstract
Abstract A color blocking logic (CBL) mechanism implements spanning tree states with respect to data frames transported between port interface circuitry over a link connecting different switches in a network. Each port interface circuit preferably supports multiple virtual local area network (VLAN) designations and associates those VLAN designations with data frames transmitted to and from the switch over the link. The CBL mechanism cooperates with a forwarding engine of the switch to selectively enable the port interface circuit to receive certain VLAN-designated frames, and to discard others, in an efficient and cost-effective manner.
Inventors
- 👤 Tom Edsall
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-28 16:53
CPC Classifications
H; H04; H04L; H04L12/00; H04L12/28; H04L12/46; H04L12/4641; H04L45/00; H04L45/48; H04L45/76
Claims Analysis
Total Claims: 23
Claim 1
Independent Claim
173 words
A mechanism for dynamically implementing spanning tree states with respect to data frames transported over a bus to port interface circuitry connecting a plurality of switches in a network via a link, the port interface circuitry supporting multiple virtual local area network (VLAN) designations, the mechanism comprising: a memory table having a plurality of entries, each entry containing a binary-encoded value representing a predetermined spanning tree state of the port interface circuitry for each VLAN designation; a state machine coupled between the bus and the memory table, the state machine extracting certain information from a current data frame and manipulating that information to form an address for accessing the memory table; and a port state decoder coupled to memory table for receiving the binary-encoded value addressed by the manipulated information, the decoder generating control signals corresponding to the predetermined spanning tree state in response to the binary-encoded value, whereby the control signals are provided to the port interface circuitry to implement the predetermined spanning tree state with respect to the current data frame.
Claim 2
Dependent Claim
173 words
A mechanism for dynamically implementing spanning tree states with respect to data frames transported over a bus to port interface circuitry connecting a plurality of switches in a network via a link, the port interface circuitry supporting multiple virtual local area network (VLAN) designations, the mechanism comprising: a memory table having a plurality of entries, each entry containing a binary-encoded value representing a predetermined spanning tree state of the port interface circuitry for each VLAN designation; a state machine coupled between the bus and the memory table, the state machine extracting certain information from a current data frame and manipulating that information to form an address for accessing the memory table; and a port state decoder coupled to memory table for receiving the binary-encoded value addressed by the manipulated information, the decoder generating control signals corresponding to the predetermined spanning tree state in response to the binary-encoded value, whereby the control signals are provided to the port interface circuitry to implement the predetermined spanning tree state with respect to the current data frame.
Claim 3
Dependent Claim
52 words
The mechanism of claim 1 wherein the certain information comprises the contents of (i) a color field of the current data frame and (ii) a bridge protocol data unit (BPDU) field of the current data frame, and wherein the contents of the color and BPDU fields are concatentated to form the address.
Claim 4
Dependent Claim
22 words
The mechanism of claim 1 wherein the predetermined spanning tree state is one of a forwarding, learning, blocking, listening and disabling state.
Claim 5
Dependent Claim
41 words
The mechanism of claim 2 wherein the memory table is effectively divided into two halves by the contents of the BPDU field such that the binary-encoded value comprises the contents of a memory table entry from each half of the table.
Claim 6
Dependent Claim
21 words
The mechanism of claim 4 wherein the contents of each memory table entry comprises a first bit and a second bit.
Claim 7
Dependent Claim
28 words
The mechanism of claim 5 wherein the port state decoder comprises an arrangement of logic gates responsive to the first and second bits of each memory table entry.
Claim 8
Dependent Claim
12 words
The mechanism of claim 6 wherein the logic gates are OR gates.
Claim 9
Dependent Claim
136 words
Apparatus for dynamically implementing a spanning tree state with respect to a data frame transported over a switching bus to a plurality of network switches via a link, the apparatus comprising: port interface circuitry coupled between the switching bus and link, the port interface circuitry supporting multiple virtual local area network (VLAN) designations; a forwarding engine comprising (i) an address recognition logic circuit, coupled to the switching bus, for executing forwarding operations for the data frame transported over the switching bus and (ii) a target logic circuit, coupled to the port interface circuitry, for implementing those forwarding operations; and means, cooperatively coupled to the target logic circuit, for selectively enabling the port interface circuitry to one of receive and discard the data frame to thereby implement the spanning tree state with respect to the data frame.
Claim 10
Dependent Claim
136 words
Apparatus for dynamically implementing a spanning tree state with respect to a data frame transported over a switching bus to a plurality of network switches via a link, the apparatus comprising: port interface circuitry coupled between the switching bus and link, the port interface circuitry supporting multiple virtual local area network (VLAN) designations; a forwarding engine comprising (i) an address recognition logic circuit, coupled to the switching bus, for executing forwarding operations for the data frame transported over the switching bus and (ii) a target logic circuit, coupled to the port interface circuitry, for implementing those forwarding operations; and means, cooperatively coupled to the target logic circuit, for selectively enabling the port interface circuitry to one of receive and discard the data frame to thereby implement the spanning tree state with respect to the data frame.
Claim 11
Dependent Claim
38 words
The apparatus of claim 8 wherein the selectively enabling means comprises a memory table having a plurality of entries, each containing a binary-encoded value representing a spanning tree state of the port interface circuitry for each VLAN designation.
Claim 12
Dependent Claim
47 words
The apparatus of claim 9 wherein the selectively enabling means further comprises a state machine coupled between the switching bus and the memory table, the state machine extracting certain information from the data frame and manipulating that information to form an address for accessing the memory table.
Claim 13
Dependent Claim
47 words
The apparatus of claim 10 wherein the selectively enabling means further comprises a port state decoder coupled to memory table for receiving the binary-encoded value addressed by the manipulated information, the decoder generating control signals corresponding to the spanning tree state in response to the binary-encoded value.
Claim 14
Dependent Claim
18 words
The apparatus of claim 11 wherein the contents of each memory table entry comprises a plurality of bits.
Claim 15
Dependent Claim
22 words
The apparatus of claim 12 wherein the port state decoder comprises an arrangement of logic gates responsive to the table entry bits.
Claim 16
Dependent Claim
59 words
The apparatus of claim 13 wherein one of the table entry bits is a mask bit that is provided to one of the logic gates along with a port select signal from the target logic circuit, and wherein the mask bit, when asserted, blocks the port select signal thereby forcing the port interface circuitry to discard the data frame.
Claim 17
Dependent Claim
37 words
The apparatus of claim 13 further comprising a local arbiter coupled to the port interface circuitry, the local arbiter generating a bus grant signal in response to the port interface circuitry successfully arbitrating for the switching bus.
Claim 18
Dependent Claim
61 words
The apparatus of claim 15 wherein one of the table entry bits is a mask bit that is provided to one of the logic gates along with the bus grant signal from the local arbiter, and wherein the output of the one logic gate is a flush signal that, when asserted, directs the port interface circuitry to discard the data frame.
Claim 19
Dependent Claim
53 words
The apparatus of claim 15 wherein one of the table entry bits is provided to one of the logic gates along with the bus grant signal from the local arbiter, and wherein the output of the one logic gate is an abort signal that, when asserted, aborts an operation of the forwarding engine.
Claim 20
Independent Claim
132 words
A method for dynamically implementing a spanning tree state with respect to a data frame transported over a switching bus to port interface circuitry connecting a plurality of network switches via a link, the port interface circuitry supporting multiple virtual local area network (VLAN) designations, the method comprising the steps of: A. executing forwarding operations for the data frame at an address recognition logic circuit of a forwarding engine; B. implementing those forwarding operations with the port interface circuitry coupled to a target logic circuit of the forwarding engine; C. selectively enabling the port interface circuitry to one of receive and discard the data frame using a color blocking logic (CBL) circuit cooperatively coupled to the target logic circuit to thereby implement the spanning tree state with respect to the data frame.
Claim 21
Independent Claim
132 words
A method for dynamically implementing a spanning tree state with respect to a data frame transported over a switching bus to port interface circuitry connecting a plurality of network switches via a link, the port interface circuitry supporting multiple virtual local area network (VLAN) designations, the method comprising the steps of: A. executing forwarding operations for the data frame at an address recognition logic circuit of a forwarding engine; B. implementing those forwarding operations with the port interface circuitry coupled to a target logic circuit of the forwarding engine; C. selectively enabling the port interface circuitry to one of receive and discard the data frame using a color blocking logic (CBL) circuit cooperatively coupled to the target logic circuit to thereby implement the spanning tree state with respect to the data frame.
Claim 22
Dependent Claim
74 words
The method of claim 18 wherein step C comprises the steps of: C1. extracting certain information from the data frame using a state machine of the CBL circuit; and C2. manipulating the certain information to form an address for accessing a memory table of the CBL circuit, the memory table having a plurality of entries, each containing a binary-encoded value representing a spanning tree state of the port interface circuitry for each VLAN designation.
Claim 23
Dependent Claim
58 words
The method of claim 19 wherein step C further comprises the steps of: C3. providing the binary-encoded value addressed by the manipulated information from the memory table to a port state decoder of the CBL circuit; and C4. generating control signals corresponding to the spanning tree state at the port state decoder in response to the binary-encoded value.
References Cited (Backward Citations)
US4597078A
Cited
US4627052A
Cited
US4823338A
Cited
US4823338B1
Cited
US5280480A
Cited
US5490252A
Cited
US5394402A
Cited
US5606669A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2001-06-08 | 2001-12-08 | 2002-06-09 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2005-06-08 | 2005-12-08 | 2006-06-09 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2009-06-08 | 2009-12-08 | 2010-06-09 | $7700.00 | Window Closed / Lapsed |