1461048183-f6ae64a9-cf23-4341-9dc8-a3f3c5359dd9

1. A progressive-power lens comprising:
an object-side surface; and
an eyeball-side surface,
wherein one surface of the object-side surface and the eyeball-side surface includes
a distance portion having a distance reference point,
a near portion having a near reference point,
a progressive portion having a progressive start point provided at an end part of the distance portion side, the progressive portion being provided between the distance portion and the near portion, and
a principal meridian passing through the distance reference point, the near reference point, and the progressive start point, and

wherein the one surface satisfies the following expressions (1) to (3)
(n\u22121)\xd7(CT(NP)\u2212CT(DP))>Add\u2003\u2003(1)
CY(DP)=CT(DP)\u2003\u2003(2)
CY(P)>CT(P)\u2003\u2003(3)
where n denotes a refractive index of the progressive-power lens, Add denotes a prescription addition power of the progressive-power lens, CT(DP) denotes a vertical direction curvature at the distance reference point, CT(NP) denotes a vertical direction curvature at the near reference point, CY(DP) denotes a horizontal direction curvature at the distance reference point, CY(P) denotes a horizontal direction curvature at a point on the principal meridian which is located further towards the near portion than the progressive start point, and CT(P) denotes a vertical direction curvature at the point on the principal meridian which is located further towards the near portion than the progressive start point.
2. The progressive-power lens according to claim 1, wherein the one surface further satisfies the following expression (4)
CY(NP)>CT(NP)\u2003\u2003(4)

where CY(NP) denotes a horizontal direction curvature at the near reference point.
3. The progressive-power lens according to claim 1, wherein a dioptric power of the distance portion is a negative power.
4. The progressive-power lens according to claim 1, wherein the other surface of the object-side surface and the eyeball-side surface is a corrective surface where correction for a power set in the one surface is performed, and includes
a distance portion having a distance reference point;
a near portion having a near reference point;
a progressive portion having a progressive start point provided at an end part of the distance portion side, the progressive portion being provided between the distance portion and the near portion; and
a principal meridian passing through the distance reference point, the near reference point, and the progressive start point,
wherein the other surface satisfies the following expressions (2\u2032) and (3\u2032)
CY\u2032(DP)=CT\u2032(DP)\u2003\u2003(2\u2032)
CY\u2032(P)>CT\u2032(P)\u2003\u2003(3\u2032)
where, in the other surface, CT\u2032(DP) denotes a vertical direction curvature at the distance reference point, CY\u2032(DP) denotes a horizontal direction curvature at the distance reference point, CY\u2032(P) denotes a horizontal direction curvature at a point on the principal meridian which is located further on the near portion than the progressive start point, and CT\u2032(P) denotes a vertical direction curvature at the point on the principal meridian which is located further on the near portion than the progressive start point.

The claims below are in addition to those above.
All refrences to claim(s) which appear below refer to the numbering after this setence.

1. A method for path selection by a path selecting apparatus in a telecommunication network, the method comprising:
(a) defining a control strategy, and generating a control strategy parameter Util_weight based on the control strategy by control strategy parameter generating means;
(b) generating a network condition parameter based on the condition of the network by network condition parameter generation means, the network condition parameter being link utilization Ulink;
(c) calculating a path cost for each of a plurality of candidate paths based on said control strategy parameter, said network condition parameter, and network topology information by path cost calculating means; and
(d) selecting a path with the minimal path cost from the candidate paths by path determining means, wherein
said calculating operation (c) comprises:
calculating a link cost Clink for each of the links included in a path based on said control strategy parameter Util_weight and said link utilization Ulink; and
summating the link costs Clink of all the links included in the path as said path cost, wherein

in the case of QoS routing, said link cost Clink is calculated with the equation of:
C
link

=

1

1
–

Util_weight
\xd7

U
link
,
and wherein
the path selecting apparatus functions as the control strategy parameter generating means, the network condition parameter generation means, the path cost calculating means, and the path determining means.
2. The method of claim 1, further comprises:
setting the maximal link utilization in a path as the link utilization for each respective link in the path by the path cost calculating means.
3. A method for path selection by a path selecting apparatus in a telecommunication network, the method comprising:
(a) defining a control strategy, and generating a control strategy parameter Util_weight based on the control strategy by control strategy parameter generating means;
(b) generating a network condition parameter based on the condition of the network by network condition parameter generation means, the network condition parameter being link utilization Ulink;
(c) calculating a path cost for each of a plurality of candidate paths based on said control strategy parameter, said network condition parameter, and network topology information by path cost calculating means; and
(d) selecting a path with the minimal path cost from the candidate paths by path determining means, wherein
said calculating operation (c) comprises:
calculating a link cost Clink for each of the links included in a path based on said control strategy parameter Util_weight and said link utilization Ulink; and
summating the link costs Clink of all the links included in the path as said path cost, wherein

in the case of dynamic load balancing for best-effort traffic, said link cost Clink is calculated with the equation of:
C
link

=

{
1

1
–

Util_weight
\xd7

U
link
,
Util_weight
\xd7

U
link
<
1
Max_Cost
,
Util_wieght
\xd7

U
link
\u2265
1
where Max_cost is a predetermined constant, and wherein
the path selecting apparatus functions as the control strategy parameter generating means, the network condition parameter generation means, the path cost calculating means, and the path determining means.
4. The method of claim 1, wherein said control strategy parameter Util_weight is generated based on at least one of a threshold for hop number of the path and a threshold for link utilization.
5. The method of claim 4, wherein in the case of QoS routing, said control strategy parameter Util_weight is generated with the equation of:
Util_weight
=

m
(

m
+
n

)

–

n
\xb7

U
max
where n is the number of hops in the minimal-hop path among the candidate paths, m is the difference between said threshold for hop number of the path and n, and Umax is said threshold for link utilization.
6. The method of claim 4, wherein in the case of the dynamic load balancing for best-effort traffic, said control strategy parameter Util_weight is generated with the equation of:
Util_weight
=

1

U
max
where Umax is said threshold for link utilization.
7. The method of claim 1, wherein said control strategy is defined in any one of the schemes of:
the same strategy being applied to the whole network;
different strategies being applied to different ingress-egress pairs; and
different strategies being applied to traffics of different levels in a single ingress-egress pair.
8. An apparatus for path selection in a telecommunication network, comprising:
a control strategy parameter generating means for generating a control strategy parameter Util_weight based on a control strategy;
a network condition parameter generating means for generating a network condition parameter based on the condition of the network;
a path cost calculating means for calculating a path cost for each of a plurality of candidate paths based on said control strategy parameter, said network condition parameter and network topology information; and
a path determining means for selecting a path with the minimal path cost from the candidate paths, wherein
the network condition parameter generating means monitors and logs link utilization Ulink of each link in the network as said network condition parameter,
the path cost calculating means calculates a link cost Clink for all of the links included in the path based on said control strategy parameter Util_weight and said link utilization Ulink, and summates the link costs of all the links included in the path as said path cost, and
wherein in the case of QoS routing, the path cost calculating means calculates the link cost Clink with the equation of:
C
link

=
1

1
–

Util_weight
\xd7

U
link
.
9. The apparatus of claim 8, wherein the path cost calculating means sets the maximal link utilization in a path as the link utilization for each respective link in the path.
10. An apparatus for path selection in a telecommunication network, comprising:
a control strategy parameter generating means for generating a control strategy parameter Util_weight based on a control strategy;
a network condition parameter generating means for generating a network condition parameter based on the condition of the network;
a path cost calculating means for calculating a path cost for each of a plurality of candidate paths based on said control strategy parameter, said network condition parameter and network topology information; and
a path determining means for selecting a path with the minimal path cost from the candidate paths, wherein
the network condition parameter generating means monitors and logs link utilization Ulink of each link in the network as said network condition parameter,
the path cost calculating means calculates a link cost Clink for all of the links included in the path based on said control strategy parameter Util_weight and said link utilization Ulink, and summates the link costs of all the links included in the path as said path cost, and
wherein in the case of dynamic load balancing for best-effort traffic, the path cost calculating means calculates the link cost Clink with the equation of:
C
link

=

{
1
1
–

Util_weight
\xd7

U
link
Max_Cost
,
,
Util_weight
\u2062
\xd7

U
link
<
1
Util_weight
\u2062
\xd7

U
link
\u2265
1
where Max_cost is a predetermined constant.
11. The apparatus of claim 8, wherein the control strategy parameter generating means generates said control strategy parameter based on at least one of a threshold for hop number of the path and a threshold for link utilization.
12. The apparatus of claim 8, wherein in the case of QoS routing, the control strategy parameter generating means generates said control strategy parameter Util_weight with the equation of:
Util_weight
=

m
(

m
+
n

)

–

n
\xb7

U
max
where n is the number of hops of the minimal-hop path in the candidate paths, m is the difference between said threshold for hop number of the link and n, and Umax is said threshold for link utilization.
13. The apparatus of claim 8, wherein in the case of the dynamic load balancing for best-effort traffic, the control strategy parameter generating means generates said control strategy parameter Util_weight with the equation of:
Util_weight
=

1

U
max
where Umax is said threshold for link utilization.