检索结果-内蒙古大学图书馆

Fairness-oriented multicast routing for distributed interactive applications

COMPUTER COMMUNICATIONS 2024年 219卷 229-242页

作者： Ferreira, Ibirisol Fontes Maciel Peixoto, Maycon Leone Figueiredo, Gustavo Bittencourt Univ Fed Bahia Inst Comp Ave Milton SantosS-N Campus OndinaPAF 2 BR-40170110 Salvador BA Brazil

Facing the challenges of network services on the edge, such as routing considering Quality of Service, is a crucial issue for current networking research efforts. Multicast routing is an essential technique for delivering routing services at a high level of optimization from the perspective of operators and application providers when there are user groups. Furthermore, routing that considers latency constraints has obstacles when it comes to merging different conditions in the solution, particularly when there is a need for fairness in the users' communication. This work addresses this fairness requirement in multicasting, showing an efficient solution to increase the balance in routing by choosing better options for fair group interaction.

关键词： distributed interactive application Edge computing Fairness Multicast routing Shortest path Delay and delay-variation

来源：评论

学校读者我要写书评

暂无评论

The Server Provisioning Problem for Continuous distributed interactive applications

引用

IEEE TRANSACTIONS ON PARALLEL AND distributed SYSTEMS 2016年第1期27卷 271-285页

作者： Zheng, Hanying Tang, Xueyan Nanyang Technol Univ Sch Comp Engn Singapore 639798 Singapore

In this paper, we study the server provisioning problem for continuous distributed interactive applications (DIAs) whose application states not only change because of the operations performed by participants, but also evolve along with the passing of time. We focus on finding the locations of servers for hosting continuous DIAs, with the goals of optimizing the interactivity performance while fulfilling the consistency and fairness requirements. We show that the server provisioning problem is challenging by presenting its NP-hardness and non-approximability results under several conditions. We propose two efficient server placement algorithms and analyze their approximation ratios. The approximation ratio of the proposed M-BETTER algorithm is quite close to a lower bound for any polynomial-time algorithm. We also conduct experimental evaluations to compare the proposed algorithms with several baseline server placements.

关键词： distributed interactive application server placement interactivity approximation algorithm

来源：评论

学校读者我要写书评

暂无评论

Analysis of Server Provisioning for distributed interactive applications

引用

IEEE TRANSACTIONS ON COMPUTERS 2015年第10期64卷 2752-2766页

作者： Zheng, Hanying Tang, Xueyan Nanyang Technol Univ Sch Comp Engn Singapore 639798 Singapore

Increasing geographical spreads of modern distributed interactive applications (DIAs) make distributed server deployment vital for combating network latency and improving the interactivity among participants. In this paper, we investigate the server provisioning problem that concerns where to place servers for DIAs. We formulate the server provisioning problem with an objective of reducing the network latency involved in the interaction between participants. We prove that the problem is NP-hard under several scenarios. We analyze the performance of the classical k-median server placement for DIAs and propose a new greedy server provisioning heuristic for DIAs. Theoretical analysis shows that the approximation ratio of the proposed greedy algorithm is much lower than that of the k-median placement. Experiments using real Internet latency data also show that our proposed algorithm significantly outperforms the k-median and other baseline server placements.

关键词： distributed interactive application server placement interactivity

来源：评论

学校读者我要写书评

暂无评论

The Client Assignment Problem for Continuous distributed interactive applications: Analysis, Algorithms, and Evaluation

引用

IEEE TRANSACTIONS ON PARALLEL AND distributed SYSTEMS 2014年第3期25卷 785-795页

作者： Zhang, Lu Tang, Xueyan Southwest Jiaotong Univ Lab Network Commun Technol Sch Informat Sci & Technol Chengdu Peoples R China Nanyang Technol Univ Sch Comp Engn Singapore 639798 Singapore

Interactivity is a primary performance measure for distributed interactive applications (DIAs) that enable participants at different locations to interact with each other in real time. Wide geographical spreads of participants in large-scale DIAs necessitate distributed deployment of servers to improve interactivity. In a distributed server architecture, the interactivity performance depends on not only client-to-server network latencies but also interserver network latencies, as well as synchronization delays to meet the consistency and fairness requirements of DIAs. All of these factors are directly affected by how the clients are assigned to the servers. In this paper, we investigate the problem of effectively assigning clients to servers for maximizing the interactivity of DIAs. We focus on continuous DIAs that changes their states not only in response to user operations but also due to the passing of time. We analyze the minimum achievable interaction time for DIAs to preserve consistency and provide fairness among clients, and formulate the client assignment problem as a combinatorial optimization problem. We prove that this problem is NP-complete. Three heuristic assignment algorithms are proposed and their approximation ratios are theoretically analyzed. The performance of the algorithms is also experimentally evaluated using real Internet latency data. The experimental results show that our proposed Greedy Assignment and distributed-Modify Assignment algorithms generally produce near optimal interactivity and significantly reduce the interaction time between clients compared to the intuitive algorithm that assigns each client to its nearest server.

关键词： distributed interactive application client assignment interactivity consistency fairness NP-complete

来源：评论

学校读者我要写书评

暂无评论

Online Client Assignment in Dynamic Real-Time distributed interactive applications 13

Online Client Assignment in Dynamic Real-Time Distributed In...

引用

17th IEEE/ACM International Symposium on distributed Simulation and Real Time applications (DS-RT)

作者： Ucar, Seyhan Guler, Huseyin Ozkasap, Oznur Koc Univ Dept Comp Engn Istanbul Turkey

ISBN: (纸本)9780769551388

Qulaity of user experience in distributed interactive applications (DIAs) highly depends on the network latencies during the system execution. In DIAs, each user is assigned to a server and communication with any other client is performed throught its assigned server. Hence, latency measured between two clients, called interaction time, consists of two components. One is the latency between the client and its assigned server, and the other is the inter-server latency, that is the latency between servers that the clients are assigned. In this paper, we investigate a real-time client to server assignment scheme in a DIA where the objective is to minimize the interaction time among clients. The client assignment problem is known to be NP-complete and heuristics play an important role in finding near optimal solutions. We propose two distributed heuristic algorithms to the online client assignment problem in a dynamic DIA system. We utilized real-time Internet latency data on PlanetLab platform and performed extensive 3 experiments using geographically distributed PlanetLab nodes where nodes can arbitrarily join/leave the system. The experimental results demonstrate that our proposed algorthims can reduce the maximum interaction time among clients up to 45% compared to an exiting baseline technique.

关键词： client assignment problem distributed algorithms distributed interactive application real-time

来源：评论

学校读者我要写书评

暂无评论

An Enhanced Genetic Algorithm for Server Placement in distributed interactive applications

An Enhanced Genetic Algorithm for Server Placement in Distri...

引用

IEEE 18th International Conference on Parallel and distributed Systems (ICPADS)

作者： Zheng, Hanying Tang, Xueyan Nanyang Technol Univ Sch Comp Engn Singapore 639798 Singapore

ISBN: (纸本)9781467345651

Recent years have witnessed the enormous popularity of distributed interactive applications (DIAs), which allow participants that are distributed in the network to interact with each other concurrently. The rapid growth of DIAs has raised stringent requirements on providing realistic sense of interaction between participants, whose quality is heavily influenced by network latencies. Although network latencies cannot be eliminated due to geographical spreads of participants, it is possible to reduce them by a smart selection of the locations where the servers of the DIAs are placed. The locations of servers affect not only the inter-server latencies but also the latencies from participants to servers, both of which are involved in the interactions among participants. Thus, the placement of servers is an important factor to the interactivity performance of DIAs. We formulate the server placement problem, and propose to solve it by an enhanced genetic algorithm, whose genetic operators are specially designed based on the nature of the problem. Experimental results using various datasets show that our algorithm leads to appreciable improvement of the interaction quality in DIAs.

关键词： server placement distributed interactive application network latency optimization genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：