Polymorphic Path Transferring for Secure Flow Delivery Article Swipe
In most cases, the routing policy of networks shows a preference for a static one-to-one mapping of communication pairs to routing paths, which offers adversaries a great advantage to conduct thorough reconnaissance and organize an effective attack in a stress-free manner. With the evolution of network intelligence, some flexible and adaptive routing policies have already proposed to intensify the network defender to turn the situation. Routing mutation is an effective strategy that can invalidate the unvarying nature of routing information that attackers have collected from exploiting the static configuration of the network. However, three constraints execute press on routing mutation deployment in practical: insufficient route mutation space, expensive control costs, and incompatibility. To enhance the availability of route mutation, we propose an OpenFlow-based route mutation technique called Polymorphic Path Transferring (PPT), which adopts a physical and virtual path segment mixed construction technique to enlarge the routing path space for elevating the security of communication. Based on the Markov Decision Process, with considering flows distribution in the network, the PPT adopts an evolution routing path scheduling algorithm with a segment path update strategy, which relieves the press on the overhead of control and incompatibility. Our analysis demonstrates that PPT can secure data delivery in the worst network environment while countering sophisticated attacks in an evasion-free manner (e.g., advanced persistent threat). Case study and experiment results show its effectiveness in proactively defending against targeted attacks and its advantage compared with previous route mutation methods.
Related Topics
Concepts
Metadata
- Type
- article
- Language
- en
- Landing Page
- http://itiis.org/digital-library/24877
- OA Status
- green
- References
- 18
- Related Works
- 20
- OpenAlex ID
- https://openalex.org/W3197450634
All OpenAlex metadata
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W3197450634Canonical identifier for this work in OpenAlex
- Title
-
Polymorphic Path Transferring for Secure Flow DeliveryWork title
- Type
-
articleOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2021Year of publication
- Publication date
-
2021-08-31Full publication date if available
- Authors
-
Rongbo Zhang, Xin Li, Yan ZhanList of authors in order
- Landing page
-
https://itiis.org/digital-library/24877Publisher landing page
- Open access
-
YesWhether a free full text is available
- OA status
-
greenOpen access status per OpenAlex
- OA URL
-
https://itiis.org/digital-library/24877Direct OA link when available
- Concepts
-
Computer science, Computer network, Routing (electronic design automation), Static routing, Distributed computing, Equal-cost multi-path routing, Path (computing), Overhead (engineering), Scheduling (production processes), Routing protocol, Mathematical optimization, Mathematics, Operating systemTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
0Total citation count in OpenAlex
- References (count)
-
18Number of works referenced by this work
- Related works (count)
-
20Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W3197450634 |
|---|---|
| doi | |
| ids.mag | 3197450634 |
| ids.openalex | https://openalex.org/W3197450634 |
| fwci | 0.0 |
| type | article |
| title | Polymorphic Path Transferring for Secure Flow Delivery |
| biblio.issue | 8 |
| biblio.volume | 15 |
| biblio.last_page | 2826 |
| biblio.first_page | 2805 |
| topics[0].id | https://openalex.org/T10400 |
| topics[0].field.id | https://openalex.org/fields/17 |
| topics[0].field.display_name | Computer Science |
| topics[0].score | 0.9997000098228455 |
| 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 Security and Intrusion Detection |
| topics[1].id | https://openalex.org/T10714 |
| topics[1].field.id | https://openalex.org/fields/17 |
| topics[1].field.display_name | Computer Science |
| topics[1].score | 0.9995999932289124 |
| topics[1].domain.id | https://openalex.org/domains/3 |
| topics[1].domain.display_name | Physical Sciences |
| topics[1].subfield.id | https://openalex.org/subfields/1705 |
| topics[1].subfield.display_name | Computer Networks and Communications |
| topics[1].display_name | Software-Defined Networks and 5G |
| topics[2].id | https://openalex.org/T11598 |
| topics[2].field.id | https://openalex.org/fields/17 |
| topics[2].field.display_name | Computer Science |
| topics[2].score | 0.9977999925613403 |
| topics[2].domain.id | https://openalex.org/domains/3 |
| topics[2].domain.display_name | Physical Sciences |
| topics[2].subfield.id | https://openalex.org/subfields/1702 |
| topics[2].subfield.display_name | Artificial Intelligence |
| topics[2].display_name | Internet Traffic Analysis and Secure E-voting |
| is_xpac | False |
| apc_list | |
| apc_paid | |
| concepts[0].id | https://openalex.org/C41008148 |
| concepts[0].level | 0 |
| concepts[0].score | 0.8479723334312439 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[0].display_name | Computer science |
| concepts[1].id | https://openalex.org/C31258907 |
| concepts[1].level | 1 |
| concepts[1].score | 0.6066085696220398 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q1301371 |
| concepts[1].display_name | Computer network |
| concepts[2].id | https://openalex.org/C74172769 |
| concepts[2].level | 2 |
| concepts[2].score | 0.5756837725639343 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q1446839 |
| concepts[2].display_name | Routing (electronic design automation) |
| concepts[3].id | https://openalex.org/C204948658 |
| concepts[3].level | 4 |
| concepts[3].score | 0.556326150894165 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q1119410 |
| concepts[3].display_name | Static routing |
| concepts[4].id | https://openalex.org/C120314980 |
| concepts[4].level | 1 |
| concepts[4].score | 0.5282363295555115 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q180634 |
| concepts[4].display_name | Distributed computing |
| concepts[5].id | https://openalex.org/C115443555 |
| concepts[5].level | 5 |
| concepts[5].score | 0.5051334500312805 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q5367790 |
| concepts[5].display_name | Equal-cost multi-path routing |
| concepts[6].id | https://openalex.org/C2777735758 |
| concepts[6].level | 2 |
| concepts[6].score | 0.47843506932258606 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q817765 |
| concepts[6].display_name | Path (computing) |
| concepts[7].id | https://openalex.org/C2779960059 |
| concepts[7].level | 2 |
| concepts[7].score | 0.4185212254524231 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q7113681 |
| concepts[7].display_name | Overhead (engineering) |
| concepts[8].id | https://openalex.org/C206729178 |
| concepts[8].level | 2 |
| concepts[8].score | 0.4176388680934906 |
| concepts[8].wikidata | https://www.wikidata.org/wiki/Q2271896 |
| concepts[8].display_name | Scheduling (production processes) |
| concepts[9].id | https://openalex.org/C104954878 |
| concepts[9].level | 3 |
| concepts[9].score | 0.26055681705474854 |
| concepts[9].wikidata | https://www.wikidata.org/wiki/Q1648707 |
| concepts[9].display_name | Routing protocol |
| concepts[10].id | https://openalex.org/C126255220 |
| concepts[10].level | 1 |
| concepts[10].score | 0.19792664051055908 |
| concepts[10].wikidata | https://www.wikidata.org/wiki/Q141495 |
| concepts[10].display_name | Mathematical optimization |
| concepts[11].id | https://openalex.org/C33923547 |
| concepts[11].level | 0 |
| concepts[11].score | 0.0 |
| concepts[11].wikidata | https://www.wikidata.org/wiki/Q395 |
| concepts[11].display_name | Mathematics |
| concepts[12].id | https://openalex.org/C111919701 |
| concepts[12].level | 1 |
| concepts[12].score | 0.0 |
| concepts[12].wikidata | https://www.wikidata.org/wiki/Q9135 |
| concepts[12].display_name | Operating system |
| keywords[0].id | https://openalex.org/keywords/computer-science |
| keywords[0].score | 0.8479723334312439 |
| keywords[0].display_name | Computer science |
| keywords[1].id | https://openalex.org/keywords/computer-network |
| keywords[1].score | 0.6066085696220398 |
| keywords[1].display_name | Computer network |
| keywords[2].id | https://openalex.org/keywords/routing |
| keywords[2].score | 0.5756837725639343 |
| keywords[2].display_name | Routing (electronic design automation) |
| keywords[3].id | https://openalex.org/keywords/static-routing |
| keywords[3].score | 0.556326150894165 |
| keywords[3].display_name | Static routing |
| keywords[4].id | https://openalex.org/keywords/distributed-computing |
| keywords[4].score | 0.5282363295555115 |
| keywords[4].display_name | Distributed computing |
| keywords[5].id | https://openalex.org/keywords/equal-cost-multi-path-routing |
| keywords[5].score | 0.5051334500312805 |
| keywords[5].display_name | Equal-cost multi-path routing |
| keywords[6].id | https://openalex.org/keywords/path |
| keywords[6].score | 0.47843506932258606 |
| keywords[6].display_name | Path (computing) |
| keywords[7].id | https://openalex.org/keywords/overhead |
| keywords[7].score | 0.4185212254524231 |
| keywords[7].display_name | Overhead (engineering) |
| keywords[8].id | https://openalex.org/keywords/scheduling |
| keywords[8].score | 0.4176388680934906 |
| keywords[8].display_name | Scheduling (production processes) |
| keywords[9].id | https://openalex.org/keywords/routing-protocol |
| keywords[9].score | 0.26055681705474854 |
| keywords[9].display_name | Routing protocol |
| keywords[10].id | https://openalex.org/keywords/mathematical-optimization |
| keywords[10].score | 0.19792664051055908 |
| keywords[10].display_name | Mathematical optimization |
| language | en |
| locations[0].id | mag:3197450634 |
| locations[0].is_oa | True |
| locations[0].source.id | https://openalex.org/S204131793 |
| locations[0].source.issn | 1976-7277, 2288-1468 |
| locations[0].source.type | journal |
| locations[0].source.is_oa | True |
| locations[0].source.issn_l | 1976-7277 |
| locations[0].source.is_core | True |
| locations[0].source.is_in_doaj | False |
| locations[0].source.display_name | KSII Transactions on Internet and Information Systems |
| locations[0].source.host_organization | https://openalex.org/P4323966148 |
| locations[0].source.host_organization_name | Korea Society of Internet Information |
| locations[0].source.host_organization_lineage | https://openalex.org/P4323966148 |
| locations[0].source.host_organization_lineage_names | Korea Society of Internet Information |
| locations[0].license | |
| locations[0].pdf_url | |
| locations[0].version | |
| locations[0].raw_type | |
| locations[0].license_id | |
| locations[0].is_accepted | False |
| locations[0].is_published | |
| locations[0].raw_source_name | KSII Transactions on Internet and Information Systems |
| locations[0].landing_page_url | http://itiis.org/digital-library/24877 |
| authorships[0].author.id | https://openalex.org/A5102974708 |
| authorships[0].author.orcid | https://orcid.org/0000-0003-4298-8646 |
| authorships[0].author.display_name | Rongbo Zhang |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Rongbo Zhang |
| authorships[0].is_corresponding | False |
| authorships[1].author.id | https://openalex.org/A5100353780 |
| authorships[1].author.orcid | https://orcid.org/0000-0002-0041-3134 |
| authorships[1].author.display_name | Xin Li |
| authorships[1].author_position | middle |
| authorships[1].raw_author_name | Xin Li |
| authorships[1].is_corresponding | False |
| authorships[2].author.id | https://openalex.org/A5101764597 |
| authorships[2].author.orcid | https://orcid.org/0000-0002-1519-486X |
| authorships[2].author.display_name | Yan Zhan |
| authorships[2].author_position | last |
| authorships[2].raw_author_name | Yan Zhan |
| authorships[2].is_corresponding | False |
| has_content.pdf | False |
| has_content.grobid_xml | False |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | http://itiis.org/digital-library/24877 |
| open_access.oa_status | green |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | Polymorphic Path Transferring for Secure Flow Delivery |
| has_fulltext | False |
| is_retracted | False |
| updated_date | 2025-10-10T17:16:08.811792 |
| primary_topic.id | https://openalex.org/T10400 |
| primary_topic.field.id | https://openalex.org/fields/17 |
| primary_topic.field.display_name | Computer Science |
| primary_topic.score | 0.9997000098228455 |
| 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 Security and Intrusion Detection |
| related_works | https://openalex.org/W2556654295, https://openalex.org/W2069991221, https://openalex.org/W3159103225, https://openalex.org/W2749125334, https://openalex.org/W2100998261, https://openalex.org/W2184766758, https://openalex.org/W2185254009, https://openalex.org/W2553973061, https://openalex.org/W2618617250, https://openalex.org/W2089888150, https://openalex.org/W2589155698, https://openalex.org/W2914228115, https://openalex.org/W3106674504, https://openalex.org/W2335855723, https://openalex.org/W1914375718, https://openalex.org/W2401198779, https://openalex.org/W1672365780, https://openalex.org/W2952845749, https://openalex.org/W2951545774, https://openalex.org/W2540148409 |
| cited_by_count | 0 |
| locations_count | 1 |
| best_oa_location.id | mag:3197450634 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S204131793 |
| best_oa_location.source.issn | 1976-7277, 2288-1468 |
| best_oa_location.source.type | journal |
| best_oa_location.source.is_oa | True |
| best_oa_location.source.issn_l | 1976-7277 |
| best_oa_location.source.is_core | True |
| best_oa_location.source.is_in_doaj | False |
| best_oa_location.source.display_name | KSII Transactions on Internet and Information Systems |
| best_oa_location.source.host_organization | https://openalex.org/P4323966148 |
| best_oa_location.source.host_organization_name | Korea Society of Internet Information |
| best_oa_location.source.host_organization_lineage | https://openalex.org/P4323966148 |
| best_oa_location.source.host_organization_lineage_names | Korea Society of Internet Information |
| best_oa_location.license | |
| best_oa_location.pdf_url | |
| best_oa_location.version | |
| best_oa_location.raw_type | |
| best_oa_location.license_id | |
| best_oa_location.is_accepted | False |
| best_oa_location.is_published | False |
| best_oa_location.raw_source_name | KSII Transactions on Internet and Information Systems |
| best_oa_location.landing_page_url | http://itiis.org/digital-library/24877 |
| primary_location.id | mag:3197450634 |
| primary_location.is_oa | True |
| primary_location.source.id | https://openalex.org/S204131793 |
| primary_location.source.issn | 1976-7277, 2288-1468 |
| primary_location.source.type | journal |
| primary_location.source.is_oa | True |
| primary_location.source.issn_l | 1976-7277 |
| primary_location.source.is_core | True |
| primary_location.source.is_in_doaj | False |
| primary_location.source.display_name | KSII Transactions on Internet and Information Systems |
| primary_location.source.host_organization | https://openalex.org/P4323966148 |
| primary_location.source.host_organization_name | Korea Society of Internet Information |
| primary_location.source.host_organization_lineage | https://openalex.org/P4323966148 |
| primary_location.source.host_organization_lineage_names | Korea Society of Internet Information |
| primary_location.license | |
| primary_location.pdf_url | |
| primary_location.version | |
| primary_location.raw_type | |
| primary_location.license_id | |
| primary_location.is_accepted | False |
| primary_location.is_published | False |
| primary_location.raw_source_name | KSII Transactions on Internet and Information Systems |
| primary_location.landing_page_url | http://itiis.org/digital-library/24877 |
| publication_date | 2021-08-31 |
| publication_year | 2021 |
| referenced_works | https://openalex.org/W3008342895, https://openalex.org/W3011245944, https://openalex.org/W1904925675, https://openalex.org/W3087576977, https://openalex.org/W2765722122, https://openalex.org/W3045512880, https://openalex.org/W1952698709, https://openalex.org/W3024348047, https://openalex.org/W2996903041, https://openalex.org/W3040922540, https://openalex.org/W2897184757, https://openalex.org/W2811017102, https://openalex.org/W2768319082, https://openalex.org/W2020325966, https://openalex.org/W1986495842, https://openalex.org/W3013219028, https://openalex.org/W2769436261, https://openalex.org/W2177808409 |
| referenced_works_count | 18 |
| abstract_inverted_index.a | 9, 12, 25, 38, 133, 177 |
| abstract_inverted_index.In | 0 |
| abstract_inverted_index.To | 112 |
| abstract_inverted_index.an | 34, 68, 121, 170, 212 |
| abstract_inverted_index.in | 37, 101, 164, 202, 211, 227 |
| abstract_inverted_index.is | 67 |
| abstract_inverted_index.of | 6, 16, 44, 77, 89, 116, 152, 189 |
| abstract_inverted_index.on | 97, 155, 186 |
| abstract_inverted_index.to | 19, 28, 56, 61, 142 |
| abstract_inverted_index.we | 119 |
| abstract_inverted_index.Our | 193 |
| abstract_inverted_index.PPT | 168, 197 |
| abstract_inverted_index.and | 32, 49, 110, 135, 191, 221, 233 |
| abstract_inverted_index.can | 72, 198 |
| abstract_inverted_index.for | 11, 148 |
| abstract_inverted_index.its | 225, 234 |
| abstract_inverted_index.the | 3, 42, 58, 63, 74, 86, 90, 114, 144, 150, 156, 165, 167, 184, 187, 203 |
| abstract_inverted_index.Case | 219 |
| abstract_inverted_index.Path | 128 |
| abstract_inverted_index.With | 41 |
| abstract_inverted_index.data | 200 |
| abstract_inverted_index.from | 84 |
| abstract_inverted_index.have | 53, 82 |
| abstract_inverted_index.most | 1 |
| abstract_inverted_index.path | 137, 146, 173, 179 |
| abstract_inverted_index.show | 224 |
| abstract_inverted_index.some | 47 |
| abstract_inverted_index.that | 71, 80, 196 |
| abstract_inverted_index.turn | 62 |
| abstract_inverted_index.with | 160, 176, 237 |
| abstract_inverted_index.Based | 154 |
| abstract_inverted_index.flows | 162 |
| abstract_inverted_index.great | 26 |
| abstract_inverted_index.mixed | 139 |
| abstract_inverted_index.pairs | 18 |
| abstract_inverted_index.press | 96, 185 |
| abstract_inverted_index.route | 104, 117, 123, 239 |
| abstract_inverted_index.shows | 8 |
| abstract_inverted_index.space | 147 |
| abstract_inverted_index.study | 220 |
| abstract_inverted_index.three | 93 |
| abstract_inverted_index.which | 22, 131, 182 |
| abstract_inverted_index.while | 207 |
| abstract_inverted_index.worst | 204 |
| abstract_inverted_index.(PPT), | 130 |
| abstract_inverted_index.(e.g., | 215 |
| abstract_inverted_index.Markov | 157 |
| abstract_inverted_index.adopts | 132, 169 |
| abstract_inverted_index.attack | 36 |
| abstract_inverted_index.called | 126 |
| abstract_inverted_index.cases, | 2 |
| abstract_inverted_index.costs, | 109 |
| abstract_inverted_index.manner | 214 |
| abstract_inverted_index.nature | 76 |
| abstract_inverted_index.offers | 23 |
| abstract_inverted_index.paths, | 21 |
| abstract_inverted_index.policy | 5 |
| abstract_inverted_index.secure | 199 |
| abstract_inverted_index.space, | 106 |
| abstract_inverted_index.static | 13, 87 |
| abstract_inverted_index.update | 180 |
| abstract_inverted_index.Routing | 65 |
| abstract_inverted_index.against | 230 |
| abstract_inverted_index.already | 54 |
| abstract_inverted_index.attacks | 210, 232 |
| abstract_inverted_index.conduct | 29 |
| abstract_inverted_index.control | 108, 190 |
| abstract_inverted_index.enhance | 113 |
| abstract_inverted_index.enlarge | 143 |
| abstract_inverted_index.execute | 95 |
| abstract_inverted_index.manner. | 40 |
| abstract_inverted_index.mapping | 15 |
| abstract_inverted_index.network | 45, 59, 205 |
| abstract_inverted_index.propose | 120 |
| abstract_inverted_index.results | 223 |
| abstract_inverted_index.routing | 4, 20, 51, 78, 98, 145, 172 |
| abstract_inverted_index.segment | 138, 178 |
| abstract_inverted_index.virtual | 136 |
| abstract_inverted_index.Decision | 158 |
| abstract_inverted_index.However, | 92 |
| abstract_inverted_index.Process, | 159 |
| abstract_inverted_index.adaptive | 50 |
| abstract_inverted_index.advanced | 216 |
| abstract_inverted_index.analysis | 194 |
| abstract_inverted_index.compared | 236 |
| abstract_inverted_index.defender | 60 |
| abstract_inverted_index.delivery | 201 |
| abstract_inverted_index.flexible | 48 |
| abstract_inverted_index.methods. | 241 |
| abstract_inverted_index.mutation | 66, 99, 105, 124, 240 |
| abstract_inverted_index.network, | 166 |
| abstract_inverted_index.network. | 91 |
| abstract_inverted_index.networks | 7 |
| abstract_inverted_index.organize | 33 |
| abstract_inverted_index.overhead | 188 |
| abstract_inverted_index.physical | 134 |
| abstract_inverted_index.policies | 52 |
| abstract_inverted_index.previous | 238 |
| abstract_inverted_index.proposed | 55 |
| abstract_inverted_index.relieves | 183 |
| abstract_inverted_index.security | 151 |
| abstract_inverted_index.strategy | 70 |
| abstract_inverted_index.targeted | 231 |
| abstract_inverted_index.thorough | 30 |
| abstract_inverted_index.threat). | 218 |
| abstract_inverted_index.advantage | 27, 235 |
| abstract_inverted_index.algorithm | 175 |
| abstract_inverted_index.attackers | 81 |
| abstract_inverted_index.collected | 83 |
| abstract_inverted_index.defending | 229 |
| abstract_inverted_index.effective | 35, 69 |
| abstract_inverted_index.elevating | 149 |
| abstract_inverted_index.evolution | 43, 171 |
| abstract_inverted_index.expensive | 107 |
| abstract_inverted_index.intensify | 57 |
| abstract_inverted_index.mutation, | 118 |
| abstract_inverted_index.strategy, | 181 |
| abstract_inverted_index.technique | 125, 141 |
| abstract_inverted_index.unvarying | 75 |
| abstract_inverted_index.countering | 208 |
| abstract_inverted_index.deployment | 100 |
| abstract_inverted_index.experiment | 222 |
| abstract_inverted_index.exploiting | 85 |
| abstract_inverted_index.invalidate | 73 |
| abstract_inverted_index.one-to-one | 14 |
| abstract_inverted_index.persistent | 217 |
| abstract_inverted_index.practical: | 102 |
| abstract_inverted_index.preference | 10 |
| abstract_inverted_index.scheduling | 174 |
| abstract_inverted_index.situation. | 64 |
| abstract_inverted_index.Polymorphic | 127 |
| abstract_inverted_index.adversaries | 24 |
| abstract_inverted_index.considering | 161 |
| abstract_inverted_index.constraints | 94 |
| abstract_inverted_index.environment | 206 |
| abstract_inverted_index.information | 79 |
| abstract_inverted_index.proactively | 228 |
| abstract_inverted_index.stress-free | 39 |
| abstract_inverted_index.Transferring | 129 |
| abstract_inverted_index.availability | 115 |
| abstract_inverted_index.construction | 140 |
| abstract_inverted_index.demonstrates | 195 |
| abstract_inverted_index.distribution | 163 |
| abstract_inverted_index.evasion-free | 213 |
| abstract_inverted_index.insufficient | 103 |
| abstract_inverted_index.communication | 17 |
| abstract_inverted_index.configuration | 88 |
| abstract_inverted_index.effectiveness | 226 |
| abstract_inverted_index.intelligence, | 46 |
| abstract_inverted_index.sophisticated | 209 |
| abstract_inverted_index.OpenFlow-based | 122 |
| abstract_inverted_index.communication. | 153 |
| abstract_inverted_index.reconnaissance | 31 |
| abstract_inverted_index.incompatibility. | 111, 192 |
| cited_by_percentile_year | |
| countries_distinct_count | 0 |
| institutions_distinct_count | 3 |
| sustainable_development_goals[0].id | https://metadata.un.org/sdg/16 |
| sustainable_development_goals[0].score | 0.7200000286102295 |
| sustainable_development_goals[0].display_name | Peace, Justice and strong institutions |
| citation_normalized_percentile.value | 0.14919412 |
| citation_normalized_percentile.is_in_top_1_percent | False |
| citation_normalized_percentile.is_in_top_10_percent | False |