会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Method and apparatus interconnection of local area networks with wide area networks
    • 局域网与广域网的方法和设备互连
    • US06463064B1
    • 2002-10-08
    • US08512598
    • 1995-08-10
    • Eric Charles BroockmanDavid Barrett BryantLap Thiet HuynhJoseph L. McKinnon
    • Eric Charles BroockmanDavid Barrett BryantLap Thiet HuynhJoseph L. McKinnon
    • H04L1244
    • H04L12/4604
    • The method and apparatus of the present invention may be utilized to interconnect multiple local area networks to a data processing network including both multiple network nodes having routing and functional capability within the data processing network and multiple endpoint nodes having only local address capability, while minimizing the amount of routing information which must be maintained within the data processing network. A concentrator node is established for interconnection between each of the multiple local area networks and the data processing network. The concentrator node includes a network node interface having routing and functional capability for an associated local area network and an endpoint node interface having local address capability. When interconnected between a local area network and a selected network node within the data processing network, the concentrator node emulates a network node within the local area network while appearing as an endpoint node within the data processing network. The concentrator node maintains routing information for communication between the local area network and the data processing network in two segments. The first segment details the route between the local area network and the concentrator node while a second segment details the route between the concentrator node and a node within the data processing network.
    • 本发明的方法和装置可用于将多个局域网连接到数据处理网络,数据处理网络包括具有数据处理网络内的路由和功能能力的多个网络节点以及仅具有本地地址能力的多个端点节点,同时最小化 必须在数据处理网络内维护的路由信息​​量。 建立集中器节点用于在多个局域网和数据处理网络中的每一个之间进行互连。 集中器节点包括具有用于相关联的局域网的路由和功能能力的网络节点接口以及具有本地地址能力的端点节点接口。 当在局域网和数据处理网络内的所选网络节点之间互连时,集中器节点模拟局域网内的网络节点,同时在数据处理网络中显示为端点节点。 集中器节点维护用于局域网和数据处理网络之间的通信的路由信息​​两段。 第一段详细说明局域网与集中器节点之间的路由,而第二段详细说明集中器节点与数据处理网络内节点之间的路由。
    • 2. 发明授权
    • Adaptive universal multiple access
    • 自适应通用多路访问
    • US06252881B1
    • 2001-06-26
    • US09430512
    • 1999-10-29
    • Stanislav Ivanovich Samoylenko
    • Stanislav Ivanovich Samoylenko
    • H04L1244
    • H04L12/4035H04L12/40169
    • An Adaptive universal multiple access (AUMA) apparatus and method for collision-free, high efficiency multiple access to a shared media uses a corrector to control access to ports in a hub. The corrector assigns each node an active or passive state and subdivides each transmission cycle into NA sub-cycles, where NA is the number of active nodes in the network. The corrector is configured so that each active node is accessed during one sub-cycle. AUMA may be implemented in repeaters, head-ends, or network interface cards in wired, or wireless networks. To provide efficient utilization AUMA has several mechanisms of automatic adaptation to network topology, lengths of media, node activity, bursty traffic, and speed of transmission. AUMA is compatible with standard Ethernet and can be used in Ethernet environment, including mixed networks, where some nodes are UMA nodes, and the other are standard Ethernet nodes.
    • 用于无冲突,高效率多次访问共享介质的自适应通用多址(AUMA)装置和方法使用校正器来控制对集线器中的端口的访问。 校正器将每个节点分配为主动或被动状态,并将每个传输周期细分为NA个子周期,其中NA是网络中的活动节点数。 校正器被配置为使得每个活动节点在一个子周期期间被访问.AUMA可以在有线或无线网络中的中继器,头端或网络接口卡中实现。 为了提供高效利用AUMA具有自动适应网络拓扑,媒体长度,节点活动,突发业务和传输速度的几种机制。 AUMA与标准以太网兼容,可用于以太网环境,包括混合网络,其中一些节点是UMA节点,另一个节点是标准以太网节点。
    • 3. 发明授权
    • Implementation of access service
    • 实现接入服务
    • US06240091B1
    • 2001-05-29
    • US08955561
    • 1997-10-17
    • Philip GinzboorgJan-Erik Gustav EkbergPekka Johannes LaitinenAntti Ylä-J{umlaut over (aa)}ski
    • Philip GinzboorgJan-Erik Gustav EkbergPekka Johannes LaitinenAntti Ylä-J{umlaut over (aa)}ski
    • H04L1244
    • H04L29/12009H04L12/14H04L12/1403H04L12/1414H04L12/1421H04L12/1425H04L12/1428H04L12/1453H04L12/1464H04L12/1471H04L12/1482H04L12/1485H04L12/2801H04L12/2856H04L61/00H04L63/12H04L69/16H04L69/167H04M15/09H04M15/8033H04M2215/22H04M2215/66H04M2215/7435
    • The invention relates to the implementation of an access service in a telecommunications network comprising an access network, a network providing services, and user-operated terminals which are connected to the access network. The access service is offered by connecting the user terminal to the network providing the services through interface elements which connect the access network and the network providing the services. As a response to the access service at least one charging record is generated. The record is transferred to billing means for billing the access service subscriber for the access service. So that it would be possible to combine the access service with reliable and versatile billing in a connectionless network, the terminal is used to generate charging messages which are provided with a subscriber-specific digital signature, and the signatures generated by the terminal are verified outside of the terminal. The terminal is given access to the network providing the services, if said messages are received in an acceptable manner. The terminal sends the network data about the subscriber associated with the current user of the terminal, whereby said data are used to verify the validity of the signatures and to target the charging messages received from the terminal at the billing of the subscriber in question.
    • 本发明涉及电信网络中接入业务的实现,包括接入网络,提供业务的网络和连接到接入网络的用户操作终端。 通过将用户终端连接到网络来提供接入服务,通过连接接入网络和提供服务的网络的接口元件来提供服务。 作为对访问服务的响应,生成至少一个计费记录。 该记录被转移到计费装置,用于对接入服务的接入服务订户进行计费。 因此,可以将接入业务与无连接网络中的可靠且通用的计费结合起来,终端用于产生具有用户特定数字签名的计费消息,由终端生成的签名在外部进行验证 的终端。 如果以可接受的方式接收到所述消息,则终端被授予对提供服务的网络的访问。 终端发送关于与终端的当前用户相关联的用户的网络数据,由此所述数据用于验证签名的有效性,并且在所述用户的计费时针对从终端接收的计费消息。
    • 5. 发明授权
    • Traffic route finder in communications network
    • 通信网络中的路由查找器
    • US06310883B1
    • 2001-10-30
    • US09044889
    • 1998-03-20
    • Jason Warren MannJohn Ian TurnerAnthony Richard Phillip White
    • Jason Warren MannJohn Ian TurnerAnthony Richard Phillip White
    • H04L1244
    • H04Q11/0478H04J2203/0053H04J2203/0069H04L45/12H04L45/24H04L2012/562H04L2012/5642H04L2012/5651
    • A route finder for point to multi-point connection requests in a communications network comprising a plurality of nodes connected by a plurality of links. A cost is assigned to each network link. For each connection request a set of all network nodes not included in its source node or its plurality of destination nodes are selected. An array of bits is created with an array element corresponding to a selected node element having a value of 1 if the node is steiner vertex for a steiner tree of nodes not selected, otherwise the array element has a value of 0. Each array is treated as a bit string and considered as population members which are manipulated by genetic algorithms. The fitness of the population members is evaluated by calculating the cost of traversing the routes represented by the bit strings. The method is capable of routing a plurality of multi-point connection requests, and selecting an overall optimum solution.
    • 一种用于在包括由多个链路连接的多个节点的通信网络中的点对多点连接请求的路线寻找器。 每个网络链路分配一个成本。 对于每个连接请求,选择未包括在其源节点或其多个目的地节点中的一组所有网络节点。 如果节点是未选择的节点的steiner树的节点顶点,则使用与所选节点元素相对应的数组元素来创建位数组,否则数组元素的值为0.每个数组被处理 作为一个字串,被认为是由遗传算法操纵的人口成员。 通过计算遍历由位串表示的路由的成本来评估人口成员的适应度。 该方法能够路由多个多点连接请求,并且选择整体最优解。
    • 6. 发明授权
    • Method and apparatus for efficient topology aggregation for networks with hierarchical structure
    • 用于具有分层结构的网络的有效拓扑聚合的方法和装置
    • US06246689B1
    • 2001-06-12
    • US09157858
    • 1998-09-21
    • Yuval Shavitt
    • Yuval Shavitt
    • H04L1244
    • H04L45/02H04L45/10H04L45/46H04L45/48H04L2012/5621H04L2012/5623H04Q11/0478
    • Efficient topology aggregation is realized by generating a full-mesh topology from an original sub-network topology, without compromising accuracy. Then, the full-mesh topology is reduced to a first spanning tree aggregation topology. Distortion in the first spanning tree aggregation topology is evaluated to determine if the resultant spanning tree aggregation topology requires further refinement in order to meet a predetermined distortion criterion. If no further refinement is required, the aggregation topology is advertised. Additionally, a network parameter, e.g., a so-called network radius is generated from the full-mesh topology. In this example, the network parameter is evaluated along with the first spanning tree aggregation topology to determine if the spanning tree aggregation topology requires further refinement. If no further refinement is required, both the aggregation topology and the network parameter are advertised.
    • 通过从原始子网络拓扑生成全网状拓扑而不影响精度,实现高效的拓扑聚合。 然后,全网状拓扑被简化为第一个生成树聚合拓扑。 评估第一个生成树聚合拓扑中的失真,以确定结果生成树聚合拓扑是否需要进一步细化,以满足预定的失真准则。 如果不需要进一步细化,则会通告聚合拓扑。 此外,从全网状拓扑生成网络参数,例如所谓的网络半径。 在此示例中,网络参数与第一个生成树聚合拓扑一起进行评估,以确定生成树聚合拓扑是否需要进一步细化。 如果不需要进一步细化,则会通告聚合拓扑和网络参数。
    • 8. 发明授权
    • Mechanism for splicing trees
    • 拼接树木的机制
    • US06798739B1
    • 2004-09-28
    • US09588904
    • 2000-06-07
    • Cheng Yin Lee
    • Cheng Yin Lee
    • H04L1244
    • H04L45/18H04L45/02H04L45/16H04L45/48
    • A method for detecting a routing loop when repairing a bidirectional multicast distribution tree is disclosed. According to the method, a splice message is launched from an originating node attempting to join a bidirectional multicast tree and is sent to a root-node to find out if a routing loop is formed when a node is joining the multicast distribution tree. Depending on the multicast application requirement, when a routing loop is detected during the repairing of a multicast distribution tree, the severed node may abort, or the repair can be deferred until the connection to the root-node is re-established. The loop detection and loop prevention method of the invention may be used as a loop avoidance mechanism with any protocol for repairing a partitioned tree.
    • 公开了一种在修复双向组播分发树时检测路由环路的方法。 根据该方法,从尝试加入双向多播树的始发节点发起拼接消息,并将其发送到根节点,以查明当节点正在加入多播分发树时是否形成路由环路。 根据组播应用需求,当修复组播分发树期间检测到路由环路时,切断的节点可能会中止,否则可以延迟修复,直到重新建立到根节点的连接。 本发明的环路检测和环路防止方法可以用作具有用于修复分区树的任何协议的环路回避机制。
    • 9. 发明授权
    • Method and system for sharing reserved bandwidth between several dependent connections in high speed packet switching networks
    • 用于在高速分组交换网络中的多个相关连接之间共享保留带宽的方法和系统
    • US06647008B1
    • 2003-11-11
    • US09097131
    • 1998-06-12
    • Claude GalandMarcel Villaflor
    • Claude GalandMarcel Villaflor
    • H04L1244
    • H04L12/5602
    • A method for establishing a network connection through a link issuing from a physical port is disclosed. The link has an aggregation of connections. The network connection has a required capacity. The method first computes, from mean bit rates of the aggregation of connections, a mean aggregate bit rate over the aggregation of connections. The method secondly computes, from burst durations from the aggregation of connections, a mean aggregate burst duration over the aggregation of connections. The method thirdly computes an equivalent capacity required on the link by the aggregation of connections, the equivalent capacity being a function of the mean aggregate bit rate and the mean aggregate burst duration. The method fourthly computes an aggregate equivalent capacity, the aggregate equivalent capacity being a function of the equivalent capacity and the required capacity of the connection. The method fifthly computes a bandwidth that would be reserved on the link after establishing the connection, the bandwidth being a minimum of a Gaussian approximation and the aggregate equivalent capacity. Then the network connection is established if the bandwidth is less than or equal to a total capacity for the link.
    • 公开了一种通过从物理端口发出的链路建立网络连接的方法。 链接具有连接的聚合。 网络连接具有所需容量。 该方法首先从连接聚合的平均比特率计算出连接聚合上的平均聚合比特率。 该方法第二次从连接聚合的突发持续时间计算在连接聚合上的平均聚合突发持续时间。 该方法第三次通过连接的聚合计算链路上所需的等效容量,等效容量是平均聚合比特率和平均聚合突发持续时间的函数。 该方法第四次计算聚合当量容量,聚合当量容量是等效容量和连接所需容量的函数。 该方法第五计算在建立连接之后将在链路上保留的带宽,带宽是高斯近似的最小值和聚合当量容量。 那么如果带宽小于或等于链路的总容量,则建立网络连接。