-
公开(公告)号：US20090003198A1
公开(公告)日：2009-01-01
申请号：US12215449
申请日：2008-06-27
CPC分类号： H04J3/085 , H04J2203/0067 , H04L45/123 , H04L45/124 , H04L45/302
摘要： According an aspect of the embodiment, there is provided a method for accommodating signal paths to a ring network. A demand chain is defined as a series of traffic demands in which each traffic demand shares one of the pair of terminal nodes pointed thereby with at least one adjacent traffic demand and the number of pairs of terminal nodes pointed by traffic demands in the series of traffic demands is maximized. Each traffic demand of the demand chain is corresponded to a demand accommodating route which is defined as a route between the pair of terminal nodes on the ring network pointed by the each traffic demand and arranged in a predetermined rotation direction on the ring network. Then, signal paths required by traffic demands each pointing a pair of terminal nodes both included in the demand accommodating route chain are accommodated to the demand accommodating route chain.
摘要翻译： 根据实施例的一个方面，提供一种用于适应信号路径到环形网络的方法。 需求链被定义为一系列交通需求，其中每个交通需求分享至少一个相邻交通需求的一对终端节点中的一个，以及一系列业务中的交通需求指向的终端节点对数 要求最大化。 需求链的每个业务需求对应于需求容纳路由，其被定义为由每个业务需求指向的环形网络上的一对终端节点之间的路由，并且以环形网络上的预定旋转方向布置。 然后，由需求容纳路径链包括的一对终端节点指向需求容纳路由链所需的信号路径。
-
42.发明申请Method for designing optical network, optical network, and computer readable medium 有权光网络，光网络和计算机可读介质的设计方法公开(公告)号：US20070253712A1
公开(公告)日：2007-11-01
申请号：US11808911
申请日：2007-06-13
IPC分类号： H04B10/20
CPC分类号： H04J14/0227 , H04B10/275 , H04J14/0241 , H04J14/0283 , H04J14/0284 , H04J14/0286
摘要： An appropriate ring topology is selected by searching network topology information on the basis of given information about client signal paths on a predetermined condition, and a wavelength ring accommodating the client signal paths and having an optimal transmission characteristic is designed on the basis of the selected ring topology. Accordingly, accommodation of client signal paths in an optical network is efficiently designed.
摘要翻译： 通过在预定条件下，基于关于客户信号路径的给定信息搜索网络拓扑信息来选择适当的环形拓扑，并且基于所选择的环设计容纳客户端信号路径并具有最佳传输特性的波长环 拓扑。 因此，有效地设计了光网络中的客户端信号路径的适应。
-
43.发明授权System and program for estimating person-hours required to prepare a pattern film of a circuit to be printed on a board 失效用于估计准备要印刷在电路板上的电路的图案胶片所需的人工时间的系统和程序公开(公告)号：US06662353B2
公开(公告)日：2003-12-09
申请号：US10084349
申请日：2002-02-28
申请人： Junichi Yamamoto , Sachio Henmi , Shigemitsu Fujisawa , Masanobu Sakurai , Kazuyuki Tajima , Fumio Kobayashi , Masaaki Ueno
发明人： Junichi Yamamoto , Sachio Henmi , Shigemitsu Fujisawa , Masanobu Sakurai , Kazuyuki Tajima , Fumio Kobayashi , Masaaki Ueno
IPC分类号： G06F1750
CPC分类号： G06F17/50 , G06Q30/0283 , H05K3/0005
摘要： The present invention relates to an estimation system that can provide a highly reliable estimation result when the estimation system estimates person-hours required to prepare a film pattern for a circuit to be printed on a board. Upon receiving design conditions from a cline machine, a reference pin calculator of the estimation system calculates a number of reference pins on the basis of a total number of pins extending from parts to be integrated on the printed circuit board and a special specification requirement to be applied to the printed circuit. An additional pin calculator calculates a number of additional pins on the basis of a signal line wiring method. A total estimated pin calculator corrects a sum of the reference pins and the additional pins on the basis of design difficulty, which is determined from a number of signal layers to be made in the printed circuit, a number of signal lines arrangeable between adjacent pins and a pin density, to calculate a total estimated number of pins. A person-hour calculator calculates person-hours required to prepare a pattern film of the printed circuit by dividing the total estimated number of the pins by an average number of pins handleable by a design engineer per a unit time.
摘要翻译： 本发明涉及一种估计系统，当估计系统估计准备要印刷在电路板上的电路的胶片图案所需的人工时间时，可以提供高可靠性的估计结果。 在收到设计条件的情况下，估计系统的参考引脚计算器基于从要集成在印刷电路板上的部件延伸的引脚总数来计算多个参考引脚，并且需要特殊规范要求 应用于印刷电路。 额外的引脚计算器根据信号线布线方法计算多个附加引脚。 总估计引脚计算器基于设计难度来校正参考引脚和附加引脚的总和，该设计难度由在印刷电路中制造的信号层数量，可布置在相邻引脚之间的多个信号线和 一个针脚密度，来计算一个总的估计引脚数。 人员计时器通过将总计估计的引脚数除以设计工程师每单位时间可处理的平均引脚数来计算准备印刷电路图案胶片所需的人工小时数。
-
公开(公告)号：US09077480B2
公开(公告)日：2015-07-07
申请号：US13598949
申请日：2012-08-30
IPC分类号： H04J4/00 , H04J14/02 , H04L12/729 , H04L12/721 , H04B10/00
CPC分类号： H04J14/0256 , H04J14/0257 , H04J14/0267 , H04J14/0271 , H04J14/0284 , H04J2203/0067 , H04L45/125 , H04L45/62
摘要： A demand accommodation design system for accommodating a demand specifying a signal transmission route from a start-point node to an end-point node within an optical network includes an analytical unit to acquire at least one optical path candidate for minimizing cost of the optical network by solving an objective function incorporating cost of optical path candidates by bandwidth, the optical path candidate being a candidate for an optical path composing a demand, and a mathematical programming problem employing a constraint condition incorporating a bandwidth of an optical path pattern candidate connecting the start-point node and the end-point node of the demand and a bandwidth of the acquired optical path candidate, the optical path pattern candidate being the acquired optical path candidate itself or being obtained by combining the optical path candidates, and an allocation unit to allocate the demand to the acquired optical path candidate to accommodate the demand.
摘要翻译： 一种用于适应指定从光点网络中的起点节点到端点节点的信号传输路由的需求的需求调节设计系统包括：分析单元，用于获取至少一个光路候选，以使光网络的成本最小化 解决通过带宽包含光路候选成本的目标函数，光路候选是构成需求的光路候选的数学规划问题，以及采用包含连接起始点的光路图案候选的带宽的约束条件的数学规划问题， 点节点和需求的终点节点以及所获取的光路候选的带宽，光路模式候选者是所获取的光路候选本身或通过组合光路候选获得，以及分配单元，用于分配 对所获得的光路候选者的需求满足需求。
-
公开(公告)号：US08676947B2
公开(公告)日：2014-03-18
申请号：US12474411
申请日：2009-05-29
申请人： Kazuyuki Tajima , Shinya Kano
发明人： Kazuyuki Tajima , Shinya Kano
IPC分类号： G06F15/173
CPC分类号： H04L69/14 , H04L45/125 , H04L45/22 , H04L47/70 , H04L47/726 , H04L69/40 , Y02D50/30
摘要： A resource reservation apparatus reserving a resource on a second and third route connecting a start with end node of the first route over a network having a resource on a first route, includes a resource controller for defining a fourth route including a link obtained by excluding a common link between the first and second route and between the first and third route from a link included in the first, second or third route, a message generator for generating a message used for reserving a resource of the link included in the fourth route and transmitting the message to a node on the fourth route, and a message processor for transmitting a message used for generating the second and third route from the resource on the first route and on the fourth route reserved by the message generator to a node included in the second or third route.
摘要翻译： 一种资源预留装置，在通过具有第一路径的资源的网络上连接起始于第一路由的终端的第二和第三路由上的资源包括资源控制器，用于定义包括通过排除 在第一和第二路由之间以及从包括在第一，第二或第三路由中的链路的第一和第三路由之间的公共链路，用于生成用于保留包括在第四路由中的链路的资源的消息的消息生成器， 向第四路由上的节点发送的消息，以及消息处理器，用于从第一路由上的资源和由消息生成器预留的第四路由发送用于生成第二和第三路由的消息到包括在第二路由中的节点 或第三条路线。
-
公开(公告)号：US20130101286A1
公开(公告)日：2013-04-25
申请号：US13598949
申请日：2012-08-30
IPC分类号： H04J14/00
CPC分类号： H04J14/0256 , H04J14/0257 , H04J14/0267 , H04J14/0271 , H04J14/0284 , H04J2203/0067 , H04L45/125 , H04L45/62
摘要： A demand accommodation design system for accommodating a demand specifying a signal transmission route from a start-point node to an end-point node within an optical network includes an analytical unit to acquire at least one optical path candidate for minimizing cost of the optical network by solving an objective function incorporating cost of optical path candidates by bandwidth, the optical path candidate being a candidate for an optical path composing a demand, and a mathematical programming problem employing a constraint condition incorporating a bandwidth of an optical path pattern candidate connecting the start-point node and the end-point node of the demand and a bandwidth of the acquired optical path candidate, the optical path pattern candidate being the acquired optical path candidate itself or being obtained by combining the optical path candidates, and an allocation unit to allocate the demand to the acquired optical path candidate to accommodate the demand.
摘要翻译： 一种用于适应指定从光点网络中的起点节点到端点节点的信号传输路由的需求的需求调节设计系统包括：分析单元，用于获取至少一个光路候选，以使光网络的成本最小化 解决通过带宽包含光路候选成本的目标函数，光路候选是构成需求的光路候选的数学规划问题，以及采用包含连接起始点的光路图案候选的带宽的约束条件的数学规划问题， 点节点和需求的终点节点以及所获取的光路候选的带宽，光路模式候选者是所获取的光路候选本身或通过组合光路候选获得，以及分配单元，用于分配 对所获得的光路候选者的需求满足需求。
-
47.发明授权Method and apparatus for keeping track of virtual LAN topology in network of nodes 有权在节点网络中跟踪虚拟LAN拓扑的方法和装置公开(公告)号：US08027262B2
公开(公告)日：2011-09-27
申请号：US11050152
申请日：2005-02-03
IPC分类号： H04J3/14
CPC分类号： H04L45/26 , H04L12/4641 , H04L45/02
摘要： An arbitrary node that belongs to a virtual LAN sends a request packet including a count value indicating the number of communication hops across nodes to each of its adjacent nodes that belong to the virtual LAN and are adjacent. Upon receiving the request packet, each of the adjacent nodes sends the request packet in which the count value is incremented or decremented to each of its adjacent nodes that belong to the virtual LAN and are adjacent to the node, excluding a sender of the request packet received, and sends a reply packet including the sender's address, an address of the node that is a replying node, and the count value to a given return destination. The return destination collects reply packets sent thereto and keeps track of the topology of the nodes constituting the virtual LAN from information contained in the reply packets.
摘要翻译： 属于虚拟LAN的任意节点将包含指示跨越节点的通信跳数的计数值的请求分组发送给属于虚拟LAN并且相邻的每个相邻节点。 在接收到请求分组时，每个相邻节点发送请求分组，其中计数值递增或递减到属于虚拟LAN的每个相邻节点，并且与节点相邻，不包括请求分组的发送者 接收并发送包括发送方地址，作为应答节点的节点的地址和计数值的应答分组到给定的返回目的地。 返回目的地收集发送到其中的应答分组，并且从包含在应答分组中的信息中跟踪构成虚拟LAN的节点的拓扑。
-
48.发明申请APPARATUS AND METHOD FOR FINDING A PAIR OF DISJOINT PATHS IN A COMMUNICATION NETWORK 有权用于在通信网络中找到一对分组码的装置和方法公开(公告)号：US20110038254A1
公开(公告)日：2011-02-17
申请号：US12853336
申请日：2010-08-10
IPC分类号： H04J3/14
CPC分类号： H04Q11/0062 , H04J14/0267 , H04J14/0268 , H04L45/1283 , H04L45/1287 , H04L45/22 , H04Q2011/0073
摘要： There is provided topology information including connection states among nodes in a network, and port information including restriction conditions on connectivity among ports within a restricted node. A path search apparatus finds a first path having the minimum total link-cost among a plurality of paths. The topology information is changed so that the first path is not searched for as a path having the minimum total link-cost among the plurality of paths, and the port information is changed based on a port connectivity change rule. Then, the path search apparatus finds a second path different from the first path, based on the changed port information and the changed topology information, and reconfigures a pair of link-disjoint paths satisfying the restriction conditions imposed on the restricted node, by removing a link shared by both the first and second paths from the original topology information.
摘要翻译： 提供了包括网络中的节点之间的连接状态的拓扑信息，以及包括受限节点内的端口之间的连接性的限制条件的端口信息。 路径搜索装置在多个路径中找到具有最小总链路成本的第一路径。 改变拓扑信息，使得第一路径不被搜索为多个路径中具有最小总链路成本的路径，并且基于端口连接性改变规则改变端口信息。 然后，路径搜索装置基于改变的端口信息和改变的拓扑信息，找到与第一路径不同的第二路径，并且通过去除一个对应于限制节点的限制条件来重新配置满足限制条件的一对链路不相交路径 链路由原始拓扑信息由第一和第二路径共享。
-
公开(公告)号：US07830789B2
公开(公告)日：2010-11-09
申请号：US12215449
申请日：2008-06-27
IPC分类号： H04L12/42
CPC分类号： H04J3/085 , H04J2203/0067 , H04L45/123 , H04L45/124 , H04L45/302
摘要： According an aspect of the embodiment, there is provided a method for accommodating signal paths to a ring network. A demand chain is defined as a series of traffic demands in which each traffic demand shares one of the pair of terminal nodes pointed thereby with at least one adjacent traffic demand and the number of pairs of terminal nodes pointed by traffic demands in the series of traffic demands is maximized. Each traffic demand of the demand chain is corresponded to a demand accommodating route which is defined as a route between the pair of terminal nodes on the ring network pointed by the each traffic demand and arranged in a predetermined rotation direction on the ring network. Then, signal paths required by traffic demands each pointing a pair of terminal nodes both included in the demand accommodating route chain are accommodated to the demand accommodating route chain.
摘要翻译： 根据实施例的一个方面，提供一种用于适应信号路径到环形网络的方法。 需求链被定义为一系列交通需求，其中每个交通需求分享至少一个相邻交通需求的一对终端节点中的一个，以及在一系列交通中指向交通需求的终端节点对数 要求最大化。 需求链的每个业务需求对应于需求容纳路由，其被定义为由每个业务需求指向的环形网络上的一对终端节点之间的路由，并且以环形网络上的预定旋转方向布置。 然后，由需求容纳路径链包括的一对终端节点指向需求容纳路由链所需的信号路径。
-
公开(公告)号：US07679467B2
公开(公告)日：2010-03-16
申请号：US11346296
申请日：2006-02-03
申请人： Manabu Hirata , Yoichi Fueki , Kazuyuki Tajima
发明人： Manabu Hirata , Yoichi Fueki , Kazuyuki Tajima
IPC分类号： H03K3/03
CPC分类号： H03L7/0995
摘要： A voltage controlled oscillator which performs an oscillating operation at a frequency corresponding to a control voltage, includes a voltage-current converter circuit which converts the control voltage to a control current corresponding to a voltage value thereof, and a ring oscillator through which an operating current corresponding to the control current generated by the voltage-current converter circuit is caused to flow, and which oscillates at a frequency corresponding to a current value thereof. The voltage-current converter circuit has a voltage-voltage converting circuit which inputs the control voltage therein and converts the same to a control current corresponding to the voltage value thereof, and an offset current generating circuit which adds a constant current to the control current.
摘要翻译： 以与控制电压对应的频率进行振荡动作的压控振荡器包括：电压 - 电流转换器电路，其将控制电压转换为对应于其电压值的控制电流;以及环路振荡器，通过该振荡器，工作电流 与由电压 - 电流转换器电路产生的控制电流相对应地流过，并以与其电流值对应的频率振荡。 电压 - 电流转换器电路具有输入其中的控制电压的电压 - 电压转换电路，并将其转换成与其电压值相对应的控制电流，以及将恒定电流加到控制电流上的偏移电流产生电路。
-
-
-
-
-
-
-
-
-
搜索结果
55 条记录 (耗时 0.024 秒)
