专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明专利

JP2010074375A Direct path establishing method, server device, sender network node device, direct path establishment network, and program thereof 有权
标题翻译：直接路径建立方法，服务器设备，发布者网络节点设备，直接路径建立网络及其程序
公开(公告)号：JP2010074375A
公开(公告)日：2010-04-02
申请号：JP2008238012
申请日：2008-09-17
申请人： Nippon Telegr & Teleph Corp , Research Organization Of Information & Systems , 大学共同利用機関法人情報・システム研究機構 , 日本電信電話株式会社
发明人： SHIMIZU KAORI , INOUE ICHIRO , SHIOMOTO KOHEI , URUSHIYA SHIGEO
IPC分类号： H04L12/701 , H04L12/723 , H04L12/733 , H04L12/911 , H04L12/913
摘要： PROBLEM TO BE SOLVED: To provide a direct path establishment technique for enabling a user node device to establish a direct path after recognizing the state of a network resource on the base of the state of a reservation path in response to an on-demand resource request. SOLUTION: The server device 3 includes: a resource managing means 301 for managing resources of a network 1; a route calculating means 302 for calculating a path route for housing or passing through the direct path 60; a direct resource setting request answering means 303 for transmitting a setting request for a path route; a path information storing means 304; a path establishment/completion notification receiving means 305 for receiving a message showing that the establishment of the direct path is completed; a path information updating means 306; and a DB (database) 307. COPYRIGHT: (C)2010,JPO&INPIT
摘要翻译：要解决的问题：提供一种直接路径建立技术，用于使用户节点设备能够响应于在线状态确定基于预留路径的状态的网络资源的状态来建立直接路径，需求资源请求。解决方案：服务器设备3包括：资源管理装置301，用于管理网络1的资源; 用于计算用于容纳或通过直接路径60的路径路径的路线计算装置302; 用于发送路径路径的设置请求的直接资源设置请求应答装置303; 路径信息存储装置304; 路径建立/完成通知接收装置305，用于接收表示直接路径的建立完成的消息; 路径信息更新装置306; 和数据库（数据库）307.版权所有（C）2010，JPO＆INPIT

2. 发明专利

JP2010011258A Route switching method, server device, boundary node device, route switching system and route switching program 有权
标题翻译：路由切换方法，服务器设备，边界节点设备，路由交换系统和路由切换程序
公开(公告)号：JP2010011258A
公开(公告)日：2010-01-14
申请号：JP2008169950
申请日：2008-06-30
申请人： Nippon Telegr & Teleph Corp , Research Organization Of Information & Systems , 大学共同利用機関法人情報・システム研究機構 , 日本電信電話株式会社
发明人： SHIMIZU KAORI , INOUE ICHIRO , SHIOMOTO KOHEI , URUSHIYA SHIGEO
IPC分类号： H04L12/707 , H04L12/711 , H04L12/717
CPC分类号： H04L45/02 , H04L41/0663 , H04L45/00 , H04L45/22 , H04L45/28 , H04L47/70 , H04L47/728 , H04L47/826 , H04L49/552 , H04L69/14 , H04L69/40 , Y02D50/30
摘要： PROBLEM TO BE SOLVED: To provide a network switching technique for establishing a high-reliability path in response to a connection request from a user while considering a time base. SOLUTION: A server device 5 includes: a connection request receiving means 201; a resource management means 202 for managing resources of a core network; a route calculating means 203 for calculating a route of an active-side path 61 and a route of a reserve-side path 63 in response to a connection request from a user; a high-reliability path request means 204 requesting a caller node device 10 to establish the active-side path 61; an active-side path request response receiving means 205; an active-side path establishment receiving means 206; a reserve-side path establishment receiving means 207 for receiving the route of the reserve-side path 63 switched by the caller node device 10; a path information updating means 208; and a storage means 209. COPYRIGHT: (C)2010,JPO&INPIT
摘要翻译：要解决的问题：提供一种用于在考虑时基的同时响应于来自用户的连接请求建立高可靠性路径的网络交换技术。服务器装置5包括：连接请求接收装置201; 用于管理核心网络的资源的资源管理装置202; 路由计算装置203，用于响应于来自用户的连接请求，计算活动侧路径61的路径和预留侧路径63的路径; 请求主叫节点装置10建立主动侧路径61的高可靠性路径请求装置204; 主动侧路径请求响应接收装置205; 主动侧路径建立接收装置206; 用于接收由主叫节点设备10切换的保留侧路径63的路由的预约侧路径建立接收装置207; 路径信息更新装置208; 和存储装置209.版权所有（C）2010，JPO＆INPIT

3. 发明专利

JP2017085388A ルーティングテーブル生成装置、ルーティングテーブル生成方法、及びプログラム审中-公开
公开(公告)号：JP2017085388A
公开(公告)日：2017-05-18
申请号：JP2015212464
申请日：2015-10-29
申请人：日本電信電話株式会社 , Nippon Telegr & Teleph Corp
发明人： TAKAHASHI YOSUKE , SUZUKI AKITO , TSUJINO MASAYUKI , ISHIBASHI KEISUKE , SHIOMOTO KOHEI
IPC分类号： H04L12/721 , H04L12/717
摘要：【課題】任意の方法で得られた経路情報を設定可能な転送装置の範囲を拡張すること。【解決手段】ルーティングテーブル生成装置は、転送装置に関する発着ノード別のトラヒック量についてのルーティングテーブルのエントリ別の割合の集合を、前記転送装置による転送先ごとのグループに分類する分類部と、前記割合が分類されたグループに対応する転送先が、当該割合に係る前記エントリの条件に合致した場合の転送先となるように前記各エントリを生成する生成部とを有し、前記分類部は、前記グループごとに、当該グループに分類された割合の総和と、当該グループに対応する転送先に対して前記発着ノード別のトラヒックに関して入力された、転送先別のトラヒック量の割合の目標値との差分が最小となるように、前記エントリ別のトラヒック量の割合の集合を分類する。【選択図】図3

4. 发明专利

JP2013005045A Optimum path selection method, optimum path selection program and optimum path selection device 有权
标题翻译：最佳路径选择方法，最佳路径选择方案和最佳路径选择装置
公开(公告)号：JP2013005045A
公开(公告)日：2013-01-07
申请号：JP2011131448
申请日：2011-06-13
申请人： Nippon Telegr & Teleph Corp , 日本電信電話株式会社
发明人： FUKUDA AKI , HAYASHI RIE , SHIOMOTO KOHEI
IPC分类号： H04L12/701
摘要： PROBLEM TO BE SOLVED: To provide broadband-guaranteed paths on demand from users in a multi-domain network extending over two or more domains, each differing in transmission method.SOLUTION: In a multi-domain network 11 including at least one domain 12-n, an optimum path selection device 20 includes a processing unit 30 and a storage unit 40 which stores therein domain adjacency relations information 41 on domains 12-n. The processing unit 30 selects an optimum domain on the basis of a band threshold and domain band information, gives metric to domain-to-domain links so that the selected optimum domain will be preferentially gone through, and selects a candidate path based on the metric and the domain adjacency relations information 41. If two or more of this candidate path exist, candidate paths passing a domain 12-n having the highest band usage rate are excluded based on the band information and band usage information of the domains 12-n present in the candidate paths, in which way an optimum path is determined by repeating this exclusion process.
摘要翻译：要解决的问题：为了在跨越两个或多个域的多域网络中提供来自用户的宽带保证路径，每个不同的传输方式。解决方案：在包括至少一个域12-n的多域网络11中，最佳路径选择设备20包括处理单元30和存储单元40，其存储域12-n上的域邻接关系信息41 。处理单元30基于频带阈值和域频带信息来选择最佳域，给出域到域链路的度量，使得所选择的最优域将优先地经过，并且基于度量来选择候选路径如果存在这种候选路径中的两个或更多个，则通过具有最高频带使用率的域12-n的候选路径基于存在的域12-n的频带信息和频带使用信息被排除在候选路径中，以这种方式通过重复该排除过程来确定最佳路径。版权所有（C）2013，JPO＆INPIT

5. 发明专利

JP2012244592A Path setting method and path setting device 有权
标题翻译：路径设置方法和路径设置设备
公开(公告)号：JP2012244592A
公开(公告)日：2012-12-10
申请号：JP2011116088
申请日：2011-05-24
申请人： Nippon Telegr & Teleph Corp , 日本電信電話株式会社
发明人： HAYASHI RIE , SHIMAZAKI DAISAKU , SHIOMOTO KOHEI
IPC分类号： H04L12/56
摘要： PROBLEM TO BE SOLVED: To set an optical path in a network including a mixed WSON non-compatible communication device with a WSON compatible communication device, without adding a function to handle a WSON information element to the WSON non-compatible communication device.SOLUTION: In a network 1, when a path is set from a WSON non-compatible communication device 2A to a WSON non-compatible communication device 2B, the WSON non-compatible communication device 2A transmits a signaling message (without wavelength information), and a WSON compatible communication device 3A adds wavelength information (WSON information element) to the signaling message. In a WSON 3000, the signaling message (with wavelength information) is transferred. A WSON compatible communication device 3B removes the wavelength information from the signaling message (with wavelength information), and forwards a signaling message (without wavelength information) to the WSON non-compatible communication device 2B.
摘要翻译：要解决的问题：为了在WSON兼容通信设备中设置包括混合WSON不兼容通信设备的网络中的光路，而不添加将WSON信息元件处理到WSON不兼容通信设备的功能。解决方案：在网络1中，当从WSON不兼容通信设备2A到WSON不兼容通信设备2B设置路径时，WSON不兼容通信设备2A发送信令消息（没有波长信息），并且WSON兼容通信设备3A将波长信息（WSON信息元素）添加到信令消息。在WSON 3000中，信令消息（具有波长信息）被传送。 WSON兼容通信设备3B从信令消息（具有波长信息）中去除波长信息，并将信令消息（无波长信息）转发到WSON不兼容通信设备2B。版权所有（C）2013，JPO＆INPIT

6. 发明专利

JP2012209794A Network resource management device and network resource management method 有权
标题翻译：网络资源管理设备和网络资源管理方法
公开(公告)号：JP2012209794A
公开(公告)日：2012-10-25
申请号：JP2011074338
申请日：2011-03-30
申请人： Nippon Telegr & Teleph Corp , 日本電信電話株式会社
发明人： MIYAMURA TAKASHI , KAMAMURA SEIHEI , SHIOMOTO KOHEI
IPC分类号： H04L12/56
摘要： PROBLEM TO BE SOLVED: To restrict interaction between virtual networks in an infrastructural network accommodating plural virtual networks, thereby making it possible to prevent network quality from being degraded by fluctuations in a traffic pattern.SOLUTION: A network resource management device 10 has stored in a storage unit 12 traffic demand information 500 in which traffic matrix volumes between virtual nodes of each virtual network are stored. The network resource management device 10, after extracting two out of plural virtual networks, calculates a coefficient of correlation between matrix volumes of traffic to and from the same ground. Next, the network resource management device 10 allocates a dedicated type physical resource to physical links on a path route of an infrastructure network corresponding to a ground path between grounds having a positive correlation, after excluding a shared type physical resource allocated thereto.
摘要翻译：要解决的问题：为了限制容纳多个虚拟网络的基础设施网络中的虚拟网络之间的交互，从而可以防止网络质量由于业务模式的波动而恶化。解决方案：网络资源管理设备10已经存储在存储单元12中，其中存储有每个虚拟网络的虚拟节点之间的业务矩阵体积的业务需求信息500。网络资源管理装置10在提取多个虚拟网络中的两个之后，计算到同一地面的通信量的矩阵体积之间的相关系数。接下来，在排除分配给其的共享型物理资源之后，网络资源管理设备10将专用类型的物理资源分配给与具有正相关的接地之间的接地路径相对应的基础设施网络的路径路径上的物理链路。版权所有（C）2013，JPO＆INPIT

7. 发明专利

JP2012004639A Link band fluctuation upper limit calculation apparatus and link band fluctuation upper limit calculation method 有权
标题翻译：链条波动上限极限计算装置和链带波动上限极限计算方法
公开(公告)号：JP2012004639A
公开(公告)日：2012-01-05
申请号：JP2010135029
申请日：2010-06-14
申请人： Nippon Telegr & Teleph Corp , 日本電信電話株式会社
发明人： SUGIYAMA RYUTA , TAKEDA TOMONORI , UEMATSU YOSHIHIKO , SHIOMOTO KOHEI
IPC分类号： H04L12/801 , H04L12/24 , H04L12/70 , H04L12/911
摘要： PROBLEM TO BE SOLVED: To provide a link band fluctuation upper limit calculation apparatus and a link band fluctuation upper limit calculation method capable of reducing the time for calculating an upper limit value of band fluctuation for each link in accordance with linear scheduling.SOLUTION: A link band fluctuation upper limit calculation apparatus 1 acquires a link band vector 100 of a network to perform link band design thereon; an AC traffic route matrix 200, and a route changed AC traffic route matrix 300. The link band fluctuation upper limit calculation apparatus 1 reduces the number of parameters (AC traffic bands t) to be used for a computational expression according to linear scheduling and the number of restriction conditional expressions and then performs computation processing in accordance with linear scheduling, thereby generating a link band fluctuation upper limit vector 1000 that is an upper limit value of band fluctuation for each link at the time when a route of each AC traffic is changed in response to a route change.
摘要翻译：要解决的问题：提供一种能够根据线性调度来减少用于计算每个链路的频带波动的上限值的时间的链路波动波动上限计算装置和链路波动波动上限计算方法。解决方案：链路波动波动上限计算装置1获取网络的链路频带向量100，对网络进行链路频带设计; 交通流量路由矩阵200和路由改变AC业务路由矩阵300.链路波动上限计算装置1减少参数数（AC业务频带t j ）用于根据线性调度和限制条件表达式的计算表达式，然后根据线性调度执行计算处理，从而生成作为每个的频带变动的上限值的链路波动波动上限向量1000 每个AC业务的路由响应于路由改变而改变时的链路。版权所有（C）2012，JPO＆INPIT

8. 发明专利

JP2011139387A Simulation apparatus and simulation method 有权
标题翻译：模拟装置和模拟方法
公开(公告)号：JP2011139387A
公开(公告)日：2011-07-14
申请号：JP2009299163
申请日：2009-12-29
申请人： Nippon Telegr & Teleph Corp , 日本電信電話株式会社
发明人： KOJIMA HISASHI , INOUE ICHIRO , SHIOMOTO KOHEI
IPC分类号： H04L12/701 , H04L12/24 , H04L12/715 , H04L12/751
摘要： PROBLEM TO BE SOLVED: To shorten time required for simulation of best path selection in an IP network configured with a plurality of ASs. SOLUTION: A simulation apparatus prepares an intra-AS network and an AS level network of each AS based on network configuration information of an IP network. As for the intra-AS network, high-speed simulation is performed, and as to a boundary router of which the optimum route is changed as the result of high-speed simulation, route information to be advertised to a boundary router of another AS on the AS level network is simulated based on the changed optimum route. On the basis of the simulation result of the route information advertised to the other AS, high-speed simulation is executed. Such processing is successively executed for respective ASs to obtain a simulation result of the whole IP network. COPYRIGHT: (C)2011,JPO&INPIT
摘要翻译：解决的问题：缩短在配置有多个AS的IP网络中模拟最佳路径选择所需的时间。解决方案：仿真设备根据IP网络的网络配置信息准备每个AS的AS内AS和AS级网络。对于AS内网络，进行高速仿真，对于作为高速仿真的结果，优化路由发生变化的边界路由器，要通告给另一个AS的边界路由器的路由信息基于改变的最优路由模拟AS级网络。根据通告给其他AS的路由信息的模拟结果，执行高速仿真。对各AS依次执行这种处理，以获得整个IP网络的仿真结果。版权所有（C）2011，JPO＆INPIT

9. 发明专利

JP2011049699A Device and method for computing upper limit of link band variation amount, and program 有权
标题翻译：用于计算链路带宽变化量的上限的设备和方法以及程序
公开(公告)号：JP2011049699A
公开(公告)日：2011-03-10
申请号：JP2009194815
申请日：2009-08-25
申请人： Nippon Telegr & Teleph Corp , 日本電信電話株式会社
发明人： SUGIYAMA RYUTA , TAKEDA TOMONORI , KOJIMA HISASHI , INOUE ICHIRO , SHIOMOTO KOHEI
IPC分类号： H04L12/801 , H04L12/70 , H04L12/911
摘要： PROBLEM TO BE SOLVED: To provide a device for computing an upper limit of a link band variation amount which reduce an extension amount of respective link bands by route change in a link band design; a method for computing the upper limit of the link band variation amount; and program. SOLUTION: The device 1 for computing the upper limit of the link band variation amount creates an upper limit vector 1000 for link band variation amount, which is the upper limit value of a band variation amount of each link when a route of each interchange traffic is changed caused by route change or occurrence of a failure by solving an operation equation of a linear programming method using a number of network links of the link band design, a number of interchange traffic, a link band vector 200, an interchange traffic route matrix 400, and the interchange traffic route matrix 400 after the route change or after the occurrence of the failure. COPYRIGHT: (C)2011,JPO&INPIT
摘要翻译：要解决的问题：提供一种用于计算链路频带变化量的上限的装置，其通过链路频带设计中的路由改变来减少各个链路频带的扩展量; 用于计算链路频带变化量的上限的方法; 和程序。解决方案：用于计算链路频带变化量的上限的设备1为链路频带变化量创建上限矢量1000，链路频带变化量是每个链路的路由的每个链路的频带变化量的上限值通过使用链路频带设计的多个网络链路，多个交换业务，链路频带向量200，交换业务量来解决线路规划方法的线性规划方法的运行方程，由于路由改变或故障发生而导致交换业务变化路由矩阵400和路由改变之后或发生故障之后的交换路由矩阵400。版权所有（C）2011，JPO＆INPIT

10. 发明专利

JP2011004360A Network system, node, packet transfer method, and program for the method 有权
标题翻译：网络系统，节点，分组传输方法和方法
公开(公告)号：JP2011004360A
公开(公告)日：2011-01-06
申请号：JP2009148024
申请日：2009-06-22
申请人： Nippon Telegr & Teleph Corp , 日本電信電話株式会社
发明人： ISOGAI AKINORI , KOJIMA HISASHI , INOUE ICHIRO , SHIOMOTO KOHEI
IPC分类号： H04L12/70
摘要： PROBLEM TO BE SOLVED: To reduce the number of addresses to be secured in overlay tree topology and to ease restriction when a new node participates in a logical network.SOLUTION: A logical network in each service is configured by tree topology and the logical network is divided into areas composed of one or more subtrees. Addressing to nodes in the areas is performed by using the maximum number Lm of hierarchies set in each area and the maximum number Rmof slave nodes set in each hierarchy d of the area. Respective areas are also configured by a tree structure, and an area number of each area is addressed by using the maximum number Aarea_Lm of area hierarchies and the maximum number Aarea_Rmof slave areas set in each area hierarchy Aarea_d.
摘要翻译：要解决的问题：减少覆盖树拓扑中要保护的地址数量，并在新节点参与逻辑网络时简化限制。解决方案：每个业务中的逻辑网络由树形拓扑配置，逻辑网络为分为由一个或多个子树组成的区域。通过使用在每个区域中设置的层次结构的最大数量Lm和在该区域的每个层级d中设置的从节点的最大数量Rm来执行对区域中的节点的寻址。相应的区域也由树结构配置，并且通过使用在每个区域层级Aarea_d中设置的区域层次的最大数量Aarea_Lm和设置的从属区域的最大数量Aarea_Rm来寻址每个区域的区域编号。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式