Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Mingyang Lyu

dblp:265/1288 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2023
—ORCID · unresolved

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Network optimization and economics · 46% Vehicular, aerial and satellite networks · 30% Routing and switching · 23%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Network optimization and economics › resource allocation
bandwidth allocation
0.712023
Falcon: Towards Fast and Scalable Data Delivery for Emerging Earth Observation Constellations · INFOCOM 2023
Routing and switching
multipath routing
0.712023
Falcon: Towards Fast and Scalable Data Delivery for Emerging Earth Observation Constellations · INFOCOM 2023
Network optimization and economics
resource allocation
0.712023
Falcon: Towards Fast and Scalable Data Delivery for Emerging Earth Observation Constellations · INFOCOM 2023
Vehicular, aerial and satellite networks
satellite networks
0.712023
Falcon: Towards Fast and Scalable Data Delivery for Emerging Earth Observation Constellations · INFOCOM 2023
Vehicular, aerial and satellite networks › satellite constellation
satellite constellation networks
0.212023
Falcon: Towards Fast and Scalable Data Delivery for Emerging Earth Observation Constellations · INFOCOM 2023

Methods — techniques the papers use, named apart from their topics

heuristic algorithm · 0.7hardness proof · 0.7
YearPublicationVenuePosition
2023 Falcon: Towards Fast and Scalable Data Delivery for Emerging Earth Observation Constellations
abstract
Exploiting a constellation of small satellites to realize continuous earth observations (EO) is gaining popularity. Large-volume EO data acquired from space needs to be transferred to the ground. However, existing EO delivery approaches are either: (a) efficiency-limited, suffering from long delivery completion time due to the intermittent ground-space communication, or (b) scalability-limited since they fail to support concurrent delivery for multiple satellites in an EO constellation.To make big data delivery for emerging EO constellations fast and scalable, we propose Falcon, a multi-path EO delivery framework that wisely exploits diverse paths in broadband constellations to collaboratively deliver EO data effectively. In particular, we formulate the constellation-wide EO data multi-path download (CEOMD) problem, which aims at minimizing the delivery completion time of requested data for all EO sources. We prove the hardness of solving CEOMD, and further present a heuristic multipath routing and bandwidth allocation mechanism to tackle the technical challenges caused by time-varying satellite dynamics and flow contention, and solve the CEOMD problem efficiently. Evaluation results based on public orbital data of real EO constellations show that as compared to other state-of-the-art approaches, Falcon can reduce at least 51% delivery completion time for various data requests in large EO constellations.
Mingyang Lyu, Qian Wu 0001, Zeqi Lai, Hewu Li, Yuanjie Li, Jun Liu 0063
INFOCOM1