Japanese
close

FI (list display)

  • H04L45/00
    		•  Routing or path finding of packets in data switching networks (routing or path finding in wireless networks H04W 40/00) [2022.01] HB CC 5K030
  • H04L45/02
    		•  .Topology update or discovery [2022.01] HB CC 5K030
  • H04L45/021
    		•  ..Ensuring consistency of routing table updates, e.g. by using epoch numbers [2022.01] HB CC 5K030
  • H04L45/023
    		•  ..Delayed use of routing table updates [2022.01] HB CC 5K030
  • H04L45/028
    		•  ..Dynamic adaptation of the update intervals, e.g. event-triggered updates [2022.01] HB CC 5K030
  • H04L45/03
    		•  ..by updating link state protocols [2022.01] HB CC 5K030
  • H04L45/033
    		•  ..by updating distance vector protocols [2022.01] HB CC 5K030
  • H04L45/036
    		•  ..Updating the topology between route computation elements, e.g. between OpenFlow controllers [2022.01] HB CC 5K030
  • H04L45/037
    		•  ...Routes obligatorily traversing service-related nodes [2022.01] HB CC 5K030
  • H04L45/0377
    		•  ....for service chaining [2022.01] HB CC 5K030
  • H04L45/12
    		•  .Shortest path evaluation [2022.01] HB CC 5K030
  • H04L45/121
    		•  ..by minimising delays [2022.01] HB CC 5K030
  • H04L45/122
    		•  ..by minimising distances, e.g. by selecting a route with minimum of number of hops [2022.01] HB CC 5K030
  • H04L45/125
    		•  ..based on throughput or bandwidth [2022.01] HB CC 5K030
  • H04L45/128
    		•  ..for finding disjoint paths [2022.01] HB CC 5K030
  • H04L45/16
    		•  .Multipoint routing [2022.01] HB CC 5K030
  • H04L45/17
    		•  .Shortcut routing, e.g. using next hop resolution protocol [NHRP] [2022.01] HB CC 5K030
  • H04L45/18
    		•  .Loop-free operations [2022.01] HB CC 5K030
  • H04L45/24
    		•  .Multipath [2022.01] HB CC 5K030
  • H04L45/243
    		•  ..using M+N parallel active paths [2022.01] HB CC 5K030
  • H04L45/247
    		•  ..using M:N active or standby paths [2022.01] HB CC 5K030
  • H04L45/28
    		•  .using route fault recovery [2022.01] HB CC 5K030
  • H04L45/30
    		•  .Routing of multiclass traffic [2022.01] HB CC 5K030
  • H04L45/302
    		•  .Route determination based on requested QoS [2022.01] HB CC 5K030
  • H04L45/42
    		•  .Centralised routing [2022.01] HB CC 5K030
  • H04L45/44
    		•  .Distributed routing [2022.01] HB CC 5K030
  • H04L45/48
    		•  .Routing tree calculation [2022.01] HB CC 5K030
  • H04L45/484
    		•  ..using multiple routing trees [2022.01] HB CC 5K030
  • H04L45/488
    		•  ..using root node determination [2022.01] HB CC 5K030
  • H04L45/50
    		•  .using label swapping, e.g. multi-protocol label switch [MPLS] [2022.01] HB CC 5K030
  • H04L45/52
    		•  .Multiprotocol routers [2022.01] HB CC 5K030
  • H04L45/58
    		•  .Association of routers [2022.01] HB CC 5K030
  • H04L45/586
    		•  ..of virtual routers [2022.01] HB CC 5K030
  • H04L45/60
    		•  .Router architectures [2022.01] HB CC 5K030
  • H04L45/64
    		•  .using an overlay routing layer [2022.01] HB CC 5K030
  • H04L45/645
    		•  .Splitting route computation layer and forwarding layer, e.g. routing according to path computational element [PCE] or based on OpenFlow functionality [2022.01] HB CC 5K030
  • H04L45/655
    		•  ..Interaction between route computation entities and forwarding entities, e.g. for route determination or for flow table update [2022.01] HB CC 5K030
  • H04L45/74
    		•  .Address processing for routing [2022.01] HB CC 5K030
  • H04L45/741
    		•  ..Routing in networks with a plurality of addressing schemes, e.g. with both IPv4 and IPv6 [2022.01] HB CC 5K030
  • H04L45/745
    		•  ..Address table lookup; Address filtering [2022.01] HB CC 5K030
  • H04L45/7452
    		•  ...Multiple parallel or consecutive lookup operations (lookup operation involving Bloom filters H04L 45/7459) [2022.01] HB CC 5K030
  • H04L45/7453
    		•  ...using hashing [2022.01] HB CC 5K030
  • H04L45/7459
    		•  ....using Bloom filters [2022.01] HB CC 5K030
  • H04L45/748
    		•  ...using longest matching prefix [2022.01] HB CC 5K030
  • H04L45/76
    		•  .Routing in software-defined topologies, e.g. routing between virtual machines [2022.01] HB CC 5K030
  • H04L45/80
    		•  .Ingress point selection by the source endpoint, e.g. selection of ISP or POP [2022.01] HB CC 5K030
  • H04L45/85
    		•  ..Selection among different networks [2022.01] HB CC 5K030
  • H04L45/851
    		•  ...Dynamic network selection or re-selection, e.g. after degradation of quality [2022.01] HB CC 5K030
    TOP