公开(公告)号：EP1014627A1

公开(公告)日：2000-06-28

申请号：EP99309837.5

申请日：1999-12-07

Applicant: LUCENT TECHNOLOGIES INC.

Inventor： Kodaliam, Muralidharan Sampath ,  Lau, Wing Cheong ,  Yan, Anlu

IPC: H04L12/56

CPC classification number: H04Q11/0478 ,  H04L2012/562 ,  H04L2012/5623

Abstract: A real-time method for routing subject to an acceptable delay constraint between nodes in high-speed data networks, such as PNNI protocol networks, uses an illustrative two-phase algorithm employing Dijkstra's algorithm at each phase. In an illustrative first phase, the Dijkstra SPF algorithm is used in seeking the shortest cumulative delay from the destination to the source, thereby generating cumulative delay labels from a node j to the destination node k. The delay results are then employed in the second phase, where the Dijkstra SPF algorithm is illustratively employed for determining administrative weight (AW) as the link metric subject to modification in accordance with results obtained in the first phase.

Abstract translation: 用于路由到受在高速数据网络，：如PNNI协议的网络节点之间的可接受的延迟约束实时方法，使用说明性两相算法在每个阶段用人Dijkstra算法的。 在一个说明性的第一阶段中，使用Dijkstra SPF算法寻求来自目的地的最短累积延迟到源使用，由此产生从节点j到目的地节点k累积延迟标签。 延迟结果然后在第二阶段中，其中所述的Dijkstra SPF算法说明性地用于采矿确定性行政重量（AW）为链路度量受到修改在雅舞蹈与在第一阶段中获得的结果使用。

公开(公告)号：EP1473870A2

公开(公告)日：2004-11-03

申请号：EP04252278.9

申请日：2004-04-19

Applicant: LUCENT TECHNOLOGIES INC.

Inventor： Balachandran, Krishna ,  Kang, Joseph H. ,  Lau, Wing Cheong

IPC: H04L12/12 ,  H04L12/28

CPC classification number: H04L12/12 ,  H04W52/0245 ,  H04W52/0277 ,  H04W84/18 ,  Y02D70/164 ,  Y02D70/22

Abstract: In a multiple node network, the method includes waking up at least one node from a sleep mode during at least one associated slot of a time-slotted frame, the sleep mode being a low power consumption mode. Also, in at least one node of a multiple node network, the period of time a node sleeps is based on the residual energy of the node, the residual energy of the nodes in the neighborhood, neighborhood node density, and combinations thereof.

Abstract translation: 在多节点网络中，该方法包括在时隙帧的至少一个关联时隙期间从休眠模式唤醒至少一个节点，该休眠模式是低功耗模式。 而且，在多节点网络的至少一个节点中，节点休眠的时间段基于节点的剩余能量，邻居节点的剩余能量，邻居节点密度及其组合。

公开(公告)号：EP1005194A2

公开(公告)日：2000-05-31

申请号：EP99309124.8

申请日：1999-11-16

Applicant: LUCENT TECHNOLOGIES INC.

Inventor： Benmohamed, Lotfi ,  Dravida, Subrahmanyam ,  Harshavardhana, Paramasiviah ,  Lau, Wing Cheong ,  Mittal, Ajay Kumar

IPC: H04L12/24 ,  H04L12/56

CPC classification number: H04L41/5025 ,  H04L41/0823 ,  H04L41/145 ,  H04L41/5003 ,  H04L45/00

Abstract: Methods and apparatus are provided for designing IP networks with substantially improved performance as compared to existing IP networks such as, for example, those networks designed under best-effort criteria. Particularly, the invention includes methods and apparatus for: computing worst-case and optimistic link capacity requirements; optimizing network topology; and determining router placement within a network.

Abstract translation: 提供了用于具有基本上改进的性能设计的IP网络相比于现有的IP网络的方法和装置：如，例如，那些网络下设计尽力而为标准。 具体地说，本发明包括的方法和设备：计算最坏情况和乐观的链路容量的要求; 优化网络拓扑; 以及网络中的确定性采矿路由器放置。

公开(公告)号：EP1014627B1

公开(公告)日：2007-04-04

申请号：EP99309837.5

申请日：1999-12-07

Applicant: LUCENT TECHNOLOGIES INC.

Inventor： Kodaliam, Muralidharan Sampath ,  Lau, Wing Cheong ,  Yan, Anlu

IPC: H04L12/56

CPC classification number: H04Q11/0478 ,  H04L2012/562 ,  H04L2012/5623

公开(公告)号：EP1473870A3

公开(公告)日：2004-12-22

申请号：EP04252278.9

申请日：2004-04-19

Applicant: LUCENT TECHNOLOGIES INC.

Inventor： Balachandran, Krishna ,  Kang, Joseph H. ,  Lau, Wing Cheong

IPC: H04L12/12 ,  H04L12/28

CPC classification number: H04L12/12 ,  H04W52/0245 ,  H04W52/0277 ,  H04W84/18 ,  Y02D70/164 ,  Y02D70/22

Abstract: In a multiple node network, the method includes waking up at least one node from a sleep mode during at least one associated slot of a time-slotted frame, the sleep mode being a low power consumption mode. Also, in at least one node of a multiple node network, the period of time a node sleeps is based on the residual energy of the node, the residual energy of the nodes in the neighborhood, neighborhood node density, and combinations thereof.