A theoretical study on distributed resource management scheme for interconnection networks

在本项目中，我们对信息网络的资源管理方案进行了理论方面的研究，主要贡献有两个方面：第一，提出了一种新的高速网络拥塞控制方案。该方案的基本思想是采用一种称为少数人博弈(MG)的博弈论来实现对发送者传输速度的选择性降低。更具体地说，当检测到拥塞时，它在参与通信的所有发送者之间进行游戏，并根据游戏的结果降低每个发送者的传输速度。MG是一种最近引起了相当大关注的游戏，并且众所周知，它具有一个显著的特性，即尽管玩家的自私行为，但赢家的数量收敛到玩家数量的一半。利用MG的这一特性，我们可以实现传输速率的公平降低，这比以往所有发送者均匀降低自己的传输速度的方案更有效。通过仿真对所提出的方案的效果进行了评估。标准中引入的一项关键技术是基于混合协调功能(HCF)的高效媒体访问控制，其中为每个流分配适当的传输机会(TXOP)，以满足对流的几个要求，如延迟界和通信带宽。虽然它可以提供一种有效的工具来保证无线局域网中的服务质量，但它有一个严重的缺陷，即经常出现无用的带宽分配，这主要是由于该方案的局限性，即所有流共享相同的服务间隔(SI)。在本文中，我们提出了一种新的调度方案，它根据延迟界的难易程度将每个流与其自己的SI相关联。

In this project, we study theoretical aspects on the resource management scheme for information networks.The main contribution of this research is two folds.First, we propose a new congestion control scheme for high-speed networks. The basic idea of the scheme is to adopt a game theory called Minority Game (MG) to realize a selective reduction of the transmission speed of senders. More concretely, upon detecting a congestion, it plays a game among all senders participating in the communication, and reduces the transmission speed of each sender according to the result of the game. MG is a game that has recently attracted considerable attentions, and it is known to have a remarkable property such that the number of winners converges to a half of the number of players in spite of the selfish behavior of the players. By using such property of MG, we can realize a fair reduction of the transmission speed, which is more efficient than previous schemes in which all senders uniformly reduce their transmission speed The effect of the proposed scheme is evaluated by simulation.Second, we consider a resource assignment scheme in wireless LANs. A key technique introduced in the standard is an efficient media access control based on Hybrid Coordination Function (HCF), in which each flow is assigned an appropriate transmission opportunity (TXOP) to satisfy several requirements on the flow such as the delay bound and the communication bandwidth. Although it could provide an efficient tool to guarantee the QoS in wireless LAN, HCF has a serious drawback such that a useless bandwidth assignment frequently occurs, which is primarily due to the limitation of the scheme such that all flows share the same service interval (SI). In this paper, we propose a new scheduling scheme that associates each flow with its own SI according to the hardness of the delay bound.