METHOD AND SYSTEM FOR RESOURCE RESERVATIONS IN A MULTICASTING NETWORK

Abstract: The present invention provides a method for operating a network system and a network system operated correspondingly for improving network resource reservations and allocations. Information included in signaling messages of a given protocol, like the resource reservation protocol (RSVP), which do not provide information about the actual communications status in the network. According to the invention, information concerning the communications/service quality of the network are collected from allover the network. In particular, such information is collected from all network domains and their routers, respectively. The collected information is communicated in the network by extending the signaling messages obtained on the basis of the given protocol. Utilizing the collected information, service quality negotiations between a server and its client are improved. This improvement can be achieved for network systems comprising a network domain serving a single client, and multicasting networks. Furthermore, the present invention provides a solution for pre-reservation of network resources which avoids an unnecessary reservation of network resources and a waste of network resources for subsequent resource allocations.

Description: METHOD AND SYSTEM FOR RESOURCE RESERVATIONS IN A MULTICASTING NETWORK BACKGROUND OF THE INVENTION 1. Technical Field The present invention relates to a method for improving communications between senders and receivers via a network, such as servers, routers, and clients communicating via the Internet comprising routers by extending signaling messages of a protocol used for the network and a communication system operated by the method according to the invention. 2. Background of the Invention The Resource Reservation Protocol (RSVP) is specified by the Internet Engineering Task Force (IETF) and used to provide the signaling to enable network resource reservations and allocations to provide Integrated Services. In particular, RSVP enables Guaranteed Services and Controlled-Load Services. In this manner it is possible, for example, to obtain a control and guarantee of load for network resources/components, such as network domains, servers, clients, routers, and communication links. Resources are reserved or allocated for unidirectional data flows. A detailed description of the RSVP can be found in the article "RSVP and Integrated Services in the Internet: A Tutorial" by P. P. White in IEEE communications Magazine, May 1997, p. 100. In RSVP the server sends a PATH-message to the client, containing a traffic specification (upper and lower bounds of bandwidth, delay and jitter) . This message is used to store the path state in each node (e.g. router) to route Reservation-Request- (RESV) -messages in the reverse direction. On the way of the RESV-message to the client, each network checks the traffic specification and possibly filters the requirements according to the network capabilities and resource availability (admission control) . The traffic specification is received by the client, upon which the client returns a RESV- essage to the server to reserve the resources between the client and the server. Since most traffic requiring reservations is delivered to groups (e.g. TV), it is natural for the client to make the request for a reservation for a flow. This has the added advantage that different clients can make heterogeneous requests for capacity from the same source. The primary roles of the PATH-message are first to install reverse routing state in each router of the network along the communications path, and second to provide clients with information about the traffic characteristics of the sender and end-to-end (sender-client) communications path to generate appropriate reservation/allocation requests. The primary role of the RESV-message is to carry reservation/allocation requests to routers of the network along the distribution tree between clients and senders, wherein the distribution tree can also be a connection between one server and one client. Fig. 1 provides a (simplified) overview of the RSVP signalling messages flows and the most important parameters in each of the messages. The most relevant information in the PATH-message is the TSPEC of the sender defining the sender traffic characteristics . The ADSPEC is an optional object that the server may include in its generated PATH-messages in order to provide the clients with the characteristics of the end-to-end communications path. This information can be used by clients to determine the level of reservation required in order to achieve their desired end-to-end QoS. The parameters included in the ADSPEC may be updated at each RSVP-capable router along the path in order to present end-to-end values to the clients. Some of the parameters are e.g. the minimum path latency, summation of individual link latencies, the path bandwidth, and the minimum of individual link bandwidths along the path. RSVP supports both unicast and multicast sessions. The flow descriptors specify the QoS, which is used by participating entities, such as routers, server and clients. Hosts use RSVP to request a QoS level from the network on behalf of an application data stream. Routers use RSVP to deliver QoS requests to other routers along the path(s) of the data stream. RSVP is able to adapt to changes in routing. A simplified overview of the operation of the RSVP is given in the following. Servers characterize outgoing traffic in terms of upper and lower bounds of bandwith, delay, and jitter. RSVP sends a PATH-message from the server that contains this traffic specification (TSPEC) information to the destination address (unicast or multicast receivers) . At reception of a PATH- message an RSVP capable router creates a PATH-state and stores the last hop address from the PATH-message and the TSPEC-information in the PATH-state. The last hop address is used for the routing of the RESV-message afterwards . Additionally, RSVP capable routers may update the ADSPEC- information to contain end-to-end relevant parameter values . To make a resource reservation/allocation, clients send a RESV- (reservation request) -message upstream. In addition to the TSPEC, the RESV message includes a request specification (RSPEC) that indicates the type of integrated services required and a filter specification (FilterSPEC) , that characterizes the data packets for which the reservation is being made. (e.g. the transport protocol and port number) . Together, the RSPEC and FilterSPEC represent a flow- descriptor that routers use to identify each reservation. When each RSVP router along the upstream path receives the RESV-message, it uses the admission control to authenticate the request and allocate the necessary resources. If the request cannot be satisfied (due to lack of resources or authorization failure) , the router returns an error back to the client. If accepted, the 'router sends the RESV upstream to the next router. When the last router receives the RESV and accepts the request, it sends a confirmation message back to the client. There is an explicit tear-down process for a reservation when a sender or receiver ends an RSVP session. Token Bucket Metaphor RSVP is based on the token bucket metaphor, which turns an uneven flow of packets from the user processes inside the host into an even flow of packets onto the network, smoothing out bursts and greatly reducing the chances of congestion. In this manner, a controlled load can be provided throughout the network. Token bucket related parameters, which are to be defined for the TSPEC-information, include peak rate of flow (bytes/s) , bucket depth (bytes) , token bucket rate (bytes/s) , minimum policed unit (bytes) , and maximum datagram size (bytes) . RSVP and Integrated Services RSVP enables so-called Integrated Services, of which there are two fundamentally different types: Guaranteed Services : A guaranteed service comes as close as possible to emulating a dedicated virtual circuit. It provides firm (mathematically provable) bounds on end-to-end queuing delays by combining the parameters from the various network elements in a path, in addition to ensuring bandwidth availability according to the traffic specification parameter in the PATH-message. Controlled-Load Services: A controlled-load service is equivalent to "best effort service under unloaded conditions" . Integrated services uses a token-bucket model to characterise its input/output queuing algorithm. This is, as an example, beneficial in case of a variable bit-rate video codec. The token-bucket parameters "bucket rate", "bucket depth", and "peak rate" are part of the TSPEC- and RSPEC-information. RSVP provides the highest level of Internet Protocol Quality of Service (IP-QoS) available. It allows an application to request QoS with a high level of granularity and with the best guarantees of service delivery possible. However, the price for this is the complexity and overhead, and thus is overkill for many applications. Multicasting Multicast is the efficient transmission of an Internet Protocol (IP) datagram to a set of zero or more hosts identified by a single IP destination address. IP multicast efficiently supports one-to-many and many-to- many transmission by enabling sources to send a single copy of a message to multiple recipients (indirectly identified by a single IP class-D multicast address) who explicitly want to receive the information. This mechanism is far more efficient than sending multiple messages to each recipient simultaneously or broadcasting the message to all nodes on the network. IP multicasting is a natural solution for rtvulti- party conferencing because of the efficiency of the data distribution trees (spanning trees) , with data being replicated in the network at appropriate points rather than in end-systems . Multicasting is based on a series of specific protocols that "ride on top" of the existing ones to efficiently distribute data to all interested parties. With IP multicast clients do not need to know who or where the servers are to receive traffic from them. Servers never need to know who the clients are. Neither servers nor clients need to care about the network topology as the network optimizes delivery. Multicast is a receiver-based concept. Receivers join a particular multicast session group by informing the multicast router on their subnetwork (Internet Group Management Protocol, IGMP) and traffic is delivered to all members of that group by the network infrastructure. For delivery of a multicast packet from the source (sender, server) to the destination nodes on other networks, multicast routers need to exchange the information they have gathered from the group membership of the hosts directly connected to them. There are many different algorithms and protocols to exchange this routing information, such as Distance Vector Multicast Routing Protocol (DVMRP) , Multicast extension to OSPF (MOSPF) , and Protocol Independent Multicast (PIM) . Based on the routing information obtained through one of these protocols, whenever a multicast packet is sent out to a multicast group, multicast routers will decide whether to forward that packet to their network (s) or not. Finally, the leaf router will see if there is any member of that particular group on its physically attached networks based on the IGMP information and decides whether to forward the packet or not. If the sender layers its data (e.g. video or audio) stream, different receivers can choose to receive different amounts of traffic and hence different qualities. To do this the sender must code the data (e.g. video data) as a base layer -9- complex inter-provide business arrangements or complex behaviors in forwarding equipment . Bandwidth Brokers A Bandwidth Broker maintains information relating to S Ses that are defined between a DiffServ domain and its customers, where DiffServ domain denotes a region of shared trust, administration, provisioning, etc. Customers include local users as well as the adjacent networks that provide connectivity to other parts of e.g. the Internet. The internals of a DiffServ domain are not relevant to its customers, as long as the external obligations are fulfilled. The Bandwidth Broke uses this S S information to configure routers in the local DiffServ domain (mainly the edge routers), and to make admission control decisions. The Bandwidth Broker is required to keep track of QoS resources, make policy decisions based on SLS information, and communicate policy enforcement information to the edge devices within the DiffServ domain. Furthermore, the bandwidth broker establishes and maintains SLAs with neighbouring domains . The general idea is for a customer to buy from their provider a profile for higher quality service, and the provider polices marked traffic from the site to ensure that the profile is not exceeded. Where providers peer, they arrange for an aggregate higher-quality profile to be provided, and police each other's aggregate if it exceeds the profile. In this way, policing only needs to be performed at the edges to a provider's network based on the assumption that within the network there is sufficient capacity to cope with the amount of higher-quality traffic that has been sold. Before marked packets (DiffServ) from a data source are admitted to a Diffserv domain, the source must signal its local Bandwidth Broker to initiate a service reservation. The -10- potential source is authenticated and subjected to local admission control policies. If the service reservation is admitted locally, the Bandwidth Broker may initiate an end- to-end reservation request along the chain of Bandwidth Brokers in the DiffServ networks to be traversed by the data flow. When a network-wide admission control decision has been made, the Bandwidth Broker will configure the routers in the DiffServ domain to support the requested service profile. The Bandwidth Broker allows separately administered DiffServ domains to manage their network resources independently, yet still cooperate with other domains to provide dynamically allocated end-to-end QoS. Problems Currently, RSVP supports limited communication/service quality negotiations between servers and clients. Only the resulting end-to-end bandwidth and ADSPEC-information related data are provided to the clients . This information may be used by the clients to verify whether they would like to use the service with the indicated service quality characteristics. Other service quality characteristics, such as security, reliability, and actual jitter are missing and therefore not taken into account for the service quality negotiation. Such service quality characteristics are missing from the ADSPEC-information and are thus not updated on the way from the server to the client (s). As mentioned above, jitter information is implicitly included in the PATH- message, in particular in the token bucket parameters, but any changes thereof are not considered. Moreover, no mechanisms are currently available to efficiently collect information about the network domains (and clients) between the server(s) and client(s). Since no mechanism for information collection is available, there is also no mechanism to handle this in a more efficient way in case of multicasting for one-to-many or many-to-many -11- service provisioning. Further, a service quality optimization with respect to high(er) priority clients or servers is not available. Further, no mechanism exists to limit the number of wasted resource allocations in case of multicasting. In order to overcome the existing problems of the prior art, the object of the present invention is to provide a solution for improving communications in a network utilizing a resource reservation protocol, such as the RSVP. BRIEF DESCRIPTION OF THE INVENTION The basic idea of this invention is to collect information by extending the signaling messages in a protocol like the RSVP. Information is collected throughout the network, e.g. from all network domains and/or subnetworks, between servers and corresponding client (s). Any network component serving as a sender, e.g. servers, notes, routers, may use the collected information to check the actual status of the network, to make service distribution decisions, to make service provisioning decisions (e.g. links in a proxy or gateway), etc. RSVP is just an example for a protocol for which the present invention can be utilized. Therefore, the mechanisms according to the invention described here can be applied to similar or comparable protocols. The present invention optionally extends negotiation information between a server and respective clients which can be used by clients to decide on the acceptance of an overall service provisioning quality. In addition to an information collection for a single-client case, the present invention is also applicable for multi- client cases wherein multicasting and/or aggregation of collected information is utilized. -12 - Moreover, a pre-reservation mechanism provided by the present invention can be implemented to prevent wasted resource allocations and extensive signaling in case of multicasting and/or to improve the quality of service for high priority clients . Thus, the present invention addresses an information collection mechanism, quality of service negotiations between a server and its client (s), and a pre-reservation mechanism of network resources, for single-client and/or multi-client applications, wherein in the case of a multi-client application multicasting and/or aggregation of collected information is possible. To achieve the underlying object, the present invention provides a method for improving resource reservations and allocations in a network operated by a given signaling message protocol, e.g. the RSVP. According to the given protocol, a sender signal including sender traffic characteristics information of a sender is generated and transmitted via at least one network. According to the invention, network traffic characteristics information is included into the sender signal while being transmitted to obtain an extended sender signal. The network traffic characteristics information is indicative of traffic characteristics of the network. Further, network resources are reserved and/or allocated in dependence of the network traffic characteristics information. Furthermore, it is possible to receive the extended sender signal by a receiver and to generate, in response thereto, a receiver signal according to the given protocol including receiver traffic characteristics information being indicative of traffic characteristics of the receiver. Additionally, the network traffic characteristics information is included into the receiver signal to obtain an extended receiver signal. As -13 - a result, network resources can be reserved and/or allocated in dependence of the network traffic characteristics information and the receiver traffic characteristics information. In order to further improve service quality negotiations, it is possible to transmit the extended receiver signal to the sender, while updating the extended receiver signal by including actual network traffic characteristics information during transmission. As a result, network resources can be allocated in dependence of the updated extended receiver signal . It is preferred to transmit the extended sender signal and/or the extended receiver signal and/or the updated extended receiver signal via at least one router and to include and/or update the network traffics characteristics information by including and/or updating information being indicative of traffic characteristics of the at least one router. The reservation and/or allocation of network resources can also be performed by the sender in dependence from the signal received from the at least one network, and/or the receiver in dependence of the received extended sender signal, and/or the at least one router in dependence of the received signal received from the network. To implement a pre-reservation and/or pre-allocation mechanism, reservation and/or allocation information is included into the sender signal according to the given protocol. The reservation and/or allocation information is indicative of network resources to be pre-reserved and/or pre-allocated. Thus, it is possible to pre-reserve and/or pre-allocate network resources in dependence of the reservation and/or allocation information. -14- Improved network information can be obtained by including actual reservation and/or allocation information into the extended sender signal including the reservation and/or allocation information, the actual reservation and/or allocation information being indicative of network resources actually pre-reserved and/or pre-allocated. In this case, it is preferred that the at least one router reserves and/or allocates available resources thereof in dependence of the reservation and/or allocation information of the sender and includes the actual reservation and/or allocation information corresponding to the actually pre- reserved and/or pre-allocated router resources. For a client oriented resource reservation and/or allocation, the receiver includes a reservation and/or allocation request into the extended receiver signal in dependence of the received actual reservation and/or allocation information. Here, the reservation and/or allocation request is indicative of network resources to be used for communication with the sender. As a result, it is possible to reserve and/or allocate network resources in dependence of the reservation and/or allocation request in the extended receiver signal and/or the updated extended receiver signal. If routers are employed, the at least one router can reserve and/or allocate pre-reserved and/or pre-allocated router resources in dependence of the reservation and/or allocation request in the signal transmitted from the receiver. As a further option, indicators being indicative of resource reservations and/or allocations can be included in the signals transmitted via the network (e.g. in the sender signal, the extended sender signal and/or the extended receiver signal). Here, it is possible to use an indicator -15- with respect to at least one of the network resources whether a resource reservation and/or resource allocation is performed for signals transmitted downstream to clients (e.g. (extended) sender signal) and/or for signals transmitted upstream to senders (e.g. an extended receiver signal). Since some of the pre-reserved and/or pre-allocated resources in response to signals transmitted downstream to clients may be released upon a reception of related signals transmitted upstream to senders, such resources may be pre-reserved and/or pre-allocated in dependence of higher priority resource reservation and/or allocation requests. Therefore, (extended) sender signals including reservation and/or allocation information can include "minimum resource required" indicators. Resources exceeding this minimum resources can optionally be used with respect to reservations and/or allocations by higher priority resource requests. As a result, a faster connection setup for transmissions in the network can be obtained, since respective resources have already been pre-reserved and/or pre-allocated. In order to avoid unnecessary use of network resources, pre- reserved and/or pre-allocated network resources exceeding the reservation and/or allocation request of the receiver are released. Here, it is possible that the at least one router releases its pre-reserved and/or pre-allocated resources in dependence of the reservation and/or allocation request in the signal transmitted from the receiver. However, signals transmitted upstream from the receiver (e.g. (extended) receiver signals) can specify that all pre- reserved and/or pre-allocated resources remain reserved and/or allocated, or that a maximum or a minimum thereof remains reserved and/or allocated. This procedure still leads to an improved quality of service and in particular provides a fast connection setup. -16- Moreover, the present invention provides network system utilizing a given signaling message protocol for network resource reservations and allocations, a sender, a receiver, and/or at least one network for connecting the sender and the receiver are operated by one of the methods according to the invention. BRIEF DESCRIPTION OF THE FIGURES In the following description of preferred embodiments, it is referred to the accompanying figures wherein: Fig. 1 shows RSVP signaling messages and parameters thereof, Fig. 2 illustrates an IP multicasting network, Fig. 3 illustrates a PATH-message multicasting in a RSVP network, Fig. 4 illustrates a RESV-message inverse multicasting in the RSVP network of Fig. 3, Fig. 5 illustrates a network utilizing RSVP-messages extended according to the invention, Fig. 6 illustrates a RSVP network utilizing RESV-messages extended according to the invention for inverse multicasting, and Fig. 7 illustrates a pre-reservation mechanism according to the invention in a RSVP network. DESCRIPTION OF PREFERRED EMBODIMENTS As described above, senders, receivers, and communication means (routers) for routing communications between the o o o to K) o o o Hi Φ 03 TJ Φ Ω rt H- < φ TJ > Hi ø 1! 3 φ 01 03 5D iQ φ • > r o <-n TJ Ω Hi o Pi Ω 3 ø cr ω TJ Ω Φ μ- φ Φ 3 tr e TJ μ- 03 ø μ- 0 H ■ Ω Ω t 03 Φ •x] φ O φ Hi Φ O Φ Φ Φ μ- Hi O 0 ø X 0 Φ Φ cn ø Φ Pi ø Φ 0 (Q a o if Φ X 0 Hi 3 rt rt 3 03 rt μ- 0 O Hi 0 Hi rt Pi 03 0 < Hi Hi i Hi rt 5D μ- CO 3 φ Ω rt Hi ø 03 Φ 3 03 ø Ω <! Hi tr O Φ 1 03 ø TJ 0 < Φ 0 s: 0 μ- Φ TJ § 0 Φ rt O 0 Hi Φ H ø 0 o tQ Φ μ- Φ Hi 0 rt 0 Ω μ- Hi Φ i Hi o Hi ø ø H 0 0 Hi ø if Hi 0 0 Hi 3 0 ( Q M P. 03 Φ 3 Pi O tQ if rt rt 3 Hi 3 Hi Pi rt π ø tr μ- Pi φ 3 μ- φ < μ- μ- Φ ^ μ- rt Φ TJ Pi 0 Φ 1 φ μ- O 0 • rt ø Φ ---. 1 μ- o rt Φ Hi Φ Ω Pi μ- ø Ω ø if Pi O rt Pi φ Φ rt O rt Hi ft 03 μ- Ω < •< i - Pi SD Ω Φ fD Ω 0 i φ 0 rt μ- 0 £ <! 0 Φ μ- H μ- 0 ø 4 -- ø ø Φ - rt fD φ 03 rt 5D 0 μ- 03 i O O TJ Pi μ- φ Φ X O P rt O 0 rt Φ • rt tr μ- 0 — μ- 0 i Ω Ω Φ μ- ø H rt Pi tQ rt ø if ø Pi o O μ- t h α 0 Pi rt O 5D h ø ø CO Ω if O Φ TJ Φ > Hi o Hi Φ O 0 μ- if ø tr rt μ- < iQ Pi O < O tr rt 0 μ- ø Ω rt ø CI 3 0 0 0 TJ rt 03 5D 03 Φ μ- μ- φ μ- h- 1 ø 1 3 μ- ; μ- Pi 03 Hi TJ O if Ω to 0 Hi μ- ct t TJ ø 4 rt ø < ø Ω TJ 3 ø ø rt M φ Ω TJ rt Ω 0 if o SD ø ø 03 tQ Φ rt Φ ^ 3 rt rt φ ø l-h rt rt ø μ- CO I- 1 Φ M μ- if μ- tr Φ 1 rt 03 o rt rt Φ ø - ^ 03 if 03 0 O 0 μ- if Pi Ω < Φ Ω 03 O 0 0 Ω μ- Hi μ- if rt if fD 0 Pi o 03 Φ μ- Φ 03 μ- Hi Hi 0 Φ Pi ø 1 Ω 03 1 ø h M ø 0 Φ rt Φ Pi Hi — • rt 0 Ω 3 rr ø Φ h- 1 3 rt μ- H- 0 Ω μ- Ω Hi tr O 5D ø H{ μ- iQ 03 ø tQ ø 0 if t-3 Pi 0 φ Φ Φ rt 0 0 Ω if rt O O φ Ω O 03 SD rt rt μ- Ω Φ rt rt φ tr ω Hi 03 P. ø ø 4 rt 0 ^ 3 Hi rt Hi Ω < rt μ- if 03 Ω rt - μ- μ- Hi Φ TJ rt - 03 rt Φ O Φ Hi 3 3 $ Φ Φ Φ μ- Φ o Φ tr O ø 0 0 rt m 0 0 S -—. Hi rt Hi 0 ø ø Φ 03 TJ Hi ø P. 0 -— . • , 3 ø rt ø P Φ •S. o rt tQ P 4 03 ø 3 if μ- Ω ø 0 rt Φ O rr 1 ^ ø ø § l- 1 ø 4 X Φ rt P 4 φ μ- — Ω 0 φ 03 rt ø μ- μ- ø 0 5D SD O Ω O Hi 3 ø Φ Ω tr rt Φ rt if Φ ^ rt Ct rt φ Pi Ω O Hi tr Hi O 0 rt Φ O 0 Ω if φ Φ ø if Φ Hi Φ 0 μ- 03 μ- Hi ø ø rt Ω M 3 0 l-h 0 • — & μ- O 03 0 μ- 0 Φ Ω φ rt ø O Φ Ω μ- rt if φ Φ SD 03 ø μ- Ω 3 φ Hi P Pi rt TJ 0 ft Hi ø" 0 Hi 03 03 μ- μ- o Φ Ω rt μ- rt 0 h 0 Hi 0 tQ μ- if φ M H 1 0 O φ < rt rt 0 Hi fD O μ- Pi ø 4 ^ rt ø < Ω ø Φ o O Hi Hi Ω μ- Φ μ- μ- rt ø Ω rt 3 o φ Φ Ω 03 μ- μ- 0 Φ rt μ- tQ < φ 0 s: rt o rt Hi 3 03 ø Ω . Φ rt ø" 3 0 Hi 0 O P O μ- Hi Φ ø 03 . 1 Ω Φ 0 Hj hh 03 Hi Ω if μ- 0 Φ ø μ- 03 3 ( Q ø Ω Hi Pi rt φ 3 rt Pi Hi 0 Φ tr 0 if Φ φ Ω 0 ø Φ § TJ 03 0 O μ- μ- P 4 Hi φ Φ P- 0 Hi μ- μ- 0 ø 5D TJ μ- H iQ Hi 0 H rt rt tr 03 Ω φ < 0 03 Pi h μ- P 3 ø ø Hi TJ rt rt H Ω Hi < 0 O ø 4 . — . μ- rt rt ø Φ 03 Hi ø μ- μ- rt ø hh ø μ- C fD - rt Φ μ- < Φ Pi O ø μ- rt H3 Hi μ- 0 rt O iQ Ω Ω μ- if rt O O Ω ( ^ fD O < rt if Ω μ- μ- ø μ- Ω μ- cn 3 tQ Hi 3 0 03 φ μ- H rt ø! 0 0 1 μ- l-h Φ ^ 0 i 03 03 ø 03 < TJ 0 TJ φ ø rt Ω rt O 3 3 Φ 1 Pi 3 O O rt φ μ- rt 03 • φ M 0 Hi rt ø 4 if μ- 0 Hi ø 0 ø Hi 3 hh Φ ø Hi Hi rt μ- ϋ 03 Hi 03 o Pi 0 0 HI if Φ 0 o 0 o rt rt μ- φ rt O 03 φ ø 4 O rt μ- rt 03 TJ O Ω μ- Φ Hi 0 rr 0 ø μ- μ- 03 03 if Hi 03 Φ Ω Φ 0 s; H tr ø 0 φ Hi 0 μ- φ Ω Ω !? 0 03 rt H( O 0 rt 03 Φ 5D X Φ 03 μ- μ- ø rt tr Ω l-h rt Pi O Ω i> Ω Ω Φ φ ø ø μ- 0 rt tQ SD SD μ- rt t rt ø 03 Φ rt 03 Hi Ω ι-3 rt 03 if Hi - • Ω IQ 03 if φ H < Φ 03 if ø μ- 03 rt μ- if rt Ω i if μ- W Φ rt ø 03 0 03 Φ Φ Φ μ- TJ Φ 03 rt rt O 0 < Φ if Ω 0 μ- 0 Φ 1 Hi ø 0 Pi 03 O Hi ■ s rt Pi TJ 0 μ- μ- ø 0 0 μ- φ l—* ø Hi ø 3 μ- rt ( Q 0 Pi 0 O Ω < Hi μ- ^ Φ Φ rr ø O 0 rt ø Hi μ- 3 tQ 0 rt φ 03 Φ φ 0 Φ Ω 03 0 φ φ H - Ω 0 ø Pi μ- iQ Φ TJ φ ø Ω -— , 03 rt P- P. Pi if TJ 0 0 Hi 03 -— . ct 03 O 0 03 M ø 0 rt rt 03 03 μ- o • 0 Ω TJ SD μ- • g H O μ- 03 0 CO rt μ- O Φ — 0 Ω l-h rt rt Hh Hi if tr μ- φ ø < 0 3 03 ø < -— , Ω Hi iQ 03 if 0 0 0 Φ 03 Ω O fD Ω Φ Hi 0 Ω rt 1 03 ø rt μ- rt φ rt Φ Hi tr 0 rt rt rt 0" μ- * — rt if 03 O if rt rt 03 μ- μ- μ- TJ rt μ- 0 μ- Φ rt 0 Φ if if Φ < tr rt φ m if O 0 tQ Ω 0 μ- rt Hi Φ Φ Φ Φ ø to Φ rt ø 0 0 ø Ω if Φ Hi rt < 0 03 Φ 0 1 -20- Further, a service reject by the client can include information indicative of reasons for the service reject. In response, the server can use such information for e.g. traffic engineering and/or network planning purposes. Moreover, as a further option, the RSPEC-information and/or the FilterSPEC-information of the RESV-message communicated to the server can be extended by further information being indicative of the communication (quality) characteristics in a manner comparable to the ADSPEC-information of the PATH- message . Traffic characteristics information collection for a network domain serving a single client For the purpose of simplicity, the embodiment shown in Fig. 5 utilizes RSVP-messages only including respective TSPEC- information. As shown in Fig. 5, a communication path between a server and a client is routed via routers Rl and R2 constituing the network domain serving the client. The server generates a PATH-message according to the RSVP and transmits the same to the router Rl . In order to indicate the type of mechanism, which is used or which is to be used, the PATH-message can be extended accordingly. In response thereto, the router Rl processes the received PATH-message according to the RSVP. Assuming this processing results in a validity for the received PATH-message, the router Rl generates a conventional PATH-message including, according to the RSVP, the traffic characteristics provided by the server and updated routing information. Here it is pointed out, that this conventional PATH-message does not include any information representing the actual traffic characteristics of the network, so far. -21- Further, the router Rl generates information which represent its actual traffic characteristics . Such information can include the maximal/average peak rate of flow, the available bandwidth, the actual delay, the actual jitter, the actual security level for data communications, actual allocated resources, available buffer space, and the like. This traffic characteristics information of the router Rl is added to its conventional PATH-message such said a message PATH' is obtained. The PATH' -message is transmitted to the router R2 which generates, in response thereto, a message PATH' ' in a manner comparable to the generation of the PATH' -message . The PATH' '-message transmitted from the router R2 is received by the client. In case, the processing of the PATH' ' -message by the client is indicative of a communication/service quality being not acceptable for client, the client generates no RESV-message. In case, the PATH' '-message is indicative of a communications/service quality being acceptable for the client, the client generates a RESV * -message . The RESV * - message comprises a conventional RESV-message according to the RSVP and, further, the collected traffic characteristics information. In addition, the RESV * -message can include information representing the end-to-end characteristics calculated for the communications between the server and the client performed so far. As a further option, it is possible that the RESV * ' -message received by the router R2 is extended by its actual traffic characteristics information and transferred as a RESV * ' - message to the router Rl . Comparable, the RESV * ' -message is extended by the router Rl and transferred as a message RESV * '' -message to the server. -22- On the basis of the received RESV * ' '-message, the server is enabled to access the actual communications status of the network domain serving the client. It is pointed out that this collection of traffic characteristics information can be performed when a communications/service is to be provided to the client, or can be just used to collect such information without providing communications/services . In order to inform the routers Rl , R2 and/or the client whether the collection of traffic characteristics information is performed prior to the provision of communications/services or just for an assessment of the actual network status, the server can transmit a respective information, e.g. an indicator. Multicasting aggregation In order to provide communications/services between one or several servers and several clients, the above described multicasting is used for the message distribution. For the collection of traffic characteristics information, the PATH- messages from the server (s) and the routers of the (respective) network domain (s) are extended as set forth above for the single client case. Therefore, the respective extended PATH-messages from the server to the clients 1, 2, 3 and 4 are not shown in Fig 6. As explained above, the RESV-message received by a server for a conventional RSVP multicasting comprises aggregated RESV- messages from the respective clients. This aggregation serves to merge multiple reservations from several clients for a multicast stream. In order to obtain a RESV * -message (i.e. a RESV-message extended by traffic characteristics information) , an aggregation step is performed to provide the traffic characteristics information of the network domains serving the clients 1, 2, 3 and 4 and the resulting communications/service quality for each end-to-end (server- client) connection. -23- Assuming that the traffic characteristics of the connections (networks) between the router R2 and the client 1, and the router R2 and the client 2 are the same, information being indicative of these traffic characteristics only need to be communicated to the server once. As a result, the RESV * 12 '- message communicated from the router R2 to the router Rl only contains traffic characteristics information of the client 1 provided by the RESV * ..-message, the traffic characteristics information of the client 2 provided by the RESV * 2 -message and, just once, traffic characteristics information related to the network domain comprising the router R2 , and the clients 1 and 2. In case the traffic characteristics of the networks between the router R2 and the client 1, and the router R2 and the client 2 are not the same, or in case the clients 1 and 2 are not comprised by the same network domain, the router R2 must determine the overlap of the respective traffic characteristics information and aggregate the traffic characteristics information accordingly. As an alternative, router R2 can also just select e.g. the traffic characteristics which are received first. This aggregation step is accordingly performed with respect to the router R3 and the router Rl, respectively, wherein the transmitted RESV * ' 3 _ 4 -message and the RESV * ' 123|4 -message are extended by the respective traffic characteristics information of the network domains including routers Rl and R3. As a result, the RESV * ' ' 12 _ 3ι4 -message received by the server can only comprise, beside the traffic characteristics information of the clients 1, 2, 3 and 4 and the routers Rl, R2 and R3 , traffic characteristics information of three network domains . -24- As an option compared to the above described network-wide aggregation for network domains, it is contemplated to perform a network domain related aggregation. Here, aggregated traffic characteristic information per network domain is included in the messages transmitted in direction to the server. As a result, with reference to Fig. 6, the server receives a message including the traffic characteristics information of the RESV * ! - and RESV * 2 - messages, of the RESV * 3 - and RESV * 4 -messages , and the RESV * 12 - and RESV * 3j4 -messages. Pre-reservation of network resources As explained above, RSVP resource reservations for a network or network domains are obtained by transmitting a respective ADSPEC-information comprised by a PATH-message. The ADSPEC- information is received by the network or the network domains, and especially the routers thereof, to determine the level of resource reservation required for a desired server- client communication/service quality. For allocating the reserved resources, the routers utilize a RESV-message transmitted from the client to allocate the necessary resources. In particular, RSVP-routers along the upstream path (i.e. in a communication direction towards a server) receiving RESV-message (s) utilize an admission control to authenticate respective resource request and allocate necessary resources. If a router can not provide the requested resources (e.g. due to a lack of resources or authorization failures) , the router returns an error message back to the client. If the resource request (s) can be satisfied, the respective router sends the respective RESV- message (s) upstream to the next router. For example in the case of a multicasting RSVP system, the following procedure of pre-reserving resources prevents unnecessary resource reservations downstream from the server to the client and that e.g. a router close to the server can not provide the required resources for allocation resulting -25- in error messages sent to the client. A particular effect decreasing the communication/service quality (e.g. communication transmission time) of such error messages sent back to the client is the release of allocated resources previously allocated by routers arranged between the error message sending router and the client. Further, correct and proper processing of such error messages generated by different clients is complicated. The pre-reservation mechanism shown in Fig. 7 is enabled by the modification of the RSVP as described above. Beside the extension of the RSVP-messages transmitted from the server and the client, as detailed above, the PATH-message of the server is extended by a pre-reservation request. In Fig. 7, this extension is indicated by the index "°" . The pre- reservation request of the server specifies a resource type and the extend thereof to be reserved. Comparable thereto, the client extends the extended RESV*- message generated as explained above by a allocation request. Here, the index "°" is indicative of the allocation request. Referring to the example shown in Fig. 7, the server requests 12 units of the specified resource type. Upon receiving the PATH°-message, the router Rl determines whether he can satisfy this request. Since the router Rl is able to provide the requested resources, the router Rl pre-reserves 12 units. The router Rl generates a PATH° ' -message extended by the above traffic characteristics information and the pre- reservation request. Although router R2 can only provide 8 units, which are reserved, the PATH° '' -message of router R2 is generated and transmitted to the router R3. In contrast thereto, according to a conventional RSVP system, an error message would be returned to a client in response to a RESV- message thereof to indicate that a resource request can not be satisfied. -26- The router R3 is able to provide 4 units of the requested resource and reserved the same. Again, no error message is returned to the server, but a PATH° '' -message is communicated to the client. Therefore, the client gets a communication/service resource request which is agreed and confirmed by all routers Rl, R2 and R3 between the server and the client. Upon confirmation of the received resource request, the client generates a RESV * °-message extended as the explained above and including an allocation request. Since the received resource request indicates that 4 units of the requested resource type can be provided for the overall coiumunications connection between the server and the client, the allocation request generated by the client indicates that four units of the requested resource type are needed and should be allocated by the routers Rl, R2 and R3. While transmitting the RESV * °'-, RESV * ° ' '- and RESV * ° ' ' '- messages, which include the above explained extensions by the routers Rl , R2 and R3 and the allocation request of the client, each of the routers Rl , R2 and R3 allocate 4 units of the requested resource type and release the previously reserved units actually not needed. Further, messages transmitted upstream from the client and routers Rl , R2 , and R3 (e.g. RESV *0 '-, RESV *0 "-, and RESV *0 '"- messages) can include information specifying that all pre- reserved and/or pre-allocated resources remain reserved and/or allocated, or that a maximum or minimum pre-reserved and/or pre-allocated resources remain reserved and/or allocated. This approach still results in an improved QoS. -27- The pre-reservation/pre-allocation mechanism can be used to ensure that clients and/or servers having a high(er) priority will be provided with required resources. Additionally, it is contemplated that the server can extend his RSVP-message by information (e.g. in form of an indicator) representing an upper and/lower limit of resources to be re-reserved (maximum/minimum resource reservation indicator) . Since some of the pre-reserved resources in response to a PATH°-message may be released upon the reception of the respective RESV * °-message, such resources could be partly used by an allocation request having a higher priority. As set forth above, an indicator in each router is used to specify whether a resource reservation is an actual resource allocation in response to a RESV-message or a pre-reservation in response to a PATH-message. To specify the amount of pre- reserved resources which can be used to satisfy a higher priority resource allocation, the above minimum resource reservation indicator can be used. The amount of resources above the limit defined by this indicator can be optionally used to fulfill a higher priority resource allocation request related to a different PATH-request . As a result, a communication connection related to the higher priority resource allocation request can be setup faster since these resources have already been reserved and no separate reservation is required. Comparable to the maximum/minimum indicators of the PATH°- message, the RESV * °-message can specify a minimum and/or a maximum of resources (types) to be allocated. For example, the RESV * °-message specifies said all routers should provide the same minimum bandwidth, such that all bandwidth related resources of the routers unnecessarily reserved are released. -28- Especially the utilization of minimum resource indicators for the PATH 0 - and RESV * °-messages guaranties said servers and/or clients having a higher priority are provided the required resources, since related higher priority resource requests can be fulfilled and are not blocked by a reservation of resources .

Claims: -29- CLAIMS 1. A method for improving resource reservations and allocations in a network operated by a given signaling message protocol, the method comprising: generating a sender signal (PATH-message) according to the given protocol including sender traffic characteristics information of a sender (server) , and transmitting the server signal (PATH-message) via at least one network, characterized by - including network traffic characteristics information into the sender signal (PATH-message) while being transmitted to obtain an extended sender signal (PATH' -message) , the network traffic characteristics information being indicative of traffic characteristics of the network, and - reserving and/or allocating resources of the network in dependence of the network traffic characteristics information. 2. The method according to claim 1, comprising: - receiving the extended sender signal (PATH ' -message) by a receiver (client) , generating a receiver signal (RESV-message) according to the given protocol including receiver traffic characteristics information being indicative of traffic characteristics of the receiver (client) , including the network traffic characteristics information into the receiver signal (RESV-message) to obtain an extended receiver signal (RESV * -message) , and reserving and/or allocating resources of the network in dependence of the network traffic characteristics information and the receiver traffic characteristics information. -30- 3. The method according to claim 2, comprising: transmitting the extended receiver signal (RESV * - message) to the sender (server) via the at least one network, updating the extended receiver signal (RESV * -message) by including actual network traffic characteristics information while transmitting the receiver signal (RESV * -message) , and reserving and/or allocating resources of the at least one network in dependence of the updated extended receiver signal (RESV * ' -message) . 4. The method according to one of the preceding claims , comprising: transmitting the extended sender signal (PATH 1 -message) and/or the extended receiver signal (RESV * -message) and/or the updated extended receiver signal (RESV * ' -message) via at least one router (Rl, R2 , R3 ) of the at least one network, and including and/or updating the network traffics characteristics information by including and/or updating information being indicative of traffic characteristics of the at least one router (Rl, R2 , R3 ) . 5. The method according to one of the preceding claims, wherein: - the sender (server) reserves and/or allocates network resources in dependence from the signal (RESV * -message, RESV * ' -message) received from the at least one network. 6. The method according to one of the preceding claims, wherein: the receiver (client) receives and/or allocates network resources in dependence of the received extended sender signal (PATH ' -message) . -31- 7. The method according to one of the claims 4 to 6 , wherein the at least one router (Rl, R2 , R3 ) reserves and/or allocates its resources in dependence of the received signal (PATH' -message, RESV * -message, RESV * ' -message) received from the at least one network. 8. The method according to one of the preceding claims, comprising: - including reservation and/or allocation information into the sender signal (PATH-message) according to the given protocol, the reservation and/or allocation information being indicative of network resources to be pre-reserved and/or pre-allocated, and - pre-reserving and/or pre-allocating network resources in dependence of the reservation and/or allocation information. 9. The method according to claim 8, comprising: including actual reservation and/or allocation information into the extended sender signal (PATH 0 ' -message) including the reservation and/or allocation information, the actual reservation and/or allocation information being indicative of network resources actually pre-reserved and/or pre-allocated. 10. The method according to claim 9, wherein: the at least one router (Rl, R2 , R3 ) reserves and/or allocates available resources thereof in dependence of the reservation and/or allocation information of the sender (server) , and includes the actual reservation and/or allocation information corresponding to the actually pre-reserved and/or pre-allocated router resources. -32 - 11. The method according to one of the claims 8 to 10, wherein: the receiver (client) includes a reservation and/or allocation request into the extended receiver signal (RESV * - message) in dependence of the received actual reservation and/or allocation information, the reservation and/or allocation request being indicative of network resources to be used for communication with the sender (server) . 12. The method according to claim 11, comprising: reserving and/or allocating network resources in dependence of the reservation and/or allocation request in the extended receiver signal (RESV * °-message) and/or the updated extended receiver signal (RESV * °' -message) . 13. The method according to claim 12, wherein: the at least one router (Rl, R2 , R3 ) reserves and/or allocates pre-reserved and/or pre-allocated router resources in dependence of the reservation and/or allocation request in the signal (RESV * °-message, RESV *0 ' -message) transmitted from the receiver (client) . 14. The method of claim 12 or 13, wherein: pre-reserved and/or pre-allocated network resources exceeding the reservation and/or allocation request of the receiver (client) are released. 15. A method according to claim 14, wherein: the at least one router (Rl, R2 , R3 ) releases its pre- reserved and/or pre-allocated resources in dependence of the reservation and/or allocation request in the signal (RESV-message, RESV * ° ' -message) transmitted from the receiver (client) . -33 - 16. A method according to one of the claims 11 to 15, wherein: the receiver (client) includes information into the extended receiver signal (RESV * -message) , the information being indicative of a maximum or a minimum of the pre- reserved and/or pre-allocated network resources to remain reserved and/or allocated. 17. The method of claim 16, wherein: - pre-reserved and/or pre-allocated network resources remain reserved and/or allocated in dependence of the information included into the extended receiver signal (RESV * -message) being indicative of the maximum or the minimum network resources to remain reserved and or allocated. 18. The method according to claim 17, wherein: the at least on router (Rl, R2, R3 ) maintains its pre- reserved and/or pre-allocated resources in dependence of the receiver information being indicative of the maximum or the minimum of network resources to remain reserved and/or allocated. 19. The method according to one of the preceding claims, wherein: the signals (PATH-message, PATH ' -message, RESV-message, RESV * -message, RESV * '-message, PATH 0 '-message, RESV * °-message, RESV *0' -message) include information being indicative whether a resource reservation and/or allocation is performed for a message transmitted in a direction to the receiver (client) and/or for a message transmitted to the sender (server) . 20. The method according to claim 19, wherein: the information included into the transmitted signals comprise an indicator specifying a minimum of required network resources . -34- 21. The method according to claim 20, wherein: _ pre-reserved and/or pre-allocated network resources exceeding network resources specified by the indicator are used for at least one network resource request having a higher priority. 22. The method according to one of the preceding claims, wherein: the given signaling message protocol is the resource reservation protocol (RSVP) , the sender signal (PATH-message) is the PATH-message of the resource reservation protocol (RSVP) , and the receiver signal (RESV-message) is the RESV-message of the resource reservation protocol (RSVP) . 23. The method according to one of the preceding claims, wherein: the method is utilized in a network serving a single- client and/or a multi-client application. 24. The method according to claim 23, wherein: the signals (PATH-message, PATH ' -message, PATH-message) transmitted to the client (s) are transmitted by utilizing a multicasting transmission. 25. The method according to claim 23 or 24, wherein: the signals (RESV-message, RESV * -message, RESV * ' -message, RESV * °-message, RESV *0 '-message) transmitted to the sender (server) are transmitted by a utilization of an inverse multicasting transmission. 26. The method according to claim 24 or 25, wherein: an aggregation of information included into the signals transmitted via the network is performed with the respect to the at least one network and/or components thereof. -35- 27. A network system utilizing a given signaling message protocol for network resource reservations and allocations, comprising: a sender (server) , a receiver (client) , and at least one network for connecting the sender (server) and the receiver (client) , wherein the sender (server) is adapted to be operated by the method according to one of the claims 1 to 20. 28. The network system according to claim 27, wherein: the receiver (client) is adapted to be operated by the method according to one of the claims 1 to 26. 29. The network system according to claim 27 or 28, comprising: at least one router (Rl, R2 , R3 ) of the at least one network, the at least one router (Rl, R2 , R3 ) being adapted to be operated by the method according to one of the claims 4 to 26. 30. The network system according to one of the claims 27 to 29. wherein: the given signaling message protocol is the resource reservation protocol (RSVP) .

Inventors: HAMELEERS HEINO, HUNDSCHEIDT FRANK, VALENTINE ERIC, HAMELEERS, HEINO, HUNDSCHEIDT, FRANK, VALENTINE, ERIC
Applicants: ERICSSON TELEFON AB L M, TELEFONAKTIEBOLAGET LM ERICSSON (PUBL)
Application year: 2001
Main classification: H04L12
IPC codes: H04L12