会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 15. 发明申请
    • ENHANCED FLOW CONTROL IN A CELLULAR TELEPHONY SYSTEM
    • 蜂窝电话系统中的增强流量控制
    • US20100203893A1
    • 2010-08-12
    • US12516534
    • 2006-11-28
    • Peter LundhCarola FaroniusJanos FarkasSandor RaczSzilveszter Nadas
    • Peter LundhCarola FaroniusJanos FarkasSandor RaczSzilveszter Nadas
    • H04W40/02
    • H04L47/10H04L47/11H04L47/12H04L47/14H04L47/25H04W28/02H04W28/10H04W28/12H04W88/12H04W92/12
    • The invention discloses a method (200, 300, 400) for traffic control in a cellular telephony system (100) comprising a number of cells, each cell comprising at least one Radio Base Station, RBS, (170). The system (100) comprises at least one Radio Network Controller, RNC, (110 130 150), for the control of a number of Radio Base stations. The traffic between an RBS and an RNC comprises a number of flows. The invention is intended for the control of flows from the Radio Base Stations to their RNC. The method uses one control function for each flow from each of said Radio Base Stations, and also comprises a congestion detection function (220) which detects the presence or absence of congestion in the traffic from an RBS to an RNC, and which, upon detection of congestion reduces the bit rate of the congested traffic, and in the absence of congestion, increases the bit rate of the previously congested traffic.
    • 本发明公开了一种用于包括多个小区的蜂窝电话系统(100)中的业务控制的方法(200,300,400),每个小区包括至少一个无线电基站RBS(170)。 系统(100)包括用于控制多个无线电基站的至少一个无线电网络控制器RNC(110 130 150)。 RBS和RNC之间的业务包括多个流。 本发明旨在控制从无线电基站到其RNC的流量。 该方法对来自每个所述无线电基站的每个流使用一个控制功能,并且还包括拥塞检测功能(220),其检测从RBS到RNC的流量中是否存在拥塞,以及哪个在检测到 拥塞降低了拥塞流量的比特率,并且在没有拥塞的情况下,增加了先前拥塞的流量的比特率。
    • 17. 发明授权
    • Call admission control system and method for interpreting signaling messages and controlling traffic load in internet protocol differentiated services networks
    • 呼叫接纳控制系统和方法,用于解释信令消息并控制互联网协议差分服务网络中的流量负载
    • US07660242B2
    • 2010-02-09
    • US10595092
    • 2004-07-27
    • Gergely MatefiCsaba AntalJanos Farkas
    • Gergely MatefiCsaba AntalJanos Farkas
    • G08C15/00
    • H04L47/10H04L47/14H04L47/15H04L47/2408H04L47/2416H04L47/283H04L47/70H04L47/801H04L47/805H04L47/822H04L47/824
    • A call admission control system and method for Internet Protocol (IP) Differentiated Services (DiffServ) network having at least one node for interpreting signaling messages and controlling traffic load in the network. The method consists of an initialization (601) and a real-time phase (602). In initialization phase (601), coefficients of the approximating hyperplanes are computed (61) and stored (62). This phase is repeated when the descriptor of a traffic class changes (63), which usually happens when nodes are configured or reconfigured. A traffic mix is admissible (67), if for each real-time traffic class both the stability (65) and the delay (66) constraints are fulfilled. Stability is tested by evaluating the number of lost packets and comparing it to the tolerated packet loss ratio for each class in that queue. Delay constraint is tested by checking if the traffic mix is below at least one of the approximating hyperplanes in the space of number of sessions for each class.
    • 一种用于互联网协议(IP)差分服务(DiffServ)网络的呼叫接纳控制系统和方法,其具有用于解释信令消息和控制网络中的业务负载的至少一个节点。 该方法由初始化(601)和实时阶段(602)组成。 在初始化阶段(601)中,计算(61)并存储(62)近似超平面的系数。 当业务类的描述符改变(63)时,会重复此阶段,通常在配置或重新配置节点时发生。 如果对于每个实时交通类来说,流量混合是可接受的(67),则稳定性(65)和延迟(66)约束都得到满足。 通过评估丢失数据包的数量并将其与该队列中的每个类别的容忍丢包率进行比较来测试稳定性。 通过检查流量混合是否低于每个类的会话空间中的近似超平面中的至少一个来测试延迟约束。
    • 18. 发明申请
    • Method of Generating Spanning Trees
    • 生成生成树的方法
    • US20080316917A1
    • 2008-12-25
    • US12089228
    • 2005-10-11
    • Janos FarkasToth Gabor
    • Janos FarkasToth Gabor
    • G06F11/00
    • H04L12/4625H04L45/02H04L45/22H04L45/28H04L45/48
    • A method of generating spanning trees in a network in which a plurality of network nodes are interconnected by links. The spanning trees are utilized for handling link and node failures. For link failures, each link has at least one tree that does not include that link. For node failures, each node has at least one tree to which the node is connected by a single link. A first spanning tree connects all of the nodes, and from each node one link is left unconnected. A second spanning tree includes all of the nodes and all of the unconnected links. Thus, none of the links is included in both trees. If a node failure prevents other nodes from communicating, a third spanning tree is needed. The method minimizes the number of required trees in large networks of any topology and can be implemented off-line.
    • 一种在网络中生成生成树的方法,其中多个网络节点通过链路互连。 生成树用于处理链路和节点故障。 对于链路故障,每个链路至少有一个不包含该链路的树。 对于节点故障,每个节点至少有一个树,节点通过单个链路连接到该树。 第一个生成树连接所有节点,从每个节点,一个链路保持不连接。 第二个生成树包括所有节点和所有未连接的链路。 因此,这两个树都不包括链接。 如果节点故障阻止其他节点通信,则需要第三个生成树。 该方法将任何拓扑的大型网络中所需的树数量最小化,可以离线实现。