-
公开(公告)号：US09209943B1
公开(公告)日：2015-12-08
申请号：US13911631
申请日：2013-06-06
Inventor： Victor Firoiu , Brian T. DeCleene , Gregory Lauer , Xinzhuo Shen
CPC classification number: H04L1/1819 , H04L1/0076 , H04L1/1607 , H04L1/1664 , H04L1/1816 , H04L1/1851 , H04L1/1883 , H04L1/189 , H04L2001/0093
Abstract: A system and method for transmitting encoded data in a network is presented. The method begins with a source node of a network encoding a first generation of data using linearly-independent encoding vectors to produce an encoded first generation. Next, packets containing the encoded first generation are created. The packets are then transmitted over a subgraph of nodes with multiple paths to a destination node. A determination is made at a receiving node that an insufficient amount of packets of the encoded first generation have been received in order to decode the encoded first generation. A repair request is sent from the receiving node to nodes upstream to indicate a need for more packets of the encoded first generation without specifying a particular packet. In response to the repair request, at least one node upstream from the receiving node sends a packet with encoded first generation data.
Abstract translation: 提出了一种用于在网络中传输编码数据的系统和方法。 该方法开始于使用线性独立的编码向量编码第一代数据的网络的源节点，以产生编码的第一代。 接下来，创建包含编码的第一代的分组。 然后通过具有多个路径的节点的子图将数据包发送到目的地节点。 在接收节点处确定已经接收到编码的第一代数据包的量不足以解码编码的第一代。 修复请求从接收节点发送到上游的节点，以指示对编码的第一代的更多分组的需要，而不指定特定分组。 响应于修复请求，从接收节点上游的至少一个节点发送具有编码的第一代数据的分组。
-
Patent Agency Ranking
公开(公告)号：US09119179B1
公开(公告)日：2015-08-25
申请号：US13911749
申请日：2013-06-06
Inventor： Victor Firoiu , Scott B. LaPrise
CPC classification number: H04W76/10 , H04B7/18506 , H04W16/18 , H04W16/22 , H04W76/30
Abstract: A system and method for dynamically planning a network is presented. One method may begin by determining network parameters for connecting nodes to a network and decision variables associated with radios and/or nodes in the network. Constraints may be established to narrow possible values of the network parameters and/or the decision variables. The constraints may be based on one or more of: values associated with connecting a radio to a node in the network, values associated with connecting two nodes in the network together over a communication link, whether a node can connect to a GIG node and a flow balance in the GIG node. To find possible links in the network that are optimal, the method may minimize an equation based on the network parameters, constraints and decision variables to determine optimal communication links between pairs of nodes in the network, pairs of nodes and radios and/or pairs of radios.
Abstract translation: 提出了一种用于动态规划网络的系统和方法。 一种方法可以通过确定用于将节点连接到网络的网络参数和与网络中的无线电和/或节点相关联的决策变量来确定。 可以建立约束来缩小网络参数和/或决策变量的可能值。 约束可以基于以下中的一个或多个：与无线电连接到网络中的节点相关联的值，通过通信链路将网络中的两个节点连接在一起的值，节点是否可以连接到GIG节点 GIG节点的流量平衡。 为了找到最佳的网络中的可能的链路，该方法可以使基于网络参数，约束和决策变量的方程最小化，以确定网络中的节点对，节点对和无线电和/或成对之间的最佳通信链路 收音机
-
公开(公告)号：US20150172953A1
公开(公告)日：2015-06-18
申请号：US14414459
申请日：2014-02-25
Inventor： Victor Firoiu , Brian T. Decleene , May M. Leung , Soumendra Nanda , Charles Tao
CPC classification number: H04W28/021 , H04L41/0816 , H04L41/12 , H04W40/023 , H04W84/18
Abstract: A mobile infrastructure assisted ad-hoc network increases the number of nodes capable of being serviced by the network by selectively choosing those protocols for selected nodes which minimize overhead with the freed up bandwidth permitting an increase in the overall number of nodes serviceable by the ad-hoc network to as many as 1,000 nodes. In one embodiment node dynamicity is determining factor as to what protocol will be used.
Abstract translation: 移动基础设施辅助自组织网络通过选择性地选择那些使得开销减小的开销的节点，通过选择性地选择这些协议来增加网络所能够服务的节点的数量，从而可以增加可由ad- hoc网络多达1,000个节点。 在一个实施例中，节点动态性是关于什么协议将被使用的决定因素。
-
公开(公告)号：US09313813B2
公开(公告)日：2016-04-12
申请号：US14803545
申请日：2015-07-20
Inventor： Victor Firoiu , Scott B. LaPrise
CPC classification number: H04W76/10 , H04B7/18506 , H04W16/18 , H04W16/22 , H04W76/30
Abstract: A system and method for dynamically planning a network is presented. One method may begin by determining network parameters for connecting nodes to a network and decision variables associated with radios and/or nodes in the network. Constraints may be established to narrow possible values of the network parameters and/or the decision variables. The constraints may be based on one or more of: values associated with connecting a radio to a node in the network, values associated with connecting two nodes in the network together over a communication link, whether a node can connect to a GIG node and a flow balance in the GIG node. To find possible links in the network that are optimal, the method may minimize an equation based on the network parameters, constraints and decision variables to determine optimal communication links between pairs of nodes in the network, pairs of nodes and radios and/or pairs of radios.
-
公开(公告)号：US09596619B2
公开(公告)日：2017-03-14
申请号：US14414459
申请日：2014-02-25
Inventor： Victor Firoiu , Brian T. Decleene , May M. Leung , Soumendra Nanda , Charles Tao
CPC classification number: H04W28/021 , H04L41/0816 , H04L41/12 , H04W40/023 , H04W84/18
Abstract: A mobile infrastructure assisted ad-hoc network increases the number of nodes capable of being serviced by the network by selectively choosing those protocols for selected nodes which minimize overhead with the freed up bandwidth permitting an increase in the overall number of nodes serviceable by the ad-hoc network to as many as 1,000 nodes. In one embodiment node dynamicity is determining factor as to what protocol will be used.
Abstract translation: 移动基础设施辅助自组织网络通过选择性地选择那些使得开销减小的开销的节点，通过选择性地选择这些协议来增加网络所能够服务的节点的数量，从而可以增加可由ad- hoc网络多达1,000个节点。 在一个实施例中，节点动态性是关于什么协议将被使用的决定因素。
-
公开(公告)号：US20150327302A1
公开(公告)日：2015-11-12
申请号：US14803545
申请日：2015-07-20
Inventor： Victor Firoiu , Scott B. LaPrise
CPC classification number: H04W76/10 , H04B7/18506 , H04W16/18 , H04W16/22 , H04W76/30
Abstract: A system and method for dynamically planning a network is presented. One method may begin by determining network parameters for connecting nodes to a network and decision variables associated with radios and/or nodes in the network. Constraints may be established to narrow possible values of the network parameters and/or the decision variables. The constraints may be based on one or more of: values associated with connecting a radio to a node in the network, values associated with connecting two nodes in the network together over a communication link, whether a node can connect to a GIG node and a flow balance in the GIG node. To find possible links in the network that are optimal, the method may minimize an equation based on the network parameters, constraints and decision variables to determine optimal communication links between pairs of nodes in the network, pairs of nodes and radios and/or pairs of radios.
Abstract translation: 提出了一种用于动态规划网络的系统和方法。 一种方法可以通过确定用于将节点连接到网络的网络参数和与网络中的无线电和/或节点相关联的决策变量来确定。 可以建立约束来缩小网络参数和/或决策变量的可能值。 约束可以基于以下中的一个或多个：与无线电连接到网络中的节点相关联的值，通过通信链路将网络中的两个节点连接在一起的值，节点是否可以连接到GIG节点，以及 GIG节点的流量平衡。 为了找到最佳的网络中的可能的链路，该方法可以使基于网络参数，约束和决策变量的方程最小化，以确定网络中的节点对，节点对和无线电和/或成对之间的最佳通信链路 收音机
-
-
-
-
-
Search Results
6
records
(took 0.024 seconds)
