Abstract:
A method may include receiving input information related to communication over a network; performing processing to include setting an objective function associated with a link load in the network, setting a first constraint expression for determining the link load, generating a second constraint expression for determining path candidates for data traffic received at the network, generating a third constraint expression for determining a link band for the links based on the received data traffic, and generating a fourth constraint expression to determine a link capacity limit associated with the links, where the generating the second constraint expression and generating at least one of the first, third, or fourth constraint expressions are performed in parallel; and determining, based on the objective function and the first, second, third, and fourth constraint expressions, a path within the network for multiple point communication service from the path candidates.

Description:
RELATED APPLICATIONS 
   This application is a continuation of U.S. patent application Ser. No. 09/924,054 filed Aug. 8, 2001, now U.S. Pat. No. 7,295,515, issued Nov. 13, 2007, which claims priority under 35 U.S.C. 119(b) based on Japanese Patent Application No. 2000-240546 filed Aug. 9, 2000, both of which are incorporated by reference herein. 

   BACKGROUND OF THE INVENTION 
   1. Field of the Invention 
   The present invention relates generally to a communication network designing circuit, a designing method thereof, a storage medium storing its control program and a transmission medium. More particularly, the present invention relates to a designing method of a communication service between multiple points for permitting arbitrary communication within a given range by providing a traffic amount of data in-flowing from an ingress node through which data enters from other network and a traffic amount of data flowing out from an egress node through which data is fed to other network, in an objective network consisted of a plurality of nodes and connected to other networks. 
   2. Description of the Related Art 
   Conventionally, in a communication network designing method, such as a method disclosed in “Restoration strategies and spare capacity requirements in self-healing ATM networks” (Yijun Xiong and Lorne Mason, INFOCOM&#39;97, April, 1997), a path for communication between single nodes has been designed. In the disclosed methods, a communication amount is determined for each node pair to communicate and a path of fixed band is set between each node pair. 
   One example of a result of design based on the conventional designing method is shown in  FIG. 4 . At first, the conventional designing method will be discussed with reference to  FIG. 4 . In  FIG. 4 , the references sign d 1  denotes a network range to be objective for the designing method, which will be referred to as objective network. The reference signs n 1  to n 6  identify nodes, and u 1  to u 4  identify networks other than design objective range. Communication traffic between these networks flows in and out the objective network. Hereinafter, the networks other than object will be referred to as user network. 
   For example, u 1  to u 4  denote different stations of the user network. Among nodes, a node located on a boundary between the objective network and the user network will be referred to as edge node. Nodes located in the objective network will be referred to as core nodes. 
   When data enters from the user network, the edge node is taken as an ingress node, and when data flow to the user network, the edge node is taken as an egress node. Normally, the edge node serves both for the ingress node and the egress node. It should be noted that the node generally referred to includes both of the edge node and the core node. On the other hand, lines between nodes and between the node and the network out of object represent links. These links are expressed, such as (n 1 , n 2 ), (u 1 , n 2 ) and so forth. 
   In  FIG. 4 , only one link is described, it represents presence of links in both directions. For example, a link (n 1 , n 2 ) includes both of a link from n 1  to n 2  and a link from n 2  to n 1 . It should be noted that, between one node pair, any number of links may be present. The link has a band in attribute. In  FIG. 4 , only bands of the portions necessary for discussion are described. 
   Now, in a certain communication service between multiple points, it is assumed that data flows in through an ingress node n 3  at a data rate of 2 Mb/s, data flows in through an ingress node n 1  at a data rate of 1 Mb/s, data flows out through an egress node n 6  at a data rate of 2 Mb/s, and data flows out through an egress node n 5  at a data rate of 1 Mb/s. 
   In the conventional designing method, fixed paths have to be set between respective ingress nodes and egress nodes. For example, paths are designed by determining each traffic amout that &lt;n 3 ,n 6 &gt; us 1 Mb/s, &lt;n 1 ,n 5 &gt; is 2 Mb/s, &lt;n 1 ,n 6 &gt; is 1 Mb/s, &lt;n 1 ,n 5 &gt; is 1 Mb/s. Here, paths are expressed by p 1  to p 4 . An example where paths as shown in  FIG. 4  are designed by the conventional design method, is shown. 
   However, in the conventional design method, since each path is designed by providing communication amount per ingress/egress pair, it become not possible to design a service in a mode permitting arbitrary communication within a given range of communication amount by providing the communication amount entering into each start node from the user network and the communication amount exiting from each end node to the user network. 
   SUMMARY OF THE INVENTION 
   The present invention has been worked out in view of the problem set forth above. It is therefore an object of the present invention to provide a communication network design circuit, a designing method thereof, a storage medium storing its control program and a transmission medium which can derive a path and a necessary link capacity for multiple point communication service permitting arbitrary communication within a predetermined range of communication amount by providing only traffic amount of data in-flowing through an ingress node and traffic amount of data flowing out through an egress node. 
   According to the first aspect of the invention, a communication network designing circuit for multiple point communication service for permitting arbitrary communication within a predetermined range by providing a traffic amount of data inflowing from an ingress node through which data flow in from other network and a traffic amount of data flowing out from an egress node through which data is fed to other network, in an object network consisted of a plurality of nodes and connected to other network, comprises: 
   setting means for setting a mathematical programming problem for deriving the multiple point communication service; and 
   optimizing means for solving the mathematical programming problem set by the setting means and obtaining a path for the multiple point communication service. 
   According to the second aspect of the present invention, a communication network designing method for multiple point communication service for permitting arbitrary communication within a predetermined range by providing a traffic amount of data inflowing from an ingress node through which data flow in from other network and a traffic amount of data flowing out from an egress node through which data is fed to other network, in an object network consisted of a plurality of nodes and connected to other network, comprises: 
   setting step of setting a mathematical programming problem for deriving the multiple point communication service; and 
   optimizing step of solving the mathematical programming problem set in the setting step and obtaining a path for the multiple point communication service. 
   According to the third aspect of the present invention, a storage medium storing a communication network design control program for designing a communication network for multiple point communication service for permitting arbitrary communication within a predetermined range by providing a traffic amount of data inflowing from an ingress node through which data flow in from other network and a traffic amount of data flowing out from an egress node through which data is fed to other network, in an object network consisted of a plurality of nodes and connected to other network, the communication network design control program comprising: 
   setting step of operating a computer for setting a mathematical programming problem for deriving the multiple point communication service; and 
   optimizing step of operating the computer for solving the mathematical programming problem set in the setting step and obtaining a path for the multiple point communication service. 
   According to the fourth aspect of the present invention, a transmission medium transmitting a communication network design control program for designing a communication network for multiple point communication service for permitting arbitrary communication within a predetermined range by providing a traffic amount of data inflowing from an ingress node through which data flow in from other network and a traffic amount of data flowing out from an egress node through which data is fed to other network, in an object network consisted of a plurality of nodes and connected to other network, the communication network design control program comprising: 
   setting step of operating a computer for setting a mathematical programming problem for deriving the multiple point communication service; and 
   optimizing step of operating the computer for solving the mathematical programming problem set in the setting step and obtaining a path for the multiple point communication service. 
   In the communication network designing circuit according to the present insention, the mathematical programming problem for deriving the multiple point communication service is generated by respective of optimization reference generating means, route selecting condition generating means, route selecting condition generating means, per-user necessary link capacity calculating condition generating means and link including condition generating means. 
   The optimization reference generating means sets an objective function for minimizing a link load in the object network and serving as an optimization reference and sets a constraint expression for deriving the link load. The route selecting condition generating means generates a constraint expression for selecting a route for including traffic of data inflowing from other network to the object network. 
   The per-user necessary link capacity calculating condition generating means generates a constraint expression for calculating a necessary link band of each link per traffic of data inflowing from each ingress node. The link including condition generating means generates a constraint expression so as not to exceed a link capacity limit in each link. The optimizing means solves the mathematical programming problem with the means set forth above. 
   Thus, it becomes possible to obtain the path for the multiple point communication service which permits arbitrary communication within a predetermined range by providing only traffic amount inflowing from the ingress node and traffic amount flowing out from the egress node. 

   
     BRIEF DESCRIPTION OF THE DRAWINGS 
     The present invention will be understood more fully from the detailed description given hereinafter and from the accompanying drawings of the preferred embodiment of the present invention, which, however, should not be taken to be limitative to the invention, but are for explanation and understanding only. 
     In the drawings: 
       FIG. 1  is a block diagram showing a construction of one embodiment of a design circuit for a multiple point communication service according to the present invention; 
       FIG. 2  is a flowchart showing process operation of one embodiment of the design circuit for the multiple point communication service according to the present invention; 
       FIG. 3  is an illustration showing one example of result of design of the multiple point communication service in one embodiment of the present invention; and 
       FIG. 4  is an illustration showing one example of result of design of a multiple point communication service in the prior art. 
   

   DESCRIPTION OF THE PREFERRED EMBODIMENT 
   The present invention will be discussed hereinafter in detail in terms of the preferred embodiment of the present invention with reference to the accompanying drawings. In the following description, numerous specific details are set forth in order to provide a thorough understanding of the present invention. It will be obvious, however, to those skilled in the art that the present invention may be practiced without these specific details. 
     FIG. 1  is a block diagram showing a construction of one embodiment of a design circuit for a multiple point communication service (hereinafter referred to as design circuit), according to the present invention. In  FIG. 1 , one embodiment of a design circuit according to the present invention is constructed with a computer  1 , an input portion  2 , such as a keyboard or the like, an output device  3 , such as a display device or the like, and a storage medium (or transmission medium)  4 . 
   The computer  1  includes an optimization reference generating means  11 , a route selecting condition generating means  12 , a per-user necessary link capacity calculating condition generating means  13 , a link including condition generating means  14  and an optimizing means  15 . 
   The storage medium  4  may be floppy disk, ROM (read-only-memory) and other storage medium or a medium to be transmitted through a network. In the storage medium, programs for making the computer  1  to function as the design circuit for the multiple point communication service is recorded. 
   The program is read out from the storage medium  4  by the computer  1  and controls operation of the computer  1  for realizing respective functions of the optimization reference generating means  11 , the route selecting condition generating means  12 , the per-user necessary link capacity calculating condition generating means  13 , the link including condition generating means  14  and the optimizing means  15 . 
   The optimization reference generating means  11  sets an objective function to minimize a link load in the objective network and be an optimization reference, and further sets a constraint expression for deriving the link load. The route selecting condition generating means  12  generates a constraint expression for selecting a route for receiving data traffic inflowing from other network. 
   The per-user necessary link capacity calculating condition generating means  13  generates a constraint expression for calculating a necessary link band for each link per data traffic inflowing from each ingress node. 
   The link including condition generating means  14  generates a constraint expression so as not to exceed a link capacity limitation in each link. The optimizing means  15  solves a mathematical programming problem respectively generated by the optimization reference generating means  11 , the route selecting condition generating means  12 , the per-user necessary link capacity calculating condition generating means  13  and the link including condition generating means  14  to obtain a path for the multiple point communication service. 
   Subsequently, operation of the shown embodiment will be discussed in detail. At first, signs to be used in the shown embodiment will be discussed. These signs are categorized as aggregates, parameters and constants. As aggregates, L represents link aggregate, D represents user aggregate, N d  represents input edge node aggregate of user d, P d  represents pair aggregate of ingress node and egress node of user d, I (a, z)  represents path candidate aggregate between ingress edge node a and egress edge node z. 
   In the link aggregate L, respective elements are expressed by (l, m, k). Here, l represents departing node, m represents arriving node, and k represents an identifier in case a plurality of links are present between the same nodes. The last identifier will be referred to as sub-link identifier. In the user aggregate D, one multiple point service is present per each user. In the path candidate aggregate I (a,z) , each element is expressed as i (a, z) . 
   As parameters, f i  represents 0-1 parameter, φ represents the link load in the objective network, w (l,m,k)ad  represents total of data flow flowing to the egress edge node. 
   The 0-1 parameter f i  takes 1 when the path candidate i (a, z)  between the ingress edge node a and the egress edge node z is introduced as a path, and 0 otherwise. The total w (l,m,k)ad  of data flow flowing to the egress edge node relates to a traffic of data in-flowing from the ingress edge node a of the user d to express a total of data flow flowing to the egress edge node located downstream side of the link (l, m, k). 
   As constants, v ad  represents traffic amount of data in-flowing from the ingress edge node a, v zd  represents traffic amount of data flowing out from the egress edge node z, g i  represents an indicator constant, c (l,m,k)  represents capacity limitation in the link (l, m, k). 
   The traffic amount v ad  represents a traffic amount of data in-flowing from the ingress edge node a with relation to the user d, the traffic amount v zd  represents a traffic amount of data flowing out from the egress edge node z with relation to the user d. The indicator constant g i  takes 1 when the path candidate i (a,z)  goes through the link (l, m, k), and 0 otherwise. 
   Discussion will be given for one embodiment of the designing circuit according to the present invention using the foregoing signs. At first, the optimization reference generating means  11  sets the objective function
 
Minφ  (1)
 
to minimize the link load in the objective network and be the optimization reference, and further sets the constraint expression
 
                 ϕ   ≥       (       ∑     d   ∈   D       ⁢       ∑     a   ∈     N   d         ⁢     w       (     l   ,   m   ,   l     )     ⁢   ad           )     /       c   given     ⁡     (     ∀       (     l   ,   m   ,   k     )     ∈   L       )                 (   2   )               
for deriving the link load φ.
 
   Subsequently, the route selecting condition generating means  12  generates the constraint expression for selecting the route including the traffic of data inflowing from other network: 
                     ∑       i     (     a   ,   z     )       ∈     I     (     a   ,   z     )           ⁢     f     i     (     a   ,   z     )       d       =     1   ⁢     (       ∀       (     a   ,   z     )     ∈     P   d         ,     ∀     d   ∈   D         )               (   3   )               
wherein ƒ i(a,z)   d  is taken as f i .
 ƒ i     (a,z)     d =0/1  (4) 
   The per-user necessary link capacity calculating condition generating means  13  generates the constraint expression for calculating a link band necessary in each link per traffic of data inflowing from the ingress node of each user. 
                   w       (     l   ,   m   ,   k     )     ⁢   ad       =     min   ⁢     {       v   ad     i   ⁢           ⁢   n       ,       ∑     {     z   ;       (     a   ,   z     )     ∈     P   d         }       ⁢       ∑     (       i     a   ,   z       ∈     I     (     a   ,   z     )         )       ⁢       v   zd   out     ⁢     g     i     (     a   ,   z     )         (     l   ,   m   ,   k     )       ⁢     f     i     (     a   ,   z     )       d             }               (   5   )               
wherein ν ad   in  is v ad , ν zd   out  is v zd  and g i     (a,z)     (l,m,k)  is g i .
 
   The link including condition generating means  14  generates the constraint expression so as not to exceed the link capacity limit in respective link. 
   
     
       
         
           
             
               
                 
                   
                     ∑ 
                     
                       d 
                       ∈ 
                       D 
                     
                   
                   ⁢ 
                   
                     
                       ∑ 
                       
                         a 
                         ∈ 
                         
                           N 
                           d 
                         
                       
                     
                     ⁢ 
                     
                       w 
                       
                         
                           ( 
                           
                             l 
                             , 
                             m 
                             , 
                             k 
                           
                           ) 
                         
                         ⁢ 
                         ad 
                       
                     
                   
                 
                 ≤ 
                 
                   
                     c 
                     given 
                   
                   ⁡ 
                   
                     ( 
                     
                       ∀ 
                       
                         
                           ( 
                           
                             l 
                             , 
                             m 
                             , 
                             k 
                           
                           ) 
                         
                         ∈ 
                         L 
                       
                     
                     ) 
                   
                 
               
             
             
               
                 ( 
                 6 
                 ) 
               
             
           
         
       
     
   
   Finally, the optimizing means  15  solves the mathematical programming problem generated by respective of the optimization reference generating means  11 , route selecting condition generating means  12 , the per-user necessary link capacity calculating condition generating means  13  and the link including condition generating means  14 , namely the foregoing expressions (1) to (6) for obtaining path for the multiple point communication service. 
     FIG. 2  is a flowchart showing a processing operation of one embodiment of the design circuit according to the present invention. The processing operation of one embodiment of the design circuit according to the present invention will be discussed with reference to  FIGS. 1 and 2 . It should be noted that the processing operation shown in  FIG. 2  is realized by the computer  1  executing the program stored in the storage medium  4 . 
   When the foregoing aggregates, parameters and constants are input from the input portion  2  (step S 1  of  FIG. 2 ), the optimization reference generating means  11  sets the objective function [expression (1)] to minimize the link load φ in the objective network and be the optimization reference (step S 2  of  FIG. 2 ), and sets the constraint expression [expression (2)] for deriving the link load φ (step S 3  of  FIG. 2 ). 
   Similarly, when the foregoing aggregates, parameters and constants are input (steps S 1  of  FIG. 2 ), the route selecting condition generating means  12  generates the constraint expression [expression (3)] for selecting the route including the traffic of data inflowing from the user network (step S 4  of  FIG. 2 ) and the per-user necessary link capacity calculating condition generating means  13  generates the constraint expression [expression (5)] for calculating the necessary link band in respective links per traffic of data inflowing from respective ingress nodes (step S 5  of  FIG. 2 ). 
   On the other hand, when the foregoing aggregates, parameters and constants are input (steps S 1  of  FIG. 2 ), the link including condition generating means  14  generates the constraint expression [expression (6)] so as not to exceed the link capacity limit in respective links (step S 6  of  FIG. 2 ). 
   As set forth above, by the optimization reference generating means  11 , the route selecting condition generating means  12 , the per-user necessary link capacity calculating condition generating means  13  and link including condition generating means  14 , mathematical programming problem for deriving the multiple point service is set in parallel. Therefore, the optimizing means  15  solves the mathematical programming problem for obtaining path for the multiple point communication service (step S 7  of  FIG. 2 ). 
     FIG. 3  is an illustration showing one example of a result of designing of the multiple point service in one embodiment of the present invention. One example of the result of designing of the multiple point communication service in one embodiment of the present invention will be discussed with reference to  FIG. 3 . 
   In  FIG. 3 , the reference sign d 1  represents a network range to be object in the designing method. This will be referred to as objective network. The reference signs n 1  to n 6  represent nodes. The reference signs u 1  to u 4  represent network other than design object. Communication traffic between these networks flows in and out the object network. The network other than the object network will be referred to as user network. For example, the reference signs u 1  to u 4  represent different station of the user network. 
   Among nodes, nodes located on the boundary between the objective network and the user network will be referred to as edge nodes, and the nodes in the object network will be referred to as core nodes. When traffic enters from the user network, the edge node is referred to as ingress node. On the other hand, when the traffic exits to the user network, the edge node is referred to as egress node. 
   Normally, the edge node serves as both of ingress node/egress node. It should be noted that both of the core node and the edge node are generally referred to as “node”. On the other hand, lines between the nodes and between the node and the network other than object network represent links. These links are expressed as (n 1 , n 2 ), (u 2 , n 1 ) and so forth. 
   In  FIG. 3 , only one link is described, it represents presence of links in both directions. For example, a link (n 1 , n 2 ) includes both of a link from n 1  to n 2  and a link from n 2  to n 1 . It should be noted that, between one node pair, any number of links may be present. The link has a band in attribute. In  FIG. 3 , only bands of the portions necessary for discussion are described. 
   Now, in a certain communication service between multiple points, it is assumed that data flows in through an ingress node n 3  at a data rate of 2 Mb/s, data flows in through an ingress node n 1  at a data rate of 1 Mb/s, data flows out through an egress node n 6  at a data rate of 2 Mb/s, and data flows out through an egress node n 5  at a data rate of 1 Mb/s. 
   Then, in order to permit communication freely within a range of the above inflow amount and the above flowing out amount between the arbitrary ingress/egress node pairs &lt;n 3 , n 6 &gt;, &lt;n 3 , n 5 &gt;, &lt;n 1 , n 6 &gt;, &lt;n 1 , n 5 &gt;, paths p 1  to p 4  are derived. 
   On the other hand, necessary band, namely necessary transmission speed (bit rate) for the multiple point communication service is 2 Mb/s in the link (n 3 , n 4 ), 2 Mb/s in the link (n 4 , n 6 ), 1 Mb/s in the link (n 1 , n 4 ) and 1 Mb/s in the link (n 4 , n 5 ). 
   Here, for example, in the link (n 4 , n 5 ), data inflows at data rate of 2 Mb/s from the node n 3  and data inflows at data of rate 1 Mb/s from the node n 1 . Therefore, in the link (n 4 , n 5 ), it is possible that data may flow at a data rate of 3 Mb/s at the maximum. However, since the traffic amount of data flowing out from the node  5  is 1 Mb/s, the necessary link capacity, namely necessary the data rate of the link (n 4 , n 5 ) becomes 1 Mb/s. 
   Thus, as mathematical programming problem of the designing method for the multiple point communication service, the problem is set by the optimization reference generating means  11 , the route selecting condition generating means  12 , the per-user necessary link capacity calculating condition generating means  13  and the link including condition generating means  14  respectively, and solved by the optimizing means  15 , path and necessary link capacity for the multiple point communication service permitting arbitrary communication within the predetermined range by providing only traffic amount of data inflowing from the ingress node and traffic amount of data flowing out from the egress node, can be derived. 
   In the foregoing constants, when η is added as minimum link vacant capacity, the optimization reference generating means  11  sets an object function
 
Maximize η  (7)
 
for maximizing the vacant capacity of the link in the object network, and a constraint expression for deriving the vacant capacity is set as following expression (8):
 
                     c   given     -       ∑     d   ∈   D       ⁢       ∑     a   ∈     N   d         ⁢     w       (     l   ,   m   ,   k     )     ⁢   ad             ≥     η   ⁡     (     ∀       (     l   ,   m   ,   k     )     ∈   L       )               (   8   )               
By performing setting of this, the optimization reference generating means  11  may generate the mathematical programming problem for optimization.
 
   On the other hand, in the foregoing parameters, when ω (l,m,k)  is added as a link cost per unit capacity of the link (l, m, k), the optimization reference generating means  11  sets an object function 
                 Maximize   ⁢           ⁢       ∑       (     l   ,   m   ,   k     )     ∈   L       ⁢     w   1               (   9   )               
for including the traffic of data inflowing to the objective network at the minimum link cost.
 
   By performing setting, the maximizing reference generating means  11  may generate the mathematical programming problem for optimization. 
   Subsequently, discussion will be given for the case where the per-user necessary link capacity calculating condition generating means  13  sets the constraint expression for calculating the necessary link band in each link per traffic of data inflowing from the ingress node of each user, as constraint expression for an integer programming problem. The integer programming problem is one kind of the mathematical programming problem, and in the optimizing means  15 , various solutions for the integer programming problem, which have been well known may be used. 
   Now, x (l,m,k)ad  is set as 0-1 parameter which takes 1 when a total of the flow to the egress edge node located downstream of the link (l, m, k) is greater than the traffic amount v ad  inflowing to the ingress edge node a concerning the inflowing traffic from the ingress edge node a of the user d, and takes 0 otherwise. Also, M is assumed as arbitrary large number. Here, M is expressed as:
 
M=Σ {z:(a,z)∈P     d     } ν ad   out   (10)
 
   The per-user necessary link capacity calculating condition generating means  13  sets the following three constraint expressions using those set forth above. 
   
     
       
         
           
             
               
                 
                   x 
                   
                     
                       ( 
                       
                         l 
                         , 
                         m 
                         , 
                         k 
                       
                       ) 
                     
                     ⁢ 
                     ad 
                   
                 
                 ≤ 
                 
                   
                     { 
                     
                       
                         ∑ 
                         
                           { 
                           
                             z 
                             ; 
                             
                               
                                 ( 
                                 
                                   a 
                                   , 
                                   z 
                                 
                                 ) 
                               
                               ∈ 
                               Pd 
                             
                           
                           } 
                         
                       
                       ⁢ 
                       
                         
                           ∑ 
                           
                             ( 
                             
                               
                                 i 
                                 
                                   a 
                                   , 
                                   z 
                                 
                               
                               ∈ 
                               
                                 I 
                                 
                                   ( 
                                   
                                     a 
                                     , 
                                     z 
                                   
                                   ) 
                                 
                               
                             
                             ) 
                           
                         
                         ⁢ 
                         
                           
                             v 
                             zad 
                             out 
                           
                           ⁢ 
                           
                             g 
                             
                               i 
                               
                                 ( 
                                 
                                   a 
                                   , 
                                   z 
                                 
                                 ) 
                               
                             
                             
                               ( 
                               
                                 l 
                                 , 
                                 m 
                                 , 
                                 k 
                               
                               ) 
                             
                           
                           ⁢ 
                           
                             f 
                             
                               i 
                               
                                 ( 
                                 
                                   a 
                                   , 
                                   z 
                                 
                                 ) 
                               
                             
                             d 
                           
                         
                       
                     
                     } 
                   
                   / 
                   
                     
                       v 
                       ad 
                       
                         i 
                         ⁢ 
                         
                             
                         
                         ⁢ 
                         n 
                       
                     
                     ⁢ 
                     
                       
 
                     
                     ( 
                     
                       
                         ∀ 
                         
                           a 
                           ∈ 
                           
                             N 
                             d 
                           
                         
                       
                       , 
                       
                         ∀ 
                         
                           d 
                           ∈ 
                           D 
                         
                       
                       , 
                       
                         ∀ 
                         
                           
                             ( 
                             
                               l 
                               , 
                               m 
                               , 
                               k 
                             
                             ) 
                           
                           ∈ 
                           L 
                         
                       
                     
                     ) 
                   
                 
               
             
             
               
                 ( 
                 11 
                 ) 
               
             
           
           
             
               
                 
                   
                     { 
                     
                       
                         ∑ 
                         
                           { 
                           
                             z 
                             ; 
                             
                               
                                 ( 
                                 
                                   a 
                                   , 
                                   z 
                                 
                                 ) 
                               
                               ∈ 
                               
                                 P 
                                 d 
                               
                             
                           
                           } 
                         
                       
                       ⁢ 
                       
                         
                           ∑ 
                           
                             ( 
                             
                               
                                 i 
                                 
                                   a 
                                   , 
                                   z 
                                 
                               
                               ∈ 
                               
                                 I 
                                 
                                   ( 
                                   
                                     a 
                                     , 
                                     z 
                                   
                                   ) 
                                 
                               
                             
                           
                         
                         ⁢ 
                         
                           
                             v 
                             ad 
                             out 
                           
                           ⁢ 
                           
                             g 
                             
                               i 
                               
                                 ( 
                                 
                                   a 
                                   , 
                                   z 
                                 
                                 ) 
                               
                             
                             
                               ( 
                               
                                 l 
                                 , 
                                 m 
                                 , 
                                 k 
                               
                               ) 
                             
                           
                           ⁢ 
                           
                             f 
                             
                               i 
                               
                                 ( 
                                 
                                   a 
                                   , 
                                   z 
                                 
                                 ) 
                               
                             
                             d 
                           
                         
                       
                     
                     } 
                   
                   / 
                   
                     v 
                     ad 
                     
                       i 
                       ⁢ 
                       
                           
                       
                       ⁢ 
                       n 
                     
                   
                 
                 ≤ 
                 
                   
                     w 
                     
                       
                         ( 
                         
                           l 
                           , 
                           m 
                           , 
                           k 
                         
                         ) 
                       
                       ⁢ 
                       ad 
                     
                   
                   + 
                   
                     M 
                     ⁢ 
                     
                         
                     
                     ⁢ 
                     
                       
                         x 
                         
                           
                             ( 
                             
                               l 
                               , 
                               m 
                               , 
                               k 
                             
                             ) 
                           
                           ⁢ 
                           ad 
                         
                       
                       ⁢ 
                       
                         
 
                       
                       ( 
                       
                         
                           ∀ 
                           
                             a 
                             ∈ 
                             
                               N 
                               d 
                             
                           
                         
                         , 
                         
                           ∀ 
                           
                             d 
                             ∈ 
                             D 
                           
                         
                         , 
                         
                           ∀ 
                           
                             
                               ( 
                               
                                 l 
                                 , 
                                 m 
                                 , 
                                 k 
                               
                               ) 
                             
                             ∈ 
                             L 
                           
                         
                       
                       ) 
                     
                   
                 
               
             
             
               
                 ( 
                 12 
                 ) 
               
             
           
           
             
               
                 
                   
                     v 
                     ad 
                     
                       i 
                       ⁢ 
                       
                           
                       
                       ⁢ 
                       n 
                     
                   
                   ⁢ 
                   
                     x 
                     
                       
                         ( 
                         
                           l 
                           , 
                           m 
                           , 
                           k 
                         
                         ) 
                       
                       ⁢ 
                       ad 
                     
                   
                 
                 ≤ 
                 
                   
                     w 
                     
                       
                         ( 
                         
                           l 
                           , 
                           m 
                           , 
                           k 
                         
                         ) 
                       
                       ⁢ 
                       ad 
                     
                   
                   ⁢ 
                   
                     
 
                   
                   ( 
                   
                     
                       ∀ 
                       
                         a 
                         ∈ 
                         
                           N 
                           d 
                         
                       
                     
                     , 
                     
                       ∀ 
                       
                         d 
                         ∈ 
                         D 
                       
                     
                     , 
                     
                       ∀ 
                       
                         
                           ( 
                           
                             l 
                             , 
                             m 
                             , 
                             k 
                           
                           ) 
                         
                         ∈ 
                         L 
                       
                     
                   
                   ) 
                 
               
             
             
               
                 ( 
                 13 
                 ) 
               
             
           
         
       
     
   
   By this, the per-user necessary link capacity calculating condition generating means  13  sets the constraint expression for calculating the necessary link band in each link-per traffic inflowing from the ingress edge node a of each user, as the constraint expression for the integer programming problem. 
   As set forth above, with the present invention, in the communication network designing circuit for multiple point communication service permitting arbitrary communication within the predetermined range by providing traffic amount of data inflowing from the ingress node, through which data inflows from other network, and traffic amount of data flowing out through the egress node, through which data is fed to other network, in the object network consisted of a plurality of nodes and connected to other network, the mathematical programming problem is set for deriving multiple point communication service, a path for multiple point communication service is obtained by solving the mathematical programming problem for deriving the path and necessary link capacity for multiple point communication service permitting arbitrary communication within the predetermined range by providing only traffic amount of data inflowing from the ingress node and traffic amount of data flowing out through the egress node. 
   Although the present invention has been illustrated and described with respect to exemplary embodiment thereof, it should be understood by those skilled in the art that the foregoing and various other changes, omission and additions may be made therein and thereto, without departing from the spirit and scope of the present invention. Therefore, the present invention should not be understood as limited to the specific embodiment set out above but to include all possible embodiments which can be embodied within a scope encompassed and equivalent thereof with respect to the feature set out in the appended claims.