Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Admissions control in a connectionless communications network

a technology of communication network and access control, applied in data switching networks, frequency-division multiplexes, instruments, etc., can solve the problems of deterioration in the quality of service for all services provided, severe impact, and significant problem of access control, and achieve the effect of cost-effective and simple implementation

Inactive Publication Date: 2003-07-03
NORTEL NETWORKS LTD
View PDF2 Cites 101 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Benefits of technology

[0015] A method of providing call admission control which does not require using MIDCOM protocol methods, Packetcable protocols or COPS-RSVP approaches is described which is simple to implement, cost-effective and which is able to deal with particular situations such as conference calls and / or lawful intercept Each link in a communications network over which it is required to perform call admissions control is provided with a middlebox connected at each end of that link such that admissions control can be carried out at one end of the link. Call services are provided by Call Servers, each of which has access to a database containing pre-specified information about all middleboxes in that call server's realm. The information in the database is manually configured for example although this is not essential. The database also has information about which media endpoints are behind what middle box, and maximum bandwidths for the link associated with each middlebox. The call servers are used to keep a running tally of the amount of VoIP call bandwidth associated with each middlebox on the edge of a low-bandwidth link, and to accept or refuse calls on the basis of the bandwidth information on a per-call basis
[0021] This provides the advantage that the call server effectively provides admission control capability on behalf of the middleboxes. Because the call server is able to access information about middleboxes and the available bandwidth on the low-bandwidth links associated with those middleboxes it is able to perform call admission control. This is achieved without the need to modify existing packet media endpoints such as media gateways and internet protocol endpoints. In addition, it is not necessary for those packet media endpoints to be fully RSVP enabled or for the middleboxes to be MIDCOM enabled with respect to call admissions control. Another advantage is that call admission control over the low-bandwidth links is achieved even where nodes at either or both ends of the low-bandwidth link are layer-2 but not layer-3 aware. This is because effectively the call server performs the admission control determinations.
[0024] Preferably the processor is further arranged to determine whether all the first middleboxes are the same as all the second middleboxes and to accept the call admission request in such cases. This provides the advantage that when the call path does not traverse a low-bandwidth link associated with a middlebox then the call is simply accepted.
[0033] Preferably said information about bandwidth requirements for the call comprises session description protocol (SDP) information received from both the originating and destination packet media endpoints. SDP is specified in the IETF's RFC number 2327. This provides a simple and effective means by which bandwidth requirement information can be obtained by the call server on a per-call basis. The call server is also able to adjust the bandwidth requirements used for the call if these requirements change in the SDP information, for example, as codec requirements are negotiated between the packet media endpoints during call setup time, prior to answer. (A codec is a device for converting speech into signals suitable for transfer by a packet based protocol.) Even post-answer, it is possible to use SDP changes to change the codec being used, and the call server is preferably arranged to take this into account when doing admissions control. Suppose that the call server detects a change to a new codec that requires more bandwidth than previously required for a call. In that case, if there is not enough bandwidth on a link used in this call to change to the new codec, then the Call Server is preferably arranged to force the call to remain at the current, un-modified bandwidth.
[0035] In another embodiment the communications network comprises two or more call servers, and wherein said method further comprises: receiving said call admission request at an origination call server associated with the origination packet media endpoint and determining whether a destination call server, associated with the destination packet media endpoint is the same as the origination call server. This provides the advantage that admissions control for calls which traverse realms of more than one call server can be carried out.

Problems solved by technology

Admissions control is a significant problem in communications networks and especially in connectionless, packet-based, communications networks.
This results in deterioration in quality of service for all services provided over that link.
In particular situations this has especially severe impact, for example, when the link provides the main access route from a communications network of a particular enterprise or residential customer to a core communications network.
If a link is already carrying the maximum number of VOIP calls, or other non-voice traffic, adding additional calls seriously degrades the voice quality of existing calls using that link.
The new call added to the link also has poor voice quality.
Continuing to add calls to the link degrades the quality of all calls until none of those calls are recognisable.
However, link A is unable to support calls into the core from all endpoints in the LAN simultaneously.
However there are currently no suitable methods for detecting link over-utilisation and communicating this to a call server or other management node in order that link over-utilisation can be prevented.
The fixed wireless link has limited bandwidth and is unable to support calls from all endpoints in the enterprise network at one time.
In addition varying amounts of bandwidth are required for calls, depending on the type of call required (e.g. voice calls can use a multitude of different codecs, each of which have their own bandwidth characteristics, fax call, etc.) and this further increases the complexity of the admissions control problem.
Another disadvantage of these protocols from the point of view of admissions control is that all the internet protocol media endpoints (e.g. user terminals and other packet media endpoints) and devices on the edge of low-bandwidth links (i.e. in the Packetcable architecture, the CMTS) are required to fully support the reservation protocol (RSVP).
This is problematic because many existing communications networks are formed from equipment made by different manufacturers and where many of the nodes or endpoints do not support RSVP or COPS where needed.
However, this is not the case for many communications networks.
Therefore Packetcable protocol type call admission control mechanisms would not be effective.
Other disadvantages of the Packetcable approach to call admission control include that no support for layer 2 flows is provided and the fact that all devices in the network which support RSVP are required to have some policy awareness.
However, the COPS and RSVP approach is problematic because significant post dial delay occurs as a result of the admission process and also the other problems mentioned above with respect to the Packetcable approach apply.
In addition, the means by which the call server and PDP communicate is not yet fully standardized.
However, these MIDCOM protocols are not yet developed and ratified.
However, "middlebox discovery" mechanisms like this are not currently known.

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Admissions control in a connectionless communications network
  • Admissions control in a connectionless communications network
  • Admissions control in a connectionless communications network

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0054] Embodiments of the present invention are described below by way of example only. These examples represent the best ways of putting the invention into practice that are currently known to the Applicant although they are not the only ways in which this could be achieved.

[0055] The term "low bandwidth link" is used to refer to a connection between two nodes in a communications network, where the capacity of the link is less than the capacity required should all entities connected to one end of the link issue communications over that link simultaneously. Typically there is only one such low bandwidth link between the two nodes referred to immediately above although this is not always the case.

[0056] The term "packet media endpoint" is used to refer to a terminal that is suitable for connection (possibly indirectly) to a middlebox or to refer to a node via which terminals access a middlebox (e.g. a media gateway).

[0057] The term "call agent" is used to refer to a node which is abl...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

A method of providing call admission control which does not require using MIDCOM protocol methods, Packetcable protocols or COPS-RSVP approaches is described which is simple to implement, cost-effective and which is able to deal with particular situations such as conference calls. Each link in a communications network over which it is required to perform call admissions control is provided with a middlebox connected at each end of that link such that admissions control can be carried out at one end of the link. Call services are provided by Call Servers, each of which has access to a database containing pre-specified information about all middleboxes in that call server's realm. The database also has information about maximum bandwidths for the link associated with each middlebox. The call servers are used to keep a running tally of the amount of VolP call bandwidth associated with each middlebox on the edge of a low-bandwidth link, and to accept or refuse calls on the basis of the bandwidth information on a per-call basis.

Description

[0001] The present invention relates to a method and apparatus for admissions control in a connectionless communications network.BACKGROUND TO THE INVENTION[0002] Admissions control is a significant problem in communications networks and especially in connectionless, packet-based, communications networks. For example, consider a particular link in a communications network. If that link becomes congested, the traffic is unable to flow through the link and packets are dropped. This results in deterioration in quality of service for all services provided over that link. In particular situations this has especially severe impact, for example, when the link provides the main access route from a communications network of a particular enterprise or residential customer to a core communications network.[0003] These problems are particularly relevant for voice over internet protocol (VOIP) solutions. If a link is already carrying the maximum number of VOIP calls, or other non-voice traffic, ...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Applications(United States)
IPC IPC(8): H04L12/54H04L47/724H04L47/80H04M3/56H04M7/00
CPCH04L12/5695H04L65/4038H04L47/724H04L47/801H04L47/806H04L47/822H04L65/1073H04M3/56H04W28/10H04W72/00H04W88/14H04L65/1043H04L65/1083H04L65/80H04L29/06027H04L47/70H04L65/1104H04L65/1101
Inventor BRADD, PATRICK
Owner NORTEL NETWORKS LTD
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products