오버레이 네트워크에서의 콘텐츠 송수신 방법
    1.
    发明公开
    오버레이 네트워크에서의 콘텐츠 송수신 방법 无效
    内容传输方法和覆盖网络接收方法

    公开(公告)号:KR1020130142229A

    公开(公告)日:2013-12-30

    申请号:KR1020120064504

    申请日:2012-06-15

    CPC classification number: H04L45/12 H04L45/32 H04L45/48 H04L45/64 H04L67/1074

    Abstract: According to an embodiment of the present invention, a method for receiving contents in a node of an overlay network is provided. A method for receiving contents receives contents from a node which transmitted a response for a contents inquiry message by flooding the contents inquiry message to an overlay network according to the minimum spanning tree when the node which received contents identification information from a user equipment does not have the contents. [Reference numerals] (201) Smart node 1;(202) Smart node n_1;(203) Smart node n_2;(AA) User equipment;(BB,EE,GG) Yes;(CC,DD,FF) No;(S200) Contents identification information;(S201,S205) Possessing the current contents?;(S202,S209) Serving smart node;(S203,S211) Providing contents;(S204) Flooding the contents inquiry message;(S206) Ignoring the contents inquiry message;(S207) Contents response message;(S208) Requesting contents transmission;(S210) Transmitting the contents

    Abstract translation: 根据本发明的实施例,提供了一种用于在覆盖网络的节点中接收内容的方法。 一种接收内容的方法,当从接收到来自用户设备的内容识别信息的节点不具有根据最小生成树的情况下,通过将内容查询消息溢出到覆盖网络,从发送内容查询消息的响应的节点接收内容 内容。 (201)智能节点1;(202)智能节点n_1;(203)智能节点n_2;(AA)用户设备;(BB,EE,GG)是;(CC,DD,FF)否; S200)内容识别信息;(S201,S205)具有当前内容α;(S202,S209)服务智能节点;(S203,S211)提供内容;(S204)洪泛内容查询消息;(S206)忽略内容查询 消息;(S207)内容响应消息;(S208)请求内容传输;(S210)发送内容

    서비스 지향적인 오버레이 멀티캐스트 트리 구성 방법
    3.
    发明公开
    서비스 지향적인 오버레이 멀티캐스트 트리 구성 방법 无效
    用于维修的覆盖多边形树的组合方法

    公开(公告)号:KR1020110024233A

    公开(公告)日:2011-03-09

    申请号:KR1020090082141

    申请日:2009-09-01

    CPC classification number: H04L45/64 H04L12/185 H04L12/44

    Abstract: PURPOSE: A composition method for service-oriented overlay multicast tree is provided to reduce overhead which is needed to calculating delays between existing node and the new node. CONSTITUTION: A joining request message is received from a new node in order to join a multicast group(S310). An available joining time point for the joining request is checked(S320). If there is an available joining time point, whether the node is leaf node or not is determined(S330). If the node is a leaf node, a joining response message is transmitted to the new node(S340). The new node receiving the joining response message requests a connection(S350).

    Abstract translation: 目的:提供面向服务的覆盖组播树的组合方法,以减少计算现有节点与新节点之间的延迟所需的开销。 构成:从新节点接收加入请求消息以加入组播组(S310)。 检查加入请求的可用加入时间点(S320)。 如果存在可用的加入时间点,则确定节点是否为叶节点(S330)。 如果节点是叶节点,则向新节点发送加入响应消息(S340)。 接收到加入响应消息的新节点请求连接(S350)。

Patent Agency Ranking