{"id":"https://openalex.org/W2039730337","doi":"https://doi.org/10.1109/icnidc.2012.6418763","title":"Research based on the specific optimizing strategy for network flow monitoring","display_name":"Research based on the specific optimizing strategy for network flow monitoring","publication_year":2012,"publication_date":"2012-09-01","ids":{"openalex":"https://openalex.org/W2039730337","doi":"https://doi.org/10.1109/icnidc.2012.6418763","mag":"2039730337"},"language":"en","primary_location":{"id":"doi:10.1109/icnidc.2012.6418763","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnidc.2012.6418763","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 3rd IEEE International Conference on Network Infrastructure and Digital Content","raw_type":"proceedings-article"},"type":"article","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/A5012691597","display_name":"Xinjian Zhuo","orcid":"https://orcid.org/0000-0001-7204-7463"},"institutions":[{"id":"https://openalex.org/I139759216","display_name":"Beijing University of Posts and Telecommunications","ror":"https://ror.org/04w9fbh59","country_code":"CN","type":"education","lineage":["https://openalex.org/I139759216"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Xinjian Zhuo","raw_affiliation_strings":["Beijing University of Posts and Telecommunications, Beijing, China","Beijing University of Posts and Telecommunications Beijing 100876, China"],"affiliations":[{"raw_affiliation_string":"Beijing University of Posts and Telecommunications, Beijing, China","institution_ids":["https://openalex.org/I139759216"]},{"raw_affiliation_string":"Beijing University of Posts and Telecommunications Beijing 100876, China","institution_ids":["https://openalex.org/I139759216"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5114086174","display_name":"Xiaojie Cao","orcid":null},"institutions":[{"id":"https://openalex.org/I139759216","display_name":"Beijing University of Posts and Telecommunications","ror":"https://ror.org/04w9fbh59","country_code":"CN","type":"education","lineage":["https://openalex.org/I139759216"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xiaojie Cao","raw_affiliation_strings":["Beijing University of Posts and Telecommunications, Beijing, China","Beijing University of Posts and Telecommunications Beijing 100876, China"],"affiliations":[{"raw_affiliation_string":"Beijing University of Posts and Telecommunications, Beijing, China","institution_ids":["https://openalex.org/I139759216"]},{"raw_affiliation_string":"Beijing University of Posts and Telecommunications Beijing 100876, China","institution_ids":["https://openalex.org/I139759216"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5012691597"],"corresponding_institution_ids":["https://openalex.org/I139759216"],"apc_list":null,"apc_paid":null,"fwci":0.3546,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.62422987,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"15","issue":null,"first_page":"294","last_page":"298"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.9912999868392944,"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/T10138","display_name":"Network Traffic and Congestion Control","score":0.9912999868392944,"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/T11063","display_name":"Rough Sets and Fuzzy Logic","score":0.9666000008583069,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T14011","display_name":"Elevator Systems and Control","score":0.9556000232696533,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/adjacency-matrix","display_name":"Adjacency matrix","score":0.6931223273277283},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6807016134262085},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.6261935830116272},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6148762702941895},{"id":"https://openalex.org/keywords/adjacency-list","display_name":"Adjacency list","score":0.5899588465690613},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.5835035443305969},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.46029719710350037},{"id":"https://openalex.org/keywords/edge-cover","display_name":"Edge cover","score":0.45568040013313293},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.42666566371917725},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.4247659146785736},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.38380300998687744},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3635919392108917},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.2748154401779175},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2652550935745239},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23894953727722168},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.14843010902404785},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.11073178052902222}],"concepts":[{"id":"https://openalex.org/C180356752","wikidata":"https://www.wikidata.org/wiki/Q727035","display_name":"Adjacency matrix","level":3,"score":0.6931223273277283},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6807016134262085},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.6261935830116272},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6148762702941895},{"id":"https://openalex.org/C110484373","wikidata":"https://www.wikidata.org/wiki/Q264398","display_name":"Adjacency list","level":2,"score":0.5899588465690613},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.5835035443305969},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.46029719710350037},{"id":"https://openalex.org/C17762858","wikidata":"https://www.wikidata.org/wiki/Q594001","display_name":"Edge cover","level":3,"score":0.45568040013313293},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.42666566371917725},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.4247659146785736},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.38380300998687744},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3635919392108917},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2748154401779175},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2652550935745239},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23894953727722168},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.14843010902404785},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.11073178052902222},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icnidc.2012.6418763","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnidc.2012.6418763","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 3rd IEEE International Conference on Network Infrastructure and Digital Content","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W2009990213","https://openalex.org/W2295395236","https://openalex.org/W2362812767","https://openalex.org/W2367612138","https://openalex.org/W2378440504","https://openalex.org/W2752885492","https://openalex.org/W4402957454","https://openalex.org/W6697040981","https://openalex.org/W7002310475"],"related_works":["https://openalex.org/W2949255922","https://openalex.org/W2036594069","https://openalex.org/W4244658307","https://openalex.org/W2156896570","https://openalex.org/W2038655901","https://openalex.org/W1627181101","https://openalex.org/W2043560626","https://openalex.org/W4213150077","https://openalex.org/W1558145674","https://openalex.org/W2383239740"],"abstract_inverted_index":{"The":[0,18],"paper":[1],"builds":[2],"a":[3,13,85,109],"novel":[4],"measurement":[5],"model":[6],"by":[7,66],"abstract":[8],"network":[9,113],"flow":[10],"monitoring":[11,77,98],"into":[12,37],"minimum":[14],"vertex":[15,49],"cover":[16],"problem.":[17],"algorithm":[19,60,81,99],"we":[20],"proposes":[21],"firstly":[22],"via":[23],"giving":[24,42],"the":[25,34,38,43,48,57,59,74,80,106],"vertices":[26,36,78],"with":[27],"degree":[28],"1":[29],"special":[30],"treatment":[31],"(i.e.,":[32],"put":[33],"adjacent":[35],"vertex-cover":[39],"set)":[40],"and":[41,103],"definition":[44],"of":[45,68,76,79,112],"greedy-edge":[46],"gains":[47],"selection":[50,75],"rules.":[51],"Secondly,":[52],"in":[53],"order":[54],"to":[55],"optimize":[56],"result,":[58],"puts":[61],"forward":[62],"specific":[63,86],"optimizing":[64,87],"strategy":[65],"means":[67],"adjacency":[69],"matrix.":[70],"In":[71],"other":[72],"words,":[73],"is":[82,100],"based":[83],"on":[84],"strategy.":[88],"Through":[89],"some":[90],"examples,":[91],"it":[92],"can":[93],"be":[94],"showed":[95],"that":[96],"our":[97],"more":[101],"effective":[102],"better":[104],"than":[105],"others":[107],"over":[108],"wide":[110],"range":[111],"topologies.":[114]},"counts_by_year":[{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}