Semantics and Deviation Aware Content Request When a content is published in the Internet, it is usually associated with many semantics information, which can be used to identify and discover the content. The current Internet protocols do not support the semantics aware content request very efficiently. By taking advantage of the recently developed Big IP Protocol (BPP), which brings the intelligence into the network while still maintaining the traditional communication paradigm, we propose in this paper a novel semantics and deviation aware content request scheme. It considers the possibility that a consumer may be able to accept the semantics information of the received content having certain deviation from hisher requirements. The paper proposes the structures of BPP enabled content request and content messages, as well as the detailed procedures taken by the network nodes to process those messages. The performance analysis shows that the latency experienced by the consumer is reduced tremendously compared to the traditional approach, with the extra overhead to be reasonable small in different settings and scenarios.

Cooperative Update Mechanism of Cache Update Method Based on Content Update Dynamic Queries for Named Data Networking In Named Data Networking (NDN), a client requests a content object by its content identifier, instead of the serveru0027s IP address. When a router or a node around the client stores the content in the cache, it transfers the content from the cache. As a result, it is possible to provide information quickly and efficiently to many users. In NDN, a content distributor can configure the contentu0027s expiration time at each cache. The expiration time should be long enough to use the cache effectively and decrease the amount of traffic. However, if the expiration time is too long this increases the possibility of receiving old content. A shorter expiration time reduces this possibility but this causes the amount of traffic to increase instead. In order to solve this tradeoff relationship, we proposed an automatic cache update method where each router queries the version number of all content in the cache to automatically remove old content. Since it is too difficult to set an appropriate inquiry interval for all the content, we also proposed a cache update method based on content update dynamic queries to dynamically change the inquiry interval when each content object is not updated. This paper improves this method by introducing a cooperative update mechanism to reduce the amount of traffic in the network and the number of times old content is received. It also evaluates the method on the generated topology that is similar to real topology and shows that, for example, when the cache size on all routers is large enough, although the difference in the average aggregated traffic is larger than that of the authoru0027s first method where the inquiry interval was 270 seconds by 49.1xe2x80x9384.9 GBytes for the experimental period (7 days) ( 4.9xe2x80x938.4 MBytes per minute), the number of inquiries all routers generated is reduced by 131232.6xe2x80x93 1159687.9 times over 7 days ( 13.0xe2x80x93115.0 times per minute).