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

1. 发明授权

US06714541B1 Method and apparatus for encoding bridging/switching information within a routing information filed in a token ring environment 有权
标题翻译：在令牌环环境中的路由信息字段内编码桥接/交换信息的方法和装置
公开(公告)号：US06714541B1
公开(公告)日：2004-03-30
申请号：US09371672
申请日：1999-08-10
申请人： Jayaraman Iyer , Kushal A. Patel
发明人： Jayaraman Iyer , Kushal A. Patel
IPC分类号： H04L1228
CPC分类号： H04L45/00
摘要： A technique increases the efficiency of functions performed by an intermediate device of a computer network by encoding a portion of a routing information field (RIF) of a token ring frame transported over the network with information for use by the device. The maximum number of route descriptor (RD) hops in the network is altered to provide a predetermined portion of the RIF for storing encoded information. Each intermediate device configured in accordance with the technique identifies this predetermined portion as that portion of the RIF immediately following its matching RD.
摘要翻译：一种技术通过对通过网络传送的令牌环帧的路由信息字段（RIF）的一部分进行编码，由设备使用的信息来提高由计算机网络的中间设备执行的功能的效率。改变网络中路由描述符（RD）跳数的最大数量，以提供用于存储编码信息的RIF的预定部分。根据该技术配置的每个中间设备将该预定部分识别为其匹配RD之后的RIF的那部分。

2. 发明授权

US07440756B1 Controlling micro-roaming in a wireless LAN 有权
标题翻译：控制无线局域网中的微漫游
公开(公告)号：US07440756B1
公开(公告)日：2008-10-21
申请号：US10853994
申请日：2004-05-21
申请人： Huizhao Wang , Xiaode Xu , Wenfeng Huang , Kushal A. Patel
发明人： Huizhao Wang , Xiaode Xu , Wenfeng Huang , Kushal A. Patel
IPC分类号： H04Q7/20 , H04B7/00
CPC分类号： H04W48/20 , H04B17/27 , H04B17/318 , H04W36/08 , H04W36/38 , H04W60/00
摘要： The present invention detects a micro-roaming client in a WLAN. Once a micro-roaming client is detected, APs coordinate with each other and assign the client to a specific AP. In an embodiment, a user-configurable anchor timer for micro-roaming clients is provided, so that when the timer has expired, the client is free to roam within the overlapping cell until it becomes anchored to an AP again. In various embodiments, environmental variables can affect APs to release an anchored client to roam again. These environmental variables may include low RSSI from the client, a high percentage of frame loss to the client, or a low data rate. The present invention also provides a new protocol that is resilient and self-sustaining with minimal user configuration required.
摘要翻译：本发明检测WLAN中的微漫游客户机。一旦检测到微型漫游客户端，AP就相互协调，并将客户端分配给特定的AP。在一个实施例中，提供了用于微漫游客户端的用户可配置的定时器，使得当定时器已经到期时，客户端可以在重叠小区内漫游，直到其再次锚定到AP。在各种实施例中，环境变量可影响AP以释放锚定的客户端再次漫游。这些环境变量可以包括来自客户端的低RSSI，对客户端的高百分比的帧丢失或低数据速率。本发明还提供了一种新的协议，其具有弹性和自我维持，并且需要最少的用户配置。

3. 发明授权

US07602716B1 Load sharing on DOCSIS 有权
标题翻译： DOCSIS上的负载共享
公开(公告)号：US07602716B1
公开(公告)日：2009-10-13
申请号：US10028069
申请日：2001-12-20
申请人： Arunkumar B. Thippeswamy , Kushal A. Patel
发明人： Arunkumar B. Thippeswamy , Kushal A. Patel
IPC分类号： G01R31/08
CPC分类号： H04L47/10 , H04L12/2801 , H04L47/125 , H04L47/2441
摘要： Methods and apparatus for efficiently distributing traffic on available best-effort service flows within a system are disclosed. According to one aspect of the present invention, a method for forwarding a packet which includes destination information and source information upstream from a source to a destination includes determining a first value associated with the packet using the destination information and the source information. A first service flow that is suitable for use to forward the packet is identified using the first value. The first service flow is one of a set of service flows between a source and a central access point. Once the first service flow is identified, the packet is sent on the first service flow. In one embodiment, the source is a subscriber unit and the central access point is a headend.
摘要翻译：公开了一种用于在系统内有效地分配可用尽力服务流的流量的方法和装置。根据本发明的一个方面，一种用于将包含目的地信息和从源的上游的源信息转发到目的地的分组的方法包括使用目的地信息和源信息来确定与分组相关联的第一值。使用第一个值识别适合用于转发数据包的第一个服务流。第一个服务流是源和中央接入点之间的一组服务流之一。一旦识别出第一个服务流，就在第一个服务流上发送数据包。在一个实施例中，源是用户单元，并且中央接入点是前端。

4. 发明授权

US6023733A Efficient path determination in a routed network 失效
标题翻译：路由网络中的高效路径确定
公开(公告)号：US6023733A
公开(公告)日：2000-02-08
申请号：US961355
申请日：1997-10-30
申请人： Ravi Periasamy , Gnanaprakasam Pandian , Frank Gerard Bordonaro , Ramin Naderi , Kushal A. Patel
发明人： Ravi Periasamy , Gnanaprakasam Pandian , Frank Gerard Bordonaro , Ramin Naderi , Kushal A. Patel
IPC分类号： H04L12/56 , G06F13/00
CPC分类号： H04L45/00 , H04L45/12 , H04L45/54 , H04L47/10 , H04L47/125
摘要： The topology of a computer network is represented, for each routing device in the network, as a tree structure with the root of the tree designating the particular routing device. Tree nodes represent LANs, while arcs connecting the nodes represent other routing devices. Thus, the number of first-level links to children off the root is equal to the number of LANs connected to the source routing device, and those first-level links point to nodes representing the LANs (or LAN segments) directly connected to the source routing device. As a result of this representation, each routing device can store a representation of the entire network adequate to facilitate routing, but with much less memory utilization than a list of addresses. Furthermore, because the network is represented at a more general level than that of individual station addresses, changes to the topology of the network can be readily introduced without the need for extensive (e.g., address by address) reconfiguration.
摘要翻译：对于网络中的每个路由设备，计算机网络的拓扑被表示为具有指定特定路由设备的树的根的树结构。树节点表示LAN，而连接节点的弧表示其他路由设备。因此，到根之外的儿童的第一级链接的数量等于连接到源路由设备的LAN的数量，并且那些一级链路指向代表直接连接到源的LAN（或LAN段）的节点路由设备作为该表示的结果，每个路由设备可以存储足够的路由的整个网络的表示，但是比地址列表少得多的存储器利用。此外，因为网络被表示在比单个站地址更一般的级别，所以可以容易地引入对网络拓扑的改变，而不需要广泛的（例如，通过地址的地址）重新配置。

5. 发明授权

US06134690A Computerized automation system and method 失效
标题翻译：电脑自动化系统及方法
公开(公告)号：US06134690A
公开(公告)日：2000-10-17
申请号：US104922
申请日：1998-06-25
申请人： Devi Prasad Ivaturi , Kushal A. Patel
发明人： Devi Prasad Ivaturi , Kushal A. Patel
IPC分类号： G06F11/273 , H04L12/26 , G01R31/28
CPC分类号： G06F11/2294 , H04L12/2697 , H04L43/50
摘要： Computerized system and method are provided which have particular utility in the field of automated testing. In one embodiment of the method of the present invention, an array is stored in computer-readable memory. The array has a plurality of tuples, each of which includes a respective action field, a respective expected result field, a respective success field, and a respective failure field. The respective action field is for specifying at least one respective action whose performance by the system-under-test is to be commanded. The respective reaction field is for specifying at least one respective expected result to be achieved by performance of the respective action. The respective success and failures fields are for specifying further appropriate actions to be executed if the respective expected result is achieved (i.e., if a success condition occurs), or if the respective expected result is not achieved (i.e., if a failure condition occurs). A processor generates a command to the system-under-test to perform the action specified by the action field of a beginning tuple. The processor then receives an indication of an actual result of execution of the command by system-under-test, and compares this actual result to the expected result specified in the reaction field of the beginning tuple in order to determine whether a success or failure condition has occurred. Based upon whether a success or failure condition is determined by the processor to have occurred, the further action specified in the success or failure fields is executed.
摘要翻译：提供了在自动化测试领域具有特殊用途的计算机化系统和方法。在本发明的方法的一个实施例中，阵列存储在计算机可读存储器中。阵列具有多个元组，每个元组包括相应的动作字段，相应的预期结果字段，相应的成功字段和相应的故障字段。相应的动作字段用于指定要被命令的被测系统的性能的至少一个相应动作。相应的反应场用于指定通过执行相应动作来实现的至少一个相应的预期结果。相应的成功和失败领域是用于指定如果实现相应的预期结果（即，如果发生成功条件）要执行的进一步适当的动作，或者如果没有实现相应的预期结果（即，如果发生故障条件）。一个处理器生成一个命令到被测系统，以执行一个起始元组的动作字段指定的动作。然后，处理器通过系统测试接收指令的实际执行结果的指示，并将该实际结果与起始元组的反应字段中指定的预期结果进行比较，以便确定成功或失败条件已经发生了。基于处理器是否确定发生成功或失败的情况，执行在成功或失败字段中指定的进一步的动作。

6. 发明授权

US5991302A Technique for maintaining prioritization of data transferred among heterogeneous nodes of a computer network 失效
标题翻译：保持在计算机网络的异构节点之间传输的数据的优先级的技术
公开(公告)号：US5991302A
公开(公告)日：1999-11-23
申请号：US839435
申请日：1997-04-10
申请人： Steven H. Berl , Kushal A. Patel
发明人： Steven H. Berl , Kushal A. Patel
IPC分类号： H04L12/56 , H04L12/48
CPC分类号： H04L47/10
摘要： A technique maintains priority of packets transmitted over a heterogeneous network by a hybrid node coupled to the network. The hybrid node assigns each packet a transmission priority (TP) level as it traverses protocol layers of a communications stack of the node. An application programming interface extension provides a tagging mechanism for conveying the TP levels from higher protocol layers of the stack to lower layers. The TP levels are then converted to information that is "tagged" to the packets and these tagged packets are then apportioned among a plurality of communication sessions based on the TP level assigned to each packet. The tagged packets and their associated sessions preserve the priority and order of the packets across the heterogeneous network.
摘要翻译：一种技术通过耦合到网络的混合节点来保持通过异构网络传输的分组的优先级。混合节点在穿过节点的通信堆栈的协议层时，为每个分组分配传输优先级（TP）级别。应用编程接口扩展提供了一种标记机制，用于将TP级从堆栈的较高协议层传送到较低层。然后将TP级别转换为对数据包进行“标记”的信息，然后根据分配给每个数据包的TP级别，在多个通信会话之间分配这些标记的数据包。标记的数据包及其关联的会话保留跨异构网络的数据包的优先级和顺序。

7. 发明授权

US6065062A Backup peer pool for a routed computer network 失效
标题翻译：路由计算机网络的备份对等池
公开(公告)号：US6065062A
公开(公告)日：2000-05-16
申请号：US987899
申请日：1997-12-10
申请人： Ravi Periasamy , Wayne Clark , Frank Bordonaro , Ramin Naderi , Kushal A. Patel
发明人： Ravi Periasamy , Wayne Clark , Frank Bordonaro , Ramin Naderi , Kushal A. Patel
IPC分类号： H04L12/46 , H04L12/56 , H04L29/14 , G06F15/173
CPC分类号： H04L45/00 , H04L12/462 , H04L45/58 , H04L69/40
摘要： Backup peers in an asymmetrically organized computer network are organized into a "pool" of available devices that are activated as necessary. The network comprises a set of remote peers and a set of local peers directly associated with a central computational facility, the local peers facilitating connection between the remote peers and the central facility. During the capabilities exchange, the "primary" local peer to which the remote peer connects provides a list of backup peer devices to the remote peer. If the primary peer fails (or if the rate of message exchange falls below some predetermined threshold), the remote peer can use the backup information to access a backup peer from the pool. The invention allows each backup peer to be assigned to multiple remote peers, with the total number of backup peers determined by aggregate backup utilization (rather than simply assigning an individual backup peer to each primary peer regardless of whether such a high level of redundancy is justified).
摘要翻译：在不对称组织的计算机网络中的备份对等体被组织成根据需要被激活的可用设备的“池”。该网络包括一组远程对等体和一组直接与中央计算设备相关联的本地对等体，本地对等体有助于远程对等体与中央设施之间的连接。在能力交换过程中，远程对等体连接的“主”本地对等体向远程对等体提供备份对等体设备的列表。如果主对等体失败（或者如果消息交换速率低于某个预定阈值），则远程对等体可以使用备份信息来访问池中的备份对等体。本发明允许将每个备份对等体分配给多个远程对等体，其中备份对等体的总数由聚合备份利用率确定（而不是简单地将各个备份对等体分配给每个主对等体，而不管这样高的冗余级别是否合理）。

8. 发明授权

US5307485A Method and apparatus for merging sorted lists in a multiprocessor shared memory system 失效
标题翻译：用于在多处理器共享存储器系统中合并排序列表的方法和装置
公开(公告)号：US5307485A
公开(公告)日：1994-04-26
申请号：US708610
申请日：1991-05-31
申请人： Frank G. Bordonaro , Glen A. Brent , Roger J. Edwards , Joel Goldman , David B. Lindquist , Kushal A. Patel , Peyton R. Williams, Jr.
发明人： Frank G. Bordonaro , Glen A. Brent , Roger J. Edwards , Joel Goldman , David B. Lindquist , Kushal A. Patel , Peyton R. Williams, Jr.
IPC分类号： G06F9/46 , G06F7/24 , G06F7/32 , G06F7/36 , G06F9/50 , G06F12/00 , G06F15/16 , G06F15/177 , G06F17/30 , G06F7/16
CPC分类号： G06F7/32 , Y10S707/99937
摘要： A system and method for merging a plurality of sorted lists using multiple processors having access to a common memory in which N sorted lists which may exceed the capacity of the common memory are merged in a parallel environment. Sorted lists from a storage device are loaded into common memory and are divided into a number of tasks equal to the number of available processors. The records assigned to each task are separately sorted, and used to form a single sorted list. A multi-processing environment takes advantage of its organization during the creation of the tasks, as well as during the actual sorting of the tasks.
摘要翻译：一种用于使用具有访问公共存储器的多个处理器来合并多个排序列表的系统和方法，其中可以超过公共存储器的容量的N个排序列表在并行环境中合并。来自存储设备的排序列表被加载到公共存储器中，并且被划分成等于可用处理器数量的多个任务。分配给每个任务的记录被分开排序，并用于形成单个排序列表。多任务处理环境在创建任务期间以及在实际排序任务期间利用其组织。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式