Carrying TCP over an ICN network
    1.
    发明授权

    公开(公告)号:US10158570B2

    公开(公告)日:2018-12-18

    申请号:US15263639

    申请日:2016-09-13

    摘要: Aspects of the disclosure are directed to systems, network nodes, and methods performed in a network node. A network node can host a TCP/ICN proxy for routing TCP packets through an ICN network. The network node can serve as a forward proxy or a reverse proxy. As a forward proxy, the network node can receive a first packet at the network node, the first packet compliant with a Transmission Control Protocol (TCP) protocol; encapsulate one or more TCP headers from the first packet into a payload field of a second packet, the second packet compliant with an Information Centric Networking (ICN) protocol; and transmit the second packet to a destination through an ICN network. As a reverse proxy, the network node can receive an ICN packet from an ICN network, decapsulate the ICN packet to its TCP components, and transmit the TCP packet through a TCP network.

    Flow classification for information centric network protocols

    公开(公告)号:US10432509B2

    公开(公告)日:2019-10-01

    申请号:US15182379

    申请日:2016-06-14

    摘要: Embodiments include technologies for identifying an equivalence class identifier in a packet received by a node configured to perform information centric networking (ICN) in an ICN network, where the packet includes a name identifying content associated with a producer node in the ICN network. Embodiments also include determining an equivalence class for the packet by determining a name prefix of the name based, at least in part, on the equivalence class identifier. Embodiments further include taking an action affecting a particular packet, the action based, at least in part, on the equivalence class. In specific embodiments, the name includes a plurality of name components, and the equivalence class identifier is a count indicating a number of name components in the name to be grouped together to determine the name prefix. In further embodiments, the number is greater than a particular number of name components in a routable name prefix.

    CARRYING TCP OVER AN ICN NETWORK
    3.
    发明申请

    公开(公告)号:US20170373975A1

    公开(公告)日:2017-12-28

    申请号:US15263639

    申请日:2016-09-13

    摘要: Aspects of the disclosure are directed to systems, network nodes, and methods performed in a network node. A network node can host a TCP/ICN proxy for routing TCP packets through an ICN network. The network node can serve as a forward proxy or a reverse proxy. As a forward proxy, the network node can receive a first packet at the network node, the first packet compliant with a Transmission Control Protocol (TCP) protocol; encapsulate one or more TCP headers from the first packet into a payload field of a second packet, the second packet compliant with an Information Centric Networking (ICN) protocol; and transmit the second packet to a destination through an ICN network. As a reverse proxy, the network node can receive an ICN packet from an ICN network, decapsulate the ICN packet to its TCP components, and transmit the TCP packet through a TCP network.

    Interest message path steering and multi-path traceroute in information-centric networking

    公开(公告)号:US10291512B2

    公开(公告)日:2019-05-14

    申请号:US15479144

    申请日:2017-04-04

    摘要: In one embodiment, path routing in a node fabric of an information-centric network (ICN) includes transmitting a request from a source application to an upstream node via node faces of nodes in the node fabric along a path encoded in a Path Steering Value (PSV); and receiving at the source application from the upstream node a reply that travels along a return path encoded in the PSV. The PSV is generated by pairwise encoding pairs of node faces successively traversed by the reply and is represented by a deterministically decodable pairing function. Node face identifiers can be deterministically, i.e., uniquely, decoded from the PSV. The deterministically decodable pairing function is selected from a Cantor function, a Hopcroft and Ullman variant of the Cantor function, Hilbert curve algorithm, Morton code, and a bitwise pairing function.

    INTEREST MESSAGE PATH STEERING AND MULTI-PATH TRACEROUTE IN INFORMATION-CENTRIC NETWORKING

    公开(公告)号:US20180077052A1

    公开(公告)日:2018-03-15

    申请号:US15479144

    申请日:2017-04-04

    摘要: In one embodiment, path routing in a node fabric of an information-centric network (ICN) includes transmitting a request from a source application to an upstream node via node faces of nodes in the node fabric along a path encoded in a Path Steering Value (PSV); and receiving at the source application from the upstream node a reply that travels along a return path encoded in the PSV. The PSV is generated by pairwise encoding pairs of node faces successively traversed by the reply and is represented by a deterministically decodable pairing function. Node face identifiers can be deterministically, i.e., uniquely, decoded from the PSV. The deterministically decodable pairing function is selected from a Cantor function, a Hoperoft and Ullman variant of the Cantor function, Hilbert curve algorithm, Morton code, and a bitwise pairing function.

    FLOW CLASSIFICATION FOR INFORMATION CENTRIC NETWORK PROTOCOLS

    公开(公告)号:US20170359254A1

    公开(公告)日:2017-12-14

    申请号:US15182379

    申请日:2016-06-14

    摘要: Embodiments include technologies for identifying an equivalence class identifier in a packet received by a node configured to perform information centric networking (ICN) in an ICN network, where the packet includes a name identifying content associated with a producer node in the ICN network. Embodiments also include determining an equivalence class for the packet by determining a name prefix of the name based, at least in part, on the equivalence class identifier. Embodiments further include taking an action affecting a particular packet, the action based, at least in part, on the equivalence class. In specific embodiments, the name includes a plurality of name components, and the equivalence class identifier is a count indicating a number of name components in the name to be grouped together to determine the name prefix. In further embodiments, the number is greater than a particular number of name components in a routable name prefix.