专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US6147970A Quality of service management for aggregated flows in a network system 失效
标题翻译：网络系统中聚合流的服务质量管理
公开(公告)号：US6147970A
公开(公告)日：2000-11-14
申请号：US940668
申请日：1997-09-30
申请人： Gregory D. Troxel
发明人： Gregory D. Troxel
IPC分类号： H04L12/18 , H04L12/56 , H04Q11/04 , H04L12/26
CPC分类号： H04L47/10 , H04L12/1881 , H04L12/5602 , H04L45/10 , H04Q11/0478 , H04L2012/5636 , H04L2012/5647 , H04L2012/5651
摘要： A system and method for optimizing data flow through a node in a network system, where messages forwarded to the node have one of at least two priorities, a normal priority and a high priority. A novel token bucket approach allows maintaining Quality of Service (Qos) while maximizing throughput. Token buckets include normal and high-priority levels, which reserve capacity for high priority bursts of data. Messages for which not enough tokens are present are marked as not protected against loss, and dropped or sent on depending on a mode. Two-stage policing using two levels of token buckets is also presented. Each flow into a node or router has an associated token bucket, with normal and high priority levels. A second aggregate token bucket then re-tests all messages which were considered protected against loss from the first stage. Messages can be marked not protected against loss and sent out appropriately (for example, marked CLP-1 in an ATM VBR-tagged system), or dropped. Also, messages which were marked not protected against loss at the first stage can be marked protected against loss based on a headroom threshold, which allows excess token bucket capacity to be used passing messages which would normally be dropped.
摘要翻译：一种用于优化通过网络系统中的节点的数据流的系统和方法，其中转发到所述节点的消息具有至少两个优先级中的一个，正常优先级和高优先级。新颖的令牌桶方法允许维持服务质量（Qos），同时最大限度地提高吞吐量。令牌桶包括正常和高优先级，可以为高优先级的数据突发预留容量。不存在足够的令牌的消息被标记为不被保护以防丢失，并根据模式丢弃或发送。还提出了使用两级令牌桶的两阶段监管。进入节点或路由器的每个流都具有相关联的令牌桶，具有正常和高优先级。第二个聚合令牌桶然后重新测试所有被认为是防止从第一阶段丢失的消息。消息可以被标记为不被保护以免丢失并被适当地发送（例如，在ATM VBR标记的系统中标记为CLP-1）或丢弃。另外，在第一阶段被标记为不被防止丢失的消息可以被标记为基于净空阈值而被保护以免丢失，这允许使用通常被丢弃的消息的超量令牌桶容量。

2. 发明申请

US20100118883A1 SYSTEMS AND METHODS FOR QUEUE MANAGEMENT IN PACKET-SWITCHED NETWORKS 有权
标题翻译：分组交换网络中的队列管理系统与方法
公开(公告)号：US20100118883A1
公开(公告)日：2010-05-13
申请号：US12691310
申请日：2010-01-21
申请人： Christine E. Jones , Gregory D. Troxel
发明人： Christine E. Jones , Gregory D. Troxel
IPC分类号： H04L12/56
CPC分类号： H04L47/6215 , H04L41/0213 , H04L41/5022 , H04L47/32 , H04L47/50 , H04L49/9084
摘要： This disclosure relates to methods and systems for queuing traffic in packet-switched networks. In one of many possible embodiments, a queue management system includes a plurality of queues and a priority module configured to assign incoming packets to the queues based on priorities associated with the incoming packets. The priority module is further configured to drop at least one of the packets already contained in the queues. The priority module is configured to operate across multiple queues when determining which of the packets contained in the queues to drop. Some embodiments provide for hybrid queue management that considers both classes and priorities of packets.
摘要翻译：本公开涉及用于在分组交换网络中排队业务的方法和系统。在许多可能的实施例之一中，队列管理系统包括多个队列，并且优先级模块被配置为基于与进入的分组相关联的优先级将输入分组分配给队列。优先级模块还被配置为丢弃已经包含在队列中的分组中的至少一个。优先级模块被配置为在确定队列中包含哪些数据包丢弃时跨多个队列进行操作。一些实施例提供考虑分组的类和优先级的混合队列管理。

3. 发明授权

US08139504B2 System, device, and method for unifying differently-routed networks using virtual topology representations 有权
标题翻译：使用虚拟拓扑表示统一不同路由网络的系统，设备和方法
公开(公告)号：US08139504B2
公开(公告)日：2012-03-20
申请号：US12419543
申请日：2009-04-07
申请人： David Patrick Mankins , Gregory D. Troxel , Karen Z. Haigh
发明人： David Patrick Mankins , Gregory D. Troxel , Karen Z. Haigh
IPC分类号： H04L12/28
CPC分类号： H04W40/26 , H04L45/52
摘要： Systems, devices, and methods for routing data through a first and a second ad-hoc network are described. Routing information structured according to a first routing protocol associated with a plurality of nodes in the first network is received at a border node that is part of at least the first and second ad-hoc networks. Routing information structured according to a second routing protocol associated with a plurality of nodes in the second ad-hoc network is also received. The received routing information is translated from the first routing protocol to the second routing protocol, or vice versa, and disseminated to nodes in the first or second ad-hoc networks. Data packets from nodes in the first ad-hoc network are forwarded to nodes in the second ad-hoc network, or vice versa, based in part on the translated routing information.
摘要翻译：描述了通过第一和第二自组织网络路由数据的系统，设备和方法。根据与第一网络中的多个节点相关联的第一路由协议结构化的路由信息在至少第一和第二自组织网络的一部分的边界节点处被接收。还接收根据与第二自组织网络中的多个节点相关联的第二路由协议而构造的路由信息。所接收的路由信息从第一路由协议转换到第二路由协议，反之亦然，并传播到第一或第二自组织网络中的节点。部分地基于经翻译的路由信息，将来自第一自组织网络中的节点的数据分组转发到第二自组织网络中的节点，反之亦然。

4. 发明申请

US20120163230A1 VARIABLE TRANSLUCENCY NO-SIGHT ROUTING FOR AD-HOC NETWORKS 有权
标题翻译：用于AD-HOC网络的可变的无差错无线路由
公开(公告)号：US20120163230A1
公开(公告)日：2012-06-28
申请号：US13413434
申请日：2012-03-06
申请人： Gregory D. Troxel , Subramanian Ramanathan
发明人： Gregory D. Troxel , Subramanian Ramanathan
IPC分类号： H04L12/56 , H04L12/26
CPC分类号： H04W40/12 , H04L41/0896 , H04L45/00 , H04L45/123 , H04L45/24 , H04L47/2441 , H04L47/286
摘要： A system comprising a plurality of nodes forming a network and a link-state packet capable of being transmitted by a source node in the network to a destination node in the network over a communication link; wherein the source node subtracts a transmission cost associated with the communication link from a time-to-live value associated with the link-state packet prior to transmitting the link-state packet to the destination node. Each node in the network may be configured to use a routing protocol, such as a no-sight routing protocol, to assign the transmission cost to the communication link.
摘要翻译：一种系统，包括形成网络的多个节点和能够由所述网络中的源节点通过通信链路在所述网络中的目的地节点发送的链路状态分组; 其中所述源节点在将所述链路状态分组发送到所述目的地节点之前，从与所述链路状态分组相关联的生存时间值减去与所述通信链路相关联的传输成本。网络中的每个节点可以被配置为使用诸如无线路由协议的路由协议来为通信链路分配传输成本。

5. 发明申请

US20100322240A1 NO-SIGHT ROUTING FOR AD-HOC NETWORKS 有权
标题翻译：不寻常路由的AD-HOC网络
公开(公告)号：US20100322240A1
公开(公告)日：2010-12-23
申请号：US12821662
申请日：2010-06-23
申请人： Gregory D. Troxel , Stephen H. Polit , Subramanian Ramanathan
发明人： Gregory D. Troxel , Stephen H. Polit , Subramanian Ramanathan
IPC分类号： H04L12/28
CPC分类号： H04W8/26 , H04W80/04
摘要： A system comprising a plurality of nodes forming a network, the plurality of nodes comprising source nodes and destination nodes; wherein a propagation limit restricts the travel of link-state information transmitted by the sources nodes to a subset of destination nodes within the network. A network-layer protocol provided at a layer above that of the network facilitates communication between nodes within and outside of this subset of nodes.
摘要翻译：一种包括形成网络的多个节点的系统，所述多个节点包括源节点和目的节点; 其中传播限制限制由源节点发送的链路状态信息到网络内的目的地节点的子集的传播。在网络层以上的层提供的网络层协议便于在该节点子集内部和外部的节点之间的通信。

6. 发明申请

US20100254309A1 SYSTEM, DEVICE, AND METHOD FOR UNIFYING DIFFERENTLY-ROUTED NETWORKS USING VIRTUAL TOPOLOGY REPRESENTATIONS 有权
标题翻译：使用虚拟拓扑表示来统一不同路由网络的系统，设备和方法
公开(公告)号：US20100254309A1
公开(公告)日：2010-10-07
申请号：US12419543
申请日：2009-04-07
申请人： David Patrick Mankins , Gregory D. Troxel , Karen Z. Haigh
发明人： David Patrick Mankins , Gregory D. Troxel , Karen Z. Haigh
IPC分类号： H04W40/02 , H04L12/56
CPC分类号： H04W40/26 , H04L45/52
摘要： Systems, devices, and methods for routing data through a first and a second ad-hoc network are described. Routing information structured according to a first routing protocol associated with a plurality of nodes in the first network is received at a border node that is part of at least the first and second ad-hoc networks. Routing information structured according to a second routing protocol associated with a plurality of nodes in the second ad-hoc network is also received. The received routing information is translated from the first routing protocol to the second routing protocol, or vice versa, and disseminated to nodes in the first or second ad-hoc networks. Data packets from nodes in the first ad-hoc network are forwarded to nodes in the second ad-hoc network, or vice versa, based in part on the translated routing information.
摘要翻译：描述了通过第一和第二自组织网络路由数据的系统，设备和方法。根据与第一网络中的多个节点相关联的第一路由协议结构化的路由信息在至少第一和第二自组织网络的一部分的边界节点处被接收。还接收根据与第二自组织网络中的多个节点相关联的第二路由协议而构造的路由信息。所接收的路由信息从第一路由协议转换到第二路由协议，反之亦然，并传播到第一或第二自组织网络中的节点。部分地基于经翻译的路由信息，将来自第一自组织网络中的节点的数据分组转发到第二自组织网络中的节点，反之亦然。

7. 发明授权

US06185210B2 Virtual circuit management for multi-point delivery in a network system 失效
标题翻译：用于网络系统中多点传送的虚拟电路管理
公开(公告)号：US06185210B2
公开(公告)日：2001-02-06
申请号：US08940666
申请日：1997-09-30
申请人： Gregory D. Troxel
发明人： Gregory D. Troxel
IPC分类号： H04L1228
CPC分类号： H04Q11/0478 , H04L2012/5636 , H04L2012/5642 , H04L2012/5667
摘要： A system and method for optimizing and managing Qos (Quality of Service) in a network system including a plurality of open point-to-multipoint virtual circuits (VC)s between various endpoint sites, for example in multicast systems. VC optimization includes determining more appropriate set of VC endpoints to reduce oversent data. If below the VC limit, a set of potential VCs is determined, the set excluding combinations with VC connections already open. An estimation or calculation is performed to determined a reduction in oversent data that would occur if that a possible VC was opened. The possible VC with the greatest reduction in oversent data is then opened. Appropriate traffic is moved over to the newly opened VC, and any VCs which no longer have any traffic are closed. If a VC limit is reached for a node, a different optimization technique is used. A set of possible VCs to endpoint sites is determined. From this set, a new VC to open is selected which, if opened, would cause the greatest reduction in oversent data. From the presently opened VCs, an open VC is selected which, if closed, would cause the least increase in oversent data. The new VC is opened, and appropriate traffic and flows are moved to it. The open (old) VC is then closed. These optimization techniques are alternated with other optimization techniques.
摘要翻译：一种用于优化和管理包括各种端点站点之间的多个开放点对多点虚拟电路（VC）的网络系统中的Qos（服务质量）的系统和方法，例如在多播系统中。 VC优化包括确定更合适的一组VC端点以减少超量数据。如果低于VC限制，则确定一组潜在的VC，不包括与VC连接的组合的集合已经打开。执行估计或计算以确定如果可能的VC被打开将发生的超量数据的减少。然后打开最大减少数据的可能的VC。适当的流量被移动到新打开的VC，并且任何不再具有流量的VC都关闭。如果节点达到VC限制，则使用不同的优化技术。确定一组可能的端到端点的VC。从这个集合中，选择一个新的VC来打开，如果打开，将导致超量数据的最大减少。从目前开放的VC，选择一个开放的VC，如果关闭，将导致超量数据的最小增加。新的VC被打开，适当的流量和流量被移动到它。然后打开（旧）VC。这些优化技术与其他优化技术交替。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式