arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1310.4906cs.DC
收藏

动态网络中的分布式调度

Distributed Queuing in Dynamic Networks

Gokarna Sharma, Costas Busch

摘要:

我们考虑在Kuhn,Lynch和Oshman(STOC 2010)的对抗动态网络模型中形成分布式队列的问题,其中网络拓扑从一轮到另一轮变化,但网络保持连接。这是一个同步模型,其中网络节点被假设为固定的,每一轮的通信链路由对手选择,并且节点在广播消息之前不知道当前轮的邻居是谁。队列请求可以通过多轮到达任意节点,目标是最终将它们排入分布式队列。我们提出了两个算法,给出了一个总的分布式排队请求在这个模型中。我们通过轮复杂度来衡量算法的性能,轮复杂度是解决分布式排队问题所需的轮总数。我们表明,在1-区间连通图,其中的通信链路之间的每一轮任意变化,它是可能的,以解决分布式排队问题在O(nk)轮使用O(log n)大小的消息,其中n是网络中的节点数和k <= n是队列请求的数量。此外,我们表明,对于更稳定的图,例如,T-间隔连接图的通信链路在每T轮变化,分布式排队问题可以解决在O(n+(nk/min(alpha,T)轮使用相同的O(log n)大小的消息,其中alpha > 0是并发级别参数,捕获系统中的活动队列请求的最小数量在任何一轮。这些结果适用于系统中k个队列请求的任意(顺序、一次性并发或动态)到达。此外,我们的算法确保正确性的意义上,每个队列请求最终在分布式队列中排队后,它被发出,每个队列请求被排队一次。我们还提供了一个不可能的结果,这种分布排队问题在这个模型。据我们所知,这些是对抗动态网络中分布式排队问题的第一个解决方案。

英文摘要:

We consider the problem of forming a distributed queue in the adversarial dynamic network model of Kuhn, Lynch, and Oshman (STOC 2010) in which the network topology changes from round to round but the network stays connected. This is a synchronous model in which network nodes are assumed to be fixed, the communication links for each round are chosen by an adversary, and nodes do not know who their neighbors are for the current round before they broadcast their messages. Queue requests may arrive over rounds at arbitrary nodes and the goal is to eventually enqueue them in a distributed queue. We present two algorithms that give a total distributed ordering of queue requests in this model. We measure the performance of our algorithms through round complexity, which is the total number of rounds needed to solve the distributed queuing problem. We show that in 1-interval connected graphs, where the communication links change arbitrarily between every round, it is possible to solve the distributed queueing problem in O(nk) rounds using O(log n) size messages, where n is the number of nodes in the network and k <= n is the number of queue requests. Further, we show that for more stable graphs, e.g. T-interval connected graphs where the communication links change in every T rounds, the distributed queuing problem can be solved in O(n+ (nk/min(alpha,T))) rounds using the same O(log n) size messages, where alpha > 0 is the concurrency level parameter that captures the minimum number of active queue requests in the system in any round. These results hold in any arbitrary (sequential, one-shot concurrent, or dynamic) arrival of k queue requests in the system. Moreover, our algorithms ensure correctness in the sense that each queue request is eventually enqueued in the distributed queue after it is issued and each queue request is enqueued exactly once. We also provide an impossibility result for this distributed queuing problem in this model. To the best of our knowledge, these are the first solutions to the distributed queuing problem in adversarial dynamic networks.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑