公开(公告)号：US20080240139A1

公开(公告)日：2008-10-02

申请号：US11693825

申请日：2007-03-30

申请人： Muralidharan Sampath Kodialam ,  Tirunell V. Lakshman

发明人： Muralidharan Sampath Kodialam ,  Tirunell V. Lakshman

IPC分类号： H04L12/56

CPC分类号： H04L49/254 ,  H04L47/50 ,  H04L47/564 ,  H04L49/3045

摘要： The invention includes an apparatus and method for switching packets through a switching fabric. The apparatus includes a plurality of input ports and output ports for receiving arriving packets and transmitting departing packets, a switching fabric for switching packets from the input ports to the output ports, and a plurality of schedulers controlling switching of packets through the switching fabric. The switching fabric includes a plurality of virtual output queues associated with a respective plurality of input-output port pairs. One of the schedulers is active during each of a plurality of timeslots. The one of the schedulers active during a current timeslot provides a packet schedule to the switching fabric for switching packets through the switching fabric during the current timeslot. The packet schedule is computed by the one of the schedulers active during the current timeslot using packet departure information for packets departing during previous timeslots during which the one of the schedulers was active and packet arrival information for packets arriving during previous timeslots during which the one of the schedulers was active.

摘要翻译： 本发明包括一种用于通过交换结构交换分组的装置和方法。 该装置包括多个输入端口和输出端口，用于接收到达的分组并发送离开的分组，用于将分组从输入端口切换到输出端口的交换结构，以及多个调度器，用于控制通过交换结构的分组交换。 交换结构包括与相应的多个输入 - 输出端口对相关联的多个虚拟输出队列。 其中一个调度器在多个时隙的每一个期间是活动的。 在当前时隙中活动的调度器之一为交换结构提供了一个分组调度，用于在当前时隙内通过交换结构交换数据包。 分组调度由当前时隙中活动的调度器之一使用分组离开信息来计算，所述分组离开信息用于在之前的时隙期间离开的分组离开信息，在该时隙期间，一个调度器处于活动状态，并且分组到达信息用于在之前的时隙期间到达的分组 调度器是活跃的。

公开(公告)号：US07397761B2

公开(公告)日：2008-07-08

申请号：US10357558

申请日：2003-02-04

申请人： Koushik Kar ,  Muralidharan S. Kodialam ,  Tirunell V. Lakshman

发明人： Koushik Kar ,  Muralidharan S. Kodialam ,  Tirunell V. Lakshman

IPC分类号： G01R31/08 ,  H04J1/16 ,  H04L1/00

CPC分类号： H04L45/08

摘要： A packet network employs restorable routing with service level guarantees. Restorable routing generates two disjoint paths through a network of nodes interconnected by links for a connection request demand between and ingress-egress node pair. Restorable routing employs minimum interference criteria to generate the two disjoint paths such that two disjoint paths cause little or no interference with demands of future connection requests between different ingress-egress pairs. Restorable routing generates maximum 2-route flows for the network ingress-egress node pairs to determine corresponding sets of 2-critical links. A reduced network is formed, its links are weighted based on criticality indices generated from the sets of 2-critical links, and the relatively optimal two disjoint paths are computed for the connection request. One of the two disjoint paths is selected as an active path for routing data of the connection request, and the other disjoint path is selected as the backup path.

摘要翻译： 分组网络采用具有服务级别保证的可恢复路由。 可恢复的路由通过通过链路互连的节点网络生成两条不相交的路径，用于连接请求和出入口节点对之间的连接请求。 可恢复路由采用最小干扰标准来生成两个不相交路径，使得两个不相交路径对不同入口到出口之间的未来连接请求的需求几乎没有干扰或没有干扰。 可恢复的路由为网络入口 - 出口节点对生成最大的2路由流，以确定相应的2关键链路集。 形成减少的网络，其链路基于从两个关键链路的集合产生的关键性指数进行加权，并且针对连接请求计算相对最佳的两个不相交路径。 选择两个不相交路径中的一个作为用于路由连接请求的数据的活动路径，并且选择另一个不相交路径作为备份路径。

公开(公告)号：US07298704B2

公开(公告)日：2007-11-20

申请号：US09899509

申请日：2001-07-05

申请人： Muralidharan S. Kodialam ,  Tirunell V. Lakshman

发明人： Muralidharan S. Kodialam ,  Tirunell V. Lakshman

IPC分类号： G01R31/08

CPC分类号： H04L45/62 ,  H04J14/0227 ,  H04J14/0241 ,  H04J14/0284 ,  H04Q11/0062 ,  H04Q11/0066 ,  H04Q2011/0073 ,  H04Q2011/0086

摘要： A scheme for guaranteeing network tunnel path (NTP). e.g., Internet Protocol (IP), service levels in optical (e.g., wavelength-division multiplex (WDM)) networks. The invention, in one embodiment, accounts for both network topology (e.g. switches, cross-connects, and links between nodes) and resource usage (e.g., available/provisioned link bandwidth and available/used wavelength paths), which information may be available from the IP and optical WDM protocol layers, in particular (i) router capacities and (ii) presence or absence of wavelength conversion capability of optical cross-connect at each node. A determination is made whether to route an arriving request for an NTP over existing topology by computing “good” routes in accordance with a defined metric, or to open a new, available optical wavelength path by provisioning nodes of the topology for, and computing “good” routes for new wavelength paths. As many requests as possible are identified without a priori information of future requests.

摘要翻译： 一种保证网络隧道路径（NTP）的方案。 例如因特网协议（IP），光学（例如，波分多路复用（WDM））网络中的服务级别。 在一个实施例中，本发明涉及网络拓扑（例如，交换机，交叉连接和节点之间的链路）和资源使用（例如，可用/提供的链路带宽和可用/使用的波长路径），哪些​​信息可以从 IP和光WDM协议层，特别是（i）路由器容量和（ii）在每个节点处存在或不存在光交叉连接的波长转换能力。 通过根据定义的度量计算“良好”路由来确定是否将对NTP的到达请求路由到现有拓扑，或者通过为拓扑的节点提供并打开新的可用光波长路径，并且计算“ 好的“路线。 尽可能多的请求被识别，没有未来请求的先验信息。

公开(公告)号：US07124187B1

公开(公告)日：2006-10-17

申请号：US09535206

申请日：2000-03-27

申请人： Muralidharan S. Kodialam ,  Tirunell V. Lakshman

发明人： Muralidharan S. Kodialam ,  Tirunell V. Lakshman

IPC分类号： G06F15/173 ,  G01R31/08

CPC分类号： H04L47/724 ,  H04L45/02 ,  H04L45/22 ,  H04L45/28 ,  H04L45/30 ,  H04L45/302 ,  H04L45/50 ,  H04L47/10 ,  H04L47/15 ,  H04L47/70 ,  H04L47/728 ,  H04L47/746

摘要： Restorable paths in an information network are established in response to arriving traffic requests. Requests are received at a first node of the network for transmission of traffic to a second node of the network, and each request specifies a desired transmission bandwidth for an active and a backup path to be established between the nodes. Potential active links for an active path are identified in response to a given request, and potential backup links to form a backup path for restoring the active path, are also identified in response to the given request. An active and a backup path are then formulated for each given request from among the potential active links and the potential backup links that were identified in response to the given request.

摘要翻译： 响应于到达的流量请求，建立信息网络中的可恢复路径。 在网络的第一节点处接收请求以将流量传输到网络的第二节点，并且每个请求指定要在节点之间建立的活动和备用路径的期望的传输带宽。 响应于给定的请求，识别出活动路径的潜在活动链路，并且响应于给定的请求也识别出潜在备份链路以形成用于恢复活动路径的备份路径。 然后，根据给定的请求，为潜在的活动链接和潜在的备份链接为每个给定的请求制定活动和备份路径。

公开(公告)号：US06992979B2

公开(公告)日：2006-01-31

申请号：US09894946

申请日：2001-06-28

申请人： Oded Hauser ,  Muralidharan Sampath Kodialam ,  Tirunell V. Lakshman ,  Wing Cheong Lau

发明人： Oded Hauser ,  Muralidharan Sampath Kodialam ,  Tirunell V. Lakshman ,  Wing Cheong Lau

IPC分类号： H04L12/26

CPC分类号： H04L45/00 ,  H04L41/0663 ,  H04L45/124 ,  H04L45/125 ,  H04L45/22 ,  H04L45/28

摘要： A network element maintains failure information for a packet-based network and usage information for a backup path. Upon receipt of a new demand, with an associated bandwidth, d, the network element determines if the backup path can be shared as a function of the failure information and the usage information associated with the backup path.

公开(公告)号：US06560198B1

公开(公告)日：2003-05-06

申请号：US09186241

申请日：1998-11-05

申请人： Teunis J. Ott ,  Tirunell V. Lakshman

发明人： Teunis J. Ott ,  Tirunell V. Lakshman

IPC分类号： H04L1226

CPC分类号： H04L47/32 ,  H04L47/10 ,  H04L47/11 ,  H04L47/2433 ,  H04L47/2441 ,  H04L47/30 ,  H04L49/505 ,  H04L2012/5648

摘要： Methods and systems for estimating the number of active connections in a node in a communications network are described. The node estimates the number of active connections, without maintaining state information on each connection in the node, by sampling one or more packets in a buffer in the node when the node receives a packet, determining the number of sampled packets that are associated with the same connection as the received packet, and estimating the number of active connections in the node based on the determined number of the sampled packets. The node stabilizes the number of packets in the buffer by estimating the number of active connections in the node based on a sampling of the packets in the buffer when the node receives a packet, determining a probability for discarding the received packet based on the estimated number of the active connections and the recent buffer occupancy, and discarding the received packet according to the determined probability.

摘要翻译： 描述用于估计通信网络中的节点中的活动连接数目的方法和系统。 节点通过在节点接收到分组时对节点中的缓冲器中的一个或多个分组进行采样来确定活动连接的数量，而不维护节点中的每个连接的状态信息，确定与该节点相关联的采样分组的数量 与接收到的分组相同的连接，以及基于所确定的采样分组数来估计节点中的活动连接数。 节点通过基于当节点接收分组时基于缓冲器中的分组的采样来估计节点中的活动连接数来稳定缓冲器中的分组数量，基于估计的数量确定丢弃所接收的分组的概率 的活动连接和最近的缓冲器占用，并且根据确定的概率丢弃接收到的分组。

公开(公告)号：US06452933B1

公开(公告)日：2002-09-17

申请号：US08972424

申请日：1997-11-18

申请人： Nicholas G. Duffield ,  Tirunell V. Lakshman ,  Dimitrios Stiliadis

发明人： Nicholas G. Duffield ,  Tirunell V. Lakshman ,  Dimitrios Stiliadis

IPC分类号： H04J316

CPC分类号： H04L47/525 ,  H04L12/5602 ,  H04L47/10 ,  H04L47/50 ,  H04L47/521 ,  H04L47/621 ,  H04L47/623 ,  H04L49/9078 ,  H04L2012/5651 ,  H04L2012/5679 ,  H04Q11/0478

摘要： Apparatus for routing packets in a communication network comprises a plurality of per-connection queues, each queue established for receiving packets from a respective source and temporarily storing received packets before routing to a particular destination; a weighted fair-queuing scheduler for servicing packets from each of the plurality of per-connection queues at guaranteed pre-allocated rates; a sensing device for sensing a presence or absence of packets in queues, the absence of packets in queues indicating availability of excess bandwidth; and, a state dependent scheduler for redistributing excess bandwidth upon sensing of queues absent packets, the state dependent scheduler servicing those queues in accordance with a state variable corresponding to a performance property of the queues, wherein delay and isolation properties for routing packets of respective queues in weighted fair-queuing is preserved.

摘要翻译： 用于在通信网络中路由分组的装置包括多个每连接队列，每个队列被建立用于从相应源接收分组，并且在路由到特定目的地之前临时存储接收的分组; 加权公平排队调度器，用于以保证的预分配速率来处理来自所述多个每连接队列中的每一个的分组; 用于感测队列中的分组的存在或不存在的感测装置，指示队列中的分组指示超出带宽的可用性; 以及用于在感知到不存在分组的队列时重新分配多余带宽的状态依赖调度器，所述状态依赖调度器根据与队列的性能属性对应的状态变量来服务于那些队列，其中用于路由各队列的分组的延迟和隔离属性 在加权公平排队中得到保留。