{"id":"https://openalex.org/W2519857956","doi":"https://doi.org/10.1109/icccn.2016.7568494","title":"Analysis of Buffer Management Policies for Opportunistic Networks","display_name":"Analysis of Buffer Management Policies for Opportunistic Networks","publication_year":2016,"publication_date":"2016-08-01","ids":{"openalex":"https://openalex.org/W2519857956","doi":"https://doi.org/10.1109/icccn.2016.7568494","mag":"2519857956"},"language":"en","primary_location":{"id":"doi:10.1109/icccn.2016.7568494","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icccn.2016.7568494","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 25th International Conference on Computer Communication and Networks (ICCCN)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5006392845","display_name":"Salem Sati","orcid":"https://orcid.org/0000-0002-6062-497X"},"institutions":[{"id":"https://openalex.org/I44260953","display_name":"Heinrich Heine University D\u00fcsseldorf","ror":"https://ror.org/024z2rq82","country_code":"DE","type":"education","lineage":["https://openalex.org/I44260953"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Salem Sati","raw_affiliation_strings":["Department of Computer Science, University of D\u00fcsseldorf, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of D\u00fcsseldorf, Germany","institution_ids":["https://openalex.org/I44260953"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047906373","display_name":"Christopher Probst","orcid":"https://orcid.org/0000-0002-1380-0117"},"institutions":[{"id":"https://openalex.org/I44260953","display_name":"Heinrich Heine University D\u00fcsseldorf","ror":"https://ror.org/024z2rq82","country_code":"DE","type":"education","lineage":["https://openalex.org/I44260953"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Christopher Probst","raw_affiliation_strings":["Department of Computer Science, University of D\u00fcsseldorf, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of D\u00fcsseldorf, Germany","institution_ids":["https://openalex.org/I44260953"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033620830","display_name":"K\u00e1lm\u00e1n Graffi","orcid":"https://orcid.org/0000-0003-1708-6835"},"institutions":[{"id":"https://openalex.org/I44260953","display_name":"Heinrich Heine University D\u00fcsseldorf","ror":"https://ror.org/024z2rq82","country_code":"DE","type":"education","lineage":["https://openalex.org/I44260953"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Kalman Graffi","raw_affiliation_strings":["Department of Computer Science, University of D\u00fcsseldorf, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of D\u00fcsseldorf, Germany","institution_ids":["https://openalex.org/I44260953"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I44260953"],"apc_list":null,"apc_paid":null,"fwci":4.7975,"has_fulltext":false,"cited_by_count":28,"citation_normalized_percentile":{"value":0.96332781,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"3","issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9914000034332275,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9789999723434448,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.788102924823761},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.7574174404144287},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5346065759658813},{"id":"https://openalex.org/keywords/latency","display_name":"Latency (audio)","score":0.5342093706130981},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.4849167466163635},{"id":"https://openalex.org/keywords/buffer-overflow","display_name":"Buffer overflow","score":0.43543869256973267},{"id":"https://openalex.org/keywords/active-queue-management","display_name":"Active queue management","score":0.43522629141807556},{"id":"https://openalex.org/keywords/queueing-theory","display_name":"Queueing theory","score":0.4292212128639221},{"id":"https://openalex.org/keywords/network-performance","display_name":"Network performance","score":0.41168659925460815},{"id":"https://openalex.org/keywords/network-congestion","display_name":"Network congestion","score":0.3929356634616852},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.36065614223480225},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.1710243821144104},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.16607621312141418},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.08202633261680603}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.788102924823761},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.7574174404144287},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5346065759658813},{"id":"https://openalex.org/C82876162","wikidata":"https://www.wikidata.org/wiki/Q17096504","display_name":"Latency (audio)","level":2,"score":0.5342093706130981},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.4849167466163635},{"id":"https://openalex.org/C40842320","wikidata":"https://www.wikidata.org/wiki/Q19423","display_name":"Buffer overflow","level":2,"score":0.43543869256973267},{"id":"https://openalex.org/C34793927","wikidata":"https://www.wikidata.org/wiki/Q583367","display_name":"Active queue management","level":4,"score":0.43522629141807556},{"id":"https://openalex.org/C22684755","wikidata":"https://www.wikidata.org/wiki/Q847526","display_name":"Queueing theory","level":2,"score":0.4292212128639221},{"id":"https://openalex.org/C203274722","wikidata":"https://www.wikidata.org/wiki/Q7001161","display_name":"Network performance","level":2,"score":0.41168659925460815},{"id":"https://openalex.org/C195563490","wikidata":"https://www.wikidata.org/wiki/Q180368","display_name":"Network congestion","level":3,"score":0.3929356634616852},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.36065614223480225},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.1710243821144104},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.16607621312141418},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.08202633261680603},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icccn.2016.7568494","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icccn.2016.7568494","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 25th International Conference on Computer Communication and Networks (ICCCN)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/3","score":0.7900000214576721,"display_name":"Good health and well-being"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1572481965","https://openalex.org/W1824715222","https://openalex.org/W1923680614","https://openalex.org/W1996931335","https://openalex.org/W2023290717","https://openalex.org/W2093936253","https://openalex.org/W2097707369","https://openalex.org/W2121756109","https://openalex.org/W2132743380","https://openalex.org/W2167021262","https://openalex.org/W6634082847"],"related_works":["https://openalex.org/W2892220642","https://openalex.org/W2034785493","https://openalex.org/W3013694835","https://openalex.org/W2948615021","https://openalex.org/W1884496646","https://openalex.org/W2071614110","https://openalex.org/W3009333951","https://openalex.org/W2972123927","https://openalex.org/W2189475733","https://openalex.org/W3191913487"],"abstract_inverted_index":{"Opportunistic":[0],"Networks":[1],"are":[2,20,38],"a":[3,23,42,52,64,87,98,128],"subclass":[4],"of":[5,57,89,124,138,150,173,189],"delay":[6],"tolerant":[7],"networks,":[8],"which":[9,79,104,218],"aims":[10],"at":[11],"wireless":[12],"data":[13],"delivery":[14,174],"in":[15,153,171,179],"severely":[16],"partitioned":[17],"networks.":[18],"Messages":[19],"routed":[21],"on":[22,63,83,147],"best":[24],"effort":[25],"basis.":[26],"If":[27],"nodes":[28,59],"cannot":[29],"forward":[30],"messages":[31,37,61],"due":[32],"to":[33,41,142,206,212,220,229],"missing":[34],"connectivity,":[35],"the":[36,70,75,122,125,132,148,151,185,190,221],"buffered":[39],"according":[40],"queue":[43],"policy,":[44,78],"and":[45,69,120,144,168,177,187,195,225],"scheduled":[46],"for":[47],"transmission":[48],"once":[49],"there":[50,93,198],"is":[51,199,204],"connection":[53],"again.":[54],"In":[55,112,157],"case":[56],"congestion,":[58],"drop":[60,65,71],"based":[62],"policy.":[66],"The":[67],"scheduling":[68],"policy":[72,202],"form":[73],"together":[74],"buffer":[76,192,215],"management":[77,193,216],"has":[80,94],"an":[81,154],"impact":[82,123],"routing":[84,102,152,163],"performance.":[85],"Although":[86],"multitude":[88],"different":[90,166],"policies":[91,108,167,194],"exist,":[92],"not":[95,200],"yet":[96],"been":[97],"comprehensive":[99,118],"study":[100,119,209],"regarding":[101],"performance,":[103],"compares":[105,169],"all":[106],"possible":[107],"against":[109],"each":[110],"other.":[111],"this":[113,117,159],"paper,":[114],"we":[115],"conduct":[116],"investigate":[121],"various":[126,191],"parameters":[127,228],"message":[129,145],"has,":[130],"namely":[131],"arrival":[133],"time,":[134],"replication":[135],"count,":[136],"number":[137],"relayed":[139],"nodes,":[140],"time":[141],"live":[143],"size,":[146],"performance":[149],"opportunistic":[155],"network.":[156],"specific,":[158],"paper":[160],"analyzes":[161],"epidemic":[162],"with":[164],"121":[165],"them":[170],"terms":[172],"ratio,":[175],"overhead":[176],"latency":[178],"three":[180],"use":[181],"cases.":[182],"Evaluation":[183],"shows":[184],"strengths":[186],"weaknesses":[188],"highlights,":[196],"that":[197,203],"one":[201],"always":[205],"recommend.":[207],"This":[208],"will":[210],"help":[211],"create":[213],"dynamic":[214],"policies,":[217],"adapt":[219],"given":[222],"network":[223],"characteristics":[224],"select":[226],"suitable":[227],"prioritize.":[230]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}