会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 25. 发明授权
    • Routing calls in a telecommunications network on the basis of passband
    • 在通信网络的基础上路由呼叫
    • US06600722B1
    • 2003-07-29
    • US09416264
    • 1999-10-12
    • Nhut Quan TranCao Thanh Phan
    • Nhut Quan TranCao Thanh Phan
    • H04J1500
    • H04Q3/66H04L45/12H04L45/123H04Q2213/13056H04Q2213/13141H04Q2213/13148H04Q2213/13332H04Q2213/13342H04Q2213/1338H04Q2213/13384
    • The invention relates to a method of routing a call in a network having a plurality of nodes interconnected by trunks, the method including calculating the costs of different routes for taking the call, and selecting a route as a function of cost. According to the invention, the cost of a route is a function of the bandwidth available on the trunks making up the route, of the resources available on said trunks, and of the bandwidth required for the call. The cost of a trunk can be represented in the form of a vector whose first component is a decreasing function of the available bandwidth, and whose second component is a decreasing function of available resources. The invention makes it possible, when routing a call, to take account of quality of service in terms of bandwidth. If the second component is a function that has a value that is constant above some quantity of available resources, then the invention makes it possible to limit the number of routing calculations performed, and to avoid making new routing calculations so long as the topology of the network remains unchanged.
    • 本发明涉及一种在网络中路由呼叫的方法,该网络具有通过中继线互连的多个节点,该方法包括计算用于接入呼叫的不同路由的成本,以及选择作为成本的函数的路由。 根据本发明,路由的成本是组成路由的中继线,可用于所述中继线上的资源以及呼叫所需的带宽的可用带宽的函数。 中继线的成本可以以向量的形式表示,该向量的第一个分量是可用带宽的递减函数,其第二个分量是可用资源的递减函数。 本发明使得在路由呼叫时可以考虑带宽方面的服务质量。 如果第二个组件是具有一定数量的可用资源的值的函数,那么本发明可以限制所执行的路由计算的数量,并且避免进行新的路由计算,只要该 网络保持不变。
    • 26. 发明授权
    • Linear programming method of networking design for carrying traffic from endnodes to a core network at least cost
    • 用于从端点到核心网络承载流量的网络设计的线性规划方法至少成本
    • US06363334B1
    • 2002-03-26
    • US09255945
    • 1999-02-23
    • Daniel Matthew AndrewsYihao Lisa Zhang
    • Daniel Matthew AndrewsYihao Lisa Zhang
    • G06F1750
    • H04Q3/0083H04Q2213/13054H04Q2213/13148H04Q2213/13298H04Q2213/13383
    • A method is disclosed, for designing an access network that is to carry communication traffic between end nodes and a core network. Information is provided that describes end node locations, the level of demand associated with each end node, available trunk types and their related capacities, and a cost structure. The cost structure includes a fixed overhead cost for each trunk type, and a service charge per unit distance for each trunk type. The provided information is incorporated in a linear program to find an optimal-cost access network. The linear program is solved to obtain a provisional solution that defines the composition and usage of each link of the optimal-cost access network. For each such link, the composition is defined by a fractional level of investment (incurring a like fraction of the corresponding overhead charge) in each pertinent trunk type. The provisional solution is rounded such that each trunk in which there is a fractional investment is either removed, or replaced by a trunk in which there is an integral investment.
    • 公开了一种用于设计用于承载终端节点和核心网络之间的通信业务的接入网络的方法。 提供了描述终端节点位置,与每个端节点相关联的需求级别,可用中继线类型及其相关容量以及成本结构的信息。 成本结构包括每个中继类型的固定开销成本,以及每个中继类型的每单位距离的服务费用。 所提供的信息被并入到线性程序中以找到最优成本的接入网络。 解决线性程序以获得定义最优成本接入网络的每个链路的组成和使用的临时解决方案。 对于每个这样的链接,组合物由每种相关行业类型中的投资级别(产生相应的开销费用的相似部分)来定义。 临时解决方案是圆形的,使得其中存在分数投资的每个中继线被去除,或者被具有整体投资的中继线所取代。
    • 27. 发明授权
    • Method and system for efficient link utlization
    • 方法和系统有效的链接利用
    • US06343073B1
    • 2002-01-29
    • US09002144
    • 1997-12-31
    • Alexander Mashinsky
    • Alexander Mashinsky
    • H04L1228
    • H04Q3/66H04Q11/0457H04Q2213/13091H04Q2213/13095H04Q2213/13103H04Q2213/13106H04Q2213/1313H04Q2213/13141H04Q2213/13148H04Q2213/13176H04Q2213/13209H04Q2213/13251H04Q2213/1329H04Q2213/13332H04Q2213/13353H04Q2213/13377
    • A method and system for dynamic utilization of the available bandwidth on existing ISDN and other broadband links is disclosed. In a first preferred embodiment, an efficient link-utilization system comprises first and second telecommunication nodes connected by one or more ISDN links or other broadband connections. When a caller desires to place a call from a communication device served by the first telecommunication node to a communication device served by the second telecommunication node, the first telecommunication node determines whether an existing broadband link connecting the first and second telecommunication nodes has sufficient available bandwidth to carry the call in compressed form from the calling communication device to the called communication device. If such an existing telephonic link is identified, the first telecommunications node compresses the transmission received from the caller and transmits the compressed transmission to the second telecommunications node via the available bandwidth on the existing telephonic link. The second telecommunications node decompresses the transmission and transmits the decompressed transmission to the called party. The disclosed efficient link utilization system may be employed by node operators to provide distinct classes of service to their customers, including guaranteed connection service and non-guaranteed connection service. In additional preferred embodiments, the principles of the invention are extended to multiple node arrangements.
    • 公开了一种在现有ISDN和其他宽带链路上动态利用可用带宽的方法和系统。 在第一优选实施例中,有效的链路利用系统包括由一个或多个ISDN链路或其他宽带连接连接的第一和第二电信节点。 当呼叫者期望将来自第一电信节点服务的通信设备的呼叫发送到由第二电信节点服务的通信设备时,第一电信节点确定连接第一和第二电信节点的现有宽带链路是否具有足够的可用带宽 将来自呼叫通信设备的压缩形式的呼叫携带到被叫通信设备。 如果识别出这样的现有电话链路,则第一电信节点压缩从呼叫者接收的传输,并且通过现有电话链路上的可用带宽将压缩的传输发送到第二电信节点。 第二电信节点解压缩传输并将解压缩的传输发送到被叫方。 所公开的有效链路利用系统可以由节点运营商使用,以向其客户提供不同类别的服务,包括有保证的连接服务和无保证的连接服务。 在另外的优选实施例中,本发明的原理被扩展到多个节点布置。
    • 29. 发明授权
    • Method of allocating international transit traffic among a plurality of
carriers in a terminating country
    • 在终止国家的多个承运人之间分配国际过境业务的方法
    • US5406620A
    • 1995-04-11
    • US166479
    • 1993-12-14
    • Eric T. Pei
    • Eric T. Pei
    • H04M15/00H04M3/00H04M7/00H04Q3/545H04Q3/66H04M7/12
    • H04Q3/66H04Q2213/13103H04Q2213/13141H04Q2213/13148H04Q2213/13204H04Q2213/13353
    • Disclosed is a system for allocating international transit calls among a plurality of carriers in a terminating country in accordance with routing information that has been previously specified by the originating carrier. Originating carriers may select one of a plurality of routing treatment options which specify how international transit calls should be allocated among the plurality of carriers serving a given terminating country. Carrier treatment tables maintain the routing information specified by each originating carrier for each terminating country. Upon receipt of an international transit call, an originating gateway switch can access the appropriate carrier treatment table and retrieve the routing information specified by the originating carrier for the indicated terminating country. In this manner, a terminating carrier can be selected to receive the transit call based on the routing information previously specified by the originating carrier.
    • 公开了一种用于根据先前由始发运营商指定的路由信息​​在终止国家的多个运营商中分配国际公交呼叫的系统。 起始运营商可以选择多个路由选择处理选项中的一个,其指定如何在服务给定终止​​国家的多个载波中分配国际公交呼叫。 运营商处理表维护每个终止国家由每个发起运营商指定的路由信息​​。 在接收到国际中转呼叫时,始发网关交换机可以访问适当的运营商处理表,并检索由所指定的终止国家的始发运营商指定的路由信息​​。 以这种方式,可以基于由始发运营商先前指定的路由信息​​来选择终接载波来接收中转呼叫。
    • 30. 发明授权
    • Method and apparatus for routing communications among computer networks
    • 用于在计算机网络之间路由通信的方法和装置
    • US5088032A
    • 1992-02-11
    • US149820
    • 1988-01-29
    • Leonard Bosack
    • Leonard Bosack
    • H04Q3/66
    • H04Q3/665H04Q2213/13141H04Q2213/13148H04Q2213/13196H04Q2213/13204
    • An improved method and apparatus for routing data transmissions among computer networks. The computer networks are interconnected with a series of gateway circuits. Each gateway identifies all destination computers to which it is connected and identifies the path or paths to each destination computer. For each identified path, the gateway stores the topological delay time for a transmission, the path bandwidth for the narrowest bandwidth segment of a path and a number corresponding to the reliability of the path. When a transmission is received, the gateway examines the various paths in accordance with a predetermined algorithm which also considers the channel occupancy of each path to determine a best path for transmision. The data transmission is then directed over the best path. If more than one path exists, the data may be directed in multiplex fashion over two or more paths with the amount of data on each path being related to the quality of the path. The routing information to destination networks is broadcast periodically by each gateway circuit to its neighboring gateway circuits.
    • 一种用于在计算机网络之间路由数据传输的改进的方法和装置。 计算机网络与一系列网关电路互连。 每个网关标识所连接的所有目标计算机,并标识到每个目标计算机的路径或路径。 对于每个识别的路径,网关存储传输的拓扑延迟时间,路径的最窄带宽段的路径带宽和对应于路径可靠性的数量。 当接收到传输时,网关根据预定的算法检查各种路径,该预定算法还考虑每个路径的信道占用以确定用于传输的最佳路径。 数据传输然后被引导到最佳路径上。 如果存在多于一个路径,则可以以多路复用方式在两条或多条路径上引导数据,其中每路径上的数据量与路径的质量相关。 目的地网络的路由信息​​由每个网关电路周期性地广播到其相邻网关电路。