会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 4. 发明授权
    • Subnetwork layer for a multimedia mobile network
    • 多媒体移动网络的子网层
    • US07502361B2
    • 2009-03-10
    • US10345034
    • 2003-01-15
    • Walid AhmedBharat Tarachand DoshiSubrahmanyam DravidaHong JiangKiran M. Rege
    • Walid AhmedBharat Tarachand DoshiSubrahmanyam DravidaHong JiangKiran M. Rege
    • H04J3/24
    • H04L29/12311H04L1/1664H04L1/1812H04L61/2084H04L67/322H04L69/324H04L69/325H04L69/329H04L69/40H04W74/00H04W80/00
    • A new protocol layer is provided as part of a protocol stack associated with a packet-based multiaccess mobile communications system. The protocol layer is preferably located above a medium access control (MAC) protocol layer and a physical protocol layer of the system and below a transport/network protocol layer. Such a subnetwork protocol layer provides, inter alia, the communications system with various mobility management functions, for example, tracking mobile user stations throughout the system, mobile station access to the system, and connection/call continuity within the system. The subnetwork protocol layer of the invention also performs packet routing functions associated with the system. Routing can be accomplished in many ways, for example, via source routing, connectionless routing, or tunneling. Further, the new protocol layer of the invention is preferably located above a data link layer with respect to the protocol stack associated with communications between network nodes.
    • 作为与基于分组的多访问移动通信系统相关联的协议栈的一部分提供了新的协议层。 协议层优选地位于媒体访问控制(MAC)协议层和系统的物理协议层之上,并位于传输/网络协议层之下。 这样的子网协议层尤其提供具有各种移动性管理功能的通信系统,例如,跟踪整个系统中的移动用户站,移动台对系统的访问以及系统内的连接/呼叫连续性。 本发明的子网协议层还执行与系统相关联的分组路由功能。 可以通过许多方式实现路由,例如,通过源路由,无连接路由或隧道。 此外,本发明的新协议层优选地相对于与网络节点之间的通信相关联的协议栈位于数据链路层之上。
    • 7. 发明授权
    • Distributed precomputation of signal paths in an optical network
    • 光网络中信号路径的分布预计算
    • US6073248A
    • 2000-06-06
    • US960462
    • 1997-10-29
    • Bharat Tarachand DoshiSubrahmanyam DravidaParamasiviah HarshavardhanaYufei Wang
    • Bharat Tarachand DoshiSubrahmanyam DravidaParamasiviah HarshavardhanaYufei Wang
    • H04J14/02H04Q11/00G06F11/00H04B10/20
    • H04Q11/0062H04J14/0227H04J14/0241H04J14/0278H04J14/0284H04Q2011/0086
    • Distributed precomputation techniques for determining primary and/or restoration paths in an optical network. The invention provides a number of partially and fully asynchronous distributed precomputation algorithms which may be implemented, for example, by the nodes of an all-optical network, in which network links are constrained in terms of optical signal wavelength and failure isolation. A given distributed precomputation algorithm may include a first phase in which paths are allocated for capacity demands to the extent possible without resolving contentions, and a second phase in which contentions between demands for the same capacity are resolved. The first phase may implement a contention locking mechanism which locks a primary path of a given demand to prevent other demands from contending for the same capacity, and a link capacity control mechanism which involves storing a link status table at one or more nodes, the link status table listing a number of specific failures and demands which are affected by the failures. The second phase of the distributed precomputation algorithm reroutes paths previously allocated to one or more demands in order to free up capacity required for another demand, so as to optimize overall network capacity utilization.
    • 用于确定光网络中的主路径和/或恢复路径的分布式预计算技术。 本发明提供了许多部分和完全异步的分布式预计算算法,其可以例如由全光网络的节点来实现,其中网络链路在光信号波长和故障隔离方面受到约束。 给定的分布式预计算算法可以包括第一阶段,在第一阶段中,在不解决争用的情况下尽可能地分配用于容量需求的路径,以及解决相同容量的需求之间的争用的第二阶段。 第一阶段可以实施争用锁定机制,其锁定给定需求的主要路径以防止其他需求竞争相同的容量;以及链路容量控制机制,其涉及将链路状态表存储在一个或多个节点处,所述链路 状态表列出了受到故障影响的一些具体故障和需求。 分布式预先计算算法的第二阶段重新路由先前分配给一个或多个需求的路径,以便释放另一个需求所需的容量,从而优化整体网络容量利用率。
    • 8. 发明授权
    • Hybrid centralized/distributed precomputation of network signal paths
    • 网络信号路径的混合集中/分布式预计算
    • US6130875A
    • 2000-10-10
    • US959800
    • 1997-10-29
    • Bharat Tarachand DoshiSubrahmanyam DravidaParamasiviah HarshavardhanaYufei Wang
    • Bharat Tarachand DoshiSubrahmanyam DravidaParamasiviah HarshavardhanaYufei Wang
    • G01R31/08H04J1/16H04J3/14G06F11/01
    • H04J14/0227H04J14/0241H04L41/0659H04L45/02H04L45/22H04L45/28H04L45/302H04L45/42H04L45/44H04L45/62H04Q11/0062H04J14/0278H04J14/0284H04L41/12H04Q2011/0073H04Q2011/0081H04Q2011/0086
    • Precomputation techniques for determining primary and/or restoration paths in an optical or electrical network. A hybrid centralized/distributed approach is provided in which certain information used in distributed precomputation is downloaded from a central controller of the network. The downloaded information is used as an input to a distributed precomputation algorithm implemented by the network nodes in order to provide improved performance. The central controller makes use of its knowledge of global network topology in computing the information to be downloaded to the nodes. The downloaded information generally represents network information which changes with less frequency than other network information processed by the nodes as part of the distributed precomputation algorithm. The information downloaded from the central controller may include, for example, network connectivity information, capacities for at least a subset of the links in the network, a subset of all possible routes between a source node and a destination node in the network arranged in an appropriate initial search order, a link contention index for each of the links in the network, and indices assigned to one or more of the nodes and links of the network, wherein the indices are used to determine an order of processing operations involving the one or more nodes and links of the network.
    • 用于确定光或电网络中的主路径和/或恢复路径的预计算技术。 提供了一种混合集中/分布式方法,其中从分布式预计算中使用的某些信息从网络的中央控制器下载。 下载的信息被用作由网络节点实现的分布式预计算算法的输入,以提供改进的性能。 中央控制器利用其全球网络拓扑知识计算要下载到节点的信息。 所下载的信息通常表示作为分布式预计算算法的一部分而以节点处理的其他网络信息的频率更少的网络信息。 从中央控制器下载的信息可以包括例如网络连通性信息,网络中链路的至少一个子集的容量,网络中的源节点和目的地节点之间的所有可能路由的子集, 适当的初始搜索顺序,网络中每个链路的链路争用索引以及分配给网络中的一个或多个节点和链路的索引,其中,索引用于确定涉及该一个或多个网络的处理操作的顺序 更多的网络节点和链接。