会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 3. 发明授权
    • Call setup systems and methods using dynamic link tagging and overbooking of links in multi-domain transport networks
    • 呼叫建立系统和方法使用多域传输网络中链路的动态链接标记和超量预订
    • US09172658B2
    • 2015-10-27
    • US13783764
    • 2013-03-04
    • Vikas KakkarKapil JunejaAnurag PrakashMohit Chhillar
    • Vikas KakkarKapil JunejaAnurag PrakashMohit Chhillar
    • H04B10/032H04L12/911H04L12/715H04L12/913
    • H04L47/728H04L45/04H04L47/724
    • Call setup methods in a multi-domain network and a multi-domain network use dynamic link tagging and/or overbooking of External Network-Network Interface (ENNI) links. Thus, improved call setup systems and methods include two approaches to improve upon the responsiveness of the network for connection setups including bandwidth reservation in optical networks using “dynamic link tags” and link overbooking in optical networks based on a greedy approach. The bandwidth reservation and the link overbooking can be utilized together or separately to improve call setup. Advantageously, the improved call setup systems and methods can provide a generic bandwidth reservation mechanism, such as in Automatically Switched Optical Network (ASON) networks, to overcome the limitation of ENNI in concurrently updating the abstract link bandwidth and thereby improving the responsiveness of the network.
    • 多域网络和多域网络中的呼叫建立方法使用外部网络网络接口(ENNI)链接的动态链接标记和/或超量预订。 因此,改进的呼叫建立系统和方法包括两种方法来改进网络对连接设置的响应性,包括使用“动态链路标签”的光网络中的带宽预留和基于贪婪方法的光网络中的链接超额预订。 可以一起或分开使用带宽预留和链路超量预订来改善呼叫建立。 有利地,改进的呼叫建立系统和方法可以提供诸如在自动交换光网络(ASON)网络中的通用带宽预留机制,以克服ENNI同时更新抽象链路带宽的限制,从而提高网络的响应性 。
    • 4. 发明授权
    • Mesh restoration and bandwidth allocation systems and methods for shared risk connection groups
    • 用于共享风险连接组的网状恢复和带宽分配系统和方法
    • US08854955B2
    • 2014-10-07
    • US13714516
    • 2012-12-14
    • Anurag PrakashMohit ChhillarPradeep KumarRajagopalan Kannan
    • Anurag PrakashMohit ChhillarPradeep KumarRajagopalan Kannan
    • H04J1/16H04B10/032
    • H04B10/032H04L45/28
    • A method, a node, and a network include mesh restoration and bandwidth allocation systems and methods for shared risk connection groups for source-based routing control planes. The mesh restoration and bandwidth allocation systems and methods utilize signaling from a node closest to a point of failure to “advise” source nodes about protect paths to be taken for a particular unidirectional or bidirectional connection in the event of mesh restoration. Specifically, the systems and methods include an ability to correlate connection information as Shared Risk Connection Groups (SRCG) to optimally utilize network bandwidth in the event of failure. The systems and methods could also be used to optimally distribute connections in a mesh network as well, trying to utilize maximum bandwidth, in distributed or centralized environments. Effectively, the systems and method distributed path computation in the network away from solely being the responsibility of source nodes.
    • 方法,节点和网络包括用于基于源的路由控制平面的共享风险连接组的网格恢复和带宽分配系统和方法。 网格恢复和带宽分配系统和方法利用来自最接近故障点的节点的信令,以便在网格恢复的情况下向源节点提供关于用于特定单向或双向连接的保护路径的信息。 具体来说,系统和方法包括将连接信息作为共享风险连接组(SRCG)进行关联的能力,以在发生故障时最佳地利用网络带宽。 系统和方法也可用于在网状网络中优化分布连接,并尝试在分布式或集中式环境中利用最大带宽。 有效地,网络中的系统和方法分布式路径计算不仅仅是源节点的责任。
    • 5. 发明申请
    • PATH COMPUTATION SYSTEMS AND METHODS IN OPTICAL NETWORKS
    • 光网络中的路径计算系统和方法
    • US20130202299A1
    • 2013-08-08
    • US13420717
    • 2012-03-15
    • Anurag PRAKASHMohit CHHILLARMarian TRNKUSWaseem Reyaz KHAN
    • Anurag PRAKASHMohit CHHILLARMarian TRNKUSWaseem Reyaz KHAN
    • H04J14/02
    • H04J14/0257H04J14/0206H04J14/0215H04J14/0217H04J14/0258H04J14/0267H04J14/0269H04J14/0271H04J14/0284
    • A path computation method includes defining photonic constraints associated with a network, wherein the photonic constraints include wavelength capability constraints at each node in the network, wavelength availability constraints at each node in the network, and nodal connectivity constraints of each node in the network, and performing a constrained path computation in the network using Dijkstra's algorithm on a graph model of the network with the photonic constraints considered therein. An optical network includes a plurality of interconnected nodes each including wavelength capability constraints, wavelength availability constraints, and nodal connectivity constraints, and a path computation element associated with the plurality of interconnected photonic nodes, wherein the path computation element is configured to perform a constrained path computation through the plurality of interconnected nodes using Dijkstra's algorithm on a graph model with the photonic constraints considered therein.
    • 路径计算方法包括定义与网络相关联的光子约束,其中光子约束包括网络中每个节点处的波长能力约束,网络中每个节点处的波长可用性约束以及网络中每个节点的节点连接约束,以及 使用Dijkstra算法对其中考虑的光子约束的网络的图形模型执行网络中的约束路径计算。 光网络包括多个互连节点,每个节点包括波长能力约束,波长可用性约束和节点连接性约束,以及与多个相互连接的光子节点相关联的路径计算元件,其中,路径计算元件被配置为执行约束路径 在其中考虑的光子约束的图形模型上使用Dijkstra算法通过多个互连节点进行计算。
    • 6. 发明申请
    • BANDWIDTH DEFRAGMENTATION SYSTEMS AND METHODS IN OPTICAL NETWORKS
    • 光学网络中的带宽去除系统和方法
    • US20120051745A1
    • 2012-03-01
    • US12945956
    • 2010-11-15
    • Hari SrinivasanWaseem Reyaz KhanAnurag PrakashSaurabh Pandey
    • Hari SrinivasanWaseem Reyaz KhanAnurag PrakashSaurabh Pandey
    • H04J14/00
    • H04L45/125H04J3/1611H04J3/1652H04J2203/0058H04L45/123H04L45/50H04L45/62
    • The present disclosure provides bandwidth defragmentation systems and methods in optical networks such as Optical Transport Network (OTN), Synchronous Optical Network (SONET), Synchronous Digital Hierarchy (SDH), Ethernet, and the like. In particular, the present invention includes bandwidth defragmentation algorithms that may be used within the context of a signaling and routing protocol to avoid bandwidth defragmentation. As such, the present invention defines a mechanism for computing an end to end path for a connection in a manner that avoids bandwidth fragmentation and provides for better network utilization. For example, the present invention may include a path computation based upon administrative weight and upon fragmentation costs. This may be implemented in existing signaling and routing protocols without changes to existing protocol messages used in topology discovery. Further, the present invention optimizes available bandwidth allowing a higher probability of higher bandwidth request being admitted.
    • 本公开提供了诸如光传输网络(OTN),同步光网络(SONET),同步数字体系(SDH),以太网等光网络中的带宽碎片整理系统和方法。 特别地,本发明包括可以在信令和路由协议的上下文中使用的带宽碎片整理算法,以避免带宽碎片整理。 因此,本发明定义了以避免带宽分段并提供更好的网络利用的方式来计算连接的端到端路径的机制。 例如,本发明可以包括基于管理权重和分段成本的路径计算。 这可以在现有的信令和路由协议中实现,而不改变在拓扑发现中使用的现有协议消息。 此外,本发明优化可用带宽,允许更高带宽请求的可能性被允许。