Patent EP1009129A2 successfully refreshed from Google Patents.
EP1009129A2
Expired / Lapsed
EP
⏱️ 0.0 years remaining
System and method for assigning labels in a data transmission network using label switching
Assignee: International Business Machines Corp
•
Filing: 1999-04-15
•
Granted: —
•
Expires: 2019-04-15
Abstract
Abstract System and method for assigning labels in a data transmission network (10) in which flows of data composed of packets (16) are transmitted from a source node to a destination node through a plurality of switching nodes and of the type wherein an identification label (18) identifying each flow of data is added by a transmitting node (12) to each packet of the flow of data before the packet is transmitted from the transmitting node to a receiving node (14) adjacent to the transmitting node, the identification label being recognized by the receiving node for the identification of the flow of data. Each switching node comprises identical label assignment means (20 or 22) for generating an identification label each time a new flow of data is received by the node, the label assignment means of the transmitting node and of the receiving node both generating an identical label when they both receive the flow of data, thereby avoiding the transmitting node (or the receiving node) from having to send the identification label to the receiving node (or the transmitting node) in order to be recognized by the receiving node when receiving the packets of said flow of data.
Inventors
- 👤 Jean-François Le Pennec
- 👤 Jacques Fieschi
- 👤 Alain Benayoun
- 👤 Claude Galand
Bibliographic Details
Application Number
—
Jurisdiction
EP
Data Source
google_patents
Last Synchronized
2026-11-08 00:56
CPC Classifications
H; H04; H04L; H04L12/00; H04L12/28; H04L12/46; H04L12/4641
Claims Analysis
Total Claims: 13
Claim 1
Independent Claim
211 words
System for assigning labels in a data transmission network (10) in which flows
of data composed of packets (16) are transmitted from a source node to a
destination node through a plurality of switching nodes and of the type wherein
an identification label (18) identifying each flow of data is added by a
transmitting node (12) to each packet of said flow of data before said packet is
transmitted from said transmitting node to a receiving node (14) adjacent to
said transmitting node in said network, said identification label being
recognized by said receiving node for the identification of said flow of data ; Said system being characterized in that each one of said plurality of
switching nodes comprises identical label assignment means (20 or 22) for
generating an identification label each time a new flow of data is received by
the node, the label assignment means of said transmitting node and of said
receiving node both generating an identical label when they both receive said
flow of data, thereby avoiding said transmitting node (or said receiving node)
from having to send said identification label to said receiving node (or said
transmitting node) in order to be recognized by said receiving node when
receiving said packets of said flow of data.
Claim 2
Dependent Claim
82 words
System according to claim 1, wherein both said transmitting node (12) and said
receiving node (14) include an assigned label table (24 or 26) the locations of
which are filled by the packet headers of the flows of data transmitted from
said transmitting node to said receiving node, each address of said table being
the identification label (LAB) generated by said label assignment means (20 or
22) and identifying the flow of data whose packet header is stored in the
corresponding location.
Claim 3
Dependent Claim
42 words
System according to claim 2, wherein both said transmitting node (12) and said
receiving node (14) include a free label table (32) the locations of which are
filled by labels which are made free by said label assignment means (20 or
22).
Claim 4
Dependent Claim
57 words
System according to claim 3, wherein a pointer (FREEL) is associated with
said free label table (32) to designate the location of said table containing the
next label to be generated by said label assignment means (20 or 22) when a
new flow of data is transmitted from said transmitting node (12) to said
receiving node (14).
Claim 5
Dependent Claim
37 words
System according to any one of claims 2 to 4, wherein both said transmitting
node (12) and said receiving node (14) comprise checking means for running a
CRC checking of said assigned label table (24 or 26).
Claim 6
Dependent Claim
38 words
System according to claim 3 or 4, wherein both said transmitting node (12) and
said receiving node (14) comprise checking means for running a CRC
checking said labels made free by said label assignment means (20 or 22).
Claim 7
Dependent Claim
185 words
Process for assigning labels in a data transmission network (10) in which flow
of data composed of packets (16) are transmitted from a source node to a
destination node through a plurality of switching nodes and of the type wherein
an identification label (18) identifying each flow of data is added by a
transmitting node (12) to each packet of said flow of data before said packet is
transmitted from said transmitting node to a receiving node (14) adjacent to
said transmitting node in said network, said identification label being
recognized by said receiving node for the identification of said flow of data,
said process being characterized in that an identical label (18) is generated by
both said transmitting node (12) and said receiving node (14) each time a new
flow of data is transmitted from said transmitting node to said receiving node
thereby avoiding said transmitting node (or said receiving node) from having to
send said identification label to said receiving node (or said transmitting node)
in order to be recognized by said receiving node when receiving said packets
of said flow of data.
Claim 8
Dependent Claim
65 words
Process according to claim 7, wherein said identification labels are generated
in a first time by filling an assigned label table (24 or 26) with the headers of
the flow of data being transmitted from said transmitting node (12) to said
receiving node (14) and taking the address of the location wherein is stored
said header as identification label of the corresponding flow of data.
Claim 9
Dependent Claim
38 words
Process according to claim 8, wherein said identification labels are generated
in a second time by using a label stored in a free label table filled with a list of
labels which are made free using predefined criteria.
Claim 10
Dependent Claim
57 words
Process according to claim 9, wherein a pointer (FREE) is used to designate
the location of said free label table (32) containing the next label to be used
when a new flow of data is transmitted from said transmitting node (12) to said
receiving node (14), said pointer being incremented each time a new label is
assigned.
Claim 11
Dependent Claim
47 words
Process according to any one of claims 8 to 10, wherein a CRC checking of
said assigned label table (24 or 26) is run in both said transmitting node (12)
and said receiving node (14) each time a predetermined number (N) of
identification labels has been generated.
Claim 12
Dependent Claim
39 words
Process according to claim 9 or 10, wherein a CRC checking of said free
label table (32) is run in both said transmitting node (12) and said receiving
node (14) each time said list of labels are made free.
Claim 13
Dependent Claim
31 words
Process according to claim 12 wherein said predefined criteria for making
free said list of labels are the age of the labels and/or the number occurrences
since the preceding CRC checking.
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
Maintenance schedule is calculated for granted US utility patents.