US20050226157A1 - Class-based per-flow queuing across multiple hierarchical link-sharing structures - Google Patents

Class-based per-flow queuing across multiple hierarchical link-sharing structures Download PDF

Info

Publication number
US20050226157A1
US20050226157A1 US11/148,217 US14821705A US2005226157A1 US 20050226157 A1 US20050226157 A1 US 20050226157A1 US 14821705 A US14821705 A US 14821705A US 2005226157 A1 US2005226157 A1 US 2005226157A1
Authority
US
United States
Prior art keywords
link
leaf
structures
sharing
leaves
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.)
Abandoned
Application number
US11/148,217
Inventor
Yehuda Elmaliach
Asher Besserglick
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.)
Mobixell Networks Inc
Original Assignee
Individual
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 Individual filed Critical Individual
Priority to US11/148,217 priority Critical patent/US20050226157A1/en
Publication of US20050226157A1 publication Critical patent/US20050226157A1/en
Assigned to MOBIXELL NETWORKS INC. reassignment MOBIXELL NETWORKS INC. ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: BESSERGLICK, ASHER, ELMALIACH, YEHUDA
Abandoned legal-status Critical Current

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/50Queue scheduling
    • H04L47/62Queue scheduling characterised by scheduling criteria
    • H04L47/621Individual queue per connection or flow, e.g. per VC
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/50Queue scheduling
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/50Queue scheduling
    • H04L47/52Queue scheduling by attributing bandwidth to queues
    • H04L47/527Quantum based scheduling, e.g. credit or deficit based scheduling or token bank

Definitions

  • the present invention relates to computer and telecommunications networks in general, and more particularly to resource allocation therefor.
  • devices such as routers and switches direct the flow of data packets between the data source and its destination.
  • known queuing techniques may be employed to prioritize the forwarding of data packets in accordance with discriminatory resource allocation criteria.
  • CBQ Class-based queuing
  • a hierarchical link-sharing mechanism is provided for use in packet-based networks where multiple entities, such as agencies, protocol families, or traffic types, share a single data link in a controlled fashion.
  • traffic flows that share a single data link are bundled into logical queues, where each queue represents a class of flows.
  • Resource allocation of the shared resource e.g., bandwidth
  • FIG. 1 An example of a prior art CBQ link-sharing hierarchy may be seen in FIG. 1 , where three agencies are connected to a single link. Each agency in turn provides various network services, such as FTP and TELNET, shown as branched flows, which in turn may comprise branched flows representing lower-level services, data flow groupings, or individual data flows.
  • network services such as FTP and TELNET
  • branched flows which in turn may comprise branched flows representing lower-level services, data flow groupings, or individual data flows.
  • each node of the hierarchy shown in FIG. 1 receives a percentage share in the shared resource, with the shares equaling 100% for all nodes at the same level. Scheduling mechanisms are then used to ensure that each node receives its allotted resource allocation.
  • CBQ addresses resource allocation for a single link-sharing hierarchy
  • CBQ does not address the use of multiple link-sharing hierarchies where each hierarchy models resource allocation according to a different set of criteria. For example, in FIG. 1 , while a TELNET user in Agency A ought to receive a portion of the 10% of the available link resources allotted to all TELNET users in Agency A, the introduction of an additional link-sharing hierarchy as shown in FIG. 2 and which has different classes: of users might indicate, for example, that the user is a VIP user who ought to receive a portion of the 80% of the available link resources allotted to all VIP-users. Unfortunately, current CBQ techniques do not offer a way to consider multiple link-sharing hierarchies and arrive at a single queuing solution.
  • the present invention seeks to adapt CBQ for use with multiple link-sharing hierarchies.
  • each one of multiple link-sharing hierarchies imposes a different resource allocation program at one or more levels of differentiation, extending from the link root node to each individual data flow.
  • a new queuing decision layer is introduced that considers all hierarchies simultaneously and arrives at a single queuing solution.
  • a method for class-based per-flow queuing across multiple hierarchical link-sharing structures where each of the structures shares a single link, where each of the structures includes a plurality of leaves, where each of the leaves represents a single flow, and where each of the leaves is common to each of the structures, the method including a) providing a leaf selection mechanism operative to enforce a plurality of rules adapted for the multiple hierarchical link-sharing structures, and b) selecting in response to applying the leaf selection mechanism one of the leaves for servicing during a transmission opportunity.
  • the method further includes updating operating parameters of the multiple hierarchical link-sharing structures to reflect resource usage by the leaf serviced during the transmission opportunity.
  • a method for class-based per-flow queuing across multiple hierarchical link-sharing structures including a) distributing at least one of a plurality V of tokens to each of a plurality of hierarchical link-sharing structures, where each of the structures shares a single link, where each of the structures includes a plurality of leaves, where each of the leaves represents a single flow, and where each of the leaves is common to each of the structures, b) distributing each of the tokens to one of the leaves in each of the structures, and c) selecting one of the leaves having at least V tokens for servicing during a transmission opportunity.
  • the distributing step a) includes distributing a number of the tokens equal to the number of the structures.
  • the distributing step a) includes distributing one of the tokens to each of the structures.
  • the distributing step a) includes distributing a first number of the tokens to a first one of the structures having a first weighting and a second number of the tokens to a second one of the structures having a second weighting, where the numbers are relatively proportional to the weightings.
  • the distributing step b) includes distributing to the leaf if the leaf has not exceeded its maximum allowable resource allocation for any of the structures.
  • the distributing step b) includes distributing to the leaf if a blocking period is not currently in effect for the leaf.
  • the selecting step includes selecting where a queue associated with the leaf has data ready to be serviced via the link.
  • the selecting step includes selecting the leaf if the leaf has not exceeded its maximum allowable resource allocation for any of the structures.
  • the method further includes debiting the serviced leaf by V tokens.
  • the method further includes incrementing each of a plurality of usage counters at each node of the structures along the path from the serviced leaf to the link.
  • the selecting step includes selecting the leaf from a group consisting of time-sensitive leaves.
  • the method further includes time-stamping data upon arrival at each of a plurality of queues, where each of the queues is associated with one of the leaves, and where the selecting step includes selecting the leaf having the longest-waiting of the data where none of the time-sensitive leaves has a greater number of tokens than any other of the time-sensitive leaves.
  • FIGS. 1 and 2 are simplified conceptual illustrations of exemplary prior art CBQ-based hierarchical link-sharing structures
  • FIG. 3 is a simplified flowchart illustration of a method of class-based per-flow queuing across multiple hierarchical link-sharing structures, operative in accordance with a preferred embodiment of the present invention
  • FIG. 4 is a simplified conceptual illustration of an exemplary implementation of class-based per-flow queuing across multiple hierarchical link-sharing structures, useful in understanding the method of FIG. 1 ;
  • FIG. 5 is a simplified flowchart illustration of a method of blocking, operative in accordance with a preferred embodiment of the present invention
  • FIG. 6 is a simplified flowchart illustration of a method of class-based per-flow queuing across multiple hierarchical link-sharing structures, operative in accordance with a preferred embodiment of the present invention.
  • FIG. 3 is a simplified flowchart illustration of a method of class-based per-flow queuing across multiple hierarchical link-sharing structures, operative in accordance with a preferred embodiment of the present invention
  • FIG. 4 is a simplified conceptual illustration of an exemplary implementation of class-based per-flow queuing across multiple hierarchical link-sharing structures, useful in understanding the method of FIG. 3 .
  • a plurality K of hierarchical link-sharing structures or trees such as trees 400 and 402 as shown in FIG. 4 , are formed and maintained using known CBQ techniques (step 300 ). Although two trees are shown, any number of trees may be accommodated.
  • FIGS. 3 is a simplified flowchart illustration of a method of class-based per-flow queuing across multiple hierarchical link-sharing structures, operative in accordance with a preferred embodiment of the present invention
  • FIG. 4 is a simplified conceptual illustration of an exemplary implementation of class-based per-flow queuing across multiple hierarchical link-sharing structures, useful in understanding the method of FIG.
  • trees 400 and 402 are configured such that each of their nodes receives a percentage share in the shared resource, with the shares equaling 100% for all nodes at the same level.
  • the two nodes below the link node are configured to receive 60% and 40% respectively of the link resources, such as 60% and 40% respectively of the link's available bandwidth.
  • trees 400 and 402 share a single, common link 404 are configured such that all leaves represent single flows, labeled as A, B, C, and D, and have the same leaves (i.e., each single flow is expressed as a leaf in each tree).
  • link 404 it is assumed that only one leaf may use link 404 at any given time, with “use” of link 404 defined as receiving an allocation of the resources of link 404 for a period of time, such as receiving the full bandwidth of link 404 for the transmission of a data packet in a Time Division Multiplexing (TDM) network.
  • TDM Time Division Multiplexing
  • This link use by a leaf for a given period of time is herein referred to as a “transmission opportunity.”
  • a total of V tokens are distributed to the K trees, such that each tree receives one or more of the V tokens in accordance with its weighting relative to the other trees (step 302 ). Where all trees are equally weighted, V may be set equal to K such that each tree receives one token.
  • a leaf “earns” a transmission opportunity once it has accumulated at least V tokens.
  • trees 400 and 402 are equally weighted, and, therefore, receive one token each for each transmission opportunity. Each tree then distributes the token to one of its leaves in accordance with the tree's particular CBQ rules (step 304 ).
  • the token distribution for a first transmission opportunity results in token # 1 being received by tree 400 and distributed to leaf A, and token # 2 being received by tree 402 and likewise distributed to leaf A.
  • token # 3 is received by tree 400 and distributed to leaf C
  • token # 4 is received by tree 402 and distributed to leaf B.
  • FIG. 4 shows 22 tokens representing 11 flow opportunities having been distributed to the leaves of trees 400 and 402 .
  • the token distribution for the leaves of both trees 400 and 402 is summarized in a table 406 .
  • a leaf may be selected to receive the resources of the link (step 306 ).
  • the leaf with the greatest number of tokens such as leaf B in FIG. 4 , is selected, typically provided that the selected leaf may be serviced, e.g., if the leaf has a data packet queued and ready to be transmitted via the link and if the leaf has not exceeded its maximum allowable resource allocation in accordance with the CBQ rules that govern it.
  • the selected leaf then utilizes its resource allocation (step 308 ).
  • the operating parameters of the multiple hierarchical link-sharing structures may be updated to reflect the link usage by the serviced leaf.
  • the serviced leaf may be debited V tokens (step 310 ).
  • usage counters are maintained for each node of the trees in accordance with known CBQ techniques, the usage counters along the path from the serviced leaf to the link may be incremented to record the resource usage (step 3 . 12 ).
  • a time-sensitive scheduler is used to select a leaf whose needs are time-sensitive.
  • the leaf that is both time-sensitive and that has the greatest number of tokens among other time-sensitive leaves is selected to have its queue serviced.
  • the packet at the head of each leafs queue may be checked, using conventional time-stamping and aging techniques, to determine which packet has been queued longer, and the leaf with the longest-waiting packet may be selected, such as in accordance with known start-time fair queuing techniques.
  • “greatest number of tokens,” “longest-waiting packet,” or any known combination of these criteria may be used to determine leaf selection.
  • the present invention may be implemented without modification for link-sharing flows across multiple CBQ-based link-sharing hierarchies where resource borrowing exists, such as from a direct ancestor, from a common ancient ancestor, etc.
  • resource borrowing exists, such as from a direct ancestor, from a common ancient ancestor, etc.
  • limitations may be set on the distribution of resources using a blocking mechanism in which a single hierarchy may limit the resources distributed to a flow by all other hierarchies.
  • FIG. 5 is a simplified flowchart illustration of a method of blocking, operative in accordance with a preferred embodiment of the present invention
  • FIG. 6 is a simplified flowchart illustration of a method of class-based per-flow queuing across multiple hierarchical link-sharing structures, operative in accordance with a preferred embodiment of the present invention.
  • Blocking may be implemented in any of the embodiments described above as follows. If at any time the particular rules of any tree in the multi-hierarchy model indicates that a leaf should not be serviced, such as where the leaf or any of its parent, grandparent, etc.
  • the leaf may be marked by the hierarchy as “blocked” (step 502 ). This causes the leaf to not be considered for a transmission opportunity, even if the leaf has accrued a sufficient number of tokens.
  • a blocked leaf remains blocked for a predefined blocking period during which time tokens may not be allocated to the leaf by-any of the link-sharing hierarchies in the multi-hierarchy model. Once the blocking period has expired, the leaf may again receive tokens and be considered for selection for a transmission opportunity, provided that the leaf may otherwise be serviced in accordance with all applicable rules at all trees.
  • the method of FIG. 6 is substantially similar to the method of FIG. 3 with the notable exception that steps 604 and 606 are performed for unblocked leaves only.

Abstract

A method for class-based per-flow queuing for use with multiple link-sharing hierarchies, where each one of multiple link-sharing hierarchies imposes a different resource allocation program at one or more levels of differentiation, extending from the link root node to each individual data flow. A new queuing decision layer is introduced that considers all hierarchies simultaneously and arrives at a single queuing solution.

Description

    CROSS-REFERENCE TO RELATED APPLICATIONS
  • This application is a continuation of and claims benefit from U.S. patent application Ser. No. 09/875,893, filed Jun. 8, 2001, which is hereby incorporated by reference.
  • FIELD OF INVENTION
  • The present invention relates to computer and telecommunications networks in general, and more particularly to resource allocation therefor.
  • BACKGROUND OF THE INVENTION
  • In computer and telecommunications networks, devices such as routers and switches direct the flow of data packets between the data source and its destination. Where resources such as bandwidth of a particular router or switch is limited, known queuing techniques may be employed to prioritize the forwarding of data packets in accordance with discriminatory resource allocation criteria. In one such queuing technique, known as Class-based queuing (CBQ) and described in “Resource Management Models for Packet Networks,” Sally Floys and Van Jacobson, IEEE/ACM Transactions on Networking, Vol. 3 No. 4, August, 1995, a hierarchical link-sharing mechanism is provided for use in packet-based networks where multiple entities, such as agencies, protocol families, or traffic types, share a single data link in a controlled fashion. In CBQ, traffic flows that share a single data link are bundled into logical queues, where each queue represents a class of flows. Resource allocation of the shared resource (e.g., bandwidth) is then performed for each class based on a set of rules that establish the share that each queue is to receive of the shared resource.
  • An example of a prior art CBQ link-sharing hierarchy may be seen in FIG. 1, where three agencies are connected to a single link. Each agency in turn provides various network services, such as FTP and TELNET, shown as branched flows, which in turn may comprise branched flows representing lower-level services, data flow groupings, or individual data flows. In CBQ, each node of the hierarchy shown in FIG. 1 receives a percentage share in the shared resource, with the shares equaling 100% for all nodes at the same level. Scheduling mechanisms are then used to ensure that each node receives its allotted resource allocation.
  • While CBQ addresses resource allocation for a single link-sharing hierarchy, CBQ does not address the use of multiple link-sharing hierarchies where each hierarchy models resource allocation according to a different set of criteria. For example, in FIG. 1, while a TELNET user in Agency A ought to receive a portion of the 10% of the available link resources allotted to all TELNET users in Agency A, the introduction of an additional link-sharing hierarchy as shown in FIG. 2 and which has different classes: of users might indicate, for example, that the user is a VIP user who ought to receive a portion of the 80% of the available link resources allotted to all VIP-users. Unfortunately, current CBQ techniques do not offer a way to consider multiple link-sharing hierarchies and arrive at a single queuing solution.
  • SUMMARY OF THE INVENTION
  • The present invention seeks to adapt CBQ for use with multiple link-sharing hierarchies. In the present invention each one of multiple link-sharing hierarchies imposes a different resource allocation program at one or more levels of differentiation, extending from the link root node to each individual data flow. A new queuing decision layer is introduced that considers all hierarchies simultaneously and arrives at a single queuing solution.
  • There is thus provided in accordance with a preferred embodiment of the present invention a method for class-based per-flow queuing across multiple hierarchical link-sharing structures, where each of the structures shares a single link, where each of the structures includes a plurality of leaves, where each of the leaves represents a single flow, and where each of the leaves is common to each of the structures, the method including a) providing a leaf selection mechanism operative to enforce a plurality of rules adapted for the multiple hierarchical link-sharing structures, and b) selecting in response to applying the leaf selection mechanism one of the leaves for servicing during a transmission opportunity.
  • Further in accordance with a preferred embodiment of the present invention the method further includes updating operating parameters of the multiple hierarchical link-sharing structures to reflect resource usage by the leaf serviced during the transmission opportunity.
  • There is also provided in accordance with a preferred embodiment of the present invention a method for class-based per-flow queuing across multiple hierarchical link-sharing structures, the method including a) distributing at least one of a plurality V of tokens to each of a plurality of hierarchical link-sharing structures, where each of the structures shares a single link, where each of the structures includes a plurality of leaves, where each of the leaves represents a single flow, and where each of the leaves is common to each of the structures, b) distributing each of the tokens to one of the leaves in each of the structures, and c) selecting one of the leaves having at least V tokens for servicing during a transmission opportunity.
  • Further in accordance with a preferred embodiment of the present invention the distributing step a) includes distributing a number of the tokens equal to the number of the structures.
  • Still further in accordance with a preferred embodiment of the present invention the distributing step a) includes distributing one of the tokens to each of the structures.
  • Additionally in accordance with a preferred embodiment of the present invention the distributing step a) includes distributing a first number of the tokens to a first one of the structures having a first weighting and a second number of the tokens to a second one of the structures having a second weighting, where the numbers are relatively proportional to the weightings.
  • Moreover in accordance with a preferred embodiment of the present invention the distributing step b) includes distributing to the leaf if the leaf has not exceeded its maximum allowable resource allocation for any of the structures.
  • Further in accordance with a preferred embodiment of the present invention the distributing step b) includes distributing to the leaf if a blocking period is not currently in effect for the leaf.
  • Still further in accordance with a preferred embodiment of the present invention the selecting step includes selecting where a queue associated with the leaf has data ready to be serviced via the link.
  • Additionally in accordance with a preferred embodiment of the present invention the selecting step includes selecting the leaf if the leaf has not exceeded its maximum allowable resource allocation for any of the structures.
  • Moreover in accordance with a preferred embodiment of the present invention the method further includes debiting the serviced leaf by V tokens.
  • Further in accordance with a preferred embodiment of the present invention the method further includes incrementing each of a plurality of usage counters at each node of the structures along the path from the serviced leaf to the link.
  • Still further in accordance with a preferred embodiment of the present invention the selecting step includes selecting the leaf from a group consisting of time-sensitive leaves.
  • Additionally in accordance with a preferred embodiment of the present invention the method further includes time-stamping data upon arrival at each of a plurality of queues, where each of the queues is associated with one of the leaves, and where the selecting step includes selecting the leaf having the longest-waiting of the data where none of the time-sensitive leaves has a greater number of tokens than any other of the time-sensitive leaves.
  • The disclosures of all patents, patent applications, and other publications mentioned in this specification and of the patents, patent applications, and other publications cited therein are hereby incorporated by reference.
  • BRIEF DESCRIPTION OF THE DRAWINGS
  • The present invention will be understood and appreciated more fully from the following detailed description taken in conjunction with the appended drawings in which:
  • FIGS. 1 and 2 are simplified conceptual illustrations of exemplary prior art CBQ-based hierarchical link-sharing structures;
  • FIG. 3 is a simplified flowchart illustration of a method of class-based per-flow queuing across multiple hierarchical link-sharing structures, operative in accordance with a preferred embodiment of the present invention;
  • FIG. 4 is a simplified conceptual illustration of an exemplary implementation of class-based per-flow queuing across multiple hierarchical link-sharing structures, useful in understanding the method of FIG. 1;
  • FIG. 5 is a simplified flowchart illustration of a method of blocking, operative in accordance with a preferred embodiment of the present invention;
  • FIG. 6 is a simplified flowchart illustration of a method of class-based per-flow queuing across multiple hierarchical link-sharing structures, operative in accordance with a preferred embodiment of the present invention.
  • DETAILED DESCRIPTION OF PREFERRED EMBODIMENTS
  • Reference is now made to-FIG. 3, which is a simplified flowchart illustration of a method of class-based per-flow queuing across multiple hierarchical link-sharing structures, operative in accordance with a preferred embodiment of the present invention, and additionally to FIG. 4, which is a simplified conceptual illustration of an exemplary implementation of class-based per-flow queuing across multiple hierarchical link-sharing structures, useful in understanding the method of FIG. 3. In the method of FIG. 3, a plurality K of hierarchical link-sharing structures or trees, such as trees 400 and 402 as shown in FIG. 4, are formed and maintained using known CBQ techniques (step 300). Although two trees are shown, any number of trees may be accommodated. As in FIGS. 1 and 2 above, trees 400 and 402 are configured such that each of their nodes receives a percentage share in the shared resource, with the shares equaling 100% for all nodes at the same level. Thus, for example, in tree 400 the two nodes below the link node are configured to receive 60% and 40% respectively of the link resources, such as 60% and 40% respectively of the link's available bandwidth. In accordance with the present invention, trees 400 and 402 share a single, common link 404, are configured such that all leaves represent single flows, labeled as A, B, C, and D, and have the same leaves (i.e., each single flow is expressed as a leaf in each tree). It is assumed that only one leaf may use link 404 at any given time, with “use” of link 404 defined as receiving an allocation of the resources of link 404 for a period of time, such as receiving the full bandwidth of link 404 for the transmission of a data packet in a Time Division Multiplexing (TDM) network. This link use by a leaf for a given period of time is herein referred to as a “transmission opportunity.” Prior to each transmission opportunity, a total of V tokens are distributed to the K trees, such that each tree receives one or more of the V tokens in accordance with its weighting relative to the other trees (step 302). Where all trees are equally weighted, V may be set equal to K such that each tree receives one token. Where the trees are not equally weighted, V may be set such that V = i = 1 K w i ,
    where each tree i is given wi (wi>=0) tokens where wi is the weight of the tree or a multiple thereof. Thus, where there are three trees weighted at 20%, 30%, and 50% respectively, the trees may receive 2, 3, and 5 tokens respectively for a total of V=10 tokens, or, alternatively, 20, 30, and 50 tokens respectively for a total of V=100 tokens. Whatever value is used for V, a leaf “earns” a transmission opportunity once it has accumulated at least V tokens.
  • In the exemplary implementation of FIG. 4, trees 400 and 402 are equally weighted, and, therefore, receive one token each for each transmission opportunity. Each tree then distributes the token to one of its leaves in accordance with the tree's particular CBQ rules (step 304). Thus, for example, in FIG. 4, the token distribution for a first transmission opportunity results in token # 1 being received by tree 400 and distributed to leaf A, and token # 2 being received by tree 402 and likewise distributed to leaf A. For the next transmission opportunity, token # 3 is received by tree 400 and distributed to leaf C, while token # 4 is received by tree 402 and distributed to leaf B. For purposes of illustration, FIG. 4 shows 22 tokens representing 11 flow opportunities having been distributed to the leaves of trees 400 and 402. The token distribution for the leaves of both trees 400 and 402 is summarized in a table 406.
  • Once the tokens for a transmission opportunity have been distributed, a leaf may be selected to receive the resources of the link (step 306). In one preferred embodiment, the leaf with the greatest number of tokens, such as leaf B in FIG. 4, is selected, typically provided that the selected leaf may be serviced, e.g., if the leaf has a data packet queued and ready to be transmitted via the link and if the leaf has not exceeded its maximum allowable resource allocation in accordance with the CBQ rules that govern it. The selected leaf then utilizes its resource allocation (step 308).
  • The operating parameters of the multiple hierarchical link-sharing structures may be updated to reflect the link usage by the serviced leaf. The serviced leaf may be debited V tokens (step 310). Where usage counters are maintained for each node of the trees in accordance with known CBQ techniques, the usage counters along the path from the serviced leaf to the link may be incremented to record the resource usage (step 3.12).
  • In another preferred embodiment, a time-sensitive scheduler is used to select a leaf whose needs are time-sensitive. The leaf that is both time-sensitive and that has the greatest number of tokens among other time-sensitive leaves is selected to have its queue serviced. Where no time-sensitive leaf has more tokens than any other time-sensitive leaf, the packet at the head of each leafs queue may be checked, using conventional time-stamping and aging techniques, to determine which packet has been queued longer, and the leaf with the longest-waiting packet may be selected, such as in accordance with known start-time fair queuing techniques. Where no time-sensitive leaves needing service are found during a transmission opportunity, “greatest number of tokens,” “longest-waiting packet,” or any known combination of these criteria may be used to determine leaf selection.
  • The present invention may be implemented without modification for link-sharing flows across multiple CBQ-based link-sharing hierarchies where resource borrowing exists, such as from a direct ancestor, from a common ancient ancestor, etc. In order to support CBQ no-borrow mode, limitations may be set on the distribution of resources using a blocking mechanism in which a single hierarchy may limit the resources distributed to a flow by all other hierarchies.
  • Reference is now made to FIG. 5 which is a simplified flowchart illustration of a method of blocking, operative in accordance with a preferred embodiment of the present invention, and additionally to FIG. 6, which is a simplified flowchart illustration of a method of class-based per-flow queuing across multiple hierarchical link-sharing structures, operative in accordance with a preferred embodiment of the present invention. Blocking may be implemented in any of the embodiments described above as follows. If at any time the particular rules of any tree in the multi-hierarchy model indicates that a leaf should not be serviced, such as where the leaf or any of its parent, grandparent, etc. nodes in a specific link-sharing hierarchy has exceeded its link resource allocation (step 500), then the leaf may be marked by the hierarchy as “blocked” (step 502). This causes the leaf to not be considered for a transmission opportunity, even if the leaf has accrued a sufficient number of tokens. Preferably, such a blocked leaf remains blocked for a predefined blocking period during which time tokens may not be allocated to the leaf by-any of the link-sharing hierarchies in the multi-hierarchy model. Once the blocking period has expired, the leaf may again receive tokens and be considered for selection for a transmission opportunity, provided that the leaf may otherwise be serviced in accordance with all applicable rules at all trees. The method of FIG. 6 is substantially similar to the method of FIG. 3 with the notable exception that steps 604 and 606 are performed for unblocked leaves only.
  • It is appreciated that one or more steps of any of the methods described herein may be implemented in a different order than that shown while not departing from the spirit and scope of the invention.
  • While the present invention may or may not have been described with reference to specific hardware or software, the present invention has been described in a manner sufficient to enable persons having ordinary skill in the art to readily adapt commercially available hardware and software as may be needed to reduce any of the embodiments of the present invention to practice without undue experimentation and using conventional techniques.
  • While the present invention has been described with reference to one or more specific embodiments, the description is intended to be illustrative of the invention as a whole and is not to be construed as limiting the invention to the embodiments shown. It is appreciated that various modifications may occur to those skilled in the art that, while not specifically shown herein, are nevertheless within the true spirit and scope of the invention.

Claims (2)

1. A method for class-based per-flow queuing across multiple hierarchical link-sharing structures in a communications network, the method comprising:
a) providing a leaf selection mechanism operative to enforce a plurality of rules adapted for a plurality of hierarchical link-sharing structures, wherein each of said structures shares a single link, wherein each of said structures comprises a plurality of leaves, wherein each of said leaves represents a single flow, and wherein each of said leaves is common to each of said structures; and
b) selecting, in response to applying said leaf selection mechanism, one of said leaves for servicing during a communications network transmission opportunity.
2. A method according to claim 1 and further comprising updating operating parameters of said multiple hierarchical link-sharing structures to reflect resource usage by said leaf serviced during said communications network transmission opportunity.
US11/148,217 2001-06-08 2005-06-09 Class-based per-flow queuing across multiple hierarchical link-sharing structures Abandoned US20050226157A1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
US11/148,217 US20050226157A1 (en) 2001-06-08 2005-06-09 Class-based per-flow queuing across multiple hierarchical link-sharing structures

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US09/875,893 US6922732B2 (en) 2001-06-08 2001-06-08 Class-based per-flow queuing across multiple hierarchical link-sharing structures
US11/148,217 US20050226157A1 (en) 2001-06-08 2005-06-09 Class-based per-flow queuing across multiple hierarchical link-sharing structures

Related Parent Applications (1)

Application Number Title Priority Date Filing Date
US09/875,893 Continuation US6922732B2 (en) 2001-06-08 2001-06-08 Class-based per-flow queuing across multiple hierarchical link-sharing structures

Publications (1)

Publication Number Publication Date
US20050226157A1 true US20050226157A1 (en) 2005-10-13

Family

ID=25366556

Family Applications (2)

Application Number Title Priority Date Filing Date
US09/875,893 Expired - Fee Related US6922732B2 (en) 2001-06-08 2001-06-08 Class-based per-flow queuing across multiple hierarchical link-sharing structures
US11/148,217 Abandoned US20050226157A1 (en) 2001-06-08 2005-06-09 Class-based per-flow queuing across multiple hierarchical link-sharing structures

Family Applications Before (1)

Application Number Title Priority Date Filing Date
US09/875,893 Expired - Fee Related US6922732B2 (en) 2001-06-08 2001-06-08 Class-based per-flow queuing across multiple hierarchical link-sharing structures

Country Status (1)

Country Link
US (2) US6922732B2 (en)

Families Citing this family (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8255791B2 (en) 2000-11-29 2012-08-28 Dov Koren Collaborative, flexible, interactive real-time displays
US8713623B2 (en) 2001-09-20 2014-04-29 Time Warner Cable Enterprises, LLC Technique for effectively providing program material in a cable television system
US7339953B2 (en) * 2002-08-30 2008-03-04 Redback Networks, Inc. Surplus redistribution for quality of service classification for packet processing
US7283472B2 (en) * 2002-08-30 2007-10-16 Redback Networks Inc. Priority-based efficient fair queuing for quality of service classification for packet processing
US8312145B2 (en) * 2003-12-22 2012-11-13 Rockstar Consortium US L.P. Traffic engineering and bandwidth management of bundled links
US7567572B1 (en) * 2004-01-09 2009-07-28 Cisco Technology, Inc. 2-rate scheduling based on search trees with configurable excess bandwidth sharing
US7457241B2 (en) * 2004-02-05 2008-11-25 International Business Machines Corporation Structure for scheduler pipeline design for hierarchical link sharing
US9723267B2 (en) * 2004-12-15 2017-08-01 Time Warner Cable Enterprises Llc Method and apparatus for wideband distribution of content
US7729242B2 (en) * 2007-12-13 2010-06-01 Cisco Technology, Inc. 3-level queuing scheduler supporting flexible configuration and etherchannel
US9300445B2 (en) 2010-05-27 2016-03-29 Time Warner Cable Enterprise LLC Digital domain content processing and distribution apparatus and methods
US9185341B2 (en) 2010-09-03 2015-11-10 Time Warner Cable Enterprises Llc Digital domain content processing and distribution apparatus and methods

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6449650B1 (en) * 1999-02-01 2002-09-10 Redback Networks Inc. Methods and apparatus for deploying quality of service policies on a data communication network
US6560230B1 (en) * 1999-02-01 2003-05-06 Redback Networks Inc. Packet scheduling methods and apparatus
US6891834B1 (en) * 1999-09-09 2005-05-10 Avici Systems Apparatus and method for packet scheduling
US20060101144A1 (en) * 1999-12-21 2006-05-11 Santa Wiryaman Bandwidth management system
US7149795B2 (en) * 2000-09-18 2006-12-12 Converged Access, Inc. Distributed quality-of-service system
US7272155B2 (en) * 2000-09-11 2007-09-18 Converged Access, Inc. Central policy manager

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
AU6501496A (en) * 1995-07-19 1997-02-18 Ascom Nexion Inc. Point-to-multipoint transmission using subqueues
US6046980A (en) * 1996-12-09 2000-04-04 Packeteer, Inc. System for managing flow bandwidth utilization at network, transport and application layers in store and forward network
US5991812A (en) * 1997-01-24 1999-11-23 Controlnet, Inc. Methods and apparatus for fair queuing over a network
US6154769A (en) * 1998-03-27 2000-11-28 Hewlett-Packard Company Scheduling server requests to decrease response time and increase server throughput
US6519595B1 (en) * 1999-03-02 2003-02-11 Nms Communications, Inc. Admission control, queue management, and shaping/scheduling for flows

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6449650B1 (en) * 1999-02-01 2002-09-10 Redback Networks Inc. Methods and apparatus for deploying quality of service policies on a data communication network
US6560230B1 (en) * 1999-02-01 2003-05-06 Redback Networks Inc. Packet scheduling methods and apparatus
US6891834B1 (en) * 1999-09-09 2005-05-10 Avici Systems Apparatus and method for packet scheduling
US20060101144A1 (en) * 1999-12-21 2006-05-11 Santa Wiryaman Bandwidth management system
US7272155B2 (en) * 2000-09-11 2007-09-18 Converged Access, Inc. Central policy manager
US7149795B2 (en) * 2000-09-18 2006-12-12 Converged Access, Inc. Distributed quality-of-service system

Also Published As

Publication number Publication date
US6922732B2 (en) 2005-07-26
US20020194372A1 (en) 2002-12-19

Similar Documents

Publication Publication Date Title
US20050226157A1 (en) Class-based per-flow queuing across multiple hierarchical link-sharing structures
Semeria Supporting differentiated service classes: queue scheduling disciplines
US7142513B2 (en) Method and multi-queue packet scheduling system for managing network packet traffic with minimum performance guarantees and maximum service rate control
Zhao et al. Internet quality of service: An overview
US6980511B1 (en) Method of active dynamic resource assignment in a telecommunications network
US7983299B1 (en) Weight-based bandwidth allocation for network traffic
KR20060064661A (en) Flexible admission control for different traffic classes in a communication network
Homg et al. An adaptive approach to weighted fair queue with QoS enhanced on IP network
US7768919B1 (en) Selective packet discard apparatus and method
Striegel et al. Packet scheduling with delay and loss differentiation
Wang et al. Resource allocation for elastic traffic: Architecture and mechanisms
US20040258090A1 (en) Method for dimensioning voice over IP networks
Mowbray et al. Capacity reservation for multimedia traffic
Bechler et al. Traffic shaping in end systems attached to QoS-supporting networks
US20080259867A1 (en) Method and system for scheduling packets from different flows to provide fair bandwidth sharing
Jiwasurat et al. Hierarchical shaped deficit round-robin scheduling
Wu et al. Characterizing traffic behavior and providing end-to-end service guarantees within ATM networks
KR100745679B1 (en) Method and apparatus for packet scheduling using adaptation round robin
Agharebparast et al. Efficient fair queuing with decoupled delay-bandwidth guarantees
Kingston Dynamic precedence for military ip networks
KR100475783B1 (en) Hierarchical prioritized round robin(hprr) scheduling
Wang et al. Packet fair queuing algorithms for wireless networks
Hwang et al. A hybrid scheduling algorithm with low complexity: Jumping Virtual Clock Round Robin
Chiou et al. DMGFQ: a novel traffic scheduler with differentiated QoS guarantee for Internet multimedia services
KR100527339B1 (en) Method of scheduling for guaranteeing QoS in Ethernet-PON

Legal Events

Date Code Title Description
AS Assignment

Owner name: MOBIXELL NETWORKS INC., DELAWARE

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:ELMALIACH, YEHUDA;BESSERGLICK, ASHER;REEL/FRAME:021197/0185

Effective date: 20010606

STCB Information on status: application discontinuation

Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION