![](/images/graphics-bg.png)
Group-Interest-Based Verifiable CCN
Author
Source
Issue
Vol. 2016, Issue 2016 (31 Dec. 2016), pp.1-9, 9 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2016-01-26
Country of Publication
Egypt
No. of Pages
9
Main Subjects
Telecommunications Engineering
Abstract EN
To solve various problems of the Internet, content centric networking (CCN), one of information centric networking architectures (ICN), provides both an in-network content caching scheme and a built-in content verification scheme.
However, a user is still asked to generate many request messages when retrieving fragmented content through CCN.
This model can seriously increase the amount of network traffic.
Furthermore, when receiving content, a user is asked to verify the received content before using it.
This verification process can cause a serious service delay.
To improve such inefficiencies, this paper proposes a transmission process to handle request messages at one time.
Also, it suggests an efficient content verification method using both hash chains and Merkel-hash tree.
American Psychological Association (APA)
Kim, DaeYoub. 2016. Group-Interest-Based Verifiable CCN. Mobile Information Systems،Vol. 2016, no. 2016, pp.1-9.
https://search.emarefa.net/detail/BIM-1111661
Modern Language Association (MLA)
Kim, DaeYoub. Group-Interest-Based Verifiable CCN. Mobile Information Systems No. 2016 (2016), pp.1-9.
https://search.emarefa.net/detail/BIM-1111661
American Medical Association (AMA)
Kim, DaeYoub. Group-Interest-Based Verifiable CCN. Mobile Information Systems. 2016. Vol. 2016, no. 2016, pp.1-9.
https://search.emarefa.net/detail/BIM-1111661
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1111661