arXiv subjects

Abdallah Shami

Publications and source records attributed to Abdallah Shami.

81 records · Page 5Linked to original sources

arXiv2019

Direct Data Detection of OFDM Signals Over Wireless Channels

This paper presents a novel efficient receiver design for wireless communication systems that incorporate orthogonal frequency division multiplexing (OFDM) transmission. The proposed receiver does not require channel estimation or equalization to perform coherent data detection. Instead, channel estimation, equalization, and data detection are combined into a single operation, and hence, the detector is denoted as a direct data detector (D^{3}). The performance of the proposed system is thoroughly analyzed theoretically in terms of bit error rate (BER), and validated by Monte Carlo simulations. The obtained theoretical and simulation results demonstrate that the BER of the proposed D^{3} is only 3 dB away from coherent detectors with perfect knowledge of the channel state information (CSI) in flat fading channels, and similarly in frequency-selective channels for a wide range of signal-to-noise ratios (SNRs). If CSI is not known perfectly, then the D^{3} outperforms the coherent detector substantially, particularly at high SNRs with linear interpolation. The computational complexity of the D^{3} depends on the length of the sequence to be detected, nevertheless, a significant complexity reduction can be achieved using the Viterbi algorithm.

cs.IT↗

arXiv2019

Intelligent Active Queue Management Using Explicit Congestion Notification

As more end devices are getting connected, the Internet will become more congested. Various congestion control techniques have been developed either on transport or network layers. Active Queue Management (AQM) is a paradigm that aims to mitigate the congestion on the network layer through active buffer control to avoid overflow. However, finding the right parameters for an AQM scheme is challenging, due to the complexity and dynamics of the networks. On the other hand, the Explicit Congestion Notification (ECN) mechanism is a solution that makes visible incipient congestion on the network layer to the transport layer. In this work, we propose to exploit the ECN information to improve AQM algorithms by applying Machine Learning techniques. Our intelligent method uses an artificial neural network to predict congestion and an AQM parameter tuner based on reinforcement learning. The evaluation results show that our solution can enhance the performance of deployed AQM, using the existing TCP congestion control mechanisms.

cs.NI↗

arXiv2015

Wireless Resources Virtualization for Cloud Radio Access Networks (C-RAN)

This paper provides solutions for virtualizing C-RANs wireless resources and sharing them between multiple mobile network operators (MNOs). The proposed solutions dynamically allocate wireless resources to users who subscribe to MNOs across the network. In addition, the proposed solutions maintain a high level of isolation between different MNOs, provide efficient and fair resource utilization, enable different scheduling polices, and manage intercell interference (ICI). An optimal solution is formulated as a combinatorial problem, which is computationally expensive. Consequently, two low-complexity suboptimal solutions with comparable performance are provided. The optimal and suboptimal solutions are compared in terms of complexity and performance.

cs.NI↗

arXiv2014

NFV: State of the Art, Challenges and Implementation in Next Generation Mobile Networks (vEPC)

As mobile network users look forward to the connectivity speeds of 5G networks, service providers are facing challenges in complying with connectivity demands without substantial financial investments. Network Function Virtualization (NFV) is introduced as a new methodology that offers a way out of this bottleneck. NFV is poised to change the core structure of telecommunications infrastructure to be more cost-efficient. In this paper, we introduce a Network Function Virtualization framework, and discuss the challenges and requirements of its use in mobile networks. In particular, an NFV framework in the virtual environment is proposed. Moreover, in order to reduce signaling traffic and achieve better performance, this paper proposes a criterion to bundle multiple functions of virtualized evolved packet-core in a single physical device or a group of adjacent devices. The analysis shows that the proposed grouping can reduce the network control traffic by 70 percent.

cs.NI↗

arXiv2014

Software-Defined Networking: State of the Art and Research Challenges

Plug-and-play information technology (IT) infrastructure has been expanding very rapidly in recent years. With the advent of cloud computing, many ecosystem and business paradigms are encountering potential changes and may be able to eliminate their IT infrastructure maintenance processes. Real-time performance and high availability requirements have induced telecom networks to adopt the new concepts of the cloud model: software-defined networking (SDN) and network function virtualization (NFV). NFV introduces and deploys new network functions in an open and standardized IT environment, while SDN aims to transform the way networks function. SDN and NFV are complementary technologies; they do not depend on each other. However, both concepts can be merged and have the potential to mitigate the challenges of legacy networks. In this paper, our aim is to describe the benefits of using SDN in a multitude of environments such as in data centers, data center networks, and Network as Service offerings. We also present the various challenges facing SDN, from scalability to reliability and security concerns, and discuss existing solutions to these challenges.

cs.NI↗

arXiv2013

Resource Allocation in a Network-Based Cloud Computing Environment: Design Challenges

Cloud computing is an increasingly popular computing paradigm, now proving a necessity for utility computing services. Each provider offers a unique service portfolio with a range of resource configurations. Resource provisioning for cloud services in a comprehensive way is crucial to any resource allocation model. Any model should consider both computational resources and network resources to accurately represent and serve practical needs. Another aspect that should be considered while provisioning resources is energy consumption. This aspect is getting more attention from industry and governments parties. Calls of support for the green clouds are gaining momentum. With that in mind, resource allocation algorithms aim to accomplish the task of scheduling virtual machines on data center servers and then scheduling connection requests on the network paths available while complying with the problem constraints. Several external and internal factors that affect the performance of resource allocation models are introduced in this paper. These factors are discussed in detail and research gaps are pointed out. Design challenges are discussed with the aim of providing a reference to be used when designing a comprehensive energy aware resource allocation model for cloud computing data centers.

cs.NI↗

arXiv2013

Modeling Self-Similar Traffic for Network Simulation

In order to closely simulate the real network scenario thereby verify the effectiveness of protocol designs, it is necessary to model the traffic flows carried over realistic networks. Extensive studies [1] showed that the actual traffic in access and local area networks (e.g., those generated by ftp and video streams) exhibits the property of self-similarity and long-range dependency (LRD) [2]. In this appendix we briefly introduce the property of self-similarity and suggest a practical approach for modeling self-similar traces with specified traffic intensity.

cs.NI↗

arXiv2013

A Game Theory Interpretation for Multiple Access in Cognitive Radio Networks with Random Number of Secondary Users

In this paper a new multiple access algorithm for cognitive radio networks based on game theory is presented. We address the problem of a multiple access system where the number of users and their types are unknown. In order to do this, the framework is modelled as a non-cooperative Poisson game in which all the players are unaware of the total number of devices participating (population uncertainty). We propose a scheme where failed attempts to transmit (collisions) are penalized. In terms of this, we calculate the optimum penalization in mixed strategies. The proposed scheme conveys to a Nash equilibrium where a maximum in the possible throughput is achieved.

cs.GT↗

arXiv2012

A Novel Algorithm for Real-time Procedural Generation of Building Floor Plans

Real-time generation of natural-looking floor plans is vital in games with dynamic environments. This paper presents an algorithm to generate suburban house floor plans in real-time. The algorithm is based on the work presented in [1]. However, the corridor placement is redesigned to produce floor plans similar to real houses. Moreover, an optimization stage is added to find a corridor placement with the minimum used space, an approach that is designed to mimic the real-life practices to minimize the wasted spaces in the design. The results show very similar floor plans to the ones designed by an architect.

cs.GR↗