Patent EP0212031A1 successfully refreshed from Google Patents.
← Back to Patent Explorer
EP0212031A1 Expired / Lapsed EP ⏱️ 0.0 years remaining

Dynamic bandwidth allocation mechanism between circuit slots and packet bit stream in a communication network

Assignee: Compagnie IBM France SAS
•
Filing: 1985-08-13
•
Granted: —
•
Expires: 2005-08-13
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract System to be used for dynamically allocating circuit slots in the frames which are used for exchanging bits between users connected to nodes of a communication network linked by means of medium links having transmit and receive interfaces, said frames being delimited by flags and divided into bit slots which may be devoted to synchronous circuit flow and to asynchronous packet flow. It comprises in each node means for changing the flags preceding at least one frame in which at least one slot is to be added or deleted to a value including a first number of delimiting bits and a second number of bits which are coded to indicate that slot(s) is (are) to be added or deleted and the corresponding slot number(s); means for sending call control packets which are propagated through the network nodes, comprising call control information , routing information and indicating the circuit user slot number(s) to be added or deleted on specified link interfaces, and means receiving the call control packets and the changed flags for adding or deleting circuit user slot(s) in the subsequent frames depending upon the flag value.

Inventors

  • 👤 Jean Calvignac
  • 👤 Pierre Secondo

Bibliographic Details

Application Number —
Jurisdiction EP
Data Source google_patents
Last Synchronized 2026-10-25 12:43
CPC Classifications
H; H04; H04Q; H04Q11/00; H04Q11/04; H04Q11/0428; H04L; H04L12/00; H04L12/64

Claims Analysis

Total Claims: 8
Claim 1
Independent Claim 196 words
System to be used for dynamically allocating circuit slots in the frames which are used for exchanging bits between users connected to nodes of a communication network linked by means of medium links having transmit and receive interfaces, said frames being delimited by flags and divided into bit slots which may be devoted to synchronous circuit flow and to asynchronous packet flow, characterized in that it comprises in each node: means (20, 238, 232) for changing the flags preceding at least one frame in which at least one slot is to be added or deleted to a value including a first number of delimiting bits and a second number of bits which are coded to indicated that slot(s) is (are) to be added or deleted and the corresponding slot number(s), means (418, 404) for sending call control packets which are propagated through the network nodes, comprising call control information, routing information and indicating the circuit user slot number(s) to be added or deleted on specified link interfaces. means (418, 128, 106) receiving the call control packets and the changed flags for adding or deleting circuit user slot(s) in the subsequent frames depending upon the flag value.
Claim 2
Dependent Claim 196 words
System to be used for dynamically allocating circuit slots in the frames which are used for exchanging bits between users connected to nodes of a communication network linked by means of medium links having transmit and receive interfaces, said frames being delimited by flags and divided into bit slots which may be devoted to synchronous circuit flow and to asynchronous packet flow, characterized in that it comprises in each node: means (20, 238, 232) for changing the flags preceding at least one frame in which at least one slot is to be added or deleted to a value including a first number of delimiting bits and a second number of bits which are coded to indicated that slot(s) is (are) to be added or deleted and the corresponding slot number(s), means (418, 404) for sending call control packets which are propagated through the network nodes, comprising call control information, routing information and indicating the circuit user slot number(s) to be added or deleted on specified link interfaces. means (418, 128, 106) receiving the call control packets and the changed flags for adding or deleting circuit user slot(s) in the subsequent frames depending upon the flag value.
Claim 3
Dependent Claim 86 words
System according to claim 1 characterized in that the frames contain a known number Nc of bits and the first number of delimiting bits is equal to 2 bits which are set to opposite values (01 or 10), and the second number of bits include at least two bits, the first one indicating that the following bit will be coded to indicate that a circuit slot is to be added or deleted, the second one indicating that a circuit slot is to be added or deleted.
Claim 4
Dependent Claim 101 words
System according to claim 1 characterized in that the frames contain a known number Nc of bits and the first number of delimiting bits is equal to 2 bits which are set to opposite values (01 or 10), and the second number of bits include at least three bits, the first one indicating that the following bit will be coded to indicate that a circuit slot is to be added or deleted, the second one indicating that a circuit slot is to be added or deleted and the following bit(s) indicating the slot number which is to be added or deleted.
Claim 5
Dependent Claim 228 words
System according claim 1, 2 or 3 characterized in that for adding circuit slot(s) in the frames in order to establish a full duplex connection between a calling user connected to an originator node and a called user connected to a destination node, the call control packet comprises: a call request packet, which is sent on the transmit interface of one of the originator node outgoing link and which indicates the calling user number, the called number and the slot number(s) to be added on a specified node outgoing link interface, said call request packet being propagated through the network until it reaches the destination node, in such a way that the slot number(s) is (are) updated in each crossed node to indicated the slot number(s) to be added on a specified node outgoing link, a call connected packet, which is sent on the transmit interface of one of the destination node outgoing link and which indicates the calling number, the called number and the slot number(s) to be added on a specified node outgoing link interface, said call request packet being propagated through the same network nodes as the call request packet until it reaches the originator node, in such a way that the slot number(s) is (are) updated in each crossed node to indicate the slot number(s) to be added on a specified node outgoing link.
Claim 6
Dependent Claim 161 words
System according to claim 4 characterized in that it comprises means (418) in each node for determining whether slot(s) may be added depending upon the frame configuration, whereby if said means find that the maximum number of slots which may be allocated to circuit users is reached it causes a clear request packet to be propagated to the originator node, said clear request packet comprising the calling number, the called number and the slot number(s) to be deleted on the interface which was previously selected for sending the call request packet and this packet is propagated in the network until the originator node, the slot number(s) being updated in each crossed node so as to indicate the slot number(s) to be deleted on the outgoing interfaces which were previously selected for propagating the call request packet and the opening flags of the subsequent frames sent on these interfaces are set to coded values indicating which slot(s) is (are) to be deleted.
Claim 7
Dependent Claim 26 words
System according to claim 5 characterized in that the receiving by the originator node causes a clear confirmation packet to be sent by the originator node.
Claim 8
Dependent Claim 283 words
System according to any one of claim 4, 5 or 6 characterized in that: for deleting circuit slots in the frames in order to release the full duplex connection which were previously established between the calling user and the called user, the call control packets comprise: a clear request packet, which is sent on the transmit interface of one of the outgoing link of the node connected to one of the users and which indicates the calling user number, the called number and the slot number(s) to be deleted on the specified node outgoing link interface, said clear request packet being propagated through the network by crossing the same nodes as the call request packet or the call connected packet depending upon which user initiates the release procedure, until it reaches the node connected to the other user, in such a way that the slot number(s) is (are) updated in each crossed node to indicate the slot number(s) to be deleted on the specified node outgoing link, a clear confirmation packet, which is sent on the transmit interface of one of the outgoing link of the node connected to the other user and which indicates the calling number, the called number and the slot number(s) to be deleted on the specified node outgoing link interface, said clear confirmation packet being propagated by crossing the same nodes as the call request packet or the call connected packet depending upon which user initiates the release procedure until it reaches the node connected to the first user, in such a way that the slot number(s) is (are) updated in each crossed node to indicated the slot number(s) to be deleted on the specified node outgoing link.

References Cited (Backward Citations)

No citation records indexed.

USPTO Annuity & Maintenance Windows

Maintenance schedule is calculated for granted US utility patents.

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag