| 摘要 |
<p><P>PROBLEM TO BE SOLVED: To enable a network wide model to optimize a service list and optimize the assignment state of each logical path. <P>SOLUTION: The service list selecting apparatus acquires a call generating rateλ<SP>s(i, e)</SP>, a call end rateμ<SP>s(i, e)</SP>, and a selection probability formula P<SP>s(i, e)</SP>with respect to a network end node pair (i, e), acquires a network topology, band information of each link, constraint conditions with respect to a bandwidth object and a path object of each logic path, a reference of a unit service network resource amount function r<SB>j</SB>(SL) and a set of service list objects, calculates the selection probability formula P<SP>s(i, e)</SP>and calculates the unit service network resource amount function r<SB>j</SB>(SL). The apparatus uses calculation results of theλ<SP>s(i, e)</SP>, theμ<SP>s(i, e)</SP>, the P<SP>s(i, e)</SP>, r<SB>j</SB>(SL) to decide a logic path object path<SP>(i, e)</SP>in matching with the constraint conditions, calculates an expected income obtained when each of the path<SP>(i, e)</SP>is selected as a target value, and calculates an optimum target function value and optimum logical path assignment. <P>COPYRIGHT: (C)2005,JPO&NCIPI</p> |
