公开(公告)号：US20050249128A1

公开(公告)日：2005-11-10

申请号：US11180720

申请日：2005-07-14

申请人： Adisak Mekkittikul ,  Nader Vijeh ,  William Tuohy

发明人： Adisak Mekkittikul ,  Nader Vijeh ,  William Tuohy

IPC分类号： H04L12/28 ,  H04L12/42 ,  H04L12/56 ,  H04L12/26

CPC分类号： H04L47/6215 ,  H04L12/2852 ,  H04L12/42 ,  H04L47/2433 ,  H04L47/2441 ,  H04L47/30 ,  H04L47/50 ,  H04L47/522 ,  H04L47/562 ,  H04L47/6255

摘要： In a metropolitan area network, a method and system for maintaining an accurate total of the amount of allocated bandwidth on the network. A plurality of incoming packets are assigned to a respective plurality of queues of a metropolitan area network switch. Using a fair arbitration scheme, the respective queues are configured to empty at a specified output rate. A finish time for each respective queue is computed, the finish time describing a time at which the respective queue will be emptied using the output rate. The plurality of queues are grouped into multiple groups in accordance with their respective finish times. The earliest group includes the reserved rates of those queues having a finish time indicating an empty condition at a first time increment. The second earliest group includes the reserved rates of those queues having a finish time indicating an empty condition at a second time increment later than the first time increment, and so on. The amount of allocated bandwidth on the network is determined by tracking the sum of the reserved rates of all the multiple groups. The first time increment, second time increment, and the like are indexed with respect to a schedule clock. The earliest group thus indicates those queues that will have an empty condition at a next time increment of the schedule clock. The determination of the amount of allocated bandwidth can be accomplished in real time, thereby allowing the efficient allocation of unallocated bandwidth in real time.

公开(公告)号：US07061861B1

公开(公告)日：2006-06-13

申请号：US09611180

申请日：2000-07-06

申请人： Adisak Mekkittikul ,  Nader Vijeh

发明人： Adisak Mekkittikul ,  Nader Vijeh

IPC分类号： G01R31/08 ,  H04J1/16 ,  H04L12/26

CPC分类号： H04L47/32 ,  H04L12/2852 ,  H04L12/433 ,  H04L47/10 ,  H04L47/11 ,  H04L47/225 ,  H04L47/2433 ,  H04L47/2441 ,  H04L47/266

摘要： A method and system for implementing weighted fair flow control on a metropolitan area network. Weighted fair flow control is implemented using a plurality of metro packet switches (MPS), each including a respective plurality of virtual queues and a respective plurality of per flow queues. Each MPS accepts data from a respective plurality of local input flows. Each local input flow has a respective quality of service (QoS) associated therewith. The data of the local input flows are queued using the per flow queues, with each input flow having its respective per flow queue. Each virtual queue maintains a track of the flow rate of its respective local input flow. Data is transmitted from the local input flows of each MPS across a communications channel of the network and the bandwidth of the communications channel is allocated in accordance with the QoS of each local input flow. The QoS is used to determine the rate of transmission of the local input flow from the per flow queue to the communications channel. This implements an efficient weighted bandwidth utilization of the communications channel. Among the plurality of MPS, bandwidth of the communications channel is allocated by throttling the rate at which data is transmitted from an upstream MPS with respect to the rate at which data is transmitted from a downstream MPS, thereby implementing a weighted fair bandwidth utilization of the communications channel.

摘要翻译： 一种在城域网实现加权公平流控制的方法和系统。 使用多个城域分组交换机（MPS）来实现加权的公平流控制，每个城域分组交换机包括相应的多个虚拟队列和相应的多个每个流队列。 每个MPS接收来自相应的多个本地输入流的数据。 每个本地输入流具有与其相关联的相应的服务质量（QoS）。 本地输入流的数据使用每个流队列进行排队，每个输入流具有各自的每个流队列。 每个虚拟队列保持其各自本地输入流的流量的轨迹。 数据通过网络的通信信道从每个MPS的本地输入流发送，并且根据每个本地输入流的QoS来分配通信信道的带宽。 QoS用于确定从每个流队列到通信信道的本地输入流的传输速率。 这实现了通信信道的有效加权带宽利用。 在多个MPS中，通过相对于从下游MPS发送数据的速率来调节从上游MPS发送数据的速率来分配通信信道的带宽，由此实现 通讯渠道。

公开(公告)号：US06947998B2

公开(公告)日：2005-09-20

申请号：US10094035

申请日：2002-03-07

申请人： Adisak Mekkittikul ,  Nader Vijeh ,  William J. Tuohy

发明人： Adisak Mekkittikul ,  Nader Vijeh ,  William J. Tuohy

IPC分类号： H04L12/28 ,  H04L12/42 ,  H04L12/56 ,  G06F15/173

CPC分类号： H04L47/6215 ,  H04L12/2852 ,  H04L12/42 ,  H04L47/2433 ,  H04L47/2441 ,  H04L47/30 ,  H04L47/50 ,  H04L47/522 ,  H04L47/562 ,  H04L47/6255

摘要： In a metropolitan area network, a method and system for maintaining an accurate total of the amount of allocated bandwidth on the network. A plurality of incoming packets are assigned to a respective plurality of queues of a metropolitan area network switch. Using a fair arbitration scheme, the respective queues are configured to empty at a specified output rate. A finish time for each respective queue is computed, the finish time describing a time at which the respective queue will be emptied using the output rate. The plurality of queues are grouped into multiple groups in accordance with their respective finish times. The earliest group includes the reserved rates of those queues having a finish time indicating an empty condition at a first time increment. The second earliest group includes the reserved rates of those queues having a finish time indicating an empty condition at a second time increment later than the first time increment, and so on. The amount of allocated bandwidth on the network is determined by tracking the sum of the reserved rates of all the multiple groups. The first time increment, second time increment, and the like are indexed with respect to a schedule clock. The earliest group thus indicates those queues that will have an empty condition at a next time increment of the schedule clock. The determination of the amount of allocated bandwidth can be accomplished in real time, thereby allowing the efficient allocation of unallocated bandwidth in real time.

摘要翻译： 在城域网中，用于维持网络上分配的带宽量的准确总和的方法和系统。 多个输入分组被分配给城域网交换机的相应多个队列。 使用公平的仲裁方案，相应的队列被配置为以指定的输出速率清空。 计算每个相应队列的完成时间，完成时间描述使用输出速率排除相应队列的时间。 根据各自的完成时间，将多个队列分组成多组。 最早的组包括具有在第一时间增量处指示空条件的完成时间的那些队列的预留费率。 第二最早组包括在比第一时间增量晚的第二时间增量处具有指示空条件的完成时间的那些队列的保留速率，等等。 通过跟踪所有多个组的保留速率的总和来确定网络上分配的带宽量。 相对于调度时钟来索引第一次增量，第二次增量等。 因此，最早的组因此表示在调度时钟的下一次增量时将具有空条件的队列。 可以实时地实现分配带宽量的确定，从而实现对未分配带宽的有效分配。

公开(公告)号：US07792023B2

公开(公告)日：2010-09-07

申请号：US10846297

申请日：2004-05-13

申请人： Nader Vijeh ,  Adisak Mekkittikul

发明人： Nader Vijeh ,  Adisak Mekkittikul

IPC分类号： H04L12/26 ,  H04L12/28 ,  H04L12/56

CPC分类号： H04L47/10 ,  H04L12/433 ,  H04L47/11 ,  H04L47/20 ,  H04L47/2441 ,  H04L47/762 ,  H04L2012/5605 ,  H04L2012/5612 ,  H04L2012/5651

摘要： An asynchronous metropolitan packet transport ring having per-flow QoS. Asynchronous packetized data flow in one direction through a fiber optic loop. A number of Metropolitan Packet Switches (MPS) are coupled to the fiber optic loop. An MPS allows packetized data from an upstream MPS to flow to a downstream MPS over a segment of the fiber optic loop. The MPS also puts packetized data onto and pulls packetized data off of the fiber optic loop. Thereby, flows can access the fiber optic loop via the MPS's. The MPS's also regulate the data rates on a per-flow basis according to setup information supplied by a Ring Management System (RMS). If one segment of the fiber loop becomes overly congested, the MPS guarantees quality of service for those flows by deallocating available bandwidth from flows upstream to the point of congestion. Utilization of packet transport ring capacity is optimized by allocating any bandwidth that becomes available to active flows according to a pre-specified weighting scheme.

摘要翻译： 具有每流QoS的异步城域分组传输环。 异步打包数据通过光纤回路在一个方向流动。 一些大都市分组交换机（MPS）耦合到光纤回路。 MPS允许来自上游MPS的分组数据在光纤环路的一段上流向下游MPS。 MPS还将分组化数据放在光纤环路之外并将数据包化数据从光纤回路拉出。 因此，流可以通过MPS访问光纤环路。 MPS还根据环路管理系统（RMS）提供的设置信息，以每个流量为基础调整数据速率。 如果光纤环路的一个部分过载，则MPS通过从上游到拥塞点的流量中释放可用带宽来保证这些流的服务质量。 通过根据预先规定的加权方案分配可用于活动流的任何带宽来优化分组传输环容量的利用。

公开(公告)号：US20050002392A1

公开(公告)日：2005-01-06

申请号：US10846297

申请日：2004-05-13

申请人： Nader Vijeh ,  Adisak Mekkittikul

发明人： Nader Vijeh ,  Adisak Mekkittikul

IPC分类号： H04L12/433 ,  H04L12/56

CPC分类号： H04L47/10 ,  H04L12/433 ,  H04L47/11 ,  H04L47/20 ,  H04L47/2441 ,  H04L47/762 ,  H04L2012/5605 ,  H04L2012/5612 ,  H04L2012/5651

摘要： An asynchronous metropolitan packet transport ring having per-flow QoS. Asynchronous packetized data flow in one direction through a fiber optic loop. A number of Metropolitan Packet Switches (MPS) are coupled to the fiber optic loop. An MPS allows packetized data from an upstream MPS to flow to a downstream MPS over a segment of the fiber optic loop. The MPS also puts packetized data onto and pulls packetized data off of the fiber optic loop. Thereby, flows can access the fiber optic loop via the MPS's. The MPS's also regulate the data rates on a per-flow basis according to setup information supplied by a Ring Management System (RMS). If one segment of the fiber loop becomes overly congested, the MPS guarantees quality of service for those flows by deallocating available bandwidth from flows upstream to the point of congestion. Utilization of packet transport ring capacity is optimized by allocating any bandwidth that becomes available to active flows according to a pre-specified weighting scheme.

摘要翻译： 具有每流QoS的异步城域分组传输环。 异步打包数据通过光纤回路在一个方向流动。 一些大都市分组交换机（MPS）耦合到光纤回路。 MPS允许来自上游MPS的分组数据在光纤环路的一段上流向下游MPS。 MPS还将分组化数据放在光纤环路之外并将数据包化数据从光纤回路拉出。 因此，流可以通过MPS访问光纤环路。 MPS还根据环路管理系统（RMS）提供的设置信息，以每个流量为基础调整数据速率。 如果光纤环路的一个部分过载，则MPS通过从上游到拥塞点的流量中释放可用带宽来保证这些流的服务质量。 通过根据预先规定的加权方案分配可用于活动流的任何带宽来优化分组传输环容量的利用。

公开(公告)号：US07653740B2

公开(公告)日：2010-01-26

申请号：US11180720

申请日：2005-07-14

申请人： Adisak Mekkittikul ,  Nader Vijeh ,  William J. Tuohy

发明人： Adisak Mekkittikul ,  Nader Vijeh ,  William J. Tuohy

IPC分类号： G06F15/16 ,  H04L12/28

CPC分类号： H04L47/6215 ,  H04L12/2852 ,  H04L12/42 ,  H04L47/2433 ,  H04L47/2441 ,  H04L47/30 ,  H04L47/50 ,  H04L47/522 ,  H04L47/562 ,  H04L47/6255

摘要： In a metropolitan area network, a method and system for maintaining an accurate total of the amount of allocated bandwidth on the network. A plurality of incoming packets are assigned to a respective plurality of queues of a metropolitan area network switch. Using a fair arbitration scheme, the respective queues are configured to empty at a specified output rate. A finish time for each respective queue is computed, the finish time describing a time at which the respective queue will be emptied using the output rate. The plurality of queues are grouped into multiple groups in accordance with their respective finish times. The earliest group includes the reserved rates of those queues having a finish time indicating an empty condition at a first time increment. The second earliest group includes the reserved rates of those queues having a finish time indicating an empty condition at a second time increment later than the first time increment, and so on. The amount of allocated bandwidth on the network is determined by tracking the sum of the reserved rates of all the multiple groups. The first time increment, second time increment, and the like are indexed with respect to a schedule clock. The earliest group thus indicates those queues that will have an empty condition at a next time increment of the schedule clock. The determination of the amount of allocated bandwidth can be accomplished in real time, thereby allowing the efficient allocation of unallocated bandwidth in real time.

摘要翻译： 在城域网中，用于维持网络上分配的带宽量的准确总和的方法和系统。 多个输入分组被分配给城域网交换机的相应多个队列。 使用公平的仲裁方案，相应的队列被配置为以指定的输出速率清空。 计算每个相应队列的完成时间，完成时间描述使用输出速率排除相应队列的时间。 根据各自的完成时间，将多个队列分组成多组。 最早的组包括具有在第一时间增量处指示空条件的完成时间的那些队列的预留费率。 第二最早组包括在比第一时间增量晚的第二时间增量处具有指示空条件的完成时间的那些队列的保留速率，等等。 通过跟踪所有多个组的保留速率的总和来确定网络上分配的带宽量。 相对于调度时钟来索引第一次增量，第二次增量等。 因此，最早的组因此表示在调度时钟的下一次增量时将具有空条件的队列。 可以实时地实现分配带宽量的确定，从而实现对未分配带宽的有效分配。

公开(公告)号：US07239607B1

公开(公告)日：2007-07-03

申请号：US09608747

申请日：2000-06-30

申请人： Nader Vijeh ,  Adisak Mekkittikul

发明人： Nader Vijeh ,  Adisak Mekkittikul

IPC分类号： H04L12/26 ,  H04L12/28 ,  H04L12/56

CPC分类号： H04L47/10 ,  H04L12/2852 ,  H04L12/433 ,  H04L47/125 ,  H04L47/22 ,  H04L47/2425 ,  H04L47/2441 ,  H04L47/245

摘要： An asynchronous metropolitan packet transport ring having guaranteed QoS. Asynchronous packetized data flow in one direction through a fiber optic loop. A number of Metropolitan Packet Switches (MPS) are coupled to the fiber optic loop. An MPS allows packetized data from an upstream MPS to flow to a downstream MPS over a segment of the fiber optic loop. The MPS also puts packetized data onto and pulls packetized data off of the fiber optic loop. Thereby, flows can access the fiber optic loop via the MPS's. The MPS's also regulate the data rates on a per-flow basis according to setup information supplied by a Ring Management System (RMS). If one segment of the fiber loop becomes overly congested, the MPS guarantees quality of service for those flows by deallocating available bandwidth from flows upstream to the point of congestion. Utilization of packet transport ring capacity is optimized by allocating any bandwidth that becomes available to active flows according to a pre-specified weighting scheme.

摘要翻译： 具有保证QoS的异步城域分组传输环。 异步打包数据通过光纤回路在一个方向流动。 一些大都市分组交换机（MPS）耦合到光纤回路。 MPS允许来自上游MPS的分组数据在光纤环路的一段上流向下游MPS。 MPS还将分组化数据放在光纤环路之外并将数据包化数据从光纤回路拉出。 因此，流可以通过MPS访问光纤环路。 MPS还根据环路管理系统（RMS）提供的设置信息，以每个流量为基础调整数据速率。 如果光纤环路的一个部分过载，则MPS通过从上游到拥塞点的流量中释放可用带宽来保证这些流的服务质量。 通过根据预先规定的加权方案分配可用于活动流的任何带宽来优化分组传输环容量的利用。

公开(公告)号：US20050013248A1

公开(公告)日：2005-01-20

申请号：US10094035

申请日：2002-03-07

申请人： Adisak Mekkittikul ,  Nader Vijeh ,  William Tuohy

发明人： Adisak Mekkittikul ,  Nader Vijeh ,  William Tuohy

IPC分类号： H04L12/28 ,  H04L12/42 ,  H04L12/56 ,  H04L1/00

CPC分类号： H04L47/6215 ,  H04L12/2852 ,  H04L12/42 ,  H04L47/2433 ,  H04L47/2441 ,  H04L47/30 ,  H04L47/50 ,  H04L47/522 ,  H04L47/562 ,  H04L47/6255

摘要： In a metropolitan area network, a method and system for maintaining an accurate total of the amount of allocated bandwidth on the network. A plurality of incoming packets are assigned to a respective plurality of queues of a metropolitan area network switch. Using a fair arbitration scheme, the respective queues are configured to empty at a specified output rate. A finish time for each respective queue is computed, the finish time describing a time at which the respective queue will be emptied using the output rate. The plurality of queues are grouped into multiple groups in accordance with their respective finish times. The earliest group includes the reserved rates of those queues having a finish time indicating an empty condition at a first time increment. The second earliest group includes the reserved rates of those queues having a finish time indicating an empty condition at a second time increment later than the first time increment, and so on. The amount of allocated bandwidth on the network is determined by tracking the sum of the reserved rates of all the multiple groups. The first time increment, second time increment, and the like are indexed with respect to a schedule clock. The earliest group thus indicates those queues that will have an empty condition at a next time increment of the schedule clock. The determination of the amount of allocated bandwidth can be accomplished in real time, thereby allowing the efficient allocation of unallocated bandwidth in real time.

公开(公告)号：US5388133A

公开(公告)日：1995-02-07

申请号：US20490

申请日：1993-02-22

申请人： Nader Vijeh ,  William Lo

发明人： Nader Vijeh ,  William Lo

IPC分类号： H04L12/28 ,  G06F11/34 ,  H04L12/26 ,  G06M3/06

CPC分类号： H04L12/2602 ,  G06F11/348 ,  H04L43/00 ,  G06F2201/88

摘要： A counter for attribute stored in an Ethernet system is partitioned such that the storage section is separated from the incrementors section. In so doing, counters are implemented in a significantly less space than if the counters were implemented as individual counters. The counter utilizes random access memory as the storage section and a 32 bit incrementor. As the incrementor section along with a pair of latches to implement the counter.

摘要翻译： 存储在以太网系统中的属性的计数器被分区，使得存储部分与增量部分分离。 在这样做时，计数器的实现方式远远小于将计数器作为单独计数器实现的空间。 该计数器利用随机存取存储器作为存储部分和32位增量器。 作为递增器部分以及用于实现计数器的一对闩锁。

公开(公告)号：US5557633A

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

申请号：US385219

申请日：1995-02-08

申请人： David Staab ,  Nader Vijeh

发明人： David Staab ,  Nader Vijeh

IPC分类号： G01R29/027 ,  H03K5/02 ,  H03K5/156 ,  H03K19/0185 ,  H04L12/44 ,  H04L12/46 ,  H04L25/02 ,  H04L25/08 ,  H04L25/49 ,  H04B17/02

CPC分类号： H04L25/0272 ,  G01R29/0273 ,  H03K19/018578 ,  H03K5/023 ,  H03K5/156 ,  H04L12/44 ,  H04L12/46 ,  H04L25/08 ,  H04L25/085 ,  H04L25/4904

摘要： A discrete integrated repeater device and port MAU/AUI functions shares resources among its several ports. The device includes a single multi-bit free running counter providing preselected timing intervals to a plurality of latches. A signal undergoing measurement clears the latch while a preselected timing signal sets the latch. Receipt of a timing signal at a set latch indicates success or failure of some particular condition under test. The device satisfies an IEEE 802.3 specification for execution of a link integrity test. The device is also able to selectively disable or enable the link integrity test function for particular ports. A plurality of latches, one associated with each port, is set upon carrier sense detection at the particular port. A token passing mechanism implemented with a daisy chained line coupled to each latch enables a polling of each latch to provide carrier sense information about each port in a serial format. The device shares a single PLL among all its ports by producing a logical sum of carrier sense inputs to enable activation of the PLL. A collision indication signal will override operation of the PLL to ensure data integrity and to allow the PLL to reacquire lock on its reference clock.

摘要翻译： 一个离散集成中继器设备和端口MAU / AUI功能在其多个端口之间共享资源。 该设备包括单个多位自由运行计数器，为多个锁存器提供预选的定时间隔。 正在进行测量的信号会在预选的定时信号设置锁存器时清除锁存器。 在设置的锁存器处接收定时信号指示被测试的一些特定条件的成功或失败。 该设备满足用于执行链路完整性测试的IEEE 802.3规范。 该设备还能够选择性地禁用或启用特定端口的链路完整性测试功能。 多个锁存器，一个与每个端口相关联的锁存器被设置在特定端口的载波检测检测。 通过耦合到每个锁存器的菊花链链路实现的令牌传递机制使得能够轮询每个锁存器以串行格式提供关于每个端口的载波感测信息。 该器件通过产生载波检测输入的逻辑和来实现PLL的激活，在其所有端口中共享单个PLL。 冲突指示信号将覆盖PLL的操作，以确保数据完整性，并允许PLL重新获取其参考时钟上的锁定。