TY - GEN
T1 - Self-Interested Load Announcement by Edge Servers
T2 - 2024 IEEE Conference on Computer Communications Workshops, INFOCOM WKSHPS 2024
AU - Huang, Chen
AU - Wang, Zhiyuan
AU - Tang, Ming
N1 - Publisher Copyright:
© 2024 IEEE.
PY - 2024
Y1 - 2024
N2 - In mobile edge computing (MEC), customers (e.g., mobile devices) can offload computational-intensive tasks to edge servers to achieve low processing latency. However, an edge server can be self-interested as part of the MEC business ecosystem. It may misreport the expected waiting time (at edge servers) to the customers to increase its payoff. In this work, we formulate a two-stage game to investigate the misreporting behavior. In Stage I, the edge server decides a misreporting coefficient for untruthfully announcing the expected waiting time. In Stage II, when a customer has a new task arrival, it decides whether to offload the task or not based on its patience. Overcoming the challenge of the stochastic task arrivals in Stage II, we determine the rate of the task arrivals offloaded to the edge server. Overcoming the challenge of the nonconvexity of Stage I problem, we prove the existence and uniqueness of the optimal misreporting coefficient. Meanwhile, we prove that as the customers' patience increases, the edge server's optimal misreporting coefficient increases, while its optimal payoff remains unchanged. Our experimental results with real-world datasets show that the traffic intensity threshold that separates the situations of overreporting and underreporting is around 0.5 - 0.9.
AB - In mobile edge computing (MEC), customers (e.g., mobile devices) can offload computational-intensive tasks to edge servers to achieve low processing latency. However, an edge server can be self-interested as part of the MEC business ecosystem. It may misreport the expected waiting time (at edge servers) to the customers to increase its payoff. In this work, we formulate a two-stage game to investigate the misreporting behavior. In Stage I, the edge server decides a misreporting coefficient for untruthfully announcing the expected waiting time. In Stage II, when a customer has a new task arrival, it decides whether to offload the task or not based on its patience. Overcoming the challenge of the stochastic task arrivals in Stage II, we determine the rate of the task arrivals offloaded to the edge server. Overcoming the challenge of the nonconvexity of Stage I problem, we prove the existence and uniqueness of the optimal misreporting coefficient. Meanwhile, we prove that as the customers' patience increases, the edge server's optimal misreporting coefficient increases, while its optimal payoff remains unchanged. Our experimental results with real-world datasets show that the traffic intensity threshold that separates the situations of overreporting and underreporting is around 0.5 - 0.9.
KW - Mobile edge computing
KW - Stackelberg Game
KW - misreporting behavior
UR - https://www.scopus.com/pages/publications/105003109323
U2 - 10.1109/INFOCOMWKSHPS61880.2024.10620778
DO - 10.1109/INFOCOMWKSHPS61880.2024.10620778
M3 - 会议稿件
AN - SCOPUS:105003109323
T3 - IEEE INFOCOM 2024 - IEEE Conference on Computer Communications Workshops, INFOCOM WKSHPS 2024
BT - IEEE INFOCOM 2024 - IEEE Conference on Computer Communications Workshops, INFOCOM WKSHPS 2024
PB - Institute of Electrical and Electronics Engineers Inc.
Y2 - 20 May 2024 through 20 May 2024
ER -