会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 3. 发明专利
    • Presence information distribution device and method
    • 存在信息分配设备和方法
    • JP2012044427A
    • 2012-03-01
    • JP2010183477
    • 2010-08-18
    • Nippon Telegr & Teleph Corp 日本電信電話株式会社
    • BABA HIROKITAKATANI NAOKIINOUE ICHIROKUROKAWA AKIRA
    • H04M3/20
    • PROBLEM TO BE SOLVED: To suppress an increase of communication traffic, and in addition to reduce cache memory capacity and a search processing load in an SIP application server.SOLUTION: When a presence request is received and if a corresponding dialogue does not exist, a presence information distribution device obtains presence information of a corresponding user A from a presence server 3 and transfers it to a request source client device CT and also obtains the friend list of the user A from an SNS server 4. The presence information distribution device extracts the number of friends N from the friend list, compares this number of friends N of the user A with the minimum number of friends Nmin of other users already cached in a cache memory 40, and if N≥Nmin, makes the cache memory 40 store the cache information of the user A instead of the cache information of a user having the minimum number of friends Nmin stored in the cache memory 40, and opens an SIP dialogue of the user having the minimum number of friends Nmin.
    • 解决的问题:抑制通信业务的增加,以及减少SIP应用服务器中的高速缓存存储容量和搜索处理负荷。 解决方案:当接收到存在请求并且如果对应的对话不存在时,存在信息分发设备从存在服务器3获取对应用户A的存在信息,并将其传送到请求源客户端设备CT,并且还 从SNS服务器4获取用户A的朋友列表。存在信息分发设备从朋友列表中提取朋友N的数量,将用户A的朋友数N与其他用户的最小朋友数Nmin进行比较 已经缓存在高速缓冲存储器40中,并且如果N≥Nmin,高速缓存存储器40存储用户A的高速缓存信息,而不是存储在高速缓冲存储器40中的具有最小数量的朋友Nmin的用户的缓存信息,以及 打开具有最小数量的朋友Nmin的用户的SIP对话。 版权所有(C)2012,JPO&INPIT
    • 4. 发明专利
    • Qos controller and method for controlling qos
    • QOS控制器和控制QOS的方法
    • JP2011166625A
    • 2011-08-25
    • JP2010029522
    • 2010-02-12
    • Nippon Telegr & Teleph Corp 日本電信電話株式会社
    • KAWAKAMI KENTATAKASUGI KOICHIINOUE ICHIROKUROKAWA AKIRA
    • H04L12/911H04L12/927H04W28/24H04W72/04H04W92/04
    • PROBLEM TO BE SOLVED: To use the same QoS control method in wired access and wireless access to facilitate FMC service provision. SOLUTION: A QoS controller includes a user information storage means that stores a user policy corresponding to services for a wired access network and a user policy corresponding to services for a wireless access network for each terminal, a decision means that decides whether to permit service provision with reference to the user information storage means, a service policy storage means that stores the service policy corresponding to services for the wired access network and the service policy corresponding to services for the wireless access network, a decision means that decides whether services conform to the service policy with reference to the service policy storage means, a resource information storage means that stores resource information representing resources available in a predetermined section of the access network, and a decision means that decides resources with reference to the resource information storage means. COPYRIGHT: (C)2011,JPO&INPIT
    • 要解决的问题:在有线接入和无线接入中使用相同的QoS控制方法来促进FMC服务提供。 解决方案:QoS控制器包括用户信息存储装置,其存储对应于有线接入网络的业务的用户策略和对应于每个终端的无线接入网络的业务的用户策略;决定装置, 允许参考用户信息存储装置提供服务;服务策略存储装置,其存储与有线接入网络的服务相对应的服务策略和与无线接入网络的服务相对应的服务策略;决定装置, 参照服务策略存储单元,符合服务策略的资源信息存储单元,存储表示在接入网的预定部分中可用的资源的资源信息的资源信息存储单元,以及参照资源信息存储单元决定资源的决定单元 。 版权所有(C)2011,JPO&INPIT
    • 5. 发明专利
    • Switch, interface information creation method, and program thereof
    • 开关,界面信息创建方法及其程序
    • JP2011146819A
    • 2011-07-28
    • JP2010004426
    • 2010-01-12
    • Nippon Telegr & Teleph Corp 日本電信電話株式会社
    • HAYASHI RIEINOUE ICHIRO
    • H04B10/27H04B10/03H04B10/077H04B10/291H04J14/00H04J14/02H04L12/70
    • PROBLEM TO BE SOLVED: To avoid the non-convergence of retrieval times because IFs of an adjacent switch to be opposite in linking-up retrieval processing of each switch are not found indefinitely.
      SOLUTION: Switches 10 (10A and 10B) determine the transmission time of a signal for linking-up retrieval on the basis of respective device IDs of the switches 10. When the switches 10 select an IF in which linking-up retrieval processing is performed, the switches 10 continuously transmit the signal for linking-up retrieval about the IF for the determined transmission time. When a signal from an adjacent switch cannot be received by the IF, another IF is selected, and the signal for linking-up retrieval is continuously transmitted for the transmission time. When the signal from the adjacent switch is received here, that is, when the linking-up is successful, information of the IF is recorded in interface information. Such processing is executed until linking-up of all IFs is successful.
      COPYRIGHT: (C)2011,JPO&INPIT
    • 要解决的问题:为了避免检索时间的不收敛,因为不能无限期地发现每个交换机的连接检索处理中相邻交换机的IF相反。 解决方案:开关10(10A和10B)基于开关10的相应装置ID确定用于连接检索的信号的传输时间。当开关10选择IF,其中连接检索处理 开关10在确定的传输时间内连续发送关于IF的链接检索的信号。 当来自相邻交换机的信号不能被IF接收时,选择另一个IF,并且在传输时间连续地发送用于链接检索的信号。 当在这里接收到来自相邻交换机的信号时,即当连接成功时,IF的信息被记录在接口信息中。 执行这样的处理,直到所有IF的连接成功。 版权所有(C)2011,JPO&INPIT
    • 6. 发明专利
    • Network topology design apparatus, network topology design method and program
    • 网络拓扑设计设计,网络拓扑设计方法与程序
    • JP2011004294A
    • 2011-01-06
    • JP2009147131
    • 2009-06-22
    • Nippon Telegr & Teleph Corp 日本電信電話株式会社
    • ISOGAI AKINORIKOJIMA HISASHIINOUE ICHIROSHIOMOTO KOHEI
    • H04L12/70H04L12/701H04L12/721
    • PROBLEM TO BE SOLVED: To provide a network topology design apparatus, a network topology design method and a program, wherein a resource utilization amount in the whole network is reduced and more topologies are stored in the network.SOLUTION: In storing topologies in each of a plurality of services in an overlay network constructed on an upper layer of a router network (lower network) including a plurality of nodes, the network topology design apparatus 10 calculates a resource utilization amount to be consumed in each service and preferentially stores service having a larger resource utilization amount. Further, the network topology design apparatus 10 calculates a link utilization rate of each link in the router network (lower network) 2 and selects a route by using link cost in which a link having a high link utilization rate is not easily utilized to construct the topology of each service.
    • 要解决的问题:提供网络拓扑设计装置,网络拓扑设计方法和程序,其中整个网络中的资源利用量减少,并且更多的拓扑被存储在网络中。解决方案:在每个 网络拓扑设计装置10计算在每个服务中消耗的资源利用量,并优先存储具有多个节点的服务的多个服务,其中,所述多个服务在由包括多个节点的路由器网络(下层网络) 资源利用量较大。 此外,网络拓扑设计装置10计算路由器网络(下层网络)2中的每个链路的链路利用率,并且通过使用具有高链路利用率的链路不容易利用来构建链路成本的链路成本来选择路由 每个服务的拓扑。
    • 7. 发明专利
    • Data transfer method, termination node and boundary node
    • 数据传输方法,终止节点和边界节点
    • JP2010199785A
    • 2010-09-09
    • JP2009040368
    • 2009-02-24
    • Nippon Telegr & Teleph Corp 日本電信電話株式会社
    • SUGIYAMA RYUTATAKEDA TOMONORIINOUE ICHIROSHIOMOTO KOHEI
    • H04L12/951H04L12/749
    • PROBLEM TO BE SOLVED: To eliminate the need of performing the processing of a header corresponding to each service housed inside a multi-domain network by the boundary node of each domain. SOLUTION: The termination node 1 sets a universal layer 102 across all the domains 10 inside the multi-domain network 100. Then, the header of the universal layer 102 is added to the header of the service layer 101 of data to be transferred and the header of the service layer 101 is encapsulated. Further, the termination node 1 adds the header of a transport layer 103 and performs transfer. The boundary node 2 eliminates the header of the transport layer 103, changes the header of the universal layer 102, and thus transfers the data to the boundary node 2 of another domain 10. COPYRIGHT: (C)2010,JPO&INPIT
    • 要解决的问题:为了消除对每个域的边界节点处理与多域网络内的每个服务相对应的报头的处理的需要。 解决方案:终端节点1跨越多域网络100内的所有域10设置通用层102.然后,将通用层102的报头添加到业务层101的报头中, 传送,并且封装服务层101的头部。 此外,终止节点1添加传输层103的头部并进行传送。 边界节点2消除传输层103的报头,改变通用层102的报头,从而将数据传送到另一域10的边界节点2.(C)2010,JPO&INPIT
    • 8. 发明专利
    • Congestion influence degree evaluation apparatus, congestion influence degree evaluation method and program therefor
    • 约束影响程度评估装置,意见影响度评估方法及其程序
    • JP2010193321A
    • 2010-09-02
    • JP2009037234
    • 2009-02-19
    • Nippon Telegr & Teleph Corp 日本電信電話株式会社
    • KOJIMA HISASHIKAMAMURA SEIHEIINOUE ICHIRO
    • H04L12/70
    • PROBLEM TO BE SOLVED: To specify a link having a high possibility of the occurrence of congestion when a plurality of IP links become uncommunicable. SOLUTION: A congestion influence degree evaluation apparatus 10 uses network setting information and fault position information indicative of a fault pattern to create route information 134 indicative of a detour route in the case that a fault of the fault pattern occurs on a network. Next, based on the detour route and alternating traffic information in the network, the traffic volume information 135 of each link in the network is obtained for each fault pattern. The presence/absence of a congestion occurrence link from a result of simulation and a degree of congestion are outputted as a congestion influence degree evaluation result when there is the congestion occurrence link. COPYRIGHT: (C)2010,JPO&INPIT
    • 要解决的问题:当多个IP链路变得不可通信时,指定具有发生拥塞的可能性高的链路。 解决方案:在网络上发生故障模式的故障的情况下,拥塞影响度评估装置10使用指示故障模式的网络设置信息和故障位置信息来创建指示迂回路由的路由信息​​134。 接下来,基于迂回路由和网络中的交替交通信息,针对每个故障模式获得网络中每个链路的业务量信息135。 当存在拥塞发生链路时,将来自模拟结果和拥塞程度的拥塞发生链路的存在/不存在作为拥塞影响度评估结果被输出。 版权所有(C)2010,JPO&INPIT
    • 9. 发明专利
    • Band allocation method, band allocation device, and band allocation program
    • 带分配方法,带分配设备和带分配方案
    • JP2009296136A
    • 2009-12-17
    • JP2008145810
    • 2008-06-03
    • Nippon Telegr & Teleph Corp 日本電信電話株式会社
    • HAYASHI RIESHIMIZU KAORIINOUE ICHIRO
    • H04L12/801H04L12/911H04L12/919
    • PROBLEM TO BE SOLVED: To provide a technique for reducing a reject rate of reservation by sharing an unused empty band in path bands for effective use, and by preventing the band from being occupied. SOLUTION: A service band BWa, namely the band of service A, and a service band BWb, namely the band of service B, are allocated to the band of the path in advance. Then, a band allocation device 10 calculates an empty band Wv for the service A, when receiving the reservation of the band by the service B at time t0. The empty band Wv is calculated by subtracting the maximum allocated band Wat (the maximum value of the total of reservation allocation bands between time t1-t2) from the service band BWa. As shown in Fig.10, when time and band directions are set to be X, Y axes, respectively, a straight line passing through a point (X, Y)=(t0, Wv) and a point (X, Y)=(t3, 0), namely an empty band allocation function X(t), is applied to set a value X(t2) to be a rental band Wxb. COPYRIGHT: (C)2010,JPO&INPIT
    • 要解决的问题:提供一种用于通过共享用于有效使用的路径频带中的未使用的空白频带以及通过防止频带被占用来减少预约的拒绝率的技术。 解决方案:服务频带BWa,即服务频带A和服务频带BWb,即服务频带B,被预先分配给路径的频带。 然后,频带分配装置10在时间t0接收服务B的频带的预约时,计算服务A的空频带Wv。 通过从服务频带BWa中减去最大分配频带Wat(时间t1-t2之间的预留分配频带的总和的最大值)来计算空频带Wv。 如图10所示,当时间和频带方向分别设定为X,Y轴时,通过点(X,Y)=(t0,Wv)和点(X,Y)= (t3,0),即空带分配函数X(t),将值X(t2)设定为出租带Wxb。 版权所有(C)2010,JPO&INPIT
    • 10. 发明专利
    • Method and program for bgp simulation, and simulator
    • 用于BGP仿真的方法和程序,以及模拟器
    • JP2009200775A
    • 2009-09-03
    • JP2008039799
    • 2008-02-21
    • Nippon Telegr & Teleph Corp 日本電信電話株式会社
    • KOJIMA HISASHIINOUE ICHIROSHIOMOTO KOHEI
    • H04L12/701H04L12/715
    • PROBLEM TO BE SOLVED: To reduce time for BGP simulations. SOLUTION: A simulator 10 acquires a BGP attribute value to be configured for routing information which is advertized by a sponsor router of the routing information in an IP network 1 based on BGP filter information. Then, the simulator 10 determines to which router 2 the routing information advertized by the sponsor router is transmitted based on topology information in the IP network 1. If there is possibility that the router 2 receives routing information, the address of which is the same, at a plurality of times, the simulator 10 simulates which route is to be selected as the optimum route based on the BGP attribute value added to the routing information. COPYRIGHT: (C)2009,JPO&INPIT
    • 要解决的问题:减少BGP仿真的时间。 解决方案:模拟器10基于BGP过滤器信息获取要配置用于由IP网络1中的路由信息​​的赞助路由器通告的路由信息​​的BGP属性值。 然后,模拟器10基于IP网络1中的拓扑信息,确定向哪个路由器2发送由主办路由器通告的路由信息​​。如果路由器2有可能接收地址相同的路由信息​​, 在多次的情况下,模拟器10基于添加到路由信息的BGP属性值,模拟哪个路由被选择为最佳路由。 版权所有(C)2009,JPO&INPIT