EP3151517B1 - System und verfahren für zustandslose informationszentrische vernetzung - Google Patents

System und verfahren für zustandslose informationszentrische vernetzung Download PDF

Info

Publication number
EP3151517B1
EP3151517B1 EP16189546.1A EP16189546A EP3151517B1 EP 3151517 B1 EP3151517 B1 EP 3151517B1 EP 16189546 A EP16189546 A EP 16189546A EP 3151517 B1 EP3151517 B1 EP 3151517B1
Authority
EP
European Patent Office
Prior art keywords
router
interest
local
identifier
response
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
EP16189546.1A
Other languages
English (en)
French (fr)
Other versions
EP3151517A1 (de
Inventor
Jose J. Garcia-Luna-Aceves
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Cisco Technology Inc
Original Assignee
Cisco Technology Inc
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Cisco Technology Inc filed Critical Cisco Technology Inc
Publication of EP3151517A1 publication Critical patent/EP3151517A1/de
Application granted granted Critical
Publication of EP3151517B1 publication Critical patent/EP3151517B1/de
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/54—Organization of routing tables
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/50—Network services
    • H04L67/60—Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources
    • H04L67/63—Routing a service request depending on the request content or context
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/74—Address processing for routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/17—Interaction among intermediate nodes, e.g. hop by hop
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/18—Loop-free operations

Definitions

  • the present disclosure relates generally to information-centric networks (ICNs). More specifically, the present disclosure relates to an ICN architecture that does not maintain per-Interest forwarding states.
  • IP Internet Protocol
  • Ethernet media access control
  • ICN information-centric network
  • CCN Content-Centric Networking
  • a consumer and a provider can be a person at a computer or an automated process inside or outside the CCN.
  • a piece of content can refer to the entire content or a respective portion of the content. For example, a newspaper article might be represented by multiple pieces of content embodied as data packets.
  • a piece of content can also be associated with metadata describing or augmenting the piece of content with information such as authentication data, creation date, content owner, etc.
  • PIT Pending Interest Table
  • NDOs named data objects
  • the PIT allows NDOs that satisfy Interests to follow the reverse path back to the original requester while hiding the identity of the original requester.
  • the size of the PIT can be many orders of magnitude larger than the size of traditional routing tables because routers handle far more Interests than the number of routers in a network.
  • US-A1-2015/0032892 describes interest forwarding for interactive client anonymity in which an intermediate node receives a client interest with an indication of a client-requested reverse private path, which is a label-switched path toward a corresponding client with encrypted client information. In response to receiving the client interest, the intermediate node allocates a label for the reverse private path. The allocated label is mapped to a node from which the client interest is received. The intermediate node then forwards the client interest with the allocated label towards a server.
  • the router includes a receiving module configured to receive an interest for a piece of content.
  • the interest indicates a name associated with the piece of content.
  • the router also includes an interest-processing module configured to: determine whether the interest can be forwarded; in response to determining that the interest can be forwarded to a second router, select an identifier from a set of identifiers assigned to the router by the second router; and process the interest by inserting the identifier into the interest.
  • the router further includes a forwarding module configured to forward the processed interest to the second router.
  • the forwarding module is further configured to send a response to the interest in response to the interest-processing module determining that the interest cannot be forwarded.
  • the interest-processing module is configured to determine that the interest cannot be forwarded based on one of: the piece of content cannot be found, no route can be found to a destination router advertising the piece of content, and the interest is traversing a loop.
  • the response sent by the forwarding module includes a negative acknowledgment.
  • the interest-processing module is configured to: in response to determining that the interest is received from a local user of the router, determine, based on a local interest table, whether a previous interest for the same piece of content exists. If so, the interest-processing module aggregates the received interest by adding the local user to the local interest table. If not, the interest-processing module creates a new entry in the local interest table for the piece of content.
  • the received interest carries a previous identifier.
  • the interest-process module is configured to: perform a lookup in a local routing table based on the previous identifier; use the matching entry as the selected identifier in response to a matching entry being found; and in response to no matching entry being found, apply a bijection function to the previous identifier to obtain the selected identifier and generate an entry in the local routing table.
  • the generated entry specifies the selected identifier and a third router from which the router receives the interest.
  • the interest-processing module further generates the processed interest by replacing the previous identifier carried in the received interest with the selected identifier.
  • the set of identifiers comprises a set of continuously incrementing or decrementing numeric values.
  • the router further comprises a response-receiving module configured to receive a response to the interest, a response-processing module configured to process the received response, and a response-forwarding module configured to forward the processed response.
  • the response-processing module is configured to: identify a matching entry in a local routing table based on a response identifier carried by the response, with the matching entry specifying a third router that forwards the interest to the router; map the response identifier to a response-forwarding identifier using a function specific to the third router; and generate the processed response by replacing the response identifier with the response-forwarding identifier.
  • Embodiments of the present invention provide a novel CCN system, CCN-Gathering of Routes for Anonymous Messengers (CCN-GRAM).
  • CCN-GRAM CCN-Gathering of Routes for Anonymous Messengers
  • Routers implementing CCN-GRAM no longer need to maintain a Pending Interest Table (PIT).
  • PIT Pending Interest Table
  • CCN-GRAM operates with a stateless forwarding plane by forwarding Interests and responses to them as anonymous datagrams using destination-based forwarding tables.
  • Each router assigns intervals to its neighbors and receives interval assignments from its neighbors, with each interval being a set of continuous identifiers.
  • When a router forwards an Interst it selects an idnetifier from the interval assigned by the receiver of the Interest to label the Interest. This label is changed on a hop-by-hop basis.
  • CCN-GRAM also uses a distance-based forwarding strategy to prevent Interest looping.
  • CCN uses two types of messages: Interests and Content Objects.
  • An Interest carries the hierarchically structured variable-length identifier (HSVLI), also called the "name," of a Content Object and serves as a request for that object.
  • HSVLI hierarchically structured variable-length identifier
  • a network element e.g., router
  • receives multiple Interests for the same name it may aggregate those Interests.
  • a network element along the path of the Interest with a matching Content Object may cache and return that object, satisfying the Interest.
  • the Content Object follows the reverse path of the Interest to the origin(s) of the Interest.
  • an HSVLI indicates a piece of content, is hierarchically structured, and includes contiguous components ordered from a most general level to a most specific level. The length of a respective HSVLI is not fixed.
  • a packet may be identified by an HSVLI. For example, "abcd/bob/papers/ccn/news" could be the name of the content and identifies the corresponding packet(s), i.e., the "news" article from the "ccn” collection of papers for a user named "Bob" at the organization named "ABCD.”
  • a node expresses (e.g., broadcasts) an Interest in that content by the content's name.
  • An Interest in a piece of content can be a query for the content according to the content's name or identifier.
  • the content if available in the network, is sent back from any node that stores the content to the requesting node.
  • the routing infrastructure intelligently propagates the Interest to the prospective nodes that are likely to have the information and then carries available content back along the reverse path traversed by the Interest message.
  • the Content Object follows the breadcrumbs left by the Interest message, thus reaching the requesting node.
  • FIG. 1 illustrates an exemplary architecture of a network, in accordance with an embodiment of the present invention.
  • a network 180 comprises nodes 100-145. Each node in the network is coupled to one or more other nodes.
  • Network connection 185 is an example of such a connection.
  • the network connection is shown as a solid line, but each line could also represent sub-networks or super-networks, which can couple one node to another node.
  • Network 180 can be content-centric, a local network, a super-network, or a sub-network. Each of these networks can be interconnected so that a node in one network can reach a node in other networks.
  • the network connection can be broadband, wireless, telephonic, satellite, or any type of network connection.
  • a node can be a computer system, an end-point representing users, and/or a device that can generate Interest or originate content.
  • a consumer can generate an Interest for a piece of content and forward that Interest to a node in network 180.
  • the piece of content can be stored at a node in network 180 by a publisher or content provider, who can be located inside or outside the network.
  • the Interest in a piece of content originates at node 105. If the content is not available at the node, the Interest flows to one or more nodes coupled to the first node. For example, in FIG.1 , the Interest flows (Interest flow 150) to node 115, which does not have the content available. Next, the Interest flows (Interest flow 155) from node 115 to node 125, which again does not have the content.
  • the Interest then flows (Interest flow 160) to node 130, which does have the content available.
  • the flow of the Content Object then retraces its path in reverse (content flows 165, 170, and 175) until it reaches node 105, where the content is delivered.
  • Other processes such as authentication can be involved in the flow of content.
  • any number of intermediate nodes (nodes 100-145) in the path between a content holder (node 130) and the Interest generation node (node 105) can participate in caching local copies of the content as it travels across the network. Caching reduces the network load for a second subscriber located in proximity to other subscribers by implicitly sharing access to the locally cached content.
  • each node also called as a router
  • FIB Forwarding Information Base
  • CS Content Store
  • PIT Pending Interest Table
  • FIB is used to forward Interest packets toward potential source(s) of matching Content Objects.
  • a routing protocol is used to populate the FIB among all nodes in the network.
  • the FIB entries are often indexed by the name prefixes, with each entry including a physical address of at least one face to which the matching Interest should be forwarded. While forwarding Interest messages, longest-prefix-match lookups of names are performed at the FIB to find a matching entry.
  • CS Content Store
  • IP router receives an Interest packet, it first checks whether there is a matching Content Object in its content store prior to issuing an Interest upstream.
  • PIT Pending Interest Table
  • the PIT keeps track of Interests forwarded upstream toward content source(s) so that a returned Content Object can be sent downstream following the reverse Interest path to its requester(s). This preserves upstream and downstream network flow.
  • CCN only Interest packets are routed. The returning Content Object follows the trail of the Interest packet back to the content requester.
  • a PIT entry for an Interest specifies the name or name prefix of the Interest and one or multiple incoming faces that requested that Interest.
  • a longest-match lookup is done based on the content name, or the HSVLI.
  • the index structure used for the name lookup is ordered in such a way that a CS match will be preferred over a PIT match, which will be preferred over an FIB match.
  • the Content Object will be sent out via the face the Interest arrived on and the Interest will be discarded. Otherwise, the PIT will be checked to see if a match can be found. If so, the Interest's arrival face will be added to the PIT entry's requesting face list and the Interest will be discarded. Otherwise, the FIB will be checked and the Interest is forwarded along the one or more faces listed in the matching FIB entry.
  • ICNs e.g., CCN or NDN
  • a stateful forwarding plane meaning that routers maintain the forwarding state for each Interest.
  • this does not solve all the problems of a stateless forwarding plane, which does not maintain the forwarding state for each Interest traversing a router.
  • Interest aggregation may cause Interests to traverse forwarding loops.
  • the looping Interests may never receive responses, because they are unable to reach a router with a local content producer or cached content. As a result, these Interests will need to stay in the PIT until they time out.
  • IP Internet Protocol
  • Ethernet protocol uses datagram forwarding, which constitutes a "stateless" forwarding plane approach.
  • datagram forwarding e.g., Internet Protocol (IP) and Ethernet protocol.
  • IP Internet Protocol
  • IP datagram forwarding incurs far less storage overhead in the forwarding plane and is not subject to attacks aimed at overflowing forwarding tables.
  • the sources are denoted with globally unique identifiers carried by the datagrams. Simple adoption of IP datagrams in NDN or CCN can be vulnerable to attacks mounted by creating fictitious sources. Content requests and responses to them can traverse diverse paths, and there is no coordination among these paths, which makes forwarding more complex than necessary.
  • CCN-Gathering of Routes for Anonymous Messengers (CCN-GRAM)
  • CCN-GRAM operates with a stateless forwarding plane by forwarding Interests and responses to them as anonymous datagrams using destination-based forwarding tables.
  • a proactive routing approach is used by routers to establish and maintain routes to known name prefixes.
  • a novel on-demand routing approach is also used to maintain anonymous routes to the routers originating Interests for specific content on behalf of content consumers. To hide the identiteis of the content consumers, only the local router serving a user knows the identity of the user; no other router, content provider, or caching site can identify the router originating an Interest on behalf of the user.
  • CCN-GRAM uses Interests, Data packets, and certain control messages (such as negative acknowledgments (NACKs)), to implement the exchange of content among nodes.
  • the messages sent in CCN-GRAM specify a source and a destination.
  • the destination can be the name of a content object (e.g., NDO), and the source can be an anonymous identifier.
  • the source can be the name of an NDO, and the destination can be an anonymous identifier.
  • An Interest sent by a node k requesting a Content Object (CO) n ( j ) is denoted I [ n ( j ), AID I ( k )], which states the name of the requested CO ( n ( j )) and an assigned identifier ( AID I ( k )) that is modified on a hop-by-hop basis to hide the identity of the origin of the Interest.
  • the assigned identifier can be included in a header field of the Interest packet, in a way that is similar to an IP address being part of the header of an IP datagram. But different from the IP datagram, this assigned identifier (AID) does not reveal the identity (or address) of the router originating the Interest.
  • a Data packet sent by router i in response to an Interest is denoted as DP[n(j), sp(j), AID R ( i )], which states the name ( n ( j )) of the CO being sent, a signature payload ( sp ( j )) used to optionally validate the CO, and an assigned identifier ( AID R ( i )) that denotes the intended recipient of the Data packet, without revealing its true identity.
  • the control message (NACK) sent by router i in response to an Interest is denoted as NA [ n ( j ), CODE, AID R ( i )], where CODE states the reason for sending the NACK. Possible reasons for sending a NACK include: (a) an Interest loop is detected, (b) no route is found toward the requested content, and (c) no content is found.
  • a GRAM router To implement the forwarding of Interests, COs and NACKs, a GRAM router maintains a forwarding information base, an optional Local Interests Gathered Table (LIGHT), an Anonymous Routing Table (ART), and a Local Interval Set Table (LIST).
  • LIGHT Local Interests Gathered Table
  • ART Anonymous Routing Table
  • LIST Local Interval Set Table
  • FIG. 2 presents a diagram illustrating an exemplary Forwarding Information Base (FIB), in accordance with an embodiment of the present invention.
  • the FIB of each router states the distance to each known name prefix attained by each neighbor router.
  • FIB 200 includes a number of entries indexed using content name prefixes. Each entry states the next hop to the content identified by the name prefix and a hop count to the node advertising the name prefix.
  • the FIB is denoted as FIB i
  • each FIB entry for a name prefix n ( j )* is denoted as FI B n j ⁇ i , such as FIB entry 202.
  • each FIB entry may include a list of distances, one for each next hop neighbor.
  • the set of next hops to n ( j )* listed in the FI B n j ⁇ i is denoted as S n j ⁇ i .
  • the distance (e.g., hop count) to a name prefix n ( j )* through neighbor q is denoted as D ( i , n ( j )*, q ).
  • Each entry in FIB i is stored for a maximum time determined by the lifetime of the corresponding entry in the routing table of the router.
  • a FIB entry for a particular next hop can also include the ranking of the next hop among all neighbors.
  • FIG. 3 presents a diagram illustrating an exemplary Local Interests Gathered Table (LIGHT), in accordance with an embodiment of the present invention.
  • the LIGHT of a router is an index of content locally available, as well as content that is remote and has been requested by local users. More specifically, the LIGHT stored at router i ( LIGHT i ) lists the names of the COs requested by router i or already stored at router i.
  • LIGHT 300 includes a number of entries indexed by the CO names. Each entry, such as entry 302, states the name of a CO, a pointer to the CO, and a list of local consumers that have requested the CO while the content is remote.
  • entry 302 states the name of the CO ( n ( j )), a pointer to n ( j ) ( p [ n ( j )]), and a list of identifiers ( lc [ n ( j )]) that identify the local consumers. If there is no local consumer for a CO, the list of identifiers will be empty. Note that only routers that have local caches and local content consumers are required to maintain LIGHTs; relay routers, on the other hand, do not need to maintain LIGHTs.
  • FIG. 4 presents a diagram illustrating an exemplary Anonymous Routing Table (ART), in accordance with an embodiment of the present invention.
  • the ART is maintained on-demand using Interests and states the paths to destinations denoted with local identifiers. Because those identifiers are local, routers cannot discern the origin of Interests using such identifiers.
  • ART 400 at router i includes a number of entries, such as entries 402 and 404, indexed using assigned identifiers. Each entry states an assigned identifier, a previous hop, and possibly a name prefix (for locally generated Interests).
  • ART i ( ⁇ , p , n ) is used to denote the entry for assigned identifier ⁇ , previous hop p , and name prefix n .
  • entry 402 is an entry created for an assigned identifier ⁇ 1 as a result of router i being the origin of Interests for COs with names that are best matched by name prefix n ( j )*. Entry 402 can state the assigned identifier ( ⁇ 1 ), the previous hop (router i), and the matching prefix (n ( j )*).
  • entry 404 is an entry created for an assigned identifier ⁇ k as a result of router i forwarding Interests received from another router.
  • Entry 404 can state the assigned identifier ⁇ k and the previous hop ( p i ( ⁇ k )) of the Interests, to which router i assigns identifier ⁇ k .
  • the name prefix in entry 404 is set as empty.
  • Each entry in ART i is stored for a maximum lifetime of a few seconds.
  • FIG. 5 presents a diagram illustrating an exemplary Local Interval Set Table (LIST), in accordance with an embodiment of the present invention.
  • LIST maintained at a router states the intervals of local identifiers that the router assigns to its neighbors and that each neighbor assigns to the router.
  • each local interval is a chunk of continuously incrementing or decrementing numerical identifiers.
  • a local interval assigned by one router to one of its neighbors can be a set of identifiers that starts from 1 and ends at 50.
  • LIST 500 includes a number of entries, such as entry 502, indexed using faces of a router.
  • Each entry states the interval of local identifiers (local interval) assigned to the current router by a neighbor (face), as well as the local interval assigned to the neighbor by the current router.
  • LIST i denotes the LIST maintained at router i
  • LI i (k,i ) denotes the local interval assigned to router i by neighbor k
  • LI i ( i , k ) denotes the local interval assigned to router k by neighbor i.
  • CCN-GRAM implements a distance-based loop-free forwarding rule (LFR) to ensure that Interests cannot traverse routing loops, even if the routing data stored in FIBs regarding name prefixes is inconsistent and includes routing-table loops. More specifically, a router accepts an Interest from a neighbor only if the router determines that it is closer to the prefix through at least one interface than the neighbor is when the neighbor forwards the Interest.
  • LFR distance-based loop-free forwarding rule
  • LFR loop-free forwarding rule
  • FIGs. 6A-6B illustrates how CCN-GRAM detects Interest loops, according to an embodiment of the present invention.
  • network 600 includes a number of nodes 602-614. Multiple paths exist between nodes 602 and 614, and the routing table may include a loop: node 604-node 606-node 608-node 604.
  • a pair of numbers is listed, indicating a hop count (the first number) through the neighbor to n(j) (node 614) and the ranking of the neighbor according to the FIB (the second number).
  • each pair is stored at the FIB in the router that is closer to the pair.
  • two number pairs, pair (4, 1) and pair (5, 2) are shown next to the link.
  • Number pair (4, 1) is adjacent to router 604 and is stored in the FIB of router 604
  • number pair (5, 2) is adjacent to router 606 and is stored in the FIB of router 606.
  • the number pair (4, 1) adjacent to router 604 indicates that the hop count to n ( j ) via its neighbor 606 is 4, and neighbor 606 ranks number 1 in the FIB of router 604.
  • the number pair (5, 2) adjacent to router 606 indicates that the hop count from its neighbor 604 to n(j) is 5, and neighbor 604 ranks number 2 in the FIB of router 606.
  • a tuple ( v , h , r ) can be used to indicate a neighbor, its hop count to content, and its ranking. Note that such a tuple can be entries listed in the FIB under name prefix n ( j )*.
  • FIB node 604 can list tuples (node 606, 4, 1), (node 610, 4, 2), and (node 608, 6, 3).
  • FIB node 602 can list a tuple (node 604, 5,1); FIB node 606 can list tuples (node 608,6,1), (node 604, 5, 2), and (node 612,3,3); and FIB node 601 can list tuples (node 606, 5, 1) and (node 604, 5, 2). Note that partial FIB entries for nodes 610 and 612 are also shown in FIG. 6A .
  • FIG. 6B illustrates how CCN-GRAM routers forward Interests.
  • router 604 received an Interest I [ n ( j ), AID I ] for name n(j) from router 602 at time t 1 .
  • Router 606 then uses router 612 as the next hop for the Interest because router 612 is the highest-ranked neighbor that satisfies the LFR.
  • the route traversed by the Interest is indicated by a dashed line following time sequence t 1 ⁇ t 2 ⁇ t 3 .
  • the Interest generated by router 608 is forwarded to router 612 toward n ( j ) (the route is indicated by a different dashed line following time sequence t 3 ⁇ t 4 ⁇ t 5 ) without traversing a loop, because each relaying router must satisfy the LFR.
  • FIGs. 7A-7C illustrate how CCN-GRAM operates with single-path routing and a temporary routing-table loop, according to an embodiment of the present invention.
  • network 700 includes a number of nodes 702-714.
  • each router has a single next hop and one hop count for each prefix listed in its FIB.
  • n(j) * advertised by router 714 router 704 lists a hop count of 4 via neighbor router 710 (before the link (node 704, node 710) fails), and router 706 lists a hop count of 6 via neighbor router 708.
  • the distance from a router to name prefix n ( j )* may not be directly proportional to the hop counts of the paths.
  • link (node 706, node 712) may have limited bandwidth or long delays; hence, node 706 may prefer the path through node 708 to reach n ( j )* at node 714.
  • router 706 updates its FIB to reflect the link failure at time t 0 , as shown in FIG. 7A .
  • Router 704 now lists a hop count of 4 via neighbor router 706. Note that such a link failure results in routers in network 700 having inconsistent FIB states for n(j) while Interests are being forwarded. For example, router 706 has not yet updated its FIB, which can lead to a temporary routing table loop.
  • router 702 sends an Interest I [ n ( j ), AID I ] to router 704.
  • FIG. 7B shows that router 704 forwards the Interest to router 706 at time t 2 .
  • the NACK will indicate the reason for the NACK as loop detected.
  • the NACK will eventually be forwarded to the originator of the Interest, router 702, at time t 4 , as shown in FIG. 7C .
  • FIG. 7B also shows that, at time t 3 , router 708 sends an Interest for name n ( j ) to router 704. Such an Interest also prompts a NACK from router 706 at time t 5 due to LFR violation, as shown in FIG. 7C.
  • FIG. 7C also illustrates that router 704 forwards the NACK from router 706 to router 708 at time t 6 .
  • FIB node 704 , FIB node 706 , and FIB node 708 are updated to reflect the new topology state.
  • the FIB for node 706 may no longer list node 708 as its next hop, and Interests from node 702 regarding n ( j )* can be forwarded along the chain of nodes 704, 706, and 712 toward n ( j )*, i.e., node 714. Similarly, within a finite time, Interests from node 708 regarding n ( j )* can be forwarded to nodes 706 and 712 toward n ( j )*.
  • routers need identifiers that can unambiguously denote the intended destinations.
  • the destinations In contrast to IP datagram forwarding, however, in CNN, the destinations must be anonymous such that no forwarding router, caching site, or content producer can identify the router that originated the Interest prompting a Data packet or NACK.
  • the identifiers used in Interests could be nonces assigned randomly by an originating router of the Interests, and the name space for such nonces can be large enough to ensure a small probability of collision (i.e., more than one router using the same nonce).
  • a sender-initiated approach for assigning identifiers has several drawbacks. First, it may allow a team of routers to find out the identities of some origins of Interests. Second, it can be subject to attacks based on the creation of fake identifiers. Third, the length of the identifiers needs to be large enough to reduce collisions.
  • CCN-GRAM adopts a novel receiver-initiated approach by assigning local identifiers that can be used to forward Data packets and NACKs. This approach takes advantage of the fact that Data packets and NACKs are sent over the reverse paths traversed by the prompting Interests.
  • each router has a large set of local identifiers that it can assign to its neighbors, so that the neighbors can in turn use such identifiers as the assigned identifiers (AIDs) carried in the Interests they forward to the router.
  • a router assigns non-overlapping continuous local intervals of identifiers (local intervals) of equal length to its neighbors, such that a router cannot give the same local identifier to more than one neighbor. In other words, a router can use the local intervals to unambiguously identify its neighbors. Given that all local intervals have the same length (i.e., same number of identifiers are included in each interval), a local interval is uniquely defined by the identifier at the start of the interval. The local intervals assigned to its neighbors as well as the local intervals assigned to the router by its neighbors are stored in the LIST of the router.
  • routers can exchange local intervals with their neighbors in a number of ways. In some embodiments, this exchange can be done in the data plane using Interests and Data packets. For example, a router sends an Interest stating a common name denoting that a neighbor interval is requested, and an empty AID. On the other hand, given the succinct way in which local intervals can be stated (an identifier denotes its interval), the exchange can also be easily done as part of the routing protocol running in the control plane. For example, routers could exchange interval identifiers in HELLO messages, link-state advertisements, or distance updates.
  • router i When router i originates an Interest regarding CO n ( j ) on behalf of a local consumer, it can send an Interest I [ n ( j ), AID I ( i )] to neighbor k toward name prefix n ( j )*.
  • the identifier ( AID I ( i )) carried by this Interest can include an identifier from LI i ( k , i ) that it is assigned by router k and is not currently used for a different destination.
  • router i After selecting AID I ( i ), router i can store the entry [ AID I ( i ), i ] in ART i and adds the prefix name n ( j )* to such an entry.
  • router k when router k forwards the Interest I [ n ( j ), AID I ( i )] received from router i to neighbor y, router k can replace the identifier carried in the Interest ( AID I ( i )) with its own identifier ( AID I ( k )).
  • such an identifier can be selected from the interval LI k ( y , k ) using AID I ( i ) as the key.
  • router k Given that all local intervals are of the same length, router k can use any one-to-one mapping from LI k ( k , i ) to LI k ( y , k ) to determine the value of AID I ( k ).
  • This mapping can be denoted as a function f k ( i,y ): LI k ( k , i ) ⁇ LI k ( y , k ).
  • router k After selecting AID I ( k ), router k can store the entry [ AID I ( k ), i ] in ART k .
  • router k When router k forwards the Data packet DP [ n ( j ), sp ( j ), AID R ( y )] received from neighbor y , it can use AID R ( y ) as a key in its own ART ( ART k ) to determine the next hop x (listed in the ART as the previous hop for the Interest) that the Data packet should be sent to.
  • router i Given the next hop x, router i uses the inverse function f k ⁇ 1 x y to map AID R ( y ) ⁇ LI k ( y , k ) into AID R ( k ) ⁇ LI k ( k , x ), and forwards DP [ n ( j ), sp ( j ), AID R ( k )] to router x.
  • the same approach can be used for forwarding NACKs.
  • an identifier i in local interval LI is denoted by LI(i).
  • LI(i) [ LI A ( start ), LI A ( end )] and LI B [ LI B ( start ), LI B ( end )], where LI ( start ) and LI ( end ) are the starting and ending points of a respective local interval;
  • LI B AID A - LI A ( s )+ LI B ( s ) modulo the length of an interval.
  • the inverse function can be the same.
  • each router uses a new AID when it originates an Interest for a new destination and uses a bijection (i.e., one-to-one correspondence) to map the AID in a received Interest into the AID in the forwarded Interest.
  • the AID in the forwarded Interest must be one of the identifiers within the local interval given to the router by its next hop.
  • FIG. 8 presents a diagram illustrating the mapping of AIDs in Interests, in accordance with an embodiment of the present invention.
  • a router 802 includes a number of neighboring routers, such as routers 804, 806, and 808.
  • the LIST at router 802 includes the intervals assigned to neighboring routers 804, 806, and 808 by router 802, as well as the intervals assigned to router 802 by its neighbors.
  • Each interval includes a chunk of continuous identifiers, as indicated by the hatched rectangles.
  • the solid arrows indicate the assignment direction of the intervals.
  • interval 814 in the path of the arrow represents a set of continuous identifiers assigned to router 804 by router 802, and can be denoted as LI node 802 (node 802, node 804).
  • intervals 816 and 818 represent the sets of continuous identifiers assigned to routers 806 and 808, respectively, by router 802, and can be denoted as LI node 802 (node 802, node 806) and LI node 802 (node802,node808), respectively.
  • FIG. 8 also illustrates intervals 824, 826, and 828, which are intervals assigned to router 802 by its neighbors 804, 806, and 808, respectively.
  • LI node 802 node 804, node 802
  • LI node 802 node 806, node 802
  • LI node 802 node 808, node 802
  • Identifiers in these intervals can be used by the routers to forward Interests.
  • the dashed arrows pointing out of the intervals indicate that the identifiers inserted into the Interests are selected from the corresponding intervals. For example, when router 802 receives an Interest from router 804, the Interest should include an assigned identifier (AID) selected from interval 814 ( LI node 802 (node 802, node 804)).
  • AID assigned identifier
  • router 802 When router 802 forwards the received Interest to router 806, it needs to map the received AID ⁇ LI node 802 (node 802, node 804) to an AID ⁇ LI node 802 (node 806, node 802), and replace the identifier in the received Interest with the mapped identifier.
  • the double arrow in FIG. 8 indicates the mapping between the two AIDs.
  • router 802 uses the received AID as an input to a bijection function to map the AID in the received Interest to the AID in the forwarded Interest. This mapping can be stored in the ART of router 802.
  • router 802 receives a response to the Interest, it can use entries in its ART to determine the inverse function to use on the AID in the received response.
  • router 802 can also reserve an interval 810 for itself, denoted as LI node 802 (node 802, node 802).
  • the identifiers in this interval are used by router 802 for locally generated Interests, i.e., Interests generated by router 802 on behalf of its local consumers.
  • FIG. 9 presents a diagram illustrating the mapping of AIDs in responses to Interests, in accordance with an embodiment of the present invention.
  • AID I node 904
  • router 906 may perform a similar mapping based on its own LIST (if it decides to forward the Interest) or send a response (e.g., a Data packet or a NACK) to the
  • FIG. 10 presents a diagram presenting an exemplary architecture of a CCN-GRAM router, in accordance with an embodiment of the present invention.
  • CCN-GRAM router 1000 includes a number of faces, such as faces 1002, 1004, and 1006; an Interest-processing module 1008; a forwarding module 1010; a response-processing module 1012; a control-message generation module 1014, and a database 1016.
  • Faces 1002-1006 can include not only physical interfaces but also application processes capable of sending and receiving packets, including Interests Data packets, and NACKs.
  • Interest-processing module 1008 is responsible for processing the Interests received on the various faces. In some embodiments, Interest-processing module 1008 determines whether to accept an incoming Interest based on the aforementioned loop-free forwarding rule (LFR). If the Interest is accepted, Interest-processing module 1008 uses the ART maintained in database 1016 to map the AID in the received Interest to a new AID, and swaps the AID included in the Interest based on the mapping.
  • Forwarding module 1010 is responsible for forwarding packets, such as Interests, Data packets, or NACKs, to the faces.
  • forwarding module 1010 forwards the Data packets and NACKs based on the AID mapping.
  • Control-message generation module 1014 generates control messages, which can include different NACK messages, when Interest-processing module 1008 rejects or drops an Interest.
  • control-message generation module 1014 generates NACK messages under various conditions, including but not limited to when: an Interest loop is detected, no route is found toward the requested content, and no content is found.
  • Response-processing module 1012 is responsible for processing Data packets of NACKs received in response to Interests.
  • response-processing module 1012 checks the ART maintained in database 1016 to find an AID mapping, and swaps the AID included in the response based on the mapping.
  • Database 1016 stores the data structures needed for CCN-GRAM operation: the FIB, the optional LIGHT, the ART, and the LIST.
  • routers in CCN-GRAM maintain routes to those sites advertising themselves as the origins of name prefixes and populate their routing tables using a routing protocol operating in the control plane. Routers populate their FIBs with routes to name prefixes based on the data stored in their routing tables. The lifetime of the FIB entries is determined by the operation of the routing protocol.
  • a multipath routing protocol is used to populate FIBs and that a router is able to know a hop-count distance from each neighbor router to each name prefix. This information can be stored in the FIB of a router. It is also assumed that each router is initialized properly, knows the identifiers used to denote local consumers, knows all its neighbors, and knows the local identifier intervals associated with each neighbor.
  • FIG. 11 presents a diagram illustrating an exemplary Interest-processing algorithm, in accordance with an embodiment of the present invention.
  • the Interest is received from a local consumer, and the Interest states the name of the CO and the name of the local consumer.
  • router i receives an Interest from local consumer c, it checks its LIGHT to determine if the requested content is stored locally or a request for the same content is pending. If the content is stored locally, a Data packet is sent back to the user requesting the CO (line 5 in FIG. 11 ). If a request for the same content is pending, the name of the user is added to the list of users that have requested the CO (line 7 in FIG. 11 ).
  • a router advertising itself as the origin of a prefix must have all the COs associated with the prefix stored locally. If router i states that it is the origin of the name prefix n ( j )* and a specific CO with a name that is in that prefix is not found locally, a NACK is sent back stating that the content was not found (line 11 in FIG. 11 ).
  • a NACK is sent back stating that no route to the CO could be found (line 14 in FIG. 11 ). Otherwise, router i creates an entry for CO n(j) in its LIGHT (line 16 in FIG. 11 ) and forwards the Interest through the highest ranked neighbor in its FIB for the name prefix matching n ( j ) (lines 17-20 in FIG. 11 ).
  • Various ranking mechanisms can be used to rank the neighbors, including a distributed or local algorithm. For example, the neighbors may be ranked based on the distance to the destination or the link performance.
  • router i When forwarding the Interest, router i also checks its ART to determine if an ART entry exists for the selected successor to which the Interest is forwarded. If so, the existing identifier in the ART entry is used to replace the identifier in the received Interest; otherwise, a new ART entry is created before the Interest is forwarded. The identifier in the new ART entry has not been used for any other ART entry created as a result of router i being the origin of Interests (line 20 in FIG. 11 ).
  • FIG. 12 presents a diagram illustrating an exemplary Interest-processing algorithm, in accordance with an embodiment of the present invention.
  • the Interest being processed by router i is received from a neighboring router k .
  • router i no longer aggregates the Interest. Instead, router i can simply map the AID in the Interest received from the previous hop to the AID in the Interest forwarded to the next hop using a simple mapping function.
  • router i When router i receives a content request, it determines whether the requested content is cached locally. If so, a Data packet is sent back (line 6 in FIG. 12 ). If router i states that it is the origin of the name prefix n ( j )* and the CO with name n ( j ) is not found locally, a NACK is sent back stating that the content could not be found (line 10 in FIG. 12 ). If the CO is remote and no FIB entry exists for n ( j )*, then router i sends a NACK stating that no route could be found for the CO (line 12 in FIG. 12 ). Note that the AID in the aforementioned NACKs is the same AID in the received Interest.
  • Router i tries to forward the Interest to a next hop v to n ( j )* (the best prefix match for n ( j )) that satisfies the LFR.
  • the highest-ranked router satisfying the LFR is selected as the successor for the Interest and router i (lines 15-16 in FIG. 12 ).
  • the AID used in the forwarded Interest can be obtained by mapping (using a bijection function) the AID received from router k to the corresponding AID assigned to router i by the selected next hop v (line 17 in FIG. 12 ). If no entry in ART i exists for the same AID and previous hop k, a new ART entry is created. The entry is valid for any name prefix for which the same path and AID are used; hence, the name prefix of the entry is left empty (line 21 in FIG. 12 ). Router i then forwards the Interest by replacing the original AID with the mapped AID.
  • FIG. 13 presents a diagram illustrating an exemplary algorithm for processing Data packets, in accordance with an embodiment of the present invention.
  • router i may optionally verify the signature and discard the Data packet if the verification fails (lines 3-4 in FIG. 13 ).
  • Router i further determines (based on its ART entries) whether it has local users that requested the content. If so, the Data packet is sent to those consumers based on the information stored in the LIGHT (lines 6-8 in FIG. 13 ).
  • router i uses the inverse mapping function to map the AID in the received Data packets to the AID in the Data packet forwarded to neighbor k (line 11 in FIG. 13 ). Router i can optionally store the data object if edge or on-path caching is supported.
  • FIG. 14 presents a diagram illustrating an exemplary algorithm for processing NACKs, in accordance with an embodiment of the present invention.
  • router i receives a NACK, it determines (based on its ART entries) whether it was the origin of the Interest. If so, the NACK is sent to the local consumers based on the information stored in the LIGHT (lines 4-6 in FIG. 14 ). If the Data packet is received in response to an Interest that was forwarded from neighbor k, as determined by the ART entries, router i uses the inverse mapping function to map the AID in the received NACK to the AID in the NACK forwarded to neighbor k (line 9 in FIG. 14 ).
  • CCN-GRAM uses local identifiers carried in Interests to map routes traversed by Interests, thus eliminating the need to maintain large PITs. To ensure that the routes from consumers to producers and producers to consumers remain completely anonymous, the assignment of these local identifiers are carefully designed. More superficially, a receiver-initiated approach is used for the assignment of local identifiers.
  • CCN-GRAM can use the same content security features adopted in CCN and NDN to limit or eliminate cache-poisoning attacks, because it makes no modifications to the way in which content is protected in Data packets or how a name can be securely linked to the payload of a CO.
  • CCN-GRAM enjoys an enormous advantage over CCN and NDN in that it eliminates the ability of malicious users to mount Interest flooding attacks aimed at overwhelming the forwarding tables of routers.
  • intruders would have to compromise routers originating Interests destined to an unbounded number of prefixes. Even this case can be managed, given that a router forwarding Interests to a neighbor router must obtain the AIDs to be used in those Interests from its neighbor.
  • a CCN-GRAM router uses an ART to maintain Interest state.
  • ARTs to maintain the forwarding states of Interests shows greater advantages over the approach that keeps the per-Interest forwarding state in the PIT, especially when the rate of content requests is high.
  • the size of the PITs can grow dramatically as the rate of content requests increases, whereas the size of the ARTs can remain substantially constant with respect to the content request rates.
  • the average number of entries in the ARTs may be larger than the average number of entries in the PITs. This is because ART entries are kept for long periods of time (e.g., seconds) regardless of whether or not the routes they denote are actually used by Interests and their responses.
  • a PIT entry is deleted immediately after the corresponding Interest is satisfied.
  • the size of a PIT can be more than 10 to 20 times the size of an ART, because a given ART entry can be used for many Interests, whereas a different PIT entry is needed for each Interest.
  • the cost of maintaining ART entries that may not be used at light loads can be compensated for by the significant reduction in the signaling delays derived from many Interests forwarded using existing ART entries at high loads.
  • the size of an ART is independent of where content is being cached, given that an ART entry is stored independently of how many Interests traverse the route.
  • the size of a LIGHT is a function of the number of COs requested locally or cached on the path, and the average size of a LIGHT is dominated by local requests.
  • CCN-GRAM routers also maintain a LIST, and the average size of the LISTs is determined by the number of routers in the network, which is typically numbers of magnitude smaller than the number of Interests.
  • FIG. 15 illustrates an exemplary system for CCN-GRAM, in accordance with an embodiment of the present invention.
  • a system 1500 for CCN-GRAM comprises a processor 1510, a memory 1520, and a storage 1530.
  • Storage 1530 typically stores instructions that can be loaded into memory 1520 and executed by processor 1510 to perform the methods mentioned above.
  • the instructions in storage 1530 can implement an Interest-processing module 1532, a response-processing module 1534, a forwarding module 1536, and a control-message generation module 1538, all of which can be in communication with each other through various means.
  • Storage 1530 can further comprise a number of data structures, such as a Local Interest Gathered Table 1540, a Forwarding Information Base 1542, an anonymous routing table 1544, and a local interval set table 1546.
  • modules 1532, 1534, 1536, and 1538 can be partially or entirely implemented in hardware and can be part of processor 1510. Further, in some embodiments, the system may not include a separate processor and memory. Instead, in addition to performing their specific tasks, modules 1532, 1534, 1536, and 1538, either separately or in concert, may be part of general- or special-purpose computation engines.
  • Storage 1530 stores programs to be executed by processor 1510. Specifically, storage 1530 stores a program that implements a system (application) for CCN-GRAM. During operation, the application program can be loaded from storage 1530 into memory 1520 and executed by processor 1510. As a result, system 1500 can perform the functions described above.
  • System 1500 can be coupled to an optional display 1580 (which can be a touchscreen display), keyboard 1560, and pointing device 1570, and can also be coupled via one or more network interfaces to network 1582.
  • the data structures and code described in this detailed description are typically stored on a computer-readable storage medium, which may be any device or medium that can store code and/or data for use by a computer system.
  • the computer-readable storage medium includes, but is not limited to, volatile memory, non-volatile memory, magnetic and optical storage devices such as disk drives, magnetic tape, CDs (compact discs), DVDs (digital versatile discs or digital video discs), or other media capable of storing computer-readable media now known or later developed.
  • the methods and processes described in the detailed description section can be embodied as code and/or data, which can be stored in a computer-readable storage medium as described above.
  • a computer system reads and executes the code and/or data stored on the computer-readable storage medium, the computer system performs the methods and processes embodied as data structures and code and stored within the computer-readable storage medium.
  • modules or apparatus may include, but are not limited to, an application-specific integrated circuit (ASIC) chip, a field-programmable gate array (FPGA), a dedicated or shared processor that executes a particular software module or a piece of code at a particular time, and/or other programmable-logic devices now known or later developed.
  • ASIC application-specific integrated circuit
  • FPGA field-programmable gate array
  • the hardware modules or apparatus When activated, they perform the methods and processes included within them.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Claims (13)

  1. Router in einem informationszentrischen Netzwerk ICN, wobei der Router (802) mit mehreren Nachbarroutern (804, 806, 808) in dem Netzwerk einschließlich eines zweiten Routers (806) verbunden ist und Folgendes umfasst:
    Mittel zum Zuordnen lokaler Intervalle (814, 816, 818) zu jedem der mehreren Nachbarrouter, wobei die lokalen Intervalle einen Satz von lokalen Kennungen umfassen;
    eine Fläche zum Empfangen lokaler Intervalle (824, 826, 828), die dem Router von jedem der mehreren Nachbarrouter zugeordnet wurden;
    eine LIST (Local Interval Set Table) (1546) zum Speichern der den mehreren Nachbarn vom Router zugeordneten lokalen Intervalle (814, 816, 818) und der dem Router (802) von jedem der mehreren Nachbarn zugeordneten lokalen Intervalle (824, 826, 828);
    ein Empfangsmodul, konfiguriert zum Empfangen eines Interesses an einem Stück Inhalt von einem Nachbarrouter (804), wobei das Interesse einen mit dem Inhaltsstück assoziierten Namen und eine Kennung anzeigt, die aus dem lokalen Intervall (814) ausgewählt ist, das dem Router (802) vom Nachbarrouter (804) zugeordnet wurde;
    ein Interesseverarbeitungsmodul (1532), konfiguriert zum:
    Feststellen, ob das Interesse weitergeleitet werden kann;
    Auswählen, als Reaktion auf die Feststellung, dass das Interesse zu einem zweiten Router (806) weitergeleitet werden kann, einer Kennung aus dem dem Router (802) vom zweiten Router (806) zugeordneten lokalen Intervall (826); und
    Verarbeiten des Interesses durch Einfügen der Kennung in das Interesse; und
    ein Weiterleitungsmodul (1536), konfiguriert zum Weiterleiten des verarbeiteten Interesses zum zweiten Router (806).
  2. Router nach Anspruch 1, wobei die lokalen Intervalle (814, 824) nichtüberlappende kontinuierliche lokale Intervalle von Kennungen gleicher Länge umfassen.
  3. Router nach Anspruch 1 oder 2, wobei eine Bijektionsfunktion zum Mappen einer Kennung aus einem lokalen Intervall (814) auf eine Kennung aus einem anderen lokalen Intervall (824) benutzt wird.
  4. Router nach Anspruch 3, wobei der Router die Bijektionsfunktion zum Mappen einer Kennung in einem als Reaktion auf das Interesse empfangenen Datenpaket auf eine Kennung in dem weitergeleiteten Interesse benutzt.
  5. Router nach Anspruch 1, wobei das Weiterleitungsmodul (1536) ferner konfiguriert ist zum: Senden einer Antwort auf das Interesse als Reaktion darauf, dass das Interesseverarbeitungsmodul (1532) feststellt, dass das Interesse nicht weitergeleitet werden kann.
  6. Router nach Anspruch 5, wobei das Interesseverarbeitungsmodul (1532) konfiguriert ist zum Feststellen, dass das Interesse nicht weitergeleitet werden kann, auf der Basis von einem der Folgenden:
    das Inhaltsstück kann nicht gefunden werden;
    es kann keine Route zu einem das Inhaltsstück annoncierenden Zielrouter gefunden werden; und
    das Interesse durchquert eine Schleife; und
    wobei die vom Weiterleitungsmodul gesendete Antwort eine negative Bestätigung beinhaltet.
  7. Router nach Anspruch 1, wobei das Interesseverarbeitungsmodul (1532) konfiguriert ist zum:
    Feststellen auf der Basis einer lokalen Interessetabelle (1540), als Reaktion auf die Feststellung, dass das Interesse von einem lokalen Benutzer des Routers empfangen wird, ob ein vorheriges Interesse für dasselbe Inhaltsstück besteht;
    wenn ja, Aggregieren des empfangenen Interesses durch Hinzufügen des lokalen Benutzers zur lokalen Interessetabelle; und
    wenn nicht, Erzeugen eines neuen Eintrags in der lokalen Interessetabelle für das Inhaltsstück.
  8. Router nach Anspruch 1, wobei das empfangene Interesse eine vorherige Kennung führt und wobei das Interesseverarbeitungsmodul (1532) ferner konfiguriert ist zum:
    Durchführen einer Suche in einer lokalen Routing-Tabelle auf der Basis der vorherigen Kennung;
    Benutzen, als Reaktion darauf, dass ein übereinstimmender Eintrag gefunden wird, des übereinstimmenden Eintrags als die gewählte Kennung;
    Anwenden, als Reaktion darauf, dass kein übereinstimmender Eintrag gefunden wird, einer Bijektionsfunktion auf die vorherige Kennung, um die gewählte Kennung einzuholen, und Erzeugen eines Eintrags in der lokalen Routing-Tabelle, wobei der erzeugte Eintrag die gewählte Kennung und einen dritten Router vorgibt, von dem der Router das Interesse empfängt; und
    Erzeugen des verarbeiteten Interesses durch Ersetzen der in dem empfangenen Interesse geführten vorherigen Kennung durch die gewählte Kennung.
  9. Router nach Anspruch 1, wobei der Satz von Kennungen (814, 826) einen Satz von kontinuierlich zunehmenden oder abnehmenden numerischen Werten umfasst.
  10. Router nach Anspruch 1, der ferner Folgendes umfasst:
    ein Antwortempfangsmodul, konfiguriert zum Empfangen einer Antwort auf das Interesse;
    ein Antwortverarbeitungsmodul (1534), konfiguriert zum Verarbeiten der empfangenen Antwort; und
    ein Antwortweiterleitungsmodul (1536), konfiguriert zum Weiterleiten der verarbeiteten Antwort;
    wobei beim Verarbeiten der empfangenen Antwort das Antwortverarbeitungsmodul (1534) konfiguriert ist zum:
    Identifizieren eines übereinstimmenden Eintrags in einer lokalen Routing-Tabelle auf der Basis einer von der Antwort geführten Antwortkennung, wobei der übereinstimmende Eintrag einen dritten Router vorgibt, der das Interesse zum Router weiterleitet;
    Mappen der Antwortkennung auf eine Antwortweiterleitungskennung anhand einer für den dritten Router spezifischen Funktion; und
    Erzeugen der verarbeiteten Antwort durch Ersetzen der Antwortkennung durch die Antwortweiterleitungskennung.
  11. Nichtflüchtiges computerlesbares Speichermedium, auf dem Befehle gespeichert sind, die bei Ausführung durch ein Computergerät bewirken, dass das Computergerät ein Verfahren für Inhaltsaustausch in einem informationszentrischen Netzwerk ICN durchführt, wobei das ICN einen Router (802) umfasst, der mit mehreren Nachbarroutern (804, 806, 808) in dem Netzwerk einschließlich eines zweiten Routers (806) verbunden ist, wobei das Verfahren Folgendes beinhaltet:
    Zuordnen lokaler Intervalle (814, 816, 818) zu jedem der mehreren Nachbarrouter, wobei die lokalen Intervalle einen Satz von lokalen Kennungen umfassen;
    Empfangen lokaler Intervalle (824, 826, 828), die dem Router von jedem der mehreren Nachbarrouter zugeordnet wurden;
    Speichern der den mehreren Nachbarn vom Router zugeordneten lokalen Intervalle (814, 816, 818) und der dem Router (802) von jedem der mehreren Nachbarn zugeordneten lokalen Intervalle (824, 826, 828) in einer LIST (Local Interval Set Table) (1546);
    Empfangen, an einem ersten Router im ICN, eines Interesses an einem Inhaltsstück von einem Nachbarrouter (804), wobei das Interesse einen mit dem Inhaltsstück assoziierten Namen und eine Kennung anzeigt, die aus dem dem Nachbarrouter (804) vom Router (802) zugeordneten lokalen Intervall (814) ausgewählt ist;
    Auswählen, als Reaktion auf die Feststellung, dass das Interesse zu einem zweiten Router weitergeleitet werden kann, einer dem ersten Router (802) vom zweiten Router (806) zugeordneten Kennung aus dem lokalen Intervall;
    Verarbeiten des Interesses durch Einführen der Kennung in das Interesse; und
    Weiterleiten des verarbeiteten Interesses zum zweiten Router (806).
  12. Computerlesbares Speichermedium nach Anspruch 11, wobei das Verfahren ferner das Senden einer Antwort auf das Interesse als Reaktion auf die Feststellung beinhaltet, dass das Interesse nicht weitergeleitet werden kann.
  13. Verfahren, ausführbar durch einen Computer, für Inhaltsaustausch in einem informationszentrischen Netzwerk ICN, wobei das ICN einen Router (802) umfasst, der mit mehreren Nachbarroutern (804, 806, 808) in dem Netzwerk einschließlich eines zweiten Routers (806) verbunden ist, wobei das Verfahren Folgendes beinhaltet:
    Zuordnen lokaler Intervalle (814, 816, 818) zu jedem der mehreren Nachbarrouter, wobei die lokalen Intervalle einen Satz von lokalen Kennungen umfassen;
    Empfangen lokaler Intervalle (824, 826, 828), die dem Router von jedem der mehreren Nachbarrouter zugeordnet wurden;
    Speichern der den mehreren Routern vom Router zugeordneten lokalen Intervalle (814, 816, 818) und der dem Router (802) von jedem der mehreren Nachbarn zugeordneten lokalen Intervalle (824, 826, 828) in einer LIST (Local Interval Set Table) (1546);
    Empfangen, an einem ersten Router in einem informationszentrischen Netzwerk ICN, eines Interesses an einem Inhaltsstück von einem Nachbarrouter (804), wobei das Interesse einen mit dem Inhaltsstück assoziierten Namen und eine Kennung anzeigt, ausgewählt aus dem dem Nachbarrouter (804) vom Router (802) zugeordneten lokalen Intervall (814);
    Auswählen, als Reaktion auf die Feststellung, dass das Interesse zu einem zweiten Router weitergeleitet werden kann, einer Kennung aus dem dem ersten Router (802) vom zweiten Router (806) zugeordneten lokalen Intervall (826);
    Verarbeiten des Interesses durch Einfügen der Kennung in das Interesse; und
    Weiterleiten des verarbeiteten Interesses zum zweiten Router (806).
EP16189546.1A 2015-09-29 2016-09-19 System und verfahren für zustandslose informationszentrische vernetzung Active EP3151517B1 (de)

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
US14/869,740 US10454820B2 (en) 2015-09-29 2015-09-29 System and method for stateless information-centric networking

Publications (2)

Publication Number Publication Date
EP3151517A1 EP3151517A1 (de) 2017-04-05
EP3151517B1 true EP3151517B1 (de) 2019-07-31

Family

ID=56958813

Family Applications (1)

Application Number Title Priority Date Filing Date
EP16189546.1A Active EP3151517B1 (de) 2015-09-29 2016-09-19 System und verfahren für zustandslose informationszentrische vernetzung

Country Status (4)

Country Link
US (1) US10454820B2 (de)
EP (1) EP3151517B1 (de)
JP (1) JP2017069951A (de)
KR (1) KR20170038148A (de)

Families Citing this family (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10021222B2 (en) * 2015-11-04 2018-07-10 Cisco Technology, Inc. Bit-aligned header compression for CCN messages using dictionary
US10320675B2 (en) * 2016-05-04 2019-06-11 Cisco Technology, Inc. System and method for routing packets in a stateless content centric network
US10432509B2 (en) * 2016-06-14 2019-10-01 Cisco Technology, Inc. Flow classification for information centric network protocols
US10122624B2 (en) * 2016-07-25 2018-11-06 Cisco Technology, Inc. System and method for ephemeral entries in a forwarding information base in a content centric network
US10244071B2 (en) * 2016-11-21 2019-03-26 Intel Corporation Data management in an edge network
CN107888502B (zh) * 2017-11-24 2020-10-16 重庆邮电大学 内容中心网络中非混合式蚁群路由方法
CN110035092A (zh) * 2018-01-11 2019-07-19 中国科学院声学研究所 一种icn网络中的基于lcd的隐式缓存策略
CN108173965A (zh) * 2018-01-22 2018-06-15 广东技术师范学院 社团感知的icn缓存方法
EP3804239A4 (de) * 2018-06-05 2022-03-23 Gramboo Inc. Verzeichnisunterstütztes routing von inhalt in einem informationszentrischen netzwerk
JP6939726B2 (ja) * 2018-07-17 2021-09-22 日本電信電話株式会社 攻撃対処箇所選択装置及び攻撃対処箇所選択方法
CN109862121B (zh) * 2019-03-26 2021-06-29 广东技术师范大学 一种基于Dijkstra算法的信息中心网络中的缓存放置方法
US11483238B2 (en) * 2019-10-14 2022-10-25 Cisco Technology, Inc. Centralized path computation for information-centric networking
FR3105441B1 (fr) * 2019-12-19 2021-12-10 Sagemcom Broadband Sas Procédé et système d’auto-localisation à partir d’ondes radioélectriques, programme et support de programme correspondants.
CN111314224B (zh) * 2020-02-13 2021-03-09 中国科学院计算技术研究所 一种命名数据网络缓存方法
CN115426308B (zh) * 2022-11-08 2023-04-11 北京大学深圳研究生院 一种多标识网络下的链路状态路由方法

Family Cites Families (603)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US817441A (en) 1905-12-26 1906-04-10 Bucher & Gibbs Plow Company Plow.
GB1104536A (en) 1966-06-10 1968-02-28 Bp Chem Int Ltd A process for the production of film forming aqueous dispersions of copolymers of vinyl esters of organic acids
US4309569A (en) 1979-09-05 1982-01-05 The Board Of Trustees Of The Leland Stanford Junior University Method of providing digital signatures
US4921898A (en) 1985-08-02 1990-05-01 Air Products And Chemicals, Inc. Vinyl acetate-ethylene copolymer emulsions prepared in the presence of a stabilizing system of a low molecular weight polyvinyl alcohol and a surfactant
GB8711984D0 (en) 1987-05-21 1987-06-24 Shell Int Research Polymeric products
US5214702A (en) 1988-02-12 1993-05-25 Fischer Addison M Public key/signature cryptosystem with enhanced digital signature certification
JPH0655874B2 (ja) 1989-02-28 1994-07-27 住友化学工業株式会社 酢酸ビニル―エチレン共重合体エマルジョン及びその製造方法
GB8918553D0 (en) 1989-08-15 1989-09-27 Digital Equipment Int Message control system
US5506844A (en) 1994-05-20 1996-04-09 Compression Labs, Inc. Method for configuring a statistical multiplexer to dynamically allocate communication channel bandwidth
US5548646A (en) 1994-09-15 1996-08-20 Sun Microsystems, Inc. System for signatureless transmission and reception of data packets between computer networks
US6181837B1 (en) 1994-11-18 2001-01-30 The Chase Manhattan Bank, N.A. Electronic check image storage and retrieval system
DE19528380A1 (de) 1995-08-02 1997-02-06 Hoechst Ag Heterogene Vinylacetat/Ethylen-Dispersion
US5870605A (en) 1996-01-18 1999-02-09 Sun Microsystems, Inc. Middleware for enterprise information distribution
US5629370A (en) 1996-04-29 1997-05-13 Reichhold Chemicals, Inc. High solids vinyl acetate-ethylene emulsions
US5845207A (en) 1996-05-09 1998-12-01 At&T Wirless Services, Inc. Service transfer to a wireless telephone
US6085320A (en) 1996-05-15 2000-07-04 Rsa Security Inc. Client/server protocol for proving authenticity
DE19620817A1 (de) 1996-05-23 1997-11-27 Wacker Chemie Gmbh Flexible Baustoffmassen
JP3563541B2 (ja) 1996-09-13 2004-09-08 株式会社東芝 データ格納装置及びデータ格納方法
US6173364B1 (en) 1997-01-15 2001-01-09 At&T Corp. Session cache and rule caching method for a dynamic filter
US6047331A (en) 1997-02-19 2000-04-04 Massachusetts Institute Of Technology Method and apparatus for automatic protection switching
AU6654798A (en) 1997-02-26 1998-09-18 Siebel Systems, Inc. Method of determining visibility to a remote database client of a plurality of database transactions using a networked proxy server
US6366988B1 (en) 1997-07-18 2002-04-02 Storactive, Inc. Systems and methods for electronic data storage management
US6363067B1 (en) 1997-09-17 2002-03-26 Sony Corporation Staged partitioned communication bus for a multi-port bridge for a local area network
US6091724A (en) 1997-11-20 2000-07-18 International Business Machines Corporation Routing messages within a network using the data content of the message
US6807632B1 (en) 1999-01-21 2004-10-19 Emc Corporation Content addressable information encapsulation, representation, and transfer
US6052683A (en) 1998-02-24 2000-04-18 Nortel Networks Corporation Address lookup in packet data communication networks
US6667957B1 (en) 1998-03-14 2003-12-23 University Of Maryland Adaptive routing method for a dynamic network
US7233948B1 (en) 1998-03-16 2007-06-19 Intertrust Technologies Corp. Methods and apparatus for persistent control and protection of content
US6725373B2 (en) 1998-03-25 2004-04-20 Intel Corporation Method and apparatus for verifying the integrity of digital objects using signed manifests
US6289358B1 (en) 1998-04-15 2001-09-11 Inktomi Corporation Delivering alternate versions of objects from an object cache
US6209003B1 (en) 1998-04-15 2001-03-27 Inktomi Corporation Garbage collection in an object cache
US6292880B1 (en) 1998-04-15 2001-09-18 Inktomi Corporation Alias-free content-indexed object cache
US6128627A (en) 1998-04-15 2000-10-03 Inktomi Corporation Consistent data storage in an object cache
US6915307B1 (en) 1998-04-15 2005-07-05 Inktomi Corporation High performance object cache
US6128623A (en) 1998-04-15 2000-10-03 Inktomi Corporation High performance object cache
US7466703B1 (en) 1998-05-01 2008-12-16 Alcatel-Lucent Usa Inc. Scalable high speed router apparatus
US6226618B1 (en) 1998-08-13 2001-05-01 International Business Machines Corporation Electronic content delivery system
US6233646B1 (en) 1998-08-28 2001-05-15 Electronics And Telecommunications Research Institute Memory interface controller
US6732273B1 (en) 1998-10-21 2004-05-04 Lucent Technologies Inc. Priority and security coding system for electronic mail messages
US6332158B1 (en) 1998-12-03 2001-12-18 Chris Risley Domain name system lookup allowing intelligent correction of searches and presentation of auxiliary information
US7073129B1 (en) 1998-12-18 2006-07-04 Tangis Corporation Automated selection of appropriate information based on a computer user's context
US6611872B1 (en) 1999-01-11 2003-08-26 Fastforward Networks, Inc. Performing multicast communication in computer networks by using overlay routing
US6229895B1 (en) 1999-03-12 2001-05-08 Diva Systems Corp. Secure distribution of video on-demand
US6681220B1 (en) 1999-05-28 2004-01-20 International Business Machines Corporation Reduction and optimization of information processing systems
ES2262525T3 (es) 1999-07-19 2006-12-01 British Telecommunications Public Limited Company Encaminamiento de telecomunicaciones.
US6834272B1 (en) 1999-08-10 2004-12-21 Yeda Research And Development Company Ltd. Privacy preserving negotiation and computation
US7451177B1 (en) 1999-08-12 2008-11-11 Avintaquin Capital, Llc System for and method of implementing a closed loop response architecture for electronic commerce
CA2315457A1 (en) 1999-08-16 2001-02-16 Tactical Retailing Solutions, L.L.C. Method for providing consumers with offers
US6772333B1 (en) 1999-09-01 2004-08-03 Dickens Coal Llc Atomic session-start operation combining clear-text and encrypted sessions to provide id visibility to middleware such as load-balancers
US7013389B1 (en) 1999-09-29 2006-03-14 Cisco Technology, Inc. Method and apparatus for creating a secure communication channel among multiple event service nodes
US7061877B1 (en) 1999-09-10 2006-06-13 Georgia Tech Reseach Corporation System and method for providing high speed wireless media access
US6769066B1 (en) 1999-10-25 2004-07-27 Visa International Service Association Method and apparatus for training a neural network model for use in computer network intrusion detection
US6957228B1 (en) 2000-01-07 2005-10-18 International Business Machines Corporation Object oriented apparatus and method for providing context-based class replacement in an object oriented system
US7003571B1 (en) 2000-01-31 2006-02-21 Telecommunication Systems Corporation Of Maryland System and method for re-directing requests from browsers for communication over non-IP based networks
US7412462B2 (en) 2000-02-18 2008-08-12 Burnside Acquisition, Llc Data repository and method for promoting network storage of data
US6654792B1 (en) 2000-02-28 2003-11-25 3Com Corporation Method and architecture for logical aggregation of multiple servers
US6862280B1 (en) 2000-03-02 2005-03-01 Alcatel Priority remapping for data communication switch
US6901452B1 (en) 2000-03-02 2005-05-31 Alcatel Selectable prioritization for data communication switch
US20030046396A1 (en) 2000-03-03 2003-03-06 Richter Roger K. Systems and methods for managing resource utilization in information management environments
US20020152305A1 (en) 2000-03-03 2002-10-17 Jackson Gregory J. Systems and methods for resource utilization analysis in information management environments
US6917985B2 (en) 2000-03-10 2005-07-12 The Regents Of The University Of California Core assisted mesh protocol for multicast routing in ad-hoc Networks
US7552233B2 (en) 2000-03-16 2009-06-23 Adara Networks, Inc. System and method for information object routing in computer networks
US7162539B2 (en) 2000-03-16 2007-01-09 Adara Networks, Inc. System and method for discovering information objects and information object repositories in computer networks
US6775258B1 (en) 2000-03-17 2004-08-10 Nokia Corporation Apparatus, and associated method, for routing packet data in an ad hoc, wireless communication system
WO2001076120A2 (en) 2000-04-04 2001-10-11 Stick Networks, Inc. Personal communication device for scheduling presentation of digital content
US7089240B2 (en) 2000-04-06 2006-08-08 International Business Machines Corporation Longest prefix match lookup using hash function
US7908337B2 (en) 2000-04-28 2011-03-15 Adara Networks, Inc. System and method for using network layer uniform resource locator routing to locate the closest server carrying specific content
AU2001275327A1 (en) 2000-06-09 2001-12-24 Charles P. Brown Method and system for protecting domain names
US20040064737A1 (en) 2000-06-19 2004-04-01 Milliken Walter Clark Hash-based systems and methods for detecting and preventing transmission of polymorphic network worms and viruses
US20040073617A1 (en) 2000-06-19 2004-04-15 Milliken Walter Clark Hash-based systems and methods for detecting and preventing transmission of unwanted e-mail
AU2001271263A1 (en) 2000-06-30 2002-01-14 Net2Phone System, method, and computer program product for resolving addressing in a network including a network address translator
US7924837B1 (en) 2000-07-31 2011-04-12 Avaya Communication Israel Ltd. IP multicast in VLAN environment
CA2415888C (en) 2000-08-04 2008-10-21 Avaya Technology Corporation Intelligent demand driven recognition of url objects in connection oriented transactions
US7216179B2 (en) 2000-08-16 2007-05-08 Semandex Networks Inc. High-performance addressing and routing of data packets with semantically descriptive labels in a computer network
US7080073B1 (en) 2000-08-18 2006-07-18 Firstrain, Inc. Method and apparatus for focused crawling
AU2001283464A1 (en) 2000-08-31 2002-03-13 Padcom, Inc. Method and apparatus for routing data over multiple wireless networks
US7698463B2 (en) 2000-09-12 2010-04-13 Sri International System and method for disseminating topology and link-state information to routing nodes in a mobile ad hoc network
US7206853B2 (en) 2000-10-23 2007-04-17 Sony Corporation content abstraction layer for use in home network applications
AU2001295809A1 (en) 2000-10-26 2002-05-06 British Telecommunications Plc Telecommunications routing
JP2002135410A (ja) 2000-10-26 2002-05-10 Kddi Research & Development Laboratories Inc アクセスネットワークシステム
US7031308B2 (en) 2000-10-30 2006-04-18 The Regents Of The University Of California Tree-based ordered multicasting method
JP4225681B2 (ja) 2000-12-06 2009-02-18 富士通株式会社 仮想閉域網構築方法及び装置並びに中継装置
US7844666B2 (en) 2000-12-12 2010-11-30 Microsoft Corporation Controls and displays for acquiring preferences, inspecting behavior, and guiding the learning and decision policies of an adaptive communications prioritization and routing system
US20020078066A1 (en) 2000-12-18 2002-06-20 David Robinson Data storage system including a file system for managing multiple volumes
US20020077988A1 (en) 2000-12-19 2002-06-20 Sasaki Gary D. Distributing digital content
IES20010015A2 (en) 2001-01-09 2002-04-17 Menlo Park Res Teoranta Content management and distribution system
US7580971B1 (en) 2001-01-11 2009-08-25 Oracle International Corporation Method and apparatus for efficient SQL processing in an n-tier architecture
US7383329B2 (en) 2001-02-13 2008-06-03 Aventail, Llc Distributed cache for state transfer operations
US7350229B1 (en) 2001-03-07 2008-03-25 Netegrity, Inc. Authentication and authorization mapping for a computer network
US7266085B2 (en) 2001-03-21 2007-09-04 Stine John A Access and routing protocol for ad hoc network using synchronous collision resolution and node state dissemination
US7043637B2 (en) 2001-03-21 2006-05-09 Microsoft Corporation On-disk file format for a serverless distributed file system
US20020199014A1 (en) 2001-03-26 2002-12-26 Accton Technology Corporation Configurable and high-speed content-aware routing method
US7062490B2 (en) 2001-03-26 2006-06-13 Microsoft Corporation Serverless distributed file system
US7283519B2 (en) 2001-04-13 2007-10-16 Esn, Llc Distributed edge switching system for voice-over-packet multiservice network
FR2826469B1 (fr) 2001-06-25 2003-10-24 Eads Airbus Sa Procede et dispositif pour commander au moins une surface aerodynamique de profondeur d'un avion lors d'un decollage
US7054855B2 (en) 2001-07-03 2006-05-30 International Business Machines Corporation Method and system for performing a pattern match search for text strings
US7831733B2 (en) 2001-07-06 2010-11-09 Avaya Holdings Limited Policy-based forwarding in open shortest path first (OSPF) networks
US6981029B1 (en) 2001-07-17 2005-12-27 Cisco Technology, Inc. System and method for processing a request for information in a network
US7382787B1 (en) 2001-07-30 2008-06-03 Cisco Technology, Inc. Packet routing and switching device
US7152094B1 (en) 2001-07-31 2006-12-19 Sprint Communications Company L.P. Middleware brokering system adapter
WO2003017598A1 (en) 2001-08-15 2003-02-27 The Board Of Governors For Higher Education, State Of Rhode Island And Providence Plantations Scsi-to-ip cache storage device and method
US7356599B2 (en) 2001-08-30 2008-04-08 International Business Machines Corporation Method and apparatus for data normalization
US6775743B2 (en) 2001-09-12 2004-08-10 International Business Machines Corporation Content caching with special handling of multiple identical requests for content
US20030061384A1 (en) 2001-09-25 2003-03-27 Bryce Nakatani System and method of addressing and configuring a remote device
US7194553B2 (en) 2001-10-16 2007-03-20 Microsoft Corporation Resolving virtual network names
US20090006659A1 (en) 2001-10-19 2009-01-01 Collins Jack M Advanced mezzanine card for digital network data inspection
US7469299B2 (en) 2001-10-25 2008-12-23 Verizon Business Global Llc Bridging user agent and a proxy server for supporting network services
US7124616B2 (en) 2001-11-08 2006-10-24 Komatsu Ltd. Work transfer method for transfer press and work transfer apparatus for transfer press or press
US20030144441A1 (en) 2001-11-13 2003-07-31 Ayusman Sen Controlled copolymerization of methyl acrylate with olefins under mild conditions
CA2411806A1 (en) 2001-11-16 2003-05-16 Telecommunications Research Laboratory Wide-area content-based routing architecture
US6968393B1 (en) 2001-11-19 2005-11-22 Redback Networks, Inc. Method and apparatus for an attribute oriented routing update
GB2382962A (en) 2001-12-07 2003-06-11 Altio Ltd Data routing without using an address
US7149750B2 (en) 2001-12-19 2006-12-12 International Business Machines Corporation Method, system and program product for extracting essence from a multimedia file received in a first format, creating a metadata file in a second file format and using a unique identifier assigned to the essence to access the essence and metadata file
US7509425B1 (en) 2002-01-15 2009-03-24 Dynamicsoft, Inc. Establishing and modifying network signaling protocols
US20030140257A1 (en) 2002-01-22 2003-07-24 Petr Peterka Encryption, authentication, and key management for multimedia content pre-encryption
US9043365B2 (en) 2002-02-26 2015-05-26 International Business Machines Corporation Peer to peer (P2P) federated concept queries
US7007024B2 (en) 2002-03-29 2006-02-28 Panasas, Inc. Hashing objects into multiple directories for better concurrency and manageability
US7315541B1 (en) 2002-04-03 2008-01-01 Cisco Technology, Inc. Methods and apparatus for routing a content request
US7287275B2 (en) 2002-04-17 2007-10-23 Moskowitz Scott A Methods, systems and devices for packet watermarking and efficient provisioning of bandwidth
WO2003091297A1 (en) 2002-04-24 2003-11-06 Stitching Dutch Polymer Institute PROCESS FOR THE COPOLYMERISATION OF α-OLEFINS WITH VINYL MONOMERS
US7564812B1 (en) 2002-06-06 2009-07-21 Bbn Technologies Corp Method and apparatus for varying times/channels of broadcast beacons
US7444655B2 (en) 2002-06-11 2008-10-28 Microsoft Corporation Anonymous aggregated data collection
US20040030602A1 (en) 2002-06-19 2004-02-12 Rosenquist Edward G. Computer-implemented method and system for managing supplier access to purchasing and inventory transactions
US7496668B2 (en) 2002-06-28 2009-02-24 Honeywell International Inc. OPC server redirection manager
EP1383265A1 (de) 2002-07-16 2004-01-21 Nokia Corporation Verfahren zur Erzeugung von Proxysignaturen
US7209976B2 (en) 2002-07-16 2007-04-24 Jeremy Benjamin Protocol communication and transit packet forwarding routed between multiple virtual routers within a single physical router
EP1384729A1 (de) 2002-07-25 2004-01-28 Dutch Polymer Institute Verfahren zur radikalische Copolymerisation von Alpha-Olefinen mit Vinyl-Monomeren
US7206861B1 (en) 2002-07-29 2007-04-17 Juniper Networks, Inc. Network traffic distribution across parallel paths
US9497168B2 (en) 2002-07-30 2016-11-15 Avaya Inc. Method and apparatus for supporting communications between a computing device within a network and an external computing device
US8224985B2 (en) 2005-10-04 2012-07-17 Sony Computer Entertainment Inc. Peer-to-peer communication traversing symmetric network address translators
US7339929B2 (en) 2002-08-23 2008-03-04 Corrigent Systems Ltd. Virtual private LAN service using a multicast protocol
US7430755B1 (en) 2002-09-03 2008-09-30 Fs Networks, Inc. Method and system for providing persistence in a secure network access
US7471681B2 (en) 2002-10-10 2008-12-30 Intel Corporation Determining network path transmission unit
US7542471B2 (en) 2002-10-30 2009-06-02 Citrix Systems, Inc. Method of determining path maximum transmission unit
US7650416B2 (en) 2003-08-12 2010-01-19 Riverbed Technology Content delivery for client-server protocols with user affinities using connection end-point proxies
US7246159B2 (en) 2002-11-01 2007-07-17 Fidelia Technology, Inc Distributed data gathering and storage for use in a fault and performance monitoring system
US7424014B2 (en) 2002-11-12 2008-09-09 Cisco Technology, Inc. System and method for local packet transport services within distributed routers
US7278168B1 (en) 2002-11-27 2007-10-02 Adobe Systems Incorporated Dynamic enabling of functionality in electronic document readers
KR100511479B1 (ko) 2002-12-27 2005-08-31 엘지전자 주식회사 Ｎａｔ를 갖는 망에서의 ｓｉｐ 서비스 방법
GB0230330D0 (en) 2002-12-31 2003-02-05 British Telecomm Communications routing
JP4025674B2 (ja) 2003-04-01 2007-12-26 富士通株式会社 迂回通信経路設計方法
US7519685B2 (en) 2003-04-04 2009-04-14 Panasonic Corporation Contents linkage information delivery system
US7953885B1 (en) 2003-04-18 2011-05-31 Cisco Technology, Inc. Method and apparatus to apply aggregate access control list/quality of service features using a redirect cause
US7382765B2 (en) 2003-04-30 2008-06-03 Harris Corporation Predictive routing in a moble ad hoc network
US7805525B2 (en) 2003-04-30 2010-09-28 Hewlett-Packard Development Company, L.P. System and method for processing fibre channel (FC) layer service requests in an FC network
JP4271988B2 (ja) 2003-05-19 2009-06-03 株式会社日立コミュニケーションテクノロジー パケット通信装置
JP4251018B2 (ja) 2003-05-27 2009-04-08 株式会社日立製作所 ノードの位置表示方法
US20040246902A1 (en) 2003-06-02 2004-12-09 Weinstein Joseph J. Systems and methods for synchronizing multple copies of a database using datablase digest
WO2004112327A1 (ja) 2003-06-11 2004-12-23 Nec Corporation ルータ装置およびネットワーク接続方式
US7647507B1 (en) 2003-07-08 2010-01-12 Marvell International Ltd. Secure digital content distribution system and secure hard drive
US7257837B2 (en) 2003-07-26 2007-08-14 Innomedia Pte Firewall penetration system and method for real time media communications
US7895595B2 (en) 2003-07-30 2011-02-22 Northwestern University Automatic method and system for formulating and transforming representations of context used by information services
US20050050211A1 (en) 2003-08-29 2005-03-03 Kaul Bharat B. Method and apparatus to manage network addresses
US7472422B1 (en) 2003-09-10 2008-12-30 Symantec Corporation Security management system including feedback and control
US7099993B2 (en) 2003-09-24 2006-08-29 Seagate Technology Llc Multi-level caching in data storage devices
US20080037420A1 (en) 2003-10-08 2008-02-14 Bob Tang Immediate ready implementation of virtually congestion free guaranteed service capable network: external internet nextgentcp (square waveform) TCP friendly san
ATE557510T1 (de) 2003-10-29 2012-05-15 Nokia Corp Konfigurierbare protokollmaschine
US7155305B2 (en) 2003-11-04 2006-12-26 Universal Electronics Inc. System and methods for home appliance identification and control in a networked environment
US20050132207A1 (en) 2003-12-10 2005-06-16 Magda Mourad System and method for authoring learning material using digital ownership rights
US9032095B1 (en) 2004-01-06 2015-05-12 Juniper Networks, Inc. Routing device having multiple logical routers
US7366720B2 (en) 2004-01-06 2008-04-29 Sharp Laboratories Of America System for remote share access
US20070162394A1 (en) 2004-02-12 2007-07-12 Iconix, Inc. Rapid identification of message authentication
US7843906B1 (en) 2004-02-13 2010-11-30 Habanero Holdings, Inc. Storage gateway initiator for fabric-backplane enterprise servers
US20050198351A1 (en) 2004-02-20 2005-09-08 Microsoft Corporation Content-based routing
JPWO2005099188A1 (ja) 2004-03-05 2008-03-06 日本電気株式会社 通信品質管理方法および装置
EP1723533A1 (de) 2004-03-09 2006-11-22 Clique Communications Llc System und verfahren zur peer-to-peer-verbindung von clients hinter symmetrischen firewalls
EP1589716A1 (de) 2004-04-20 2005-10-26 Ecole Polytechnique Fédérale de Lausanne (EPFL) Verfahren zur Detektion des anomalen Benutzerverhaltens in einem Rechnernetzwerk
US8027335B2 (en) 2004-05-05 2011-09-27 Prodea Systems, Inc. Multimedia access device and system employing the same
JP4230410B2 (ja) 2004-05-11 2009-02-25 株式会社日立製作所 仮想ストレージの通信品質制御装置
US7620033B2 (en) 2004-05-21 2009-11-17 Alcatel-Lucent Usa Inc. Method for optimal path selection in traversal of packets through network address translators
GB0412847D0 (en) 2004-06-09 2004-07-14 Nortel Networks Ltd Method of applying the radius restricted routing scheme in a communication network
US8868779B2 (en) 2004-06-15 2014-10-21 Accenture Global Services Limited Method and apparatus to accomplish peer-to-peer application data routing between service consumers and service providers within a service oriented architecture
US7483376B2 (en) 2004-06-17 2009-01-27 International Business Machines Corporation Method and apparatus for discovering path maximum transmission unit (PMTU)
US20050289222A1 (en) 2004-06-28 2005-12-29 Sahim Faramarz F Flexible session initiation protocol endpoint signaling
US20050286535A1 (en) 2004-06-29 2005-12-29 Shrum Edgar V Jr Verification of consumer equipment connected to packet networks based on hashing values
WO2006007623A1 (en) 2004-07-22 2006-01-26 Blue Pulse Pty Ltd Location dependent content provision
US9325805B2 (en) 2004-08-02 2016-04-26 Steve J Shattil Content delivery in wireless wide area networks
US20060029102A1 (en) 2004-08-03 2006-02-09 Fujitsu Limited Processing method of fragmented packet
JP4490331B2 (ja) 2004-08-03 2010-06-23 富士通株式会社 断片パケット処理方法及びこれを用いるパケット転送装置
US7623535B2 (en) 2004-09-09 2009-11-24 Cisco Technology, Inc. Routing protocol support for half duplex virtual routing and forwarding instance
JP4421981B2 (ja) 2004-09-09 2010-02-24 パイオニア株式会社 コンテンツ遠隔視聴システム、コンテンツ遠隔視聴用サーバ装置、コンテンツ遠隔視聴用記録再生装置、及びコンテンツ遠隔視聴方法、並びにコンピュータプログラム
US7685290B2 (en) 2004-09-21 2010-03-23 Cisco Technology, Inc. Method and apparatus for handling SCTP multi-homed connections
US7543064B2 (en) 2004-09-30 2009-06-02 Logitech Europe S.A. Multiplayer peer-to-peer connection across firewalls and network address translators using a single local port on the local host
US8055778B2 (en) 2004-09-30 2011-11-08 Siemens Enterprise Communications, Inc. SIP user agent with simultaneous multiple registrations
US7848749B2 (en) 2004-11-08 2010-12-07 Alcatel-Lucent Usa Inc. Method and apparatus for activating a dormant mobile unit in a distributed network
WO2006055784A2 (en) 2004-11-19 2006-05-26 The Trustees Of The Stevens Institute Of Technology Multi-access terminal wiht capability for simultaneous connectivity to multiple communication channels
NZ556367A (en) 2004-12-08 2010-09-30 Obvious Ltd B Bidirectional data transfer optimization and content control for networks
JP4131964B2 (ja) 2004-12-10 2008-08-13 株式会社東芝 情報端末装置
KR20060066628A (ko) 2004-12-13 2006-06-16 엘지전자 주식회사 기록매체에 수록된 콘텐트를 보호하는 방법 및 그보호방법이 적용된 콘텐트를 수록하고 있는 기록매체
US20060133343A1 (en) 2004-12-22 2006-06-22 Nokia Corporation Multi homing transport protocol on a multi-processor arrangement
US7535926B1 (en) 2005-01-07 2009-05-19 Juniper Networks, Inc. Dynamic interface configuration for supporting multiple versions of a communication protocol
US7646775B2 (en) 2005-03-08 2010-01-12 Leaf Networks, Llc Protocol and system for firewall and NAT traversal for TCP connections
KR101144243B1 (ko) 2005-03-10 2012-05-14 톰슨 라이센싱 하이브리드 메쉬 라우팅 프로토콜
US7567946B2 (en) 2005-03-14 2009-07-28 Xerox Corporation Method, apparatus, and article of manufacture for estimating parameters of a probability model on shared device usage probabilistic semantic analysis
JP4672405B2 (ja) 2005-03-17 2011-04-20 パナソニック株式会社 通信システム、情報処理システム、接続サーバ、処理サーバ、情報処理装置、及び情報処理方法
US20130066823A1 (en) 2005-03-30 2013-03-14 Primal Fusion Inc. Knowledge representation systems and methods incorporating customization
US20060223504A1 (en) 2005-04-01 2006-10-05 Ixi Mobile (R&D) Ltd. Efficient server polling system and method
US8089964B2 (en) 2005-04-05 2012-01-03 Cisco Technology, Inc. Transporting multicast over MPLS backbone using virtual interfaces to perform reverse-path forwarding checks
US8266237B2 (en) 2005-04-20 2012-09-11 Microsoft Corporation Systems and methods for providing distributed, decentralized data storage and retrieval
US8312064B1 (en) 2005-05-11 2012-11-13 Symantec Corporation Method and apparatus for securing documents using a position dependent file system
US7773569B2 (en) 2005-05-19 2010-08-10 Meshnetworks, Inc. System and method for efficiently routing data packets and managing channel access and bandwidth in wireless multi-hopping networks
JP2008543202A (ja) 2005-05-31 2008-11-27 インターナショナル・ビジネス・マシーンズ・コーポレーション 固有の永続的な識別子を生成するシステム及び方法
US7747874B2 (en) 2005-06-02 2010-06-29 Seagate Technology Llc Single command payload transfers block of security functions to a storage device
US7606801B2 (en) 2005-06-07 2009-10-20 Varonis Inc. Automatic management of storage access control
US7704129B2 (en) 2005-07-12 2010-04-27 Tipper Tie, Inc. Ruckers capable of rucking fixed diameter coverings and associated devices, methods, systems and computer program products
WO2007015822A1 (en) 2005-07-20 2007-02-08 Firetide, Inc. Route optimization for on-demand routing protocols for mesh networks
WO2007052285A2 (en) 2005-07-22 2007-05-10 Yogesh Chunilal Rathod Universal knowledge management and desktop search system
US8432896B2 (en) 2005-07-22 2013-04-30 Cisco Technology, Inc. System and method for optimizing communications between session border controllers and endpoints in a network environment
WO2007016942A1 (en) 2005-08-08 2007-02-15 Pirelli & C. S.P.A Method for configuring an optical network
US8521955B2 (en) 2005-09-13 2013-08-27 Lsi Corporation Aligned data storage for network attached media streaming systems
JP4940464B2 (ja) 2005-09-16 2012-05-30 独立行政法人産業技術総合研究所 ネットワーク機器試験装置
US20070073888A1 (en) 2005-09-26 2007-03-29 Ajay Madhok System and method to control transactions on communication channels based on universal identifiers
US8024290B2 (en) 2005-11-14 2011-09-20 Yahoo! Inc. Data synchronization and device handling
US7558604B2 (en) 2005-11-25 2009-07-07 Lenovo (Singapore) Pte. Ltd. Method and apparatus for remote discovery of client and access point settings in a wireless LAN
US7636767B2 (en) 2005-11-29 2009-12-22 Cisco Technology, Inc. Method and apparatus for reducing network traffic over low bandwidth links
US7664789B2 (en) 2005-12-02 2010-02-16 Cisco Technology, Inc. Method and apparatus to minimize database exchange in OSPF by using a SHA-1 digest value
US7664067B2 (en) 2005-12-15 2010-02-16 Microsoft Corporation Preserving socket connections over a wireless network
US20070156998A1 (en) 2005-12-21 2007-07-05 Gorobets Sergey A Methods for memory allocation in non-volatile memories with a directly mapped file storage system
US7779467B2 (en) 2005-12-22 2010-08-17 Electronics And Telecommunications Research Institute N grouping of traffic and pattern-free internet worm response system and method using N grouping of traffic
CA2635969C (en) 2006-01-05 2014-09-30 Wireless Edge Canada Inc. Systems and methods for improved network based content inspection
US7738495B2 (en) 2006-01-23 2010-06-15 Cisco Technology, Inc. Method of determining a maximum transmission unit value of a network path using transport layer feedback
US7769887B1 (en) 2006-02-03 2010-08-03 Sprint Communications Company L.P. Opportunistic data transfer over heterogeneous wireless networks
US7860106B2 (en) 2006-02-13 2010-12-28 Wind River Systems, Inc. System and method for routing table computation and analysis
US8464329B2 (en) 2006-02-21 2013-06-11 Watchguard Technologies, Inc. System and method for providing security for SIP-based communications
EP1826956B8 (de) 2006-02-23 2008-08-13 Swisscom AG Anpassung von virtuellen und physikalischen Netzwerkschnittstellen
US20070204011A1 (en) 2006-02-28 2007-08-30 Maven Networks, Inc. Systems and methods for offline access to video content of a web-site
US8832302B1 (en) 2006-03-31 2014-09-09 Rockwell Collins, Inc. System and method for a priori scheduling of network services
DE502007001137D1 (de) 2006-04-06 2009-09-03 Basf Se Verfahren zur herstellung einer wässrigen polymerisatdispersion
US9043487B2 (en) 2006-04-18 2015-05-26 Cisco Technology, Inc. Dynamically configuring and verifying routing information of broadcast networks using link state protocols in a computer network
IL175144A (en) 2006-04-24 2014-04-30 Elbit Systems Ltd Wireless data network
US20070255781A1 (en) 2006-04-26 2007-11-01 Bayhub, Inc. Content driven process routing for integrated enterprise applications
WO2007125530A2 (en) 2006-04-27 2007-11-08 D.S.P. Group Ltd. Routing path optimization between si p endpoints according to nat topology
CN101064598B (zh) 2006-04-28 2011-04-20 腾讯科技（深圳）有限公司 一种客户端即时通信数据的加密和解密方法
US7925681B2 (en) 2006-04-28 2011-04-12 Microsoft Corporation Bypass of the namespace hierarchy to open files
US20070255677A1 (en) 2006-04-28 2007-11-01 Sun Microsystems, Inc. Method and apparatus for browsing search results via a virtual file system
US8582555B2 (en) 2006-05-12 2013-11-12 Oracle International Corporation SIP routing customization
US8571012B2 (en) 2006-05-12 2013-10-29 Oracle International Corporation Customized sip routing to cross firewalls
US9319967B2 (en) 2006-05-15 2016-04-19 Boingo Wireless, Inc. Network access point detection and use
WO2007136006A1 (ja) 2006-05-18 2007-11-29 Panasonic Corporation 電子機器、コンテンツ再生制御方法、プログラム、記憶媒体、集積回路
US20080082662A1 (en) 2006-05-19 2008-04-03 Richard Dandliker Method and apparatus for controlling access to network resources based on reputation
US20070283158A1 (en) 2006-06-02 2007-12-06 Microsoft Corporation Microsoft Patent Group System and method for generating a forensic file
US7739082B2 (en) 2006-06-08 2010-06-15 Battelle Memorial Institute System and method for anomaly detection
US7912982B2 (en) 2006-06-09 2011-03-22 Trapeze Networks, Inc. Wireless routing selection system and method
US8472376B2 (en) 2006-06-09 2013-06-25 Telefonaktiebolaget L M Ericsson (Publ) Handling multiple user interfaces in an IP multimedia subsystem
IE20070422A1 (en) 2006-06-13 2007-12-21 Qtelmedia Group Ltd A method for restricting access to digital content
US8117441B2 (en) 2006-06-20 2012-02-14 Microsoft Corporation Integrating security protection tools with computer device integrity and privacy policy
US20080005223A1 (en) 2006-06-28 2008-01-03 Microsoft Corporation Reputation data for entities and data processing
US8468131B2 (en) 2006-06-29 2013-06-18 Avaya Canada Corp. Connecting devices in a peer-to-peer network with a service provider
US20080059631A1 (en) 2006-07-07 2008-03-06 Voddler, Inc. Push-Pull Based Content Delivery System
JP5086574B2 (ja) 2006-07-11 2012-11-28 株式会社東芝 コンテンツ記録装置、コンテンツ再生装置、方法およびプログラム
US7444251B2 (en) 2006-08-01 2008-10-28 Mitsubishi Electric Research Laboratories, Inc. Detecting and diagnosing faults in HVAC equipment
JP4884132B2 (ja) 2006-08-17 2012-02-29 富士通株式会社 電話システム、接続制御方法、接続制御装置、及びコンピュータプログラム
US8312120B2 (en) 2006-08-22 2012-11-13 Citrix Systems, Inc. Systems and methods for providing dynamic spillover of virtual servers based on bandwidth
US7567547B2 (en) 2006-09-07 2009-07-28 Palo Alto Research Center Incorporated Method and system for loop-free ad-hoc routing
WO2008040004A2 (en) 2006-09-28 2008-04-03 Sfgt Inc. Apparatuses, methods, and systems for code triggered information querying and serving
US20080080440A1 (en) 2006-09-30 2008-04-03 Yarvis Mark D Device interfaces to integrate cooperative diversity and mesh networking
US7805460B2 (en) 2006-10-26 2010-09-28 Polytechnic Institute Of New York University Generating a hierarchical data structure associated with a plurality of known arbitrary-length bit strings used for detecting whether an arbitrary-length bit string input matches one of a plurality of known arbitrary-length bit string
EP2087711B1 (de) 2006-10-31 2010-12-29 Telefonaktiebolaget LM Ericsson (publ) Verfahren und Vorrichtung zum IP-Netzwerk-Interfacing
JP4308840B2 (ja) 2006-11-08 2009-08-05 Ｏｋｉセミコンダクタ株式会社 Ｓｈａ演算方法およびｓｈａ演算装置
GB2443889A (en) 2006-11-20 2008-05-21 Skype Ltd Method and system for anonymous communication
US8010795B2 (en) 2006-11-27 2011-08-30 Red Hat, Inc. Secure information transfer using dedicated public key pairs
US8516116B2 (en) 2006-11-30 2013-08-20 Accenture Global Services Limited Context-based routing of requests in a service-oriented architecture
US8181107B2 (en) 2006-12-08 2012-05-15 Bytemobile, Inc. Content adaptation
US9280337B2 (en) 2006-12-18 2016-03-08 Adobe Systems Incorporated Secured distribution of software updates
JP2008160385A (ja) 2006-12-22 2008-07-10 Nec Corp ネットワーク経路制御システム、経路制御装置および経路制御方法
US7523016B1 (en) 2006-12-29 2009-04-21 Google Inc. Detecting anomalies
US8422501B2 (en) 2007-01-04 2013-04-16 International Business Machines Corporation Efficient path maximum transmission unit information discovery and storage
US8468244B2 (en) 2007-01-05 2013-06-18 Digital Doors, Inc. Digital information infrastructure and method for security designated data and with granular data stores
US8655939B2 (en) 2007-01-05 2014-02-18 Digital Doors, Inc. Electromagnetic pulse (EMP) hardened information infrastructure with extractor, cloud dispersal, secure storage, content analysis and classification and method therefor
JP4367493B2 (ja) 2007-02-02 2009-11-18 ソニー株式会社 無線通信システム、無線通信装置及び無線通信方法、並びにコンピュータ・プログラム
WO2008096543A1 (ja) 2007-02-07 2008-08-14 Panasonic Corporation 記録装置、サーバ装置、記録方法、コンピュータプログラムを記録した記録媒体、及び集積回路
CN101257670B (zh) 2007-02-28 2012-04-11 中国移动通信集团公司 手机文件搜索下载的方法、设备及系统
JP2008217216A (ja) 2007-03-01 2008-09-18 Hitachi Ltd 負荷分散方法及び計算機システム
US8861356B2 (en) 2007-03-13 2014-10-14 Ntt Docomo, Inc. Method and apparatus for prioritized information delivery with network coding over time-varying network topologies
US8234327B2 (en) 2007-03-30 2012-07-31 Netapp, Inc. System and method for bandwidth optimization in a network storage environment
US8131723B2 (en) 2007-03-30 2012-03-06 Quest Software, Inc. Recovering a file system to any point-in-time in the past with guaranteed structure, content consistency and integrity
US8417939B2 (en) 2007-04-11 2013-04-09 The DIRECTV Goup, Inc. Method and apparatus for file sharing between a group of user devices with encryption-decryption information sent via satellite and the content sent separately
US7979912B1 (en) 2007-04-18 2011-07-12 Sprint Spectrum L.P. Method and system for verifying network credentials
US8707431B2 (en) 2007-04-24 2014-04-22 The Mitre Corporation Insider threat detection
US7890549B2 (en) 2007-04-30 2011-02-15 Quantum Leap Research, Inc. Collaboration portal (COPO) a scaleable method, system, and apparatus for providing computer-accessible benefits to communities of users
US8656017B2 (en) 2007-05-16 2014-02-18 Microsoft Corporation Peer-to-peer collaboration system with edge routing
US7773510B2 (en) 2007-05-25 2010-08-10 Zeugma Systems Inc. Application routing in a distributed compute environment
US7995478B2 (en) 2007-05-30 2011-08-09 Sony Computer Entertainment Inc. Network communication with path MTU size discovery
US8355706B2 (en) 2007-07-20 2013-01-15 Broadcom Corporation Method and system for utilizing context data tags to catalog data in wireless system
US8271687B2 (en) 2007-06-19 2012-09-18 Cisco Technology, Inc. Streaming network coding
EP2007105A1 (de) 2007-06-22 2008-12-24 Accenture Global Services GmbH Adapter für ein Sitzungsinitialisierungsprotokoll
JP4888263B2 (ja) 2007-07-19 2012-02-29 ソニー株式会社 受信装置、受信方法およびコンピュータプログラム
US9009327B2 (en) 2007-08-03 2015-04-14 Citrix Systems, Inc. Systems and methods for providing IIP address stickiness in an SSL VPN session failover environment
WO2009032710A2 (en) 2007-08-29 2009-03-12 Nirvanix, Inc. Filing system and method for data files stored in a distributed communications network
JP5102361B2 (ja) 2007-08-30 2012-12-19 トムソン ライセンシング 無線メッシュ・ネットワークにおけるコンテンツ・サービスのための統一されたピア・ツー・ピア・キャッシュ・システム
JP2009065429A (ja) 2007-09-06 2009-03-26 Hitachi Communication Technologies Ltd パケット転送装置
US20090077184A1 (en) 2007-09-18 2009-03-19 Martin John Brewer Remote Control of Mobile Terminal via Remote Control Proxy and SMS
US7948966B2 (en) 2007-10-01 2011-05-24 Powerwave Cognition, Inc. Multi-metric routing calculations
US7751329B2 (en) 2007-10-03 2010-07-06 Avaya Inc. Providing an abstraction layer in a cluster switch that includes plural switches
US20090097631A1 (en) 2007-10-12 2009-04-16 Doug Gisby Method, apparatus and system for routing a call using overflow groups
US8903756B2 (en) 2007-10-19 2014-12-02 Ying Zhao System and method for knowledge pattern search from networked agents
US8090592B1 (en) 2007-10-31 2012-01-03 At&T Intellectual Property I, L.P. Method and apparatus for multi-domain anomaly pattern definition and detection
JP5261785B2 (ja) 2007-10-31 2013-08-14 株式会社日立製作所 コンテンツ配信システム、キャッシュサーバ及びキャッシュ管理サーバ
US8085768B1 (en) 2007-11-01 2011-12-27 Cisco Technology Inc. System and method for managing a list of entries containing routing information
US7983701B2 (en) 2007-11-01 2011-07-19 International Business Machines Corporation Alerts based on significance of free format text messages
US8924497B2 (en) 2007-11-16 2014-12-30 Hewlett-Packard Development Company, L.P. Managing delivery of electronic messages
WO2009068045A1 (en) 2007-11-26 2009-06-04 Telefonaktiebolaget Lm Ericsson (Publ) Technique for address resolution in a data transmission network
US7852774B2 (en) 2007-11-28 2010-12-14 Cisco Technology, Inc. User datagram protocol traceroute probe extension
FR2925247B1 (fr) 2007-12-18 2011-11-04 Alcatel Lucent Controle de l'interface d'emission d'un message de reponse sip
EP2223509A1 (de) 2007-12-20 2010-09-01 Telefonaktiebolaget LM Ericsson (publ) Verfahren und anordnung zur aufrechterhaltung einer tcp-verbindung
US8761022B2 (en) 2007-12-26 2014-06-24 Rockstar Consortium Us Lp Tie-breaking in shortest path determination
JP4331240B2 (ja) 2008-01-23 2009-09-16 株式会社東芝 電子機器および画像表示方法
WO2009093457A2 (en) 2008-01-24 2009-07-30 Panasonic Corporation Multimedia data transmitting apparatus and multimedia data management method
US8880724B2 (en) 2008-01-31 2014-11-04 Cisco Technology, Inc. Event triggered traceroute for optimized routing in a computer network
US7801177B2 (en) 2008-02-25 2010-09-21 Telcordia Technologies, Inc. Method for equitable bandwidth allocation for content distribution networks
US20090222344A1 (en) 2008-02-28 2009-09-03 Palo Alto Research Center Incorporated Receptive opportunity presentation of activity-based advertising
US7856506B2 (en) 2008-03-05 2010-12-21 Sony Computer Entertainment Inc. Traversal of symmetric network address translator for multiple simultaneous connections
US9323837B2 (en) 2008-03-05 2016-04-26 Ying Zhao Multiple domain anomaly detection system and method using fusion rule and visualization
US8559334B2 (en) 2008-03-28 2013-10-15 Telefonaktiebolaget L M Ericsson (Publ) End-to end inter-domain routing
US7873619B1 (en) 2008-03-31 2011-01-18 Emc Corporation Managing metadata
US9762692B2 (en) 2008-04-04 2017-09-12 Level 3 Communications, Llc Handling long-tail content in a content delivery network (CDN)
US8521512B2 (en) 2008-04-30 2013-08-27 Deep Sky Concepts, Inc Systems and methods for natural language communication with a computer
US8340131B2 (en) 2008-05-05 2012-12-25 Sentilla Corporation, Inc. Efficient broadcast of data in a communication network
US8909190B2 (en) 2008-05-13 2014-12-09 Dale Carson Portable wireless compatibility detection, location and communication device
US9071498B2 (en) 2008-05-15 2015-06-30 Telsima Corporation Systems and methods for fractional routing redundancy
US9456054B2 (en) 2008-05-16 2016-09-27 Palo Alto Research Center Incorporated Controlling the spread of interests and content in a content centric network
US8386622B2 (en) 2008-05-16 2013-02-26 Palo Alto Research Center Incorporated Method and apparatus for facilitating communication in a content centric network
US8776176B2 (en) 2008-05-16 2014-07-08 Oracle America, Inc. Multi-factor password-authenticated key exchange
US20090288076A1 (en) 2008-05-16 2009-11-19 Mark Rogers Johnson Managing Updates In A Virtual File System
US8165118B2 (en) 2008-05-19 2012-04-24 Palo Alto Research Center Incorporated Voice over content centric networks
US20090293121A1 (en) 2008-05-21 2009-11-26 Bigus Joseph P Deviation detection of usage patterns of computer resources
US8214364B2 (en) 2008-05-21 2012-07-03 International Business Machines Corporation Modeling user access to computer resources
US20090300714A1 (en) 2008-05-27 2009-12-03 Open Invention Network Llc Privacy engine and method of use in a user-centric identity management system
US8065559B2 (en) 2008-05-29 2011-11-22 Citrix Systems, Inc. Systems and methods for load balancing via a plurality of virtual servers upon failover using metrics from a backup virtual server
US8170990B2 (en) 2008-05-30 2012-05-01 Hitachi, Ltd. Integrated remote replication in hierarchical storage systems
US8583602B2 (en) 2008-06-05 2013-11-12 Palm, Inc. Restoring of data to mobile computing device
US8244681B2 (en) 2008-06-09 2012-08-14 Symantec Operating Corporation Creating synthetic backup images on a remote computer system
US8280833B2 (en) 2008-06-12 2012-10-02 Guardian Analytics, Inc. Fraud detection and analysis
US8165091B2 (en) 2008-06-27 2012-04-24 Nix John A Efficient handover of media communications in heterogeneous IP networks using LAN profiles and network handover rules
US8060513B2 (en) 2008-07-01 2011-11-15 Dossierview Inc. Information processing with integrated semantic contexts
US7801069B2 (en) 2008-07-02 2010-09-21 Hewlett-Packard Development Company, L.P. Distribution of packets among a plurality of nodes
EP2147717A1 (de) 2008-07-25 2010-01-27 Basf Se Dispergierhilfsmittel für die Emulsions- und Suspensionspolymerisation
US8289867B2 (en) 2008-08-01 2012-10-16 Qualcomm Atheros, Inc. Message routing mechanism for communication networks
JP2011530849A (ja) 2008-08-08 2011-12-22 アルカテル−ルーセント ユーザ・サービス向上のためのｓｉｐフォーキングへの拡張
US8862776B2 (en) 2008-08-27 2014-10-14 Motorola Mobility Llc Communication network and method of operation therefor
US8261273B2 (en) 2008-09-02 2012-09-04 International Business Machines Corporation Assigning threads and data of computer program within processor having hardware locality groups
US8069023B1 (en) 2008-09-02 2011-11-29 Juniper Networks, Inc. Hardware support for instruction set emulation
US20100100465A1 (en) 2008-10-17 2010-04-22 Innovapost Inc. Trusted third party authentication and notarization for email
US9392437B2 (en) 2008-10-17 2016-07-12 Alcatel Lucent Method and system for IP multimedia bearer path optimization through a succession of border gateways
EP2356803A1 (de) 2008-10-20 2011-08-17 Telefonaktiebolaget L M Ericsson (PUBL) Verfahren und einrichtungen für einen client-knoten zum zugriff auf ein informationsobjekt, das sich in einem knoten eines gesicherten netzwerks befindet, über ein netzwerk von informationen
US8130654B2 (en) 2008-10-29 2012-03-06 Palo Alto Research Center Incorporated Context-aware packet switching
AU2009322102B2 (en) 2008-11-04 2015-02-19 Securekey Technologies Inc. System and methods for online authentication
US8228848B2 (en) 2008-11-17 2012-07-24 Sierra Wireless, Inc. Method and apparatus for facilitating push communication across a network boundary
US8060616B1 (en) 2008-11-17 2011-11-15 Amazon Technologies, Inc. Managing CDN registration by a storage provider
US20100125911A1 (en) 2008-11-17 2010-05-20 Prakash Bhaskaran Risk Scoring Based On Endpoint User Activities
US8782256B2 (en) 2008-11-26 2014-07-15 Cisco Technology, Inc. Deterministic session load-balancing and redundancy of access servers in a computer network
US7936754B2 (en) 2008-12-12 2011-05-03 At&T Intellectual Property I, L.P. Methods and apparatus to dynamically store network routes for a communication network
CN102318257B (zh) 2008-12-15 2016-02-24 瑞典爱立信有限公司 用于信息网络的密钥分发方案
US8385326B2 (en) 2008-12-29 2013-02-26 Microsoft Corporation Handling early media in VoIP communication with multiple endpoints
US8010691B2 (en) 2008-12-29 2011-08-30 Cisco Technology, Inc. Content tagging of media streams
US7945663B2 (en) 2008-12-29 2011-05-17 Genband Inc. Systems, methods, and computer program products for adaptively adjusting a registration interval of an endpoint
US8341720B2 (en) 2009-01-09 2012-12-25 Microsoft Corporation Information protection applied by an intermediary device
TW201029413A (en) 2009-01-21 2010-08-01 Univ Nat Taipei Technology NAT traversal method in Session Initial Protocol
US20140075567A1 (en) 2009-01-28 2014-03-13 Headwater Partners I Llc Service Processor Configurations for Enhancing or Augmenting System Software of a Mobile Communications Device
US8160069B2 (en) 2009-01-30 2012-04-17 Palo Alto Research Center Incorporated System for forwarding a packet with a hierarchically structured variable-length identifier
US8204060B2 (en) 2009-01-30 2012-06-19 Palo Alto Research Center Incorporated Method and system for facilitating forwarding a packet in a content-centric network
US8243735B2 (en) 2009-01-30 2012-08-14 Palo Alto Research Center Incorporated System for forwarding packets with hierarchically structured variable-length identifiers using an exact-match lookup engine
US9282106B2 (en) 2009-02-20 2016-03-08 Comcast Cable Communications, Llc Authenticated communication between security devices
US8000267B2 (en) 2009-02-24 2011-08-16 Palo Alto Research Center Incorporated Network routing with path identifiers
US7941551B2 (en) 2009-02-25 2011-05-10 Microsoft Corporation Tunneling of remote desktop sessions through firewalls
CA2695103A1 (en) 2009-02-26 2010-08-26 Research In Motion Limited System and method of handling encrypted backup data
US8688619B1 (en) 2009-03-09 2014-04-01 Reservoir Labs Systems, methods and apparatus for distributed decision processing
JP4920052B2 (ja) 2009-03-11 2012-04-18 株式会社日立製作所 通信システム及びサーバ
US8149851B2 (en) 2009-03-16 2012-04-03 Sling Media, Inc. Mediated network address translation traversal
US8225057B1 (en) 2009-03-24 2012-07-17 Netapp, Inc. Single-system configuration for backing-up and restoring a clustered storage system
US8477689B2 (en) 2009-03-26 2013-07-02 The John Hopkins University System and methods for distributed medium access control and QOS scheduling in mobile ad-hoc networks
US8260742B2 (en) 2009-04-03 2012-09-04 International Business Machines Corporation Data synchronization and consistency across distributed repositories
US20120117585A1 (en) 2009-04-29 2012-05-10 Eloy Technology, Llc Method and system for applying content restrictions to renderers in identified network viewing areas
US8578076B2 (en) 2009-05-01 2013-11-05 Citrix Systems, Inc. Systems and methods for establishing a cloud bridge between virtual storage resources
US9444720B2 (en) 2009-05-05 2016-09-13 Ciena Corporation Method and apparatus for multicast implementation in a routed ethernet mesh network
US8009682B2 (en) 2009-05-05 2011-08-30 Citrix Systems, Inc. Systems and methods for packet steering in a multi-core architecture
WO2010128421A2 (en) 2009-05-05 2010-11-11 Koninklijke Philips Electronics N.V. Method for securing communications in a wireless network, and resource-restricted device therefor
EP2438741A4 (de) 2009-06-03 2014-06-04 Ericsson Telefon Ab L M Verfahren und knoten zum finden von inhalt in einem inhaltsverteilungsnetzwerk und verfahren zur erzeugung einer virtuellen darstellung eines inhaltsverteilungsnetzwerks
US8284776B2 (en) 2009-06-10 2012-10-09 Broadcom Corporation Recursive packet header processing
US8898247B2 (en) 2009-06-17 2014-11-25 Telefonaktiebolaget L M Ericsson (Publ) Network cache architecture storing pointer information in payload data segments of packets
US8121135B2 (en) 2009-06-23 2012-02-21 Juniper Networks, Inc. Discovering path maximum transmission unit size
WO2011001630A1 (ja) 2009-06-30 2011-01-06 パナソニック株式会社 データ交換処理装置およびデータ交換処理方法
IES20090506A2 (en) 2009-07-02 2009-12-09 Newbay Res Ltd A challenge-response system and method
US20140156396A1 (en) 2009-07-09 2014-06-05 Cubic Corporation Techniques in transit advertising
US8762707B2 (en) 2009-07-14 2014-06-24 At&T Intellectual Property I, L.P. Authorization, authentication and accounting protocols in multicast content distribution networks
CN101599901B (zh) 2009-07-15 2011-06-08 杭州华三通信技术有限公司 远程接入mpls vpn的方法、系统和网关
US8914720B2 (en) 2009-07-31 2014-12-16 Xerox Corporation Method and system for constructing a document redundancy graph
TWI408936B (zh) 2009-09-02 2013-09-11 Ind Tech Res Inst 網路穿透方法及網路通訊系統
US8789173B2 (en) 2009-09-03 2014-07-22 Juniper Networks, Inc. Protecting against distributed network flood attacks
JP5061166B2 (ja) 2009-09-04 2012-10-31 Ｋｉｉ株式会社 データ同期システムおよびデータ同期方法
US20110060717A1 (en) 2009-09-08 2011-03-10 George Forman Systems and methods for improving web site user experience
US8248925B2 (en) 2009-09-08 2012-08-21 Rockstar Bidco, LP Method and apparatus for selecting between multiple equal cost paths
US8352396B2 (en) 2009-09-08 2013-01-08 Hewlett-Packard Development Company, L.P. Systems and methods for improving web site user experience
GB0916239D0 (en) 2009-09-16 2009-10-28 Vodafone Plc Internet breakout in HNB/Femto, UMTS and LTE networks
US8239331B2 (en) 2009-09-18 2012-08-07 Google Inc. Auction verification
US8880682B2 (en) 2009-10-06 2014-11-04 Emc Corporation Integrated forensics platform for analyzing IT resources consumed to derive operational and architectural recommendations
US8606554B2 (en) 2009-10-19 2013-12-10 Siemens Aktiengesellschaft Heat flow model for building fault detection and diagnosis
US8923293B2 (en) 2009-10-21 2014-12-30 Palo Alto Research Center Incorporated Adaptive multi-interface use for content networking
US8805787B2 (en) 2009-10-30 2014-08-12 Verizon Patent And Licensing Inc. Network architecture for content backup, restoring, and sharing
US20120137367A1 (en) 2009-11-06 2012-05-31 Cataphora, Inc. Continuous anomaly detection based on behavior modeling and heterogeneous information analysis
US8930991B2 (en) 2009-11-19 2015-01-06 Gregory Philpott System and method for delivering content to mobile devices
KR101306667B1 (ko) 2009-12-09 2013-09-10 한국전자통신연구원 지식 그래프 정제 장치 및 방법
US8605657B2 (en) 2009-12-18 2013-12-10 Electronics And Telecommunications Research Institute Mesh routing method and mesh routing apparatus in beacon enabled wireless AD-HOC networks
US8412832B2 (en) 2009-12-23 2013-04-02 Citrix Systems, Inc. Systems and methods for GSLB MEP connection management across multiple core appliances
KR101566883B1 (ko) 2009-12-29 2015-11-09 삼성전자주식회사 콘텐츠 명 기반의 네트워크 장치 및 데이터 요청 방법
EP2531969A4 (de) 2010-02-01 2013-12-04 Jumptap Inc Integriertes werbungssystem
US8725895B2 (en) 2010-02-15 2014-05-13 Damaka, Inc. NAT traversal by concurrently probing multiple candidates
US8676914B2 (en) 2010-03-04 2014-03-18 Canon Kabushiki Kaisha Synchronizing services across network nodes
US20110219427A1 (en) 2010-03-04 2011-09-08 RSSBus, Inc. Smart Device User Authentication
US8769155B2 (en) 2010-03-19 2014-07-01 Brocade Communications Systems, Inc. Techniques for synchronizing application object instances
US8607279B2 (en) 2010-03-23 2013-12-10 Qualcomm Incorporated Induced sleep intervals for devices receiving bursty non-real time broadcast flows
JP5553668B2 (ja) 2010-04-14 2014-07-16 株式会社ソニー・コンピュータエンタテインメント 情報検索方法、情報検索サーバ、および情報検索システム
US8375436B2 (en) 2010-04-22 2013-02-12 Palo Alto Research Center Incorporated Session migration over content-centric networks
US8504718B2 (en) 2010-04-28 2013-08-06 Futurewei Technologies, Inc. System and method for a context layer switch
US9811532B2 (en) 2010-05-03 2017-11-07 Panzura, Inc. Executing a cloud command for a distributed filesystem
KR101688857B1 (ko) 2010-05-13 2016-12-23 삼성전자주식회사 컨텐츠 중심 네트워크(ｃｃｎ)에서 단말 및 허브의 통신 방법 및 컨텐츠 중심 네트워크를 위한 단말
US9491085B2 (en) 2010-05-24 2016-11-08 At&T Intellectual Property I, L.P. Methods and apparatus to route control packets based on address partitioning
US9521621B2 (en) 2010-06-02 2016-12-13 Qualcomm Incorporated Application-proxy support over a wireless link
CA2714227C (en) 2010-06-18 2011-10-25 Guest Tek Interactive Entertainment Ltd. User-profile server for providing user-tailored entertainment experience across different entertainment devices and method thereof
US8677451B1 (en) 2010-06-22 2014-03-18 Cellco Partnership Enabling seamless access to a domain of an enterprise
WO2012001877A1 (ja) 2010-07-01 2012-01-05 パナソニック株式会社 コンテンツ送受信システム
US8817594B2 (en) 2010-07-13 2014-08-26 Telefonaktiebolaget L M Ericsson (Publ) Technique establishing a forwarding path in a network system
US9262531B2 (en) 2010-07-23 2016-02-16 Applied Minds, Llc System and method for chat message prioritization and highlighting
WO2012014100A1 (en) 2010-07-26 2012-02-02 Telefonaktiebolaget L M Ericsson (Publ) Node and method for computing forwarding trees to distribute traffic in a network
US8244881B2 (en) 2010-08-06 2012-08-14 Palo Alto Research Center Incorporated Service virtualization over content-centric networks
US8553562B2 (en) 2010-09-08 2013-10-08 Telefonaktiebolaget L M Ericsson (Publ) Automated traffic engineering for multi-protocol label switching (MPLS) with link utilization as feedback into the tie-breaking mechanism
CN102404609A (zh) 2010-09-15 2012-04-04 日立民用电子株式会社 发送装置及接收装置
US9378245B2 (en) 2010-10-18 2016-06-28 Nec Corporation Name database server, name resolution system, entry search method and entry search program
CN102143199A (zh) 2010-10-19 2011-08-03 华为技术有限公司 获取内容的方法、节点及内容网络
US20120102136A1 (en) 2010-10-21 2012-04-26 Lancaster University Data caching system
US8634297B2 (en) 2010-11-01 2014-01-21 Cisco Technology, Inc. Probing specific customer flow in layer-2 multipath networks
US20140181140A1 (en) 2010-11-15 2014-06-26 Samsung Electronics Co., Ltd. Terminal device based on content name, and method for routing based on content name
US8671221B2 (en) 2010-11-17 2014-03-11 Hola Networks Ltd. Method and system for increasing speed of domain name system resolution within a computing device
KR20120054902A (ko) 2010-11-22 2012-05-31 한국전자통신연구원 연결성이 결여된 네트워크 환경 기반 멀티캐스트 통신방법, 장치 및 그 시스템
EP2458548A1 (de) 2010-11-30 2012-05-30 France Telecom System und Verfahren zur Implementierung von dynamischen Zugriffssteuerungsregeln für persönliche Cloudinformationen
KR20120058782A (ko) 2010-11-30 2012-06-08 삼성전자주식회사 컨텐츠 중심 네트워킹 환경에서의 단말, 중간 노드 및 이들의 통신 방법
AU2011340125B2 (en) 2010-12-09 2015-05-21 Allot Communications Ltd. Device, system and method of traffic detection
US8751664B2 (en) 2010-12-16 2014-06-10 Palo Alto Research Center Incorporated Custodian-based routing in content-centric networks
EP2466810B1 (de) 2010-12-17 2015-09-23 Alcatel Lucent Verfahren und Router für ein dienstabhängiges Routing
KR20120070410A (ko) 2010-12-21 2012-06-29 한국전자통신연구원 통신 노드 및 통신 방법
US10304066B2 (en) 2010-12-22 2019-05-28 Facebook, Inc. Providing relevant notifications for a user based on location and social information
EP2668760B1 (de) 2011-01-25 2015-07-01 Interdigital Patent Holdings, Inc. Verfahren und vorrichtung zum automatischen erkennen und abrufen von inhalt basierend auf inhaltsidentität
US9444701B2 (en) 2011-01-27 2016-09-13 Hewlett Packard Enterprise Development Lp Identifying remote machine operating system
US20120197690A1 (en) 2011-01-31 2012-08-02 Agulnek Jeremy S Method of Operating a Navigation System to Provide Advertisements
CN103597292B (zh) 2011-02-28 2016-05-18 艾默生电气公司 用于建筑物的供暖、通风和空调hvac系统的监视系统和监视方法
KR20120100046A (ko) 2011-03-02 2012-09-12 삼성전자주식회사 분산 환경 네트워크에서 컨텐츠의 접근 제어를 위한 장치 및 방법
US8554951B2 (en) 2011-03-08 2013-10-08 Rackspace Us, Inc. Synchronization and ordering of multiple accessess in a distributed system
WO2012124035A1 (ja) 2011-03-11 2012-09-20 富士通株式会社 通信装置および通信方法
FR2972884A1 (fr) 2011-03-15 2012-09-21 France Telecom Procede de communication dans un reseau de communication avec acheminement par nom
US8705363B2 (en) 2011-04-05 2014-04-22 Telefonaktiebolaget L M Ericsson (Publ) Packet scheduling method and apparatus
US8462781B2 (en) 2011-04-06 2013-06-11 Anue Systems, Inc. Systems and methods for in-line removal of duplicate network packets
TW201312980A (zh) 2011-05-03 2013-03-16 Interdigital Patent Holdings 在網際網路中內容識別、檢索及路由
US9038172B2 (en) 2011-05-06 2015-05-19 The Penn State Research Foundation Robust anomaly detection and regularized domain adaptation of classifiers with application to internet packet-flows
US8224894B1 (en) 2011-05-09 2012-07-17 Google Inc. Zero-click sharing of application context across devices
US20120291102A1 (en) 2011-05-09 2012-11-15 Google Inc. Permission-based administrative controls
US9225628B2 (en) 2011-05-24 2015-12-29 Mellanox Technologies Ltd. Topology-based consolidation of link state information
TW201720194A (zh) 2011-06-01 2017-06-01 內數位專利控股公司 內融傳遞網路互連(cdni)機制
US8837277B2 (en) 2011-06-01 2014-09-16 Cisco Technology, Inc. Source routing convergence in constrained computer networks
US8667172B2 (en) * 2011-06-07 2014-03-04 Futurewei Technologies, Inc. Method and apparatus for content identifier based radius constrained cache flooding to enable efficient content routing
KR20120136507A (ko) 2011-06-09 2012-12-20 삼성전자주식회사 네임 기반의 네트워크 시스템에서 펜딩 테이블의 오버플로우를 방지하는 노드 장치 및 방법
US8332357B1 (en) 2011-06-10 2012-12-11 Microsoft Corporation Identification of moved or renamed files in file synchronization
US8769705B2 (en) 2011-06-10 2014-07-01 Futurewei Technologies, Inc. Method for flexible data protection with dynamically authorized data receivers in a content network or in cloud storage and content delivery services
KR20120137726A (ko) 2011-06-13 2012-12-24 삼성전자주식회사 컨텐츠 기반 네트워크(ｃｃｎ)에서 전송 노드, 수신 노드 및 그 통신 방법
WO2012177681A2 (en) 2011-06-20 2012-12-27 Aces & Eights Corporation Systems and methods for digital forensic triage
US20120323933A1 (en) 2011-06-20 2012-12-20 Microsoft Corporation Displaying notifications based on importance to the user
WO2013000165A1 (en) 2011-06-30 2013-01-03 France Telecom Research & Development Beijing Company Limited Data routing
US9218216B2 (en) 2011-07-22 2015-12-22 Cisco Technology, Inc. Centrally driven performance analysis of low power and Lossy Networks
WO2013014672A1 (en) 2011-07-26 2013-01-31 Light Cyber Ltd A method for detecting anomaly action within a computer network
US8654649B2 (en) 2011-07-27 2014-02-18 Cisco Technology, Inc. Reduced topology routing in shared media communication networks
US8836536B2 (en) 2011-07-29 2014-09-16 Hewlett-Packard Development Company, L. P. Device characterization system and methods
KR101797221B1 (ko) 2011-07-29 2017-11-14 삼성전자주식회사 컨텐츠 중심 네트워크에서 컨텐츠 소스 노드 및 제1 컨텐츠 라우터와 그 통신 방법
JP6080313B2 (ja) 2011-08-04 2017-02-15 ミドクラ エスエーアールエル 仮想ネットワークを実装及び管理するシステム及び方法
CN103348623B (zh) 2011-08-26 2016-06-29 松下电器产业株式会社 终端装置、验证装置、密钥分发装置、内容再现方法及密钥分发方法
US8873409B2 (en) 2011-08-30 2014-10-28 Cisco Technology, Inc. Installing and using a subset of routes for forwarding packets
US8694675B2 (en) * 2011-09-01 2014-04-08 Futurewei Technologies, Inc. Generalized dual-mode data forwarding plane for information-centric network
US8862774B2 (en) 2011-09-12 2014-10-14 Cisco Technology, Inc. Dynamic keepalive parameters for reverse path validation in computer networks
JP5804504B2 (ja) 2011-09-15 2015-11-04 日本電気株式会社 マルチホップ無線ネットワークの経路制御方法
US8699350B1 (en) 2011-09-15 2014-04-15 Google Inc. Optimizing traffic in a data network
US9026560B2 (en) 2011-09-16 2015-05-05 Cisco Technology, Inc. Data center capability summarization
US8762752B2 (en) 2011-09-20 2014-06-24 American Megatrends, Inc. System and method for remotely managing electric power usage of target computers
KR20130031660A (ko) 2011-09-21 2013-03-29 삼성전자주식회사 컨텐츠 이름 기반의 네트워크 장치 및 컨텐츠 이름 생성 방법, 그리고 인증 방법
US20130090942A1 (en) 2011-10-11 2013-04-11 Safe-Link, Llc Sytem and method for preventing healthcare fraud
US8793790B2 (en) 2011-10-11 2014-07-29 Honeywell International Inc. System and method for insider threat detection
US20130110987A1 (en) 2011-10-31 2013-05-02 Electronics And Telecommunications Research Institute Apparatus and method for providing content location information using ospf opaque lsa
KR20130048032A (ko) 2011-11-01 2013-05-09 한국전자통신연구원 컨텐츠 중심 네트워크에서 라우팅 방법
US8447851B1 (en) 2011-11-10 2013-05-21 CopperEgg Corporation System for monitoring elastic cloud-based computing systems as a service
JP5786670B2 (ja) 2011-11-17 2015-09-30 ソニー株式会社 情報処理装置、情報記憶装置、情報処理システム、および情報処理方法、並びにプログラム
FR2982974A1 (fr) 2011-11-22 2013-05-24 France Telecom Procede de traitement d'une requete dans un reseau de communication centre sur les informations
US8547982B2 (en) 2011-11-23 2013-10-01 King Fahd University Of Petroleum And Minerals Wireless sensor network with energy efficient protocols
US8549612B2 (en) 2011-11-28 2013-10-01 Dell Products, Lp System and method for incorporating quality-of-service and reputation in an intrusion detection and prevention system
CN103988458B (zh) 2011-12-09 2017-11-17 华为技术有限公司 基于内容中心网络的网络中编码网络报文的方法
US8769524B2 (en) 2011-12-09 2014-07-01 Disney Enterprises, Inc. HTML directed adaptive features for mobile applications
EP2792100B1 (de) 2011-12-15 2020-07-29 Intel Corporation Verfahren und vorrichtung für sichere kommunikation über ein netzwerk mit einer hardware-sicherheits-engine
WO2013091186A1 (zh) 2011-12-21 2013-06-27 中国科学院自动化研究所 多参数三维磁共振图像脑肿瘤分割方法
KR20130085558A (ko) 2011-12-21 2013-07-30 삼성전자주식회사 컨텐츠 중심 네트워크에서 인터리스트 메시지 및 데이터 메시지를 우선 순위에 따라 처리하는 방법
US8718064B2 (en) 2011-12-22 2014-05-06 Telefonaktiebolaget L M Ericsson (Publ) Forwarding element for flexible and extensible flow processing software-defined networks
KR101913313B1 (ko) 2011-12-28 2018-10-31 삼성전자주식회사 게이트웨이에서 인터넷 프로토콜 기반 네트워크를 이용하여 컨텐츠 중심 네트워크를 구현하는 방법 및 그 게이트웨이
US9349103B2 (en) 2012-01-09 2016-05-24 DecisionQ Corporation Application of machine learned Bayesian networks to detection of anomalies in complex systems
KR20130093812A (ko) 2012-01-12 2013-08-23 삼성전자주식회사 컨텐츠 중심 네트워크에서 트래픽 전송량을 제어하기 위한 컨텐츠 라우터의 통신 방법 및 그 컨텐츠 라우터
KR20130093813A (ko) 2012-01-12 2013-08-23 삼성전자주식회사 컨텐츠 중심 네트워크에서 컨텐츠의 세그먼트를 프리패칭하는 대상 노드의 통신 방법 및 그 대상 노드
US8718055B2 (en) 2012-01-25 2014-05-06 Cisco Technology, Inc. Fast-tracking approach for building routing topologies in fast-moving networks
US20130197698A1 (en) 2012-01-26 2013-08-01 Carrier Corporation HVAC System Fault Root Cause Self-Determination
US8874671B2 (en) 2012-02-10 2014-10-28 Blackberry Limited Electronic message metering and traffic management in a networked environment
RU2631213C2 (ru) 2012-02-13 2017-09-19 Санофи-Авентис Дойчланд Гмбх Инъекционное устройство типа шприца-ручки и электронный прикрепляемый модуль для упомянутого устройства
CN104115472B (zh) 2012-02-16 2017-06-20 华为技术有限公司 用于内容导向网络中可扩展路由的方法
US9137152B2 (en) 2012-02-16 2015-09-15 Futurewei Technologies, Inc. Method for scalable routing in content-oriented networks
US20130219038A1 (en) 2012-02-17 2013-08-22 Electronics And Telecommunications Research Institute Router based on core score and method for setting core score and providing and searching content information therein
US8762570B2 (en) 2012-02-21 2014-06-24 Futurewei Technologies, Inc. Method and apparatus for adaptive forwarding strategies in content-centric networking
US9621458B2 (en) 2012-02-21 2017-04-11 Qualcomm Incorporated Internet routing over a service-oriented architecture bus
US8949959B2 (en) 2012-02-21 2015-02-03 Cisco Technology, Inc. Reduced authentication times for shared-media network migration
CA2865697C (en) 2012-02-28 2018-01-09 Jeffrey N. Arensmeier Hvac system remote monitoring and diagnosis
US8762477B2 (en) 2012-02-28 2014-06-24 Futurewei Technologies, Inc. Method for collaborative caching for content-oriented networks
US9049251B2 (en) 2012-02-28 2015-06-02 Futurewei Technologies, Inc. Method and apparatus for internet protocol based content router
US9253021B2 (en) 2012-02-28 2016-02-02 Cisco Technology, Inc. Hierarchical schema to provide an aggregated view of device capabilities in a network
US9270584B2 (en) 2012-02-28 2016-02-23 Cisco Technology, Inc. Diverse paths using a single source route in computer networks
EP2634991B1 (de) 2012-02-28 2017-08-02 Alcatel Lucent Inhaltzentriertes Netzwerken
US20140082661A1 (en) 2012-03-06 2014-03-20 Google Inc. Low latency video storyboard delivery with selectable resolution levels
US9729669B2 (en) 2012-03-15 2017-08-08 Alcatel Lucent Method and system for fast and large-scale longest prefix matching
US9119130B2 (en) 2012-03-23 2015-08-25 Cisco Technology, Inc. Proactive link-estimation in reactive routing networks
WO2013143137A1 (en) 2012-03-31 2013-10-03 France Telecom Research & Development Beijing Company Limited Content centric m2m system
US20130262365A1 (en) 2012-03-31 2013-10-03 Sharp Kabushiki Kaisha Educational system, method and program to adapt learning content based on predicted user reaction
WO2013155484A1 (en) 2012-04-13 2013-10-17 Huawei Technologies Co., Ltd. Synchronizing content tables between routers
US9237190B2 (en) 2012-04-18 2016-01-12 Samsung Electronics Co., Ltd. Node and method for generating shortened name robust against change in hierarchical name in content-centric network (CCN)
US9515920B2 (en) 2012-04-20 2016-12-06 Futurewei Technologies, Inc. Name-based neighbor discovery and multi-hop service discovery in information-centric networks
US9253087B2 (en) 2012-04-24 2016-02-02 Futurewei Technologies, Inc. Principal-identity-domain based naming scheme for information centric networks
KR20130140932A (ko) 2012-05-08 2013-12-26 한국전자통신연구원 네트워크 경로 계산장치, 콘텐츠 요청노드, 중계노드 및 이를 포함하는 정보 중심 네트워크 시스템과 이를 이용한 네트워크 경로 계산방법
US9280610B2 (en) 2012-05-14 2016-03-08 Apple Inc. Crowd sourcing information to fulfill user requests
EP2856349A1 (de) 2012-06-01 2015-04-08 Thomson Licensing Verfahren zur datenspeicherung und datensynchronisation in einem verteilten datenspeicherungssystem
US9235867B2 (en) 2012-06-04 2016-01-12 Microsoft Technology Licensing, Llc Concurrent media delivery
KR101909666B1 (ko) 2012-06-08 2018-10-19 삼성전자주식회사 모바일 컨텐츠 센트릭 네트워크에서 핸드오버를 위한 방법 및 장치
US8972969B2 (en) 2012-06-08 2015-03-03 Adobe Systems Incorporated Out of band services updates
US8887215B2 (en) 2012-06-11 2014-11-11 Rgb Networks, Inc. Targeted high-value content in HTTP streaming video on demand
US20130339481A1 (en) 2012-06-11 2013-12-19 Samsung Electronics Co., Ltd. Method for content discovery of node in intra-domain and inter-domain in content centric network and node therefor
US8817591B2 (en) 2012-06-15 2014-08-26 Cisco Technology, Inc. Inter-domain signaling to update remote path computation elements after a call set-up failure
US9203734B2 (en) 2012-06-15 2015-12-01 Infosys Limited Optimized bi-directional communication in an information centric network
US8848741B2 (en) 2012-06-21 2014-09-30 Breakingpoint Systems, Inc. High-speed CLD-based TCP segmentation offload
US9112895B1 (en) 2012-06-25 2015-08-18 Emc Corporation Anomaly detection system for enterprise network security
US9143557B2 (en) 2012-06-27 2015-09-22 Juniper Networks, Inc. Feedback loop for service engineered paths
CN104335530B (zh) 2012-06-29 2017-09-22 英特尔公司 用于网络元件的网络路由协议节能方法和装置
CN104145292A (zh) 2012-07-13 2014-11-12 三星电子株式会社 用于基于内容名称提供内容和实时流传输内容的内容请求器和内容提供器的通信方法
US20140032714A1 (en) 2012-07-27 2014-01-30 Interdigital Patent Holdings, Inc. Method and apparatus for publishing location information for a content object
US9485174B2 (en) 2012-07-30 2016-11-01 Cisco Technology, Inc. Routing using cached source routes from message headers
US8934496B2 (en) 2012-07-30 2015-01-13 Cisco Technology, Inc. Reactive and proactive routing protocol interoperation in low power and lossy networks
EP2885904B1 (de) 2012-08-03 2018-04-25 Vasco Data Security International GmbH Für den benutzer bequeme authentifizierungsverfahren und -einrichtung, anhand einer mobilen authentifizierungsanwendung
US10599830B2 (en) 2012-08-08 2020-03-24 Northend Systems Bv System and method for controlled decentralized authorization and access for electronic records
WO2014023072A1 (zh) 2012-08-09 2014-02-13 Wen Xia 淤泥固化系统
US8958327B2 (en) 2012-08-10 2015-02-17 Cisco Technology, Inc. Passive network latency monitoring
US8937865B1 (en) 2012-08-21 2015-01-20 Juniper Networks, Inc. Scheduling traffic over aggregated bundles of links
WO2014036605A1 (en) 2012-09-05 2014-03-13 Blocks Global P/L Technology adapted to enable devices for delivering data in a lockdown mode, methods for operating such devices, and reporting on activity at tablet devices that provide remote content
US9621620B2 (en) 2012-09-14 2017-04-11 Electronics And Telecommunications Research Institute Apparatus and method for providing content with a distributed architecture, and system for providing content with the said apparatus
KR20140044982A (ko) 2012-09-21 2014-04-16 한국전자통신연구원 홉 카운트 기반 콘텐츠 캐싱 방법 및 그 네트워크 엔티티
US9081763B2 (en) 2012-10-16 2015-07-14 Sap Se Ranking in cascading learning system
US9015212B2 (en) 2012-10-16 2015-04-21 Rackspace Us, Inc. System and method for exposing cloud stored data to a content delivery network
US9202384B2 (en) 2012-10-31 2015-12-01 D2L Corporation System and method for gating notifications
US9154370B2 (en) 2012-11-05 2015-10-06 Cisco Technology, Inc. Seamless multipath retransmission using source-routed tunnels
US9098353B2 (en) 2012-11-13 2015-08-04 Netronome Systems, Inc. Transactional memory that performs a split 32-bit lookup operation
US9088511B2 (en) 2012-11-19 2015-07-21 Intel Corporation Multi-hop error recovery
KR20140067337A (ko) 2012-11-26 2014-06-05 삼성전자주식회사 컨텐츠 네임 암호화 시스템
KR101965794B1 (ko) 2012-11-26 2019-04-04 삼성전자주식회사 Ip 라우팅 호환을 위한 패킷의 구조, 네트워크 노드의 통신 방법 및 그 네트워크 노드
KR101355767B1 (ko) 2012-12-13 2014-02-05 성균관대학교산학협력단 콘텐츠 중심 네트워크 환경에서의 동등 계층 간 그룹 통신 방법
US9769034B2 (en) 2012-12-14 2017-09-19 Futurewei Technologies, Inc. Method and apparatus for policy based routing in information centric networking based home networks
US20140172783A1 (en) 2012-12-17 2014-06-19 Prowess Consulting, Llc System and method for providing computing environment delivery service with offline operations
US8977596B2 (en) 2012-12-21 2015-03-10 Zetta Inc. Back up using locally distributed change detection
US20140195328A1 (en) 2013-01-04 2014-07-10 Ron Ferens Adaptive embedded advertisement via contextual analysis and perceptual computing
US10194414B2 (en) 2013-01-07 2019-01-29 Futurewei Technologies, Inc. Information centric networking based service centric networking
EP2932694B1 (de) 2013-01-07 2017-08-23 Huawei Technologies Co., Ltd. Busschiene mit kontextinformationen
KR101978173B1 (ko) 2013-01-18 2019-05-14 삼성전자주식회사 컨텐츠 중심 네트워크에서 컨텐츠 제공자가 데이터 패킷을 전송하는 방법 및 그 컨텐츠 제공자
US9264505B2 (en) 2013-01-31 2016-02-16 Hewlett Packard Enterprise Development Lp Building a semantics graph for an enterprise communication network
US9356827B2 (en) 2013-02-18 2016-05-31 Comcast Cable Communications, Llc Data center node management
US9009465B2 (en) 2013-03-13 2015-04-14 Futurewei Technologies, Inc. Augmenting name/prefix based routing protocols with trust anchor in information-centric networks
US10742601B2 (en) 2013-03-14 2020-08-11 Fortinet, Inc. Notifying users within a protected network regarding events and information
US20140280823A1 (en) 2013-03-14 2014-09-18 Alcatel-Lucent Wire-speed pending interest table
US9847979B2 (en) 2013-03-15 2017-12-19 Verimatrix, Inc. Security and key management of digital content
US9978025B2 (en) 2013-03-20 2018-05-22 Cisco Technology, Inc. Ordered-element naming for name-based packet forwarding
US9367676B2 (en) 2013-03-22 2016-06-14 Nok Nok Labs, Inc. System and method for confirming location using supplemental sensor and/or location data
CN104322020B (zh) 2013-03-26 2019-01-01 松下电器产业株式会社 服务器、路由器、接收终端及处理方法
WO2014157886A1 (en) 2013-03-27 2014-10-02 Samsung Electronics Co., Ltd. Method and device for executing application
US9507607B2 (en) 2013-05-10 2016-11-29 Vmware, Inc. Virtual persistence
KR102052520B1 (ko) 2013-06-11 2019-12-05 삼성전자주식회사 컨텐츠 중심 네트워크에서 컨텐츠의 이동성을 지원하기 위한 노드의 통신 방법 및 노드
US9628400B2 (en) 2013-07-24 2017-04-18 Cisco Technology, Inc. Interest forwarding for interactive client anonymity
US9294482B2 (en) 2013-07-25 2016-03-22 Oracle International Corporation External platform extensions in a multi-tenant environment
US9258238B2 (en) 2013-08-30 2016-02-09 Juniper Networks, Inc. Dynamic end-to-end network path setup across multiple network layers
US9882804B2 (en) 2013-09-26 2018-01-30 Cisco Technology, Inc. Co-existence of a distributed routing protocol and centralized path computation for deterministic wireless networks
WO2015084327A1 (en) 2013-12-03 2015-06-11 Hewlett-Packard Development Company, L.P. Security action of network packet based on signature and reputation
US9270598B1 (en) * 2013-12-13 2016-02-23 Cisco Technology, Inc. Congestion control using congestion prefix information in a named data networking environment
US20150169758A1 (en) 2013-12-17 2015-06-18 Luigi ASSOM Multi-partite graph database
US9548896B2 (en) 2013-12-27 2017-01-17 Big Switch Networks, Inc. Systems and methods for performing network service insertion
US9338065B2 (en) 2014-01-06 2016-05-10 Cisco Technology, Inc. Predictive learning machine-based approach to detect traffic outside of service level agreements
US9256549B2 (en) 2014-01-17 2016-02-09 Netapp, Inc. Set-associative hash table organization for efficient storage and retrieval of data in a storage system
US9313030B2 (en) 2014-01-22 2016-04-12 Futurewei Technologies, Inc. Method and apparatus for secure ad hoc group device-to-device communication in information-centric network
CN106165355A (zh) * 2014-01-31 2016-11-23 交互数字专利控股公司 用于通过基于散列路由和/或摘要路由的对等互连实现网络联合的方法、装置和系统
CN103873371B (zh) 2014-02-21 2017-11-28 北京邮电大学 一种名字路由快速匹配查找方法与装置
US9542928B2 (en) 2014-03-25 2017-01-10 Microsoft Technology Licensing, Llc Generating natural language outputs
US10075521B2 (en) 2014-04-07 2018-09-11 Cisco Technology, Inc. Collection synchronization using equality matched network names
US9203885B2 (en) 2014-04-28 2015-12-01 Palo Alto Research Center Incorporated Method and apparatus for exchanging bidirectional streams over a content centric network
US9276751B2 (en) 2014-05-28 2016-03-01 Palo Alto Research Center Incorporated System and method for circular link resolution with computable hash-based names in content-centric networks
US9426113B2 (en) 2014-06-30 2016-08-23 Palo Alto Research Center Incorporated System and method for managing devices over a content centric network
US9729616B2 (en) 2014-07-18 2017-08-08 Cisco Technology, Inc. Reputation-based strategy for forwarding and responding to interests over a content centric network
US9535968B2 (en) 2014-07-21 2017-01-03 Palo Alto Research Center Incorporated System for distributing nameless objects using self-certifying names
US10204013B2 (en) 2014-09-03 2019-02-12 Cisco Technology, Inc. System and method for maintaining a distributed and fault-tolerant state over an information centric network
US20160110466A1 (en) 2014-10-16 2016-04-21 Palo Alto Research Center Incorporated System and method for ranking named-data networking objects in a cache
US9536059B2 (en) 2014-12-15 2017-01-03 Palo Alto Research Center Incorporated Method and system for verifying renamed content using manifests in a content centric network
US10277481B2 (en) * 2015-09-23 2019-04-30 Futurewei Technologies, Inc. Stateless forwarding in information centric networks with bloom filters

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
None *

Also Published As

Publication number Publication date
KR20170038148A (ko) 2017-04-06
JP2017069951A (ja) 2017-04-06
EP3151517A1 (de) 2017-04-05
US20170093710A1 (en) 2017-03-30
US10454820B2 (en) 2019-10-22

Similar Documents

Publication Publication Date Title
EP3151517B1 (de) System und verfahren für zustandslose informationszentrische vernetzung
EP3148128B1 (de) Informationszentrisches networking mit kleinem multipfad oder einzelpfad-weiterleitungsstatus
US10003520B2 (en) System and method for efficient name-based content routing using link-state information in information-centric networks
EP3054635B1 (de) System und verfahren zum bedarfsabhängigen inhaltsaustausch mit adaptiver benennung in informationszentrierten netzwerken
US10091012B2 (en) System and method for multi-source multicasting in content-centric networks
US9282050B2 (en) System and method for minimum path MTU discovery in content centric networks
EP3148124B1 (de) System und verfahren zur eliminierung unerkannter interessenschleifen in informationszentrischen netzwerken
EP3035611B1 (de) System und verfahren zur abstandsbasierten interessenweiterleitung
EP2869536B1 (de) System und verfahren zur weiterleitung von paketen mit hierarchisch strukturierten identifikatoren mit variabler länge durch hashing
EP2869511B1 (de) Weiterleitung von paketen auf hash-basis mit hierarchisch strukturierten identifikatoren mit variabler länge über ethernet
US10320675B2 (en) System and method for routing packets in a stateless content centric network
US10033639B2 (en) System and method for routing packets in a content centric network using anonymous datagrams
EP2869510A1 (de) Express-Header für Pakete mit hierarchisch strukturierten Identifikatoren mit variabler Länge
Garcia-Luna-Aceves et al. Content-centric networking using anonymous datagrams

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE APPLICATION HAS BEEN PUBLISHED

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

AX Request for extension of the european patent

Extension state: BA ME

RAP1 Party data changed (applicant data changed or rights of an application transferred)

Owner name: CISCO TECHNOLOGY, INC.

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: REQUEST FOR EXAMINATION WAS MADE

17P Request for examination filed

Effective date: 20170928

RBV Designated contracting states (corrected)

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: GRANT OF PATENT IS INTENDED

RIC1 Information provided on ipc code assigned before grant

Ipc: H04L 29/08 20060101AFI20190207BHEP

Ipc: H04L 12/705 20130101ALN20190207BHEP

Ipc: H04L 29/06 20060101ALI20190207BHEP

Ipc: H04L 12/741 20130101ALI20190207BHEP

RIC1 Information provided on ipc code assigned before grant

Ipc: H04L 12/741 20130101ALI20190214BHEP

Ipc: H04L 12/705 20130101ALN20190214BHEP

Ipc: H04L 29/06 20060101ALI20190214BHEP

Ipc: H04L 29/08 20060101AFI20190214BHEP

INTG Intention to grant announced

Effective date: 20190311

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE PATENT HAS BEEN GRANTED

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

REG Reference to a national code

Ref country code: CH

Ref legal event code: EP

Ref country code: GB

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: AT

Ref legal event code: REF

Ref document number: 1162224

Country of ref document: AT

Kind code of ref document: T

Effective date: 20190815

REG Reference to a national code

Ref country code: IE

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: DE

Ref legal event code: R096

Ref document number: 602016017624

Country of ref document: DE

REG Reference to a national code

Ref country code: NL

Ref legal event code: MP

Effective date: 20190731

REG Reference to a national code

Ref country code: LT

Ref legal event code: MG4D

REG Reference to a national code

Ref country code: AT

Ref legal event code: MK05

Ref document number: 1162224

Country of ref document: AT

Kind code of ref document: T

Effective date: 20190731

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: FI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20190731

Ref country code: PT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20191202

Ref country code: AT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20190731

Ref country code: NL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20190731

Ref country code: BG

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20191031

Ref country code: SE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20190731

Ref country code: NO

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20191031

Ref country code: LT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20190731

Ref country code: HR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20190731

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: IS

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20191130

Ref country code: AL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20190731

Ref country code: RS

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20190731

Ref country code: LV

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20190731

Ref country code: GR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20191101

Ref country code: ES

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20190731

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: TR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20190731

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: IT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20190731

Ref country code: EE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20190731

Ref country code: PL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20190731

Ref country code: DK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20190731

Ref country code: RO

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20190731

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: CZ

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20190731

Ref country code: SK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20190731

Ref country code: IS

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200224

Ref country code: MC

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20190731

Ref country code: SM

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20190731

REG Reference to a national code

Ref country code: CH

Ref legal event code: PL

REG Reference to a national code

Ref country code: DE

Ref legal event code: R097

Ref document number: 602016017624

Country of ref document: DE

PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

PG2D Information on lapse in contracting state deleted

Ref country code: IS

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: CH

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20190930

Ref country code: IE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20190919

Ref country code: LI

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20190930

Ref country code: LU

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20190919

Ref country code: IS

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20191030

REG Reference to a national code

Ref country code: BE

Ref legal event code: MM

Effective date: 20190930

26N No opposition filed

Effective date: 20200603

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: SI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20190731

Ref country code: BE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20190930

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: CY

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20190731

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20190731

Ref country code: HU

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT; INVALID AB INITIO

Effective date: 20160919

REG Reference to a national code

Ref country code: DE

Ref legal event code: R079

Ref document number: 602016017624

Country of ref document: DE

Free format text: PREVIOUS MAIN CLASS: H04L0029080000

Ipc: H04L0065000000

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20190731

P01 Opt-out of the competence of the unified patent court (upc) registered

Effective date: 20230525

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: DE

Payment date: 20240904

Year of fee payment: 9

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: GB

Payment date: 20240910

Year of fee payment: 9

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: FR

Payment date: 20240926

Year of fee payment: 9