Finding K Shortest Paths in a Network Using Genetic Algorithm Article Swipe
Meenakshi Moza
,
Suresh Kumar
·
YOU?
·
· 2020
· Open Access
·
· DOI: https://doi.org/10.5815/ijcnis.2020.05.05
YOU?
·
· 2020
· Open Access
·
· DOI: https://doi.org/10.5815/ijcnis.2020.05.05
With the advent of new applications, different service needs come up. These needs could be in the form of reliability in delivering data, capacity amount in a particular range and certain amount of permissible delay. In order to provide high Quality of service to Networks, it is essential to provide a path between a given source and multiple destinations which satisfy certain constraints. For a domain catering to high QoS, there is a request of resources with certain constraints by all the applications. Speed and Scalability which are not flexible in terms of Network size and Topology are the basic issues to be considered here. Multimedia applications in general make use of k shortest paths whenever communication is to be carried out between a single source and one or more than one destination. In this paper, a genetic algorithm is used, which helps in determination of k shortest paths from a source node to more than one destination node, with bandwidth constraint. The algorithm makes use of the connection matrix as well as link bandwidth for determination of k shortest paths. The significance of using K shortest paths in a network is to increase Throughput and Packet delivery ratio.
Related Topics
Concepts
Computer science
Shortest path problem
Scalability
Computer network
Quality of service
Node (physics)
Network packet
Bandwidth (computing)
Network topology
Distributed computing
Path (computing)
Algorithm
Throughput
Theoretical computer science
Wireless
Graph
Telecommunications
Database
Engineering
Structural engineering
Metadata
- Type
- article
- Language
- en
- Landing Page
- https://doi.org/10.5815/ijcnis.2020.05.05
- http://www.mecs-press.org/ijcnis/ijcnis-v12-n5/IJCNIS-V12-N5-5.pdf
- OA Status
- diamond
- Cited By
- 4
- References
- 36
- Related Works
- 10
- OpenAlex ID
- https://openalex.org/W3096801152
All OpenAlex metadata
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W3096801152Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.5815/ijcnis.2020.05.05Digital Object Identifier
- Title
-
Finding K Shortest Paths in a Network Using Genetic AlgorithmWork title
- Type
-
articleOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2020Year of publication
- Publication date
-
2020-10-08Full publication date if available
- Authors
-
Meenakshi Moza, Suresh KumarList of authors in order
- Landing page
-
https://doi.org/10.5815/ijcnis.2020.05.05Publisher landing page
- PDF URL
-
https://www.mecs-press.org/ijcnis/ijcnis-v12-n5/IJCNIS-V12-N5-5.pdfDirect link to full text PDF
- Open access
-
YesWhether a free full text is available
- OA status
-
diamondOpen access status per OpenAlex
- OA URL
-
https://www.mecs-press.org/ijcnis/ijcnis-v12-n5/IJCNIS-V12-N5-5.pdfDirect OA link when available
- Concepts
-
Computer science, Shortest path problem, Scalability, Computer network, Quality of service, Node (physics), Network packet, Bandwidth (computing), Network topology, Distributed computing, Path (computing), Algorithm, Throughput, Theoretical computer science, Wireless, Graph, Telecommunications, Database, Engineering, Structural engineeringTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
4Total citation count in OpenAlex
- Citations by year (recent)
-
2025: 1, 2024: 1, 2023: 1, 2021: 1Per-year citation counts (last 5 years)
- References (count)
-
36Number of works referenced by this work
- Related works (count)
-
10Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W3096801152 |
|---|---|
| doi | https://doi.org/10.5815/ijcnis.2020.05.05 |
| ids.doi | https://doi.org/10.5815/ijcnis.2020.05.05 |
| ids.mag | 3096801152 |
| ids.openalex | https://openalex.org/W3096801152 |
| fwci | 0.33906488 |
| type | article |
| title | Finding K Shortest Paths in a Network Using Genetic Algorithm |
| biblio.issue | 5 |
| biblio.volume | 12 |
| biblio.last_page | 73 |
| biblio.first_page | 56 |
| topics[0].id | https://openalex.org/T10138 |
| topics[0].field.id | https://openalex.org/fields/17 |
| topics[0].field.display_name | Computer Science |
| topics[0].score | 0.9993000030517578 |
| topics[0].domain.id | https://openalex.org/domains/3 |
| topics[0].domain.display_name | Physical Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/1705 |
| topics[0].subfield.display_name | Computer Networks and Communications |
| topics[0].display_name | Network Traffic and Congestion Control |
| topics[1].id | https://openalex.org/T10847 |
| topics[1].field.id | https://openalex.org/fields/22 |
| topics[1].field.display_name | Engineering |
| topics[1].score | 0.9993000030517578 |
| topics[1].domain.id | https://openalex.org/domains/3 |
| topics[1].domain.display_name | Physical Sciences |
| topics[1].subfield.id | https://openalex.org/subfields/2208 |
| topics[1].subfield.display_name | Electrical and Electronic Engineering |
| topics[1].display_name | Advanced Optical Network Technologies |
| topics[2].id | https://openalex.org/T10714 |
| topics[2].field.id | https://openalex.org/fields/17 |
| topics[2].field.display_name | Computer Science |
| topics[2].score | 0.9987000226974487 |
| topics[2].domain.id | https://openalex.org/domains/3 |
| topics[2].domain.display_name | Physical Sciences |
| topics[2].subfield.id | https://openalex.org/subfields/1705 |
| topics[2].subfield.display_name | Computer Networks and Communications |
| topics[2].display_name | Software-Defined Networks and 5G |
| is_xpac | False |
| apc_list | |
| apc_paid | |
| concepts[0].id | https://openalex.org/C41008148 |
| concepts[0].level | 0 |
| concepts[0].score | 0.8881540298461914 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[0].display_name | Computer science |
| concepts[1].id | https://openalex.org/C22590252 |
| concepts[1].level | 3 |
| concepts[1].score | 0.6910247802734375 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q1058754 |
| concepts[1].display_name | Shortest path problem |
| concepts[2].id | https://openalex.org/C48044578 |
| concepts[2].level | 2 |
| concepts[2].score | 0.5964308381080627 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q727490 |
| concepts[2].display_name | Scalability |
| concepts[3].id | https://openalex.org/C31258907 |
| concepts[3].level | 1 |
| concepts[3].score | 0.5379211902618408 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q1301371 |
| concepts[3].display_name | Computer network |
| concepts[4].id | https://openalex.org/C5119721 |
| concepts[4].level | 2 |
| concepts[4].score | 0.5371916890144348 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q220501 |
| concepts[4].display_name | Quality of service |
| concepts[5].id | https://openalex.org/C62611344 |
| concepts[5].level | 2 |
| concepts[5].score | 0.515396237373352 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q1062658 |
| concepts[5].display_name | Node (physics) |
| concepts[6].id | https://openalex.org/C158379750 |
| concepts[6].level | 2 |
| concepts[6].score | 0.5116820335388184 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q214111 |
| concepts[6].display_name | Network packet |
| concepts[7].id | https://openalex.org/C2776257435 |
| concepts[7].level | 2 |
| concepts[7].score | 0.4932379126548767 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q1576430 |
| concepts[7].display_name | Bandwidth (computing) |
| concepts[8].id | https://openalex.org/C199845137 |
| concepts[8].level | 2 |
| concepts[8].score | 0.4483354687690735 |
| concepts[8].wikidata | https://www.wikidata.org/wiki/Q145490 |
| concepts[8].display_name | Network topology |
| concepts[9].id | https://openalex.org/C120314980 |
| concepts[9].level | 1 |
| concepts[9].score | 0.4454454481601715 |
| concepts[9].wikidata | https://www.wikidata.org/wiki/Q180634 |
| concepts[9].display_name | Distributed computing |
| concepts[10].id | https://openalex.org/C2777735758 |
| concepts[10].level | 2 |
| concepts[10].score | 0.43239080905914307 |
| concepts[10].wikidata | https://www.wikidata.org/wiki/Q817765 |
| concepts[10].display_name | Path (computing) |
| concepts[11].id | https://openalex.org/C11413529 |
| concepts[11].level | 1 |
| concepts[11].score | 0.4208764135837555 |
| concepts[11].wikidata | https://www.wikidata.org/wiki/Q8366 |
| concepts[11].display_name | Algorithm |
| concepts[12].id | https://openalex.org/C157764524 |
| concepts[12].level | 3 |
| concepts[12].score | 0.4142882525920868 |
| concepts[12].wikidata | https://www.wikidata.org/wiki/Q1383412 |
| concepts[12].display_name | Throughput |
| concepts[13].id | https://openalex.org/C80444323 |
| concepts[13].level | 1 |
| concepts[13].score | 0.2333175241947174 |
| concepts[13].wikidata | https://www.wikidata.org/wiki/Q2878974 |
| concepts[13].display_name | Theoretical computer science |
| concepts[14].id | https://openalex.org/C555944384 |
| concepts[14].level | 2 |
| concepts[14].score | 0.1371018886566162 |
| concepts[14].wikidata | https://www.wikidata.org/wiki/Q249 |
| concepts[14].display_name | Wireless |
| concepts[15].id | https://openalex.org/C132525143 |
| concepts[15].level | 2 |
| concepts[15].score | 0.09532228112220764 |
| concepts[15].wikidata | https://www.wikidata.org/wiki/Q141488 |
| concepts[15].display_name | Graph |
| concepts[16].id | https://openalex.org/C76155785 |
| concepts[16].level | 1 |
| concepts[16].score | 0.09376993775367737 |
| concepts[16].wikidata | https://www.wikidata.org/wiki/Q418 |
| concepts[16].display_name | Telecommunications |
| concepts[17].id | https://openalex.org/C77088390 |
| concepts[17].level | 1 |
| concepts[17].score | 0.0 |
| concepts[17].wikidata | https://www.wikidata.org/wiki/Q8513 |
| concepts[17].display_name | Database |
| concepts[18].id | https://openalex.org/C127413603 |
| concepts[18].level | 0 |
| concepts[18].score | 0.0 |
| concepts[18].wikidata | https://www.wikidata.org/wiki/Q11023 |
| concepts[18].display_name | Engineering |
| concepts[19].id | https://openalex.org/C66938386 |
| concepts[19].level | 1 |
| concepts[19].score | 0.0 |
| concepts[19].wikidata | https://www.wikidata.org/wiki/Q633538 |
| concepts[19].display_name | Structural engineering |
| keywords[0].id | https://openalex.org/keywords/computer-science |
| keywords[0].score | 0.8881540298461914 |
| keywords[0].display_name | Computer science |
| keywords[1].id | https://openalex.org/keywords/shortest-path-problem |
| keywords[1].score | 0.6910247802734375 |
| keywords[1].display_name | Shortest path problem |
| keywords[2].id | https://openalex.org/keywords/scalability |
| keywords[2].score | 0.5964308381080627 |
| keywords[2].display_name | Scalability |
| keywords[3].id | https://openalex.org/keywords/computer-network |
| keywords[3].score | 0.5379211902618408 |
| keywords[3].display_name | Computer network |
| keywords[4].id | https://openalex.org/keywords/quality-of-service |
| keywords[4].score | 0.5371916890144348 |
| keywords[4].display_name | Quality of service |
| keywords[5].id | https://openalex.org/keywords/node |
| keywords[5].score | 0.515396237373352 |
| keywords[5].display_name | Node (physics) |
| keywords[6].id | https://openalex.org/keywords/network-packet |
| keywords[6].score | 0.5116820335388184 |
| keywords[6].display_name | Network packet |
| keywords[7].id | https://openalex.org/keywords/bandwidth |
| keywords[7].score | 0.4932379126548767 |
| keywords[7].display_name | Bandwidth (computing) |
| keywords[8].id | https://openalex.org/keywords/network-topology |
| keywords[8].score | 0.4483354687690735 |
| keywords[8].display_name | Network topology |
| keywords[9].id | https://openalex.org/keywords/distributed-computing |
| keywords[9].score | 0.4454454481601715 |
| keywords[9].display_name | Distributed computing |
| keywords[10].id | https://openalex.org/keywords/path |
| keywords[10].score | 0.43239080905914307 |
| keywords[10].display_name | Path (computing) |
| keywords[11].id | https://openalex.org/keywords/algorithm |
| keywords[11].score | 0.4208764135837555 |
| keywords[11].display_name | Algorithm |
| keywords[12].id | https://openalex.org/keywords/throughput |
| keywords[12].score | 0.4142882525920868 |
| keywords[12].display_name | Throughput |
| keywords[13].id | https://openalex.org/keywords/theoretical-computer-science |
| keywords[13].score | 0.2333175241947174 |
| keywords[13].display_name | Theoretical computer science |
| keywords[14].id | https://openalex.org/keywords/wireless |
| keywords[14].score | 0.1371018886566162 |
| keywords[14].display_name | Wireless |
| keywords[15].id | https://openalex.org/keywords/graph |
| keywords[15].score | 0.09532228112220764 |
| keywords[15].display_name | Graph |
| keywords[16].id | https://openalex.org/keywords/telecommunications |
| keywords[16].score | 0.09376993775367737 |
| keywords[16].display_name | Telecommunications |
| language | en |
| locations[0].id | doi:10.5815/ijcnis.2020.05.05 |
| locations[0].is_oa | True |
| locations[0].source.id | https://openalex.org/S2501737937 |
| locations[0].source.issn | 2074-9090, 2074-9104 |
| locations[0].source.type | journal |
| locations[0].source.is_oa | True |
| locations[0].source.issn_l | 2074-9090 |
| locations[0].source.is_core | True |
| locations[0].source.is_in_doaj | False |
| locations[0].source.display_name | International Journal of Computer Network and Information Security |
| locations[0].source.host_organization | |
| locations[0].source.host_organization_name | |
| locations[0].license | |
| locations[0].pdf_url | http://www.mecs-press.org/ijcnis/ijcnis-v12-n5/IJCNIS-V12-N5-5.pdf |
| locations[0].version | publishedVersion |
| locations[0].raw_type | journal-article |
| locations[0].license_id | |
| locations[0].is_accepted | True |
| locations[0].is_published | True |
| locations[0].raw_source_name | International Journal of Computer Network and Information Security |
| locations[0].landing_page_url | https://doi.org/10.5815/ijcnis.2020.05.05 |
| indexed_in | crossref |
| authorships[0].author.id | https://openalex.org/A5073885005 |
| authorships[0].author.orcid | |
| authorships[0].author.display_name | Meenakshi Moza |
| authorships[0].countries | IN |
| authorships[0].affiliations[0].institution_ids | https://openalex.org/I55016150 |
| authorships[0].affiliations[0].raw_affiliation_string | MRIIRS/FET/CSE/Faridabad,Haryana,121003 |
| authorships[0].institutions[0].id | https://openalex.org/I55016150 |
| authorships[0].institutions[0].ror | https://ror.org/02kf4r633 |
| authorships[0].institutions[0].type | education |
| authorships[0].institutions[0].lineage | https://openalex.org/I4411591084, https://openalex.org/I55016150 |
| authorships[0].institutions[0].country_code | IN |
| authorships[0].institutions[0].display_name | Manav Rachna International Institute of Research and Studies |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Meenakshi Moza |
| authorships[0].is_corresponding | False |
| authorships[0].raw_affiliation_strings | MRIIRS/FET/CSE/Faridabad,Haryana,121003 |
| authorships[1].author.id | https://openalex.org/A5084921480 |
| authorships[1].author.orcid | https://orcid.org/0000-0002-7774-7052 |
| authorships[1].author.display_name | Suresh Kumar |
| authorships[1].countries | IN |
| authorships[1].affiliations[0].institution_ids | https://openalex.org/I55016150 |
| authorships[1].affiliations[0].raw_affiliation_string | MRIIRS/FET/CSE/Faridabad,Haryana,12100 |
| authorships[1].institutions[0].id | https://openalex.org/I55016150 |
| authorships[1].institutions[0].ror | https://ror.org/02kf4r633 |
| authorships[1].institutions[0].type | education |
| authorships[1].institutions[0].lineage | https://openalex.org/I4411591084, https://openalex.org/I55016150 |
| authorships[1].institutions[0].country_code | IN |
| authorships[1].institutions[0].display_name | Manav Rachna International Institute of Research and Studies |
| authorships[1].author_position | last |
| authorships[1].raw_author_name | Suresh Kumar |
| authorships[1].is_corresponding | False |
| authorships[1].raw_affiliation_strings | MRIIRS/FET/CSE/Faridabad,Haryana,12100 |
| has_content.pdf | True |
| has_content.grobid_xml | True |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | http://www.mecs-press.org/ijcnis/ijcnis-v12-n5/IJCNIS-V12-N5-5.pdf |
| open_access.oa_status | diamond |
| open_access.any_repository_has_fulltext | False |
| created_date | 2020-11-09T00:00:00 |
| display_name | Finding K Shortest Paths in a Network Using Genetic Algorithm |
| has_fulltext | True |
| is_retracted | False |
| updated_date | 2025-11-06T03:46:38.306776 |
| primary_topic.id | https://openalex.org/T10138 |
| primary_topic.field.id | https://openalex.org/fields/17 |
| primary_topic.field.display_name | Computer Science |
| primary_topic.score | 0.9993000030517578 |
| primary_topic.domain.id | https://openalex.org/domains/3 |
| primary_topic.domain.display_name | Physical Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/1705 |
| primary_topic.subfield.display_name | Computer Networks and Communications |
| primary_topic.display_name | Network Traffic and Congestion Control |
| related_works | https://openalex.org/W2086397253, https://openalex.org/W2133122801, https://openalex.org/W2136583354, https://openalex.org/W2111238207, https://openalex.org/W600422426, https://openalex.org/W2007156430, https://openalex.org/W3081478936, https://openalex.org/W2760721665, https://openalex.org/W2785612136, https://openalex.org/W2137811827 |
| cited_by_count | 4 |
| counts_by_year[0].year | 2025 |
| counts_by_year[0].cited_by_count | 1 |
| counts_by_year[1].year | 2024 |
| counts_by_year[1].cited_by_count | 1 |
| counts_by_year[2].year | 2023 |
| counts_by_year[2].cited_by_count | 1 |
| counts_by_year[3].year | 2021 |
| counts_by_year[3].cited_by_count | 1 |
| locations_count | 1 |
| best_oa_location.id | doi:10.5815/ijcnis.2020.05.05 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S2501737937 |
| best_oa_location.source.issn | 2074-9090, 2074-9104 |
| best_oa_location.source.type | journal |
| best_oa_location.source.is_oa | True |
| best_oa_location.source.issn_l | 2074-9090 |
| best_oa_location.source.is_core | True |
| best_oa_location.source.is_in_doaj | False |
| best_oa_location.source.display_name | International Journal of Computer Network and Information Security |
| best_oa_location.source.host_organization | |
| best_oa_location.source.host_organization_name | |
| best_oa_location.license | |
| best_oa_location.pdf_url | http://www.mecs-press.org/ijcnis/ijcnis-v12-n5/IJCNIS-V12-N5-5.pdf |
| best_oa_location.version | publishedVersion |
| best_oa_location.raw_type | journal-article |
| best_oa_location.license_id | |
| best_oa_location.is_accepted | True |
| best_oa_location.is_published | True |
| best_oa_location.raw_source_name | International Journal of Computer Network and Information Security |
| best_oa_location.landing_page_url | https://doi.org/10.5815/ijcnis.2020.05.05 |
| primary_location.id | doi:10.5815/ijcnis.2020.05.05 |
| primary_location.is_oa | True |
| primary_location.source.id | https://openalex.org/S2501737937 |
| primary_location.source.issn | 2074-9090, 2074-9104 |
| primary_location.source.type | journal |
| primary_location.source.is_oa | True |
| primary_location.source.issn_l | 2074-9090 |
| primary_location.source.is_core | True |
| primary_location.source.is_in_doaj | False |
| primary_location.source.display_name | International Journal of Computer Network and Information Security |
| primary_location.source.host_organization | |
| primary_location.source.host_organization_name | |
| primary_location.license | |
| primary_location.pdf_url | http://www.mecs-press.org/ijcnis/ijcnis-v12-n5/IJCNIS-V12-N5-5.pdf |
| primary_location.version | publishedVersion |
| primary_location.raw_type | journal-article |
| primary_location.license_id | |
| primary_location.is_accepted | True |
| primary_location.is_published | True |
| primary_location.raw_source_name | International Journal of Computer Network and Information Security |
| primary_location.landing_page_url | https://doi.org/10.5815/ijcnis.2020.05.05 |
| publication_date | 2020-10-08 |
| publication_year | 2020 |
| referenced_works | https://openalex.org/W4238820382, https://openalex.org/W2022573578, https://openalex.org/W2768558236, https://openalex.org/W2005482560, https://openalex.org/W6686550414, https://openalex.org/W2175109984, https://openalex.org/W2417190917, https://openalex.org/W2509829918, https://openalex.org/W2560363104, https://openalex.org/W7052322119, https://openalex.org/W2113097130, https://openalex.org/W1968081062, https://openalex.org/W6676407323, https://openalex.org/W2019370291, https://openalex.org/W1903010842, https://openalex.org/W2055077767, https://openalex.org/W6738190353, https://openalex.org/W2332342711, https://openalex.org/W2624028303, https://openalex.org/W2397710702, https://openalex.org/W2604146997, https://openalex.org/W7030278151, https://openalex.org/W4236245180, https://openalex.org/W2770729327, https://openalex.org/W4299836635, https://openalex.org/W3104024776, https://openalex.org/W2977275967, https://openalex.org/W2185682898, https://openalex.org/W4247272275, https://openalex.org/W2148653444, https://openalex.org/W2963356158, https://openalex.org/W2790546128, https://openalex.org/W2077725184, https://openalex.org/W4302610405, https://openalex.org/W2108213534, https://openalex.org/W2626056459 |
| referenced_works_count | 36 |
| abstract_inverted_index.K | 185 |
| abstract_inverted_index.a | 26, 50, 53, 64, 72, 123, 136, 150, 189 |
| abstract_inverted_index.k | 112, 146, 178 |
| abstract_inverted_index.In | 35, 133 |
| abstract_inverted_index.as | 170, 172 |
| abstract_inverted_index.be | 14, 102, 119 |
| abstract_inverted_index.by | 79 |
| abstract_inverted_index.in | 15, 20, 25, 90, 107, 143, 188 |
| abstract_inverted_index.is | 46, 71, 117, 139, 191 |
| abstract_inverted_index.it | 45 |
| abstract_inverted_index.of | 3, 18, 32, 41, 74, 92, 111, 145, 166, 177, 183 |
| abstract_inverted_index.or | 128 |
| abstract_inverted_index.to | 37, 43, 48, 67, 101, 118, 153, 192 |
| abstract_inverted_index.For | 63 |
| abstract_inverted_index.The | 162, 181 |
| abstract_inverted_index.all | 80 |
| abstract_inverted_index.and | 29, 56, 84, 95, 126, 195 |
| abstract_inverted_index.are | 87, 97 |
| abstract_inverted_index.for | 175 |
| abstract_inverted_index.new | 4 |
| abstract_inverted_index.not | 88 |
| abstract_inverted_index.one | 127, 131, 156 |
| abstract_inverted_index.out | 121 |
| abstract_inverted_index.the | 1, 16, 81, 98, 167 |
| abstract_inverted_index.up. | 10 |
| abstract_inverted_index.use | 110, 165 |
| abstract_inverted_index.QoS, | 69 |
| abstract_inverted_index.With | 0 |
| abstract_inverted_index.come | 9 |
| abstract_inverted_index.form | 17 |
| abstract_inverted_index.from | 149 |
| abstract_inverted_index.high | 39, 68 |
| abstract_inverted_index.link | 173 |
| abstract_inverted_index.make | 109 |
| abstract_inverted_index.more | 129, 154 |
| abstract_inverted_index.node | 152 |
| abstract_inverted_index.path | 51 |
| abstract_inverted_index.size | 94 |
| abstract_inverted_index.than | 130, 155 |
| abstract_inverted_index.this | 134 |
| abstract_inverted_index.well | 171 |
| abstract_inverted_index.with | 76, 159 |
| abstract_inverted_index.Speed | 83 |
| abstract_inverted_index.These | 11 |
| abstract_inverted_index.basic | 99 |
| abstract_inverted_index.could | 13 |
| abstract_inverted_index.data, | 22 |
| abstract_inverted_index.given | 54 |
| abstract_inverted_index.helps | 142 |
| abstract_inverted_index.here. | 104 |
| abstract_inverted_index.makes | 164 |
| abstract_inverted_index.needs | 8, 12 |
| abstract_inverted_index.node, | 158 |
| abstract_inverted_index.order | 36 |
| abstract_inverted_index.paths | 114, 148, 187 |
| abstract_inverted_index.range | 28 |
| abstract_inverted_index.terms | 91 |
| abstract_inverted_index.there | 70 |
| abstract_inverted_index.used, | 140 |
| abstract_inverted_index.using | 184 |
| abstract_inverted_index.which | 59, 86, 141 |
| abstract_inverted_index.Packet | 196 |
| abstract_inverted_index.advent | 2 |
| abstract_inverted_index.amount | 24, 31 |
| abstract_inverted_index.delay. | 34 |
| abstract_inverted_index.domain | 65 |
| abstract_inverted_index.issues | 100 |
| abstract_inverted_index.matrix | 169 |
| abstract_inverted_index.paper, | 135 |
| abstract_inverted_index.paths. | 180 |
| abstract_inverted_index.ratio. | 198 |
| abstract_inverted_index.single | 124 |
| abstract_inverted_index.source | 55, 125, 151 |
| abstract_inverted_index.Network | 93 |
| abstract_inverted_index.Quality | 40 |
| abstract_inverted_index.between | 52, 122 |
| abstract_inverted_index.carried | 120 |
| abstract_inverted_index.certain | 30, 61, 77 |
| abstract_inverted_index.general | 108 |
| abstract_inverted_index.genetic | 137 |
| abstract_inverted_index.network | 190 |
| abstract_inverted_index.provide | 38, 49 |
| abstract_inverted_index.request | 73 |
| abstract_inverted_index.satisfy | 60 |
| abstract_inverted_index.service | 7, 42 |
| abstract_inverted_index.Topology | 96 |
| abstract_inverted_index.capacity | 23 |
| abstract_inverted_index.catering | 66 |
| abstract_inverted_index.delivery | 197 |
| abstract_inverted_index.flexible | 89 |
| abstract_inverted_index.increase | 193 |
| abstract_inverted_index.multiple | 57 |
| abstract_inverted_index.shortest | 113, 147, 179, 186 |
| abstract_inverted_index.whenever | 115 |
| abstract_inverted_index.Networks, | 44 |
| abstract_inverted_index.algorithm | 138, 163 |
| abstract_inverted_index.bandwidth | 160, 174 |
| abstract_inverted_index.different | 6 |
| abstract_inverted_index.essential | 47 |
| abstract_inverted_index.resources | 75 |
| abstract_inverted_index.Multimedia | 105 |
| abstract_inverted_index.Throughput | 194 |
| abstract_inverted_index.connection | 168 |
| abstract_inverted_index.considered | 103 |
| abstract_inverted_index.delivering | 21 |
| abstract_inverted_index.particular | 27 |
| abstract_inverted_index.Scalability | 85 |
| abstract_inverted_index.constraint. | 161 |
| abstract_inverted_index.constraints | 78 |
| abstract_inverted_index.destination | 157 |
| abstract_inverted_index.permissible | 33 |
| abstract_inverted_index.reliability | 19 |
| abstract_inverted_index.applications | 106 |
| abstract_inverted_index.constraints. | 62 |
| abstract_inverted_index.destination. | 132 |
| abstract_inverted_index.destinations | 58 |
| abstract_inverted_index.significance | 182 |
| abstract_inverted_index.applications, | 5 |
| abstract_inverted_index.applications. | 82 |
| abstract_inverted_index.communication | 116 |
| abstract_inverted_index.determination | 144, 176 |
| cited_by_percentile_year.max | 95 |
| cited_by_percentile_year.min | 89 |
| countries_distinct_count | 1 |
| institutions_distinct_count | 2 |
| sustainable_development_goals[0].id | https://metadata.un.org/sdg/9 |
| sustainable_development_goals[0].score | 0.550000011920929 |
| sustainable_development_goals[0].display_name | Industry, innovation and infrastructure |
| citation_normalized_percentile.value | 0.62591847 |
| citation_normalized_percentile.is_in_top_1_percent | False |
| citation_normalized_percentile.is_in_top_10_percent | False |