会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • ROUTER, MANAGEMENT APPARATUS, AND ROUTING CONTROL PROGRAM
    • 路由器,管理设备和路由控制程序
    • US20110205898A1
    • 2011-08-25
    • US13032969
    • 2011-02-23
    • Hiroki ICHIKIAkiko YAMADASatoshi IMAI
    • Hiroki ICHIKIAkiko YAMADASatoshi IMAI
    • H04L12/56H04L12/26
    • H04L47/122H04L45/00H04L45/127H04L47/11H04W40/005Y02D70/00
    • In a routing apparatus, a state data reception unit identifies target paths involving a specified link and finds candidate paths which share their beginning and ending routing apparatuses with any one of the target paths and do not involve the specified link. The state data reception unit obtains state data of each candidate path from a management apparatus managing state data indicating states of routing apparatuses that forward traffic on the candidate paths. Based on the state data of each candidate path, a distribution path selection unit selects a distribution path that minimizes the increase in power consumption due to an expected change in the states of routing apparatuses. A distribution requesting unit transmits a distribution request to the beginning routing apparatus of a target path so as to distribute at least a part of the traffic on the target path to the selected distribution path.
    • 在路由设备中,状态数据接收单元识别涉及指定链路的目标路径,并且找到与目标路径中的任何一个共享其起始和结束路由设备的候选路径,并且不涉及指定的链路。 状态数据接收部从管理表示候选路径的转发路由装置的状态的状态数据的管理装置获取各候补路径的状态数据。 基于每个候选路径的状态数据,分配路径选择单元选择由于路由设备的状态的预期变化而最小化功耗增加的分配路径。 分发请求单元向目标路径的起始路由设备发送分发请求,以将目标路径上的业务的至少一部分分发到所选择的分配路径。
    • 3. 发明申请
    • ROUTE CONTROL METHOD AND ROUTE CONTROL SYSTEM
    • 路由控制方法和路由控制系统
    • US20110075583A1
    • 2011-03-31
    • US12890776
    • 2010-09-27
    • Satoshi IMAIAkiko YamadaTakanori Matsunaga
    • Satoshi IMAIAkiko YamadaTakanori Matsunaga
    • H04L12/26
    • H04L43/0876H04L41/0803H04L41/12H04L43/0817H04L45/127
    • A route control system includes a status measuring unit, a cost management unit, a route determining unit, and a route setting unit. The status measuring unit checks a status of each node included in a network. The status is a wake state or a sleep state. The cost management unit updates a link cost for a link connected to a node in the wake state to a value smaller than any link cost for a link connected to a node in the sleep state. The route determining unit determines an optimum route connecting a first terminal to a second terminal. A sum of the link costs for the optimum route is lowest among the link costs for other available routes connecting the first terminal to the second terminal. The route setting unit sets a requested data flow in the optimum route.
    • 路线控制系统包括状态测量单元,成本管理单元,路线确定单元和路线设置单元。 状态测量单元检查网络中包括的每个节点的状态。 状态是唤醒状态或睡眠状态。 成本管理单元将连接到处于唤醒状态的节点的链路的链路成本更新为小于连接到处于睡眠状态的节点的链路的任何链路成本的值。 路线确定单元确定将第一终端连接到第二终端的最佳路由。 在将第一终端连接到第二终端的其他可用路由的链路成本中,最佳路由的链路成本的总和最小。 路由设置单元在最佳路由中设置所请求的数据流。
    • 4. 发明申请
    • APPARATUS AND METHOD FOR DETERMINING ROUTE, COMPUTER-READABLE RECORDING MEDIUM HAVING STORED THEREIN MANAGEMENT PROGRAM, AND MANAGEMENT DEVICE
    • 用于确定路由的装置和方法,具有存储的管理程序的计算机可读记录介质和管理设备
    • US20130024561A1
    • 2013-01-24
    • US13549710
    • 2012-07-16
    • Satoshi IMAI
    • Satoshi IMAI
    • G06F1/32
    • H04W40/08H04L45/12H04L45/125Y02D70/324
    • An apparatus for determining a route including: a collector that collects a current amount of link traffic and current link power consumption of each link; a virtual link setter that sets virtual links for each link; a link cost calculator that calculates a link cost of each virtual link based on the estimated increase in the link power consumption; a constraint condition setter that creates a constraint condition satisfying a requirement of end-to-end quality of a request flow based on change in quality of each virtual link and satisfying a requirement of end-to-end quality of an existing flow based on the change in quality of the existing flow on the virtual link; a route determinator that determines a route having a smallest sum of the link costs including a plurality of the virtual links satisfying the created constraint condition.
    • 一种用于确定路由的装置,包括:收集器,其收集每个链路的当前链路业务量和当前链路功率消耗; 虚拟链路设置器,为每个链路设置虚拟链路; 链路成本计算器,其基于所估计的链路功率消耗的增加来计算每个虚拟链路的链路成本; 约束条件设置器,其基于每个虚拟链路的质量变化创建满足请求流的端到端质量要求的约束条件,并且基于所述约束条件,满足对现有流的端对端质量的要求 在虚拟链路上改变现有流量的质量; 确定具有包括满足所创建的约束条件的多个虚拟链路的链路成本的最小和的路由的路由决定器。
    • 5. 发明申请
    • ROUTING DEVICE, METHOD, AND PROGRAM
    • 路由设备,方法和程序
    • US20110205901A1
    • 2011-08-25
    • US13030492
    • 2011-02-18
    • Satoshi IMAI
    • Satoshi IMAI
    • H04L12/26
    • H04L41/5019H04L41/5077H04L45/302H04L45/38H04L45/42
    • A routing apparatus that determines a path for a flow in a network including a plurality of data links, the routing apparatus including: a constraint condition setting unit configured to generate a constraint condition that has a requirement that an end-to-end quality requirement of the flow is satisfied based on a quality variation occurring in each of the data links owing to the allocation of the flow to each of the data links and another requirement that an end-to-end quality requirement of another flow existing in each of the data links is satisfied based on a quality variation occurring in the another flow owing to the allocation of the flow to each of the data links; and a routing unit configured to determine the path for the flow from among a plurality of paths including the data links within a range satisfying the constraint condition.
    • 一种路由装置,其确定包括多个数据链路的网络中的流的路径,所述路由装置包括:约束条件设置单元,被配置为生成约束条件,所述约束条件要求所述约束条件的端到端质量要求 由于对每个数据链路的流量的分配,基于每个数据链路中出现的质量变化满足流程,并且另外要求存在于每个数据中的另一流的端到端质量要求 由于流向每个数据链路的分配,基于在另一个流中发生的质量变化来满足链路; 以及路由单元,被配置为从满足约束条件的范围内的包括所述数据链路的多个路径中确定所述流的路径。
    • 7. 发明申请
    • NETWORK DESIGN SYSTEM
    • 网络设计系统
    • US20120213081A1
    • 2012-08-23
    • US13307629
    • 2011-11-30
    • Satoshi IMAI
    • Satoshi IMAI
    • H04L12/26H04L12/56
    • H04L45/123H04L41/0806H04L41/145
    • An operator sets a path demand to be accommodated, and sets information of a device candidate, the number of ports, a path route and the like, which are demanded for a network, in an objective function that indicates a total cost when the path demand to be accommodated is newly included in the network. A mathematical programming problem for minimizing the objective function under a constraint condition derived from a configuration of the network is set, and a solution is obtained by using a solver for solving the mathematical programming problem. A device is added or the like to the network based on the obtained solution, and the demanded path is added to the network.
    • 操作者设定要容纳的路径需求,并且在指示路径需求的总成本的目标函数中设置要求网络的设备候选的信息,端口数,路径路径等信息 被包含在网络中。 设定了从网络配置导出的约束条件下最小化目标函数的数学规划问题,并通过使用求解器来求解数学规划问题来获得解决方案。 基于所获得的解决方案将设备添加到网络等,并且将所请求的路径添加到网络。
    • 8. 发明申请
    • PATH CONTROL METHOD, COMMUNICATION SYSTEM, AND COMMUNICATION APPARATUS
    • 路径控制方法,通信系统和通信装置
    • US20110142041A1
    • 2011-06-16
    • US12961643
    • 2010-12-07
    • Satoshi IMAI
    • Satoshi IMAI
    • H04L12/56
    • H04L45/124H04L45/123H04L45/125H04L45/60
    • A path control method for controlling paths among edge nodes on a network wherein a plurality of nodes, including relay nodes and multiple edge nodes, are connected via links, the method including determining paths in a specified plurality of edge nodes, path information indicating the paths determined by an edge node that determines paths earlier is transmitted to an edge node that determines paths subsequently, each edge node that determines paths subsequently determines additional paths by prioritizing the use of paths indicated by the path information, and conducting path control on the network by using the path information obtained as a result of paths being determined by the last edge node from among the specified plurality of edge nodes.
    • 一种用于控制网络中的边缘节点之间的路径的路径控制方法,其中包括中继节点和多个边缘节点的多个节点经由链路连接,所述方法包括确定指定的多个边缘节点中的路径,指示路径的路径信息 由确定先前路径的边缘节点确定的边缘节点确定随后的路径,确定路径的每个边缘节点随后通过对由路径信息指示的路径的使用进行优先级来确定附加路径,以及通过网络上的路径控制来进行网络上的路径控制 使用由所述最终边缘节点从所述指定的多个边缘节点中确定的路径获得的路径信息。
    • 9. 发明申请
    • BANDWIDTH MEASURING METHOD AND DEVICE
    • 带宽测量方法和装置
    • US20080181125A1
    • 2008-07-31
    • US11972686
    • 2008-01-11
    • Satoshi IMAI
    • Satoshi IMAI
    • H04L12/26
    • H04L41/145H04L43/0829H04L43/0894
    • In a bandwidth measuring method and device for grasping a traffic general and local trends in consideration of a packet loss, without continuously capturing packets, a simulation is executed by determining a bandwidth limit based on a buffer length, a transmission bandwidth, and a mean packet length collected in an adjoining node or its own node and information of a preset allowable packet loss rate, and by determining an initial value of a transient evaluation type queue simulation for a packet loss rate. An optimum short time interval when the packet loss rate by the simulation approaches the allowable packet loss rate is determined as a packet continuous capture time. Furthermore, packets are continuously captured in the short time interval, and a mean bandwidth of the packets is calculated, so that a general mean bandwidth, or an upper bandwidth or a peak bandwidth is determined from an overall mean bandwidth by repeating the continuous capturing at random within a fixed section.
    • 考虑到分组丢失的带宽测量方法和装置,用于在不连续捕获分组的情况下掌握业务一般和局部趋势,通过基于缓冲器长度,传输带宽和平均分组来确定带宽限制来执行模拟 收集在相邻节点或其自己的节点中的长度以及预设的允许分组丢失率的信息,以及通过确定丢包率的瞬时评估类型队列模拟的初始值。 当模拟的分组丢失率接近允许分组丢失率时,最佳短时间间隔被确定为分组连续捕获时间。 此外,在短时间间隔内连续地捕获分组,并且计算分组的平均带宽,从而通过重复连续捕获从总体平均带宽确定一般平均带宽或高带宽或峰值带宽 随机在一个固定的部分。
    • 10. 发明申请
    • ROUTE CALCULATING SYSTEM
    • 路线计算系统
    • US20110205919A1
    • 2011-08-25
    • US13017692
    • 2011-01-31
    • Satoshi IMAI
    • Satoshi IMAI
    • H04L12/26
    • H04L45/00H04L43/08H04L43/0882H04L45/125H04L45/127
    • A route calculation system includes a collection unit that collects a current link traffic volume and a link power consumption for each link included in a network; a link cost calculation unit that estimates, for each link, an increase in the link power consumption due to the request flow based on the current link traffic volume, the link power consumption, the request flow, and the characteristic, and calculates a link cost value based on the increase in the link power consumption; and a route determination unit that determines, as a route for the request flow, a route that has the smallest sum of the link cost values of each route connecting between any nodes, thereby reducing the power consumption in the entire network for a request flow.
    • 路线计算系统包括收集单元,其收集网络中包括的每个链路的当前链路业务量和链路功率消耗; 链路成本计算单元,针对每个链路,基于当前链路业务量,链路功耗,请求流和特性,估计由于请求流引起的链路功率消耗的增加,并且计算链路成本 基于链路功耗的增加值; 以及路线确定单元,其确定作为所述请求流程的路线,具有在任何节点之间连接的每个路线的链路成本值之和的路由最小的路由,从而降低了针对请求流的整个网络的功耗。