Low latency applications, such as multimedia communications, autonomous vehicles, and Tactile Internet are the emerging applications for next-generation wireless networks, such as 5th generation (5G) mobile networks. Existing physical-layer channel models, however, do not explicitly consider quality-of-service (QoS) aware related parameters under specific delay constraints. To investigate the performance of low-latency applications in future networks, a new mathematical framework is needed. Effective capacity (EC), which is a link-layer channel model with QoS-awareness, can be used to investigate the performance of wireless networks under certain statistical delay constraints. In this paper, we provide a comprehensive survey on existing works, that use the EC model in various wireless networks. We summarize the work related to EC for different networks, such as cognitive radio networks (CRNs), cellular networks, relay networks, adhoc networks, and mesh networks. We explore five case studies encompassing EC operation with different design and architectural requirements. We survey various delay-sensitive applications, such as voice and video with their EC analysis under certain delay constraints. We finally present the future research directions with open issues covering EC maximization.

/pdf/effective-capacity-in-wireless-networks-a-comprehensive-31pnfe1z2j.pdf

Effective Capacity in Wireless Networks: A Comprehensive Survey

Asynchronous Transfer Mode (ATM) has emerged as the most promising technology in supporting future broadband multimedia communication services. To accelerate the deployment of ATM technology, the ATM Forum, which is a consortium of service providers and equipment vendors in the communication industries has been created to develop implementation and specification agreements. In this article, we present a brief overview on ATM protocol layers and current progress on LAN Emulation and Traffic Management in the ATM Forum.

A Brief Overview of ATM: Protocol Layers, LAN Emulation, and Traffic Management

A firewall acts as a transparent gateway to a server within a private network by initiating an unsolicited challenge to a client to provide authentication credentials. After receiving the client's credentials, the firewall verifies the authentication credentials and establishes a secure channel for accessing the server. Data destined for the server from the client may be forwarded through the firewall using the secure channel. The firewall may sign, or otherwise indicate that data forwarded to the server is from a client that the firewall has authenticated. The firewall also may provide some level of authentication to the client. While connected to the server, the client may access other servers external to the private network without having the data associated with the other servers pass through the private network. The firewall reduces configuration information that a client otherwise must maintain to access various private network servers.

Reducing network configuration complexity with transparent virtual private networks

Multimedia content is massively generated from various applications and devices, and processed in cloud data centers. Multimedia service providers prefer that their data are processed in data centers close to users in order to offer them high performance and reliable multimedia services that meet the requirements specified in the Service Level of Agreement (SLA). This requires transferring huge data sets of video streams, games content, images etc. across geographically distributed cloud data centers using underutilized bandwidth in backbone transport networks. As the amount of multimedia content increases, the demand to transfer big data sets across data centers increases as well. As such, the leftover bandwidth that appears at different times and for different durations in the backbone network becomes insufficient to satisfy the rapidly increasing demand for multimedia big data transfer. This challenge led to the creation of multi-rate Bandwidth on-Demand (BoD) service offerings for communication between geographically distributed cloud data centers. In this paper, we focus on BoD services which are offered by the Dense Wavelength Division Multiplexing (DWDM) layer because of its huge capacity. We propose a BoD broker which employs a scheduling algorithm that considers various deadlines of multimedia big data transfer requests. The broker in our model leverages the concept of standby wavelengths to minimize peak traffic and accommodate time requirements of delay-tolerant and delay-intolerant transfer requests. We also study strategies of routing and wavelength assignment using Mixed Integer Programming (MIP) optimization to rapidly handle volumes of multimedia big data transfer requests.

Bandwidth On-Demand for Multimedia Big Data Transfer Across Geo-Distributed Cloud Data Centers

In recent years, telecommunication operators are constantly seeking more efficient wireless broadband service, while tele- communication technology is continuously upgrading its access network technologies to cope with the high demands for high-speed in- ternet access and multimedia service by end-users. WiMAX seems to be the solution as it is able to provide easy deployment, high speed data rate and wide range coverage. Most importantly, WiMAX provides Quality of Service (QoS) that can support all kinds of real-time application in wireless networks that includes priority scheduling and queuing for bandwidth allocation that is based on traffic scheduling algorithms within wireless networks. This paper aims to evaluate the implementation of the various types of scheduling algorithms of WiMAX wireless network technolo- gy namely: Diffserv-Enabled (Diffserv), Round Robin (RR), Self-Clocked-Fair (SCF), Strict-Priority (SP), Weighted-Fair Queuing (WFQ) and Weighted-Round Robin (WRR). A detailed simulation study via the QualNet 5.0 simulator evaluation version was carried out with the aim to analyze and evaluate the performance of each scheduler to support the different QoS classes. The results of the simulation showed that effective scheduling algorithm can provide high service standards to support the QoS requirements to meet the different types of demands by the various end-users.

/pdf/comparative-study-of-scheduling-algorithms-in-wimax-235kttk1ll.pdf

Comparative Study of Scheduling Algorithms in WiMAX

The cost minimization of virtual private networks (VPN) that use the resources of an underlying transport network is the key factor for their successful implementation. The investigation in this paper is focused on 'network based VPNs', where the operation of the VPN is outsourced to an Internet Service Provider (ISP). The interest in such solutions is generated both by customers seeking to reduce support costs and by ISPs seeking new revenue sources. Solving the cost minimization would allow Internet service providers (ISPs) to define and deploy new VPN services. The basic building block of VPN is the tunnel. A tunnel operates as an overlay across the backbone, and the traffic sent through the tunnel is opaque to the underlying backbone. A VPN end point can terminate multiple tunnels or forward packets between different tunnels. Different tunnels can share the same physical link and traffic belonging to the same VPN tunnel can be carried along different physical links. The multiplexing and management of the VPN tunnels is made possible by core routers supporting the VPN of the underlying network. The novelty of the presented work is the network flow model of VPN mapping on the underlying ISP network. We assume that the VPN topology, the topology of the ISP network and the total utilization cost for all underlying links are known parameters. Based on this, we propose a network management system based on a network flow optimization in order to define the minimal cost link allocation for the VPN tunnels. We provide a simulation of the proposed optimal establishment of VPN tunnels and performance evaluation of the simulation results.

/pdf/minimal-cost-design-of-virtual-private-networks-3imrw7rl0j.pdf

Minimal cost design of virtual private networks

The use of optical code division multiple access (OCDMA) techniques for contention resolution in optical burst switching (OBS) is proposed. Further a service differentiation scheme is proposed for QoS support. This novel approach achieves wider range of differentiated services than the existing offset-time-based scheme, by assigning prioritized codewords which are embedded in the signature sequence used for OCDMA. Steady-state throughput is obtained and the numerical results show that the proposed scheme provides higher throughput corresponding to the priority class assigned to the burst.

OBS networks using optical code division multiple access techniques

This paper describes an adaptive resource allocation approach and its Linux testbed implementation for QoS enabled virtual private networks (VPNs). Specifically, we present and evaluate three schemes for predicting future traffic rates of a traffic flow from measurements. In our architecture, we also combine several QoS enabled network technologies. DiffServ over MPLS is used as the baseline in the pursuit for end-to-end QoS. Since a VPN operates by transporting traffic through tunnels, we use RSVP-TE to establish explicitly routed label switched paths (LSP). Dynamic class based queuing (CBQ) was chosen to dynamically reallocate resources based on the prediction of future demands. Performance evaluations have been conducted, indicating superior performance.

http://ieeexplore.ieee.org/iel5/8688/27521/01226055.pdf

Design and testbed implementation of adaptive MPLS-DiffServ enabled virtual private networks

Optical transport service providers need control and optimization strategies for wavelength management, network provisioning, restoration and protection, allowing them to define and deploy new services and maintain competitiveness. In this paper, we investigate a game theory based model for wavelength and flow assignment in multi wavelength optical networks, consisting of several backbone long-haul optical network transport service providers (TSPs) who are offering their services -in terms of bandwidth- to Internet service providers (ISPs). The ISPs act as brokers or agents between the TSP and end user. The agent (ISP) buys services (bandwidth) from the TSP. The TSPs compete among themselves to sell their services and maintain profitability. We present a case study, demonstrating the impact of different bandwidth broker demands on the supplier’s profit and the price paid by the network broker. Keywords – wavelength allocation, mixed integer programming, multi-objective optimization, Nash equilibrium, non-cooperative games

Competitive game theoretic optimal routing in optical networks

This paper describes a proposal for the support of quality of service over virtual private networks (VPN). We combine DiffServ, MPLS and a dynamic resource allocation technique in order to provide a QoS-enabled VPN. We apply dynamic resource allocation using traffic predictors. Our predictor assumes that the statistical behavior of aggregate traffic streams is statistically described through /spl alpha/-stable long-range dependent stochastic processes. This is a valid assumption, since some of the authors of this work proved in the past that such distributions more accurately describe aggregate traffic passing through modern networks as compared to earlier models. In our work, we investigate a scenario in which the service provider establishes service level agreements (SLA) with the customers, where the resources and QoS requirements are defined. When operating the network, the provider uses dynamic resource allocation algorithms to pace and forward traffic while optimizing the resource utilization. The conceptual architecture of this technology is provided along with a description of our Linux-based experimental testbed. We also discuss some important performance considerations obtained through extensive computer simulations.

Dynamic resource allocation in QoS-enabled/MPLS supported virtual private networks and its Linux based implementation

Handle everyday research tasks with reliable, citation-backed results

Your personal Research Agent to handle research tasks with citation-backed results

Popular Tasks used by Researchers

How can I help with your research?

Meet SciSpace

Get more enhanced response by uploading the PDFs you want me to reference.

No relevant PDFs in your library

SciSpace is the AI research assistant for academics. Run systematic literature reviews on 280M+ papers, and write papers with cited sources. Trusted by 1M+ students, PhDs & researchers.

SciSpace | AI for Research

Analyze PDFs

Code & Manuscripts

Funding & Grants

Literature & Patents

Medical & Clinical Data

Systematic Review

Visualize & Present

Web & Data

Build a Google Scholar-like website for your research.

Build a website

Create charts and images for your research

Create a Chart

Write a paper for submission to a journal

Draft a manuscript

Patent Search

Design eye-catching scientific posters in minutes.

Scientific Poster Generation

Systematic Literature Review

One task is running at the moment. Your messages will be shown right after.

Drag and drop or click here to browse

Loved by <highlight>1 million+</highlight> researchers

Extract a list of specific topics and their sources from unstructured text

Topics

Compare and analyze relevant papers that matches with your search

Papers

Get insights from PDFs and bookmarked papers from your library

My library

Recent searches

Try searching for:

Catch AI-generated content in scholarly and non-scholarly content

{ai} Detector

Ai Writer

Get PDF Summaries, highlighted text explanations 

Chat with PDF

Effortlessly create in-text citations and bibliographies in APA and 2,500 other formats

Citation generator

Get explanations, summaries, and answers on academic papers

Ease up your research workflow with {scispace}'s cohort of exciting AI tools

Elevate your academic writing skills and convey your ideas the way you want

Paraphraser

Explore our range of reading and writing tools

Your file is being prepared and should be ready in a few minutes. If it's a large file, it might take a bit longer. You can close this window, and we'll email you the file when it's done.

You have reached a maximum limit of <strong>{limit}</strong> columns in the table. Remove at least <strong>1</strong> column to add or create another one.

O. Kabranov

Author Tools

Chat about Author