2,052 research outputs found
Fronthaul evolution: From CPRI to Ethernet
It is proposed that using Ethernet in the fronthaul, between base station baseband unit (BBU) pools and remote radio heads (RRHs), can bring a number of advantages, from use of lower-cost equipment, shared use of infrastructure with fixed access networks, to obtaining statistical multiplexing and optimised performance through probe-based monitoring and software-defined networking. However, a number of challenges exist: ultra-high-bit-rate requirements from the transport of increased bandwidth radio streams for multiple antennas in future mobile networks, and low latency and jitter to meet delay requirements and the demands of joint processing. A new fronthaul functional division is proposed which can alleviate the most demanding bit-rate requirements by transport of baseband signals instead of sampled radio waveforms, and enable statistical multiplexing gains. Delay and synchronisation issues remain to be solved
Fair Scheduling in Networks Through Packet Election
We consider the problem of designing a fair scheduling algorithm for
discrete-time constrained queuing networks. Each queue has dedicated exogenous
packet arrivals. There are constraints on which queues can be served
simultaneously. This model effectively describes important special instances
like network switches, interference in wireless networks, bandwidth sharing for
congestion control and traffic scheduling in road roundabouts. Fair scheduling
is required because it provides isolation to different traffic flows; isolation
makes the system more robust and enables providing quality of service. Existing
work on fairness for constrained networks concentrates on flow based fairness.
As a main result, we describe a notion of packet based fairness by establishing
an analogy with the ranked election problem: packets are voters, schedules are
candidates and each packet ranks the schedules based on its priorities. We then
obtain a scheduling algorithm that achieves the described notion of fairness by
drawing upon the seminal work of Goodman and Markowitz (1952). This yields the
familiar Maximum Weight (MW) style algorithm. As another important result we
prove that algorithm obtained is throughput optimal. There is no reason a
priori why this should be true, and the proof requires non-traditional methods.Comment: 14 pages (double column), submitted to IEEE Transactions on
Information Theor
- âŠ