Title of Invention

METHOD FOR RESERVING BANDWIDTH

Abstract

W" Q CI I I A y^^^^^ v V ABSTRACT ^\ " ^ n %^^ TITLE: METHOD FOR RESERVING BANDWIDTH I ^ ORIGINAL The invention relates to a method for reserving bandwidth in a pacicet-switched networl< in which a paci^et-switched communication relationship is created between a multiplicity of network elements (1, 2, 3,4, 5, 6) via at least one communication branch (A, B, C, D, E, F, G, H, I, J), wherein several connection structures belong to the communication relationship and after successful establishment of the connection a single connection is maintained, with the following steps: a) allocation of a unique identification number for the communication relationship to identify the communication branches (A, B, C, D, E, F, G, H, I, J) belonging to the communication relationship, wherein several connection structures for the communication relationship run via a common communication branch (A, B, C, D, E, F, G, H),b)testing of a communication branch (A, B, C, D, E, F, G, H, I, J) of the communication relationship for bandwidth requirements (BW) requested by network elements (1, 2, 3, 4, 5, 6) with said identification number and determination of a bandwidth for the common communication branch (A, B, C, F, G, H) as a maximum (MAX) of bandwidth requirements (BW) requested in this communication branch for the individual connection structures, (bO) creation of the connection from several alternative connection creation attempts,bl) release of bandwidth requirements (BW) in communication branches (B, C, D, E, F, G, I, J) not involved in the connection, c) reservation of a bandwidth in the communication branch concerned (A, B, C, D, E, F, G, H, I, J) using the bandwidth value. {Fig.l} i !

Full Text

Description Method for reserving bandwidth The invention concerns a method and an arrangement for reserving bandwidth in a packet-oriented network. Planning and allocation of bandwidth is known in packet-oriented networks. The term bandwidth is understood to mean an expected cr actual value of a volume of data exchanged per time unit between network elements. In packet-oriented, networks, frequent use is made of bandwidth reservation between two or more network elements. Such bandwidth reservation is implemented, for example, for an enhanced priority data exchange, or for a data exchange that provides for a real-time or quasi real-time transmission. The latter transmission is employed in particular for communication using an RTP (real-time protocol) , for a VoIP (voice over Internet protocol) communication connection, for example. In the case where a logical call setup is initially directed to several alternate destination network elements, subsequent to a successful call setup with one of the destination network elements, in order to then maintain a single connection to this network element, a conventional bandwidth reservation proves to be inefficient in this respect, since a reservation is initially made for all alternate destination network elements. As a result, transmission capacities are unnecessarily committed for a considerable period of time. Similarly, a call setup from one of several alternate source network elements, from which a single call is sent out following a successful call set-up with one of the source network elements, proves to be just as inefficient. The object of the invention is to state an improved method for bandwidth reservation in a logical connection of network elements in a packet-brientsc network. Regarding its method, one solution to the problem is achieved by a method having the features of claim 1 and regarding its device, by an arrangement having the features of claim 5. The method according to the invention for reserving bandwidth in a packet-oriented network, in which a packet-oriented communications link is established between a plurality of network elements via at least one communication path, provides in a first step for aa allocation of an identification number that is unique to the communication link, to identify the communication paths associated with the communication link. Furthermore, provision is made for determining a bandwidth value for a respective communication path, in which the bandwidth value results in a maximum number of bandwidth requests requested by network elements in this communication path. Finally, a reservation of a bandwidth in the respective communication path is mace by means of the calculated bandwidth value. The method according to the invention is based on the idea of replacing individual bandwidth reservations by a section-by-section or communication path-wise reservation, with the objective of reserving in the individual communication paths a bandwidth for the actual connection which ultimately materializes from several alternate call setup attempts. Instead of a known allocation of a respective identification number for a respective call set-up, the solution according to the invention is based on an allocation of an identification number that is unique to all call set-ups associated with the communication link. A bandwidth, management system evaluating this identification number is thus able to prevent multiple reservation in individual communication paths. In this case the communication path is an assumed logical connection between two network elements or between a network element and a network node in the packet-oriented network that is otherwise considered to be connectionless. On each communication path along the communication link to be set up the bandwidth management system checks whether bandwidth reservations with a given identification number are already present. If an identification number to be examined coincides, with a given identification number, no new bandwidth reservation is made; instead, an existing bandwidth reservation is confirmed or corrected to a higher bandwidth requirement. Thus, if for a communication link to be set up several call set-ups are running over a common communication path, instead of a previously known individual reservation, the highest value or maximum requested bandwidth of the individual call setups is determined and the requested bandwidth with this highest value is set in this communication path. An important advantage of the method according to the invention is to be seen in the fact that its use enables more effective network management with lower consumption of network resources. Advantageous developments of the invention are cited in the subclaims. An exemplary embodiment with further advantages and embodiments of the invention is explained in further detail below with the aid of the drawing, in which: Figure I: shows a block diagram for the schematic representation of the establishment of a communication link with a plurality of called network elements, Figure 2: shows a block diagram for the schematic representation of the establishment of a communication link with a plurality of calling and called network elements. Figure 1 shows a section of a packet-oriented network. The component parts of this packet-oriented network are a first network element 1, a third network element 3, a fourth network element 4, a fifth network element 5, a sixth network element 6, a first node element Nl and a second node element N2. Some of the above-mentioned functional units are interconnected by communication paths A, B, C, D, E., These communication paths A, B, C, D, E are to be allocated to a communication link to be established, starting from first calling network element 1. Initially in this case, a "calling" network element is generally understcod to be a network element initiating a communication link. In an exemplary embodiment of the invention to be explained later - with the use of packet-oriented communication terminals or VoIF terminals - in accordance with telecommunications terminology the calling network element is to be considered as the source of a real-time communication to be established, such as a voice, video connection, etc., for example. A first communication path A is located between the calling network element 1 and the first node element Nl. A second communication path B is located between the first node element Nl and the third or fourth network element 3, 4. A third communication path C is located between the first and the second node element Nl, N2. A fourth communication path D is located between the second node elemen- N2 and the fifth network element 5. A fifth communication path E is located between the second node element N2 and the sixth network element 6. The above-mentioned communication paths are to be considered as "logic" connections, that is to say above a logical connection layer of a network protocol stack. The connection paths A, B, C, D, E belong to one and the same communication link which starts from the calling network element 1 and therefore all carry the same identificaticn number. A situation in which a calling network element initially calls several network elements, 3, 4, 5, 6 as the destination and with a successful call set-up communicates exclusively from this moment on with one of the network elements 3, 4, 5, 6, is a so-callec "multiaddress call", for example. In the above-mentioned performance feature a calling VoIE communication terminal 1 calls a call pickup group consisting of terminals 3, 4, 5, 6. On receipt of the call at one of the terminals 3, 4, 5, 6, .the communication link between this terminal and the calling terminal 1 is established, while each of the remaining communication paths A, B, C, D, E are again free. In the above-meationed exemplary embodiment of the network elements 1, 3, 4, 5, 6, as VoIP communication terminals 1, 3, 4j 5, 6, the node elements Nl, N2 take on the function of a communication system, for example. In this case the communication system can have conventional TDM (time division multiplex) switching technology with an interface to the packet-oriented network via gateways, and in relation to switching can operate in true packet-oriented mode (for example using the SIP protocol (session initiation protocol) or alsc exist as a hybrid of the latter embodiments. Such a hybrid-type is also often described as a "convergent" communication system. In the case of an outgoing call by the terminal 1 -controlled by the communication system Nl - the first communication system Nl initiates a bandwidth reservation request for the depicted communication paths A, B, C, D, E, which, in addition to an identification number, contains a statement of the source, destination and corresponding bandwidth requests. Using the method according to the invention, a bandwidth management system - not shown - reserves a bandwidth in the individual communication paths A, B, C, D, E, in accordance with the following conditions: first communication path A: MAX [BW (3), BW (4). BW (5), BW(6)I second communication path B: MAX [BW (3), BW (4) ] third communication path C: MAX [BW(5), BW{6)] fourth communication path D: BW(5) fifth communication path E: BW(6) Here the formula character MAX signifies the maximum arguments enclosed in square brackets. The argument BW(*) signifies a bandwidth request of the argument enclosed in brackets * which * is the number denoting the respective network element, which coincides with the reference numbers of the network elements 1, 3, 4, 5, 6, For the fourth and fifth communication paths D, Z and the communication path topology given here, there is no computational rule for a maximum since in this case only a bandwidth BW(5), BW(5) has to be reserved each time for the fifth or sixth network element. Therefore MAX [BW(5)] = BW(5) or MAX [BW(6)] = BW(6) applies in this case. In the case where specific reservation requests are rejected due to bottlenecks in the packet-oriented network or because of other reasons, the following options are provided according to the following embodiments of the invention. A failed bandwidth reservation which was signaled by means of an acknowledgment message will be used as an opportunity to remove an associated destination network element 3, 4, 5, 6 from a destination list and not signal the incoming call to this network element. Alternately, the incoming call at the affected destination network element 3, 4, 5, 6 is signaled by a message that is output at an output unit, which message gives the subscriber information about an existing bandwidth problem. Alternately or additionally, a further bandwidth reservation attempt is made an acceptance of the incoming call with a previously successful bandwidth reservation. Receipt of an incoming call at a call pickup group, fcr example at the fifth terminal 5, causes all non-participating communication paths B, E to be released on the now successful "thru-connected" link to the fifth terminal 5 via the communication paths A, C, D. The bandwidth reservations allocated to the released communication paths B, E are released. Consequently, the required bandwidth is accurately reserved for the existing connection. Figure 2 shows a variant of communication path topology similar to that achieved in figure 1, in which a second network element 2 appears on the calling side and on the called side only the third and the sixth network element is included in the communication link. Such a communication link then occurs, for example, if an attempt is made to connect an outgoing call from one of the calling network elements 1, 2 over several paths to a destination formed by the network elements 3, 6. In this case, calling network elements 1, 2 can be allocated to subscribers which at the same time have access to a service offered by the call pickup group consisting of the network elements 3, 6. Alternately, the first and second network elements 1, 2 can be interpreted as node elements or path points which, in an area to the left of the network elements 1, 2 - not shown - are linked to other network elements or node elements - not shown. Also, in this exemplary embodiment as shown in figure 2 it is important to use an identical identification number for the communication link to be established in the individual communication paths F, G, H, I, J. V t *^°^""^ ORIGINAL 1. .Method for reserving bandwidth in a paclcet-switched networic in which a i packet-switched communication relationship is created between a multiplicity of network elements (1, 2, 3,4, 5, 6) via at least one communication branch (A, B, C, D, E, F, G, H, I, J), wherein several connection structures belong to the communication relationship and after successful establishment of the connection a single connection Is maintained, with the following steps: a) allocation of a unique identification number for the communication relationship to identify the communication branches (A, B, C, D, E, F, G, H, I, 3) belonging to the communication relationship, wherein several connection structures for the communication relationship run via a common communication branch (A, B, C, D, E, F, G, H), b) testing of a communication branch (A, B, C, D, E, F, G, H, I, J) of the communication relationship for bandwidth requirements (BW) requested by network elements (1, 2, 3, 4, 5, 6) with said identification number and determination of a bandwidth for the common communication branch (A, B, C, F, G, H) as a maximum (MAX) of bandwidth requirements (BW) requested in this communication branch for the individual connection structures, (bO) creation of the connection from several alternative connection creation attempts, -11- : •• 1 ^^\ fflw I bl) release of bandwidth requirements (BW) in communication branches (B, C, D, E, F, G, I, J) not involved in the connection, ORIGINAL c) reservation of a bandwidth in the communication branch concerned (A, B, C, | D, E, F, G, H, I, J) using the bandwidth value. 2. Method as claimed in claim 1, wherein the communication branches (A, B, C, D, E, F, G, H, I, J) run between the network elements (1, 2, 3, 4, 5, 6) via at least one network node (Nl, N2). 3. Method as claimed in any of claims 1 to 2, wherein the bandwidth requests (BW) originate from at least one calling network element (1, 2). 4. Method as claimed in any of claims 1 to 2, wherein the bandwidth requests (BW) originate from a communication system (Nl, N2) from at least one calling network element (1, 2). 5. Bandwidth administration system to perform all steps of the method as claimed in any of claims 1 to 4. Dated This 14^^ day of March 2008 \ ^ ^ (P.D.GUPrA) / OF L.S.DAVAR & CoV APPLICANTS' AGENT i I -12- I •

Documents:

2203-del-2008-abstract.pdf

2203-del-2008-claims.pdf

2203-del-2008-correspondence-others.pdf

2203-del-2008-description (complete).pdf

2203-del-2008-form-1.pdf

2203-del-2008-form-18.pdf

2203-del-2008-form-2.pdf

2203-del-2008-form-26.pdf

2203-del-2008-form-3.pdf

2203-del-2008-form-5.pdf

2203-del-2008-pct-304.pdf

2203-delnp-2008-Claims-(28-10-2013).pdf

2203-delnp-2008-Correspondence Others-(04-07-2012).pdf

2203-delnp-2008-Correspondence Others-(28-10-2013).pdf

2203-delnp-2008-Drawings-(28-10-2013).pdf

2203-delnp-2008-Form-2-(28-10-2013).pdf

2203-delnp-2008-Form-3-(28-10-2013).pdf

2203-delnp-2008-Form-5-(28-10-2013).pdf

2203-delnp-2008-GPA-(04-07-2012).pdf

2203-delnp-2008-GPA-(28-10-2013).pdf

2203-delnp-2008-Petition-137-(28-10-2013).pdf

abstract.jpg