Narjis Batool 2017-MSTN-2

Saima Khushi 2017-MSTN-

Sajiad 2017-MSTN-
M.Rizwan Haider 2017-MSTN-26
 In hybrid wired–wireless media, congestion
control and scheduling are both trying to
allocate bandwidth to the flows.
 By decreasing the mismatch between
scheduling at the base station of an LTE
network and congestion control algorithms
implemented at end users, significant
improvements in the obtained overall
throughput and fairness for best-effort traffic
are achieved.
 A problem formulation for joint scheduling
and congestion control is provided for a
hybrid media including wireless LTE network.
 The original optimization problem is
decomposed into two sub problems:
1. congestion control problem
2. link scheduling problem
 LTE: standard for wireless high-speed data
communication for mobile phones and data
terminals.
 Evolution of the GSM/UMTS standards.
 The goal of LTE is to increase the capacity
and speed of wireless data networks using
new digital signal processing techniques,
flexible multi-user techniques, and
modulations.
 LTE offers significant improvements by
introducing a novel physical layer and
reforming the core network.
 In LTE, adaptive modulation and coding
(AMC) techniques are used in the physical
layer.
 In the wireless part of the network,
scheduling is not first in, first out (FIFO) and
depends on channel conditions, so a
sophisticated channel-state-aware
scheduling is applied.
 An end-to-end congestion control algorithm
adjusts the input rate of an end user in the
transport layer.
 The scheduler at the base station of the LTE
network is responsible for allocating
resources to different users in the media
access control (MAC) sublayer.
 Sophisticated channel-aware scheduling
requires the UEs to feed back the supported
channel quality indicator (CQI) value, which
corresponds to a specific code rate–
modulation order combination, for each RB.
 Two Level Scheduler : for real-time and non-
real-time downlink communications.
1. Upper level scheduler (ULS)
2. Lower layer scheduler

 The ULS defines in the long run (i.e., in a

single frame) the amount of data should be
transmitted by each data source.
 The lower layer scheduler, however, allocates
RBs in each TTI to achieve a tradeoff between
fairness and system throughput.
 Best channel quality indicator (best CQI): The
best CQI scheduler tries to maximize the total
throughput by assigning resources to the users
with the best channel conditions

 The performance of an LTE network is studied in

the condition of the coexistence of both
scheduling and end-to-end congestion control,
which are separately designed and implemented
without any cooperation.
 The different combinations of scheduling at
the base station of a cellular network (e.g.,
best CQI or PF scheduling) and some well
known congestion control algorithms
implemented at end users can lead to major
differences in the obtained overall
throughput and fairness for the best effort
traffic
 Joint congestion control and scheduling
applied resource allocation for wireless
network.
 First benefit is effective buffer sizing, even
when channel rate are available.
 Second benefit is that we can prevent conflict
situation where both the congestion control
algorithm and scheduler try to assign the
benefit to the flow.
 A survey and tutorial on cross-layer
optimization and decomposition is divided
the original large network utility optimization
problem into smaller sub problems.
 Which are then coordinated by master
problem by mean of signaling. this technique
classified into primal decomposition and dual
decomposition.
 Queue length is considered as common
information to different layer of network
protocol stack. Queue length scheduler is
called Block pressure scheduler
 By adopting queuing delay as the congestion
measure they propose a joint optimal TCP
congestion control and link scheduler scheme
for mobile TCP application. They assume that
wireless access point perform a queuing-
delay based link scheduling.
 Consider a hybrid wireless media that include
LTE wireless Network. Network consider a set
of B={1………,B} of the base station in wireless
Network L={1……,L}.
 unidirectional link of capacity c1^ for 1
belong L. Let c^={c1^,l to L} denote the
capacity vector.
 C1^(t)={ c1(t), l is active at t
{0 , otherwise
L is active when at least one RB is assigned to
l by the scheduler during the LTI.
 Power is homogeneous in downlink base
station.
 Set of frequency RBs J={1…..j}.
 Let M be the number of RBs in a TTL.
 C1(t) amount of capacity allocated to link l
equal to summation of c1j(t) for all RB j
allocated to link l.
 Alfa 1 depend on the policy of applied
channel-aware scheduling in LTE as well as
the channel condition of other wireless link in
a base station in a TTl.
 Asynchronous version of the algorithm for
joint scheduling and congestion control.
 Different part of the distributed algorithm
should be implemented either in sources or in
links.