Classifications

• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04Q—SELECTING
  • H04Q11/00—Selecting arrangements for multiplex systems
  • H04Q11/04—Selecting arrangements for multiplex systems for time-division multiplexing
  • H04Q11/0428—Integrated services digital network, i.e. systems for transmission of different types of digitised signals, e.g. speech, data, telecentral, television signals
  • H04Q11/0478—Provisions for broadband connections
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L12/00—Data switching networks
  • H04L12/54—Store-and-forward switching systems 
  • H04L12/56—Packet switching systems
  • H04L12/5601—Transfer mode dependent, e.g. ATM
  • H04L2012/5619—Network Node Interface, e.g. tandem connections, transit switching
  • H04L2012/562—Routing
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L12/00—Data switching networks
  • H04L12/54—Store-and-forward switching systems 
  • H04L12/56—Packet switching systems
  • H04L12/5601—Transfer mode dependent, e.g. ATM
  • H04L2012/5629—Admission control
  • H04L2012/5631—Resource management and allocation
  • H04L2012/5632—Bandwidth allocation

Definitions

• Modern packet-oriented communications networks also referred to as “data networks”—have until now been designed essentially for the transmission of packet streams, which are also referred to in the specialist world as “data packet streams”.
• the data packet streams are thus transmitted, for example, with fluctuating time delays, since the individual data packets of the data packet streams are normally transmitted in the sequence of their access to the network, that is to say the time delays become greater the greater the number of packets that have to be transmitted by a data network.
• the transmission of data is therefore also referred to as a transmission service without realtime conditions, or as a “non-realtime service”.
• realtime services that is to say transmission services in realtime conditions, such as the transmission of speech information or moving picture information
• packet-oriented communications networks that is to say the transmission of the realtime services which until now have normally been transmitted on a line-oriented basis is being carried out on a packet-oriented basis, that is to say in packet streams, in a convergent speech/data network.
• packet streams are also referred to as “realtime packet streams”.
• One problem that arises in this case is that a high quality of service is required for packet-oriented transmission whose quality is comparable to that of line-oriented transmission.
• a minimal delay for example of ⁇ 200 ms—without any fluctuations in the delay time is important, since realtime services in general require a continuous information flow, and any loss of information, for example due to packet losses, cannot be compensated for by repeated transmission of the packets that have been lost. Since, in principle, these quality of service requirements apply to all communications networks using packet-oriented transmission, they are independent of the specific configuration of a packet-oriented communications network. In consequence, the packets may be in the form of Internet, X.25 or frame-relay packets, or else may be in the form of ATM cells. Packet data streams and realtime packet data streams are in this case exemplary embodiments of traffic streams that are transmitted in communications networks.
• Speech and picture information should normally be transmitted in a speech/data network with a guaranteed quality of service, in order that the quality of the speech and picture transmission is not decreased when the number of packets to be transmitted in the Internet rises.
• IETF Internet Engineering Task Force
• proposals relating to this have been made in Blake et. al., “An Architecture for Differentiated Services”, RFC 2475, 1998, ftp://venera.isi.edu/in-notes/rfc2475.txt and in Nichols et.
• DS Field Differentiated Services Field
• IPv 4 and IPv6 Headers RFC 2474, 1998, ftp://venera.isi.edu/in-notes/rfc2474.txt, for a number of service classes to be introduced in the packet-oriented Internet, which until now has not guaranteed qualities of service.
• An Internet such as this is also referred to as a ‘DiffServ network’.
• the individual packet streams are in each case allocated to a specific service class and, depending on their service class, are transmitted with or without priority with respect to packets in other service classes by the transmission nodes in the Internet.
• the formation of a class for prioritized transmission results in the formation of a (virtual) separate communications network within the Internet, for transmission of high-priority traffic streams and with a separate overall transmission capacity, which comprises a portion of the overall transmission capacity of the Internet.
• the overall transmission capacity of a communications network which comprises transmission nodes and paths is regarded as that capacity which is required for transmission of the traffic streams which can just be transmitted without any loss of traffic. Expressed in other words, this means that no further traffic stream could be transmitted in that communications network without loss of traffic.
• the transmission capacity which is still available on a predetermined route between two transmission nodes in the communications network accordingly depends not only on the traffic which is being transmitted directly between these two transmission nodes but also on that traffic which is being transmitted at least partially along the given route as a consequence of transmission along other routes in the communications network.
• network access control is required, at least for the prioritized traffic, for priority-controlled transmission, since the required quality of service can be ensured only if the communications network is not supplied with any more prioritized packets than the maximum number which it can transmit.
• network access devices also referred to as ‘edge devices’ or else, from the point of view of the communications network, as ‘access nodes’—have been proposed for the Internet with a number of service classes, and which are used to provide network access control.
• the edge devices can
• the transmission nodes which are known as edge devices, and paths in the communications network are also referred to as “domains”, with which the edge device is associated.
• One edge device may also be associated with a number of domains.
• a fixed threshold value, which the traffic volume should not exceed, is normally set in the edge devices in order to control the traffic which is supplied to the communications network. This method is very simple, but is inflexible with regard to changes in the overall transmission capacity of the communications network.
• the invention is thus based on the object of improving the method for controlling access to a communications network.
• the object is achieved by the features of patent claim 1.
• the major aspect of the invention is access control, provided by an access node in the communications network, for traffic streams to a communications network as a function of an available capacity which is available to that access node for transmission of traffic streams to the communications network.
• the value of this available capacity, which is available to that access node for the transmission of traffic streams to the communications network is determined for at least this access node by an access function, taking into account the overall transmission capacity of the communications network, and this is reported to the access node.
• the access control can be flexibly matched to changes in the overall transmission capacity.
• the access control is provided solely by the access node, no direct knowledge of the traffic streams that are being supplied is required in the other transmission nodes in the communications network. This is associated with the particularly significant advantage that the invention can be used in communications networks without connections, for example in the Internet.
• the invention provides that the available capacity is determined once again whenever the overall transmission capacity changes—claim 2.
• the access control is thus adapted when changes occur in the communications network.
• the direct adaptation of the ‘available capacity’ threshold value minimizes the time period in which the threshold value may not be matched to the changed overall transmission capacity.
• the available capacity is determined, at least partially, as a function of information which is available to the access node for routing in the communications network—claim 3.
• the information is in the form of load information and/or cost information which identifies the transmission paths—claim 4.
• One variant of the method according to the invention provides that, in the case of a communications network having a number of transmission nodes and paths, whose overall transmission capacity depends at least on the transmission capacities of the transmission paths, any change in the overall transmission capacity is identified as a consequence of a change in the transmission capacity of one of the transmission paths—claim 5.
• One development of the method according to the invention provides that the change in the transmission capacity of one of the transmission paths is reported to the access node in accordance with the rules of a routing protocol—claim 6. Changes such as these are normally reported by the most realtime routing protocols. The invention can thus advantageously be used in a large number of communications networks, without any adaptation to the routing protocol.
• One variant of the method according to the invention provides that the access function is provided in the access node and determines only the capacity which is available for this access node—claim 7.
• the access control is thus provided solely by that access node, that is to say without any involvement of the other transmission nodes in the communications network.
• the functionality of the access node is thus maintained even if significant portions of the communications network attract attention.
• FIG. 1 shows, by way of example, a block diagram of a communications network KN with an overall transmission capacity G, in which a routing protocol RP is used for the transmission of routing information RI.
• the communications network KN has four transmission nodes K, of which the first transmission node K 1 forms a first access node ZK 1 , the second transmission node K 2 forms a second access node ZK 2 , and the third transmission node K 3 forms a third access node ZK 3 .
• Traffic streams VS are transmitted from each of the access nodes ZK to the communications network KN.
• the transmission nodes are connected to one another by means of four transmission paths, W 12 , W 14 , W 24 and W 34 , with the indices indicating those transmission nodes K i and K j between which the transmission path W ij is provided.
• the transmission capacity of each of the transmission paths is assumed to be identified, for example, by load information LI and/or cost information KI.
• Routing information RI which, for example, includes the load information LI and/or cost information KI about the transmission paths W, is stored in each of the transmission nodes. Furthermore, a decentralized, access-node-specific access function ZF is provided in each of the access nodes ZK 1 and ZK 2 . The access functions ZF in each case determine a capacity VK which is available for the associated access node ZK, and report this to said node. Alternatively, a central implementation of the access function ZK is indicated, which is physically achieved via the transmission node K 4 . This is used, for example, for determining the capacity VK 3 which is available for that access node K 3 , and this is reported thereto in a corresponding manner, with its value being stored in the access node ZK 3 .
• the access function ZF may, for example, be implemented centrally or in a decentralized manner.
• the access function ZF is implemented on an access-node-specific basis, that is to say in a decentralized manner.
• An access function ZF implemented in this way normally has no global information available to it about all the traffic streams VS which are currently being transmitted in the communications network KN.
• the capacity VK which is available for the associated access node ZK is therefore determined, for example, on the basis of locally available information, from which conclusions are drawn about the current distribution of the traffic streams between the transmission nodes K and transmission paths W in the communications network KN.
• the determined available capacity VK is reported from there to the access node ZK by the determined value being stored, for example, in a storage medium in the access node ZK.
• the determined value is reported to the access node, for example with at least one information item which is transmitted to the access node ZK and is, for example, in the form of a packet.
• the available capacity VK is determined, by way of example, taking into account the locally stored routing information RI.
• An embodiment of the invention in which the available capacity VK is in each case determined once again when the routing information RI [lacuna] is associated with particularly significant advantages.
• the routing information RI is normally adapted by the access node ZK whenever the transmission capacity of one of the transmission paths W in the communications network KN has changed.
• the routing information RI is changed in accordance with the rules of a routing protocol RP which is used in the communications network KN.
• the object of the routing protocol RP is in this case to match the routes in the communications network KN to changed conditions in the communications network KN. This will be explained briefly using the example of a packet-oriented communications network KN without any connections—for example an Internet:
• a so-called ‘routing table’ for determining the next transmission node K for an incoming packet is produced in each transmission node K on the basis of the topology of the communications network KN.
• the next transmission node K is determined in the table, on the basis of the destination address of the packet. Since the routing tables are normally synchronized throughout the network by means of the routing protocol RP, each packet generally reaches its destination.
• a failure of a transmission path W is reported to the transmission nodes K in the communications network KN in accordance with the rules of the routing protocol RP. These transmission nodes K then normally form adapted routing tables.
• routing protocols are OSPF (Open Shortest Path First), RIP (Routing Information Protocol) or IS-IS (Intermediate System to Intermediate System).
• Each of the routing protocols RP normally provides an access node ZK with different information about the communications network KN.
• the routing information RI which is available to an access node ZK depends on which routing protocol RP is being used. In the simplest case, only the topology of the communications network is reported. Routes with a specific metric (for example the number of transmission nodes K on a route) are determined by the access nodes ZK on the basis of this routing information. However, other information, such as the capacity of the transmission paths W, cost information KI or load information LI, may also be reported.
• An access node ZK can thus carry out the access control for traffic streams VS to the communications network KN on the basis of different criteria.
• the capacities which are required for the transmission of the traffic streams VS that are supplied from the access node ZK to the communications network KN are normally added for this purpose, and are compared with the available capacity VK.
• the total required capacities should normally not exceed the available capacity VK.
• the available capacity is also referred to as the ‘limit’ or ‘bandwidth limit’.
• a specific traffic stream VS i is in this case generally either allowed—that is to say transmitted—or is rejected.
• the access node ZK takes into account, for example, information about the topology of the communications network KN, about the transmission capacities of the transmission paths W in the communications network KN, or about typical load situations in the communications network KN.
• information about the topology of the communications network KN about the transmission capacities of the transmission paths W in the communications network KN, or about typical load situations in the communications network KN.
• the communications network KN is considered on the basis of the available routing information RI, there are various possible ways to determine the available capacity VK for the transmission of traffic streams VS:
• the access control is adapted on the basis of the information which is reported via the routing protocol RP. If the status of the communications network KN changes, for example in the event of changes to the paths in the communications network KN as a result of a failure of a transmission path W or a change in the load situation of a transmission path W, or else a change in the capacity of a path (for example in the case of ATM, ISDN), the access control for the access node ZK is thus adapted in an appropriate manner immediately, by determining the available capacity VK once again. In the absence of one transmission path W—for example the transmission path U 24 —this adaptation and corresponding redetermination of the paths is carried out, by way of example, by determining new bandwidth limits for the three stated scenarios:
• the access node ZK contains a predefined table (or calculation formula) for determining a new limit VK.
• the new limit VK is taken from the table, taking into account the available transmission paths W.
• the access function ZF recalculates the bandwidth limits VK for all the routes by reallocation of the available capacity VK of the access node ZK.
• the transmission capacity of the routes which no longer exist should, for example, be regarded as having been lost. If the new routes overlap old routes, then the previous contingents must be redistributed between the routes. If, for example, the transmission path W 24 fails, the new route from the transmission node K 2 to the transmission node K 3 passes via the transmission node K 1 .
• the available capacity VK for these two routes is redistributed, for example, as follows: if 100 traffic streams VS were originally allowed for each of the two routes, then, for example, 50 traffic streams VS will be allowed for each route after the redistribution.
• the recalculation of the access function ZF may show that more traffic streams are being transmitted to the communications network KN than would be permissible on the basis of the recalculated available capacity VK. If the maximum number of connections in the network is exceeded as a consequence of this, this results in an overload, and in some cases to loss of traffic. The transmission of some of the traffic streams VS is thus ended on the basis of the recalculation.
• two variants are envisaged for this purpose:
• any decision between the two variants depends, for example, on the speed with which the access node ZK and the traffic streams VS react or can react.
• the two variant is preferred, in the case of doubt, on the basis of the following consideration: many applications normally use at least two associated traffic streams VS, which typically run in opposite directions (so-called bi-directional connections). If, in this case, one of the traffic streams VS is terminated, the application normally also terminates the associated second traffic stream VS, with a certain time delay.
• long-distance traffic communications networks KN such as the Internet
• local communications networks KN also referred to as local area networks or LANs
• virtual communications networks KN for example those referred to as a virtual private network or else VPN, or the initially described prioritized sub-network of a DiffServ network.

Landscapes

• Engineering & Computer Science (AREA)
• Computer Networks & Wireless Communication (AREA)
• Data Exchanges In Wide-Area Networks (AREA)

Priority Applications (1)

Applications Claiming Priority (2)

Related Child Applications (1)

Publications (1)

Family

ID=8167678

Family Applications (2)

Family Applications After (1)

Country Status (8)

Cited By (5)

Families Citing this family (6)

Citations (4)

Family Cites Families (12)

• 2000
  • 2000-01-21 EP EP00101182A patent/EP1119216A1/de not_active Withdrawn
• 2001
  • 2001-01-09 CN CN01803900.6A patent/CN1203724C/zh not_active Expired - Fee Related
  • 2001-01-09 IL IL15071401A patent/IL150714A0/xx unknown
  • 2001-01-09 WO PCT/EP2001/000166 patent/WO2001054448A1/de active IP Right Grant
  • 2001-01-09 CA CA002398009A patent/CA2398009C/en not_active Expired - Fee Related
  • 2001-01-09 US US10/181,554 patent/US20030002531A1/en not_active Abandoned
  • 2001-01-09 DE DE50105827T patent/DE50105827D1/de not_active Expired - Lifetime
  • 2001-01-09 EP EP01905657A patent/EP1249154B1/de not_active Expired - Lifetime
  • 2001-01-09 AU AU33689/01A patent/AU3368901A/en not_active Abandoned
• 2008
  • 2008-03-28 US US12/058,415 patent/US8174979B2/en not_active Expired - Fee Related

Patent Citations (4)

Also Published As

Similar Documents

Legal Events