default search action
Georgios S. Paschos
- > Home > Persons > Georgios S. Paschos
Publications
- 2017
- [j26]Abhishek Sinha, Georgios S. Paschos, Chih-Ping Li, Eytan H. Modiano:
Throughput-Optimal Multihop Broadcast on Directed Acyclic Wireless Networks. IEEE/ACM Trans. Netw. 25(1): 377-391 (2017) - [j25]Nathaniel M. Jones, Georgios S. Paschos, Brooke Shrader, Eytan H. Modiano:
An Overlay Architecture for Throughput Optimal Multipath Routing. IEEE/ACM Trans. Netw. 25(5): 2615-2628 (2017) - [j24]Anurag Rai, Chih-Ping Li, Georgios S. Paschos, Eytan H. Modiano:
Loop-Free Backpressure Routing Using Link-Reversal Algorithms. IEEE/ACM Trans. Netw. 25(5): 2988-3002 (2017) - [j23]Abhishek Sinha, Georgios S. Paschos, Eytan H. Modiano:
Throughput-Optimal Multi-Hop Broadcast Algorithms. IEEE/ACM Trans. Netw. 25(5): 3088-3101 (2017) - 2016
- [j21]Georgios S. Paschos, Chih-Ping Li, Eytan H. Modiano, Kostas Choumas, Thanasis Korakis:
In-Network Congestion Control for Multirate Multicast. IEEE/ACM Trans. Netw. 24(5): 3043-3055 (2016) - [c36]Abhishek Sinha, Georgios S. Paschos, Eytan H. Modiano:
Throughput-optimal multi-hop broadcast algorithms. MobiHoc 2016: 51-60 - [i12]Abhishek Sinha, Georgios S. Paschos, Eytan H. Modiano:
Throughput-Optimal Multi-hop Broadcast Algorithms. CoRR abs/1604.00446 (2016) - 2015
- [c35]Abhishek Sinha, Georgios S. Paschos, Chih-Ping Li, Eytan H. Modiano:
Throughput-optimal broadcast on directed acyclic graphs. INFOCOM 2015: 1248-1256 - [c34]Anurag Rai, Chih-Ping Li, Georgios S. Paschos, Eytan H. Modiano:
Loop-Free Backpressure Routing Using Link-Reversal Algorithms. MobiHoc 2015: 87-96 - [i10]Anurag Rai, Chih-Ping Li, Georgios S. Paschos, Eytan H. Modiano:
Loop-Free Backpressure Routing Using Link-Reversal Algorithms. CoRR abs/1503.06857 (2015) - [i9]Abhishek Sinha, Georgios S. Paschos, Chih-Ping Li, Eytan H. Modiano:
Throughput-Optimal Multihop Broadcast on Directed Acyclic Wireless Networks. CoRR abs/1507.05240 (2015) - 2014
- [c33]Georgios S. Paschos, Eytan H. Modiano:
Throughput optimal routing in overlay networks. Allerton 2014: 401-408 - [c31]Georgios S. Paschos, Chih-Ping Li, Eytan H. Modiano, Kostas Choumas, Thanasis Korakis:
A demonstration of multirate multicast over an 802.11 mesh network. INFOCOM Workshops 2014: 135-136 - [c30]Georgios S. Paschos, Chih-Ping Li, Eytan H. Modiano, Kostas Choumas, Thanasis Korakis:
Multirate multicast: Optimal algorithms and implementation. INFOCOM 2014: 343-351 - [c29]Nathaniel M. Jones, Georgios S. Paschos, Brooke Shrader, Eytan H. Modiano:
An overlay architecture for throughput optimal multipath routing. MobiHoc 2014: 73-82 - [c28]Chih-Ping Li, Georgios S. Paschos, Leandros Tassiulas, Eytan H. Modiano:
Dynamic overload balancing in server farms. Networking 2014: 1-9 - [i7]Georgios S. Paschos, Eytan H. Modiano:
Throughput Optimal Routing in Overlay Networks. CoRR abs/1409.1739 (2014) - [i6]Abhishek Sinha, Georgios S. Paschos, Chih-Ping Li, Eytan H. Modiano:
Throughput-Optimal Broadcast on Directed Acyclic Graphs. CoRR abs/1411.6172 (2014)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint