A source-destination based dynamic pricing scheme to optimize resource utilization in heterogeneous wireless networks

Mobile wireless resources demand is rapidly growing due to the proliferation of bandwidth-hungry mobile devices and applications. This has resulted in congestion in mobile wireless networks (MWN) especially during the peak hours when user traffic can be as high as tenfold the average traffic. Mobile network operators (MNOs) have been trying to solve this problem in various ways. First, MNOs have tried to expand the network capacity but have still been unable to meet the peak hour demand. Focus has then shifted to economic and behavioral mechanisms. The widely used of these economic mechanisms is dynamic pricing which varies the MWN resources' price according to the congestion level in the MWN. This encourages users to shift their non-critical traffic from the busy hour, when the MWN is congested, to off-peak hours when the network is under-utilized. As a result, congestion of the MWN during the peak hours is reduced. At the same time, the MWN utilization during the off-peak hours is also increased. The current dynamic pricing schemes, however, only consider the congestion level in the call-originating cell and neglect the call-destination cell when computing the dynamic price. Due to this feature, we refer the current dynamic pricing schemes as source–based dynamic pricing (SDP) schemes in this work. The main problem with these schemes is that, when the majority of the users in a congested cell are callees, dynamic pricing is ineffective because callers and not callees pay for network services, and resources used by callers and callees are the same for symmetric services. For example, application of dynamic pricing does not deter a callee located in a congested cell from receiving a call, which originates from a caller located in an uncongested cell. Also, when the distribution of prospective callees is higher than that of callers in an underutilized cell, SDP schemes are ineffective as callees do not pay for a call and therefore low discounts do not entice them to increase utilization. In this distribution, dynamic pricing entices prospective callers to make calls but since their distribution is low, the MWN resource utilization does not increase by any significant margin. To address these problems, we have developed a source-destination based dynamic pricing (SDBDP) scheme, which considers congestion levels in both the call-originating and calldestination cells to compute the dynamic price to be paid by a caller. This SDBDP scheme is integrated with a load-based joint call admission control (JCAC) algorithm for admitting incoming service requests in to the least utilized radio access technology (RAT). The load-based JCAC algorithm achieves uniform traffic distribution in the heterogeneous wireless network (HWN). To test the SDBDP scheme, we have developed an analytical model based on M/M/m/m queuing model. New or handoff service requests, arriving when all the RATs in the HWN are fully utilized, lead to call blocking for new calls and call dropping for handoff calls. The call blocking probability, call dropping probability and percentage MWN utilization are used as the performance metrics in evaluating the SDBDP scheme. An exponential demand model is used to approximate the users' response to the presented dynamic price. The exponential demand model captures both the price elasticity of demand and the demand shift constant for different users. The matrix laboratory (MATLAB) tool has been used to carry out the numerical simulations. An evaluation scenario consisting of four groups of co-located cells each with three RATs is used. Both SDP and the developed SDBDP schemes have been subjected under the evaluation scenario. Simulation results show that the developed SDBDP scheme reduces both the new call blocking and handoff call dropping probabilities during the peak hours, for all callercallee distributions. On the other hand, the current SDP scheme only reduces new call blocking and handoff call dropping probabilities only under some caller –callee distributions (When the callers were the majority in the HWN). Also, the SDBDP scheme increases the percentage MWN utilization during the off-peak for all the caller-callee distributions in the HWN. On the other hand, the SDP scheme is found to increase the percentage MWN utilization only when the distribution of callers is higher than that of callees in the HWN. From analyzing the simulations results, we conclude that the SDBDP scheme achieves better congestion control and MWN resource utilization than the existing SDP schemes, under arbitrary caller-callee distribution

Essays in Behavioral Labor Economics

This dissertation consists of three essays in Behavioral Labor Economics. The first two chapters contribute to the understanding of non-standard preferences of individuals in the workplace, and the third studies how cultural values affect firm behavior. The first chapter studies the incentive effects of top-down favoritism in employee promotions on workers and its organization-wide productivity consequences, and provides evidence on social preferences and fairness concerns among co-workers. Using data from public high schools in four Chinese cities, I first show that teachers with hometown or college ties to the school principal are twice as likely to be promoted, after controlling for characteristics on their application profiles and their value-added in teaching. I then use the results from a survey in which I asked teachers to select anonymous peers to promote from a pool of applicants applying for promotion to infer each teacher’s revealed fairness views regarding promotion qualifications. Contrasting these with actual past promotions in turn allows me to measure if and when a teacher might have observed unfair promotions in her own school in the past. Exposure to unfair promotions adversely affects non-applicant teachers’ output, lowering their value-added and raising the probability that high-value-added teachers quit. The value-added effect appears to be driven primarily by teachers’ social preferences for peer workers and the consequent erosion of their morale when peers suffer unfair treatment, while the quitting effect comes mainly from non-favored prospective applicants’ career concerns as they learn about the principal’s bias and leave due to poor promotion prospects. These adverse spillover incentive effects lead to a substantial reduction in school-wide output, which is only slightly mitigated by increased productivity among favored teachers. Finally, a transparency reform that required principals to disclose to their peers the profiles of teachers that apply for promotion reduced the principals’ bias and improved the overall productivity of schools. The second chapter documents daily targeting behavior in workers’ labor supply decisions. Using a novel dataset on the daily production of a group of piece-rate manufacturing workers combined with their quasi-random daily income shocks from lunch break card game gambling, I show that the workers’ afternoon labor supply responds negatively to instantaneously-paid quasi-random gambling income, although wages are paid monthly. The workers’ labor supply decisions were consistent with daily mental accounting and reference dependence where the target was set on the sum of the face - valued daily (receivable) labor and (paid) unearned income, as opposed to the neoclassical model of inter-temporal labor supply. Estimation of two structural models of daily labor supply yields a coefficient of loss aversion parameter of 1.8 to 2.0, significantly different from the neoclassical value of 1; and individual specific loss aversion structural estimates correlate positively with survey measures. Using estimated preference parameters, I back out the implied total wage elasticity of daily labor supply as well as a sizable negative reference-dependent component of it. This study overcomes the common identification issues in the daily labor supply literature by exploiting high-frequency, actively taken-up and unanticipated income shifters that are independent of other labor supply and demand confounders. In the third chapter, we show that many employers anchor their wages at establishments outside of the home region to headquarter levels, and begin to study the consequences. Our analysis makes use of an unusual 2005-2015 establishment-year level dataset of average wages by narrowly-defined occupation. The dataset covers 1,800 large employers that span many different sectors and each operate in a subset of 170 observed capital city locations. We show that, across the occupational skill range—including for low-skill support staff— the average wage multinationals pay domestic workers in a given occupation at foreign establishments is robustly and remarkably highly correlated with the average wage they pay workers in the same occupation in the home country. We then instrument for headquarter wage levels with changes in home country minimum wage laws and show that externally imposed wage increases at home causally raise wages abroad. The relationships we establish between headquarters’ and their foreign establishments’ wage levels and wage changes are both driven by employers from inequality-averse societies. Occupations are more (less) likely to be removed from, and less (more) likely to be added to the foreign establishments (headquarters) of such employers after a (minimum wage-induced) wage increase originating at the headquarter. Our results point towards the existence of “wage cultures” that influence how production is organized across space

Network level performance of differentiated services (diffserv) networks

The Differentiated Services (DiffServ) architecture is a promising means of providing Quality of Service (QoS) in Internet. In DiffServ networks, three service classes, or Per-hop Behaviors (PHBs), have been defined: Expedited Forwarding (EF), Assured Forwarding (AF) and Best Effort (BE). In this dissertation, the performance of DiffServ networks at the network level, such as end-to-end QoS, network stability, and fairness of bandwidth allocation over the entire network have been extensively investigated. It has been shown in literature that the end-to-end delay of EF traffic can go to infinity even in an over-provisioned network. In this dissertation, a simple scalable aggregate scheduling scheme, called Youngest Serve First (YSF) algorithm is proposed. YSF is not only able to guarantee finite end-to-end delay, but also to keep a low scheduling complexity. With respect to the Best Effort traffic, Random Exponential Marking (REM), an existing AQM scheme is studied under a new continuous time model, and its local stable condition is presented. Next, a novel virtual queue and rate based AQM scheme (VQR) is proposed, and its local stability condition has been presented. Then, a new AQM framework, Edge-based AQM (EAQM) is proposed. EAQM is easier to implement, and it achieves similar or better performance than traditional AQM schemes. With respect to the Assured Forwarding, a network-assist packet marking (NPM) scheme has been proposed. It has been demonstrated that NPM can fairly distribute bandwidth among AF aggregates based on their Committed Information Rates (CIRs) in both single and multiple bottleneck link networks

Final report on the evaluation of RRM/CRRM algorithms

Deliverable public del projecte EVERESTThis deliverable provides a definition and a complete evaluation of the RRM/CRRM algorithms selected in D11 and D15, and evolved and refined on an iterative process. The evaluation will be carried out by means of simulations using the simulators provided at D07, and D14.Preprin

The Effect of High School Matriculation Awards: Evidence from Randomized Trials

In Israel, as in many other countries, a high school matriculation certificate is required by universities and some jobs. In spite of the certificate's value, Israeli society is marked by vast differences in matriculation rates by region and socioeconomic status. We attempted to increase the likelihood of matriculation among low-achieving students by offering substantial cash incentives in two demonstration programs. As a theoretical matter, cash incentives may be helpful if low-achieving students reduce investment in schooling because of high discount rates, part-time work, or face peer pressure not to study. A small pilot program selected individual students within schools for treatment, with treatment status determined by previous test scores and a partially randomized cutoff for low socioeconomic status. In a larger follow-up program, entire schools were randomly selected for treatment and the program operated with the cooperation of principals and teachers. The results suggest the Achievement Awards program that randomized treatment at the school level raised matriculation rates, while the student-based program did not.

A novel multimedia adaptation architecture and congestion control mechanism designed for real-time interactive applications

PhDThe increasing use of interactive multimedia applications over the Internet has created a problem of congestion. This is because a majority of these applications do not respond to congestion indicators. This leads to resource starvation for responsive flows, and ultimately excessive delay and losses for all flows therefore loss of quality. This results in unfair sharing of network resources and increasing the risk of network ‘congestion collapse’. Current Congestion Control Mechanisms such as ‘TCP-Friendly Rate Control’ (TFRC) have been able to achieve ‘fair-share’ of network resource when competing with responsive flows such as TCP, but TFRC’s method of congestion response (i.e. to reduce Packet Rate) is not ideally matched for interactive multimedia applications which maintain a fixed Frame Rate. This mismatch of the two rates (Packet Rate and Frame Rate) leads to buffering of frames at the Sender Buffer resulting in delay and loss, and an unacceptable reduction of quality or complete loss of service for the end-user. To address this issue, this thesis proposes a novel Congestion Control Mechanism which is referred to as ‘TCP-friendly rate control – Fine Grain Scalable’ (TFGS) for interactive multimedia applications. This new approach allows multimedia frames (data) to be sent as soon as they are generated, so that the multimedia frames can reach the destination as quickly as possible, in order to provide an isochronous interactive service. This is done by maintaining the Packet Rate of the Congestion Control Mechanism (CCM) at a level equivalent to the Frame Rate of the Multimedia Encoder.The response to congestion is to truncate the Packet Size, hence reducing the overall bitrate of the multimedia stream. This functionality of the Congestion Control Mechanism is referred to as Packet Size Truncation (PST), and takes advantage of adaptive multimedia encoding, such as Fine Grain Scalable (FGS), where the multimedia frame is encoded in order of significance, Most to Least Significant Bits. The Multimedia Adaptation Manager (MAM) truncates the multimedia frame to the size indicated by the Packet Size Truncation function of the CCM, accurately mapping user demand to available network resource. Additionally Fine Grain Scalable encoding can offer scalability at byte level granularity, providing a true match to available network resources. This approach has the benefits of achieving a ‘fair-share’ of network resource when competing with responsive flows (as similar to TFRC CCM), but it also provides an isochronous service which is of crucial benefit to real-time interactive services. Furthermore, results illustrate that an increased number of interactive multimedia flows (such as voice) can be carried over congested networks whilst maintaining a quality level equivalent to that of a standard landline telephone. This is because the loss and delay arising from the buffering of frames at the Sender Buffer is completely removed. Packets sent maintain a fixed inter-packet-gap-spacing (IPGS). This results in a majority of packets arriving at the receiving end at tight time intervals. Hence, this avoids the need of using large Playout (de-jitter) Buffer sizes and adaptive Playout Buffer configurations. As a result this reduces delay, improves interactivity and Quality of Experience (QoE) of the multimedia application

Performance enhancement of large scale networks with heterogeneous traffic.

Finally, these findings are applied towards improving the performance of the Differentiated Services architecture by developing a new Refined Assured Forwarding framework where heterogeneous traffic flows share the same aggregate class. The new framework requires minimal modification to the existing Diffserv routers. The efficiency of the new architecture in enhancing the performance of Diffserv is demonstrated by simulation results under different traffic scenarios.This dissertation builds on the notion that segregating traffic with disparate characteristics into separate channels generally results in a better performance. Through a quantitative analysis, it precisely defines the number of classes and the allocation of traffic into these classes that will lead to optimal performance from a latency standpoint. Additionally, it weakens the most generally used assumption of exponential or geometric distribution of traffic service time in the integration versus segregation studies to date by including self-similarity in network traffic.The dissertation also develops a pricing model based on resource usage in a system with segregated channels. Based on analytical results, this dissertation proposes a scheme whereby a service provider can develop compensatory and fair prices for customers with varying QoS requirements under a wide variety of ambient traffic scenarios.This dissertation provides novel techniques for improving the Quality of Service by enhancing the performance of queue management in large scale packet switched networks with a high volume of traffic. Networks combine traffic from multiple sources which have disparate characteristics. Multiplexing such heterogeneous traffic usually results in adverse effects on the overall performance of the network

Quality of service differentiation for multimedia delivery in wireless LANs

Delivering multimedia content to heterogeneous devices over a variable networking environment while maintaining high quality levels involves many technical challenges. The research reported in this thesis presents a solution for Quality of Service (QoS)-based service differentiation when delivering multimedia content over the wireless LANs. This thesis has three major contributions outlined below: 1. A Model-based Bandwidth Estimation algorithm (MBE), which estimates the available bandwidth based on novel TCP and UDP throughput models over IEEE 802.11 WLANs. MBE has been modelled, implemented, and tested through simulations and real life testing. In comparison with other bandwidth estimation techniques, MBE shows better performance in terms of error rate, overhead, and loss. 2. An intelligent Prioritized Adaptive Scheme (iPAS), which provides QoS service differentiation for multimedia delivery in wireless networks. iPAS assigns dynamic priorities to various streams and determines their bandwidth share by employing a probabilistic approach-which makes use of stereotypes. The total bandwidth to be allocated is estimated using MBE. The priority level of individual stream is variable and dependent on stream-related characteristics and delivery QoS parameters. iPAS can be deployed seamlessly over the original IEEE 802.11 protocols and can be included in the IEEE 802.21 framework in order to optimize the control signal communication. iPAS has been modelled, implemented, and evaluated via simulations. The results demonstrate that iPAS achieves better performance than the equal channel access mechanism over IEEE 802.11 DCF and a service differentiation scheme on top of IEEE 802.11e EDCA, in terms of fairness, throughput, delay, loss, and estimated PSNR. Additionally, both objective and subjective video quality assessment have been performed using a prototype system. 3. A QoS-based Downlink/Uplink Fairness Scheme, which uses the stereotypes-based structure to balance the QoS parameters (i.e. throughput, delay, and loss) between downlink and uplink VoIP traffic. The proposed scheme has been modelled and tested through simulations. The results show that, in comparison with other downlink/uplink fairness-oriented solutions, the proposed scheme performs better in terms of VoIP capacity and fairness level between downlink and uplink traffic

Ethernet - a survey on its fields of application

During the last decades, Ethernet progressively became the most widely used local area networking (LAN) technology. Apart from LAN installations, Ethernet became also attractive for many other fields of application, ranging from industry to avionics, telecommunication, and multimedia. The expanded application of this technology is mainly due to its significant assets like reduced cost, backward-compatibility, flexibility, and expandability. However, this new trend raises some problems concerning the services of the protocol and the requirements for each application. Therefore, specific adaptations prove essential to integrate this communication technology in each field of application. Our primary objective is to show how Ethernet has been enhanced to comply with the specific requirements of several application fields, particularly in transport, embedded and multimedia contexts. The paper first describes the common Ethernet LAN technology and highlights its main features. It reviews the most important specific Ethernet versions with respect to each application field’s requirements. Finally, we compare these different fields of application and we particularly focus on the fundamental concepts and the quality of service capabilities of each proposal