CPC field-specific training...European Patent Office 3 Introduction The subclasses H04L and H04W in...

CPC field-specific training

H04L 45 and H04W 40: Routing of Packets

H04L 47 and H04W 28/02: Traffic Regulation

H04L 49: Switching Elements; Packet Buffering

Cristian Ciurel July 2019 Examiner, European Patent Office

European Patent Office 2

Table of contents

Introduction of CPC main groups

H04L 45; H04W 40, H04W 28/02; H04L 47, H04L 49

Criteria for including/excluding documents

in the main groups


Introduction

The subclasses H04L and H04W in CPC

H (section) Electricity

H04 (class) Electric Communication

− H04L (subclass) Digital Communications

− H04L 45/00 (main group): Routing / Path Finding

− H04L 47/00 (main group): Traffic Regulation

− H04L 49/00 (main group): Switch Elements;

Packet Buffering

− H04W (subclass) Wireless Communications

− H04W 40/00 (main group): Routing / Path Finding

specially adapted for wireless communications

− H04W 28/02 (sub group): Flow Control / Traffic

Regulation specially adapted for wireless

communications


Introduction

Subclass H04L is very large

Subclass H04L comprises 17 main groups containing

approx. 1 450 000 documents having a confirmed CPC-

classification in H04L (databases EPODOC and NPL,

April 2019)

H04L 45 (Main group): Routing / Path Finding,

comprises 70 sub-groups, approx. 75 000 documents

(including patent publications and non-patent literature)

H04L 47 (Main group): Traffic Regulation,


H04L 49 (Main group): Switch Elements; Packet Buffering



Introduction

Subclass H04W is very large

Subclass H04W comprises 22 main groups containing

852 000 documents having a confirmed CPC-classification

in H04W (database EPODOC and NPL, April 2019)

H04W 40 (Main group): Routing / Path Finding specially

adapted for wireless communications,


(including patent publications and non-patent literature)

H04W 28/02 (Sub-group): Flow Control / Traffic Regulation

specially adapted for wireless communications,



Introduction

Where to find schemes and definitions

CPC classification scheme and definitions

www.cpcinfo.org or www.cooperativepatentclassification.org

https://worldwide.espacenet.com/classification?locale=en_EP

EPOQUE Net

Classification rules

CPC training material:

www.cooperativepatentclassification.org/Training.html

CPC Concordances:

www.cooperativepatentclassification.org/cpcConcordances.html

Together with the CPC Scheme and the CPC Definitions, the EPO

and the USPTO prepared an "ECLA to CPC“ (static) and "CPC to

IPC" (dynamic) concordance tables

IPC Guide: www.wipo.int/classifications/ipc/en/

http://www.cpcinfo.org/

http://www.cooperativepatentclassification.org/

https://worldwide.espacenet.com/classification?locale=en_EP

http://www.cooperativepatentclassification.org/Training.html

http://www.cooperativepatentclassification.org/cpcConcordances.html

http://www.wipo.int/classifications/ipc/en/


Table of contents

Introduction of CPC main groups

H04L 45; H04W 40, H04W 28/02; H04L 47, H04L 49


in the main groups



Classification strategy

Routing

Path Finding

Flow/congestion

Control

General. Transmission

medium independent H04L 45 H04L 47/10

Specially adapted

for Wireless H04W 40

H04W 28/02

H04W 28/10



General routing or path finding H04L 45

This group covers:

Routing or path finding of packets in data switching networks.

Includes:

Topology Determination (H04L 45/02)

Shortest Path Computation (H04L 45/12)

Hierarchical Routing / Cluster Based Routing (H04L 45/04)

Routing Multiclass Traffic (H04L 45/30)

Address processing, look-up (H04L 45/745)

H04L 45 is not:

Routing or path finding of packets in data switching networks

specially adapted for wireless routing (H04W 40)

Topology determination for network planning or dimensioning (H04L 41)

Use of redundant (shortest) paths for purpose of load balancing

(H04L 47/125)




Example I: Topology Determination and Update.

Network reconfiguration. Topology database

update and exchange. A node joins or leaves

the network. Update of link metrics in a

distributed routing system.

Conversion of physical to logical topology for

routing (H04L 45/02).

Topology issues related specifically to wireless

networks are classified under H04W40/24

classes.

CPC(I): H04L 45/021. . Routing table update

consistency, e.g. epoch number

This code relates to arrangements to make sure

that the routing table contained in each router

corresponds to the latest available version.




Example II: Topology Determination and Update

(H04L 45/02).

CPC(I): H04L 45/02 Topology database update

and exchange.



Wireless routing or path finding H04W 40

This group covers:

Techniques and arrangements for selectively establishing one or a plurality of communication paths involving at least one wireless path, from information sources to information sinks, over which information is communicated. Techniques and arrangements for discovering, establishing, maintaining connectivity information among affiliated wireless equipment, e.g. routing lists. Techniques and arrangements for path selection, path optimisation in network.

Includes:

Topology update in ad-hoc networks, e.g. Frequent Route Recalculation (H04W 40/24)

Wireless Specific Metrics (H04W 40/02)

Proactive vs. Reactive routing (H04W 40/28 and H04W 40/30)

Connection to the Infrastructure (H04W 40/22)




H04W 40 is not:

Wireless Network selection or access point selection (H04W 48)

Connection management, e.g. connection set-up, manipulation,

release (H04W 76)

Wireless Network topologies (H04W 84)




Example I: Connectivity information management, e.g. connectivity discovery or connectivity update, specially adapted for wireless networks (H04W 40/24)

CPC(I): H04W 40/24. Topology update or discovery in combination with routing of packets specially adapted for wireless communications; techniques and arrangements for establishing neighbour lists of network(s) or relaying or forwarding terminal devices, e.g. routing lists, routing tables; maintaining or updating established neighbour lists to reflect changes in connectivity information, e.g. (relaying or forwarding) terminal leaving or joining the network. Exchange of "hello messages".




Example II: Connectivity information

management, e.g. connectivity discovery or

connectivity update, specially adapted for

wireless networks (H04W 40/24)

CPC(I): H04W 40/248. Connectivity information

update. Topology update combination with

routing of packets; updating established

neighbour lists to reflect changes in connectivity

information, e.g. (relaying or forwarding)

terminal leaving or joining the network.



Traffic regulation H04L 47/10

This group covers: Traffic regulation in packet switching networks

Includes:

Flow Control, Congestion Control (H04L 47/10)

There are two basic reactions to throughput degradation in a network.

− The first is called Flow Control and is carried out by the source or

the destination of a certain communication after degradation is

encountered (e.g. modifying the acknowledge window) without

intervention of the network.

− The second is Congestion Control and concerns the reactions of

the network to general degradation identified in the network

components (nodes or links).

H04L 47/10 is not:

Management of network congestion due to network faults or events

or alarms (H04L 41)

Arrangements for detecting or correcting errors in the information

received (H04L 1)




Example: Congestion avoidance or recovery

(H04L 47/12)

CPC(I): H04L 47/125... Load Balancing or

distribution; this code should be considered as a

general one and applicable to H04L 45/00 and

H04L 47/00 as well as to other fields in H04L.

H04L 45/24 also captures the balancing aspect,

but in relation to other routing aspects like

shortest path or manipulation or distribution of

routing tables.




Includes:

Queuing. Queue Scheduling (H04L 47/50)

H04L47/50 is: Queue forming and consequent scheduling

− Queuing (queue forming) is defined as the action of storing an

incoming packet in one of several available queues according to

a given criteria

− Scheduling is defined as the process of selecting packets in

different queues according to a given criteria

H04L 47/50 is not:

Packet storage in different queues for purposes other than

scheduling. E.g. for flow control or multiplexing

Scheduling of network terminals for accessing a transmission media.

Scheduling of connections for creating a multiplex where no queuing

is involved.




Example: Queue Scheduling (H04L 47/50).

Packet Scheduling is necessary when multiple

packets compete for a common link. The

scheduling normally happens in the input/output

buffers of a switch or a router or in the shared

memory of the switches.

CPC(I): H04L 47/52... Bandwidth allocation to

queues. Example of Custom queueing. With

CQ, bandwidth is allocated proportionally for

each different class of traffic. CQ allows to

specify the number of packets to be drawn from

the queue, which is especially useful on slow

interfaces.




This group covers:

Access/Admission Control (Resource Allocation/Management at the

ingress point) (H04L47/70)

When?

− At Call Set-up

− Renegotiation In-Call (H04L 47/76)

Where?

− At the Ingress Point (UNI)

− Along the Communication Path (RSVP) (H04L 47/24)

− Between Different Domains (Bandwidth brokers) (H04L 47/783)

− Resources of the Destination Endpoint (Buffer) (H04L 47/722)

What?

− Mostly Bandwidth

− QOS Assurance (Real Time Traffic) (H04L 47/80)




H04L 47/70 is not:

Access control for security assurance(H04L 63)

Management of resources of a LAN segment characterised by the

topology (H04L 12/28)

Management of resources of the air interface (H04W)

Resource management for network planning or dimensioning

(H04L 41)

Billing for the use of the network resources (H04L 12/14)

Resource Management for Network Applications (IMS, Client-Server)

Call set-up without resource management




Example: Reservation Actions (H04L 47/72).

Resources are reserved in advance, usually at

call setup time in order to assure a quality of

service (QoS).

CPC(I): H04L 47/726 … Reservation of

resources over a plurality of alternate paths,

e.g. for load balancing. Reservation is

performed over a plurality of paths for the

communication. A typical motivation is load

balancing. Load balancing per se is classified

under H04L 47/125.



Packet switching elements H04L 49

This group covers: Packet switching elements

Includes:

Switch Architecture

Input/output ports details (H04L 49/30)

− Header conversion. Packet splitting. Queuing strategy

Switch fabric construction (H04L 49/10)

− Crossbar. Matrix. Shared memory. Shared medium.

− Interconnection of switching modules. Parallel switching planes

Switch control (Several places)

− Scheduling of inputs (HoL blocking avoidance)

− Multicast support




Includes:

Auxiliary functionality

− Routing/path finding through the switching fabric (H04L 49/25)

− Flow control (H04L 49/50) and Error recovery (H04L 49/55)

Special switch units with extended functionality (H04L 49/35)

− Ethernet Gigabit

− Fibre Channel

− Switch on chip (SOC)

The special case of ATM switches (not active anymore)




Example I: Switching fabric construction relates

to the construction of the interconnect, or

switching fabric or switching network, which

connects every input port of the switch to every

output port of the switch (H04L 49/10)

CPC(I): H04L 49/101.. Crossbar or Matrix.

The space (spatial) switching function is the

one which allows the connection between every

input and every output. The information is

routed internally in the switch. The internal

structure of the switch must allow connections

between every input to every output. A crossbar

or matrix switching fabric as shown above is a

typical example for a space switching type of

switching fabric.




Example II: Interconnection of switching

modules (H04L 49/15)

CPC(I): H04L 49/1523.. Parallel switch planes.

Multiple parallel switch planes can be used

either for sharing the load or reducing the speed

of the switching network. In this case all packets

of a connection may be routed via the same

plane. This avoids the problem of resequencing

at the output of the switch. If parallel planes

(typically two) are used for increasing the fault

tolerance of the switch, packets are duplicated

at the inputs, transmitted across the two

different planes and arbitrated at the outputs of

the plane.



Queueing/packet buffering H04L 49/90

This group covers: Packet buffering

Includes:

Arrangements for packet storage in an endpoint or a transit node

Data organisation

− Linked list. Descriptors

Memory organisation

− Buffer pool. External memories

H04L 49/90 is not:

Application related storage. Packet play-out storage for audio/video

(H04N 7)

Memory management not related to data packets (G06F 12)

Storage Area Networks (H04L 67)



Queueing/packet buffering H04L 49/90

Example: Queueing arrangements in packet

switching networks (H04L 49/90). Buffer

allocation to packets. It contains memory

location (internal, external), buffer pools,

memory partition to adapt to packet size,

linked list of buffers.

CPC(I): H04L 49/9021 …. Plurality of buffers

per packet

Several sections of the memory are reserved to

store a single packet. Each of the sections point

to the following one in order to maintain the

sequence of the original packet.



Wireless flow control or congestion control

H04W 28/02

This group covers: Avoiding or regulating an actual or potential traffic overload condition

H04W 28/02 Includes: Arrangements for Avoiding or regulating an actual or potential traffic

overload condition − Based on communication conditions. Using specific QoS parameters − Detection of congestion or overload during communication.

Congestion control. Buffer status reports

H04W 28/02 is not: Techniques to regulate the amount of communication information in

the network (in which flow control is seen from the network point of view, involving backbone network entities which can communicate to perform flow control. This covers up and downlink (H04W 28/10)

Wireless access protocols, e.g. CSMA Wireless Resource reservation or negotiation at call setup



Wireless flow control or congestion control

H04W 28/02

Example: Traffic management, e.g. Flow control

or Congestion control specially adapted for

wireless networks (H04W 28/02)

CPC(I): H04W 28/0268.. using specific QoS

parameters for wireless networks, e.g. QoS

class identifier [QCI] or guaranteed bit rate

[GBR].


Thank you for your attention!

Date post:	18-Jan-2020
Category:	Documents
Upload:	others
View:	1 times
Download:	0 times

CPC field-specific training...European Patent Office 3 Introduction The subclasses H04L and H04W in...

Documents