-
公开(公告)号:US09999058B2
公开(公告)日:2018-06-12
申请号:US14475827
申请日:2014-09-03
申请人: FIRETIDE, INC.
发明人: Jorjeta Jetcheva , Ravi Prakash , Vinay Gupta , Sachin Kanodia , Mohan Natarajan
CPC分类号: H04W72/082 , H04L41/12 , H04W72/0426 , H04W72/0433 , H04W72/0486 , H04W72/121 , H04W88/08
摘要: Channel assignment for wireless access networks is directed toward improved overall communication capability of the networks. A network is formed of wireless access points (APs) coupled via wired (and/or wireless) links and enabled to communicate with clients via radio channels of each of the APs. Local information is collected at each of the APs and processed to determine channel assignments according to a Neighbor Impact Metric (NIM) that accounts for one-hop and two-hop neighbors as well as neighbors not part of the network. Optionally, the NIM accounts for traffic load on the APs. The channel assignments are determined either on a centralized resource (such as a server or one of the APs) or via a distributed scheme across the APs. The local information includes how busy a channel is and local operating conditions such as error rate and interference levels.
-
公开(公告)号:US20160269976A1
公开(公告)日:2016-09-15
申请号:US14887152
申请日:2015-10-19
申请人: Firetide, Inc.
发明人: Jorjeta Gueorguieva Jetcheva , Sachin Kanodia , Murali Sundaramoorthy Repakula , Mohan Natarajan
IPC分类号: H04W40/38 , H04L12/933 , H04W40/28 , H04L12/733 , H04L12/707 , H04L12/721 , H04W24/02 , H04W40/02
CPC分类号: H04W40/38 , H04L45/122 , H04L45/22 , H04L45/26 , H04L45/36 , H04L49/1584 , H04W24/02 , H04W40/02 , H04W40/023 , H04W40/28 , H04W40/34 , H04W84/18
摘要: Various embodiments implement a set of low overhead mechanisms to enable on-demand routing protocols. The on-demand protocols use route accumulation during discovery floods to discover when better paths have become available even if the paths that the protocols are currently using are not broken. In other words, the mechanisms (or “Route Optimizations”) enable improvements to routes even while functioning routes are available. The Route Optimization mechanisms enable nodes in the network that passively learn routing information to notify nodes that need to know of changes in the routing information when the changes are important. Learning routing information on up-to-date paths and determining nodes that would benefit from the information is performed, in some embodiments, without any explicit control packet exchange. One of the Route Optimization mechanisms includes communicating information describing an improved route from a node where the improved route diverges from a less nearly optimal route.
-
13.
公开(公告)号:US09167496B2
公开(公告)日:2015-10-20
申请号:US14286461
申请日:2014-05-23
申请人: Firetide, Inc.
发明人: Jorjeta Gueorguieva Jetcheva , Sachin Kanodia , Murali Sundaramoorthy Repakula , Mohan Natarajan
IPC分类号: H04W40/02 , H04W40/20 , H04W40/34 , H04W84/18 , H04L12/733 , H04L12/707 , H04L12/721 , H04W40/28
CPC分类号: H04W40/38 , H04L45/122 , H04L45/22 , H04L45/26 , H04L45/36 , H04L49/1584 , H04W24/02 , H04W40/02 , H04W40/023 , H04W40/28 , H04W40/34 , H04W84/18
摘要: Various embodiments implement a set of low overhead mechanisms to enable on-demand routing protocols. The on-demand protocols use route accumulation during discovery floods to discover when better paths have become available even if the paths that the protocols are currently using are not broken. In other words, the mechanisms (or “Route Optimizations”) enable improvements to routes even while functioning routes are available. The Route Optimization mechanisms enable nodes in the network that passively learn routing information to notify nodes that need to know of changes in the routing information when the changes are important. Learning routing information on up-to-date paths and determining nodes that would benefit from the information is performed, in some embodiments, without any explicit control packet exchange. One of the Route Optimization mechanisms includes communicating information describing an improved route from a node where the improved route diverges from a less nearly optimal route.
摘要翻译: 各种实施例实现一组低开销机制以实现按需路由协议。 按需协议在发现洪水期间使用路由累积,以便在更好的路径变得可用时发现,即使协议当前使用的路径没有被破坏。 换句话说,机制(或“路由优化”)可以改善路由,即使有功能的路由可用。 路由优化机制使得网络中的节点被动地学习路由信息,以便在更改重要时通知需要知道路由信息中的更改的节点。 在一些实施例中,在没有任何明确的控制分组交换的情况下,执行在最新路径上学习路由信息并确定将从该信息中受益的节点。 路由优化机制之一包括传达描述改进路由的改进路由的信息,其中改进路由从较不接近最优路由发散。
-
-