Traffic regulation in packet switching networks


  • CPC
  • H04L47/00
This industry / category may be too specific. Please go to a parent level for more data

Sub Industries

H04L47/10Flow control or congestion control H04L47/11Congestion identification H04L47/115using a dedicated packet H04L47/12Congestion avoidance or recovery H04L47/122Diverting traffic away from congested spots H04L47/125Load balancing H04L47/127Congestion prediction H04L47/13in a LAN segment H04L47/135by jamming the transmission media H04L47/14in wireless networks H04L47/15in relation to multipoint traffic H04L47/16in connection oriented networks H04L47/17Hop by hop H04L47/18End to end H04L47/19at layers above network layer H04L47/193at transport layer H04L47/196Integration of transport layer protocols H04L47/20Policing H04L47/21using leaky bucket H04L47/215Token bucket H04L47/22Traffic shaping H04L47/225Determination of shaping rate H04L47/23Bit dropping H04L47/24depending on the type of traffic H04L47/2408Different services H04L47/2416Real time traffic H04L47/2425Service specification H04L47/2433Allocation of priorities to traffic types H04L47/2441Flow classification H04L47/245using preemption H04L47/2458Modification of priorities while in transit H04L47/2466Modification of handling priority for control packets H04L47/2475Application aware H04L47/2483Flow identification H04L47/2491Mapping QoS requirements between different networks H04L47/25Rate modification upon detection by the source of changing network conditions H04L47/26Explicit feedback to the source H04L47/263Source rate modification after feedback H04L47/266Stopping or restarting the source H04L47/27Window size evaluation or update H04L47/28using time considerations H04L47/283Network and process delay H04L47/286Time to live H04L47/29Using a combination of thresholds H04L47/30using information about buffer occupancy at either end or transit nodes H04L47/31Tagging of packets H04L47/32Packet discarding or delaying H04L47/323Discarding or blocking control packets H04L47/326With random discard H04L47/33Forward notification H04L47/34Sequence integrity H04L47/35Embedded flow control information in regular packets H04L47/36Evaluation of the packet size H04L47/365Dynamic adaptation of the packet size H04L47/37Slow start H04L47/38Adapting coding or compression rate H04L47/39Credit based H04L47/40Using splitted connections H04L47/41Actions on aggregated flows or links H04L47/50Queue scheduling H04L47/52Bandwidth attribution to queues H04L47/521Static queue service slot or fixed bandwidth allocation H04L47/522Dynamic queue service slot or variable bandwidth allocation H04L47/524Queue skipping H04L47/525Redistribution of residual bandwidth H04L47/527Quantum based scheduling H04L47/528Minimum bandwidth guarantee H04L47/54Loss aware scheduling H04L47/56Delay aware scheduling H04L47/562Attaching a time tag to queues H04L47/564Attaching a deadline to packets H04L47/566Deadline varies as a function of time spent in the queue H04L47/568Calendar queues or timing rings H04L47/58Changing or combining different scheduling modes H04L47/60Hierarchical scheduling H04L47/62General aspects H04L47/6205Arrangements for avoiding head of line blocking H04L47/621Individual queue per connection or flow H04L47/6215Individual queue per QOS, rate or priority H04L47/622Queue service order H04L47/6225fixed service order H04L47/623weighted service order H04L47/6235variable service order H04L47/624Altering the ordering of packets in an individual queue H04L47/6245Modifications to standard FIFO or LIFO H04L47/625Other criteria for service slot or service order H04L47/6255queue load conditions H04L47/626channel conditions H04L47/6265past bandwidth allocation H04L47/627policing H04L47/6275priority H04L47/628packet size H04L47/6285Provisions for avoiding starvation of low priority queues H04L47/629Fair share of resources H04L47/6295Multiple queues per individual QOS, connection, flow or priority H04L47/70Admission control or resource allocation H04L47/72Reservation actions H04L47/722at the end terminals H04L47/724involving intermediate nodes H04L47/726over a plurality of alternate paths H04L47/728for backup paths H04L47/74Reactions to resource unavailability H04L47/741Holding a request until resources become available H04L47/743Reaction at the end points H04L47/745Reaction in network H04L47/746Reaction triggered by a failure H04L47/748Negotiation of resources H04L47/76Reallocation of resources, renegotiation of resources H04L47/762triggered by the network H04L47/765triggered by the end-points H04L47/767after changing the attachment point H04L47/78Resource allocation architecture H04L47/781Centralized allocation of resource H04L47/782Hierarchical allocation of resource H04L47/783Distributed allocation of resources H04L47/785Involving several network domains H04L47/786Mapping reservation between domains H04L47/787Bandwidth trade among domains H04L47/788Autonomous allocation of resources H04L47/80Actions related to the nature of the flow or the user H04L47/801Real time traffic H04L47/803Application aware H04L47/805QOS or priority aware H04L47/806Broadcast or multicast traffic H04L47/808User-type aware H04L47/82Miscellaneous aspects H04L47/821Prioritising resource allocation or reservation requests H04L47/822Collecting or measuring resource availability data H04L47/823Prediction of resource usage H04L47/824Applicable to portable or mobile terminals H04L47/825Involving tunnels H04L47/826Involving periods of time H04L47/827Aggregation of resource allocation or reservation requests H04L47/828Allocation of resources per group of connections H04L47/829Topology based