Papers by Keyword: Fairness

Abstract: Network congestion control problem is one of the most key problems in network study. This paper studies different versions of TCP source port algorithm such as Tahoe, Reno, NewReno, SACK and Vegas, and makes simulation research on linear network and dumbbell network environment algorithm by using NS2 network simulator, and finally it concludes that: when there is no competition in the network, it is better to choose Vegas algorithm; when there is competition, choose Reno, NewReno, or Sack algorithm is more advisable.

Abstract: Mobile devices equipped with multiple network interfaces can increase their throughput by making use of parallel transmissions over multiple paths and bandwidth aggregation, enabled by the multipath Transport Control Protocol (MPTCP). However, the existing MPTCP congestion control algorithm adopt a relatively strict definition of the fairness, although to some extent could ensure the fairness of traditional TCP connections, but the total throughput of MPTCP will be limited, which can not make full use of network resources. To solve this problem, this paper propose a congestion control algorithm (FBCC) based on the fairness of bottleneck. The core idea of FBCC is to set up individual fairness factor for each shared bottleneck. NS3 simulation results show that FBCC algorithm not only solves the problem of fairness, but also effectively improve the total throughput of MPTCP connection.

Abstract: We propose a resource allocation scheme based on Proportional Fairness (PF) for minimum bit rate guarantee in a multiuser, frequency-selective frame-based OFDMA system. Instead of considering subcarrier-and-bit allocation, we consider a more realistic scheduling which is performed at the beginning of each frame, while allowing time-slots multiplexing among active users. Our scheme aims to guarantee different minimum bit rates to different users, while throughput fairness among users is maintained. We formulate the optimization problem based on a multichannel proportional fairness objective function. Minimum bit rate guarantee is taken as the constraint. The optimization problem is solved by using the Lagrange multiplier method. Then, we use our fast cross-layer approach integrated to our optimization solution to schedule packets from finitely backlogged queues. Simulations with user mobility are conducted. The results show that the proposed scheme can serve users with satisfied minimum bit rate requirement. Furthermore, the simulation results also confirm throughput fairness among users.

Abstract: The paper presented a view of incorporate universal design principles into the planning of public facilities in Chinese cities. Then we concluded some problems of Chinese urban public facilities now days, such as insufficient numbers of facilities sometimes, lacking of humane care, ineffective supervision and management in some cities. Finally we proposed ways to enhancing the quality and efficiency of urban public facilities by universal design, including setting up an expert group, mining the culture of the city features, expressing the love and care of the human needs, emphasizing fairness, protecting the safety of the users, improving comfort of the users and insisting on a sustainable use.

Abstract: The fair distribution of bandwidth among different flows is an important research issue in the differentiated services architecture. In this paper FATM (a fair aggregate traffic marker) is proposed to provide the fairness among aggregate flows. FATM guarantees the fairness among the aggregate traffic flows by considering CIR of an aggregate traffic, and also considers maintaining estimated arrival rate for each flow within an aggregate at the boundary router.

Abstract: Much work has been done to solve the unfairness problems caused by hidden terminals and exposed terminals in Ad Hoc networks. The back-off mechanism is one of the widely used methods to ensure the fair allocation of channel resources associated with other mechanisms. In this paper, a modified back-off algorithm DEIED (Dynamic Exponential Increase and Exponential Decrease) is proposed based on the previous back-off scheme EIED (Exponential Increase and Exponential Decrease), and a comparison of BEB (Binary Exponential Back-off), EIED, DEIED, is presented. Both qualitative analysis and simulation results show that the proposed back-off algorithm scheme outperforms EIED and BEB algorithms in term of the opportunities given to each node to transmit.

Abstract: Aiming at improving the unreasonable situation of flight delay allocation, an optimization model which contains two cases was proposed. One of the cases is to transfer all the delay to several delayed flights to avoid delay spread, which can increase the flight punctuality rate to ensure the departure of the majority flights. Oppositely, the other is to balance the delay losses of airlines, as well as the passengers, for realizing the fairness. According to the latest data from an airport in western China, the model was verified with genetic algorithm, which indicates that the model not only decrease the total delay losses, but also optimize the flight delay allocation which achieves the initial goal.

Abstract: This paper mainly presents Access Point s (APs) performance according to 802.11g standard. Our study illustrates the performance of one AP, including its coverage performance, load-carrying properties and fairness. Performance analyses are evaluated by simulation for a dense wireless network. Our contribution is that the simulation and test results can be the basis offered to network operators.

Abstract: In the recent years, the design and analysis of the security of e-commerce protocol has become a hot scheme. The confidentiality and fairness are important properties to measure the security of the e-commerce. It's also the important prerequisite of the successful protocol. Confidentiality and fairness are the basic properties of the secure e-commerce protocol. But the certified e-mail protocol as one of the e-commerce protocol can't satisfy these properties. This paper points out some drawbacks of teh CMP protocol, and analyses the protocol and makes improvements. The improved CMP protocol satisfies the confidentiality and fairness.

Abstract: Optical ring networks have been widely implemented as the major metro network architectures. However, as the network coverage expands, the system performance of the single ring structure degrades significantly. In this paper, we propose an interconnected ring topology to enhance the network throughput and efficiency. The carried out simulation results have revealed the superiority of employing such an interconnected architecture. We also discuss the increased complexities and fairness issues induced by such design.