US5933429A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Multipoint-to-multipoint echo processing in a network switch
Assignee: Fujitsu Ltd
•
Filing: 1997-04-29
•
Granted: 1999-08-03
•
Expires: 2017-04-29
Abstract
Abstract An apparatus and a method are disclosed for unencumbering valuable switching resources in a network switch involved in a multipoint-to-multipoint switching scenario. The network switch includes an input processing port that is connected to a plurality of input links, and an output processing port that is connected to a plurality of output links. A data cell received on an input link is processed by the input processing port by appending a link number, a port number, and a connection identification code associated with the input processing port to the data cell. The data cell is then transferred to the output processing port where it is processed by comparing the appended link number, port number, and connection identification code with those associated with the output processing port. The data cell is then stored in a data buffering queue in the output processing port according to a matching scheme.
Inventors
- 👤 Richard G. Bubenik
- 👤 Stephen A. Caldara
- 👤 Stephen A. Hauser
- 👤 Thomas A. Manning
- 👤 Stephen R. Veit
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-06 03:13
CPC Classifications
H; H04; H04L; H04L47/00; H04L47/10; H04L47/18; G; G06; G06F; G06F15/00; G06F15/16; G06F15/163; G06F15/173; G06F15/17356; G06F15/17368; G06F15/17375; H04L12/00; H04L12/28; H04L12/46; H04L12/4604; H04L12/4608; H04L12/54; H04L12/56; H04L12/5601; H04L12/5602; H04L12/64; H04L12/6402; H04L41/00; H04L41/08; H04L41/0896; H04L47/11; H04L47/15; H04L47/16; H04L47/26; H04L47/266; H04L47/29; H04L47/30; H04L47/50; H04L47/52; H04L47/521; H04L47/522; H04L47/525; H04L47/56; H04L47/62; H04L47/621; H04L47/6215; H04L47/622; H04L47/6225; H04L47/625; H04L47/627; H04L47/70; H04L47/72; H04L47/722; H04L47/74; H04L47/743; H04L47/745; H04L47/76; H04L47/762; H04L47/78; H04L47/782; H04L47/80; H04L47/805; H04L47/82; H04L47/822; H04L49/00; H04L49/10; H04L49/101; H04L49/103; H04L49/104; H04L49/105; H04L49/106; H04L49/107; H04L49/108; H04L49/15; H04L49/1515; H04L49/153; H04L49/1553; H04L49/1576; H04L49/20; H04L49/201; H04L49/203; H04L49/205; H04L49/25; H04L49/253; H04L49/254; H04L49/255; H04L49/256; H04L49/30; H04L49/3009; H04L49/3081; H04L49/309; H04L49/45; H04L49/455; H04L49/50; H04L49/501; H04L49/503; H04L49/505; H04L49/506; H04L49/55; H04L49/552; H04L49/90; H04L49/901; H04L49/9047; H04L49/9063; H04L49/9078; H04L69/00; H04L69/30; H04L69/32; H04L69/322; H04L69/324; H04Q; H04Q11/00; H04Q11/04; H04Q11/0428; H04Q11/0478; H04W; H04W28/00; H04W28/02; H04W28/10; H04W28/14; H04J; H04J3/00; H04J3/02; H04J3/06; H04J3/0635; H04J3/0682; H04J3/0685; H04L2012/5614; H04L2012/5616; H04L2012/5625; H04L2012/5627; H04L2012/5628; H04L2012/5629; H04L2012/5631; H04L2012/5632; H04L2012/5634; H04L2012/5635; H04L2012/5638; H04L2012/564; H04L2012/5642; H04L2012/5643; H04L2012/5646; H04L2012/5647; H04L2012/5648; H04L2012/5649; H04L2012/565; H04L2012/5651; H04L2012/5652; H04L2012/5672; H04L2012/5678; H04L2012/5679; H04L2012/5681; H04L2012/5682; H04L2012/5683; H04L2012/5684; H04L2012/5685; H04L41/0897; H04L41/40; H04L49/508; H04L49/555; H04L7/00; H04L7/04; H04L7/041; H04L7/046; Y; Y10; Y10S; Y10S370/00; Y10S370/901; Y10S370/902; Y10S370/903; Y10S370/905
Claims Analysis
Total Claims: 12
Claim 1
Independent Claim
228 words
A method for unencumbering valuable switching resources in a network switch, wherein said network switch has an input processing port and an output processing port connected to a plurality of links and having a plurality of data buffering queues, wherein each of said data buffering queues has a connection identification code, and wherein said data buffering queues in said output processing port have a data cell processing code, said method comprising the steps of: receiving a data cell at an output processing port, said data cell containing a link number indicating an input link where said data cell arrived, a port number indicating an input processing port where said data cell was received, and a connection identification code associated with a data buffering queue in said input processing port where said data cell was buffered; comparing said link number to a link number of a link connected to said output processing port, said port number to a port number of said output processing port, and said connection identification code to a connection identification code associated with a data buffering queue in said output processing port; and storing said data cell in said data buffering queue in said output processing port according to a matching scheme between said link numbers, said port numbers, and said connection identification codes as dictated by the value of said data cell processing code.
Claim 2
Independent Claim
228 words
A method for unencumbering valuable switching resources in a network switch, wherein said network switch has an input processing port and an output processing port connected to a plurality of links and having a plurality of data buffering queues, wherein each of said data buffering queues has a connection identification code, and wherein said data buffering queues in said output processing port have a data cell processing code, said method comprising the steps of: receiving a data cell at an output processing port, said data cell containing a link number indicating an input link where said data cell arrived, a port number indicating an input processing port where said data cell was received, and a connection identification code associated with a data buffering queue in said input processing port where said data cell was buffered; comparing said link number to a link number of a link connected to said output processing port, said port number to a port number of said output processing port, and said connection identification code to a connection identification code associated with a data buffering queue in said output processing port; and storing said data cell in said data buffering queue in said output processing port according to a matching scheme between said link numbers, said port numbers, and said connection identification codes as dictated by the value of said data cell processing code.
Claim 3
Dependent Claim
39 words
The method as defined in claim 1, wherein said matching scheme requires that said link numbers, said port numbers, and said connection identification codes match in order for said data cell to be stored in said data buffering queue.
Claim 4
Dependent Claim
41 words
The method as defined in claim 1, wherein said matching scheme requires that said link numbers, said port numbers, and said connection identification codes do not match in order for said data cell to be stored in said data buffering queue.
Claim 5
Independent Claim
206 words
A method for unencumbering valuable switching resources in a network switch, wherein said network switch has an input processing port and an output processing port connected to a plurality of links and having a plurality of data buffering queues, wherein each of said data buffering queues has a connection identification code, and wherein said data buffering queues in said output processing port have a data cell processing code, said method comprising the steps of: receiving a data cell at an output processing port, said data cell containing a link number indicating an input link where said data cell arrived, a port number indicating an input processing port where said data cell was received, and a connection identification code associated with a data buffering queue in said input processing port where said data cell was buffered; and processing said data cell according to a matching scheme, as dictated by the value of said data cell processing code, between said link number and a link number of a link connected to said output processing port, said port number and a port number of said output processing port, and said connection identification code and a connection identification code associated with a data buffering queue in said output processing port.
Claim 6
Independent Claim
206 words
A method for unencumbering valuable switching resources in a network switch, wherein said network switch has an input processing port and an output processing port connected to a plurality of links and having a plurality of data buffering queues, wherein each of said data buffering queues has a connection identification code, and wherein said data buffering queues in said output processing port have a data cell processing code, said method comprising the steps of: receiving a data cell at an output processing port, said data cell containing a link number indicating an input link where said data cell arrived, a port number indicating an input processing port where said data cell was received, and a connection identification code associated with a data buffering queue in said input processing port where said data cell was buffered; and processing said data cell according to a matching scheme, as dictated by the value of said data cell processing code, between said link number and a link number of a link connected to said output processing port, said port number and a port number of said output processing port, and said connection identification code and a connection identification code associated with a data buffering queue in said output processing port.
Claim 7
Dependent Claim
43 words
The method as defined in claim 4, wherein said step of processing said data cell comprises storing said data cell in said data buffering queue in said output processing port when said link numbers, said port numbers, and said connection identification codes match.
Claim 8
Dependent Claim
45 words
The method as defined in claim 4, wherein said step of processing said data cell comprises storing said data cell in said data buffering queue in said output processing port when said link numbers, said port numbers, and said connection identification codes do not match.
Claim 9
Dependent Claim
297 words
A network switch that is capable of unencumbering valuable switching resources within the network switch, said network switch comprising: a switch fabric; an input processing port connected between a plurality of input links and said switch fabric and having a plurality of data buffering queues, wherein each of said data buffering queues has a connection identification code, wherein said input processing port processes a data cell received on one of said plurality of input links by appending to said data cell a link number indicating an input link where said data cell arrived, a port number indicating said input processing port, and a connection identification code associated with a data buffering queue in said input processing port where said data cell will be buffered; and an output processing port connected between said switch fabric and a plurality of output links and having a plurality of data buffering queues, wherein each of said data buffering queues has a connection identification code, wherein said data buffering queues in said output processing port have a data cell processing code, wherein said output processing port processes a data cell processed by said input processing port and transferred to said output processing port through said switch fabric by comparing said link number to a link number of a link connected to said output processing port, said port number to a port number of said output processing port, and said connection identification code to a connection identification code associated with a data buffering queue in said output processing port, and then storing said data cell in said data buffering queue in said output processing port according to a matching scheme between said link numbers, said port numbers, and said connection identification codes as dictated by the value of said data cell processing code.
Claim 10
Dependent Claim
297 words
A network switch that is capable of unencumbering valuable switching resources within the network switch, said network switch comprising: a switch fabric; an input processing port connected between a plurality of input links and said switch fabric and having a plurality of data buffering queues, wherein each of said data buffering queues has a connection identification code, wherein said input processing port processes a data cell received on one of said plurality of input links by appending to said data cell a link number indicating an input link where said data cell arrived, a port number indicating said input processing port, and a connection identification code associated with a data buffering queue in said input processing port where said data cell will be buffered; and an output processing port connected between said switch fabric and a plurality of output links and having a plurality of data buffering queues, wherein each of said data buffering queues has a connection identification code, wherein said data buffering queues in said output processing port have a data cell processing code, wherein said output processing port processes a data cell processed by said input processing port and transferred to said output processing port through said switch fabric by comparing said link number to a link number of a link connected to said output processing port, said port number to a port number of said output processing port, and said connection identification code to a connection identification code associated with a data buffering queue in said output processing port, and then storing said data cell in said data buffering queue in said output processing port according to a matching scheme between said link numbers, said port numbers, and said connection identification codes as dictated by the value of said data cell processing code.
Claim 11
Dependent Claim
43 words
The network switch as defined in claim 7, wherein said output processing port matching scheme requires that said link numbers, said port numbers, and said connection identification codes match in order for said data cell to be stored in said data buffering queue.
Claim 12
Dependent Claim
45 words
The network switch as defined in claim 7, wherein said output processing port matching scheme requires that said link numbers, said port numbers, and said connection identification codes do not match in order for said data cell to be stored in said data buffering queue.
References Cited (Backward Citations)
US3804991A
Cited
US3974343A
Cited
US4069399A
Cited
US4603382A
Cited
US4849968A
Cited
US4727537A
Cited
US4737953A
Cited
US4715030A
Cited
US4821034A
Cited
US4993018A
Cited
US4920531A
Cited
US4878216A
Cited
US4797881A
Cited
US4837761A
Cited
US5084871A
Cited
US5335325A
Cited
US5282201A
Cited
US4893307A
Cited
US5021949A
Cited
US4870641A
Cited
US4872160A
Cited
US4958341A
Cited
US4872159A
Cited
US4893302A
Cited
US4894824A
Cited
US4899333A
Cited
US4979100A
Cited
US5377327A
Cited
US5146560A
Cited
US4956839A
Cited
US5198808A
Cited
US4922503A
Cited
US5060228A
Cited
US5157657A
Cited
US5090011A
Cited
US5083269A
Cited
US4897841A
Cited
US5199027A
Cited
US4933938A
Cited
US4947390A
Cited
US5132966A
Cited
US4953157A
Cited
US5119372A
Cited
US5179558A
Cited
US5093912A
Cited
US5422879A
Cited
US5130982A
Cited
US5067123A
Cited
US5119369A
Cited
US5070498A
Cited
US5090024A
Cited
US5193151A
Cited
US5197067A
Cited
US5084867A
Cited
US5191652A
Cited
US5163046A
Cited
US5130975A
Cited
US5185743A
Cited
US5272697A
Cited
US5379418A
Cited
US5544170A
Cited
US5553068A
Cited
US5309431A
Cited
US5239539A
Cited
US5258979A
Cited
US5151897A
Cited
US5146474A
Cited
US5029164A
Cited
US5303232A
Cited
US5253248A
Cited
US5341376A
Cited
US5115429A
Cited
US5301190A
Cited
US5335222A
Cited
US5333131A
Cited
US5253247A
Cited
US5274641A
Cited
US5150358A
Cited
US5128932A
Cited
US5420988A
Cited
US5267232A
Cited
US5283788A
Cited
US5163045A
Cited
US5394396A
Cited
US5255266A
Cited
US5271010A
Cited
US5497369A
Cited
US5268897A
Cited
US5301193A
Cited
US5280470A
Cited
US5285446A
Cited
US5375117A
Cited
US5333134A
Cited
US5590132A
Cited
US5287349A
Cited
US5341373A
Cited
US5479402A
Cited
US5339310A
Cited
US5295134A
Cited
US5487063A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2002-08-02 | 2003-02-01 | 2003-08-03 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2006-08-02 | 2007-02-01 | 2007-08-03 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2010-08-02 | 2011-02-01 | 2011-08-03 | $7700.00 | Window Closed / Lapsed |