会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 4. 发明授权
    • Method and apparatus for scheduling data packet transmission over a multihop wireless backhaul network
    • 用于通过多跳无线回程网络调度数据分组传输的方法和装置
    • US07366178B2
    • 2008-04-29
    • US11225516
    • 2005-09-13
    • Seungjoon LeeGirija J. NarlikarGordon Thomas WilfongYihao Lisa Zhang
    • Seungjoon LeeGirija J. NarlikarGordon Thomas WilfongYihao Lisa Zhang
    • H04J1/02
    • H04W72/0446H04W84/22
    • A method and apparatus for scheduling the transmission of data packets over a multihop wireless backhaul network in which delay guarantees through the network may be advantageously ensured. Illustratively, a novel packet scheduling scheme is provided which is advantageously based on an existing scheduling policy for wireline networks and for which a delay guarantee (based on the delay characteristics of the existing scheduling policy) can be advantageously ensured. In one embodiment, an even-odd link activation framework is defined for a given multihop wireless backhaul network, and an associated scheduling policy based on an arbitrary existing scheduling policy for wireline networks is derived and adopted. In such a case, the derived scheduling policy, when applied to the given multihop wireless backhaul network, advantageously ensures a worst-case delay guarantee of approximately twice that of the existing scheduling policy for wireline networks.
    • 可以有利地确保通过多跳无线回程网络调度数据分组的传输的方法和装置,其中通过网络的延迟保证。 示例性地,提供了一种新颖的分组调度方案,其有利地基于用于有线网络的现有调度策略,并且可以有利地确保延迟保证(基于现有调度策略的延迟特性)。 在一个实施例中,为给定的多跳无线回程网络定义偶数链路激活框架,并且导出并采用基于用于有线网络的任意现有调度策略的相关调度策略。 在这种情况下,当应用于给定的多跳无线回程网络时,派生的调度策略有利地确保了用于有线网络的现有调度策略的最差情况延迟保证的两倍。
    • 5. 发明授权
    • Quality of service routing in information networks over paths having performance-dependent costs
    • 在具有性能依赖成本的路径上,信息网络中的服务质量路由
    • US06697335B1
    • 2004-02-24
    • US09626427
    • 2000-07-27
    • Ayse Funda ErgunRakesh Kumar SinhaYihao Lisa Zhang
    • Ayse Funda ErgunRakesh Kumar SinhaYihao Lisa Zhang
    • H04J116
    • H04L45/12H04L45/121
    • A method of determining an optimal path from a source node to a destination node over a number of links in an information network having n nodes. Each link has an associated cost-delay function, the optimal path is constrained to an overall delay of D, and a total cost of all links along the path is to be minimized at a value OPT. The method includes maintaining a range [L, U] for OPT, wherein L is a lower bound and U is an upper bound, and setting initial values for L and U. A cost value V is set corresponding to {square root over (U·L)}, and a scaled cost c′ is derived for each link wherein c′ corresponds to cn/V&egr;, c is an actual cost for each link, and &egr;>0. If a feasible path having a delay of at most D and a total cost of at most V is found not to exist, then the value of L is increased to V, a new cost value V is set and the link costs c′ are further scaled. The values of L and U are reset until U/L
    • 一种通过具有n个节点的信息网络中的多个链路来确定从源节点到目的地节点的最佳路径的方法。 每个链路具有相关联的成本延迟功能,最优路径被约束到D的总体延迟,并且沿着路径的所有链路的总成本将被最小化为值OPT。 该方法包括维持用于OPT的范围[L,U],其中L是下限,U是上限,并且设置L和U的初始值。成本值V被设置为对应于{平方根超过(UL )},并且对于每个链路导出对应于cn / Vepsilon的每个链路的缩放成本c',c是每个链路的实际成本,ε> 0。 如果发现延迟最多为D且总成本最多为V的可行路径不存在,则L的值增加到V,设置新的成本值V,并且链路成本c'进一步 缩放 L和U的值被复位直到U / L <2并且可行路径继续存在。 然后将可行路径的链接标识为使用最后缩放的链路成本的最优路径。
    • 6. 发明授权
    • Linear programming method of networking design for carrying traffic from endnodes to a core network at least cost
    • 用于从端点到核心网络承载流量的网络设计的线性规划方法至少成本
    • US06363334B1
    • 2002-03-26
    • US09255945
    • 1999-02-23
    • Daniel Matthew AndrewsYihao Lisa Zhang
    • Daniel Matthew AndrewsYihao Lisa Zhang
    • G06F1750
    • H04Q3/0083H04Q2213/13054H04Q2213/13148H04Q2213/13298H04Q2213/13383
    • A method is disclosed, for designing an access network that is to carry communication traffic between end nodes and a core network. Information is provided that describes end node locations, the level of demand associated with each end node, available trunk types and their related capacities, and a cost structure. The cost structure includes a fixed overhead cost for each trunk type, and a service charge per unit distance for each trunk type. The provided information is incorporated in a linear program to find an optimal-cost access network. The linear program is solved to obtain a provisional solution that defines the composition and usage of each link of the optimal-cost access network. For each such link, the composition is defined by a fractional level of investment (incurring a like fraction of the corresponding overhead charge) in each pertinent trunk type. The provisional solution is rounded such that each trunk in which there is a fractional investment is either removed, or replaced by a trunk in which there is an integral investment.
    • 公开了一种用于设计用于承载终端节点和核心网络之间的通信业务的接入网络的方法。 提供了描述终端节点位置,与每个端节点相关联的需求级别,可用中继线类型及其相关容量以及成本结构的信息。 成本结构包括每个中继类型的固定开销成本,以及每个中继类型的每单位距离的服务费用。 所提供的信息被并入到线性程序中以找到最优成本的接入网络。 解决线性程序以获得定义最优成本接入网络的每个链路的组成和使用的临时解决方案。 对于每个这样的链接,组合物由每种相关行业类型中的投资级别(产生相应的开销费用的相似部分)来定义。 临时解决方案是圆形的,使得其中存在分数投资的每个中继线被去除,或者被具有整体投资的中继线所取代。
    • 8. 发明授权
    • Methods and apparatus for design, adjustment or operation of wireless networks using multi-stage optimization
    • 使用多级优化设计,调整或操作无线网络的方法和设备
    • US06925066B1
    • 2005-08-02
    • US09628366
    • 2000-07-31
    • Chandra S. ChekuriLawrence M. DrabeckKarl Georg HampelPaul Anthony PolakosYihao Lisa Zhang
    • Chandra S. ChekuriLawrence M. DrabeckKarl Georg HampelPaul Anthony PolakosYihao Lisa Zhang
    • H04B7/208H04W16/18H04W24/02
    • H04W24/02H04W16/18
    • Techniques for use in designing, adjusting or operating a wireless network so as to provide a desired level of performance for the network. An optimization process is applied to a set of information characterizing the network. The optimization process is implemented as a multi-stage process which includes at least a frequency assignment stage and a post-frequency-assignment optimization stage, wherein the frequency assignment stage and the post-frequency-assignment stage are subject to iteration. For example, after an initial assignment of the frequencies in the frequency assignment stage, the post-frequency-assignment optimization stage may be performed, and based on the result of the optimization, at least one of the frequency assignment stage and the post-frequency-assignment optimization stage may be repeated. An output of the optimization process is utilized to determine one or more operating parameters of the wireless network, such as a base station transmit power or antenna orientation. The optimization process in an illustrative embodiment may be implemented as a three-stage process which includes a pre-frequency-assignment optimization stage, the frequency assignment stage and the post-frequency-assignment optimization stage, with one or more subsets of these stages being implemented in an iterative manner.
    • 用于设计,调整或操作无线网络以便为网络提供期望的性能水平的技术。 优化过程被应用于表征网络的一组信息。 该优化处理被实现为多级处理,其至少包括频率分配级和后频分配优化级,其中,频率分配级和后频分配级被进行迭代。 例如,在频率分配阶段中的频率的初始分配之后,可以执行后频分配优化级,并且基于优化的结果,频率分配级和后频中的至少一个 可以重复分配优化阶段。 利用优化过程的输出来确定无线网络的一个或多个操作参数,诸如基站发射功率或天线取向。 说明性实施例中的优化过程可以被实现为三阶段过程,其包括前频分配优化阶段,频率分配阶段和后频分配优化阶段,其中这些阶段的一个或多个子集是 以迭代的方式实现。
    • 9. 发明授权
    • Method for determining a master ring for an optical communications network
    • 用于确定光通信网络的主环的方法
    • US07349351B2
    • 2008-03-25
    • US10985495
    • 2004-11-10
    • Hadas ShachnaiYihao Lisa Zhang
    • Hadas ShachnaiYihao Lisa Zhang
    • H04L12/28H04B10/20
    • H04Q11/0062H04J3/1611H04Q2011/0073H04Q2011/009H04Q2011/0092Y10S370/907
    • A method for determining a master ring for an optical communications network having nodes arranged in a plurality of interconnected ring structures. (A master ring is a ring structure which contains every node in the network exactly once, and which also respects the node ordering of every individual ring.) An efficient solution to the master ring problem is provided by advantageously limiting the enumeration process based on the consistency of the enumeration of individual rings with each other. Illustratively, an intersection graph of the network is generated; one or more of the rings is chosen and possible openings of each of these rings are enumerated; and a limited number of possible openings of one or more other (i.e., non-chosen) rings are enumerated such that the enumeration of the possible openings of the other (i.e., non-chosen) rings are consistent therewith.
    • 一种用于确定具有布置在多个互连环结构中的节点的光通信网络的主环的方法。 (主环是环形结构,其中包含网络中的每个节点一次,并且还尊重每个环的节点排序)。通过有利地限制基于以下的枚举过程来提供主环问题的有效解决方案 个别戒指的枚举的一致性。 说明性地,生成网络的交叉图; 选择一个或多个环,并列举这些环中的每一个的可能的开口; 并且列举了一个或多个其它(即未选择的)环的有限数量的可能的开口,使得另一个(即未选择的)环的可能开口的计数与其一致。