-
11.发明授权公开(公告)号：US07710953B2
公开(公告)日：2010-05-04
申请号：US11693825
申请日：2007-03-30
CPC分类号： H04L49/254 , H04L47/50 , H04L47/564 , H04L49/3045
摘要： The invention includes an apparatus and method for switching packets through a switching fabric. The apparatus includes a plurality of input ports and output ports for receiving arriving packets and transmitting departing packets, a switching fabric for switching packets from the input ports to the output ports, and a plurality of schedulers controlling switching of packets through the switching fabric. The switching fabric includes a plurality of virtual output queues associated with a respective plurality of input-output port pairs. One of the schedulers is active during each of a plurality of timeslots. The one of the schedulers active during a current timeslot provides a packet schedule to the switching fabric for switching packets through the switching fabric during the current timeslot. The packet schedule is computed by the one of the schedulers active during the current timeslot using packet departure information for packets departing during previous timeslots during which the one of the schedulers was active and packet arrival information for packets arriving during previous timeslots during which the one of the schedulers was active.
摘要翻译： 本发明包括一种用于通过交换结构交换分组的装置和方法。 该装置包括多个输入端口和输出端口，用于接收到达的分组并发送离开的分组，用于将分组从输入端口切换到输出端口的交换结构，以及多个调度器，用于控制通过交换结构的分组交换。 交换结构包括与相应的多个输入 - 输出端口对相关联的多个虚拟输出队列。 其中一个调度器在多个时隙的每一个期间是活动的。 在当前时隙中活动的调度器之一为交换结构提供了一个分组调度，用于在当前时隙内通过交换结构交换数据包。 分组调度由当前时隙中活动的调度器之一使用分组离开信息来计算，所述分组离开信息用于在之前的时隙期间离开的分组离开信息，在该时隙期间，一个调度器处于活动状态，并且分组到达信息用于在之前的时隙期间到达的分组 调度器是活跃的。
-
12.发明授权Connection admission control for bursty real-time traffic in a network with multiple service classes 有权连接准入控制用于具有多个服务类别的网络中的突发实时流量公开(公告)号：US07542416B2
公开(公告)日：2009-06-02
申请号：US10119943
申请日：2002-04-11
CPC分类号： H04L12/5601 , H04L2012/5614 , H04L2012/5629 , H04L2012/5631 , H04L2012/5647 , H04L2012/5649
摘要： The method estimates a capacity requirement as a function of a cell loss ratio (CLR) requirement, estimates a capacity requirement as a function of the a cell delay variation (CDV) requirement, and sets the capacity requirement based on these independent estimates. The capacity requirement is then used to determine connection admission control in the network.
摘要翻译： 该方法根据细胞损失率（CLR）要求估计容量需求，估计作为细胞延迟变化（CDV）要求的函数的容量需求，并根据这些独立估计设置容量需求。 然后使用容量要求来确定网络中的连接准入控制。
-
13.发明授权公开(公告)号：US07158484B1
公开(公告)日：2007-01-02
申请号：US09513325
申请日：2000-02-25
申请人： Walid Ahmed , Hong Jiang , Muralidharan Sampath Kodialam , Pantelis Monogioudis , Kiran M. Rege
发明人： Walid Ahmed , Hong Jiang , Muralidharan Sampath Kodialam , Pantelis Monogioudis , Kiran M. Rege
CPC分类号： H04W72/02 , H04L41/12 , H04W24/00 , H04W36/06 , H04W36/30 , H04W40/24 , H04W48/08 , H04W74/08 , H04W76/10
摘要： A novel topology sensing methodology is provided for point-to-point link setup among a set of network nodes, which are mobile. The technique provided is TDMA contention-based, where each network node sends pilot signals to announce its existence. Pilot signals transmitted by network nodes are used by surrounding nodes to extract various pieces of information such as node identity, node location and potential link quality. Information collected from pilot signals of neighboring nodes is used in conjunction with other topological criteria to identify the best set of nodes with which a given node should establish links. The topology sensing methodology avoids duplexer problems and attempts to achieve minimum collision by allowing the nodes to continually monitor available pilots and transmit on the least-interference channels. The topology sensing methodology can also optionally make use of GPS information, when available, in order to provide an accurate map for communicating nodes and improve the link setup process.
摘要翻译： 提供了一种新颖的拓扑感知方法，用于在一组移动的网络节点之间的点对点链路建立。 所提供的技术是基于TDMA争用的，其中每个网络节点发送导频信号以宣布其存在。 由网络节点传输的导频信号由周边节点用于提取节点标识，节点位置和潜在链路质量等各种信息。 从相邻节点的导频信号收集的信息与其他拓扑标准一起使用，以识别给定节点应建立链路的最佳节点集合。 拓扑感测方法避免了双工器问题，并尝试通过允许节点连续监视可用导频并在最小干扰信道上进行发送来实现最小的冲突。 拓扑感测方法还可以选择性地利用GPS信息，当可用时，为了提供用于通信节点的精确地图并改善链路建立过程。
-
公开(公告)号：US06816460B1
公开(公告)日：2004-11-09
申请号：US09525735
申请日：2000-03-14
IPC分类号： H04L1226
摘要： In an ad-hoc mobile network, a geometry-based routing algorithm (GRA) is used to route traffic from a source node to a destination node. In the GRA, a source node maintains location information and routing information for all nodes in a local area and approximate location information for at least some nodes outside the local area. If the source node has to send a packet to a destination node outside their local area, then the source node uses the approximate location information of the destination node to identify which node in its local area is closer to the destination node than the source node. The source node then sends the packet to the identified local node for further routing.
摘要翻译： 在自组织移动网络中，使用基于几何的路由算法（GRA）将流量从源节点路由到目的地节点。 在GRA中，源节点维护局部区域中的所有节点的位置信息和路由信息，并且对于局部区域之外的至少一些节点近似位置信息。 如果源节点必须向其本地区域之外的目的地节点发送分组，则源节点使用目的地节点的大致位置信息来识别其本地区域中的哪个节点比源节点更靠近目的地节点。 源节点然后将分组发送到标识的本地节点用于进一步路由。
-
公开(公告)号：US06321271B1
公开(公告)日：2001-11-20
申请号：US09218576
申请日：1998-12-22
IPC分类号： G06F15173
CPC分类号： H04Q11/0478 , H04L2012/562 , H04L2012/5623
摘要： A real-time method for routing subject to an acceptable delay constraint between nodes in high-speed data networks, such as PNNI protocol networks, uses an illustrative two-phase algorithm employing Dijkstra's algorithm at each phase. In an illustrative first phase, the Dijkstra SPF algorithm is used in seeking the shortest cumulative delay from the destination to the source, thereby generating cumulative delay labels from a node j to the destination node k. The delay results are then employed in the second phase, where the Dijkstra SPF algorithm is illustratively employed for determining administrative weight (AW) as the link metric subject to modification in accordance with results obtained in the first phase.
摘要翻译： 在诸如PNNI协议网络的高速数据网络中的节点之间接受可接受的延迟约束的实时方法使用在每个阶段采用Dijkstra算法的说明性的两相算法。 在说明性的第一阶段中，Dijkstra SPF算法用于寻找从目的地到源的最短累积延迟，从而从节点j到目的地节点k产生累积延迟标签。 然后在第二阶段采用延迟结果，其中说明性地使用Dijkstra SPF算法来根据第一阶段获得的结果确定管理权重（AW）作为经修改的链路度量。
-
公开(公告)号：US07961731B2
公开(公告)日：2011-06-14
申请号：US11096220
申请日：2005-03-31
IPC分类号： H04L12/28 , G01R31/08 , H04J3/24 , G06F15/173
CPC分类号： H04L63/1408 , H04L43/024
摘要： A method for measuring flow is disclosed. The method includes receiving an IP packet; determining if another IP packet is stored in a register; if another IP packet is stored in the register, comparing the stored IP packet with the received IP packet; and determining the longest match between the stored IP packet and the received IP packet.
摘要翻译： 公开了一种测量流量的方法。 该方法包括：接收IP包; 确定另一个IP包是否存储在一个寄存器中; 如果另一IP分组存储在寄存器中，则将所存储的IP分组与接收的IP分组进行比较; 并确定所存储的IP分组与所接收的IP分组之间的最长匹配。
-
公开(公告)号：US07930547B2
公开(公告)日：2011-04-19
申请号：US11763676
申请日：2007-06-15
IPC分类号： H04L9/32
CPC分类号： H04L45/00 , H04L45/745
摘要： A method and system for generating a bloom filter by mapping into respective groups each of a plurality of initial keys according to a first hash function and mapping each group hashed key into a bloom filter using k respective hash functions.
摘要翻译： 一种用于通过根据第一散列函数映射到多个初始密钥中的每个组并且将每个组映射到相应组中来生成布隆过滤器的方法和系统，其使用k个相应的散列函数将密钥散列到布隆过滤器中。
-
公开(公告)号：US20110029511A1
公开(公告)日：2011-02-03
申请号：US12512702
申请日：2009-07-30
IPC分类号： G06F17/30
CPC分类号： G06F17/30882 , G06F17/30722 , G06F17/30864
摘要： A method, system and apparatus for a assigning keywords to a web page using keyword data from the web page itself, web pages having links pointing to the web page, and web pages pointed to by a link in the web page, wherein the keyword data from the multiple web pages is processed to provide a relevant set of keyword data for the web page.
摘要翻译： 一种用于使用来自网页本身的关键字数据向网页分配关键字的方法，系统和装置，具有指向网页的链接的网页以及网页中由链接指向的网页，其中关键字数据 处理多个网页以提供网页的一组相关关键字数据。
-
19.发明申请Methods of jointly assigning resources in a multi-carrier, multi-hop wireless communication system 有权在多载波，多跳无线通信系统中共同分配资源的方法公开(公告)号：US20080310343A1
公开(公告)日：2008-12-18
申请号：US11812146
申请日：2007-06-15
申请人： Krishna Balachandran , Joseph H. Kang , Kemal Mehmet Karakayali , Muralidharan Sampath Kodialam
发明人： Krishna Balachandran , Joseph H. Kang , Kemal Mehmet Karakayali , Muralidharan Sampath Kodialam
IPC分类号： H04Q7/00
CPC分类号： H04W40/02 , H04L45/125 , Y02D70/1242 , Y02D70/1262 , Y02D70/146 , Y02D70/22 , Y02D70/30
摘要： Methods for jointly determining tones, power, scheduling and routing of links in a multi-carrier, multi-hop network to achieve certain desired throughput objectives between source and destination nodes. The methods effectively enhance or optimize throughput received by each destination router under node traffic constraints such as power, scheduling and flow constraints that apply to each link between each of a plurality of nodes within the mesh network.
摘要翻译： 共同确定多载波，多跳网络中链路的音调，功率，调度和路由的方法，以实现源节点和目的节点之间的某些所需吞吐量目标。 该方法有效地增强或优化每个目的地路由器在诸如功率，调度和流量约束之类的节点流量约束下接收的吞吐量，其适用于网状网络内的多个节点中的每一个之间的每个链路。
-
公开(公告)号：US09160649B2
公开(公告)日：2015-10-13
申请号：US10951169
申请日：2004-09-27
IPC分类号： H04L12/721 , H04L12/751 , H04L12/801 , H04L12/803
CPC分类号： H04L45/12 , H04L45/02 , H04L47/10 , H04L47/125
摘要： The invention includes a method for routing traffic from a first node towards a plurality of intermediate nodes. A method includes receiving traffic at a first node and routing respective portions of the received traffic toward respective intermediate nodes according to respective traffic weighting factors associated with the intermediate nodes. Upon receiving the respective portions of the traffic, the intermediate nodes may then route the traffic toward one or more destination nodes, or may route the traffic toward another plurality of intermediate nodes before the traffic is routed to a destination node. The intermediate node traffic weighting factors may be dependent on the first node and the destination node, or may be independent of the first node and the destination node.
摘要翻译： 本发明包括一种用于从第一节点向多个中间节点路由业务的方法。 一种方法包括在第一节点处接收业务，并根据与中间节点相关联的相应业务加权因子将接收到的业务的相应部分路由到各个中间节点。 在接收到业务的相应部分之后，中间节点可以然后将业务路由到一个或多个目的地节点，或者可以在业务被路由到目的地节点之前将业务路由到另一多个中间节点。 中间节点业务加权因子可以取决于第一节点和目的地节点，或者可以独立于第一节点和目的地节点。
-
-
-
-
-
-
-
-
-
搜索结果
31 条记录 (耗时 0.02 秒)
