JPH11504186A - Dynamic infrastructure - Google Patents

Abstract

(57) Abstract: A dynamically exchanged first plurality of layered networks (1) and at least a second layered network (2, 3) below which the first overlapping layered network is located Method of Dynamic Resource Allocation in a Hierarchical Network Structure According to the present invention, at least the first layer has a first relation (50, 51; 87, 88) indicating two access points (A1, A2; A5, A6) in the second layer. A first route is provided. Establishing a connection (A1-23-A2 or A1-25-24-A2 or A5-36-35-34-A6) between the access points in the second hierarchical network (2), and It has a second number of resources, usually called. The substructure is finally assigned to the first route (13).

Description

DETAILED DESCRIPTION OF THE INVENTION                   Dynamic infrastructure Background of the Invention   The present invention relates to a telephone network, and more particularly to the allocation of resources in a hierarchical reference model. About attachment.   The hierarchical reference model is a network on netwo rk) generalizes the OSI reference model that allows the description of the complex structure of You. Each network level is called a stratum. Hierarchy of physical transmission It is a logical model. The hierarchy describes nodes and routes between nodes. You. The physical transmission network modeled by the hierarchy has multiple nodes and multiple It has a link. These links span multiple trunks that extend between nodes. Grouped. Various hierarchical networks are defined by configuration data. You. The different layers mutually form a layered transport network. Each level is Associated with each bearer service. Beara Sabi Is a service that transfers data. Different hierarchies are different bearers Has screws.   For the avoidance of doubt, the following definitions are used. That is, the information between the two endpoints The connection is used to transfer. Connections are created in various ways. For example , Connections are created by cross-connections, by manual exchange, or by exchange. Intersection Connected connections are created, for example, by cross-connects, and manual switched connections are As an example, a connector matrix created by soldering and A connection is created based on the request, for example, by dialing the registration number on the phone Is done.   Channels are a means for one-way transmission. Channels go from one point to another Used to carry information to the other point. To transmit information from A to B One channel is required for this, said channel having a direction from A to B. To transmit information from B to A, the other channel must be And the opposite direction is required.   In the following, two opposing channels extending between the same pair of points are referred to as channel Called a pair. Several channel pairs form one link reciprocally. The link is Physical system (for transferring information). Thus, the link carries a channel pair You. The maximum number of channel pairs that a single link can carry is bearer service and physical Depends on the characteristics of the physical system.   The root is a logical concept. One route has many channel pairs, and Used to interconnect two nodes. In theory, one route is provided There is no maximum number of channel pairs that can be obtained. The concept of routes is that connections are hierarchical Is used to define the form that follows between the nodes. This is called routing And is normal.   At each end of the link there is a switching terminal EF. ET is "insert", ie the same link Multiple channel pairs are multiplexed together and "extracted", i.e. multiple from the same link. Operates to demultiplex the channel pairs.   The above definitions are explained with reference to FIG. FIG. 1 shows two nodes N1 and N2. There is one route R1 extending between. As an example, the route R1 is 2 There are 48 channels in each of the opposite directions, ie, route R1 has 48 channels. It carries 96 channels distributed to carry a pair of flanks. Figure 1 is the one shown in Figure 2 This is a logical description of the physical transmission system. FIG. 2 shows a configuration between nodes N1 and N2. There are two linked links L1 and L2. At each end of the links L1 and L2 Each switching terminal ET exists. Assuming that the bearer service is STM64 Then, the link L1 is configured such that there are 32 channels in each of the two opposing directions. Carry 64 channels allocated to Therefore, link L1 has 32 channel pairs. Transport. Similarly, link L2 carries 32 channel pairs. Link L1 The total of 32 channel pairs is 48 channel pairs except for only 16 channel pairs of link L2. Are grouped into a route R1 that holds. The physical transmission system shown in FIG. And the remaining 16 link elements of the link L2 not used for the route R1 are other May be formed (not shown in FIG. 1). 2, nodes N1 and N2 correspond to nodes N1 and N2 in FIG. I do.   FIG. 3 shows three hierarchies 1, 2, and 3, each such hierarchy being illustrated. FIG. 3 shows a logical diagram of a physical transfer network that does not exist. Tier 1 has 3 nodes 10 12. Tier 2 has three nodes 20 to 22, and Tier 3 has nodes 30 to 33. You. Layer 1 has three roots 13 to 15, layer 2 has three roots 23 to 25, and layer 3 has It has three routes 34-36. As an example, bearer service at Tier 1 Is a 64 kbps STM (synchronous transmission mode). As an example, in Tier 2 The bearer service is 2 Mbps STM (1. 5Mbps ST M). As an example, the bearer service at tier 3 is 155 Mbps STM. As an example, routes 13, 14, 15, 25 and 34 have two links Channel pairs are shown, while routes 23, 24, 35 and 36 are 1 One with a link-only channel pair is shown. Links are represented by solid lines Have been. The links of route 13 are represented by 40 and 41. Each level has There are multiple access points for different networks. these Access points are schematically indicated by black circles at each level . At each level, each access point has a connection to a node . In tier 1, connections from access points to node 10 are collectively 1 By 6 the connection from the access point to node 11 is collectively by 17 And to node 12 is indicated by 18. Similarly, in layer 2, Connections 26 and 27 exist. Similarly, connections 37 and 38 also exist in the hierarchy 3 . The access device is connected to an access point. This access device Used for communication. As an example of an access device, two telephones A and And B are shown. There are also access devices in layer 2 and each symbolically Indicated by C and D. An example of an access device in Tier 2 is the main frame. Computer. In Tier 3, access devices are symbolically E and F. In a physical transfer network not shown , Connections 16, 17, 18, 26, 27, 28, 37, 38 are exchange terminals It exists on each node side via ET. Update on physical transport network In the case of bearer service of STM 64 Mbps, such exchange is described. Exchange The terminal can be a normal line interface circuit LIC.   The exchange terminal ET at a certain level is represented by a small blank rectangle in the attached drawing. Shown.   The nodes 10 to 12 in the tier 1 usually have a switch structure. Physical change A switch in a transport network may have one or more switches in different layers. It corresponds to the switch structure. Crossover connectors in the physical transport network It corresponds to nodes 20 to 22 in layer 2. For physical transport networks The wire connections in this will correspond to nodes 30-33 in hierarchy 3.   Layer 1 makes a call by dialing at the calling access device. Can route a connection from an access device to a terminating access device In this sense, they form an exchange network. Tier 2 is typically a non-switched network. The connection from C to D is set up on a long-term basis by the network operator Fixed fixed connection.   In Tier 1, each route 13, 14, 15 has a number of routes between the two nodes. Represents a resource, said resource being present in the form of a channel pair.   Nodes 10, 20 and 30 correspond to each other according to the structure of the physical transport network It may or may not be necessary. Usually, the physical partner is geographical in the physical transport network. Since they are located in different places, they do not correspond to each other. switch Since the crossover connectors and wired connections are all located in the same geographic location If so, nodes 10, 20, and 30 correspond to each other. The same idea , Nodes 11, 21 and 31, and nodes 12, 22 and 32.   The items described above mutually construct a traffic system. On each level Traffic varies depending on the time of the day and the day of the week. With one example The headquarters of a company that has sales offices in several cities I would like to report all items that I have made to the head office. The corresponding information is book at night It needs to be sent to the company. Transmission uses bearer service at layer 1 level Is spent to complete such data transmission, if performed Time will be unacceptably long. This is a 64 kbps STM network. Due to the regulated bandwidth provided by the network. Instead, the company has multiple We have leased a number of 2Mbps STMs that connect the office with our head office. This 2Mbps Connections are set up at Tier 2 by the Tier 2 network operator. like this Settings are made using the operating and support system OSS29. Performed manually by the network operator. Leased in Tier 2 The 2 Mbps connection is set at night, for example, between 8:00 pm and 5:00 am Daytime Then, the leased connection in layer 2 is used for other traffic. In this way, the network operator is as efficient as possible In order to use the resource, the resource of the tier 2 is reconstructed at a predetermined time. O SS 29 controls and monitors the operation of nodes and routes in layer 2. In addition, there is an OSS39 that controls and monitors the corresponding items in Tier 3. I do.   At a given time, the manual setting of the connection in the tier 2 is performed by a plurality of users. It is a fixed way to satisfy traffic requirements. These users need these Request to notify the network operator about the request -The operator needs to manually configure the connection. At times other than the user's agreement If it is necessary to use a leased connection in between, the network operator I need to get in touch. So the network operator in Tier 2 Examine the current traffic situation and assign one link to the requesting user. It is necessary to manually set the connection for one fixed period. Custom required The time delay between the request and the setup of the requested connection can take several days .   Connections in Tier 2 are leased for a fixed period of time and traffic Network requests may change during the fixed period, Work resources are not being used efficiently.   Related prior art   U.S. Pat. No. 5,058,105, U.S. Pat. No. 5,182,744, U.S. Pat. No. 5,031, 211, traffic disrupted by a failed link, for example, is To improve the reliability of the telecommunications network so that services can be restored; and It is about equipment. Decide alternative routes to transfer confused traffic Various methods of defining are described.   U.S. Pat. No. 4,669,113 connects switches in a switching system. Non-hierarchical exchanges employing an algorithm to expand the link size for the path It relates to a conversion system. This causes a change in trunk status When, for example, an empty trunk line is created or removed, periodically, for example, 5 seconds. Sends information on available trunk lines to the central integrated network controller based on the standard Thus, this is achieved by providing each switch in the switching system. Integrated net The work controller uses an alternative route based on the received traffic information. Using processing to adjust traffic handling capacity between nodes based on possibility Thus, the required number of trunk lines for each link is determined.   EP-A2-464 283 describes a restricted one like a trunk for video conferencing. Allocation of one common resource among multiple requests for a resource Is what you do. The network responds to multiple customer requests for that bandwidth. Allocation method to ensure that communication path bandwidth is allocated . Examples of customer requirements for meetings include start time, stop time, maximum and minimum bandwidth. Request. X1 and X2 indicate specific locations within the bandwidth of the communication path, X3 and X4 indicate specific locations within the bandwidth of the conference path, and X3 and X4 are open. When referring to the start time and stop time, respectively, for the reservation of each meeting, There is an associated "bond" involving four times the format (X1, X2, X3, X4). Customer side Represents one or more endpoints. Assignment configuration allows for multiple requests from customers Receive and allocate a network for communication between multiple customer sides. allocation The configuration stratifies the incoming requests in response to the grouping of the meeting endpoints, and then Network resources can be allocated in response to tiered requests. Therefore, the allocation process is started at a predetermined time according to the customer's request and the current It is not driven by traffic loads.   Ericsson Review, Vol. 67, No. 4, December 1990, Stockholm Walter Widl, "Telecommunications Network Architecture Cha (Telekommunikationsatets arkitektur), pp. 148-162 Discusses how to get a layered telecommunications network for transmission Has been stated. A number of connections are shown. In particular, how to connect Information Flow through the various layers. How and when did this dissertation It does not explain whether to set up a connection.   Summary of the Invention   An object of the present invention is to provide a die of a lower structure of a lower layer in a hierarchical network structure. Method and system for obtaining a connection along the root of a higher hierarchy using a dynamic allocation It is to eliminate the disadvantages of the prior art by providing a stem.   In particular, allocating the lower structure of the lower hierarchy to the upper hierarchy means that the lower hierarchy Triggered on demand in response to current traffic conditions along the route.   Furthermore, according to another feature of the present invention, the lower structure of the lower hierarchy is assigned to the upper hierarchy. Is controlled from within the traffic system. Systems outside of OSS are Is not involved in the allocation process and therefore must perform the assignment No operator needs to be contacted. So the assignment is It can be done dynamically on demand.   According to another feature of the invention, the allocation process proceeds from a number of lower layers to a higher layer. Allows for the repetitive assignment of substructures.   The above objectives are based on a first criterion relating to one end of said route and the opposite of said route. This is achieved by providing a route having a second criterion associated with the edge. Previous The first criterion refers to a first access point existing in a lower hierarchy. The second Indicates a second access point existing in the lower hierarchy. The route From the node at one end to the first access point in the lower hierarchy. Wire connections are provided to the points. Similarly, at the opposite end of the route From the node to the second access point existing in the lower hierarchy. A simple wire connection is provided.   When the control logic requests the first tier to set up a connection, the connection Typically, it extends along a number of routes. Tigers along one of the routes All resources in the one route are busy due to heavy Assume that Conventionally, connection requests are rejected in such situations. In the present invention According to the control logic, the control logic first checks the one route and To see if it was related to the criteria. If this is not relevant, the connection The request is not rejected. However, if this were relevant, the control logic Takes the criteria and associates with the access point in a second connection request To the specified hierarchy. The second connection request is for two accesses to which the criteria are related. Set up a connection between the connection points. The access point is typically Exist in a hierarchy called the second hierarchy, and the one busy root exists. Adjacent below things. Therefore, the second connection request is transmitted to the second layer. You. The control logic associated with the second tier comprises the second tier network To determine if a connection can be established between the access points. Bell. Empty along the route between the access points in the second tier Assume that the resource exists. The control logic associated with the second hierarchy Will now establish a connection between the access points. This connection A lower structure for the first layer is configured. In this way, the lower structure It becomes available to the first hierarchy at the opposite end node. Below, the lower part The structure is said to be assigned to the hierarchy. The resources of the substructure are: Are provided. In the assigned substructure, One channel pair is captured and used to set up the original request connection; Meanwhile, the rest of the channel pair is enabled for use by future connections.   Therefore, the assignment of the lower structure is performed along the route in the upper hierarchy. When there are no more channel pairs available for the traffic, Done, but there is still a request to set up a new connection along the route. ing. The resources allocated by the upper layer are no longer used If so, the lower structure is returned to the lower hierarchy, where it is accessed by the lower hierarchy. Made accessible. In this way, the two-layer combination related to the assignment process The nest structure is used efficiently. Therefore, the resources of the substructure are Is also used efficiently.   According to an embodiment of the present invention, the first criterion is a first address existing in the lower hierarchy. Access point group, and the second criterion exists in the lower hierarchy. To a second group of access points. At one end of the route Between each node and each of the first access points. An ear connection is provided. Similarly, the node at the opposite end of the route To each of the second access points existing in the lower hierarchy. An ear connection is provided. When criteria are created for the first and second criteria One access point in said group of said first access points. Is selected and one of the second access points in the group Is selected, and the connection in the lower hierarchy is based on the two selected accesses. ・ Set between points.   BRIEF DESCRIPTION OF THE FIGURES   The novel features believed characteristic of the invention are set forth in the appended claims. . However, the invention itself, together with other features and advantages, is not limited to the accompanying drawings. When read in tandem, by reference to the following detailed description of certain embodiments, Best understood.   FIG. 1 is a block diagram of a route extending between two nodes.   FIG. 2 is a detailed diagram of the route shown in FIG.   FIG. 3 is a simplified schematic diagram showing a hierarchical network structure according to a known technique;   FIG. 4 is a simplified schematic diagram of the hierarchical network structure in FIG. 3 modified according to the present invention. Is a schematic diagram,   FIG. 5 is a schematic block diagram of nodes 10 and 20 in levels 1 and 2 of FIG. 4, respectively. Is a diagram of   FIG. 6 shows a list of available resources related to a route to which a substructure can be assigned. Strike,   FIG. 7 is a list of free resources in FIG. And   8 to 10 show the traffic included in the process of dynamically allocating the substructure. A flowchart showing a system control logic,   FIG. 11 shows a route designation table.   12A and 12B are lists of free resources similar to the list shown in FIG. And   FIG. 13 is a simplified hierarchical network illustrating a modification of the dynamic allocation process according to the present invention. Network,   FIG. 14 shows a simple hierarchical network showing an example of an iterative dynamic allocation process. Work, and   FIG. 15 is a schematic diagram showing a second embodiment of the present invention.   Detailed description of specific embodiments   FIG. 4 shows that two physical connections 4 and 5 exist between Tier 1 and Tier 2. And FIG. In particular, physical connection 4 is from node 10 EF1 to node 20 ET4. Physical access point in ET4 of node 20 Are labeled A1. The physical connection 5 is connected to the node 11 in a similar format. It extends from ET2 to ET3 of node 21. The thing in ET3 of node 21 The logical access point is labeled A2. In this way, the hierarchy Two physical connections are formed between 1 and 2. In layer 2, 2 Mbps of layer 2 A connection can be used to set up a connection between MA1 and A2. As an example, A connection can be set up between A1 and A2 using the route 23. With other examples It is possible to set up a connection between A1 and A2 using routes 25 and 24. Wear. For the moment, it is illustrated in layer 2 to explain the mechanism of the present invention. Are not required from other control systems not shown in Tier 1. Assume that a request is received to set up a connection between A1 and A2. OSS29 Checks its traffic to find an empty route between A1 and A2 . For example, assume that the route 23 is empty. The not-shown system in the hierarchy 2 The control system captures route 23 and sets the ET at each end of the captured route to A. 1 and A2 connect to each existing ET. Such a connection is indicated by a dashed line C1. And C2, and are schematically represented by respective connection points A1 and A2. Performed internally at nodes 20 and 21. Here, ET1 and ET2 There is a 2-Mbps connection 4-A1-C1-23-C2-A2-5 that terminates at I do. ET1 and ET2 in layer 1 are now referred to as connection 4-A1-C1-2. Determine the bit rate for operating 3-C2-A2-5. ET1 and ET2 are 6 Since multiplexing is performed at a bit rate of 4 kbit / sec, the connection 4-A1-C1-2 3-C2-A2-5 is also driven at this speed. Therefore, the connection uses resources. 3 In addition to route 13 in the form of two channel pairs, each such channel pair is 64k Propagated at a rate of B / s and carried by a 2 Mbit / s connection in Tier 2. It is. For signaling purposes, typically one or two of the added 32 channel pairs Are used.   Understand how physical connections can be created between logical layers as shown in FIG. May find it difficult. Figure 4 is just a logical network diagram It should be noted that The physical transfer network (not shown) is The network exists and the wire connections are made within this physical network. It is. In particular, these connections are made between links belonging to the physical transport network .   The physical network is not part of the present invention, no matter how it looks. applicant However, the approach that illustrates the present invention is separate from the exact layout of the physical network. is there. In the example shown in FIG. 4, three nodes 10, 11, and 12 are in hierarchy 1 and 3 nodes are in hierarchy 2. Nodes 20, 21, and 22 exist. The node 20 has, for example, the node 10 Exists on the same physical node as the physical node to be used. For example, the node 21 Exists in a cabinet that stands near another cabinet in which the node 11 exists. . In the first case, a physical connection is made within the same node, and in the second case, two physical connections are made. Physical connection is made between nodes in the cabinet. If the physical layer is illustrated above If it looks different from what you have done, the physical connection is probably a different wire.   FIG. 5 shows the node 10 in detail, and further includes a switch 10 and a processor. 45 and a control program 46. In addition, for example, a resource at level 1 There is a database 47 with a network description of the resources. Description like this Is the normal routing data used to route calls through the network, for example. Together with a link table of the type shown in FIGS. 6, 7 and 12B. For example, such a link table can be used to store individual channel pairs for a particular route, for example. To record the current status of the individual, i.e. whether or not individual channel pairs are occupied. Used.   The control program module 46 has several individual programs, among which Also has a call setup program 48 and a resource handler 49. Likewise Thus, the node 20 of the hierarchy 2 includes the processor 55, the program module 56, and the A data base 57 is provided. The program module 56 has several controls. Control program, such as a call setup program 58, and a link of the type shown in FIG. 12A. ・ Equipped with a table.   In practice, processors 45 and 55 are physically the same processor and This is also possible for databases 47 and 57.   The root in tier 1 has one or more links. Each route , Each route table is associated. FIG. 6 shows the route table Bull 52 is shown. As an example, the route associated with route table 52 Is route 13. Route 13 has two links 40, 41, each of which is Comprises 32 channel pairs, some of which may be used for signaling purposes. Remaining Another 30 channel pairs are available for traffic. This is about Route 13 This gives a total of 60 channel pairs. Available channel pairs are 1, 2,. . 60 numbers Is attached. Each such channel pair has one status, immediate It has busy and non-busy. According to the present invention, the route table 52 has 5 It has two references, symbolized by 0 and 51. Each reference has one relationship Represent. In particular, (i) the first access of the first end of the route 13 and the lower level A first relationship between a first point and a first point, wherein the first end of the route is the first Access points, and (ii) the same route 13 and a second access point also located at a lower level. A second relationship between the second access point and the second access point. There is said second relationship connected to the port. The two actions in the example shown Set points A1 and A2 must not match, but must be 13 must be located at each end. Tier 2 contains access points There may be several nodes between events A1 and A2. In particular, the link table The existence of the reference 50 in the file 52 indicates that the left end of the route 13 Connected to the point A1 and the right end of the route 13 is an access in the hierarchy 2 It is connected to point A2. According to the present invention, two points representing the two ends of the route 13 Access points A1 and A2 need to be connected to each other in Tier 2. is there. As mentioned above, such a connection is called a substructure.   The assignment of a substructure to a higher hierarchy is required when certain conditions are met. Started on request. By way of example, the assignment of the substructure may include links 40 and Triggered when all 41 channel pairs have been acquired, traffic is It continues to increase along port 13. Substructure assignments in other examples are linked Some of the available channels in table 52, e.g. The traffic load along the route 13 is at or above a predetermined level. Other parameters And the combination of parameters supports when the substructure assignment is started. Can be arranged.   Two different means of initiating the substructure assignment process are suggested by the present invention. Is done. According to one embodiment, it exists in layer 1 or layer 2 or in both layers. The control logic is means for initiating the substructure assignment process. This implementation Examples are briefly described above and will be described in more detail below. Others of the present invention According to the embodiment, the means for starting the assignment process is a signaling procedure.   One signaling procedure is signaling, which is associated with access point A1. Access point A2 (roaming number) I have. By way of example, such signaling is an out-of-band signaling procedure.   Another signal transmission procedure uses a Q3 interface to transmit traffic (not shown). Operation and support system OSS2 through the network management system TMN Requesting a connection between A1 and A2 by sending out a request for 9 It is.   In the specific example of FIG. 4, the connections that make up the infrastructure are access points A1 and A2 is set. This connection can be via the direct route 23 between A1 and A2, Or a multi-way, formed by routes 25 and 24 via node 22 It may follow the route.   Between a user connected to node 10 and another user connected to node 11 Upon establishing a connection, for example, a channel pair on link 41 is captured and the corresponding Route table 52 is marked busy. Traffic increases and Assume that eventually all channel pairs 1-60 are busy. Route 13 The next connection request for a resource from will trigger the substructure allocation process. You. After the completion of the substructure assignment processing described above, the hierarchy 1 is now assigned to A1 It has a link at its output end in a route extending to A2. Two exchanges Terminals ET1 and ET2 now provide an additional 30 channel pairs to route 13. Will be. Here, the additional 30 channel pairs are generated at the level of hierarchy 1. Can be used for traffic that terminates. The link in the route is When assigned to the tier 1, the route table 52 may be similar to that shown in FIG. Will look like In FIG. 7, the new additional 30 channel pairs are 61-9 It is labeled 0. Add the above for the connection that triggered the allocation process. One of the additional channel pairs is captured. As traffic increases continuously Thus, additional channel pairs from among the additional ones are captured. To the user Thus, the link in the route in the hierarchy 2 is changed to the route 13 in the hierarchy 1 I don't see it assigned. That is, the user establishes a connection using the link 40 on the floor. Distinguishing from connections using a dynamically established substructure via layer 2 Can not.   Channel pairs on allocated links are no longer used due to reduced traffic And the control logic present in the resource handler 49 2 and release the connection A1-C1-ET-23-C2-A2 set in layer 2. I do.   Next, the above-described resource allocation processing will be described with reference to FIGS. Call Needs to be set between A and B in FIG. In FIG. The logic of the call setup program 48 is shown on the left. On the right, the route Here is the logic of the route specification analysis performed using the table. To block 60 The connection request expressed by the following is a case where user A dials a telephone number to user B. Occur. After normal digit analysis, the destination of the call is established. Directions to destination ( The routing analysis begins to find the way) (block 61). Roux At the time of the route specification analysis in FIG. Is used. As the input data for the route analysis, In that case, the identification represented by N11 is given to node 11. N11 entry , Identification of a route that can be used for node 11, in this case R1 The identification of the route 13 represented as 3-ID is shown. Of the route to use The search is represented by the multiple ROUs represented by block 63 in FIG. The process of returning the T-ID is represented by block 64. Call setting program 48 Receives a possible route (block 65), and then the call setup program In a particular example relating to a telephone call, the frame in the first identified route From a time slot having a fixed time position from The channel is commanded to need to be captured (block 66). This capture command Is sent to the resource handler 49 (ring 67). Resource handler Inspects the list of free resources corresponding to the selected resource and Check if there is any sky. The result is the call setup represented by block 68. Returned to regular program. The result is whether or not the channel has been acquired. Izu This case is determined by the selection block 69. Resource is empty (two people If the answer is yes, the call setup program 48 sets up the connection (block 7). 0). If there are no empty resources (either alternative is NO), test this (decision block). Lock 71), when another route is given in processing step 64 (two If yes, try the next route to see if the resource can be captured ( Block 70A). This procedure is performed from among the other routes whose resources are empty Iterates until it finds one route. This iterative procedure is indicated by the arrow 70B in the loop. Are represented. If none of the other routes contain empty resources , The connection request is rejected (block 70C).   FIG. 9 shows the logic of the resource handler 49. Receiving capture command Upon reception (ring 67), the resource handler returns a corresponding list 5 of free resources. 2 is checked to see if the resource is empty (selection block 72). Resource If the resource is empty (either "yes"), the resource handler 49 And sends an identification of the captured resource to the call setup program 48, which At cle 68, an identification of the resource is received. If the resource is not empty (Judge The alternative in block 72 is "no", the resource handler checks Check whether the selected resource is related to the substructure (selection block 74). If the resource is irrelevant (either "no" in the alternative), the resource hand The caller sets this up in circle 68 to receive the corresponding message. Communicate to g. If there is a relationship (either alternative is "yes"), the resource The handler 49 sets the access point of the lower structure to a call setup program in the second layer. Communicate to ram 58 (circle 77) (block 76). Call setup in layer 2 The program is shown in FIG. 10 and is similar in principle to that shown in FIG. Will not be described in detail. The resource handler, from the call setup program 58, With information (block 79) about the result of the call set up in tier 2 , Receive the communication represented by the symbol of the circle 78. The requested connection is set up Or not set (Yes at decision block 80, respectively) Or no). If the connection has been set up, additional The resource is added to the list of free resources (block 81), and Channel pairs are captured for connections requested at the level (block 73). Capture The captured channel pair is listed in the list of available resources as "occupied for the requested connection. "Has been". The corresponding message is sent to control logic 48. Sent out (ring 68). When a connection is not set at the level of Tier 2 , The corresponding message (block 82) is sent to the control logic 48 and the floor Connection requests made at the Tier 1 level are rejected.   FIG. 10 shows the control program 58 in the second tier. access· When the identification of the point is received, a connection request (block 83) is created. This connection request is connected to the layer 1 shown in FIG. The request is processed in the same way as a subsequent request, and therefore will not be described in detail. Level 2 level The various processes involved in setting up a connection in the Is shown in The result is that the connection is set up (block 84) or (Block 86). In both cases, the corresponding message is Sent to the link handler (ring 78).   In the example described above, the number of root channel pairs in layer 1 is The route according to the relationship for the two access points in the two layers The access point is expanded by providing Establish two endpoints for the continuation. According to the present invention, the root in the hierarchy 1, for example, the root 13 is also described by the relation for two access points in the third layer of the hierarchy. It can be enlarged by providing a route. Indicate the end point of the root in hierarchy 3 Such a relationship is indicated by 87 and 88 in FIG. 12A, respectively. Less than Channels available for setting up connections at the top three levels and thus at the first level The use of substructures created to expand the number of pairs is described and therefore repeated. I will not do it. In this embodiment, a first connection similar to connection 4 between nodes 10 and 30 To state that there is a physical connection and a second physical connection between nodes 11 and 31 Will be enough. FIG. 13 shows the corresponding lower structure in Tier 3. For clarity, Tier 2 is not shown in FIG. In this embodiment, A first physical connection 93 similar to connection 4 between nodes 20 and 30 and nodes 21 and 31 There is a second physical connection 94 between the two. In this case, the layer 3 is 155 Mbp s, the number of channel pairs assigned to layer 1 is About 2100. The access point indicated by relations 87 and 88 is , Respectively, labeled A5 and A6.   Further, in accordance with the present invention, the number of channel pairs at the root in layer 2 is Establishing said route in Tier 2 in relation to two access points in It can be enlarged. In FIG. 12B, two such references 89, 50 are provided. ing.   Furthermore, it is possible to apply the inventive concept iteratively from hierarchy to hierarchy. This This is shown in FIG. As an example, a connection from A to B Suppose route 13 is not requested and route 13 has no resources available. hierarchy Reference numeral 13 denotes the following for accessing the access points A1 and A2 in the tier 2. It has the relationships 50 and 51 above. Distract between access points A1 and A2 Assume that there are no resources available along the running route 23. A 1 and A2 along the alternative route, ie along combination routes 25 and 24. Thus, route 25 has no empty resources, but is similar to that shown in FIG. Two access points in Tier 3 via two physical connections 93 and 94. Is assumed to have two references 89, 90 associated with events A3 and A4 . In Tier 3, there are a plurality of empty resources and nodes 30 and 33 Inside The substructure represented by the local node connections C3 and C4 and the route 36 is a hierarchy 2 Is assigned to Therefore, the connection requested in Tier 1 is It is set using the connection set in the bell.   FIG. 15 shows a further embodiment of the present invention. In FIG. Is almost the same as that shown in FIG. However, node 10 , 11 and 12 to the switching terminal ET existing in the second layer 2 There are a number of physical connections and the second tier is located in the area within closed line 22 It is represented more symbolically. Node 1 is represented centrally by reference numeral 444 Node 11 has two physical connections labeled 555 And node 12 has four physical connections 666. Each physical connection has two exchanges It extends between terminals ET. Of physical connections 444, 555, 666 to Tier 2 The edges are symbolized by black circles and are called access points. You. The access point of connection 444 is centrally marked by 93, The access point of connection 555 is marked by 94 and connection 66 The six access points are centrally marked by 95. Tier 2 Routes 13, 14 outside the network and between nodes 10, 11, 12 And 15 are present. Each route is a pointer that points to the end point of the route. Has a relationship by format. Therefore, the route 13 has two pointers 99, 100 99 of which indicate a group of access points 95, while 10 0 indicates a group of access points 93. Similarly, route 14 It has two pointers 101 and 102 pointing to respective end points in the hierarchy 2. Pointer 101 points to a group of access points 94 and pointer 1 02 indicates a group of access points 95. Route 15 has two poi And has an end point in the hierarchy 2. Especially, Pointer 103 points to a group of access points 93 while pointer 1 04 indicates a group of access points 95. Root, eg node 1 Route 15 extending between 0 and 12 requires resources from tier 2 Sometimes, two groups of these points extend between nodes 10 and 12 Since it represents the end point of the link in the route, the link handler 49 Seth Po The group of the point 93 and the group of the access point 95 are selected. hierarchy In two, the connection is made to the two access points selected in groups 93 and 95. Is set between clients. The individual connection to be set in the tier 2 is the root of the tier 2 Selection using a conventional resource allocation algorithm that inspects traffic along A choice may be made based on this test to determine which follows Tier 2. Less than Although the three levels 1, 2 and 3 have been described above, the telephone network has four levels or more. Or even just two layers, and the method of the present invention and the present invention Configuration can be applied.   A route may span several links, and as mentioned above, Some are fixed, and some of these are dynamically allocated. This The effect of this is that one route has a fixed number of resources that always exist. You. At the top of these are a number of dynamically assigned routes Resource exists.   As described above, the control logic for requesting a connection in the hierarchy 1 is a control logic existing in the hierarchy 1. Described as being executed by a processor belonging to Tier 1 On the other hand, the control logic for setting the connection in the layer 2 Described as being executed on a processor belonging to Tier 2. Was. But split the control logic and execution on processors belonging to different layers do not have to. In the present invention, the same processor executes two levels of control logic. If equally well achieved, and this processor can be If they belong to another hierarchy, no difference is generated. The processor may further comprise It may be distributed among several nodes in one hierarchy. Split between different hierarchies Thus, the control logic described above, according to the present invention, And may run on a single processor or distributed processor. Previous The control logic may or may not be built in several layers and The executing processor is a single processor that forms and executes the telephone network control system. It may be a processor or a distributed processor.

────────────────────────────────────────────────── ─── Continuation of front page    (81) Designated countries EP (AT, BE, CH, DE, DK, ES, FI, FR, GB, GR, IE, IT, L U, MC, NL, PT, SE), OA (BF, BJ, CF) , CG, CI, CM, GA, GN, ML, MR, NE, SN, TD, TG), AP (KE, LS, MW, SD, S Z, UG), UA (AM, AZ, BY, KG, KZ, MD , RU, TJ, TM), AL, AM, AT, AU, AZ , BB, BG, BR, BY, CA, CH, CN, CZ, DE, DK, EE, ES, FI, GB, GE, HU, I S, JP, KE, KG, KP, KR, KZ, LK, LR , LS, LT, LU, LV, MD, MG, MK, MN, MW, MX, NO, NZ, PL, PT, RO, RU, S D, SE, SG, SI, SK, TJ, TM, TR, TT , UA, UG, US, UZ, VN (72) Inventor Borgen, Erik Rennar             Sweden S-125 54 Albu             Suyo, bite ship stigen 9 e (72) Inventor Novak, Lars             S-226 55 Lund, Sweden,             Rudebox Veggen 35

Claims (1)

[Claims]   1. A switch structure (10, 11, 12), a plurality of first routes (13, 14, 15) and a dynamically exchanged first having a plurality of user access devices Layered network (1), and nodes (20, 2 1, 22; 30, 31, 32, 33) and the second route (23, 24, 25; 3) 4, 35, 36) at least one second layered network (2, 3). ) In the hierarchical network structure (1), wherein the first and second hierarchical networks Work forms a traffic system, and the first hierarchical network The hierarchical network, wherein the root (13) comprises a first number of resources. A method of dynamic resource allocation in a structure, said method comprising: A layer indicating two access points (A1, A2; A5, A6) in the layer According to the relationship 1 (50, 51; 87, 88), at least one of the first routes Also provided a first one (13), and said access point in said second tier (2). Connection between points (A1-23-A2 or A1-25-24-A2 or A5-36 -35-34-A6), and said connection is established along said first route. A second number, commonly referred to as the substructure, in response to achieving the traffic detection conditions of Resources, and   Die for allocating said substructure to said first route (13) How to allocate resources dynamically.   2. (1) the first route of the first route (13) with a first end and a second end, respectively; The relations (50, 51) of 1 are linked,   (2) the first end of the first route is a first end of the first level (1); Connected to node (10),   (3) the second end of the first route (13) is a second end of the first route in the first hierarchy; Connected to the node (11) of   (4) the first node and the first node in the second hierarchical network By a first physical connection (4) extending to the access point (A1) Providing the first node (10);   (5) The second node and the second node in the second hierarchical network By a second physical connection (5) extending to the access point (A2) Providing the first node (11);   (6) The first and second access in the second hierarchical network Interconnect points (A1, A2) 2. The method for dynamic resource allocation according to claim 1, wherein:   3. Individual physical connections (444) to each of the first nodes (10) From a first group (93) of first access points having 1 access points (A1) and each of them selects the second node (A1). 11) the second of the access points with a separate physical connection (555) Selecting the access point (A2) from the group of 3. The method for dynamic resource allocation according to claim 2.   4. Traffic system for controlling the first and second hierarchical networks Start the connection (A1-23-A2) from the control logic (46) existing in 4. The method for dynamic resource allocation according to claim 3, wherein:   5. Signaling session between the first and second layers using an external protocol Activates the connection (A1-23-A2), and during the session, To establish a connection between the two allocation points (A1, A2) 4. The dynamic resource of claim 3, wherein the second hierarchy is commanded. Method of source allocation.   6. (A) The first and second routes (25) in the second hierarchy (2) And two second actions in a third level (3) below the second level (1, 2). The second relationship (89, 90) indicating the set point (A3, A4) Providing a second route (25) in the second hierarchy (2),   (B) achieving predetermined traffic detection conditions along the second route (25); Responsive to the third access point (A3, A4). The resources of the second connection (A3-36-A4) for setting the layer of 2. The dynamic resource according to claim 1, wherein the resource is allocated to the source. Method of source allocation.   7. Note that steps (a) and (b) are successively repeated for lower levels. The method of dynamic resource allocation according to claim 6, wherein:   8. The relationship (87, 88) exists in a third hierarchy (3) below the second hierarchy Two access points (A5, A6) 2. The method for dynamic resource allocation according to claim 1, wherein:   9. Achieving said traffic detection may comprise said first number of resources of said first route. Occurs when a certain number of resources are busy 3. The method for dynamic resource allocation according to claim 2, wherein:   Ten. When all of the second number of resources are released, the second network Back to the substructure above 9. Dynamic resource allocation according to claim 6, 7 or 8, the method of.   11． Switch structure (10, 11, 12), multiple trunk lines (13, 14, 15) And a first tier (1) comprising a plurality of user access devices and a node (20, 21 and 22) and a second level (2) with trunk lines (23, 24, 25). A stratified network structure, wherein a first route (13) in said first hierarchy is Dyna resources in a layered network having a first number of resources A system for dynamically assigning a first node to a first node ( 10) and the first access point (A1) in the second hierarchy (2). At least a first physical connection (4) extending therethrough, in the first hierarchy A first node (11) and a second access point (A) in the second hierarchy; 2) and at least a second physical connection (5) extending between said second layer (2) )) Between the first and second access points (A1, A2). 1-23-A2) traffic intensity detecting means (52, 49) for activating the setting; The system described above.   12． Both the first and second physical connections support connections of the same bandwidth The resource in the hierarchical network structure according to claim 11, wherein A dynamic allocation system.   13. The traffic intensity detecting means is a free resource associated with the first route; Comprising a list (52) of (a) each of the first pair of channels. List and the respective status of each channel pair (busy / not busy) , (B) a relationship (50, 51) with two references, each criterion being said second floor. One of said first and second access points (A1, A2) in a layer 11. The hierarchical network structure according to claim 10, wherein each one is designated. System that dynamically allocates resources in