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

Method and apparatus for limiting the number of build-up packets during the process of building up a routing address in a digital telecommunication network

Assignee: Hasler AG
•
Filing: 1976-08-31
•
Granted: 1978-03-14
•
Expires: 1996-08-31
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract The invention relates to a method for limiting the number of build-up packets during the process of building-up a routing address for the subsequent transmission of address-coded packets, the addresses of these packets being this said routing address, from a first to a second subscriber of a digital telecommunication network. This network comprises a plurality of switching nodes, a plurality of subscribers, a plurality of bearer channels connecting each switching node with at least one other switching node and with no subscriber, or with one or more of said subscribers, a plurality of routing words individually assigned to the bearer channels and a plurality of call numbers individually assigned to the subscribers. During the process of building-up a routing address the first subscriber despatches a build-up packet containing the call number of the called second subscriber, said build-up packet received by a first switching node is retransmitted through all bearer channels connected to this switching node, such retransmission being continued at each switching node upon reception of each build-up packet, thus the number of build-up packets increasing rapidly within the network. The method for limiting this number of build-up packets comprises at each switching node the storing of the call number of the second subscriber upon reception of a first build-up packet during a predetermined time interval starting with the reception of this first build-up packet, comparing during said time interval the call numbers contained in the subsequently received build-up packets with the call number stored, counting all of said subsequently received build-up packets with a call number corresponding with the call number stored, comparing respective count with a predetermined limiting value, and eliminating each of said subsequently received build-up packet, if said respective count is higher than said predetermined limiting value.

Inventors

  • 👤 Eberhard Schwerdtel

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-23 19:46
CPC Classifications
H; H04; H04L; H04L45/00; H04L45/36; H04Q; H04Q11/00; H04Q11/04

Claims Analysis

Total Claims: 6
Claim 1
Independent Claim 163 words
A method for limiting the number of build-up packets during the process of building-up a routing address for the subsequent transmission of address-coded packets, the addresses of these packets being this said routing address, from a first to a second subscriber of a digital telecommunication network, this network comprising, a plurality of switching nodes, a plurality of subscribers including said first and second subscriber, a plurality of bearer channels connecting each switching node with at least one other switching node and with no, one or more of said subscribers, a plurality of routing words individually assigned to said bearer channels, a plurality of call numbers individually assigned to said subscribers, in which said process of building-up a routing address, the first subscriber dispatches a build-up packet containing the call number of the called second subscriber, said build-up packet received by the switching node connected to the first subscriber is retransmitted by this switching node through all bearer channels connected to this switching node,
Claim 2
Independent Claim 163 words
A method for limiting the number of build-up packets during the process of building-up a routing address for the subsequent transmission of address-coded packets, the addresses of these packets being this said routing address, from a first to a second subscriber of a digital telecommunication network, this network comprising, a plurality of switching nodes, a plurality of subscribers including said first and second subscriber, a plurality of bearer channels connecting each switching node with at least one other switching node and with no, one or more of said subscribers, a plurality of routing words individually assigned to said bearer channels, a plurality of call numbers individually assigned to said subscribers, in which said process of building-up a routing address, the first subscriber dispatches a build-up packet containing the call number of the called second subscriber, said build-up packet received by the switching node connected to the first subscriber is retransmitted by this switching node through all bearer channels connected to this switching node,
Claim 3
Dependent Claim 128 words
such retransmission is continued at each switching node upon reception of a build-up packet, the method of limiting the number of said build-up packets comprising at each switching node, storing of the said call number of the second subscriber upon reception of a first build-up packet during a preetermined time interval, which starts with the reception of said first build-up packet, comparing during said time interval the call numbers contained in the subsequently received build-up packets with the call number stored, counting of all said subsequently received build-up packets with a call number corresponding wth the call number stored, comparing the respective count with a predetermined limiting value, and eliminating each of said subsequently received build-up packet, if said respective count is higher than said predetermined limiting value.
Claim 4
Dependent Claim 128 words
such retransmission is continued at each switching node upon reception of a build-up packet, the method of limiting the number of said build-up packets comprising at each switching node, storing of the said call number of the second subscriber upon reception of a first build-up packet during a preetermined time interval, which starts with the reception of said first build-up packet, comparing during said time interval the call numbers contained in the subsequently received build-up packets with the call number stored, counting of all said subsequently received build-up packets with a call number corresponding wth the call number stored, comparing the respective count with a predetermined limiting value, and eliminating each of said subsequently received build-up packet, if said respective count is higher than said predetermined limiting value.
Claim 5
Dependent Claim 158 words
A swiching node of a digital telecommunication network for the transmission of addressed-coded packets comprising, a sorting switch (80) for separating information packets and build-up packets, a shift register (82) for storing the incoming build-up packets, a store (84) for storing the call-number contained in the first incoming build-up packet for a predetermined time interval, starting by storing the said call-number, a comparator circuit (83) connected to said register (82) and said store (84), a counter (95) controlled by said comparator circuit (83) for counting the subsequent incoming build-up packets whose call-number corresponds to the call-number stored in said store (84), a logic circuit (96, 97) controlled by said counter (95) for causing retransmission of the build-up packet, stored in said register (82), if the position of the counter is lower than or equal to a predetermined limiting value, and a timing circuit (87) for resetting said store and said counter on the end of said time interval.
Claim 6
Dependent Claim 158 words
A swiching node of a digital telecommunication network for the transmission of addressed-coded packets comprising, a sorting switch (80) for separating information packets and build-up packets, a shift register (82) for storing the incoming build-up packets, a store (84) for storing the call-number contained in the first incoming build-up packet for a predetermined time interval, starting by storing the said call-number, a comparator circuit (83) connected to said register (82) and said store (84), a counter (95) controlled by said comparator circuit (83) for counting the subsequent incoming build-up packets whose call-number corresponds to the call-number stored in said store (84), a logic circuit (96, 97) controlled by said counter (95) for causing retransmission of the build-up packet, stored in said register (82), if the position of the counter is lower than or equal to a predetermined limiting value, and a timing circuit (87) for resetting said store and said counter on the end of said time interval.

References Cited (Backward Citations)

No citation records indexed.

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1981-03-13 1981-09-12 1982-03-14 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1985-03-13 1985-09-12 1986-03-14 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1989-03-13 1989-09-12 1990-03-14 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag