会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • Method and equipment for controlling the congestion management and scheduling of transmission-link capacity in packet-switched telecommunications
    • 用于控制分组交换电信中的拥塞管理和传输链路容量调度的方法和设备
    • US20070058536A1
    • 2007-03-15
    • US10575706
    • 2004-10-13
    • Janne VaananenMikko Laulainen
    • Janne VaananenMikko Laulainen
    • H04L12/26
    • H04L47/6215H04L47/10H04L47/12H04L47/2408H04L47/31H04L47/326H04L47/50H04L47/522H04L47/6255H04L47/627
    • The invention relates to a method and equipment for controlling the congestion management and transmission-link-capacity scheduling in packet-switched telecommunications, in such a way that 1) it is possible to define what share of the capacity of the transmission link will be reserved for traffic representing a specific service level class, and 2) it is possible to define the weighting coefficient that the portion of the traffic exceeding the reservation of each service level class will use to compete for the portion of the capacity of the transmission link that is not reserved, or that is reserved but is not being used momentarily by traffic entitled to the reservation, and 3) it is possible to use overbooking, in such a way that the reduction in service quality due to overbooking affects only the service level class in which overbooking is used, and 4) it is possible to prevent an increase in delays detrimental to traffic-flow control even in a congestion situation arising from overbooking. The invention is based on measuring the traffic flow that comes to be scheduled, in which the flow is formed of packets representing a specific service level class arriving in the queue, or some of the relevant packets, and on controlling the operation of the scheduler and congestion limitation mechanism on the basis of the measurement results.
    • 本发明涉及一种用于在分组交换电信中控制拥塞管理和传输链路容量调度的方法和设备,其方法和方法为:1)可以定义传输链路的容量份额将被保留 对于表示特定服务级别的流量,以及2)可以定义加权系数,超出每个服务等级类别的预留的流量部分将用于竞争传输链路的容量的部分 不保留,或保留,但不被暂时用于有权享有预订的流量使用,以及3)可以使用超额预订,使得由于超量预订而导致的服务质量的降低仅影响服务级别 使用超额使用,以及4)即使在由于过度使用引起的拥塞情况下,也可以防止对交通流量控制有害的延迟的增加 预订。 本发明基于测量来自调度的业务流,其中,流由形成队列中的特定业务级别的分组或某些相关分组组成,并且控制调度器的操作, 基于测量结果的拥塞限制机制。
    • 2. 发明申请
    • Method and apparatus for implementing adaptive tomlinson-harashima precoding in a digital data link
    • 一种用于在数字数据链路中实现自适应森林 - 鹿儿岛预编码的方法和装置
    • US20050129138A1
    • 2005-06-16
    • US10503076
    • 2003-02-19
    • Janne VaananenHeikki Laamanen
    • Janne VaananenHeikki Laamanen
    • H04L25/03H04L25/49H04L27/34H04L27/04
    • H04L25/03343H04L25/03057H04L25/4921H04L27/34
    • The invention relates to a method for implementing adaptive Tomlinson-Harashima precoding using a digital data communications link, According to the method, the outgoing bit stream is coded into symbols, channel distortion is corrected by precoding (TML) the symbols, the precoded symbols are sent over a data communications channel (2, CHN), in which case the symbols, which have passed through the channel (2, CHN) and signal processing means of the receiver are reconstructed to form a bit stream. According to the invention, updated precoder coefficient parameter values are formed with the aid of an error variable (e), which is dependent on the symbol decisions (S′) of the receiver, the output signal of a decision-feedback equalizer, and a signal (Q) that is formed from the received signal by compensating the effect of the precoder transfer function of the received signal with an inverse precoder transfer function.
    • 本发明涉及一种使用数字数据通信链路实现自适应Tomlinson-Harashima预编码的方法,根据该方法,输出比特流被编码为符号,通过预编码(TML)来校正信道失真的符号,预编码的符号是 通过数据通信信道(2,CHN)发送,在这种情况下,通过接收机的信道(2,CHN)和信号处理装置的符号被重构以形成比特流。 根据本发明,借助于错误变量(e)形成更新的预编码器系数参数值,该误差变量取决于接收机的符号判定(S'),判决反馈均衡器的输出信号和 通过用反向预编码器传递函数补偿接收信号的预编码器传递函数的影响,由接收信号形成的信号(Q)。
    • 3. 发明授权
    • Method of ensuring stability of synchronous machine
    • 确保同步电机稳定的方法
    • US5942874A
    • 1999-08-24
    • US94815
    • 1998-06-15
    • Janne VaananenOlli Pyrhonen
    • Janne VaananenOlli Pyrhonen
    • H02P21/12H02P3/20
    • H02P21/12
    • The invention relates to a method of ensuring the stability of a synchronous machine in controlling the synchronous machine on the basis of direct control of flux and torque, in which the torque generated by the synchronous machine is increased/decreased by increasing/decreasing the instantaneous angular velocity of the stator flux. In accordance with the invention, the method comprises the steps of determining the direction of the stator flux vector (.psi.s) in rotor coordinates (dq), and forcing the stator flux vector (.psi.s) to remain in quadrants I and IV (Q1, Q4) of the rotor coordinates by rotating the stator flux in the rotor coordinates to a necessary degree.
    • 本发明涉及一种确保同步电机在控制同步电机的稳定性的基础上,直接控制磁通和转矩的方法,其中同步电机产生的转矩通过增加/减小瞬时角度来增减 定子磁通速度。 根据本发明,该方法包括以下步骤:确定转子坐标(dq)中的定子通量矢量(psi s)的方向,并迫使定子通量矢量(psi s)保持在象限I和IV(Q1 ,Q4),通过使转子坐标中的定子磁通旋转到必要程度。
    • 4. 发明申请
    • Method and equipment for performing aggregate-portion-specific flow shaping in packet-switched telecommunications
    • 在分组交换电信中执行聚合部分特定流量整形的方法和设备
    • US20070076609A1
    • 2007-04-05
    • US10575710
    • 2004-10-13
    • Janne Vaananen
    • Janne Vaananen
    • H04L12/26
    • H04L47/2441H04L47/10H04L47/22H04L47/41Y02D50/30
    • The invention relates to a method and equipment for performing aggregate-portion-specific flow shaping in packet-switched telecommunications, in such a way that the traffic flows (V1-VL) arriving in the system can be arbitrarily bundled into shaping groups and the speed properties (CIR, PIR, CBS) of an aggregate portion formed of packets representing the arbitrary shaping group (k) can be monitored and limited (aggregate-portion-specific shaping group). The invention is based on the fact that the earliest permitted moment, at which a packet in the system can be forwarded, is defined as the greatest value of the VTS values of all the shaping groups to which the traffic flow represented by the packet belongs, and as a result of the forwarding of the packet, the VTS values of the same shaping groups (k) are updated, in which the VTS value of an individual shaping group (k) expresses the earliest permitted moment, at which a packet belonging under the relevant shaping group (k) can be forwarded, without breaking the restrictions of the speed properties of the shaping group (k) being examined.
    • 本发明涉及一种用于在分组交换电信中执行聚合部分特定流量整形的方法和设备,使得到达系统的业务流(V 1 -VL)可以任意地捆绑到成形组中,并且 可以监视并限制由表示任意形状组(k)的分组形成的聚合部分的速度特性(CIR,PIR,CBS)(聚合部分特定的成形组)。 本发明基于以下事实:将系统中的分组可以转发的最早允许时刻定义为由分组所表示的业务流所属的所有整形组的VTS值的最大值, 并且作为转发分组的结果,更新相同整形组(k)的VTS值,其中个体整形组(k)的VTS值表示最早的允许时刻,其中属于 可以转发相关整形组(k),而不会破坏正在检查的成形组(k)的速度特性的限制。
    • 5. 发明申请
    • Combined customer-flow and quality-class-based scheduling method and apparatus for scheduling transmission-link capacity between packet-switched traffic flows
    • 组合客户流和基于质量级的调度方法和装置,用于调度分组交换业务流之间的传输链路容量
    • US20060126637A1
    • 2006-06-15
    • US11295481
    • 2005-12-07
    • Janne VaananenMarko Kulmala
    • Janne VaananenMarko Kulmala
    • H04L12/56H04L12/26H04J3/16H04L12/28H04L1/00H04J3/22
    • H04L47/6215H04L47/2408H04L47/2425H04L47/2441H04L47/50H04L47/56
    • The invention relates to a method and apparatus for scheduling transmission-link capacity between packet-switched telecommunications flows, in such a way that it is possible to guarantee that packets representing delay-critical traffic will be scheduled to the transmission link (S0) before packets representing non-delay-critical traffic and, in addition, that it is possible to limit the joint transmission speed of specific service-quality classes of an individual customer flow. The invention is based on the service-quality classes being separated into two different categories: a service-quality-class based scheduling branch (C) and a customer-flow based scheduling branch (F). When selecting the next packet to be forwarded, one of the two said branches (C or F) is selected and in the service-quality-class based scheduling branch a service-quality class (CoS) is selected and, within the selected service-quality class, a customer flow (CF) is selected and in the customer-flow based scheduling branch a customer flow (CF) is selected and, within the selected customer flow, a service-quality class (CoS) is selected.
    • 本发明涉及一种用于调度分组交换电信流之间的传输链路容量的方法和装置,使得可以保证在分组之前将表示延迟关键业务的分组调度到传输链路(S0) 代表非延迟关键流量,另外,可以限制单个客户流的特定服务质量等级的联合传输速度。 本发明基于服务质量等级被分为两类:基于服务质量的调度分支(C)和基于客户流的调度分支(F)。 当选择要转发的下一个分组时,选择两个所述分支中的一个(C或F),并且在基于服务质量的调度分支中选择服务质量等级(CoS),并且在所选择的服务 - 选择质量等级,选择客户流(CF),并且在基于客户流程的调度分支中,选择客户流(CF),并且在选定的客户流程内选择服务质量等级(CoS)。
    • 6. 发明申请
    • Method preserving delay properties and an apparatus for scheduling transmission link capacity between packet switched telecommunications flows
    • 保留延迟属性的方法和用于在分组交换电信流之间调度传输链路容量的装置
    • US20060072568A1
    • 2006-04-06
    • US11232888
    • 2005-09-23
    • Janne Vaananen
    • Janne Vaananen
    • H04L12/56
    • H04L47/2441H04L47/2408H04L47/50H04L47/562H04L47/6215H04L47/623
    • The invention relates to a method and apparatus for scheduling transmission-link capacity between packet switched telecommunications flows (L1, L2), in such a way that it is possible to ensure the scheduling of packets representing delay-critical traffic to the transmission link (S) before packets representing non-delay-critical traffic and, in addition, to achieve the desired division of the capacity of the transmission link (S) between different traffic groups. The invention is based on performing the selection in the scheduling in stages, as follows: 1) the packets with the highest priority among the packets being offered are sought and 2) from the sub-group obtained, a final selection is performed using a weighting-factor based scheduling method, in such a way that the same weighting-factor based scheduling process is used to handle the sub-groups representing different priority levels in the consecutive selection situations
    • 本发明涉及一种用于调度分组交换电信流(L1,L2)之间的传输链路容量的方法和装置,使得可以确保对传输链路表示延迟关键业务的分组的调度 (S)在表示非延迟关键业务的分组之前,并且另外,以实现不同业务组之间传输链路(S)的容量的期望划分。 本发明基于如下步骤进行调度中的选择:1)寻求所提供的分组中具有最高优先级的分组,并且2)从所获得的子组中,使用加权来执行最终选择 基于因子的调度方法,以相同的基于加权因子的调度过程用于处理在连续选择情况下表示不同优先级的子组