-
公开(公告)号：US20110066753A1
公开(公告)日：2011-03-17
申请号：US12719822
申请日：2010-03-08
申请人： Sheng-Yih Wang , Lok Yan Hui , Sanjay Khanna , Ivy Pei-Shan Hsu
发明人： Sheng-Yih Wang , Lok Yan Hui , Sanjay Khanna , Ivy Pei-Shan Hsu
IPC分类号： G06F15/173
CPC分类号： H04L45/42 , H04L45/586 , H04L45/66
摘要： A solution for virtual router redundancy for server virtualization includes, at a network device configured as a backup router of a virtual router, examining a packet stored in a memory of the network device. Responsive to the examining, the network device determines whether to forward the packet via a network towards a destination or to send the packet via the network to a master router of the virtual router for forwarding of the packet, by the master router, towards the destination.
摘要翻译： 用于服务器虚拟化的虚拟路由器冗余的解决方案包括在配置为虚拟路由器的备份路由器的网络设备上，检查存储在网络设备的存储器中的分组。 响应于检查，网络设备确定是否经由网络朝向目的地转发分组，或者经由网络将分组发送到虚拟路由器的主路由器，以通过主路由器向目的地转发分组 。
-
公开(公告)号：US20070233867A1
公开(公告)日：2007-10-04
申请号：US11393375
申请日：2006-03-28
IPC分类号： G06F15/173
CPC分类号： H04L29/12839 , H04L61/6022 , H04L69/40
摘要： An example network node includes multiple line cards that learn Medium Access Control (MAC) addresses in a distributed manner. In an event a software upgrade is to occur, which requires a processor having the MAC addresses on the line cards to reboot, the line cards transfer the learned MAC addresses to a supervisory control card that normally does not know the MAC addresses. After the reboot, the line cards retrieve the MAC addresses, saving the line cards from having to relearn the MAC addresses.
摘要翻译： 示例性网络节点包括以分布式方式学习媒体访问控制（MAC）地址的多个线路卡。 在发生软件升级的情况下，这需要具有线卡上的MAC地址的处理器重新启动，线路卡将学习的MAC地址传送到通常不知道MAC地址的监控卡。 重新启动后，线路卡检索MAC地址，保存线路卡不必重新学习MAC地址。
-
3.发明授权Technique for serializing data structure updates and retrievals without requiring searchers to use locks 有权用于序列化数据结构更新和检索的技术，而不需要搜索者使用锁公开(公告)号：US06868414B2
公开(公告)日：2005-03-15
申请号：US09753992
申请日：2001-01-03
申请人： Sanjay Khanna , Lori Ann Napoli
发明人： Sanjay Khanna , Lori Ann Napoli
IPC分类号： G06F17/30
CPC分类号： G06F17/30961 , G06F17/30348 , Y10S707/99932 , Y10S707/99933 , Y10S707/99938 , Y10S707/99952
摘要： The present invention provides a method, system, and computer program product for reliably and efficiently serializing access to data structures (i.e. updates and retrievals) without requiring searchers to use locks. The disclosed technique ensures that the contents of the data structure remain valid during access operations, yet does not require searchers to perform compute-intensive comparison operations to determine validity. Two trees are used at all times. Searches proceed against a first tree, while the second tree is used for performing updates. The steps required to carry out a particular update operation are stored as a queued transaction. When the update to the second tree completes, the trees are switched. The queued transaction is applied to the now-out-of-date tree, such that the nodes of this tree do not need to be searched or otherwise evaluated in order to perform the update, thereby optimizing the process of bringing this tree into synchronization with the tree that is now being used by the searchers. The two trees are repeatedly switched as additional update operations are performed. Atomic operations are used to ensure proper synchronization between the search and update processing on the trees.
摘要翻译： 本发明提供了一种方法，系统和计算机程序产品，用于可靠且有效地序列化对数据结构（即更新和检索）的访问，而不需要搜索者使用锁。 所公开的技术确保数据结构的内容在访问操作期间保持有效，但不要求搜索者执行计算密集型比较操作以确定有效性。 任何时候都会使用两棵树。 对第一棵树进行搜索，而第二棵树用于执行更新。 执行特定更新操作所需的步骤被存储为排队的事务。 当第二棵树的更新完成时，树被切换。 排队的事务应用于现在最新的树，使得不需要搜索或另外评估此树的节点以执行更新，从而优化将该树与...同步的过程 搜索者正在使用的树。 当执行附加的更新操作时，两个树被重复地切换。 原子操作用于确保树上的搜索和更新处理之间的正确同步。
-
公开(公告)号：US08547844B2
公开(公告)日：2013-10-01
申请号：US11775422
申请日：2007-07-10
CPC分类号： H04L45/28 , H04L45/02 , H04L45/586 , H04L47/10 , H04L47/125
摘要： A method and system are disclosed for distributing load in a network. A set of routers are configured for providing IP gateway services to a set of hosts where each router in the set of routers all back up all the other routers in the same set. Each router in the set utilizes identical load distribution policies, load distribution properties and load distribution arrangement. A Load Distribution Function (LDF) master router is determined for the set of routers, wherein each one of the set of routers is a backup for the LDF master router. Every router in the set of routers utilize the same algorithm to compute load distribution and the LDF master router provides balancing information to all the other routers by including that information in VRRP advertisement messages to all the routers.
摘要翻译： 公开了一种在网络中分配负载的方法和系统。 一组路由器被配置为向一组主机提供IP网关服务，其中路由器集合中的每个路由器都备份同一集合中的所有其他路由器。 集合中的每个路由器都使用相同的负载分配策略，负载分配属性和负载分配布置。 确定路由器集合的负载分配功能（LDF）主路由器，其中路由器集合中的每一个都是LDF主路由器的备份。 路由器集合中的每个路由器都使用相同的算法来计算负载分配，LDF主路由器通过将VRRP广播消息中的信息包含在所有路由器中，向所有其他路由器提供平衡信息。
-
公开(公告)号：US07639685B2
公开(公告)日：2009-12-29
申请号：US11603932
申请日：2006-11-22
CPC分类号： H04L12/18
摘要： A method or corresponding apparatus in an exemplary embodiment of the present invention determines how many copies of a multicast packet are to be sent, as copies, to multiple destinations based on information in the multicast packet and a group (e.g., bridge node) with which the packet is associated. The copies of the multicast packets are then generated. After generating the copies, an action to take for each copy is determined. This determination is made using the information in the multicast packet and based on the group with which the packet is associated. After the action is determined for each copy, the action is performed on each copy. Through use of an embodiment of the present invention, memory space is conserved, allowing for continued use of a device in a multicast environment of an ever growing network, such as the Internet.
摘要翻译： 本发明的示例性实施例中的方法或对应装置根据多播分组中的信息和一组（例如，桥节点）来确定多少复制将作为副本发送到多个目的地， 该数据包被关联。 然后生成多播数据包的副本。 生成副本后，确定每个副本的动作。 使用多播分组中的信息并且基于与分组相关联的组来进行该确定。 在为每个副本确定操作后，将对每个副本执行操作。 通过使用本发明的实施例，保存存储器空间，允许在诸如因特网的不断增长的网络的多播环境中继续使用设备。
-
公开(公告)号：US20090016215A1
公开(公告)日：2009-01-15
申请号：US11775422
申请日：2007-07-10
IPC分类号： H04L12/56
CPC分类号： H04L45/28 , H04L45/02 , H04L45/586 , H04L47/10 , H04L47/125
摘要： A method and system are disclosed for distributing load in a network. A set of routers are configured for providing IP gateway services to a set of hosts where each router in the set of routers all back up all the other routers in the same set. Each router in the set utilizes identical load distribution policies, load distribution properties and load distribution arrangement. A Load Distribution Function (LDF) master router is determined for the set of routers, wherein each one of the set of routers is a backup for the LDF master router. Every router in the set of routers utilize the same algorithm to compute load distribution and the LDF master router provides balancing information to all the other routers by including that information in VRRP advertisement messages to all the routers.
摘要翻译： 公开了一种在网络中分配负载的方法和系统。 一组路由器被配置为向一组主机提供IP网关服务，其中路由器集合中的每个路由器都备份同一集合中的所有其他路由器。 集合中的每个路由器都使用相同的负载分配策略，负载分配属性和负载分配布置。 确定路由器集合的负载分配功能（LDF）主路由器，其中路由器集合中的每一个都是LDF主路由器的备份。 路由器集合中的每个路由器都使用相同的算法来计算负载分配，LDF主路由器通过将VRRP广播消息中的信息包含在所有路由器中，向所有其他路由器提供平衡信息。
-
公开(公告)号：US20070133532A1
公开(公告)日：2007-06-14
申请号：US11603932
申请日：2006-11-22
CPC分类号： H04L12/18
摘要： A method or corresponding apparatus in an exemplary embodiment of the present invention determines how many copies of a multicast packet are to be sent, as copies, to multiple destinations based on information in the multicast packet and a group (e.g., bridge node) with which the packet is associated. The copies of the multicast packets are then generated. After generating the copies, an action to take for each copy is determined. This determination is made using the information in the multicast packet and based on the group with which the packet is associated. After the action is determined for each copy, the action is performed on each copy. Through use of an embodiment of the present invention, memory space is conserved, allowing for continued use of a device in a multicast environment of an ever growing network, such as the Internet.
摘要翻译： 本发明的示例性实施例中的方法或对应装置根据多播分组中的信息和一组（例如，桥节点）来确定多少复制将作为副本发送到多个目的地， 该数据包被关联。 然后生成多播数据包的副本。 生成副本后，确定每个副本的动作。 使用多播分组中的信息并且基于与分组相关联的组进行该确定。 在为每个副本确定操作后，将对每个副本执行操作。 通过使用本发明的实施例，保存存储器空间，允许在诸如因特网的不断增长的网络的多播环境中继续使用设备。
-
公开(公告)号：US07852754B2
公开(公告)日：2010-12-14
申请号：US11413135
申请日：2006-04-27
IPC分类号： G01R31/08
CPC分类号： H04L12/66 , H04J3/14 , H04L41/0654 , H04L43/0811
摘要： A method of managing faults in a ring network may include configuring a ring network to be in a “horseshoe” topology by disabling a communications link from distributing media between a selected pair of adjacent nodes while allowing other communications or non-related media to continue to be distributed via the adjacent nodes. In the event of a failure, the disabled communications path may be re-enabled, and first or second backup communications paths may be employed, where the first backup communications path may use primary connections between adjacent nodes used for primary communications paths normally used to carry the media, and the second backup communications paths may use secondary connections between non-adjacent nodes. The disabled communications path may be dynamically moved in a logical or physical manner in an event of a communications link or node failure to maintain a “horseshoe” topology in the ring network.
摘要翻译： 管理环网络中的故障的方法可以包括通过禁止通信链路在选定的一对相邻节点之间分配媒体来配置环形网络处于“马掌”拓扑中，同时允许其他通信或非相关媒体继续 通过相邻节点分发。 在发生故障的情况下，可以重新启用禁用的通信路径，并且可以采用第一或第二备用通信路径，其中第一备份通信路径可以使用用于通常用于携带的主通信路径的相邻节点之间的主连接 媒体和第二备份通信路径可以使用非相邻节点之间的辅助连接。 在通信链路或节点故障的情况下，残疾通信路径可以以逻辑或物理方式动态移动，以在环网中维护“马蹄形”拓扑。
-
公开(公告)号：US20080010237A1
公开(公告)日：2008-01-10
申请号：US11428973
申请日：2006-07-06
申请人： Arumugam V. SUDHAKAR , Nalin Negi , Charu Mital , Sanjay Khanna
发明人： Arumugam V. SUDHAKAR , Nalin Negi , Charu Mital , Sanjay Khanna
IPC分类号： G06F17/30
CPC分类号： G06F16/2264 , G06F16/2457
摘要： The present invention provides a system, method and computer program product for managing multi-dimensional data. The management of the multi-dimensional data includes generating policy-compliant journal and accounting entries by processing the data segments of the multi-dimensional data. One or more data segments in the multi-dimensional data are assigned one or more keywords by a user. The keywords are combined with arithmetic operators to generate rules, based on predefined compliance policies. The rules are operated to generate one or more data outputs. These data outputs are posted as journal and accounting entries to a ledger.
摘要翻译： 本发明提供一种用于管理多维数据的系统，方法和计算机程序产品。 多维数据的管理包括通过处理多维数据的数据段来生成符合策略的日志和记帐条目。 多维数据中的一个或多个数据段由用户分配一个或多个关键字。 这些关键字与算术运算符组合，以根据预定义的合规策略生成规则。 操作规则以产生一个或多个数据输出。 这些数据输出作为日记账和会计记录发布到分类账。
-
公开(公告)号：US20070253438A1
公开(公告)日：2007-11-01
申请号：US11413409
申请日：2006-04-28
申请人： David Curry , Robert Colvin , Samer Nubani , Ravindra Sunkad , Man-Tung Hsiao , Paul Hallinan , Rishi Mehta , Sanjay Khanna
发明人： David Curry , Robert Colvin , Samer Nubani , Ravindra Sunkad , Man-Tung Hsiao , Paul Hallinan , Rishi Mehta , Sanjay Khanna
CPC分类号： H04L47/624 , H04L47/10 , H04L47/2408 , H04L47/2441 , H04L47/31 , H04L47/60 , H04L47/621 , H04L49/90
摘要： Differentiated services for network traffic using weighted quality of service is provided. Network traffic is queued into separate per flow queues, and traffic is scheduled from the per flow queues into a group queue. Congestion management is performed on traffic in the group queue. Traffic is marked with priority values, and congestion management is performed based on the priority values. For example, traffic can be marked as “in contract” if it is within a contractual limit, and marked as “out of contract” if it is not within the contractual limit. Marking can also include classifying incoming traffic based on Differentiated Service Code Point. Higher priority traffic can be scheduled from the per flow queues in a strict priority over lower priority traffic. The lower priority traffic can be scheduled in a round robin manner.
摘要翻译： 提供了使用加权质量服务的网络流量差异化服务。 网络流量排队到每个流队列中，流量从每个流队列调度到组队列中。 对组队列中的流量执行拥塞管理。 流量被标记为优先级值，并根据优先级值进行拥塞管理。 例如，如果交易在契约限制范围内，则可以将其标记为“合同”，如果不在合同限制范围内，则标记为“合同”。 标记还可以包括基于差分服务代码点对传入流量进行分类。 可以将优先级较高的流量从严格优先级的每个流队列调度为优先级较低的流量。 较低优先级的流量可以轮循方式进行调度。
-
-
-
-
-
-
-
-
-
搜索结果
21 条记录 (耗时 0.014 秒)
