2019
DOI: 10.1007/s10922-019-09506-y
|View full text |Cite
|
Sign up to set email alerts
|

Auction-Based Algorithms for Routing and Task Scheduling in Federated Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 8 publications
(2 citation statements)
references
References 43 publications
0
2
0
Order By: Relevance
“…Secondly, mobile nodes with personal information can be tracked down and become vulnerable through known attacks like eavesdropping, denial of service, replay, and repudiation [9,10]. The higher speed requires a high quality of service (QoS) in terms of execution time, while a higher volume of data is transferred.…”
Section: Motivationmentioning
confidence: 99%
“…Secondly, mobile nodes with personal information can be tracked down and become vulnerable through known attacks like eavesdropping, denial of service, replay, and repudiation [9,10]. The higher speed requires a high quality of service (QoS) in terms of execution time, while a higher volume of data is transferred.…”
Section: Motivationmentioning
confidence: 99%
“…Previous research [12] centered on fairly assigning the value of the satellite resources according to the provider concurrence, and customer demand. An operational model was developed in [13] to allocate processing, storage and communication resources to computational demands.…”
Section: Introductionmentioning
confidence: 99%