利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

44 条记录 (耗时 0.039 秒)

    Link-based recovery with demand granularity in mesh networks
    32.
    发明申请
    Link-based recovery with demand granularity in mesh networks 有权
    基于链路的恢复与网状网络中的需求粒度

    公开(公告)号：US20050240796A1

    公开(公告)日：2005-10-27

    申请号：US10817748

    申请日：2004-04-02

    申请人： Zbigniew Dziong ,  Muhammad Qureshi ,  Yung-Terng Wang

    发明人： Zbigniew Dziong ,  Muhammad Qureshi ,  Yung-Terng Wang

    IPC分类号： G06F11/00

    CPC分类号： H04L12/4637 ,  H04L45/128 ,  H04L45/28

    摘要： A protected communication network utilizes a link-based recovery strategy that supports independent recovery paths for individual demands, where each link includes one or more lines and each line can support one or more demands. Failure of one or more—or even all—of the lines/ports of a link will typically result in the independent rerouting of the affected demands along one or more link-detour paths. The flexibility afforded by recovery at the granularity of a demand supports the computation of more-optimal link-detour paths and a corresponding increase in sharing of network resources between disjoint failures. The network also addresses the restricted case where all demands on a line/port are recovered along the same link-detour path.

    摘要翻译： 受保护的通信网络利用基于链路的恢复策略，其支持针对个体需求的独立恢复路径，其中每个链路包括一条或多条线路，并且每条线路可以支持一个或多个需求。 链路的一个或多个或甚至全部的线路/端口的故障通常将导致沿着一个或多个链路绕行路径的受影响的需求的独立重新路由。 以需求粒度恢复提供的灵活性支持更优化的链路迂回路径的计算以及不相交故障之间网络资源共享的相应增加。 该网络还解决了限制的情况，其中线路/端口上的所有需求沿着相同的链路绕行路径恢复。

    Network quality of service management
    33.
    发明申请
    Network quality of service management 有权
    网络服务质量管理

    公开(公告)号：US20050195741A1

    公开(公告)日：2005-09-08

    申请号：US10817671

    申请日：2004-04-02

    申请人： Bharat Doshi ,  Behrokh Samadi ,  Yung-Terng Wang

    发明人： Bharat Doshi ,  Behrokh Samadi ,  Yung-Terng Wang

    IPC分类号： H04L1/00

    CPC分类号： H04L47/78 ,  H04L45/34 ,  H04L45/50 ,  H04L47/781 ,  H04L47/782 ,  H04L47/783 ,  H04L47/805 ,  H04L47/825

    摘要： An architecture for quality-of-service (QoS) management creates a logical circuit-switched network within a packet network to support QoS-sensitive demands levied on the network. This QoS-managed network can serve to interwork, e.g., a PSTN with VoIP networks. The architecture can include a connection resource manager (CRM), which oversees bandwidth availability and demand admission/rejection on dynamically provisioned virtual trunk groups (VTGs) within the packet network, and a transport bandwidth controller (TBC). The VTGs serve to transport QoS-sensitive demands across the packet network. The TBC serves the CRM by providing an interface to routers and/or OAM systems of the packet network to size VTGs to meet QoS requirements. Media switches located at the packet network borders serve to mux/demux the demands into/from VTGs. CRMs and TBCs can be implemented as centralized, distributed, or hierarchical, and flat and aggregated variants of the architecture are supported. VTGs can be implemented using MPLS LSPs, VPNs, or source-based routing.

    摘要翻译： 用于服务质量（QoS）管理的架构在分组网络内创建逻辑电路交换网络，以支持在网络上征收的对QoS敏感的需求。 该QoS管理的网络可以用于互通，例如具有VoIP网络的PSTN。 该架构可以包括连接资源管理器（CRM），其监视分组网络内的动态配置的虚拟中继线群（VTG）的带宽可用性和需求接纳/拒绝以及传输带宽控制器（TBC）。 VTG用于在分组网络中传输QoS敏感的需求。 TBC通过为分组网络的路由器和/或OAM系统提供接口，为VTG设置大小以满足QoS要求，为CRM提供服务。 位于数据包网络边界的媒体交换机用于将/从/从VTGs的需求复制/解复用。 CRM和TBC可以实现为支持集中式，分布式或分层级，并且平台和集合的体系结构变体。 VTG可以使用MPLS LSP，VPN或基于源的路由来实现。

    Method for call admission in packet voice system using statistical multiplexing and dynamic voice encoding
    36.
    发明授权
    Method for call admission in packet voice system using statistical multiplexing and dynamic voice encoding 失效
    使用统计复用和动态语音编码的分组语音系统中的呼叫准入方法

    公开(公告)号：US06169738A

    公开(公告)日：2001-01-02

    申请号：US08965515

    申请日：1997-11-06

    申请人： Kotikalapudi Sriram ,  Yung-Terng Wang

    发明人： Kotikalapudi Sriram ,  Yung-Terng Wang

    IPC分类号： H04L1228

    CPC分类号： H04Q11/0478 ,  H04L2012/5638 ,  H04L2012/5656 ,  H04L2012/6481

    摘要： An AAL2/SSCS packet voice system multiplexes various forms of voice-band traffic including voice packets, fax packets, and data packets into a virtual circuit (VC). This AAL2/SSCS packet voice system executes a dynamic call admission algorithm that takes into account call type in deciding whether to admit a new call to the VC. In particular, this approach takes into account different bandwidth needs for different call types. The AAL2/SSCS packet voice system also performs bit or block dropping on voice packets to mitigate the effects of traffic congestion. The bit or block dropping is done based on the packet queue fill value exceeding at least one queue threshold. Further, the AAL2/SSCS packet voice system also dynamically varies a queue threshold as a function of capacity.

    摘要翻译： AAL2 / SSCS分组语音系统将包括语音分组，传真分组和数据分组在内的各种语音频带业务复用到虚拟电路（VC）中。 该AAL2 / SSCS分组语音系统执行动态呼叫准入算法，该算法在决定是否允许对VC的新呼叫时考虑呼叫类型。 特别地，这种方法考虑到不同呼叫类型的不同带宽需求。 AAL2 / SSCS分组语音系统还对语音分组进行比特或阻塞，以减轻交通拥堵的影响。 基于分组队列填充值超过至少一个队列阈值来完成比特或块丢弃。 此外，AAL2 / SSCS分组语音系统还动态地改变作为容量的函数的队列阈值。

    Calculation of link-detour paths in mesh networks
    39.
    发明申请
    Calculation of link-detour paths in mesh networks 有权
    网状网络中的链路绕行路径计算

    公开(公告)号：US20050220026A1

    公开(公告)日：2005-10-06

    申请号：US10817760

    申请日：2004-04-02

    申请人： Zbigniew Dziong ,  Muhammad Qureshi ,  Yung-Terng Wang

    发明人： Zbigniew Dziong ,  Muhammad Qureshi ,  Yung-Terng Wang

    IPC分类号： H04L1/00 ,  H04L12/24 ,  H04L12/28 ,  H04L12/56

    CPC分类号： H04L45/123 ,  H04L41/0668 ,  H04L45/02 ,  H04L45/22 ,  H04L45/28

    摘要： A protected communication network utilizes a link-based recovery strategy that includes methods for calculating and distributing link-protection parameters and calculating primary and link-detour paths based on these parameters. These link-protection parameters support the computation of more-optimal link-detour paths and a corresponding increase in sharing of network resources between disjoint failures. A joint-optimization mechanism can be employed that considers both the cost of link-detour paths as well as the cost of links in candidate primary paths in the selection of a primary path for a demand. Information for the joint optimization is preferably distributed using link-state advertisements.

    摘要翻译： 受保护的通信网络利用基于链路的恢复策略，其包括用于计算和分发链路保护参数并基于这些参数计算主路由和链路迂回路径的方法。 这些链路保护参数支持更优化的链路迂回路径的计算，并且相应地增加不相交故障之间的网络资源共享。 可以采用联合优化机制，其考虑在选择主要路径的需求时，链路绕行路径的成本以及候选主路径中的链路的成本。 用于联合优化的信息优选地使用链路状态广告来分发。

    Methods and devices for relieving congestion in hop-by-hop routed packet networks
    40.
    发明授权
    Methods and devices for relieving congestion in hop-by-hop routed packet networks 失效
    用于缓解逐跳路由分组网络拥塞的方法和设备

    公开(公告)号：US06831895B1

    公开(公告)日：2004-12-14

    申请号：US09314107

    申请日：1999-05-19

    申请人： Hongbin Ji ,  Muralidharan Sampath Kodialam ,  Yung-Terng Wang

    发明人： Hongbin Ji ,  Muralidharan Sampath Kodialam ,  Yung-Terng Wang

    IPC分类号： H04J300

    CPC分类号： H04L45/38 ,  H04L45/00 ,  H04L45/122 ,  H04L45/123 ,  H04L45/20 ,  H04L45/22

    摘要： Congestion across links in a network, such as the Internet, is reduced by diverting traffic from the congested link to alternative, shortest paths by adjusting splitting factors associated with the congested and alternative links. The alternative shortest paths comprise equal cost paths. Alternatively, adjustments occur after the creation of additional equal cost paths/shortest paths if none are initially available within the network. Unique programs control the adjustment of the splitting factors and the creation of the additional shortest paths. The programs make use of both existing, real networks and constructed, virtual networks in conjunction with novel traffic flow relationships to divert traffic from a congested link without causing further congestion within the network. Another unique program deletes shortest paths once used to accept traffic diverted from a congested link when traffic in the network decreases.

    摘要翻译： 通过调整与拥塞和替代链路相关联的分解因子，将流量从拥塞链路转移到备选最短路径，从而减少网络中诸如因特网之间的链路的拥塞。 替代的最短路径包括相等的成本路径。 或者，如果网络中最初没有可用的附加成本路径/最短路径，则在创建额外的等价路径/最短路径之后进行调整。 独特的程序控制分割因子的调整和附加最短路径的创建。 这些程序利用现有的，实际的网络和构建的虚拟网络结合新的业务流量关系来转发来自拥塞的链路的业务，而不会在网络内造成进一步的拥塞。 当网络中的流量减少时，另一个独特的程序会删除一次用于接收从拥塞链路转发的流量的最短路径。