会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 9. 发明申请
    • LINE CONTROL METHOD IN OPTICAL NETWORK AND OPTICAL NETWORK ITSELF
    • 光网络和光网络线路控制方法
    • US20110123193A1
    • 2011-05-26
    • US13054876
    • 2009-07-03
    • Naoaki YamanakaYutaka ArakawaKazumasa Tokuhashi
    • Naoaki YamanakaYutaka ArakawaKazumasa Tokuhashi
    • H04J14/00
    • H04Q11/0067H04L12/2869H04Q2011/0041H04Q2011/0064H04Q2011/0079H04Q2011/0088
    • In an access network using optical switches, communications between an OLT and ONUs are established without a photoelectric conversion performed at an optical switching unit.The OLT controls the downlink optical switch SW(DOWN) to sequentially select each ONU in slots arranged in a discrete manner, and transmits a Discovery Gate message. Upon receipt of the Discovery Gate message, each ONU consecutively transmits Register Request messages. The uplink optical switch SW(UP) sequentially switch signals from ONU#1 through ONU#128 in the slots arranged in a discrete manner, and outputs the signals to the OLT, Some of the Register Requests transmitted from the respective ONUs pass through the SW(UP), and reach the OLT. Based on the received Register Requests, the OLT determines the timing of transmission for the ONUS, and notifies the ONUS of the timing of transmission through a Gate message.
    • 在使用光交换机的接入网络中,OLT和ONU之间的通信建立,而不在光开关单元处执行光电转换。 OLT控制下行光纤交换机SW(DOWN),以离散方式排列的时隙顺序选择每个ONU,并发送发现门信息。 在接收到发现门消息时,每个ONU连续发送注册请求消息。 上行链路光开关SW(UP)以离散方式顺序地切换来自ONU#1至ONU#128的信号,并将该信号输出到OLT,从各个ONU发送的一些寄存器请求通过SW (UP),并到达OLT。 根据收到的注册请求,OLT确定ONUS的传输时序,并通过Gate消息向ONUS通知传输的定时。
    • 10. 发明申请
    • System and method for finding shortest paths between nodes included in a network
    • 用于查找网络中包含的节点之间的最短路径的系统和方法
    • US20070263544A1
    • 2007-11-15
    • US11603995
    • 2006-11-21
    • Naoaki YamanakaHiroyuki IshikawaYutaka ArakawaSho ShimizuKosuke Shiba
    • Naoaki YamanakaHiroyuki IshikawaYutaka ArakawaSho ShimizuKosuke Shiba
    • G08C15/00
    • H04L45/12
    • There is provided a system that uses a network matrix to carry out a search for shortest paths from a starting node included in a network having a plurality of nodes to other nodes. The network matrix includes link costs of links and each link has a root end that is a node included in the network and a tail end that is another node connected to the root end. The system includes a processor that includes a circuit for subtracting a lowest value from link costs of the subject links being searched that are included in the network matrix, a circuit for setting tail end node of a link out of the subject links whose link cost has become zero due to the subtracting as a reached node, a circuit for changing link costs of links included in the network matrix whose tail end nodes are the reached node to a value indicating exclusion from further search, and a circuit for setting values after the subtracting of link costs of the subject links whose link costs do not become zero due to the subtracting as link costs of links for a continued search.
    • 提供了一种使用网络矩阵来执行从包括在具有多个节点的网络中的起始节点到其他节点的最短路径的搜索的系统。 网络矩阵包括链路的链路成本,并且每个链路具有作为网络中包括的节点的根端和作为连接到根端的另一节点的尾端。 该系统包括处理器,该处理器包括用于从包括在网络矩阵中的被搜索对象链路的链路成本中减去最低值的电路,用于将链路的尾端节点从链路成本具有的主题链路设置的电路 由于减去作为到达节点而变为零,用于将包括在其尾端节点到达节点的网络矩阵中的链路的链路成本改变为指示排除进一步搜索的值的电路以及用于在减去之后设置值的电路 由于作为连续搜索的链接的链接成本减去,链接成本不变为零的主题链接的链接成本。