Proactive Cognitive Networks with Predictable Demand

In this paper we characterize the proactive diversity gain of a cognitive network with predictable primary and secondary requests. Network performance is analyzed under two proposed proactive service policies that preserve higher priority for the primary user. The first policy preserves the primary diversity bound as if there is no secondary user in the network, whereas the second policy boosts the secondary diversity with guaranteed higher primary diversity. For each policy, we derive diversity gain bounds for primary and secondary users. We show that the predictability of secondary requests can remarkably boost quality of service (QoS) of the secondary user compared to the previous literature when secondary requests are nonpredictable. We provide numerical simulations to validate our analytical findings and demonstrate performance merits.

[1]  Donald F. Towsley,et al.  Optimal scheduling policies for a class of queues with customer deadlines to the beginning of service , 1988, JACM.

[2]  Minghua Chen,et al.  Effect of proactive serving on user delay reduction in service systems , 2014, SIGMETRICS '14.

[3]  Chaiwat Oottamakorn,et al.  Statistical service assurances for traffic scheduling algorithms , 2000, IEEE Journal on Selected Areas in Communications.

[4]  Jong-Moon Chung,et al.  Statistical admission control for real-time services under earliest deadline first scheduling , 2005, Comput. Networks.

[5]  Atilla Eryilmaz,et al.  Proactive resource allocation: Turning predictable behavior into spectral gain , 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[6]  Vijay Sivaraman,et al.  Statistical Analysis of Delay Bound Violations at an Earliest Deadline First (EDF) Scheduler , 1999, Perform. Evaluation.

[7]  Atilla Eryilmaz,et al.  Proactive resource allocation in cognitive networks , 2011, 2011 Conference Record of the Forty Fifth Asilomar Conference on Signals, Systems and Computers (ASILOMAR).

[8]  Ali Movaghar-Rahimabadi,et al.  Non-preemptive earliest-deadline-first scheduling policy: a performance study , 2005, 13th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems.

[9]  Atilla Eryilmaz,et al.  Proactive Resource Allocation: Harnessing the Diversity and Multicast Gains , 2011, IEEE Transactions on Information Theory.

[10]  Albert-László Barabási,et al.  Limits of Predictability in Human Mobility , 2010, Science.

[11]  Damon Wischik,et al.  Big Queues, Springer Lecture Notes in Mathematics , 2004 .

[12]  Minghua Chen,et al.  When Backpressure Meets Predictive Scheduling , 2013, IEEE/ACM Transactions on Networking.

[13]  Anthony Ephremides,et al.  Optimal scheduling with strict deadlines , 1989 .