{"corpus_id":123667974,"paper_sha":"8dd903afe034ba2c15b6a1857fe971fc4bbb30d0","doi":"10.1088/1367-2630/10/2/023025","arxiv_id":"0711.1655","pmid":null,"pmcid":null,"mag_id":2096796893,"dblp_id":null,"acl_id":null,"title":"Traffic dynamics in scale-free networks with limited buffers and decongestion strategy","year":2007,"publication_date":"2007-11-11","venue":"","journal":{"name":"New Journal of Physics","pages":"023025","volume":"10"},"journal_issn":null,"journal_title":null,"publication_types":[],"pubmed_pub_types":null,"s2_fields_of_study":["Physics","Computer Science","Engineering"],"reference_count":51,"citation_count":46,"influential_citation_count":1,"is_open_access":true,"arxiv_categories":["physics.soc-ph"],"arxiv_license":null,"arxiv_journal_ref":"New Journal of Physics 10 (2008) 023025","mesh_headings":null,"chemicals":null,"comments_corrections":null,"source_flags":1,"s2_open_access_pdf_url":"https://iopscience.iop.org/article/10.1088/1367-2630/10/2/023025/pdf","s2_open_access_landing_url":"https://www.semanticscholar.org/paper/8dd903afe034ba2c15b6a1857fe971fc4bbb30d0","s2_open_access_license":"CCBY","s2_open_access_status":"GOLD","pmc_open_access_pdf_url":null,"pmc_open_access_landing_url":null,"pmc_open_access_license":null,"pmc_open_access_status":null,"unpaywall_open_access_pdf_url":null,"unpaywall_open_access_landing_url":null,"unpaywall_open_access_license":null,"unpaywall_open_access_status":null,"abstract":"We studied the information traffic in Barabási–Albert scale-free networks wherein each node has a finite queue length to store the packets. It is found that in the case of the shortest path routing strategy, the networks undergo a first-order phase transition, i.e. from a free flow state to a full congestion state, with increasing packet generation rate. We also incorporate the random effect (namely random selection of a neighbor to deliver packets) as well as a control method (namely the packet-dropping strategy of the congested nodes after some delay time T) into the routing protocol to test the traffic capacity of the heterogeneous networks. It is shown that there exists an optimal value of T for the networks to achieve the best handling ability, and the presence of an appropriate random effect also contributes to the performance of the networks.","claims":[{"public_id":"cl_33f2479c3207b14561d5e3f55a08647a","status":"active","text":"In Barabási–Albert scale-free networks with finite queue lengths and shortest path routing, the networks undergo a first-order phase transition from a free flow state to a full congestion state with increasing packet generation rate.","confidence":0.95,"contributors":[{"id":2,"public_id":"4715169a40","public_label":"AK (4715169a40)","roles":["extraction"],"url":"https://sah.borca.ai/u/4715169a40"},{"id":136,"public_id":"3c2apqe3ut","public_label":"Anonymous (3c2apqe3ut)","roles":["review"],"url":"https://sah.borca.ai/u/3c2apqe3ut"},{"id":170,"public_id":"gsgmdx9r6e","public_label":"pupuri (gsgmdx9r6e)","roles":["review"],"url":"https://sah.borca.ai/u/gsgmdx9r6e"},{"id":1165,"public_id":"ezd9qvkvax","public_label":"The Reverser‮ (ezd9qvkvax)","roles":["review"],"url":"https://sah.borca.ai/u/ezd9qvkvax"}],"url":"https://sah.borca.ai/claims/cl_33f2479c3207b14561d5e3f55a08647a"},{"public_id":"cl_35d355ecbf23cb992e2900302949c51f","status":"active","text":"Incorporating a packet-dropping strategy with an optimal delay time T improves the traffic handling ability of the heterogeneous networks.","confidence":0.9,"contributors":[{"id":2,"public_id":"4715169a40","public_label":"AK (4715169a40)","roles":["extraction"],"url":"https://sah.borca.ai/u/4715169a40"},{"id":136,"public_id":"3c2apqe3ut","public_label":"Anonymous (3c2apqe3ut)","roles":["review"],"url":"https://sah.borca.ai/u/3c2apqe3ut"},{"id":170,"public_id":"gsgmdx9r6e","public_label":"pupuri (gsgmdx9r6e)","roles":["review"],"url":"https://sah.borca.ai/u/gsgmdx9r6e"},{"id":1165,"public_id":"ezd9qvkvax","public_label":"The Reverser‮ (ezd9qvkvax)","roles":["review"],"url":"https://sah.borca.ai/u/ezd9qvkvax"}],"url":"https://sah.borca.ai/claims/cl_35d355ecbf23cb992e2900302949c51f"},{"public_id":"cl_05af14793b62991dd78f0ff71b98dad9","status":"active","text":"The presence of an appropriate random effect in neighbor selection contributes to the performance of the networks.","confidence":0.85,"contributors":[{"id":2,"public_id":"4715169a40","public_label":"AK (4715169a40)","roles":["extraction"],"url":"https://sah.borca.ai/u/4715169a40"},{"id":136,"public_id":"3c2apqe3ut","public_label":"Anonymous (3c2apqe3ut)","roles":["review"],"url":"https://sah.borca.ai/u/3c2apqe3ut"},{"id":170,"public_id":"gsgmdx9r6e","public_label":"pupuri (gsgmdx9r6e)","roles":["review"],"url":"https://sah.borca.ai/u/gsgmdx9r6e"},{"id":1165,"public_id":"ezd9qvkvax","public_label":"The Reverser‮ (ezd9qvkvax)","roles":["review"],"url":"https://sah.borca.ai/u/ezd9qvkvax"}],"url":"https://sah.borca.ai/claims/cl_05af14793b62991dd78f0ff71b98dad9"}],"concepts":[{"public_id":"co_02715b12979e30e9a599a9ec15dc8b61","status":"active","name":"Barabási–Albert scale-free networks","description":"Heterogeneous networks generated by the Barabási–Albert model, used as the underlying topology for traffic simulation.","types":["network model"],"aliases":[],"contributors":[{"id":2,"public_id":"4715169a40","public_label":"AK (4715169a40)","roles":["extraction"],"url":"https://sah.borca.ai/u/4715169a40"},{"id":136,"public_id":"3c2apqe3ut","public_label":"Anonymous (3c2apqe3ut)","roles":["review"],"url":"https://sah.borca.ai/u/3c2apqe3ut"},{"id":170,"public_id":"gsgmdx9r6e","public_label":"pupuri (gsgmdx9r6e)","roles":["review"],"url":"https://sah.borca.ai/u/gsgmdx9r6e"},{"id":1165,"public_id":"ezd9qvkvax","public_label":"The Reverser‮ (ezd9qvkvax)","roles":["review"],"url":"https://sah.borca.ai/u/ezd9qvkvax"}],"url":"https://sah.borca.ai/concepts/co_02715b12979e30e9a599a9ec15dc8b61"},{"public_id":"co_0ca3f49e1ec1a9893ddb31f099ea1e34","status":"active","name":"full congestion state","description":"A traffic state where queues overflow and the network cannot handle the packet load.","types":["traffic state"],"aliases":[],"contributors":[{"id":2,"public_id":"4715169a40","public_label":"AK (4715169a40)","roles":["extraction"],"url":"https://sah.borca.ai/u/4715169a40"},{"id":136,"public_id":"3c2apqe3ut","public_label":"Anonymous (3c2apqe3ut)","roles":["review"],"url":"https://sah.borca.ai/u/3c2apqe3ut"},{"id":170,"public_id":"gsgmdx9r6e","public_label":"pupuri (gsgmdx9r6e)","roles":["review"],"url":"https://sah.borca.ai/u/gsgmdx9r6e"},{"id":1165,"public_id":"ezd9qvkvax","public_label":"The Reverser‮ (ezd9qvkvax)","roles":["review"],"url":"https://sah.borca.ai/u/ezd9qvkvax"}],"url":"https://sah.borca.ai/concepts/co_0ca3f49e1ec1a9893ddb31f099ea1e34"},{"public_id":"co_173ebf63c313eb2e661e7550c94643e8","status":"active","name":"shortest path routing strategy","description":"A routing protocol that forwards packets along the shortest topological path between source and destination.","types":["routing strategy"],"aliases":[],"contributors":[{"id":2,"public_id":"4715169a40","public_label":"AK (4715169a40)","roles":["extraction"],"url":"https://sah.borca.ai/u/4715169a40"},{"id":136,"public_id":"3c2apqe3ut","public_label":"Anonymous (3c2apqe3ut)","roles":["review"],"url":"https://sah.borca.ai/u/3c2apqe3ut"},{"id":170,"public_id":"gsgmdx9r6e","public_label":"pupuri (gsgmdx9r6e)","roles":["review"],"url":"https://sah.borca.ai/u/gsgmdx9r6e"},{"id":1165,"public_id":"ezd9qvkvax","public_label":"The Reverser‮ (ezd9qvkvax)","roles":["review"],"url":"https://sah.borca.ai/u/ezd9qvkvax"}],"url":"https://sah.borca.ai/concepts/co_173ebf63c313eb2e661e7550c94643e8"},{"public_id":"co_9ea7f0ee8d95484472b8edd2c5beffca","status":"active","name":"finite queue length","description":"A limited buffer capacity at each node to store packets before forwarding.","types":["parameter"],"aliases":["limited buffer"],"contributors":[{"id":2,"public_id":"4715169a40","public_label":"AK (4715169a40)","roles":["extraction"],"url":"https://sah.borca.ai/u/4715169a40"},{"id":136,"public_id":"3c2apqe3ut","public_label":"Anonymous (3c2apqe3ut)","roles":["review"],"url":"https://sah.borca.ai/u/3c2apqe3ut"},{"id":170,"public_id":"gsgmdx9r6e","public_label":"pupuri (gsgmdx9r6e)","roles":["review"],"url":"https://sah.borca.ai/u/gsgmdx9r6e"},{"id":1165,"public_id":"ezd9qvkvax","public_label":"The Reverser‮ (ezd9qvkvax)","roles":["review"],"url":"https://sah.borca.ai/u/ezd9qvkvax"}],"url":"https://sah.borca.ai/concepts/co_9ea7f0ee8d95484472b8edd2c5beffca"},{"public_id":"co_a5cc68fef8505be107a1b31348d5216b","status":"active","name":"network performance","description":"The overall effectiveness of the network in handling traffic, improved by random effect and optimal delay.","types":["outcome"],"aliases":["performance"],"contributors":[{"id":2,"public_id":"4715169a40","public_label":"AK (4715169a40)","roles":["extraction"],"url":"https://sah.borca.ai/u/4715169a40"},{"id":136,"public_id":"3c2apqe3ut","public_label":"Anonymous (3c2apqe3ut)","roles":["review"],"url":"https://sah.borca.ai/u/3c2apqe3ut"},{"id":170,"public_id":"gsgmdx9r6e","public_label":"pupuri (gsgmdx9r6e)","roles":["review"],"url":"https://sah.borca.ai/u/gsgmdx9r6e"},{"id":1165,"public_id":"ezd9qvkvax","public_label":"The Reverser‮ (ezd9qvkvax)","roles":["review"],"url":"https://sah.borca.ai/u/ezd9qvkvax"}],"url":"https://sah.borca.ai/concepts/co_a5cc68fef8505be107a1b31348d5216b"},{"public_id":"co_aa2b25bc455da4f40ada281b07a4dacb","status":"active","name":"neighbor selection","description":"The process of choosing which adjacent node to forward a packet to, here including random choice.","types":["routing step"],"aliases":[],"contributors":[{"id":2,"public_id":"4715169a40","public_label":"AK (4715169a40)","roles":["extraction"],"url":"https://sah.borca.ai/u/4715169a40"},{"id":136,"public_id":"3c2apqe3ut","public_label":"Anonymous (3c2apqe3ut)","roles":["review"],"url":"https://sah.borca.ai/u/3c2apqe3ut"},{"id":170,"public_id":"gsgmdx9r6e","public_label":"pupuri (gsgmdx9r6e)","roles":["review"],"url":"https://sah.borca.ai/u/gsgmdx9r6e"},{"id":1165,"public_id":"ezd9qvkvax","public_label":"The Reverser‮ (ezd9qvkvax)","roles":["review"],"url":"https://sah.borca.ai/u/ezd9qvkvax"}],"url":"https://sah.borca.ai/concepts/co_aa2b25bc455da4f40ada281b07a4dacb"},{"public_id":"co_abd4e7ea74226f2088e51f59f1b25a39","status":"active","name":"traffic handling ability","description":"The capacity of the network to manage and deliver packets without congestion, measured as performance.","types":["performance metric"],"aliases":["handling ability"],"contributors":[{"id":2,"public_id":"4715169a40","public_label":"AK (4715169a40)","roles":["extraction"],"url":"https://sah.borca.ai/u/4715169a40"},{"id":136,"public_id":"3c2apqe3ut","public_label":"Anonymous (3c2apqe3ut)","roles":["review"],"url":"https://sah.borca.ai/u/3c2apqe3ut"},{"id":170,"public_id":"gsgmdx9r6e","public_label":"pupuri (gsgmdx9r6e)","roles":["review"],"url":"https://sah.borca.ai/u/gsgmdx9r6e"},{"id":1165,"public_id":"ezd9qvkvax","public_label":"The Reverser‮ (ezd9qvkvax)","roles":["review"],"url":"https://sah.borca.ai/u/ezd9qvkvax"}],"url":"https://sah.borca.ai/concepts/co_abd4e7ea74226f2088e51f59f1b25a39"},{"public_id":"co_b2d0d7612b12ad15c438ce2c6ffb2739","status":"active","name":"free flow state","description":"A traffic state where all generated packets can be delivered without queue overflow.","types":["traffic state"],"aliases":[],"contributors":[{"id":2,"public_id":"4715169a40","public_label":"AK (4715169a40)","roles":["extraction"],"url":"https://sah.borca.ai/u/4715169a40"},{"id":136,"public_id":"3c2apqe3ut","public_label":"Anonymous (3c2apqe3ut)","roles":["review"],"url":"https://sah.borca.ai/u/3c2apqe3ut"},{"id":170,"public_id":"gsgmdx9r6e","public_label":"pupuri (gsgmdx9r6e)","roles":["review"],"url":"https://sah.borca.ai/u/gsgmdx9r6e"},{"id":1165,"public_id":"ezd9qvkvax","public_label":"The Reverser‮ (ezd9qvkvax)","roles":["review"],"url":"https://sah.borca.ai/u/ezd9qvkvax"}],"url":"https://sah.borca.ai/concepts/co_b2d0d7612b12ad15c438ce2c6ffb2739"},{"public_id":"co_c727e7896621fe9b8f9c2f7f3aafc3c2","status":"active","name":"first-order phase transition","description":"A sharp transition from free flow to full congestion as packet generation rate increases, observed in the studied networks.","types":["phenomenon"],"aliases":[],"contributors":[{"id":2,"public_id":"4715169a40","public_label":"AK (4715169a40)","roles":["extraction"],"url":"https://sah.borca.ai/u/4715169a40"},{"id":136,"public_id":"3c2apqe3ut","public_label":"Anonymous (3c2apqe3ut)","roles":["review"],"url":"https://sah.borca.ai/u/3c2apqe3ut"},{"id":170,"public_id":"gsgmdx9r6e","public_label":"pupuri (gsgmdx9r6e)","roles":["review"],"url":"https://sah.borca.ai/u/gsgmdx9r6e"},{"id":1165,"public_id":"ezd9qvkvax","public_label":"The Reverser‮ (ezd9qvkvax)","roles":["review"],"url":"https://sah.borca.ai/u/ezd9qvkvax"}],"url":"https://sah.borca.ai/concepts/co_c727e7896621fe9b8f9c2f7f3aafc3c2"},{"public_id":"co_cdafe5a537f9349ede7bc764cd312635","status":"active","name":"packet-dropping strategy","description":"A control method where congested nodes drop packets after a delay time T to alleviate congestion.","types":["control method"],"aliases":["decongestion strategy"],"contributors":[{"id":2,"public_id":"4715169a40","public_label":"AK (4715169a40)","roles":["extraction"],"url":"https://sah.borca.ai/u/4715169a40"},{"id":136,"public_id":"3c2apqe3ut","public_label":"Anonymous (3c2apqe3ut)","roles":["review"],"url":"https://sah.borca.ai/u/3c2apqe3ut"},{"id":170,"public_id":"gsgmdx9r6e","public_label":"pupuri (gsgmdx9r6e)","roles":["review"],"url":"https://sah.borca.ai/u/gsgmdx9r6e"},{"id":1165,"public_id":"ezd9qvkvax","public_label":"The Reverser‮ (ezd9qvkvax)","roles":["review"],"url":"https://sah.borca.ai/u/ezd9qvkvax"}],"url":"https://sah.borca.ai/concepts/co_cdafe5a537f9349ede7bc764cd312635"},{"public_id":"co_f3360ead5a2770063fe6285f78cc107b","status":"active","name":"delay time T","description":"The waiting time after which a congested node drops packets; an optimal value exists for best handling ability.","types":["parameter"],"aliases":["T"],"contributors":[{"id":2,"public_id":"4715169a40","public_label":"AK (4715169a40)","roles":["extraction"],"url":"https://sah.borca.ai/u/4715169a40"},{"id":136,"public_id":"3c2apqe3ut","public_label":"Anonymous (3c2apqe3ut)","roles":["review"],"url":"https://sah.borca.ai/u/3c2apqe3ut"},{"id":170,"public_id":"gsgmdx9r6e","public_label":"pupuri (gsgmdx9r6e)","roles":["review"],"url":"https://sah.borca.ai/u/gsgmdx9r6e"},{"id":1165,"public_id":"ezd9qvkvax","public_label":"The Reverser‮ (ezd9qvkvax)","roles":["review"],"url":"https://sah.borca.ai/u/ezd9qvkvax"}],"url":"https://sah.borca.ai/concepts/co_f3360ead5a2770063fe6285f78cc107b"},{"public_id":"co_fd3b6f57c5908b6f5002e7b4340760de","status":"active","name":"random effect","description":"Random selection of a neighbor to deliver packets, introduced as a stochastic element in the routing protocol.","types":["routing component"],"aliases":[],"contributors":[{"id":2,"public_id":"4715169a40","public_label":"AK (4715169a40)","roles":["extraction"],"url":"https://sah.borca.ai/u/4715169a40"},{"id":136,"public_id":"3c2apqe3ut","public_label":"Anonymous (3c2apqe3ut)","roles":["review"],"url":"https://sah.borca.ai/u/3c2apqe3ut"},{"id":170,"public_id":"gsgmdx9r6e","public_label":"pupuri (gsgmdx9r6e)","roles":["review"],"url":"https://sah.borca.ai/u/gsgmdx9r6e"},{"id":1165,"public_id":"ezd9qvkvax","public_label":"The Reverser‮ (ezd9qvkvax)","roles":["review"],"url":"https://sah.borca.ai/u/ezd9qvkvax"}],"url":"https://sah.borca.ai/concepts/co_fd3b6f57c5908b6f5002e7b4340760de"}],"external_ids":{"DOI":"10.1088/1367-2630/10/2/023025","ArXiv":"0711.1655","PubMed":null,"PubMedCentral":null,"MAG":2096796893,"DBLP":null,"ACL":null},"open_access":{"is_open_access":true,"pdf_url":"https://iopscience.iop.org/article/10.1088/1367-2630/10/2/023025/pdf","landing_url":"https://www.semanticscholar.org/paper/8dd903afe034ba2c15b6a1857fe971fc4bbb30d0","source":"semantic_scholar","pdf_url_source":"semantic_scholar_open_access_pdf","license":"CCBY","status":"GOLD","reason":null},"reference_availability":{"status":"available","references_indexed":true,"full_text_available":true,"full_text_source":"arxiv","count_basis":"semantic_scholar_metadata","extraction_status":"not_applicable","reason":null},"source":{"provider":"episteme2","base_corpus":"semantic_scholar_dump","freshness_mode":"unknown","basis":["semantic_scholar_metadata","postgres_metadata"],"limits":["paper metadata is based on indexed upstream scholarly datasets","claims and concepts are available only for extracted papers","absence of claims or concepts means no extracted graph data is available in this response"],"status":"available","degraded":false,"degraded_reasons":[],"diagnostics":{"status":"available","degraded":false,"degraded_reasons":[],"metadata_status":"available","graph_status":"available","abstract_status":"available"},"source_flags":1},"paper_id":632867,"paper_uid":"9fd728b7-c9b7-4b52-9c5e-c615aed73a25","canonical_identity":{"paper_id":632867,"paper_uid":"9fd728b7-c9b7-4b52-9c5e-c615aed73a25","identity_status":"available","lookup_basis":"semantic_scholar_external_id","compatibility_path":"corpus_id"},"url":"https://sah.borca.ai/papers/123667974"}