会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明授权
    • Network protocol having staggered recovery
    • 网络协议具有交错的恢复
    • US06885634B1
    • 2005-04-26
    • US09768898
    • 2001-01-24
    • Gagan Lal ChoudhuryAnurag S. Maunder
    • Gagan Lal ChoudhuryAnurag S. Maunder
    • H04L12/26H04L12/56
    • H04L45/00H04L45/12
    • A network utilizing a link-state protocol includes a plurality of nodes with associated trunks that recover in a staggered manner. A first trunk associated with a first node is selected for recovery. After the first trunk is recovered, further trunks are selected such that N or less trunks recover at the same time until all trunks associated with the first node are selected for recovery. Node recovery is staggered at selected intervals to minimize or eliminate overload conditions. Staggered recovery in accordance with the present invention can reduce the likelihood of trunk loss due to excessive HELLO messages in an OSPF system and retransmission and retransmission lockout.
    • 利用链路状态协议的网络包括具有以交错方式恢复的相关干线的多个节点。 选择与第一节点相关联的第一中继线进行恢复。 在恢复第一个中继线之后,选择进一步的中继,使得N个或更少的中继线同时恢复,直到与第一个节点相关联的所有中继线被选择用于恢复。 节点恢复以选定的间隔交错以最小化或消除过载条件。 根据本发明的交错恢复可以减少由于OSPF系统中过多的HELLO消息而导致的中继线丢失的可能性,并且重传和重传锁定。
    • 4. 发明授权
    • Systems and methods for facilitating data discovery
    • 促进数据发现的系统和方法
    • US09135261B2
    • 2015-09-15
    • US12638067
    • 2009-12-15
    • Anurag S. MaunderChristos TryfonasMuddu Sudhakar
    • Anurag S. MaunderChristos TryfonasMuddu Sudhakar
    • G06F17/30
    • G06F17/30106G06F17/30094
    • A system for facilitating data discovery on a network, wherein the network has one or more data storage devices. The system may include a crawler program configured to select at least a first set of files and a second set of files, each of the first set of files and the second set of files being stored in at least one of the one or more data storage devices. The system may also include a data fetcher program configured to obtain a copy of the first set of files, the data fetcher program being further configured to resist against obtaining a copy of the second set of files. The system may also include circuit hardware implementing one or more functions of one or more of the crawler program and the data fetcher program.
    • 一种用于促进网络上的数据发现的系统,其中所述网络具有一个或多个数据存储设备。 该系统可以包括被配置为选择至少第一组文件和第二组文件的爬行程序,第一组文件和第二组文件中的每一个被存储在一个或多个数据存储器 设备。 该系统还可以包括被配置为获得第一组文件的副本的数据获取器程序,该数据获取程序被进一步配置为抵抗获得第二组文件的副本。 该系统还可以包括实现履带程序和数据提取程序中的一个或多个的一个或多个功能的电路硬件。
    • 5. 发明授权
    • PNNI-based mult-link shortest path class-of service routing technique
    • 基于PNNI的多链路最短路径类服务路由技术
    • US07561519B1
    • 2009-07-14
    • US10744722
    • 2003-12-23
    • Gerald Richard AshJiayu ChenSaul Daniel FishmanAnurag S. Maunder
    • Gerald Richard AshJiayu ChenSaul Daniel FishmanAnurag S. Maunder
    • H04J1/16H04J3/14H04L1/00H04L12/26H04L12/28
    • H04L45/302H04L45/10H04L45/125H04L45/26H04L45/304H04L45/3065H04L2012/5621H04Q11/0478
    • The present invention concerns a technique for providing Class-of-Service Routing in an ATM network (10) that utilizes the Private Network-Network Interface (PNNI) protocol. An originating node seeking to route a call to a terminating node does so by initially determining the class-of-service and then selecting a shortest length path there-between. Each successive link on the selected path is examined for sufficient available bandwidth and available depth (i.e., bandwidth not reserved for other services) for the Class-of-Service of the call. If every link possesses sufficient available bandwidth, then the call passes on the selected path. Otherwise, should a link on the selected path lack sufficient bandwidth and available depth, then a crankback message is sent to the originating node, and the originating node selects the next shortest path. Thereafter, the process of examining each link for sufficient bandwidth is repeated. If no path is found, the call is ultimately blocked.
    • 本发明涉及一种在ATM网络(10)中提供服务类别路由的技术,该网络利用专用网络 - 网络接口(PNNI)协议。 寻求将呼叫路由到终止节点的始发节点通过初始确定服务等级,然后选择其间的最短长度路径来实现。 检查所选路径上的每个连续链路,以获得呼叫等级的足够的可用带宽和可用深度(即,不为其他服务保留的带宽)。 如果每个链路具有足够的可用带宽,则呼叫将在所选路径上传递。 否则,如果所选路径上的链路​​缺乏足够的带宽和可用深度,则向起始节点发送曲柄消息,并且始发节点选择下一个最短路径。 此后,重复检查每个链路足够带宽的过程。 如果没有找到路径,则呼叫最终被阻止。
    • 6. 发明授权
    • Enhancing the intelligent service capability of a network after a data flow has been established
    • 数据流建立后,提高网络的智能化服务能力
    • US06434114B1
    • 2002-08-13
    • US09031017
    • 1998-02-26
    • Ajay K. JainAnurag S. Maunder
    • Ajay K. JainAnurag S. Maunder
    • G01R3108
    • H04Q3/66H04Q3/0029H04Q2213/13103H04Q2213/13141H04Q2213/13145H04Q2213/13166H04Q2213/13336H04Q2213/13345H04Q2213/13376
    • A method for increasing the capability of the network to provide intelligent services can be accessed by any flow and allows the flow to install the services specific features to the flow. The present invention allows the software agents to be dynamically loaded into the network component to provide the services desired by the user. The present invention provides a detector in a switch in the network processing the flow that detects the presence of a predetermined control packet in the flow, and upon detection of this control packet, the detector loads a particular software object from a library of objects into the switch or router, which software object is then immediately executed by the switch to process the flow. This enables the user of the switch to request additional service from the switch after the data flow has been initiated, or to modify the flow parameters in a seamless manner.
    • 可以通过任何流程来访问用于增加网络提供智能服务的能力的方法,并允许流程将服务特定特征安装到流程。 本发明允许软件代理被动态地加载到网络组件中以提供用户期望的服务。 本发明提供了网络中的交换机中的检测器,其处理检测流中预定控制分组的流程,并且在检测到该控制分组时,检测器将特定软件对象从对象库加载到 交换机或路由器,然后立即由交换机执行哪个软件对象来处理流程。 这使得交换机的用户能够在数据流已经启动之后从交换机请求附加服务,或以无缝的方式修改流参数。
    • 7. 发明申请
    • SYSTEMS AND METHODS FOR FACILITATING DATA DISCOVERY
    • 促进数据发现的系统和方法
    • US20110145217A1
    • 2011-06-16
    • US12638067
    • 2009-12-15
    • Anurag S. MaunderChristos TryfonasMuddu Sudhakar
    • Anurag S. MaunderChristos TryfonasMuddu Sudhakar
    • G06F17/30
    • G06F17/30106G06F17/30094
    • A system for facilitating data discovery on a network, wherein the network has one or more data storage devices. The system may include a crawler program configured to select at least a first set of files and a second set of files, each of the first set of files and the second set of files being stored in at least one of the one or more data storage devices. The system may also include a data fetcher program configured to obtain a copy of the first set of files, the data fetcher program being further configured to resist against obtaining a copy of the second set of files. The system may also include circuit hardware implementing one or more functions of one or more of the crawler program and the data fetcher program.
    • 一种用于促进网络上的数据发现的系统,其中所述网络具有一个或多个数据存储设备。 该系统可以包括被配置为选择至少第一组文件和第二组文件的爬行程序,第一组文件和第二组文件中的每一个被存储在一个或多个数据存储器 设备。 该系统还可以包括被配置为获得第一组文件的副本的数据获取器程序,该数据获取程序被进一步配置为抵抗获得第二组文件的副本。 该系统还可以包括实现履带程序和数据提取程序中的一个或多个的一个或多个功能的电路硬件。
    • 8. 发明授权
    • PNNI-based multi-link shortest path Class-of Service routing technique
    • 基于PNNI的多链路最短路径Class-of Service路由技术
    • US06778535B1
    • 2004-08-17
    • US09538007
    • 2000-03-29
    • Gerald Richard AshJiayu ChenSaul Daniel FishmanAnurag S. Maunder
    • Gerald Richard AshJiayu ChenSaul Daniel FishmanAnurag S. Maunder
    • H04L1228
    • H04L45/302H04L45/10H04L45/125H04L45/26H04L45/304H04L45/3065H04L2012/5621H04Q11/0478
    • The present invention concerns a technique for providing Class-of-Service Routing in an ATM network (10) that utilizes the Private Network-Network Interface (PNNI) protocol. An originating node seeking to route a call to a terminating node does so by initially determining the class-of-service and then selecting a shortest length path there-between. Each successive link on the selected path is examined for sufficient available bandwidth and available depth (i.e., bandwidth not reserved for other services) for the Class-of-Service of the call. If every link possesses sufficient available bandwidth, then the call passes on the selected path. Otherwise, should a link on the selected path lack sufficient bandwidth and available depth, then a crankback message is sent to the originating node, and the originating node selects the next shortest path. Thereafter, the process of examining each link for sufficient bandwidth is repeated. If no path is found, the call is ultimately blocked.
    • 本发明涉及一种在ATM网络(10)中提供服务类别路由的技术,该网络利用专用网络 - 网络接口(PNNI)协议。 寻求将呼叫路由到终止节点的始发节点通过初始确定服务等级,然后选择其间的最短长度路径来实现。 检查所选路径上的每个连续链路,以获得呼叫等级的足够的可用带宽和可用深度(即,不为其他服务保留的带宽)。 如果每个链路具有足够的可用带宽,则呼叫将在所选路径上传递。 否则,如果所选路径上的链路​​缺乏足够的带宽和可用深度,则向起始节点发送曲柄消息,并且始发节点选择下一个最短路径。 此后,重复检查每个链路足够带宽的过程。 如果没有找到路径,则呼叫最终被阻止。
    • 9. 发明授权
    • Internet protocol (IP) class-of-service routing technique
    • 互联网协议(IP)类服务路由技术
    • US06590867B1
    • 2003-07-08
    • US09321027
    • 1999-05-27
    • Gerald Richard AshJiayu ChenSaul Daniel FishmanAnurag S. Maunder
    • Gerald Richard AshJiayu ChenSaul Daniel FishmanAnurag S. Maunder
    • H04J116
    • H04L45/02H04L45/302
    • The priority of the flow of packets representing calls or other connection requests within a packet network (10) is determined from the Class-of-Service of the call. Upon receipt of a call, a recipient router (121, 122, 123) identifies available paths, typically by exchanging messages with the other routers in the network. After selecting the path, the recipient router or centralized bandwidth broker determines whether the links comprising the selected path have available bandwidth for the class of service of the call. If so, the router routes the call to the next hop along the path. Otherwise, the router selects another path(s) and checks whether the links on the path possess sufficient bandwidth for the class of service of the call.
    • 在分组网络(10)中表示呼叫或其他连接请求的分组流的优先级是根据该呼叫的服务等级来确定的。 在接收到呼叫时,接收者路由器(121,122,123)通常通过与网络中的其他路由器交换消息来识别可用路径。 在选择路径之后,接收者路由器或集中带宽代理确定包括所选路径的链路是否具有用于该呼叫的服务类别的可用带宽。 如果是这样,则路由器将该呼叫路由到沿路径的下一跳。 否则,路由器选择另一路径,并检查路径上的链路​​是否具有用于呼叫服务类别的足够带宽。
    • 10. 发明授权
    • Success-to-the-top class of service routing
    • 成功到顶级的服务路由
    • US06496480B1
    • 2002-12-17
    • US09271473
    • 1999-03-17
    • Gerald Richard AshJiayu ChenSaul Daniel FishmanAnurag S. Maunder
    • Gerald Richard AshJiayu ChenSaul Daniel FishmanAnurag S. Maunder
    • H04J314
    • H04Q3/66H04Q2213/13141H04Q2213/13145H04Q2213/13164H04Q2213/1322H04Q2213/13251H04Q2213/1329H04Q2213/13296
    • An originating switch (110) in a packet-based telecommunications network (100) routes calls to a terminating switch using the combination of Success-to-the Top (STT) and Class-of-Service criterion. In routing a call to the terminating switch, the originating switch 110 checks for available bandwidth for the class of service of the call on the direct path (116) between switches. If the path has available bandwidth, the originating switch routes on the direct path. Otherwise, the originating switch searches for the most recently successful one of a plurality the via switches (1181-118n) linking the originating and terminating switches to determine whether that via switch can successfully route the call to the terminating switch. If the most recently successful one of the via switches possesses available bandwidth to route the call in accordance with its class of service, the originating switch 110 selects that via switch to route the call. Otherwise, if the most-recently successful via switch can not route the call, the originating switch 110 searches for a next successful via switch. If none of the via switches 1181-118n can successfully route the call in accordance with its class of service, the originating switch will either attempt a route advance or crankback the call.
    • 基于分组的电信网络(100)中的始发交换机(110)使用成功到顶部(STT)和服务等级标准的组合将呼叫路由到终端交换机。 在将呼叫路由到终端交换机时,始发交换机110在交换机之间的直接路径(116)上检查呼叫的业务类别的可用带宽。 如果路径具有可用带宽,则始发交换机在直接路径上路由。 否则,始发交换机搜索链接发起和终止交换机的多个通过交换机(1181-118n)中最近成功的一个,以确定该通过交换机是否能够成功地将呼叫路由到终接交换机。 如果通过交换机中最近成功的一个具有可用带宽以根据其服务等级来呼叫呼叫,则始发交换机110选择通过交换机路由该呼叫。 否则,如果最近成功的通过交换机不能路由呼叫,则始发交换机110搜索下一个成功的通过交换机。 如果通过交换机1181-118n中没有一个可以根据其服务等级成功地路由呼叫,则始发交换机将尝试路由提前或启动呼叫。