The Internet has led to the creation of a digital society, where (almost) everything is connected and is accessible from anywhere. However, despite their widespread adoption, traditional IP networks are complex and very hard to manage. It is both difficult to configure the network according to predefined policies, and to reconfigure it to respond to faults, load, and changes. To make matters even more difficult, current networks are also vertically integrated: the control and data planes are bundled together. Software-defined networking (SDN) is an emerging paradigm that promises to change this state of affairs, by breaking vertical integration, separating the network's control logic from the underlying routers and switches, promoting (logical) centralization of network control, and introducing the ability to program the network. The separation of concerns, introduced between the definition of network policies, their implementation in switching hardware, and the forwarding of traffic, is key to the desired flexibility: by breaking the network control problem into tractable pieces, SDN makes it easier to create and introduce new abstractions in networking, simplifying network management and facilitating network evolution. In this paper, we present a comprehensive survey on SDN. We start by introducing the motivation for SDN, explain its main concepts and how it differs from traditional networking, its roots, and the standardization activities regarding this novel paradigm. Next, we present the key building blocks of an SDN infrastructure using a bottom-up, layered approach. We provide an in-depth analysis of the hardware infrastructure, southbound and northbound application programming interfaces (APIs), network virtualization layers, network operating systems (SDN controllers), network programming languages, and network applications. We also look at cross-layer problems such as debugging and troubleshooting. In an effort to anticipate the future evolution of this new paradigm, we discuss the main ongoing research efforts and challenges of SDN. In particular, we address the design of switches and control platforms—with a focus on aspects such as resiliency, scalability, performance, security, and dependability—as well as new opportunities for carrier transport networks and cloud providers. Last but not least, we analyze the position of SDN as a key enabler of a software-defined environment.

https://publications.uni.lu/bitstream/10993/20596/1/survey_on_SDN.pdf

Software-Defined Networking: A Comprehensive Survey

Software-Defined Networking (SDN) is an emerging paradigm that promises to change this state of affairs, by breaking vertical integration, separating the network's control logic from the underlying routers and switches, promoting (logical) centralization of network control, and introducing the ability to program the network. The separation of concerns introduced between the definition of network policies, their implementation in switching hardware, and the forwarding of traffic, is key to the desired flexibility: by breaking the network control problem into tractable pieces, SDN makes it easier to create and introduce new abstractions in networking, simplifying network management and facilitating network evolution. In this paper we present a comprehensive survey on SDN. We start by introducing the motivation for SDN, explain its main concepts and how it differs from traditional networking, its roots, and the standardization activities regarding this novel paradigm. Next, we present the key building blocks of an SDN infrastructure using a bottom-up, layered approach. We provide an in-depth analysis of the hardware infrastructure, southbound and northbound APIs, network virtualization layers, network operating systems (SDN controllers), network programming languages, and network applications. We also look at cross-layer problems such as debugging and troubleshooting. In an effort to anticipate the future evolution of this new paradigm, we discuss the main ongoing research efforts and challenges of SDN. In particular, we address the design of switches and control platforms -- with a focus on aspects such as resiliency, scalability, performance, security and dependability -- as well as new opportunities for carrier transport networks and cloud providers. Last but not least, we analyze the position of SDN as a key enabler of a software-defined environment.

Future generation cellular networks are expected to provide ubiquitous broadband access to a continuously growing number of mobile users. In this context, LTE systems represent an important milestone towards the so called 4G cellular networks. A key feature of LTE is the adoption of advanced Radio Resource Management procedures in order to increase the system performance up to the Shannon limit. Packet scheduling mechanisms, in particular, play a fundamental role, because they are responsible for choosing, with fine time and frequency resolutions, how to distribute radio resources among different stations, taking into account channel condition and QoS requirements. This goal should be accomplished by providing, at the same time, an optimal trade-off between spectral efficiency and fairness. In this context, this paper provides an overview on the key issues that arise in the design of a resource allocation algorithm for LTE networks. It is intended for a wide range of readers as it covers the topic from basics to advanced aspects. The downlink channel under frequency division duplex configuration is considered as object of our study, but most of the considerations are valid for other configurations as well. Moreover, a survey on the most recent techniques is reported, including a classification of the different approaches presented in literature. Performance comparisons of the most well-known schemes, with particular focus on QoS provisioning capabilities, are also provided for complementing the described concepts. Thus, this survey would be useful for readers interested in learning the basic concepts before going into the details of a particular scheduling strategy, as well as for researchers aiming at deepening more specific aspects.

/pdf/downlink-packet-scheduling-in-lte-cellular-networks-key-1z27kezket.pdf

Downlink Packet Scheduling in LTE Cellular Networks: Key Design Issues and a Survey

In studying the performance of coded communications over memoryless channels (with or without fading), the results are given as upper bounds on the average bit error probability (BEP). In principle, there are three different approaches to arriving at these bounds, all of which employ obtaining the so-called pairwise error probability , or the probability of choosing one symbol sequence over another for a given pair of possible transmitted symbol sequences, followed by a weighted summation over all pairwise events. In this chapter, we will focus on the results obtained from the third approach since these provide the tightest upper bounds on the true performance. The first emphasis will be placed on evaluating the pairwise error probability with and without CSI, following which we shall discuss how the results of these evaluations can be used via the transfer bound approach to evaluate average BEP of coded modulation transmitted over the fading channel.

Coded Communication over Fading Channels

Motivation: RNA-seq has been widely used to transcriptome analysis to effectively measure gene expression levels. Although sequencing costs are rapidly decreasing, almost 70% of all the human RNA-seq samples in the Gene Expression Omnibus (GEO) do not have biological replicates and more unreplicated RNA-seq data were published than replicated RNA-seq data in 2011. Despite the large amount of single replicate studies, there is currently no satisfactory method for detecting differentially expressed genes when only a single biological replicate is available. Results: We present the GFOLD (generalized fold change) algorithm to produce biologically meaningful rankings of differentially expressed genes from RNA-seq data. GFOLD assigns reliable statistics for expression changes based on the posterior distribution of log fold change. In this way GFOLD overcomes the shortcomings of p-value and fold change calculated by existing RNA-seq analysis methods and gives more stable and biological meaningful gene rankings when only a single biological replicate is available. Availability: The open source C/C++ program is available at http://www.tongji.edu.cn/~zhanglab/GFOLD/index.html

GFOLD: a generalized fold change for ranking differentially expressed genes from RNA-seq data

The challenge of scheduling user transmissions on the downlink of a long term evolution (LTE) cellular communication system is addressed. A maximum rate algorithm which does not consider fairness among users was proposed in . Here, a multiuser scheduler with proportional fairness (PF) is proposed. Numerical results show that the proposed PF scheduler provides a superior fairness performance with a modest loss in throughput, as long as the user average SINRs are fairly uniform. A suboptimal PF scheduler is also proposed, which has a much lower complexity at the cost of some throughput degradation.

Proportional Fair Multiuser Scheduling in LTE

Among the goals of 3GPP LTE networks are higher user bit rates, lower delays, increased spectrum efficiency, support for diverse QoS requirements, reduced cost, and operational simplicity. Resource scheduling and interference mitigation are two functions which are key to achieving these goals. This paper provides a survey of related techniques which have been proposed and shown to be promising. A brief discussion of the challenges for LTE-Advanced, the next step in the evolution, is also provided.

https://downloads.hindawi.com/journals/jece/2010/273486.pdf

A survey of scheduling and interference mitigation in LTE

In this paper we present simulation results to demonstrate that a simple distributed intra frequency load balancing algorithm based on automatic adjustment of handover thresholds can significantly reduce the call blocking rate and increase cell-edge throughput in an LTE network.

On Mobility Load Balancing for LTE Systems

A two-dimensional optimization between adaptive modulation and coding (AMC) and multi-code transmission targets the best bit rate at which highest useable modulation and coding scheme (MCS, 12 fig. 1)) achieves a maximum allowed number of channelization codes or less. The optimized MCS and number of channelization codes at a best bit rate is communicated from a transmitter to a receiver possibly also with power information for instance using a transport format combination indicator (TFCI fig. 5).User equipment may play the role of carrying out the optimization and signaling the result to the Node B or may instead receive the result as carried out by the Node B or RNC in response to a radio link quality measurement sent from the UE to the Node B.

Optimization of mcs and multicode with tfci signaling

The challenge of scheduling user transmissions on the downlink of a long-term evolution (LTE) cellular communication system is addressed. In particular, a novel optimalmultiuser scheduler is proposed. Numerical results show that the system performance improves with increasing correlation among OFDMA subcarriers. It is found that only a limited amount of feedback information is needed to achieve relatively good performance. A suboptimal reduced-complexity scheduler is also proposed and shown to provide good performance. The suboptimal scheme is especially attractive when the number of users is large, in which case the complexity of the optimal scheme is high.

https://downloads.hindawi.com/journals/jece/2008/323048.pdf

Raymond Kwan

Papers

Proportional Fair Multiuser Scheduling in LTE

A survey of scheduling and interference mitigation in LTE

On Mobility Load Balancing for LTE Systems

Optimization of mcs and multicode with tfci signaling

Multiuser scheduling on the downlink of an LTE cellular system