.png){kind=icon}
返回
Nomadic service assignment
.png){kind=icon}
OA
AI
DOI：10.1109/TMC.2007.1043.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We consider the problem of dynamically assigning application sessions of mobile users or user groups to service points. Such assignments must balance the trade-off between two conflicting goals. On the one hand, we would like to connect a user to the closest server in order to reduce network costs and service latencies. On the other hand, we would like to minimize the number of costly session migrations, or handoffs, between service points. We tackle this problem using two approaches. First, we employ algorithmic online optimization to obtain algorithms whose worst-case performance is within a factor of the optimal. Next, we extend them with opportunistic heuristics that achieve near-optimal practical average performance and scalability. We conduct case studies of two settings where such algorithms are required: wireless mesh networks with mobile users and wide-area groupware applications with or without mobility.
Keyword:
mobile communication systems
online computation
distributed networks
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
9.2
论文数:
5.8K
被引数:
1.8W
机构
暂无机构信息
引用论文
分享收藏分享收藏Delayed complete response after allogeneic bone marrow transplantation in chronic lymphocytic leukemia [letter].png)
Blood
OAAI
BloodIF0
OAAI分享收藏
查看更多内容