中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

33 records (took 0.026 seconds)

    DIMENSIONING LINK CAPACITY IN A PACKET SWITCHED TELECOMMUNICATIONS NETWORK
    2.
    发明申请
    DIMENSIONING LINK CAPACITY IN A PACKET SWITCHED TELECOMMUNICATIONS NETWORK 审中-公开
    分组交换电信网络中的尺寸链路容量

    公开(公告)号：WO2008120077A2

    公开(公告)日：2008-10-09

    申请号：PCT/IB2008000742

    申请日：2008-03-27

    Applicant: ERICSSON TELEFON AB L M ,  FARKAS JANOS ,  ANTAL CSABA ,  RACZ SANDOR ,  MALOMSKY SZABOLCS ,  ROSBERG ULF

    Inventor： FARKAS JANOS ,  ANTAL CSABA ,  RACZ SANDOR ,  MALOMSKY SZABOLCS ,  ROSBERG ULF

    IPC: H04L12/24 ,  H04L12/54

    CPC classification number: H04L41/0896 ,  H04L47/70 ,  H04L47/805 ,  H04L47/822

    Abstract: In a packet switched telecommunications networks a dimensioning method, a dimensioning tool and network links dimensioned according to the method and with the help of the tool are provided. The idea behind the embodiments of the invention that, a so called operation point, representing the most representative traffic mix on a link shall be defined to calculate the effective bandwidth of a connection. In accordance with the implementation, the dimensioning method uses an inverted Call Admission Control (CAC) method and Offered Load to calculate effective bandwidths. The effective bandwidths are then used in the Kaufman-Roberts formula for network dimensioning. The inverted CAC method calculates the minimum capacity required to admit a given number of connections from different traffic classes. The operation point of the system is calculated based on the Offered Load and Grade of Service (GoS) requirement. The effective bandwidths are then calculated using the operation point.

    Abstract translation: 在分组交换电信网络中，提供了根据该方法并在该工具的帮助下确定尺寸的方法，尺寸标注工具和网络连接。 应当定义本发明实施例背后的想法，即所谓的操作点，表示链路上最具代表性的流量混合，以计算连接的有效带宽。 根据实施，尺寸标注方法使用反向呼叫接纳控制（CAC）方法和提供的负载来计算有效带宽。 然后在Kaufman-Roberts公式中使用有效带宽进行网络尺寸标注。 反向CAC方法计算从不同流量类别接收给定数量的连接所需的最小容量。 系统的运行点是根据提供的负载和服务等级（GoS）要求计算出来的。 然后使用操作点计算有效带宽。

    METHOD AND APPARATUS FOR NETWORK TREE MANAGEMENT
    3.
    发明申请
    METHOD AND APPARATUS FOR NETWORK TREE MANAGEMENT 审中-公开
    网络树管理方法和装置

    公开(公告)号：WO2008087547A3

    公开(公告)日：2008-09-12

    申请号：PCT/IB2008000119

    申请日：2008-01-18

    Applicant: ERICSSON TELEFON AB L M ,  FARKAS JANOS ,  ANTAL CSABA ,  TAKACS ATTILA ,  SALTSIDIS PANAGIOTIS

    Inventor： FARKAS JANOS ,  ANTAL CSABA ,  TAKACS ATTILA ,  SALTSIDIS PANAGIOTIS

    IPC: H04L12/46 ,  H04L12/56

    CPC classification number: H04L12/462 ,  H04L45/02 ,  H04L45/025 ,  H04L45/04 ,  H04L45/48

    Abstract: There is disclosed a manner of managing the active topology, that is the scheme for forwarding data, in a computer network such as an Ethernet local area network. A root bridge is selected from a plurality of bridges in the network; the root bridge calculating at least one spanning tree from a topology database that has been populated by bridge neighbor information gleaned from link state advertising messages. The root bridge may also calculate an alternate topology for implementation in the event a failure condition that affects the primary spanning tree is detected. The root bridge then advertises the spanning tree and remotely configures the port states of the bridges in the spanning tree through tree advertising messages that the bridges are arranged to process and set their ports accordingly.

    Abstract translation: 公开了在诸如以太网局域网的计算机网络中管理活动拓扑的方式，即用于转发数据的方案。 从网络中的多个网桥中选择根网桥; 该根桥根据拓扑数据库计算至少一个生成树，该拓扑数据库已经由从链路状态通告消息中收集的网桥邻居信息填充。 如果检测到影响主生成树的故障条件，则根桥还可以计算实施的替代拓扑。 然后，根网桥通告生成树并通过树布告消息远程配置生成树中网桥的端口状态，网桥布置为处理并相应地设置其端口。

    Protocolo de registro múltiple del árbol
    4.
    发明专利
    Protocolo de registro múltiple del árbol 未知

    公开(公告)号：ES2394054T3

    公开(公告)日：2013-01-16

    申请号：ES08875814

    申请日：2008-11-15

    Applicant: ERICSSON TELEFON AB L M

    Inventor： FARKAS JANOS ,  ANTAL CSABA ,  TAKACS ATTILA

    IPC: H04L12/46 ,  H04L45/02

    Abstract: Un procedimiento para registrar un árbol en una red que tiene puentes de múltiples puertos interconectados, que comprende las etapas de: definir una pluralidad de componentes de aplicación, cada componente corresponde a un participante; definir una pluralidad de componentes de declaración de atributos que corresponde a los componentes de aplicación; declarar y registrar los valores de los atributos mediante los componentes de aplicación; y producir y extraer los valores de los atributos mediante los correspondientes componentes de declaración de la aplicación; y controlar, mediante uno de la pluralidad de componentes de aplicación, un contexto de árbol dinámico, el contexto de árbol dinámico define un conjunto de puertos del puente de los puentes de múltiples puertos interconectados que pueden ser parte del árbol, en el que el árbol define una topología activa en una red Ethernet, caracterizado porque: el único de la pluralidad de componentes de aplicación utiliza una unidad de datos del protocolo de registro múltiple, "MRPDU", para la comunicación entre los participantes, y la MRPDU contiene la descripción del árbol completo.

    8.
    发明专利
    未知

    公开(公告)号：AT524905T

    公开(公告)日：2011-09-15

    申请号：AT04749187

    申请日：2004-07-27

    Applicant: ERICSSON TELEFON AB L M

    Inventor： MATEFI GERGELY ,  ANTAL CSABA ,  FARKAS JANOS

    IPC: H04L12/54 ,  H04L47/2416 ,  H04L47/80

    Abstract: 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.

    9.
    发明专利
    未知

    公开(公告)号：AT447280T

    公开(公告)日：2009-11-15

    申请号：AT04797782

    申请日：2004-11-10

    Applicant: ERICSSON TELEFON AB L M

    Inventor： MIHALY ATTILA ,  ANTAL CSABA

    IPC: H04L12/54

    Abstract: For efficient and fast admission control with respect to a new session and for exchange of data stream packets between an edge router (14) and a packet gateway (10) it is proposed to execute, at the edge router (14), selection of traffic streams of certain types from specific source nodes and target nodes and to also execute related traffic conditioning. Then, having selected specific data packet streams, the edge router (16) remarks data packets when the data packet streams are not in conformance with a predetermined traffic profile. This remarking serves as a performance indication for the packet gateway session admission control mechanism. In other words, the packet gateway (10) considers the number of remarked packets and determines on admission control for a new data packet stream session as a function of the number of remarked packets.

    Method and apparatus for Ethernet protection with local re-routing
    10.
    发明专利
    Method and apparatus for Ethernet protection with local re-routing 未知

    公开(公告)号：AU2009226921A1

    公开(公告)日：2009-09-24

    申请号：AU2009226921

    申请日：2009-03-16

    Applicant: ERICSSON TELEFON AB L M

    Inventor： TAKACS ATTILA ,  FARKAS JANOS ,  ANTAL CSABA

    IPC: H04L12/56 ,  H04L45/28

    Abstract: A method is provided for use at a first node of a network. The first node (B) has an input path for receiving Ethernet frames destined for a second node of the network. The first node (B) also has a first output (working) path for forwarding the received Ethernet frames towards the second node. A failure along the first output (working) path is detected at the first node. Following such failure detection, the received Ethernet frames are caused, at the first node, to be re-routed along a second output (backup) path, different to the first output (working) path, towards the second node. The re-routing is performed by using (e.g. referring to and/or changing) respective indications (VLAN1) applied to the Ethernet frames to distinguish those Ethernet frames to be forwarded along the first output (working) path from those Ethernet frames to be forwarded along the second output (backup) path.

Patent Agency Ranking