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

1. 发明申请

US20090228591A1 INFORMATION PROCESSING APPARATUS, INFORMATION PROCESSING APPARATUS CONTROL METHOD, AND COMPUTER PRODUCT 审中-公开
标题翻译：信息处理设备，信息处理设备控制方法和计算机产品
公开(公告)号：US20090228591A1
公开(公告)日：2009-09-10
申请号：US12399216
申请日：2009-03-06
申请人： Hideki MITSUNOBU , Takao MOHRI
发明人： Hideki MITSUNOBU , Takao MOHRI
IPC分类号： G06F15/173
CPC分类号： H04L67/16 , H04L12/2809 , H04L2012/2849
摘要： An information processing apparatus includes a service-start notifying unit and an existence-confirmation notifying unit. The service-start notifying unit generates, when a new UPnP service starts, a service-start-time broadcast packet and sends it to other information processing apparatuses in a UPnP network. The existence-confirmation notifying unit generates a service-time broadcast packet and sends it to the other information processing apparatuses in the UPnP network.
摘要翻译：信息处理装置包括服务启动通知单元和存在确认通知单元。服务启动通知单元在新的UPnP服务启动时生成服务起始时间广播包并将其发送到UPnP网络中的其他信息处理设备。存在确认通知单元生成服务时间广播分组，并将其发送到UPnP网络中的其他信息处理装置。

2. 发明申请

US20110206034A1 ROUTE ALLOCATION APPARATUS AND METHOD 有权
标题翻译：路由器分配设备和方法
公开(公告)号：US20110206034A1
公开(公告)日：2011-08-25
申请号：US13017423
申请日：2011-01-31
申请人： Toshihiko KURITA , Hideki MITSUNOBU
发明人： Toshihiko KURITA , Hideki MITSUNOBU
IPC分类号： H04L12/28
CPC分类号： H04L45/00 , H04L45/42
摘要： A route allocation apparatus includes a route calculation section and a route allocation controller. The route calculation section calculates a route between an outgoing edge node and incoming edge node within a network. The route allocation controller allocates the route to communication slots. Further, the route allocation controller calculates an expected value as an index of the number of the routes allocatable to the communication slots, selects a route allocation in which the expected value is a maximum, obtains the number of the routes allocatable to the selected communication slots after the route allocation, and updates the expected value.
摘要翻译：路由分配装置包括路由计算部和路由分配控制部。路由计算部分计算网络内的边缘边缘节点和入口边缘节点之间的路由。路由分配控制器将路由分配给通信时隙。此外，路由分配控制器将期望值计算为可分配给通信时隙的路由的数量的索引，选择期望值为最大的路由分配，获得可分配给所选择的通信时隙的路由的数量路由分配后，更新预期值。

3. 发明申请

US20110205890A1 COMMUNICATION MANAGEMENT APPARATUS, COMMUNICATION MANAGEMENT METHOD, AND COMPUTER PRODUCT 有权
标题翻译：通信管理设备，通信管理方法和计算机产品
公开(公告)号：US20110205890A1
公开(公告)日：2011-08-25
申请号：US13022701
申请日：2011-02-08
申请人： Toshihiko KURITA , Hideki MITSUNOBU
发明人： Toshihiko KURITA , Hideki MITSUNOBU
IPC分类号： H04L12/26
CPC分类号： H04L41/083 , H04L45/122
摘要： An allocation unit allocates a path formed by combining a link between nodes to any one of a plurality of time slots. A slot rearrangement unit rearranges the plurality of time slots so that time slots to which a path is allocated by the allocation unit are consecutively arranged. A path rearrangement unit converts a path allocated to any one time slot rearranged by the slot rearrangement unit to a path formed by combining a link included in a path allocated to a time slot different from the time slot. A transmission unit transmits information of the path obtained by conversion performed by the path rearrangement unit.
摘要翻译：分配单元分配通过将节点之间的链路组合到多个时隙中的任一个而形成的路径。时隙重排单元重新排列多个时隙，使得由分配单元分配路径的时隙被连续地排列。路径重排单元将分配给由时隙重新排列单元重新排列的任意一个时隙的路径转换为通过组合包含在分配给与时隙不同的时隙的路径中的链路而形成的路径。发送单元发送由路径重排单元执行的转换获得的路径的信息。

4. 发明申请

US20110103398A1 TIME SLOT ALLOCATION METHOD AND APPARATUS 有权
标题翻译：时间分配方法和装置
公开(公告)号：US20110103398A1
公开(公告)日：2011-05-05
申请号：US12917607
申请日：2010-11-02
申请人： Hideki MITSUNOBU , Toshihiko Kurita
发明人： Hideki MITSUNOBU , Toshihiko Kurita
IPC分类号： H04L12/43
CPC分类号： H04L45/00 , H04J3/16 , H04J3/247
摘要： This method includes: judging, for each certain combination of the source and destination nodes, for which the number of time slots to be allocated is equal to or greater than 1, whether or not certain time slots exist that are capable of forming a route from the source node to the destination node by unused links; for each certain combination judged, at the judging, that the certain time slots exist that are capable of forming the route by the unused links, identifying, for each certain time slot, a shortest route among routes formed by the unused links, calculating an evaluation value from the number of hops in the shorted route, an allocated priority associated with a corresponding certain combination and the number of used links in the corresponding certain time slot; and identifying a maximum evaluation value among the evaluation values.
摘要翻译：该方法包括：对于要分配的时隙数等于或大于1的源节点和目的节点的每个特定组合，判断是否存在能够形成从源节点通过未使用的链路到达目的节点; 对于每个确定的组合，在判断中判定存在能够由未使用链路形成路由的某些时隙，在每个特定时隙中识别由未使用链路形成的路由中的最短路由，计算评估短路路由中的跳数，与对应的特定组合相关联的分配优先级和对应的特定时隙中所使用链路的数量的值; 以及在所述评估值中识别最大评估值。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式