Classifications

• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L45/00—Routing or path finding of packets in data switching networks
  • H04L45/24—Multipath
  • H04L45/245—Link aggregation, e.g. trunking
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04Q—SELECTING
  • H04Q3/00—Selecting arrangements
  • H04Q3/0016—Arrangements providing connection between exchanges
  • H04Q3/0062—Provisions for network management
  • H04Q3/0066—Bandwidth allocation or management
• • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
  • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
  • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
  • Y02D30/00—Reducing energy consumption in communication networks
  • Y02D30/50—Reducing energy consumption in communication networks in wire-line communication networks, e.g. low power modes or reduced link rate

Definitions

• 1 invention relates to an information system for the construction and / or management and / or supervision in a transport network of a bundle having resources between an access node and a destination node linked together by at least a path.
• bundle is meant a quantity of resources defined and allocated to one or more services between any two nodes of the network.
• the field of the invention is that of transport networks. It can be rail, road, etc. transport networks. It can also be transport networks, energy networks or telecommunication networks.
• the transport network of a telecommunications network transporting voice, images and / or data will be considered below.
• the function of accepting or rejecting an attempt to establish a connection between two nodes of such a network is essential. In particular, it reflects the availability of resources existing between two nodes.
• Several types of traffic are generally envisaged between two nodes, and the availability of resources then also varies according to the traffic envisaged.
• 50% of the bandwidth could for example be allocated to immediate transmission ("immediate forwarding") of packets guaranteeing a speed of transmission but not the transmission of all packets , this traffic is often used for real-time applications such as voice transmission; the remaining 50% can be allocated to "best effort" traffic, according to which packets are sent if resources are available, otherwise destroyed, this type of traffic being frequently used when loading "Web" pages under the Internet.
• the "call by call” mode the request for availability of resources for each call is sent to each node of the network that the telecommunications must cross. Each node analyzes its own capacity to ensure telecommunications to the next node and accepts or rejects the connection request concerning it.
• "by beam” mode the function of accepting or rejecting a connection attempt applies to the beam.
• the term “bundle” is as has been said, a quantity of resources defined and allocated to one or more services between any two nodes of the network.
• the resources were defined and allocated beforehand node by node and according to the traffic during the construction of the beam. Furthermore, when a modification of resources allocated to the beam, this modification must pass through each node carrying the beam and be approved by them.
• the function of accepting or rejecting an attempt to connect between two nodes intervenes in the construction of the beams; the knots generally crossed are the multiplexing points. Then, this function will intervene for the establishment of calls in this bundle; the access and destination nodes are generally switches.
• beam will be used to designate the RTC beams, the MPLS tunnels or any other terminology specific to the field of application.
• call-by-call mode the request for availability of resources is made node by node.
• beam mode when establishing or modifying the beam.
• this acceptance or rejection function is specific to the transport network; it depends in particular on the transport protocol (synchronous, asynchronous transfer mode (ATM in English), etc.) and on the network control protocol called the signaling protocol. And in the case of interworking between different transport networks, this dependence requires translation or even adaptation for this function.
• the object of the invention is to allow the acceptance or rejection function to be processed at the access node during the connection attempt between this node and a destination node, even in the event of modifications occurring on the network. .
• the access node has global information on the chosen route and for a given traffic.
• FIG. 1 a transport network of which an example of small size is represented in FIG. 1, having resources between an access node A, identified in ⁇ in the figure, and a destination node D identified in ⁇ , connected between them by at least one path Ch ⁇ j . , i varying from 1 to I the number of possible paths connecting ⁇ to ⁇ .
• a connection between an access node A and a destination node D can indeed take a path ChADi among several possible paths.
• a path ChAD x generally comprises several links L-,.
• Different types of traffic T k can be allocated to a link L 3 ; resources are thus defined for each link as a function of the chosen traffic, which we denote by RL 3 , ⁇ - k varies from 1 to K the number of possible traffics.
• RL 3 a function of the chosen traffic
• ⁇ - k varies from 1 to K the number of possible traffics.
• the subject of the invention is an information system for the construction and / or management and / or supervision in a transport network of a bundle having resources R between at least one access node A and at least one destination node D linked together by at least one path ChADi, mainly characterized in that it comprises a database CR listing for each path ChADi the information relating to the resources R available and means for updating dynamic MC of the CR database.
• the CR database can be made up of several sub-databases, each sub-database containing only part of the CR information.
• the information system possibly includes, linked to the CL database, simplified means MCCL for calculating information from the CL database.
• the information system comprises means for updating the CL database by the operator.
• the system includes dynamic routing means for updating the CL database.
• the CL database can be made up of several sub-databases, each sub-database containing only part of the CL information.
• LC database may consist of several sub-databases CL A, each sub-base CL A containing only information relating to the set of paths CHADI from an access node A.
• a path ChADi consisting of at least one link L- , the system comprises connected to the database CR, a database LR comprising for each link L- , the information relating to R. resources.
• LR data can be linked to the CR database via the dynamic updating means MC and / or the triggering means MD.
• the information system possibly includes, linked to the LR database, simplified means MCLR for calculating information from the LR database.
• the information system comprises means for updating the database LR by the operator.
• the subject of the invention is also an access node A to a transport network organized into one or more beams constructed from an information system as described above, characterized in that it comprises modification means MM of said information system.
• the transport network of a telecommunications network shown in Figure 1 consists of 7 transmission links. Only the paths starting from the access nodes A identified by ⁇ and ⁇ are represented.
• the other paths represented in this figure are all the paths that the client accessing the network in ⁇ can take according to whether he seeks to join the destination nodes D marked ⁇ or ⁇ .
• Towards ⁇ , two paths are possible (1 2), while towards ⁇ , only one path is authorized
• the switch A chooses another path if it exists, the path Ch ⁇ ⁇ i in our example and interrogates the database CR with these new data. It thus avoids the "crank back". S. 'there is no other way, the resource request is rejected.
• FIG. 3 represents an information system according to the invention enabling the CR database described above to be established from two other CL and LR databases.
• the CL database details for each path ChADi the list of links L-, borrowed.
• the database CL may consist of several sub-databases data CL A, each sub-CL A base containing, for example, information relating to the set of paths ChAD x from an access node A or from a group of access nodes A corresponding to a predetermined geographic area.
• T k can here also designate the maximum resources allocated to the link by type of traffic, the resources used and / or available in real time for each type of traffic, etc.
• the information contained in these databases can be differentiated according to the direction of traffic flow in the link, which is interesting in the case of asymmetric traffic.
• These different categories of resources are defined by the network operator.
• LR database can consist of sub LR T databases, each sub-base T LR containing such that the information relating to a type T k resources or for a specific group of types of T k resources .
• Calculation means MC interpret and compile the data from the LR and CL databases to establish the CR database according to criteria defined by the operator: from information from LR (process P4) and CL (process P5 ), the means MC calculate the resources R AD ⁇ , ⁇ k-
• the resources available for a given path and a given type of resources will be equal to the minimum between the corresponding available resources of each link constituting the path.
• the resources R ⁇ ⁇ , ⁇ k will be calculated according to the following formula:
• Tk in (R L l, Tk t R] - 2 , Tk i RL 3 , Tk)
• the means MC transmit them (process P6) to the database CR listing for each path the information relating to its resources R A Di, ⁇ k-
• the transmission of the results may only concern the modified resources or the entire CR database; it can also be periodic and / or occasional, that is to say triggered by certain events.
• the CR database is now ready to be queried by the access nodes A (process P10 and Pli).
• These calculation means MC are triggered by trigger means MD according to a cyclic and / or occasional process which will be detailed in FIGS. 4 and 5.
• the CL database detailing for each path ChADi the list of links L-, borrowed, is initialized by a management system such as that used by the operators of a transport network of a telecommunications network to control or manage their network.
• This management system transmits the path structure defined by the operator to the CL database.
• the CL database is updated by the management system or by dynamic routing protocols if they exist (P3 process).
• the appearance of new paths often results from the optimization of existing paths: it is preferable to introduce them only periodically according to a carefully adjusted period rather than systematically, in particular call by call.
• the LR database comprising for each link L-, the information on their resources R 3 , ⁇ k ? is configured by the network management system (PI process) which defines the links L-, and the different types of resources T k .
• PI process network management system
• PI process management system
• P2 process network supervision system
• This update can be triggered cyclically and / or by certain events: when a predetermined threshold is crossed, for example a threshold on resources, during a significant change in state of the link (failure, restoration signal after failure, sudden and significant variation in available resources, etc.), etc.
• a predetermined threshold for example a threshold on resources, during a significant change in state of the link (failure, restoration signal after failure, sudden and significant variation in available resources, etc.), etc.
• the cut of a link for example will be translated in the base LR by a setting to zero of the resources for all the types of resources T k .
• the transmission of the information contained in the LR database to the calculation means MC can also be triggered cyclically and / or occasionally as a function of significant changes in the LR database.
• the transmission of the information contained in the database CL to the calculation means MC can also be triggered cyclically and / or occasionally as a function of significant changes in the base CL.
• the means MC calculate the resources R AD i, ⁇ k according to the process described above and transmit them to CR (process P6).
• FIG. 5 describes the processes for updating the databases CR, LR and CL by the command, that is to say by the access nodes, in this case by the switches in our example.
• the switches A have MM modification means shown in FIG. 6, in addition to their usual MT transmission means. Thanks to these means MM, they can transmit resource modifications to the CR database, call by call or by level. The levels may in particular be defined by resource thresholds and / or by a period. We again refer to FIG. 5.
• the switch A informs the database CR thereof (process P7): it transmits a information equivalent to a variation of resources ⁇ R AD ⁇ Tk , ⁇ R AD ⁇ Tk being positive in the case of a release of resources, negative in the case of taking resources.
• the CR database which has simplified calculation means MCCR updates the corresponding resources by replacing AD ⁇ , ⁇ k by
• the switch can inform the database CL of this variation in resources: the information ⁇ R ADl , ⁇ k is transmitted to CL.
• the CL database also has simplified calculation means MCCL allowing in particular to add to ⁇ R ADl , T kl list of links L-, constituting the path ChADi concerned.
• CL transmits to LR (process P9) this set of information, namely the information ⁇ R A D ⁇ , ⁇ k to be reflected on all of these links.
• the LR database which also has MCLR simplified calculation means then updates the resources of the links concerned by replacing 3 , ⁇ k by R ⁇ , j, ⁇ k +
• This update frequency may depend on calendar dates and times, event dates and times, size of reported events, etc.
• the invention can be used to reproduce this method of managing the BTI.
• the LR database will be configured by introducing for each link considered, in addition to the resources used for traffic Tl, T2, T3, the maximum resource authorized for each of these traffics.
• the maximum resource values will be set by the network operator via the management system (PI process), while the resource values used will come from the supervision system (P2 process).
• PI process management system
• P2 process supervision system
• the operator will ensure that for each link considered, the sum of the maximum resources is less than or equal to the total resources of the link, in this case its bandwidth: bandwidth will be strictly divided between traffics.
• the CR database will be updated from this information according to the processes P4, P5 and P6 described above.
• the operator may on the contrary wish that the beams are managed with a total pooling, that is to say that the total resources of each link are available for any traffic.
• total pooling prevents guaranteeing a minimum bandwidth for the beams participating in pooling.
• the operator can also consider intermediate situations of partial pooling of resources.
• the configuration of the LR database will be unchanged from the first case presented above, but for each traffic, the maximum resource values will be fixed so that they are generally less than the total resources of the link but their sum is greater than total resources of the link.
• the operator can still choose a mixed management which consists of mixing the first two solutions so as to obtain bundles with guaranteed bandwidth reproducing the equivalent of a leased link and bundles with bandwidth " shared bandwidth.
• the resources are then divided of each link in two parts: one reserved for bundles with guaranteed bandwidth, the other for shared resources.
• the first part will be managed as in the example described in the absence of mutualisation, the second as in the example with mutualisation total or partial depending on the type of pooling desired.
• the invention has remarkable modularity by playing on the one hand on the configuration of the databases and on the other hand on the programming of the computing means.
• connection-oriented or connectionless connectionless

Landscapes

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

Applications Claiming Priority (3)

Publications (1)

Family

ID=8849083

Family Applications (1)

Country Status (4)

Family Cites Families (6)

• 2000
  • 2000-04-10 FR FR0004578A patent/FR2807541B1/fr not_active Expired - Fee Related
• 2001
  • 2001-04-09 EP EP01923769A patent/EP1273141A1/de not_active Withdrawn
  • 2001-04-09 AU AU2001250460A patent/AU2001250460A1/en not_active Abandoned
  • 2001-04-09 WO PCT/FR2001/001081 patent/WO2001078332A1/fr not_active Application Discontinuation

Non-Patent Citations (2)

Also Published As

Similar Documents

Legal Events