{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T07:13:09Z","timestamp":1760425989855,"version":"3.37.3"},"reference-count":39,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,5,10]],"date-time":"2021-05-10T00:00:00Z","timestamp":1620604800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,5,10]],"date-time":"2021-05-10T00:00:00Z","timestamp":1620604800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,5,10]],"date-time":"2021-05-10T00:00:00Z","timestamp":1620604800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,5,10]]},"DOI":"10.1109\/infocom42981.2021.9488682","type":"proceedings-article","created":{"date-parts":[[2021,7,27]],"date-time":"2021-07-27T00:07:32Z","timestamp":1627344452000},"page":"1-10","source":"Crossref","is-referenced-by-count":3,"title":["Looking for the Maximum Independent Set: A New Perspective on the Stable Path Problem"],"prefix":"10.1109","author":[{"given":"Yichao","family":"Cheng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ning","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingxuan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Timos","family":"Antonopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruzica","family":"Piskac","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiao","family":"Xiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"year":"2016","key":"ref39","article-title":"As relationships and internet traffic dataset"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591830"},{"key":"ref33","first-page":"581","article-title":"Stable and practicalproblink","author":"jin","year":"2019","journal-title":"16th USENIX Symposium on Networked Systems Design AS relationship inference with and Implementation (NSDI 19)"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/2504730.2504735"},{"key":"ref31","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1109\/90.974527","article-title":"On inferring autonomous system relationships in the internet","volume":"9","author":"gao","year":"2001","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM41043.2020.9155235"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516660"},{"key":"ref36","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-45539-6_22","article-title":"General secure multi-party? computation from any linear secret sharing scheme","author":"cramer","year":"2000"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/2567561.2567566"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP.2017.8117560"},{"key":"ref10","first-page":"953","article-title":"Plankton: Scalable network configuration verification through model checking","author":"prabhu","year":"2020","journal-title":"USENIX Symposium on Networked Systems Design and Implementation (NSDI)"},{"key":"ref11","first-page":"201","article-title":"Tiramisu: Fast multilayer network verification","author":"abhashkumar","year":"2020","journal-title":"USENIX Symposium on Networked Systems Design and Implementation"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.17487\/rfc4271"},{"key":"ref13","article-title":"Stable egress route selection for interdomain traffic engineering: model and analysis","author":"wang","year":"2005","journal-title":"13th IEEE International Conference on Network Protocols"},{"key":"ref14","first-page":"844","article-title":"The complexity of game dynamics: Bgp oscillations, sink equilibria, and beyond","volume":"8","author":"fabrikant","year":"2008","journal-title":"SODA"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5935136"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2013.2296330"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM41043.2020.9155486"},{"key":"ref18","first-page":"15","article-title":"Design and implementation of a routing control platform","author":"caesar","year":"2005","journal-title":"Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation"},{"journal-title":"Routing As A Service","year":"2004","author":"lakshminarayanan","key":"ref19"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.17487\/RFC7938"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2011.110311.100109"},{"journal-title":"Practical BGP","year":"2004","author":"white","key":"ref27"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/90.974523"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/863955.863963"},{"key":"ref29","first-page":"11","article-title":"On the stability of rational, heterogeneous interdomain route selection","author":"wang","year":"2005","journal-title":"13th IEEE International Conference on Network Protocols"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP.1999.801912"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3098822.3098834"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP.2012.6459974"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2333112.2333121"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/3230543.3230583"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/90.993304"},{"key":"ref20","first-page":"739","article-title":"Towards logically centralized interdomain routing","author":"pouryousef","year":"2020","journal-title":"USENIX Symposium on Networked Systems Design and Implementation (NSDI)"},{"key":"ref22","article-title":"Sdn-based privacy preserving cross domain routing","author":"chen","year":"2018","journal-title":"IEEE Transactions on Dependable and Secure Computing"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2019.2927073"},{"key":"ref24","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1016\/j.tcs.2012.09.022","article-title":"Confining sets and avoiding bottleneck cases: A simple maximum independent set algorithm in degree-3 graphs","volume":"469","author":"xiao","year":"2013","journal-title":"Theoretical Computer Science"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1515\/popets-2017-0033"},{"year":"0","key":"ref26","article-title":"The Large Hadron Collider (LHC) Experiment"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2017.06.001"}],"event":{"name":"IEEE INFOCOM 2021 - IEEE Conference on Computer Communications","start":{"date-parts":[[2021,5,10]]},"location":"Vancouver, BC, Canada","end":{"date-parts":[[2021,5,13]]}},"container-title":["IEEE INFOCOM 2021 - IEEE Conference on Computer Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9488422\/9488423\/09488682.pdf?arnumber=9488682","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T15:43:41Z","timestamp":1652197421000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9488682\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,10]]},"references-count":39,"URL":"https:\/\/doi.org\/10.1109\/infocom42981.2021.9488682","relation":{},"subject":[],"published":{"date-parts":[[2021,5,10]]}}}