{"id":{"repo_id":"vilnius","oai_identifier":"oai:vu.lt:elaba:20217855"},"canonical_url":"https://search.ndltd.org/etd/vilnius/oai:vu.lt:elaba:20217855","repository":{"repo_id":"vilnius","name":"Vilnius University","base_url":"https://epublications.vu.lt/oai"},"display":{"title":"Turinio pristatymo tinklų efektyvumo tyrimas /","abstract":"When computer network was created there were several advantages seen against other communication methods. Possibility to exchange text, visual and sound information led computer networks to grow in fast pace. After some time network expanded and now it is very big and complicated structure. Because of that efficiency problem occurred. In a big network it is hard to ensure fast content delivery, especially between users who are far away from each other geograficaly. This was a motivation to look for different network models. In this bachelor thesis Content-centric networks are analyzed. The main goal of this bachelor thesis is to perform an investigation on content delivery network efficiency. In order to meet this goal, tasks were defined: investigate efficiency of different decision and replacement strategies, investigate how network efficiency depends on Zipf &#945; value, and how network efficiency depends on cache size. Experiments were made with network simulator. On the basis of experiments results, conclusions were made: • while incrementing the Zipf factor &#945; value from 0,8 to 1,2 probability to find a packet in node cache increments 20 times; • IDEAL_BLIND decision strategy is 5±0,1 percentage points more efficient than LCE, 2,2±0,1 percentage points more efficient than LCD and 2,3±0,1 percentage points more efficient than PROB_CACHE decision strategy; • LRU replacement strategy is 3,4±0,1 percentage points more efficient that FIFO and 4,2±0,1 percentage points more efficient that TWO replacement strategy; • if cache size increments 100 times, probability to find a chunk increases 2,5 times; • if cache size increments 1000 times, average hop distance decreases 1,4 hop.","abstract_html":"When computer network was created there were several advantages seen against other communication methods. Possibility to exchange text, visual and sound information led computer networks to grow in fast pace. After some time network expanded and now it is very big and complicated structure. Because of that efficiency problem occurred. In a big network it is hard to ensure fast content delivery, especially between users who are far away from each other geograficaly. This was a motivation to look for different network models. In this bachelor thesis Content-centric networks are analyzed. The main goal of this bachelor thesis is to perform an investigation on content delivery network efficiency. In order to meet this goal, tasks were defined: investigate efficiency of different decision and replacement strategies, investigate how network efficiency depends on Zipf &amp;#945; value, and how network efficiency depends on cache size. Experiments were made with network simulator. On the basis of experiments results, conclusions were made: • while incrementing the Zipf factor &amp;#945; value from 0,8 to 1,2 probability to find a packet in node cache increments 20 times; • IDEAL_BLIND decision strategy is 5±0,1 percentage points more efficient than LCE, 2,2±0,1 percentage points more efficient than LCD and 2,3±0,1 percentage points more efficient than PROB_CACHE decision strategy; • LRU replacement strategy is 3,4±0,1 percentage points more efficient that FIFO and 4,2±0,1 percentage points more efficient that TWO replacement strategy; • if cache size increments 100 times, probability to find a chunk increases 2,5 times; • if cache size increments 1000 times, average hop distance decreases 1,4 hop.","abstract_has_math":false,"creators":["Lukšys, Adomas,"],"institution":"Institutional Repository of Vilnius University","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":["Kuliešius, Feliksas"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2016,"date_issued":"2016","date_published":"2016","updated_at":"2026-11-19T09:57:20Z","subjects":[],"languages":["lit"],"rights":["info:eu-repo/semantics/openAccess"],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://repository.vu.lt/VU:ELABAETD20217855&prefLang=en_US","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://repository.vu.lt/VU:ELABAETD20217855&prefLang=en_US","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":"open","embargo_until":null,"access_note":null},"source_record":{"url":"https://epublications.vu.lt/oai?verb=GetRecord&metadataPrefix=oai_dc&identifier=oai%3Avu.lt%3Aelaba%3A20217855","prefix":"oai_dc"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Kuliešius, Feliksas"]},{"key":"dc:creator","label":"Author","values":["Lukšys, Adomas,"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2016"]},{"key":"dc:publisher","label":"Institution","values":["Institutional Repository of Vilnius University"]},{"key":"dc:relation","label":"Dc Relation","values":["https://epublications.vu.lt/object/elaba:20217855/20217855.pdf"]},{"key":"dc:type","label":"Dc Type","values":["info:eu-repo/semantics/bachelorThesis"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["lit"]},{"key":"dc:rights","label":"Dc Rights","values":["info:eu-repo/semantics/openAccess"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://repository.vu.lt/VU:ELABAETD20217855&prefLang=en_US"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["When computer network was created there were several advantages seen against other communication methods. Possibility to exchange text, visual and sound information led computer networks to grow in fast pace. After some time network expanded and now it is very big and complicated structure. Because of that efficiency problem occurred. In a big network it is hard to ensure fast content delivery, especially between users who are far away from each other geograficaly. This was a motivation to look for different network models. In this bachelor thesis Content-centric networks are analyzed. The main goal of this bachelor thesis is to perform an investigation on content delivery network efficiency. In order to meet this goal, tasks were defined: investigate efficiency of different decision and replacement strategies, investigate how network efficiency depends on Zipf &#945; value, and how network efficiency depends on cache size. Experiments were made with network simulator. On the basis of experiments results, conclusions were made: • while incrementing the Zipf factor &#945; value from 0,8 to 1,2 probability to find a packet in node cache increments 20 times; • IDEAL_BLIND decision strategy is 5±0,1 percentage points more efficient than LCE, 2,2±0,1 percentage points more efficient than LCD and 2,3±0,1 percentage points more efficient than PROB_CACHE decision strategy; • LRU replacement strategy is 3,4±0,1 percentage points more efficient that FIFO and 4,2±0,1 percentage points more efficient that TWO replacement strategy; • if cache size increments 100 times, probability to find a chunk increases 2,5 times; • if cache size increments 1000 times, average hop distance decreases 1,4 hop."]},{"key":"dc:format","label":"Dc Format","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Turinio pristatymo tinklų efektyvumo tyrimas /","Investigation of content delivery networks."]}]}],"canonical_facts":{"dc:contributor":["Kuliešius, Feliksas"],"dc:creator":["Lukšys, Adomas,"],"dc:date":["2016"],"dc:description":["When computer network was created there were several advantages seen against other communication methods. Possibility to exchange text, visual and sound information led computer networks to grow in fast pace. After some time network expanded and now it is very big and complicated structure. Because of that efficiency problem occurred. In a big network it is hard to ensure fast content delivery, especially between users who are far away from each other geograficaly. This was a motivation to look for different network models. In this bachelor thesis Content-centric networks are analyzed. The main goal of this bachelor thesis is to perform an investigation on content delivery network efficiency. In order to meet this goal, tasks were defined: investigate efficiency of different decision and replacement strategies, investigate how network efficiency depends on Zipf &#945; value, and how network efficiency depends on cache size. Experiments were made with network simulator. On the basis of experiments results, conclusions were made: • while incrementing the Zipf factor &#945; value from 0,8 to 1,2 probability to find a packet in node cache increments 20 times; • IDEAL_BLIND decision strategy is 5±0,1 percentage points more efficient than LCE, 2,2±0,1 percentage points more efficient than LCD and 2,3±0,1 percentage points more efficient than PROB_CACHE decision strategy; • LRU replacement strategy is 3,4±0,1 percentage points more efficient that FIFO and 4,2±0,1 percentage points more efficient that TWO replacement strategy; • if cache size increments 100 times, probability to find a chunk increases 2,5 times; • if cache size increments 1000 times, average hop distance decreases 1,4 hop."],"dc:format":["application/pdf"],"dc:identifier":["https://repository.vu.lt/VU:ELABAETD20217855&prefLang=en_US"],"dc:language":["lit"],"dc:publisher":["Institutional Repository of Vilnius University"],"dc:relation":["https://epublications.vu.lt/object/elaba:20217855/20217855.pdf"],"dc:rights":["info:eu-repo/semantics/openAccess"],"dc:title":["Turinio pristatymo tinklų efektyvumo tyrimas /","Investigation of content delivery networks."],"dc:type":["info:eu-repo/semantics/bachelorThesis"]},"updated_at":"2026-11-19T09:57:20Z"}