会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 21. 发明专利
    • Protocolo de registro múltiple del árbol
    • ES2394054T3
    • 2013-01-16
    • ES08875814
    • 2008-11-15
    • ERICSSON TELEFON AB L M
    • FARKAS JANOSANTAL CSABATAKACS ATTILA
    • H04L12/46H04L45/02
    • 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.
    • 27. 发明专利
    • Optimising packet switched networks
    • GB2452535A
    • 2009-03-11
    • GB0717408
    • 2007-09-07
    • ERICSSON TELEFON AB L M
    • VUOPIONPERA RAIMOTAKACS ATTILADORTSCHY BORISALMEIDA HENRIKBADER ATTILA
    • H04L12/56H04L45/24
    • A method of routing packets between nodes of a packet switched network comprises receiving a packet at a first node, the packet comprising routing information and payload data, sending the routing information to a second node in the routing path via a first transmission medium having a relatively high transmission speed, and sending said payload data to said second node via a second transmission medium having a relatively low transmission speed. Upon receipt of said routing information, said second node is able to prepare or begin preparation for onward routing of the packet in advance of receipt of said payload. The first medium may comprise a radio interface or copper wire and the second medium may comprise a fibre optic cable. Alternatively, the first and second transmission media may be provided as different channels across the same physical transmission path and may take advantage of the fact that lower and higher frequencies travel at different speeds in a fibre optic cable. The method may be used to quickly set up priority paths for emergency calls via Resource Reservation Protocol (RSVP) or for national security related data transmissions and may also be used to provide different QoS classes in the Next Steps in Signalling (NSIS) protocol.
    • 30. 发明专利
    • EDGE NODE FOR A NETWORK DOMAIN
    • CA2667108C
    • 2015-10-20
    • CA2667108
    • 2006-11-10
    • ERICSSON TELEFON AB L M
    • BADER ATTILATAKACS ATTILACSASZAR ANDRAS
    • H04L47/31
    • An egress node is proposed for a network domain that comprises at least one ingress node for receiving and routing data units belonging to a plurality of flows into said network domain, a plurality of interior routers for routing said data units through said network domain, and said egress node(s). One or more of the interior routers is arranged to detect whether it is subject to a congestion condition and to congestion mark routed data units if it is subject to said congestion condition. The egress node comprises a control element arranged for performing a congestion handling function that comprises a part for detecting the presence of congestion marked data units arriving at said edge node, and a part for reacting to the detection of the presence of congestion marked data units by invoking a congestion control process. The congestion control comprises sending to said ingress node an instruction for terminating one or more flows to thereby reduce a traffic load, waiting a predetermined period of time and then determining whether congestion marked data units are still arriving at said edge node, and if congestion marked data units are still arriving, repeating the sending and waiting steps.