会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 3. 发明授权
    • Distributed call admission and load balancing method and apparatus for packet networks
    • 分组呼叫接入和分组网络的负载均衡方法和装置
    • US06778496B1
    • 2004-08-17
    • US09589304
    • 2000-06-07
    • Gopalakrishnan MeempatDavid J. Houck
    • Gopalakrishnan MeempatDavid J. Houck
    • H04L1228
    • H04L45/123H04L45/22H04L45/302H04L45/38H04L47/10H04L47/11H04L47/125
    • A method and apparatus to control call admission to a packet-based network and achieve load balancing over a packet-based network includes at selected times generating and sending a path status message along a defined path, such as an MPLS path, through the network. As the message travels along the path, a cost metric field within the message is updated. The cost metric may reflect available bandwidth, or percentage utilization of the aggregate bandwidth, on the most congested (bottleneck) link in the path that it tracks. The cost metric is determined for each link at a data measuring point, such as individual routers, along the path. The optimum path between two gateways is determined, and further packet streams are routed onto the optimum path. In the event that no paths between a source and destination gateway meet predetermined utilization criteria, a packet stream block indicator is set which shows a requesting edge router that no paths are currently available for a packet stream requesting routing between particular source and destination gateway. The path utilization status message may be generated alternately in routers or in a master gateway. In either case, the messages are sent and the status of the network is determined in a distributed fashion at selected times, such as a regular timed interval.
    • 控制对基于分组的网络的呼叫许可并且在基于分组的网络上实现负载平衡的方法和装置包括在选定的时间沿着诸如MPLS路径的定义的路径生成和发送路径状态消息。 当消息沿着路径行进时,消息内的成本度量字段被更新。 成本度量可以反映其跟踪的路径中最拥塞(瓶颈)链路的可用带宽或总带宽的百分比利用率。 为数据测量点的每个链路确定成本度量,例如沿路径的单个路由器。 确定两个网关之间的最佳路径,并且进一步的分组流被路由到最佳路径上。 在源和目的地网关之间没有路径满足预定的利用标准的情况下,设置分组流块指示符,其显示请求边缘路由器,所述请求边缘路由器当前没有路径可用于请求在特定源和目的地网关之间路由的分组流。 可以在路由器或主网关中交替地产生路径利用状态消息。 在任一种情况下,发送消息,并且在选定的时间(例如,定时间隔)以分布式方式确定网络的状态。
    • 4. 发明授权
    • Synchronization methods for distributed processing systems having
replicated data
    • 具有复制数据的分布式处理系统的同步方法
    • US6021118A
    • 2000-02-01
    • US795263
    • 1997-02-10
    • David J. HouckKin K. LeungPeter M. Winkler
    • David J. HouckKin K. LeungPeter M. Winkler
    • G06F15/173H04L12/28H04J3/06
    • G06F15/17381
    • A data synchronization system, which in one embodiment, uses a ShuffleNet topology requiring an even number, N=2m, of nodes in the system. These nodes are organized into two sets, X=x.sub.0, . . . , x.sub.m-1 and Y=y.sub.0, . . . , y.sub.m-1, wherein the subscripts are always to be taken modulo m. Each "round" of communication entails simultaneously synchronizing the nodes in X with nodes in Y according to a matching between the two sets. The rounds are grouped into two "batches," batch B.sub.j which consists of rounds R.sub.2j-1 and R.sub.2j-2 for j.gtoreq.1. During each odd batch B.sub.2j-1, each x.sub.i synchronizes with y.sub.2i+2j-2 and with y.sub.2i+2j-1. In another embodiment, the data synchronization is based on a hypercube scheme, wherein each node is labeled by a binary string and any two nodes with their labels differing by one bit are connected by an edge and only adjacent nodes, i.e. those nodes connected by an edge, can communicate and exchange data directly according to an update schedule. In a third embodiment, a hypercube scheme is used, but the number of nodes is assumed to be a power of 2 or N=2.sup.m. This embodiment, like the second embodiment, uses the labeling of nodes by their binary representation, but the matchings of nodes used to determine the update schedule is not confined to the hypercube edges. Instead, a general cyclic matching scheme is used.
    • 数据同步系统在一个实施例中使用需要系统中偶数N = 2m的节点的ShuffleNet拓扑。 这些节点被组织成两组,X = x0,。 。 。 ,xm-1和Y = y0,。 。 。 ,ym-1,其中下标总是被取为模m。 每个“圆”通信需要根据两组之间的匹配同时使X中的节点与Y中的节点同步。 这些轮分为两个“批次”,批次Bj由j> / = 1的轮次R2j-1和R2j-2组成。 在每个奇数批次B2j-1期间,每个xi与y2i + 2j-2和y2i + 2j-1同步。 在另一个实施例中,数据同步基于超立方体方案,其中每个节点由二进制串标记,并且其标签不同于一位的任何两个节点由边缘连接,并且仅相邻节点连接,即通过 边缘,可以根据更新时间表直接进行数据交换和交换。 在第三实施例中,使用超立方体方案,但是假定节点数为2或N = 2m的幂。 该实施例与第二实施例一样,通过其二进制表示来使用节点的标注,但是用于确定更新时间表的节点的匹配不限于超立方体边缘。 相反,使用一般的循环匹配方案。
    • 8. 发明授权
    • Method and apparatus to provide centralized call admission control and load balancing for a voice-over-IP network
    • 为IP语音网络提供集中呼叫准入控制和负载均衡的方法和装置
    • US06904017B1
    • 2005-06-07
    • US09566537
    • 2000-05-08
    • Gopalakrishnan MeempatDavid J. Houck
    • Gopalakrishnan MeempatDavid J. Houck
    • H04L29/06H04M7/00H04J1/16
    • H04L65/1043H04L29/06027H04L47/70H04L47/781H04L47/828H04L65/103H04L65/104H04L65/1069H04L65/80H04M7/1245
    • An admission control and load balancing system controls admission of packet streams or calls to a network and balances the packet traffic across the network, improving quality of service. The system includes a central database which stores information including cost data associated with individual paths and links across the network. A processor, in communication with the database, coordinates the admission control and load balancing decisions, and updates of the database cost data to reflect the dynamic network conditions, based on input from appropriate data sources. In one embodiment, referred to as the exact algorithm, the database is consulted by the admission control points or gatekeepers prior to admitting each arriving packet stream, and the database contents are updated call-by-call to reflect the allocation of resources to each admitted stream. In another embodiment, referred to as the inexact algorithm, control decision as well as database updates occur on a periodic rather than on a call-by-call basis to promote better scalability. In this embodiment, the processor periodically calculates admission decisions based on cost data in the central database. These admission decisions are then periodically forwarded to a satellite database associated with each gatekeeper, for storage and use in admission decisions until the next update epoch.
    • 准入控制和负载平衡系统控制分组流的接纳或对网络的呼叫,并平衡网络上的分组流量,提高服务质量。 该系统包括中央数据库,其存储包括与跨越网络的各个路径和链接相关联的成本数据的信息。 与数据库通信的处理器根据来自适当数据源的输入来协调准入控制和负载均衡决策以及更新数据库成本数据以反映动态网络条件。 在一个实施例中,被称为精确算法,在接纳每个到达的分组流之前,由接纳控制点或网守查询数据库,并且逐个呼叫更新数据库内容以反映每个被允许的资源分配 流。 在另一实施例中,被称为不精确的算法,控制决策以及数据库更新以周期性而不是逐个呼叫的方式发生,以促进更好的可扩展性。 在该实施例中,处理器基于中央数据库中的成本数据周期性地计算准入决定。 然后将这些准入决定周期地转发到与每个关守相关联的卫星数据库,以便存储和使用入场决定,直到下一个更新纪元。
    • 9. 发明授权
    • Integrating switching and facility networks using ATM
    • 使用ATM集成交换和设施网络
    • US06452902B1
    • 2002-09-17
    • US09570240
    • 2000-09-08
    • Cagatay BuyukkocDavid J. HouckPravin Kumar JohriKathleen S. Meier-HellsternRodolfo Alberto Milito
    • Cagatay BuyukkocDavid J. HouckPravin Kumar JohriKathleen S. Meier-HellsternRodolfo Alberto Milito
    • H04J324
    • H04L12/5602H04L2012/562H04L2012/5632H04Q11/0478
    • An efficient approach and corresponding apparatus for selecting virtual paths in a network for routing datagrams achieves effective sharing of capacity without adversely affecting call setup latency. Edge nodes of the network assign calls to virtual paths based on the destination of the call and the current load status of each of a relatively small number of paths. Each call is assigned a VPI (Virtual Path Identifier) corresponding to the path chosen and a VCI (Virtual Circuit Identifier) corresponding to the identity of the call at that edge node. The ATM backbone nodes route calls based solely on the VPI. Capacity management and load balancing is achieved by each edge node keeping track of the load on each access link from its edge node to the rest of the network and of the congestion status of the various links in the network. In one embodiment, the edge node periodically sends information about its usage of the network to a “central fabric network interface” which combines information from all edge nodes, evaluates congestion status for the network links, and forwards that information back to the edge nodes.
    • 用于选择网络中用于路由数据报的虚拟路径的有效方法和相应装置实现了容量的有效共享,而不会不利地影响呼叫建立等待时间。 网络的边缘节点根据呼叫的目的地和相对较少数量的路径中的每一个的当前负载状态来分配对虚拟路径的呼叫。 每个呼叫被分配与所选路径相对应的VPI(虚拟路径标识符)和对应于该边缘节点处的呼叫标识的VCI(虚拟电路标识符)。 ATM主干节点仅基于VPI路由呼叫。 容量管理和负载均衡由每个边缘节点跟踪从其边缘节点到网络的其余部分的每个接入链路上的负载以及网络中各种链路的拥塞状态。 在一个实施例中,边缘节点周期性地将关于其网络的使用的信息发送到组合来自所有边缘节点的信息的“中心结构网络接口”,评估网络链路的拥塞状态,并将该信息转发回到边缘节点。
    • 10. 发明授权
    • Method for routing an NP call
    • NP呼叫路由方法
    • US5943411A
    • 1999-08-24
    • US855828
    • 1997-05-12
    • David J. HouckLev SlutsmanKamlesh T. TewaniLance Wayne Wilson
    • David J. HouckLev SlutsmanKamlesh T. TewaniLance Wayne Wilson
    • H04M3/42H04M7/00H04Q3/00
    • H04Q3/005H04M3/42229H04M7/00
    • A method of routing an interim NP call in which it is determined to give a called number interim NP redirection rather than conventional RCF redirection when the called number is to be ported. When a ported call is to receive interim NP redirection and SS7 networking is used, an Initial Address Message for the call is created with the Called Party Number parameter of the Initial Address Message populated with the Location Routing Number for the switch to which the called number has been ported. The Generic Address Parameter of the Initial Address Message is populated with the called number and the M bit of the Forward Call Indicator parameter of the Initial Address Message is set. The call is then redirected to the switch to which the called number has been ported based on the Location Routing Number in the Called Party Number parameter of an Initial Address Message. This method avoids the use of RCF "shadow numbers" and the need to query an external long-term NP database.
    • 路由临时NP呼叫的方法,其中当被叫号码被移植时,确定其进行被叫号码中间NP重定向,而不是传统的RCF重定向。 当端口呼叫接收临时NP重定向并使用SS7联网时,将创建呼叫的初始地址消息,其中使用初始地址消息的被叫方号码参数填充交换机的位置路由号码,其中被叫号码 已经移植。 初始地址消息的通用地址参数用被叫号码填充,并且设置了初始地址消息的转发呼叫指示符参数的M位。 然后根据初始地址消息的被叫方号码参数中的位置路由号码,将该呼叫重定向到被呼叫号码已被移植到的交换机。 该方法避免使用RCF“阴影号”,并需要查询外部长期NP数据库。