Multi-service load sharing for resource management in the cellular/WLAN integrated network

Abstract

Abstract-With the interworking between a cellular network and wireless local area networks (WLANs), an essential aspect of resource management is taking advantage of the overlay network structure to efficiently share the multi-service traffic load between the interworked systems. In this study, we propose a new load sharing scheme for voice and elastic data services in a cellular/WLAN integrated network. Admission control and dynamic vertical handoff are applied to pool the free bandwidths of the two systems to effectively serve elastic data traffic and improve the multiplexing gain. To further combat the cell bandwidth limitation, data calls in the cell are served under an efficient service discipline, referred to as shortest remaining processing time (SRPT) [1]. The SRPT can well exploit the heavy-tailedness of data call size to improve the resource utilization. An accurate analytical model is developed to determine an appropriate size threshold so that data calls are properly distributed to the integrated cell and WLAN, taking into account the load conditions and traffic characteristics. It is observed from extensive simulation and numerical analysis that the new scheme significantly improves the overall system performance.Index Terms-Cellular/WLAN interworking, resource management, quality of service, load sharing, vertical handoff, admission control.

Service Response Time of Elastic Data Traffic in Cognitive Radio Networks

“…Different bandwidth sharing techniques based on maximum throughput, min-max fairness, proportional fairness, and weighted fairness are considered in the analysis. The response time evaluation of elastic data traffic flows is studied for cellular/WLAN (wireless local area network) integrated networks in [15]- [17]. In the studies, the network supports streaming and elastic data traffic flows.…”

“…In [15] a service request supports only one data file, whereas in [16][17] a service request establishes a data session which may have a number of data files with an exponentially distributed thinking time in between adjacent file transfers. The shortest remaining processor time (SRPT) and processor sharing (PS) service disciplines are considered in [15] and [16] [17], respectively. The mean response time approximation in the SRPT service discipline under a heavy traffic condition is given in [18] (and references there in).…”

“…The service requests at the BS follow a Poisson arrival process with mean arrival rate λ. The lengths of requested files are independently and identically distributed with a Weibull distribution which is common for Internet data traffic [8] in [15]. The probability density function (pdf), f L (·), of file length L given by…”

“…Equations (20) and (21) differ from (14) and (15) in that (20) and (21) do not contain the components for a type p c busy period. The probabilities P busy,p , P idle,int,p , and P idle,av,p are given by…”

Fallback to SRB for Network Optimization in Small Cells

“…Thus, the simplest call management strategy is to block data whenever a voice call is made, however, defeating the purpose of serving voice and data simultaneously. Another straightforward strategy [7] involves blocking data only when the receiving signal strength of a cell phone is less than a pre-specified threshold.…”