-
1.发明授权Computing optimal channel allocations using decomposition methods and related devices 有权使用分解方法和相关设备计算最佳信道分配公开(公告)号：US07522566B2
公开(公告)日：2009-04-21
申请号：US10953355
申请日：2004-09-30
IPC分类号： H04Q7/24
摘要： By decomposing (i.e., dividing) an interference graph into subgraphs, it becomes feasible to compute close approximations of an optimal channel allocation scheme within a reasonable amount of time. The channel allocation scheme may be used to allocate specific channels to access points (APs) in a wireless, local area network (WLAN).
摘要翻译： 通过将干涉图分解（即分割）为子图，可以在合理的时间内计算最佳信道分配方案的近似值。 信道分配方案可用于将无线局域网（WLAN）中的特定信道分配给接入点（AP）。
-
公开(公告)号：US07194271B2
公开(公告)日：2007-03-20
申请号：US10821893
申请日：2004-04-12
IPC分类号： H04Q7/20
CPC分类号： H04W72/082 , H04W84/12
摘要： Channels are allocated to one or more cells within a wireless LAN (WLAN) without causing unacceptable interference. The allocation involves dividing an allocation time period into frames, each frame having a substantially short duration, and then allocating one or more channels to one or more WLAN cells during each such frame according to an allocation vector. The vector assures that each cell allocated a channel is sufficiently distant from every other cell allocated the same channel to minimize cross interference. Only those cells allocated a channel are allowed to transmit during a given frame. The allocation vectors are determined in such a way that the performance of a WLAN is optimized.
摘要翻译： 信道被分配给无线局域网（WLAN）内的一个或多个小区，而不引起不可接受的干扰。 分配包括将分配时间段划分为帧，每帧具有基本上短的持续时间，然后根据分配向量在每个这样的帧期间将一个或多个信道分配给一个或多个WLAN小区。 向量确保分配信道的每个小区与分配相同信道的每个其他小区足够远，以最小化交叉干扰。 在给定帧期间，只允许分配信道的信元进行发送。 确定分配向量，使得WLAN的性能被优化。
-
3.发明授权Prevention of deadlocks and livelocks in lossless, backpressured packet networks 有权在无损，背压的分组网络中防止死锁和活动锁公开(公告)号：US06859435B1
公开(公告)日：2005-02-22
申请号：US09624085
申请日：2000-07-24
CPC分类号： H04L47/2458 , H04L47/10 , H04L47/13 , H04L47/2433 , H04L47/26 , H04L47/30
摘要： A packet communication network is arranged so that a backpressure or feedback signal is sent from a receiving node to a node having packets to send to the receiving,node, selectively allowing only certain packets to be considered eligible for transmission. The backpressure is arranged to be lossless, and to avoid network deadlocks and livelocks. The transmission of a packet p from a sending node Xl to a receiving node Rl, via a link l, is controlled by (a) sending from the receiving node Rl to the upstream node Xl a feedback value fl that assures that there will be room in the buffer in the receiving node Rl to store packets subsequently received from the upstream node Xl; (b) assigning a priority level λp to packets stored in the buffer of the receiving node Rl; and (c) transmitting from the sending node Xl to the receiving node Rl, only those stored packets at Xl whose priority level λp exceeds the feedback value fl received from the receiving node Rl.
摘要翻译： 分组通信网络被布置成使得背压或反馈信号从接收节点发送到具有要发送到接收节点的分组的节点，选择性地允许仅某些分组被认为符合传输的条件。 背压设置为无损，并避免网络死锁和活动锁定。 通过（a）从接收节点R1向上游节点X1发送确保有空间的反馈值f1来控制分组p从发送节点X1到接收节点R1的传输 在接收节点R1的缓冲器中存储随后从上游节点X1接收的分组; （b）为存储在接收节点R1的缓冲器中的分组分配优先级别的羔羊; 和（c）从发送节点X1向接收节点R1发送只有其优先级别lambdap超过从接收节点R1接收到的反馈值f1的X1的那些存储分组。
-
公开(公告)号：US20170308612A1
公开(公告)日：2017-10-26
申请号：US15643466
申请日：2017-07-06
IPC分类号： G06F17/30 , H04L12/751 , H04L12/715
CPC分类号： G06F16/951 , H04L45/02 , H04L45/46
摘要： A method for distributed multi-choice voting/ranking in a network with a plurality of nodes associated to a set of choices is disclosed. The method includes setting a plurality of value sets for a plurality of nodes, setting a plurality of collections of memory sets for the plurality of nodes, and updating the plurality of value sets. In addition, the method includes updating the plurality of collections of memory sets, calculating a majority vote for the set of choices, and calculating a rank set for the set of choices.
-
5.发明授权Scaleable congestion control method for multicast communications over a data network 有权通过数据网络进行组播通信的可扩展拥塞控制方法公开(公告)号：US07102998B1
公开(公告)日：2006-09-05
申请号：US09273948
申请日：1999-03-22
IPC分类号： H04L12/26
CPC分类号： H04L47/10
摘要： The operation of a multicast network is enhanced by shifting the responsibility for performing congestion control with regulation for the transmission of multicast data packets from the transmitter to the receivers, such that each receiver computes a congestion control value using particular statistics that it accumulates and then forwards it congestion control value to the source/transmitter. The source then regulates its transmission of data packets in accordance with a selected one of the congestion control values that it receives. Moreover, a hierarchical reporting network may be used to convey the regulation values from the receivers to the source such that congestion control values generated by the receivers are consolidated at various layers in the hierarchical reporting network so that the source receives consolidated control values from just the receivers connected directly to the source, rather than a value from each of the receivers.
摘要翻译： 组播网络的运行是通过调整拥塞控制的责任来实现的，通过调整来实现组播数据包从发射机到接收者的传输，从而每个接收者使用其累积的特定统计信息计算拥塞控制值，然后转发 它拥塞控制值到源/发送器。 然后，源根据其接收到的拥塞控制值中选择的一个来调整数据分组的传输。 此外，可以使用分级报告网络来将接收器的调节值传达到源，使得接收器生成的拥塞控制值被合并在分级报告网络中的各个层，使得源仅从接收器接收到合并的控制值 接收器直接连接到源，而不是来自每个接收器的值。
-
6.发明授权Methods and devices for determining the adjacency of access points in a wireless network 有权确定无线网络中接入点邻接的方法和设备公开(公告)号：US07430189B2
公开(公告)日：2008-09-30
申请号：US11026905
申请日：2004-12-31
摘要： The adjacency of access points in a wireless, local area network is used to determine the existence of common overlapping access point coverage areas and to determine maximum distances between access points.
摘要翻译： 无线局域网中的接入点的邻接用于确定共同重叠接入点覆盖区域的存在并确定接入点之间的最大距离。
-
公开(公告)号：US06965943B1
公开(公告)日：2005-11-15
申请号：US09327347
申请日：1999-06-05
CPC分类号： H04L47/10 , H04L41/0813 , H04L41/0823 , H04L47/25 , H04L47/27 , H04L47/32
摘要： In a class of minimum cost flow control (MCFC) algorithms for adjusting session rates or window sizes congestion control is achieved through consideration of an incremental cost function that addresses link congestion, and an incremental cost function that addresses the cost of providing less than the desired transmission rate. A coarse version of the algorithm is geared towards implementation in the current Internet, relying on the end-to-end packet loss observations as indication of congestion. A more complete version anticipates an Internet where sessions can solicit explicit congestion information through a concise probing mechanism.
摘要翻译： 在用于调整会话速率或窗口大小的一类最小成本流量控制（MCFC）算法中，拥塞控制是通过考虑到解决链路拥塞的增量成本函数而实现的，以及增加成本函数，其解决了提供小于期望的成本 传输速率。 该算法的粗略版本面向当前互联网中的实现，依靠端到端分组丢失观察作为拥塞的指示。 一个更完整的版本预计一个互联网，其中会话可以通过简明的探测机制征求明确的拥塞信息。
-
公开(公告)号：US5121383A
公开(公告)日：1992-06-09
申请号：US615014
申请日：1990-11-16
CPC分类号： H04L12/5695 , H04J3/247 , H04L47/10 , H04L47/15 , H04L47/2433 , H04L47/805 , H04L47/822 , H04L47/823 , H04L47/828
摘要： A method and associated node structure (11) for the efficient and reliable transmission of delay sensitive traffic in a packet network (10) is disclosed. The method provides bounded end-to-end delay for all delay sensitive traffic and can guarantee loss-free transmission to that part of the delay sensitive traffic which has such a stringent requirement. To achieve statistical multiplexing gain, some loss is permitted for the rest of the delay sensitive traffic, with discrimination among different loss priority classes based on the corresponding degree of loss sensitivity. Bounded end-to-end delay is obtained by performing statistical multiplexing at the switching nodes (11) on a duration limited basis through use of a unique queuing discipline at the network nodes (11). This queuing discipline is instrumental in guaranteeing loss free transmission for the class of traffic with such a requirement.
摘要翻译： 公开了一种用于在分组网络（10）中有效和可靠地传输延迟敏感业务的方法和相关联的节点结构（11）。 该方法为所有延迟敏感业务提供有界的端到端延迟，并且可以保证对具有这种严格要求的那部分延迟敏感业务的无损传输。 为了实现统计复用增益，对延迟敏感业务的其余部分允许一些损失，根据相应的丢失灵敏度来区分不同的丢失优先级。 通过在网络节点（11）上使用唯一的排队规则，在持续时间有限的基础上在交换节点（11）执行统计复用来获得有界的端到端延迟。 这种排队纪律有助于保证有这种要求的交通类别的无损失传输。
-
公开(公告)号：US5050161A
公开(公告)日：1991-09-17
申请号：US445784
申请日：1989-12-04
CPC分类号： H04L12/5602 , H04J3/247 , H04L2012/5679 , H04L2012/568
摘要： A congestion control strategy for a packet network comprises an admission policy which controls the admission of packets into the network and a stop-and-go queuing strategy at the network nodes. The congestion control strategy utilizes multiple frame sizes so that certain types of connections can be provided with small queuing delays while other types of connections can be allocated bandwidth using small incremental bandwidth units.
摘要翻译： 分组网络的拥塞控制策略包括控制分组进入网络的准入策略和网络节点处的停止排队策略。 拥塞控制策略利用多个帧大小，使得某些类型的连接可以提供小的排队延迟，而其他类型的连接可以使用小的增量带宽单位分配带宽。
-
公开(公告)号：US11055363B2
公开(公告)日：2021-07-06
申请号：US15643466
申请日：2017-07-06
IPC分类号： H04L12/715 , H04L12/751 , G06F16/951
摘要： A method for distributed multi-choice voting/ranking in a network with a plurality of nodes associated to a set of choices is disclosed. The method includes setting a plurality of value sets for a plurality of nodes, setting a plurality of collections of memory sets for the plurality of nodes, and updating the plurality of value sets. In addition, the method includes updating the plurality of collections of memory sets, calculating a majority vote for the set of choices, and calculating a rank set for the set of choices.
-
-
-
-
-
-
-
-
-
搜索结果
12 条记录 (耗时 0.02 秒)
