To address the inefficiency of standard TCP’s additive-increase multiplicative-decrease (AIMD) control in high bandwidth-delay product networks, several end-to-end congestion control algorithms were proposed. However, these proposals, for example High-Speed TCP and Scalable TCP, have failed to decouple efficiency control and fairness control. Often high aggressiveness (for good efficiency) is a...

We introduce a general methodology for designing integrated shaping and scheduling algorithms for packet networks that provide fairness, low end-to-end delay, and low burstiness. The methodology is based on integrating a shaping mechanism with a scheduler from the class of Rate-Proportional Servers (RPS) deened in 10]. The resulting algorithms provide an end-to-end delay bound identical to that...

Indoor visible light communications (VLC) combines illumination and communication by utilizing the high-modulation-speed of LEDs. VLC is anticipated to be complementary to radio frequency communications and an important part of next generation heterogeneous networks. In order to make the maximum use of VLC technology in a networking environment, we need to expand existing research from studies ...

The classic fair cake-cutting problem [Steinhaus, 1948] is extended by introducing geometric constraints on the allocated pieces. Specifically, agents may demand to get their share as a square or a rectangle with a bounded length/width ratio. This is a plausible constraint in realistic cake-cutting applications, notably in urban and agricultural economics where the “cake” is land. Geometric con...

This paper focuses on evaluating the performance of scheduling schemes in HSDPA system. The investigation is performed with the aid of system level simulator developed for this purpose. The investigation focuses on four scheduling schemes namely Maximum C/I, Proportional Fair, Fair Throughput and Round Robin. The investigation is performed in terms of service throughput, and fairness at network...

Presented in this paper is a study of the capacity evaluation of various multiuser MIMO schemes in cellular environments. The throughputs per user of the generalized zero-forcing with rank adaptation and vector perturbation schemes are compared with the capacity bound of the Gaussian MIMO broadcast channel, obtained by dirty paper coding under proportional fairness scheduling. The average cell ...

near the edges, where link bandwidth is limited. Perhaps wireless links, with their limited capacity, will be a major reason to implement multiple packet classes. Some wireless links, and some data streams are time varying with large time scales. Such time variations, coupled with the limitations imposed by large round trip times in congestion control loops, may forever insure that queuing dela...

This chapter argues that the value of political equality implies proportionality in an electoral system. The literature on electoral systems and democratic theory has been remarkably agnostic about how basic values may be translated into institutions. Dahl (1956) constructs an axiomatic theory of democracy based on the idea of political equality but then declares it has little to say about prac...

While current research focuses on Enhanced 3 Generation and IMT-Advanced mobile systems, many advanced techniques are investigated by world-wide research institutes and standard organization, such as Multi-Input Multi-Output, Coordinated Multi-Point and coordinated multi-antenna cellular network architecture. Based on these novel techniques, the access control strategies also need to be develop...

In a broadband satellite communications network, the propagation delays are not only significant, but also variable among users due to their different geographical locations and the problem becomes more severe with increasing data rates. We consider rate control algorithms with user feedback in the form of single bits and formulate analytic fluid flow models composed of first-order delay-differ...