U.S. Patent
Apr. 1' 2014
Sheet 1 0f3
"
?
mOP
?:
US 8,688,5z0 B2
U S. Patent
Apr. 1' 2014
Sheet 2 0f3
US 8,688,5Z0 B2
U.S. Patent
Apr. 1' 2014
Sheet 3 0f3
US 8,688,5Z0 B2
605
FIG_6
609
US 8,688,S20 B2
4
3
appr0pliate number Of users that should be in the regular
It is assumed that the basestations Pr0Vide t0 the gateway
On Which the invention is dep10yed, a feedback of tWO quan
group, eVen as the capacity C Huctuates. N0tice that We deHne
tities eVery 6 11I1its Oftime?(i) the basestation 11tilization, and
0 in tenns Of the SLA agreed bet??een the users and the
network 0Perators' and not in tenns of the traHic demand of
(ii) the current modulation and coding sChem?? (MCS) Ofeach
actiVe 11Ser. TTle second quantity helps keep ?? updated based
the 11Sers. We assume that each user has a Hnite queue in ()Pal,
on the user's changing Channel C0nditi0ns. Both quantities
On Which We emp10y actiVe queue management. SpeciHcally,
if the queue size exceeds a threshold Rj, One Packet out of
help the invention synchronize With the basestati0n capacity,
eVery 10 Packets is dropped. This is helP?Jl in indicating
and als0 identify 0Ver10ad Conditions. This infonnation is
either already available On C0mmercia1 Macr0ce11 base sta
tions (e.g. the NEC WiMAX basestati0n Pr0Vides this infor
0
mation Via the R6 interface and SNMP), Or Can be added
less channel is utilized and is deHned as the rati0 Of the
resource sl0ts used for transmission and the t0tal available
Sl0ts in 6 units Of time.
Finally, the Contract bet??'een an advenisement agency and
a network 0Perator includes the minimum number oftimes an
advertisement is displayed t0 11Sers 0Ver a giveI1time Period
reg11lar group 103, and emp10ys Pr0porti0nal fair 114
20
25
the effect of MAC Scheduler on the basestati0n.
There is nOW dehved a Simple analytical framew0rk t0
30
basestati0n is c0ntinu0usly 0Ver10aded. For simplicity, let all
107 (See Afgolithm 1 in FIG. 5). The goal of this migration
35
Can be rewritten as
(eq? 4)
40
represents the amount of time advertisements are shown t0 a
user at a Stretch. Each user that is m0Ved int0 the target group
If C is the capacity Of the basestati0n, then C?M?+N???
(G?N)?+N??, Which on simplifying gives
is marked (See lines 4-6 iI1Alg0lithm 1 Of FIG. 5) t0 ensuTe
that he Will I10t get repeatedly Selected for advertisement
delivery eVen if he has Very 10W Z_; Such a user Will get
selected again Only after all other act1Ve users haVe als0 been
users haVe the same bandwidth SLA Of ?. Let M be the
number Of users that Can be supponed in the regular group at
an average serVice rate Of?, and let N be the number Ofusers
in the target group receiving advertisements at a rate Of??. Let
G?M+N represent the total number Ofusers. TT1en Equation 2
the Statement 30. EVery time a user is m0Ved t0 the target
units of time. \'r is conHgurable by network 0Perators' and
highlight the inventi0n's functionality better, and mainly t0
help a netw0rk 0Perat0r ConHgure the Value Of ?'r in an
informed manner. Consider a time interVal T duling Which the
Sented by Z_ for HOW j) are migrated 113 t0 the target group
group, Z_ is incremented by 1.
The fl'0ws moved to the target group remain there for Vr
detailed in 0ther Works, and hence I10t discussed here. With
Out the synchronizer, the invention cann0t detect 0Ver10ad
effectively based on just the utilization feedback from the
basestati0n. The synchronizer essentially attempts t0 disable
actiVe users With minimum Value Of dissatisfacti0n (repre—
appr0ach in Statement 30 iI1the Alg0lithm 1 is t0 disc0ver the
appr0pliate number Of HOWS t0 be maintained in the target
group such that the remaining HOWS receive adequate serVice
rate. This may happen in multiple steps due t0 the Condition in
Where it is assumed that 0.2 is the maximum P0ssible round
triP delay in Seconds between a TCP SouTce and its receiver.
Finally, a synchronizer 105 ensures that only enough num
ber Of Packets are sent t0 the basestation 109 PeIiodically t0
match With the Capacity Of the basestati0n, and hence aV0id
queue build 11P at the base station. Note that eVery time the
basestati0n utilizati0n is c10se t0 100%, the aggregate serVice
rate Ofall the users represents the basestation Capacity C. The
design and evaluation Of a robust synchronizer that adapts t0
Changing available Capacity Of the basestation is heret0fore
resource al10cation (11Sing the PeIiodic MCS feedback from
the basestation) acr0ss the users. The invention employs Per
user queues, and monitors the service rate and the queue
length for each user. If a user's queue builds uP beyond a
threshold and the SerVice rate for the user is be10W ??, S0me
exceeds 2Rj, all Subsequent Packets are dropped. In One
example, We Set
easily. TTle basestation 11tilization depicts hOW fully the Wire
(e.g. a day). The invention attempts t0 meet this requirement
both When the basestati0n is 0Ver10aded and When it is under
10aded.
AS I10ted before, the invention Considers tWO groups of
users: regular users that receive their traHic share Of ?j, and
targeted users that receive advenisements du?ing basestati0n
109 0Ver10ads. The invention initially maps all users t0 the
Congestion if the user has TCP HOWS, and is shown t0 Work
Well for br0adband Wireless netw0rks. If the queue size
? G?? C
45
/V
shown an advertisement once. Additi0nally, a user is
Substituting the Value Of G from equation 4,
unmarked once a cenain amount of time has Passed (e.g. 15
minutes) after being marked, assuming that repeating an
advertisement beyond this time is t0lerable t0 the user during
0Ver10ad. This marking essentially achieves a n0tion Of a
?
50
round Within Which an actiVe user is selected only Once. The
a1g0lithm has an interesting Propeny that if there is POSitive
discrepancy in Z? (i.e. difference bet??'een maximum and
minimum Z') among the current actiVe 11Sers, the algorithm
neVer increases the discrepancy in Z'; the discrepancy either
55
reduces Or remains the same. In 0ther Words, the invention
0C
(eql 6)
/V ? ? ? ?1`Z ~
NOW, With 0Pal, let Vr be the time for Which a user gets
m0Ved int0 the targeted group. 0Pal ensures that N users exist
in the target group at any P0int Oftime, S0 that M users receive
a service rate Of ?. Hence, referling t0 FIG. 2' Consider the
duTation T t0 be intervals Of V', each accounting for N user
migrations. Then, the total number ofuser migrations int0 the
target group in time T is giVen by
greedily attempts t0 equalize the number of advenisements
seen by users.
TT1e 0Ver10ad factor 0 is deHned as the fraction Of addi
tional Capacity required t0 Satisfy users' bandwidth SLAS
(eq_ S)
? ? ?? ~
T
60
/V l (?)_
0Ver the actual basestation capacity C. Then,
With G actiVe users iI1the system, the number Of migrations
Per user is
65
The ab0Ve equation and the Condition in line 30 0fAlg0rithm
l, FIG. 5' ensures that 0Pal aut0matically disc0vers the
US 8,688,S20 B2
6
5
Using equati0ns 4 and 6 and simplifying,
From the f0reg0ing in C0njuncti0n With the diagram Of
FIG. 6, for the Cellular basestations that get 0Ver10aded Occa
Sionally 601 the invention 0Pponunistically aligns advertise—
ment delivery With the basestation 0Ver10ad 603 S0 that users
see minimum disruption in network serVice 605. Advertise—
ment delivery is Pr0Vided With minimum state maintenance
607. Du?ing under10ad basestati0n Conditi0ns, SPeCiHC adVer
Hence, giVen a Ch0ice Of\'” and the basestation 0Ver10ad,
tisements are selected t0 meet advenisement Contracts and
and known Values ? and ??z, a netw0rk 0Perator Can estimate
the number Of advenisements a user Will be sh0Wn (See FIG.
rand0m users are selected 609. Duling 0Ver10ad basestation
Conditi0ns, SPeCiHC users are selected t0 equalize network
unavailability and reand0m advenisements are selected 611.
The f0reg0ing is t0 be underst00d as being in eVery respect
ill11strative and exemplary, but I10t restlictive, and the SCOPe Of
the inventi0n disc10sed herein is n0t t0 be determined from the
Detailed Description, but rather from the Claims as inter
3). Alten1ately, t0 Control number of interrupti0ns U" Per user,
an 0Perator may ch00se t0 use a longer \'? during higher
0Ver10ads and sh0W advenisements for a longer Period Of
time. The graph Sh0WS that for masking Off a Persistent 0Ver
10ad of 20% for a duration of 10 minutes at a basestati0n, it is
sufHcient t0 Show 3 advenisements t0 each user of about 35
Preted acc0rding t0 the full breadth Permitted by the Patent
Second duration. More imponantly, the effect 0fiI1creasiI1g?'z
is more dramatic initially and then Hattens relatively a?er?
Wards. This behavior is g00d because, the 0Perator Can easily
strike the tradeoff by ch00sing an 0Perating P0int \'r in the
region Where the CurVe begins t0 Hatten; this 0Perating P0int,
20
however, is different for different 0Ver10ad fact0rs.
The invention Schedules as many advenisements as POS
Sible duling basestation 0Ver10ads t0 the targeted users. HOW
eVer, ifthe basestati0n does I10t get 0Ver10aded enough duling
a day, each advertisement is shown at least a certain number
25
of times in a giVen Peliod t0 Satisfy advertisement C0ntracts.
The issue if Which advertisement should be scheduled at any
instant Oftime has t0 be addressed With the obj ectiVe that each
advertisement is seen by as many unique users as POSsible for
maximal C0Verage.
Du?ing 0Ver10ad, SPeCiHC users are Hrst selected by Alg0
rithm l, FIG. 5, based on Z? t0 be m0Ved t0 the target group.
Hence, t0 maximize the number of unique advertisements
serVed t0 11Sers Without explicitly maintaining state, 0Pal
selects an advenisement rand0mly. Alg0rithm 2, FIG. 5,
depicts the basic idea Of advenisement Scheduling duling
basestation 0Ver10ad. SpeciHca11y, rand0m selection Of the
advertisements av0ids any Synchf0nizati0n between the num
ber Of advertisements and number Of actiVe 11Sers that Can
Cause the same advenisement being repeatedly Shown t0 a
11Ser. Funher, random selection ensuTes that the advertisement
list itselfcan be dynamic, i.e. advenisements Can be rem0ved
and added.
Du?ing under10ad, SPeCiHC advertisements are Hrst
selected t0 meet the Contracts; i.e., the advertisements that
haVe been shown bel0W a SmZ? number oftimes are scheduled
for delivery. Hence, t0 maximize the number of unique users
seeing a given advenisement Without maintaining State, (?Pal
Selects users rand0mly. AlgorithIn 3' FIG. 5' represents the
0Verall idea, and FIG. 4 Summarizes the advertisement sched
111ing behavi0r. During under10ad situation, if the number of
Sh0WS for an advenisement is bel0W S??, the advertisement is
scheduled for delivery. Each 0Ver10ad Peliod may Cause
greater than S?'Z? number of advenisements t0 be shown, and
hence the 0Ver10ad Period may be f0110wed by a n0-Sh0W
laWs. It is t0 be underst00d that the embodiments sh0Wn and
described herein are Only illustrative Of the PIinciples Of the
Present inventi0n and that those Skilled in the art may imple
ment Various modiHcati0ns Without depaning from the scope
and spiI`it of the invention. Those skilled in the an Could
implement Valious other featu?e c0mbinati0ns Without
depaning from the SCOPe and spirit of the invention.
The invention Claimed is;
1. A method implemented by a C0mputer C0nHgured t0
Carry Out the fon0wing Steps Of;
C0ntr0lling, by the c0mputer, c0mmunicati0ns by users
across a network With a Predetermined Capacity for 0Pti
mum communication HOWS for all said users; and
30
0Pp0rtunistically aligning, by the C0mputer, advenisement
delivery t0 at least one Of said users responsive t0 an
0Ver10ad Condition in said net??Ork S0 that disrupti0n in
c0mmunicati0n service by said network by said at least
One user as being less than if there Were n0 Said adVer
tisement delivery, Said 0Ver10ad Condition 0ccuTling
When said C0mmunications acr0ss said network being
less than Said Predetennined Capacity;
Wherein said 0Pponunistically aligning advertisement deliV
ery C0mplises a migrati0n Of regular Said users t0 targeted
Said users for receiving Said 0PPOITunistic advenisement
delivery;
Wherein Said migration C0mprises migrating k users With the
least dissatisfaction Value Of user j int0 a target group Of Said
users such that ?:k users ??…0.1*()C, With ?? representing
adjusted reserved bandwidth of user j, 0 representing an
0Ver10ad factor and C representing basestation capacity in
Said I1et`?~'0rk.
2. The method of Claim 1' Wherein said C0mmunicati0ns
are Via a basestation and Said disruption Perceived by Said at
least One user is a minimum.
3. The method Of Claim l, Wherein Said 0Pp0rtunistically
aligning C0mplises selecting SPeCiHC Ones Of said users for
equalizing I1et`?~'0rk unavailabi1ity for said users Of said net
W0rk.
4. The method Of Claim 3, Wherein Said 0Pp0rtunistically
Period When n0 advertisements are sh0Wn t0 users. The num
aligning C0mplises selecting random advertisements for said
ber Of Sh0WS for an advenisement and S?'Z? are reset Periodi
SPeCiHC users.
Cally. Note that the Only State the invention maintains is the
number oftimes an advenisement has been sh0Wn, and n0t t0
Which SPeCiHC users it Was shown; the user Set C0nnected t0 a
basestati0n Can be quite dynamic and large due t0 11Ser mobi1
ity and n0madicity, depending on the 10Cation Ofthe basesta
tion.
5. The method Of Claim l, Wherein Said 0Pp0rtunistically
aligning further C0mplises selecting Predetermined adVer
tisements for displaying t0 rand0m Said users When Said net
Work exhibits an under10ad Condition rather than said 0Ver
10ad C0ndition.
USOO868852OB2
(12) Unlted States l)atent
(10) Patent N0.:
I(0kku et al.
(54)
(45) Date 0f I)atent:
0PPORTUNISTIC ALIGNMENT 0F
ADVERTISEMENT DELIVERY WITH
CELLULAR BASESTATION 0VERLOADS
(51)
(52)
Int_ Cl_
G??2 ??/??
U_S. Cl_
USPC
(75) Inventors: Ravindranath I?0kku, Hyderabad (IN);
(21)
(65)
705/14_59
USPC ............................................... .. 455/33.2, 522
See application Hle for complete search history.
(56)
References Cited
U'S~ PATENT D0CUMENTS
'
S,24l,685 A *
'
'
Subject to any d1scla1mer, the term ofth1s
Patent is extended Or adjusted under 35
U'S?C' 154(b) by 0 days'
APP1' No': 13/315'959
(22) Filed?
................................................... ..
(US); Honghai Zhang, Ewing, NJ (?JS);
Sampath Rangarajan, Bridgewater, NJ
(US)
'
Nonce:
(2O12.Ol)
Rajesh Mahindra, Highland Park, NJ
Pnnceton, NJ ([JS)
(*)
Apr. 1' 2014
(58) Field of Classi?cati0n Search
(73) Assignee: NEC Lab0rat0ries America, Inc_,
'
US 8,688,520 B2
Dec_ 9, 2011
2002/OOZS826
'
'
8/l993 B0din et al. ???????????????? ?? 4SS/4S3
2/2002
Aaltonen et a1. ???????????? ?? 4SS/S22
* cited by examiner
P?…?? EX?……e? ? AffafAhmed 0sman Bila1Ahmed
(74) /lzz0??e?? ?4ge?z' 0? F??? ? Joseph Kolodka
(57)
Pri0r Publicati0n Data
US 2012/01 50597 A1
Jun 14 2012
A1*
ABSTRACT
A method includes controlling communications by users
across a network With a predetennined capacity for desired
communication HOWS for all the users and opportunistically
aligning advenisement delivery t0 the users When an 0Ver10ad
condition in the nenvork occurs so that users perceive the
Related U's_ Appncadon Data
di?r?1Ption in communication service by the network as a
mm1mum.
(60)
Provisional application No. 6l/42l,394, Hled on Dec.
9' 2010.
5 Claims, 3 Drawing sheets