公开(公告)号：US5311513A

公开(公告)日：1994-05-10

申请号：US943097

申请日：1992-09-10

申请人： Hamid Ahmadi ,  Jeffrey, H. Derby ,  Roch Guerin ,  Levent Gun ,  Gerald A. Marin ,  Mahmoud Naghshineh ,  Khosrow Sohraby

发明人： Hamid Ahmadi ,  Jeffrey, H. Derby ,  Roch Guerin ,  Levent Gun ,  Gerald A. Marin ,  Mahmoud Naghshineh ,  Khosrow Sohraby

IPC分类号： H04L29/06 ,  H04L12/56

CPC分类号： H04L12/5602 ,  H04L2012/5636 ,  H04L2012/5637 ,  H04L2012/5651 ,  H04L2012/568

摘要： A congestion control system for packet communications networks in which access to the network is controlled to prevent such congestion. Packets within the prespecified statistical description of each packet source are marked as high priority ("green" packets) while packets exceeding the pre-specified characteristics are marked with a lower priority ("red" packets). The overall red packet rate is limited to prevent red packet saturation of the network. Packets are marked red for a continuous train of successive red packets. The introduction of red packets into the network is subjected to a degree of hysteresis to provide better interaction with higher layer error recovery protocols. The amount of hysteresis introduced into the red packet marking can be fixed or varied, depending on the statistics of the incoming data packets at the entry point to the network.

摘要翻译： 用于分组通信网络的拥塞控制系统，其中控制对网络的访问以防止这种拥塞。 每个分组源的预先指定的统计描述中的分组被标记为高优先级（“绿色”分组），而超过预定特性的分组被标记为较低优先级（“红色”分组））。 整体红包速率受到限制，以防止网络的红包饱和。 数据包被标记为红色，用于连续的连续红色数据包。 引入红包到网络中受到一定程度的迟滞，以提供与更高层错误恢复协议的更好的交互。 引入到红包标记中的迟滞量可以是固定的或变化的，具体取决于入网点到网络的输入数据包的统计。

公开(公告)号：US5233604A

公开(公告)日：1993-08-03

申请号：US874917

申请日：1992-04-28

申请人： Hamid Ahmadi ,  Jeane S. Chen ,  Chee-Seng Chow ,  Roch Guerin ,  Levent Gun ,  Anthony M. Lee ,  Theodore E. Tedijanto

发明人： Hamid Ahmadi ,  Jeane S. Chen ,  Chee-Seng Chow ,  Roch Guerin ,  Levent Gun ,  Anthony M. Lee ,  Theodore E. Tedijanto

IPC分类号： G06F13/00 ,  H04L12/56

CPC分类号： H04L45/123 ,  H04L45/12

摘要： A packet communications system utilizes a route determining mechanism by identifying principal paths between the source and the destination in the system. Principal paths are minimum hop count paths with a transmission delay less than a specified threshold. Principal path links are accepted as legs of the optimum path, if feasible, i.e., if the resulting load on the link is less than a specified principal threshold. Secondary links are accepted only if the resulting load on the link is less than a specified secondary threshold, where the secondary threshold is less than the principal threshold. All paths must also have a transmission delay less than a specified threshold. Each request for a route includes the source node, the destination node, the load required, the maximum transmission delay and, if desired, the quality of service parameters which all of the legs of the route must satisfy. A modified Bellman-Ford breadth-first search algorithm is used to identify the principal links and, using these principal link identifications, determining the optimum path.

公开(公告)号：US5289462A

公开(公告)日：1994-02-22

申请号：US932440

申请日：1992-08-19

申请人： Hamid Ahmadi ,  Roch Guerin ,  Levent Gun

发明人： Hamid Ahmadi ,  Roch Guerin ,  Levent Gun

IPC分类号： H04L12/56 ,  H04Q11/04

CPC分类号： H04L12/5602 ,  H04L2012/5632 ,  H04L2012/5636 ,  H04L2012/5637

摘要： In a packet communications network, the addition or deletion of a connection to the network by a user is governed by a link traffic metric which represents the effective capacity of each link in the network which participates in the packet connection route. The link metric is calculated in real-time and updated by simple vector addition or subtraction. Moreover, this link metric is also used to calculate leaky bucket parameters which govern the access of packets to the network once the connection is set up. A packet network using these link metrics and metric generation techniques provides maximum packet throughput while, at the same time, preserving grade of service guarantees.

摘要翻译： 在分组通信网络中，由用户添加或删除与网络的连接由链路流量度量来管理，链路流量度量表示参与分组连接路由的网络中的每个链路的有效容量。 链接度量是通过简单的向量加法或减法实时计算和更新的。 此外，该链接度量还用于计算泄漏桶参数，其在连接建立后控制分组到网络的访问。 使用这些链接度量和度量生成技术的分组网络提供最大的分组吞吐量，同时保持服务等级的保证。

公开(公告)号：US5274625A

公开(公告)日：1993-12-28

申请号：US942873

申请日：1992-09-10

申请人： Jeffrey H. Derby ,  Roch Guerin ,  Levent Gun

发明人： Jeffrey H. Derby ,  Roch Guerin ,  Levent Gun

IPC分类号： H04L12/56 ,  H04N21/236 ,  H04N21/434 ,  H04Q11/04 ,  H04J3/14

CPC分类号： H04N21/434 ,  H04L43/08 ,  H04L43/0829 ,  H04L43/0876 ,  H04L43/0894 ,  H04N21/236 ,  H04Q11/0478 ,  H04L2012/5632 ,  H04L2012/5678

摘要： A packet communications network relies on a few simple parameters to characterize the wide variety of traffic offered to that network, such as peak bit rate, mean bit rate and average packet burst length. A better representation of many types of traffic relies on an equivalent burst length which produces the same loss probability distribution, but assumes that the distribution is uncorrelated and exponential. Access control and bandwidth management based on such an equivalent burst length produces improved decisions due to the more accurate representation of the actual traffic distribution.

摘要翻译： 分组通信网络依赖于几个简单参数来表征提供给该网络的各种业务，例如峰比特率，平均比特率和平均分组突发长度。 许多类型的业务的更好的表示依赖于等效的突发长度，其产生相同的丢失概率分布，但是假设分布是不相关的和指数的。 基于这种等效突发长度的访问控制和带宽管理由于实际流量分布的更准确的表示而产生改进的决策。

公开(公告)号：US09060285B2

公开(公告)日：2015-06-16

申请号：US13138778

申请日：2010-03-18

申请人： Theodoros Salonidis ,  Georgios Sotiropoulos ,  Ramesh Govindan ,  Roch Guerin

发明人： Theodoros Salonidis ,  Georgios Sotiropoulos ,  Ramesh Govindan ,  Roch Guerin

IPC分类号： H04W24/02

CPC分类号： H04W24/02

摘要： A method is intended for computing online a feasible rates region in a network using a random access MAC protocol and comprising nodes having links there between. This method comprises the steps of i) determining, for each link, a primary extreme point corresponding to a maximum output rate when this link transmits alone at a maximum input rate, and ii) determining secondary extreme points by combining these primary extreme points with a chosen interference model, these primary and secondary extreme points defining a boundary of a feasible rates region.

摘要翻译： 一种方法是用于使用随机接入MAC协议在网络上计算网络中的可行速率区域，并且包括其间具有链路的节点。 该方法包括以下步骤：i）当该链路以最大输入速率单独发送时，为每个链路确定对应于最大输出速率的主要极值点，以及ii）通过将这些主极值点与 选择的干扰模型，这些主要和次要极值点定义了可行费率区域的边界。

公开(公告)号：US08510468B2

公开(公告)日：2013-08-13

申请号：US12853467

申请日：2010-08-10

申请人： Mark Vange ,  Marc Plumb ,  Michael Kouts ,  Glenn Sydney Wilson ,  Roch Guerin ,  Rajendran Rajan

发明人： Mark Vange ,  Marc Plumb ,  Michael Kouts ,  Glenn Sydney Wilson ,  Roch Guerin ,  Rajendran Rajan

IPC分类号： G06F15/173

CPC分类号： H04L45/14 ,  H04L41/064 ,  H04L41/12 ,  H04L45/00 ,  H04L63/0428 ,  H04L67/101 ,  H04L67/327 ,  H04L69/08 ,  H04L69/16 ,  H04L69/329

摘要： A method and apparatus for route aware network link acceleration provides a managed communication channel for accelerated and reliable network communication between a client and other network devices as needed. The communication channel may comprise one or more segments having increased speed, reliability, security, or other improved characteristics as compared to traditional communication links. Network traffic may be routed through one or more of the segments based on various criteria to improve communication of the traffic. In one embodiment, the segments may be arranged in a daisy chain configuration and be provided by one or more chaining nodes.

摘要翻译： 用于路由感知网络链路加速的方法和装置提供了一种被管理的通信信道，用于根据需要在客户机和其他网络设备之间加速和可靠的网络通信。 与传统通信链路相比，通信信道可以包括具有增加的速度，可靠性，安全性或其他改进的特性的一个或多个段。 可以基于各种标准来将网络流量路由到一个或多个段，以改善流量的通信。 在一个实施例中，段可以布置成菊花链配置并由一个或多个链接节点提供。

公开(公告)号：US20050025059A1

公开(公告)日：2005-02-03

申请号：US10895156

申请日：2004-07-20

申请人： Rajendran Rajan ,  Roch Guerin

发明人： Rajendran Rajan ,  Roch Guerin

IPC分类号： H04L12/24 ,  H04L12/56 ,  H04N7/26 ,  H04N11/04 ,  H04L12/26

CPC分类号： H04L41/12 ,  H04L45/02 ,  H04L45/04 ,  H04L45/12 ,  H04L45/123 ,  H04L45/26 ,  H04N11/042 ,  H04N19/184 ,  H04N19/186

摘要： A method and system for extracting and building end-to-end route information in a multi-area Internet protocol (IP) autonomous system (AS) is disclosed. The method and system enable a user, such as a network administrator, to explicitly identify a full set of paths (links and routers) that a given IP packet would potentially traverse from its entry point in the source area of the AS where it originates until its exit point in its intended destination area.

摘要翻译： 公开了一种在多域互联网协议（IP）自治系统（AS）中提取和构建端到端路由信息的方法和系统。 该方法和系统使得诸如网络管理员之类的用户能够明确地标识给定IP分组可能从其起始的AS的源区域中的入口点潜在地穿过的完整路径集合（链路和路由器）直到 其出口点在其预期目的地区域。

公开(公告)号：US06836465B2

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

申请号：US09997420

申请日：2001-11-29

申请人： Rajendran Rajan ,  Roch Guerin

发明人： Rajendran Rajan ,  Roch Guerin

IPC分类号： H04J116

CPC分类号： H04L41/12 ,  H04L45/02 ,  H04L45/04 ,  H04L45/12 ,  H04L45/123 ,  H04L45/26 ,  H04N11/042 ,  H04N19/184 ,  H04N19/186

摘要： A method and system for extracting and building end-to-end route information in a multi-area Internet protocol (IP) autonomous system (AS) is disclosed. The method and system enable a user, such as a network administrator, to explicitly identify a full set of paths (links and routers) that a given IP packet would potentially traverse from its entry point in the source area of the AS where it originates until its exit point in its intended destination area.

摘要翻译： 公开了一种在多域互联网协议（IP）自治系统（AS）中提取和构建端到端路由信息的方法和系统。 该方法和系统使得诸如网络管理员之类的用户能够明确地标识给定IP分组可能从其起始的AS的源区域中的入口点潜在地穿过的完整路径集合（链路和路由器）直到 其出口点在其预期目的地区域。

公开(公告)号：US5425021A

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

申请号：US10136

申请日：1993-01-28

申请人： Jeffrey H. Derby ,  John E. Drake, Jr. ,  John G. Dudley ,  Roch Guerin ,  Marc A. Kaplan ,  Gerald A. Marin ,  Marcia L. Peters ,  Kenneth H. Potter, Jr.

发明人： Jeffrey H. Derby ,  John E. Drake, Jr. ,  John G. Dudley ,  Roch Guerin ,  Marc A. Kaplan ,  Gerald A. Marin ,  Marcia L. Peters ,  Kenneth H. Potter, Jr.

IPC分类号： H04L12/56 ,  H04Q11/04 ,  H04J3/24

CPC分类号： H04L49/25 ,  H04L49/102 ,  H04L49/107 ,  H04L49/1553 ,  H04L49/256 ,  H04Q11/0478 ,  H04L2012/5632 ,  H04L45/00 ,  H04L49/3009 ,  H04L49/555

摘要： Method and apparatus for making limited internal-node communication facilities externally visible in a packet switching network. Internal-node communication facilities are called intranode links, can include any cable, channel, bus, etc. over which data passes, and are used to connect the multiple subnodes within a given node. Each subnode contains a switching mechanism and routes packets to other nodes, subnodes, or user applications. Each node provides network control functions such as topology, directory, path selection, and bandwidth management which can manage intranode links in the same manner that internode links are currently managed.

摘要翻译： 用于在分组交换网络中使外部可见的有限的内部节点通信设备的方法和装置。 内部节点通信设施称为内部网络链路，可以包括数据通过的任何电缆，信道，总线等，并用于连接给定节点内的多个子节点。 每个子节点包含切换机制，并将数据包路由到其他节点，子节点或用户应用程序。 每个节点提供网络控制功能，例如拓扑，目录，路径选择和带宽管理，可以以与当前管理的节点链接相同的方式管理内部网络链路。

公开(公告)号：US08218447B2

公开(公告)日：2012-07-10

申请号：US12423392

申请日：2009-04-14

申请人： Rajendran Rajan ,  Roch Guerin

发明人： Rajendran Rajan ,  Roch Guerin

IPC分类号： H04J1/16

CPC分类号： H04L41/12 ,  H04L45/02 ,  H04L45/04 ,  H04L45/12 ,  H04L45/123 ,  H04L45/26 ,  H04N11/042 ,  H04N19/184 ,  H04N19/186

摘要： A method and system for extracting and building end-to-end route information in a multi-area Internet protocol (IP) autonomous system (AS) is disclosed. The method and system enable a user, such as a network administrator, to explicitly identify a full set of paths (links and routers) that a given IP packet would potentially traverse from its entry point in the source area of the AS where it originates until its exit point in its intended destination area.

摘要翻译： 公开了一种在多域互联网协议（IP）自治系统（AS）中提取和构建端到端路由信息的方法和系统。 该方法和系统使得诸如网络管理员之类的用户能够明确地标识给定IP分组可能从其起始的AS的源区域中的入口点潜在地穿过的完整路径集合（链路和路由器）直到 其出口点在其预期目的地区域。