US6456600B1
Expired / Lapsed
US
⏱️ 0.0 years remaining
Complex node representation in an asynchronous transfer mode PNNI network
Assignee: HP Inc
•
Filing: 1999-04-28
•
Granted: 2002-09-24
•
Expires: 2019-04-28
Abstract
Abstract A method of calculating a complex node representation for logical nodes in a hierarchical peer group in a PNNI based ATM network. The summary information for default spokes, exceptions and bypasses is determined in a way that closely represents the underlying metrics associated with the peer group. A list of all border nodes in the peer group is generated and maintained and a matrix of tables is generated, one table for each metric per each class of service. The table is populated by the best value associated with the corresponding metric for a particular pair of border nodes within a particular class of service. Once the table is populated, each element is placed in a group or bin. The bins are generated by dividing the full range of the metric into a plurality of smaller subgroups or bins. The bin having a count greater than a threshold count is selected and 80% of the worst value for that group is used as the default spoke. If no bin exists having at least a threshold count, the number of bins is reduced by one and a new set of subranges is calculated. The elements of the table are placed in the newly divided bins and a scan is performed once again.
Inventors
- 👤 Haim Rochberger
- 👤 Meir Morgenstern
- 👤 David Margolis
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-08 20:58
CPC Classifications
H; H04; H04L; H04L45/00; H04L45/02; H04L45/06; H04L45/026; H04L45/04; H04L45/46; H04Q; H04Q11/00; H04Q11/04; H04Q11/0428; H04Q11/0478; H04L12/00; H04L12/54; H04L12/56; H04L12/5601; H04L2012/5619; H04L2012/5621; H04L2012/5623
Claims Analysis
Total Claims: 17
Claim 1
Independent Claim
168 words
In a Private Network to network Interface (PNNI) based Asynchronous Transfer Mode (ATM) network a method of determining a complex node representation for a logical node in a peer group, said method comprising the steps of: generating a list of border nodes located within said peer group, each border node corresponding to a port in said logical node; generating a plurality of tables, each table associated with a particular metric within a particular class of service, each table populated with a plurality of elements, each element representing an optimum metric between an associated pair of ports; dividing the total range for each metric into M bins representing a subrange of said total range and placing said plurality of elements in said bins in accordance with an element's value; choosing a bin having an element count greater then a threshold and setting a default spoke value in accordance with the percentage of a value within the subrange of the bin corresponding thereto; and wherein M is a positive integer.
Claim 2
Dependent Claim
168 words
In a Private Network to network Interface (PNNI) based Asynchronous Transfer Mode (ATM) network a method of determining a complex node representation for a logical node in a peer group, said method comprising the steps of: generating a list of border nodes located within said peer group, each border node corresponding to a port in said logical node; generating a plurality of tables, each table associated with a particular metric within a particular class of service, each table populated with a plurality of elements, each element representing an optimum metric between an associated pair of ports; dividing the total range for each metric into M bins representing a subrange of said total range and placing said plurality of elements in said bins in accordance with an element's value; choosing a bin having an element count greater then a threshold and setting a default spoke value in accordance with the percentage of a value within the subrange of the bin corresponding thereto; and wherein M is a positive integer.
Claim 3
Dependent Claim
15 words
The method according to claim 1 , wherein said list comprises a linearly linked list.
Claim 4
Dependent Claim
15 words
The method according to claim 1 , wherein said list comprises a circularly linked list.
Claim 5
Dependent Claim
17 words
The method according to claim 1 , wherein the initial value of M is set to 5.
Claim 6
Dependent Claim
29 words
The method according to claim 1 , wherein said default spoke is in accordance with a percentage of a value, said value comprising the worse value within said subrange.
Claim 7
Dependent Claim
23 words
The method according to claim 1 , wherein said default spoke is in accordance with 80% of the worse value within said subrange.
Claim 8
Dependent Claim
208 words
In a Private Network to network Interface (PNNI) based Asynchronous Transfer Mode (ATM) network a method of determining a complex node representation for a logical node in a peer group, said method comprising the steps of: generating a list of border nodes located within said peer group, each border node corresponding to a port in said logical node; generating a plurality of tables, each table associated with a particular metric within a particular class of service, each table populated with a plurality of elements, each element representing an optimum metric between an associated pair of ports; dividing the total range for each metric into M bins representing a subrange of said total range and placing said plurality of elements in said bins in accordance with an element's value; choosing a bin having an element count greater then a threshold and setting a default spoke value in accordance with the percentage of a value within the subrange of the bin corresponding thereto; decrementing the number of bins M by one if no bin has an element count greater then said threshold and repeating said steps of dividing said total range, placing said plurality of elements in said bins and choosing a bin; and wherein M is a positive integer.
Claim 9
Dependent Claim
208 words
In a Private Network to network Interface (PNNI) based Asynchronous Transfer Mode (ATM) network a method of determining a complex node representation for a logical node in a peer group, said method comprising the steps of: generating a list of border nodes located within said peer group, each border node corresponding to a port in said logical node; generating a plurality of tables, each table associated with a particular metric within a particular class of service, each table populated with a plurality of elements, each element representing an optimum metric between an associated pair of ports; dividing the total range for each metric into M bins representing a subrange of said total range and placing said plurality of elements in said bins in accordance with an element's value; choosing a bin having an element count greater then a threshold and setting a default spoke value in accordance with the percentage of a value within the subrange of the bin corresponding thereto; decrementing the number of bins M by one if no bin has an element count greater then said threshold and repeating said steps of dividing said total range, placing said plurality of elements in said bins and choosing a bin; and wherein M is a positive integer.
Claim 10
Dependent Claim
53 words
The method according to claim 7 , further comprising the step of choosing one group at random from among the two remaining bins when said number of bins M is decremented to two, and setting said default spoke in accordance with the percentage of a value within the subrange of said chosen bin.
Claim 11
Dependent Claim
49 words
The method according to claim 7 , further comprising the step of combining the two remaining bins when said number of bins M is decremented to two, and setting said default spoke in accordance with the percentage of a value within the total range of the metric corresponding thereto.
Claim 12
Dependent Claim
51 words
The method according to claim 7 , further comprising the step of choosing one group from among the three remaining bins when said number of bins M is decremented to three, and setting said default spoke in accordance with the percentage of a value within the subrange of said chosen bin.
Claim 13
Dependent Claim
15 words
The method according to claim 7 , wherein said list comprises a linearly linked list.
Claim 14
Dependent Claim
15 words
The method according to claim 7 , wherein said list comprises a circularly linked list.
Claim 15
Dependent Claim
17 words
The method according to claim 7 , wherein the initial value of M is set to 5.
Claim 16
Dependent Claim
29 words
The method according to claim 7 , wherein said default spoke is in accordance with a percentage of a value, said value comprising the worse value within said subrange.
Claim 17
Dependent Claim
23 words
The method according to claim 7 , wherein said default spoke is in accordance with 80% of the worse value within said subrange.
References Cited (Backward Citations)
US5455865A
Cited
US5420862A
Cited
US5291477A
Cited
US5361256A
Cited
US5483536A
Cited
US5491690A
Cited
US5495479A
Cited
US5649108A
Cited
US5600638A
Cited
US5544327A
Cited
US5590118A
Cited
US5550818A
Cited
US5566014A
Cited
US5673263A
Cited
US5603029A
Cited
US5629930A
Cited
US6333918B1
Cited
US5831975A
Cited
US6115753A
Cited
US5999517A
Cited
US6243384B1
Cited
US6208623B1
Cited
US6078586A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2005-09-23 | 2006-03-25 | 2006-09-24 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2009-09-23 | 2010-03-25 | 2010-09-24 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2013-09-23 | 2014-03-25 | 2014-09-24 | $7700.00 | Window Closed / Lapsed |