If we could effectively detect those LOS measurements and make use of them to locate the MP, the performance of the classical location algorithms will be better than using all mixed LOS/NLOS measurements.

if the number of hearable LOS measurements is less than three, it will be a problem to estimate the location of MP.


This rule guarantees 100% sensing coverage as long as no void exists.

this rule underestimates the area that the neighbor nodes can cover, which leads to excess energy consumption.


This policy is relatively insensitive to the number of malicious users in the system and quickly enables customers to distinguish between good and malicious traders.

our evaluation of Vito is by no means exhaustive.


MOBILITY ALGORITHM As shown in section 4, the maximum moving distance of mobiles is small compared to the network size.

we still require a distributed locomotion schedule for which the maximum movement distance is O(log3/4 L).


[41] proposed lightweight crypto-based authentication schemes.

they still require prior-trust among the nodes or a trusted authority for key distribution, which lowers the usability of a BAN.


In order to support spontaneous networking within the dynamics of MANETs, it is important to achieve the address assignment automatically.

address autoconfiguration protocols known from infrastructure networks, e.g.


From line 13 of the subroutine, on one hand, if the difference of the power scaling factors between different length classes is the same, because we have introduced the processing gain m as the denominator in the base, the deleted links must be fewer than its counterpart in NPAN.

since (dik 1) / (/ log(3 nßm) 1 1) / + a ) n / -+ a 2n /a (3nß/ m) =(3nß/ m = , and since (d 1) / a (/ log( 4 ßn) 1 1) / -+ a a (4nß) ik + =(4nß) n = 2n / , the deleted links must be at most equal to its counterpart in NPAN.


Speci.cally, the attacker must craft its transmitting signal to make the target receiver believe a particular channel characteristic.

we show that the crafted signal exhibits inconsistent channel characteristics to the auxiliary receiver.


Both these provisions are necessary if good inter-working between version 1 and version 2 systems is to be possible.

the current specification is not very precise on what a decoder should do when it receives an attribute id that is "unknown" (an attribute defined by some other equipment manufacturer) - or if this can in fact happen.


1 Sieving DSTADDR 0.061 0.047 0.032 0.011 SRCADDR 0.064 0.049 0.033 0.012 DSTPORT 0.077 0.067 0.037 0.016 SRCPORT 0.076 0.060 0.037 0.017 Table 2: Trace 3: Mean relative error in S estimate Distribution Sample Sample&Hold Algo.

1 Sieving DSTADDR 0.198 0.192 0.013 0.013 SRCADDR 0.054 0.049 0.017 0.004 DSTPORT 0.116 0.109 0.016 0.015 SRCPORT 0.069 0.062 0.016 0.005  6.2 Error in estimating entropy Recall from our discussion in Section 2, that it may be the case an accurate estimation of S does not necessarily translate into an accurate estimate of H. we .nd from our evaluations that the streaming algorithms can yield very accurate estimates of H as well.


As long as players respect the imposed time limits and punctually follow the intended route, the video plays back normally.

when the player fails to reach the next checkpoint in time, he respawns at the previous checkpoint  Figure 4: Dynamically dimensioned video playback and the video playback is rewound correspondingly.


At .rst, it may appear that a large share of the DSRC (6out of 7 channels) is available for non-safety communications.

continuous non-safety communication on a SCH would be possible only if all DSRC devices were capable of simultaneously monitoring the CCH while exchanging non-safety data on SCH.


In GPSR, no time is consumed in collecting information from direct neighbors because the information is provided at constant intervals not on demand.

dMOD uses contention messaging with timers to collect information from direct neighbors which increases the delay signi.cantly.


As discussed in the RCS [9], the ACCT cannot be greater than RCCT because there is no bu.er in the cell.

in the current network scheme, we make the following two observations: (1) the ACCT can be greater than the RCCT and (2) the call may be incomplete even if the ACCT is greater than the RCCT.


By limiting the sending rate of each node according to its fair share, we can address the .rst requirement.

this solution would work only if the underlying MAC layer satis.es the second requirement.


In specification, a node deactivates the EIFS time delay whenever any node in system executes a successful transmission.

in our proposed EIFS strategy, a node deactivates the EIFS time delay only when itself has a successful transmission.


In theory, knowing the SINR at the receiver would allow the transmitter to directly set the transmission rate without wasting precious time probing.

the use of the RTS/CTS mechanism to communicate the receiver SINR to the transmitter introduces signi.cant overhead, as we observed in the previous section, which CHARM avoids.


INTRODUCTION Nowadays, the Internet is the main source of malicious code[3], at the same time the number of infected devices is being increased.

some malicious pages are linked together.


In fact Ptolemy and El Greco provide a more sophisticated hierarchical synchronous modeling framework including both dataflow, and finite state machines, where static (or quasi static) scheduling techniques are applied if possible.

for the purpose of this case study, their quasistatic scheduling strategy and synchronous semantics makes the mapping of individual functional blocks onto a distributed heterogeneous architecture like ours problematic.


Because of this approach, non-alignment of slot boundaries actually results inlowerdiscoverylatencyingeneral, sinceeach slot overlaps with two slots of the other node and discovery can happen from either of the two overlaps.

two overlaps are redundant when discovery can beensured withjust oneoverlap.


The setup process consists of the same SYN SYN+ACK ACK handshake as in TCP.

once the connection is established, instead of the sender sending the .rst data segment, the RCP receiver transmits the .rst REQ with the initial sequence number.


On one hand, this characteristics makes MANET easy to deploy.

it makes MANET more susceptible to the attack since the external attacker could join MANET much more easily.


The average desync error decreased exponentially with time, reaching an error of less than 1 ms within 18 rounds (note that the desired slot size is T/n = 100 ms).

the total normalized throughput was high (~ 92%, or 57.8 kbps) and roughly constant throughout the experiment, regardless of the desynchronization error.


From this example we can see that the corresponding feature space has a .nite but high dimensionality.

this space is generally sparsely populated, which allows for e.cient data representation [31].


The General Packet Radio Service (GPRS) or Enhanced Data rates for Global Evolution (EDGE) allow direct download of digital audio data over the Internet to a phone.

these services are not available everywhere, and require an additional data plan.


This shows that the latter require a .ner grain Doppler search as explained in §5.

because QuickSync is opportunistic, it .rst attempts to search at courser grain shifts (the same as the baseline), but falls back to .ner resolutions when it fails to detect a peak that passes the threshold.


Most of the current approaches are considering both o.ine and online centralised computations.

we think that excepted for very speci.c missions, this is not recommended.


We considera lossless channel withno packetdrop caused byunreliable links during node rendezvous and data transmission.

self-interference between downstream and upstream traf.cmay resultin increased backoffs that reduces the actualnetwork throughput andincreasenode idle waitingtime in turn.


During this period, she can perform any operation on the sensor nodes.

we assume that the duration of the network-partition is bounded.


For a secure routing protocol in GVG - RP, the probability of route discovery success Pr[RRE P received by source] must be 1 - E(N), while the probability of route discovery failure Pr[RRE P not received by source] must be E(N).

as we illustrate later, AODV and DSR are not in GVG- RP under severe routing attacks like the rushing attack [11].


The improvement is small for the shuf.e workloads where traf.c is distributed across many links, and we saw similar trends for Staggered Prob (not shown) where traf.c is typically isolated near the network edges.

in the other workloads, the improvement of PlanckTE over Poll-1s ranges from 24.4% (random) to 53% (stride), and the improvement over Poll-0.1s ranges from 11% (random) to 33% (random bijection).


There are path systems that can give a compromise between these extremes.

it turns out that the product of dilation and energy cannot be decreased: Theorem 7.


ICIS 2009, November 24-26, 2009 Seoul, Korea Copyright &#169; 2009 ACM 978-1-60558-710-3/09/11... $10.00" other words, in IntServ or MPLS, a Resource ReSerVation Protocol (RSVP) Path [1] or Label Switching Path (LSP) [3] between each source-destination pair must be established beforehand to guarantee users QoS requirements.

the network scalability is greatly reduced due to the connectionoriented characteristic.


They use a hash of various packet .elds to decide to which .ow a packet belongs to.

perpacket load balancers may choose di.erent paths for packets belonging to the same .ow.


The Vserver approach is used in PlanetLab s current implementation[7,2].

virtual machinesonthisplatform share the same kernel, violating our goal of isolation.


The identity of the sender is also partially protected against the server and onion routers, since they do not know whether it is from the sender or another onion router.

if there are adversaries within the Onion Routing network then there may be a loss for the sender anonymity.


von-Neumann decomposition implies that every C-bounded demand matrix can be scheduled, cell by cell, in C scheduling opportunities (or, equivalently, in IC/Sl time-slots) when permutation Pi dictates the scheduling in opportunity i.

such a scheduling may violate the packet-mode restrictions, since there is no relation between adjacent permutations in the sequence.


On the other hand, in the long range limit, thresholds vary quite slowly.

as discussed in Section 3.2.5, carrier sense efficiency falls off; optimal thresholds are robust but still perform poorly.


In active probing, PASTA is invoked to justify the sending of probe packets (or trains) at Poisson times in a variety of contexts.

due to the diversity of aims and analysis techniques used in active probing, the bene.ts of Poisson based measurement, and the utility and role of PASTA, are unclear.


Global knowledge of other nodes naturally helps achieve a more ef.cient dissemination [12], but perfect global knowledge is impractical to achieve.

strategies that learn as much as possible about other nodes in the system may bene.t in the long run, as we show in Section 5.


On average, 1.5% of these messages have an attachment with 9% of them being malicious.

some of these messages also contain interesting content, as proved by the fact that users read and whitelist an average of 1.5 messages per day.


Theprinciple behind the design of such a system is that in the general case networks are in a stable state, during which time it is suf.cient to have a light-weight monitoring system.

when a problem arises, collection of detailed metrics in the area where the problem is detected can facilitate .ne-tunedproblemdiagnosis.


Several architectures have been proposed to solve the Internet addressing issue as in [17, 26, 20].

in these approaches and even when a public address is available, ine.cient mobility management schemes prevail requiring centralized infrastructure and continuous end-to-end negotiations between the endpoints over a simple core .


The authors used LDSD in the design of a distributed group mobility adaptive clustering algorithm [31].

both DSD and LDSD present the same limitation, which is described in next section.


More than 20% of them have hostnames that include either ggc or google.cache.

these results suggest that Google is reusing infrastructure from the Google Global Cache (GGC), Google s content distribution network built primarily to cache YouTube videos near users.9 It is 6when we submitted the paper in May, only 13% were in the US or Europe.


Like RCP, WebTP is a fully receiver-centric transport protocol where the receiver is responsible for .ow control, congestion control, and reliability, while the sender merely transmits whatever packet the receiver requests.

since WebTP is primarily designed for the wired environment, it does not address the issue of request losses, which RCP handles through the use of the cumulative mode and the cyclic buffer as we discussed in Section 3.3.1.


We note that Rs maintains per-group forwarding state.

as mentioned earlier, we believe this scaling is reasonable here because the number of groups (with active sources) in Rs s domain is likely lower than in core transit domains.


These include, but are not limited to, route lookup [9], encryption [12], and deep packet inspection [25, 11].

a software router is made up of more than just these heavyweight processing and lookup elements.


John Matthews, Craig Russell CSIRO ICT Centre Sydney, Australia john.matthews@csiro.au craig.russell@csiro.au  ing the cost of the infrastructure to transport the growing tra.c volume.

revenues are growing at less than 4% per annum, attributable mainly to .at-rate pricing [3].


The subgroup controllers USCi in our proposed scheme consume slightly higher energy than the subgroup controllers Up of NHS when N = 100 and 1000.

when N> 1000, the subgroup controllers Up of NHS consume slightly higher energy than the subgroup controllers USCi in our proposed scheme due to the larger number of messages to be received when N increases.


For isolated underwater networks, it is necessary to connect them to create large and sophisticated underwater systems.

underwater inter-networking is still an open issue in the literature.


The scheme in [15] is a sender-based approach in which forward nodes can be selected by using complete topology and 2-hop neighbor information.

the topology can be dynamic and the resources are scarce in WSNs.


3.1 D-Grouping based on PINGs Unlike k-means which uses client coordinates (or positions) to partition them, we partition clients using the pairwise round-trip times (RTTs) between them, which can be easily retrieved by PING before the session starts.

just like k-means, given the desired number of groups, D-Grouping aims to put clients with a low pairwise RTT into a same group.


But with several years of deployment experience with the Web, we can now see many problems quite clearly.

we have learned from the slow transition between HTTP/1.0 and HTTP/1.1[20] just how dif.cult it could be to replace HTTP with a new protocol.


Since packets are represented by a hash code, the duplicate detector can report false positives.

it is acceptable to have collisions with low probability since the EtherFuse will send a probe to verify that a forwarding loop exists.


To adjust the cooling in the warehouse, it needs to report the high measurement to the control application.

because it is new in the local network, it does not know where this application can be found.


Consequently, f1 s perceived throughput is higher than that obtained by f2.

when considering AC2, Ni represents the arrival packets at t intervals.


Therefore, the time used to decode one RDS data bit has signi.cant jitters.

one should note that, the mean frequency of the bit-rate clock should be the same with the data rate of RDS broadcast in order to correctly decode the RDS data as long as the RDS decoder is locking to the FM channel.


Digital Signature-based Authentication Framework in Cognitive Radio Networks Sazia Parvin Farookh Khadeer Hussain Omar Khadeer Hussain School of Information SystemsDecision Support and e-ServiceSchool of Information SystemsCurtin Business School Intelligence Lab, Quantum Curtin Business School Curtin UniversityComputation and Intelligent Systems Curtin University saziap@yahoo.com School of Software University of Technology, SydneyO.Hussain@curtin.edu.au Ultimo, NSW, 2007 Farookh.Hussain@uts.edu.au ABSTRACT Due to the rapid growth of wireless applications, Cognitive Radio (CR) has been considered as a technology to solve spectrum source deficiency by improving effective utilization of limited radio spectrum resources for future wireless communications and mobile computing.

the unique characteristics of CRNs make security a greater challenge.


5.2 Correctness of the Building Blocks We motivated by appropriate examples that the described methods for starting face exploration and switching between two adjacent faces are reasonable building blocks in order to provide delivery guarantees.

we still have to prove that this is indeed the general case.


We also wish to point out that the overall system cost increases with increasing L or with decreasing d. This is as expected.

it is noteworthy that the system cost does not increase signi.cantly if the SI Rreqd is incremented.


Voice calls (associated components not shown in the .gure) and data traf.c are tunneled via the eNB-GW to the same set of network components as with the macro cells.

small cells can use LIPA [1] (Local IP Access) as de.ned in the standard to access services and computation local to the subnet in which they are deployed (such as in a home, coffee shop, or enterprise).


Lower frequency signals can penetrate walls and de.ect from obstacles, while higher frequency transmissions must meet strict line-of-sight requirements.

the advantage of using high frequency bands is an abundance of bandwidth.


Hence, they have a much higher probability that the cached data (the data of the TUs) encounter transmission failure.


Predicting the stations which do not receive the fake regions while still being positioned within the AP s transmission range represents a signi.cant problem to the attacker and random probing for such positions decreases its attack rate.

such arti.cial regions, i.e., regions made only from certain stations with high spatial distribution, are never de.ned through monitoring of the wireless neighborhood, thus they are not used by legitimateclients(e.g.


However, this method requires packet rewriting and therefore data-plane modi.cations at all ingress routers.

by exposing IP addresses corresponding to egress routers or egress links, the internal topology is partially exposed to the upstream, so changes in internal topology might lead to tunnel destruction or ineffective packet delivery.


Bandwidth and energy constraints could lead an UWSN s administrator to choose the minimal replication rate (a)to assureinformation survivability while optimizing resources.

weproved that this solution couldjeopardize datum survivability, and provided a fully .edged framework to trade-o.


Further, the key diagnostic features of PPG as well as a reconstructed PPG waveform are available at the physician end, thus enabling the use of various automatic PPG analysis tools as well as visual inspection by the physician.

in order to use this technique for wireless PPG monitoring, the following two key challenges must be overcome: 1.


In fact, the transaction is carried out anonymously with R only learning required attributes of A.

in case of a violation of the terms and conditions of the car rental agency as well as if the user commits illegal actions (e.g., violation of traf.c regulations), the agency wants to ensure accountability of A, e.g., by being able to obtain her name and address information.


Wake-on-WLAN [17], S-WOW [18], and Esense [15] allow ZigBee and WiFi radios to communicate through sensing specially designed codes.

the above solutions su.er from at least one of the following issues.


We show that none of the existing congestion-mitigation approaches proposed for VANET scenarios leverages from the dynamic adaptation of the CCA threshold.

no existing CCA adaptation approach considers VANETs.


On the other hand, the farther the device is from the tower, the lower the pilot power it measures and the lower the usable modulation rate.

the pilot power can sometimes give a conservative estimate of the achievable data rate, since it ignores transmit power control that is typically employed by cell towers while transmitting to individual clients.


They never automatically resume when the call ends (i.e., a manual replay is required).

when an incoming call hangs up before reaching the client, Youtube and PP-Stream might still abort.


It is possible to develop techniques that predict the likely current location using the past few location samples, but we didn t experiment with that idea because the scan and association times are currently a relatively small fraction of the overall idle time.

such an optimization may be even more bene.cial for 802.11a than for 802.11b, because of the larger number of channels in 802.11a.


The metric used by EIGRP requires more computational power, and can be difficult to understand [6J.

the main drawback of all the previous metrics is the limitation to factors that are only intrinsic to links.


As our bounds are not constant in n, they suggest a small increase in the query tra.c when the expanding ring is used.

our approximations involved in computing these bounds are much cruder than the ones used in the previous section for the random walk.


2.1 Cluster-Aware Communication Giventhisclusteringandthediversity ofapplicationsinVANETs, many different kinds of applications may coexist, each characterized by different requirements and goals.

these applications can be divided into two c ategories: node-centric and contentcentric.


INTRODUCTION The rapid progress of microelectronics technologies has brought about the downsizing of computer systems.

the means of communication has changed from the wired to the wireless media as we can see the in popularization of the portable telephone today.


AODV protocol has the advantage of e.ciently using the bandwidth by minimizing the network load for control and data traf.c and ensure a loop free routing.

this protocol presents the drawback of using routing caches to reply to route queries, which results in an uncontrolled replies and repetitive updates that are .ooded all over the network.


These results demonstrate that there are many dynamic scenarios when TCP receives more bandwidth than competing TFRC .ows.

despite much trying, we could not .nd any scenarios with varying bandwidths in which TFRC re ceives more bandwidth than TCP in the long-term.


But due to the limitations of the simulator, connection 2 achieved slightly lower throughput, which explains thelargerdi.erenceinFig 1(d).

the overall(andthe average) throughputis approximated very wellbythe model(Fig.


( dnm > d nm+c ) for h = c = 0. jnm-1 jnm+c+1 by assumption, every hop ni .


In our futurework, we plan toextend theTrajectory Approach [12] to consider TT messages, with the aim to reduce the pessimism of the analysis from [35].

note that the analysis used forRC frames is orthogonal to our optimization problem.


Hence we cannot say exactly if the cause is one or the other or even a link leaving one of them, narrowing down the set of candidates to AS15412, AS18101 and AS10029 (and links).

in other days of the event the same structure of the .gures was observed, but there were paths passing through AS15412 and AS18101.


the SMA) even when the MN moves between domains.

if the node looses network connectivity on any layer below IP there is not much any approach based on IP can do.


We observe that, for CCBF and CBF, the average advance per hop increases as the the node density increases.

for CRL, the change of node density does not a.ect the average advance per hop.


We observe that the user level performance of these rate-dependent al- gorithms and their rate-independent variants is comparable, but network performance is superior with the rate-dependent algorithms.

based on the broadly ap- plicable performance measures we study, we are unable to make a clear distinction between RMAX and SRPT.


Bubble Rap [10] explicitly discovers structural features by processing historical contacts and computing node communities and hierarchies a priory.

bubble Rap requires a setup period and does not adapt to dynamics in the network very well.


Uniform-3VC achieves loweraverage packet latency than uniform-2VC and so more VCs need tobe allocated even using our algorithms to achieve the same targetlatency.

we see high reductions of up to 51% for greedydeletion and 48% for greedy addition, compared to the 192 VCsrequired by the uniform con.guration.


Highest throughput is just 1.1 times larger than lowest throughput.

if the buffer capacity is 500KB, same as other FIFO cases, DRR shows the worst fairness because buffer capacity of each queue becomes too small.


At the very least, the VNP has to be aware of some basic characteristics of the infrastructure: for example, the geographic reach of the infrastructure must be made public which means that the edge nodes of the InP network (or PoPs) must be externally known.

the knowledge of the infrastructure internals by VNP is a much more contentious issue.


Thus, these devices seem to be an ideal basis for the map based tracking part of our command and control system.

just visualizing raw GPS positions of all lightweight nodes is not suf.cient for disaster areas.


=280 5.2 Compromising A Partial Set of Pairwise Keys We have shown that, if the system parameters are chosen appropriately, an adversary has prohibitively high complexity to break fi(x,y)(i=0,··· ,m-1) to compromise all the pairwise keys.

the adversary may attempt to compromise part of the pairwise keys.


Clearly, di.erent mobility models lead to di.erent times needed for 75% infection coverage, suggesting that the impact of device mobility patterns on the propagation of the Bluetooth worm does not disappear even when the worm varies its parameters.

no matter which mobility model is considered, the worm propagation speed is also a.ected by how the worm sets its parameters.


[13]), potential bottlenecks, and higher operational costs to maintain the centralized components.

the architecture allows implementation, at the site level, of new functionalities to boost user cooperation.


Pr2-P2PSIP: Privacy Preserving P2P Signaling for VoIP and IM Ali Fessi, Nathan Evans, Heiko Niedermayer, Ralph Holz Technische Universität München Boltzmannstrasse 3 Munich, Germany {fessi|evans|niedermayer|holz}@net.in.tum.de ABSTRACT In the last few years, there has been a good deal of effortput into the research and standardization of P2P-based VoIP signaling, commonly called P2PSIP.

there has been one important issue which has not been dealt with adequately, privacy.


For about 66% of the MAPs in the network the maximum coding gain achievable was only 2 i.e., even though the number of neighboring MAPs for each of these MAPs were more than 1, the structure of the network did not permit coding more than 2 packets.

there are around 24% of the MAPs where coding gains of more than 2 were possible with the maximum coding gain reaching 6 for some of the MAPs.


In a centralized heterogenous multiuser network, the multiuser diversity will cause the serious fairness problem the users with good channels may occupy most of the resources, while the users with poor channels may hardly have opportunity for information transmission, which will result in large queueing delay and thus the user s delay-bound QoS cannot be guaranteed.

the advantages of multiuser diversity only contribute to a small portion of mobile users whose channel quality is good, which may not lead to a signi.cant QoS performance improvement from the entire network perspectives.


Obviously, if it is too short, the MS will switch between awake mode and sleep mode too frequently.

if it is too long, power energy will be wasted due to the creation of excessive lengths of time where no data frames are transmitted.


The presence of highly connected central nodes in a network having a power law degree distribution is the essence of the so-called scale-free network models, which have been a popular theme in the study of complex networks, particularly among researchers inspired by statistical physics [34].

this emphasis on power laws and the resulting efforts to generate and explain them with the help of these degree-based methods have not gone without criticism.


The server can arbitrarily send Data packets to the client.

this unidirectional channel is not enough since the client also needs to send messages such as mouse clicksandkeystrokestothe server.


In particular, Greedy Perimeter Stateless Routing (GPSR) is purely distributed, has low overhead, and is scalable and loop-free.

precise geographic information is required and geographic proximity does not imply best linkquality.


In the case of ARIO, even though the delay is steady, it is still not under the target value.

irrespective of the tra.c load, PAQMAN-DS tightly regulates the delay under the target mark.


We do not have detailed numerical analyses about the location precision of points outside of a protected area.

location precision can be notably reduced if the number of APs that the user communicates is reduced from three or more to two or less [3].


After receiving the CTS, the clients will contend for the channel access, following the same speci.cation as in legacy ZigBee.

if a client fails to acquire the channel, it needs to wait for the next - CTS.


They are considered one of the most valuable data sources for monitoring network health and for troubleshooting network faults and performance anomalies.

router syslog messages are essentially free-form text with only a minimal structure, and their formats vary among different vendors and router OSes.


Second, comparing synchronous games, one with resource-pricing and the other with threshold-pricing with sample frequency 10 Kbps, the two achieve approximately same sum of rates for f = 0.2.

like in Figure 2 the time share allocation (not depicted) with resourcepricing is unfair (lowest time share less than 1 % of user 1 with weakest channel, highest time share more than 60 % of user 10 with strongest channel) whereas threshold-based scheduling implies a relatively fair time allocation (lowest time share 35 % and highest 46 %).


Ternary Content Addressable Memories 10 100 1000 10000 10 100 1000 10000 Block size Block size (TCAMs) has become the de facto industrial standard for packet classi.cation in high performance routers.

tCAMs suf (a) R1 (b) R9fer from several primary de.ciencies: high power consumption, high cost per bit relative to other memory technologies, and stor 10000 1 1 1 age inef.ciency.


The distribution of the outbound volume becomes wider, suggesting increased diversity and larger in.uence by the tail.

the distributions of the peer-type group did not grow much.


Revisiting Caching in Content Delivery Networks M. Zubair Sha.q , Alex X. Liu , Amir R. Khakpour Department of Computer Science and Engineering, Michigan State University, East Lansing, MI, USA Verizon/EdgeCast, Santa Monica, CA, USA {sha.qmu,alexliu}@cse.msu.edu, amir@edgecast.com ABSTRACT Content Delivery Networks (CDNs) di.er from other caching systems in terms of both workload characteristics and performance metrics.

there has been little prior work on large-scale measurement and characterization of content requests and caching performance in CDNs.


Per-safelink sampling addresses the worst risks of per-link, and over low detection budgets is the best strategy, with up to 28% fewer misses than per-probe.

at high sampling rates a milder form of the issue affecting per-link still arises, and again the error saturates rather than tending to zero.


In this example B is a customer of A in region X and B is a peer of A in region Y.

our algorithm infers a single relationship between B and A: c2p.


Thus, in general, the Discretization algorithm yields a worst case approximation ratio of 2 ln |Mcover |.

in some cases the NWST problem can be solved optimally by discrete methods such as integer programming [21].


Similar to our work, these proposals blur the traditional distinction between naming and addressing, and also consider innovative packet forwarding mechanisms.

to our knowledge, these past proposals are essentially ad hoc, without a consistent set of underlying formal principles.


The ELF .le is used for linking and loading in traditional Unix-like systems.

the standard ELF loader is usually missing for current sensor nodes.


Receiving a message is also dealt with in the same way in both roles.

most variants of signed Di.e-Hellman are not role-symmetric.


Of course, these results were obtained with computer-controlled characters and may not be indicative of real players.

we are planning to test this particulat msec with variable local lag.


Applications tags the tra.c .ows with di.erent priorities.

if all the tra.c .ows come with the same level tra.c class, WMM extension cannot control or prioritize the tra.c .ows.


Routing protocols usually consider this aspect in establishing paths with high battery capacities.

in order to give higher option to such protocols and unconceal nodes with high energies, we de.ne the metric .j = eE j .


In the space of beamforming, [4, 5] propose to increase the capacity of WLANs through spatial reuse by considering directional antennas only at the APs or at both APs and clients.

client association is assumed and con.icts and reuse schedule are computed w.r.t a single client at each AP.


Many methods are proposed to maintain synchronization, for example using frequent resynchronization by transmitting more packets [10], using guard times [21], and using packets arrival time for reference broadcast synchronization [9].

these approaches consume a signi.cant amount of energy.


It does not guarantee that we will .nd the optimal parameter combination that minimizes the estimated total energy for forecast errors.

we only need to have good enough parameters such that the resulting model captures the overall time series behavior.


Technically, all those systems can be used as a basis for the mechanisms proposed in this paper.

we have focused on SLP because of its sophisticated discovery system (cf.


All rate adaptation mechanisms increase rate as the receiver approaches the sender and decrease after passing the sender.

the SNR-triggered protocols have much longer periods (4 seconds) of normalized throughput close to 1 as compared to the short-duration spikes of lower peak value for the losstriggered protocols.


Robust Topology Control for Indoor Wireless Sensor Networks Gregory Hackmann, Octav Chipara, Chenyang Lu Department of Computer Science and Engineering Washington University in St. Louis, USA {gwh2, ochipara, lu}@cse.wustl.edu ABSTRACT Topology control can reduce power consumption and channel contention in wireless sensor networks by adjusting the transmission power.

topology control for wireless sensor networks faces signi.cant challenges, especially in indoor environments where wireless characteristics are extremely complex and dynamic.


maximum utilization increases to almost 70% with .ve clients in the network.

when the number of clients exceeds .ve, the utilization decreses signi.cantly.


However, total memory utilization and latency are 8.3% and 23.3% worse than [1].

our GSS flow controller improves on average 23.7% latency of priority packets compared to [1].


Since each packet consumes the same amount of energy, average power increases proportionally.

our L-CSMA/CA algorithm yields a convex function related to the convexity of the power function.


Figure 5 shows that as the propagation delay increases, TCP s utilization degrades considerably regardless of the queuing scheme.

xCP maintains high utilization independently of delay.


Equivalently, in the probing scenarios we require that the n device addresses are uniformly picked from the address space of 2L integers 0, 1, 2,... (2L - 1).

it may happen that the responders are highly correlated over some part of the device address.


utilize a local virtual sink but these nodes may not necessary bene.t from using the virtual sink because of possible longer paths that redirects tra.c through other nodes to the virtual sink.

with a smaller value of l, shorter redirecting paths can improve the delivery latency andenergy consumption although fewer nodes would be able to utilize them.


HandshakefailuresduringTLS/SSLsetupcan also resultinfailure of the association setup.

the overall number ofhandshakefailures andthe number of other(i.e., notgrouped otherwise) failuresis ratherlow.


HTTP/1.1 includes a mechanism (the Vary header) which allows a server to tell a cache the selecting headers that the result of a request depends on, in addition to the Request-URI.

the Vary mechanism cannot deal with even fairly simple generalizations, often requiring a fallback to non-caching operation.


Given our positive experience we plan to o.er the course on a regular basis roughly every two years.

as the number of expected students for the next issue is higher (20 30 students), we will switch to a non-shared project based approach.


to strongly depend on the specific application.

we per proportional to the distance of the considered index from its formed other experiments with different thresholds and the ob tained results are in line with those presented below.


MATCHING 4.1 Cell Model The pattern of traffic units in a cell could be represented by the position of each unit, i.e., the coordinates.

the process of calculating or matching traffic patterns by every point will be very complex.


The switching protocol may be integrated with the MAC layer or may run as a higher layer independent protocol.

in either case, it requires precise synchronization between the nodes negotiating an interface or channel switch.


Intuitively, stub networks are the edge of the Internet; they are customers of some ISPs andthey do not provide Internet access service for any other ASes.

transit networks provide access service to others.


The third bar in Figure 10 shows the case where we keep the video bit rate as low as possible instead of adapting bit rate; this options can also prevent frame loss.

lower video bit rate means lower quality video and lower PSNR; and even though there is available network capacity, it is left unused.


These encompass many of the features that have drawn research interest in the past, but we make no assertion that it is a complete set, and we have examined other features: for instance assortivity, average shortest-path lengths, and average node and link betweenness.

the results are all of a similar nature, and the additional graphs add little additional insight.


Lately, there has been a proliferation of di.erent rendezvous protocols.

mostly the proposed protocols have had a narrow focus, which is usually a RDV guarantee in a single cycle.


The handover evaluation time was 3 s. We can see that the throughput is high for the .rst 10 s with only one active .ow.

as the second .ow is started, the individual as well as the overall throughput drops as collisions start to occur.


Potential Solutions Content editors The threa.t of obsolete information overtaking the inttanet could be overcome by employing ='content editors" or "inumnet police(we)men", who are tasked to monitor the validity of information across the intranet They can indeed look after the consistency and quality of the inttanet very much in the same way as content editors successfully do for cozporare web- 131 sites.

i befieve a skilled content editox will not be paxtioalarly motivated to clean up other peo- ple's mess and often would not be any better in identi- fying obsolete information than the creator him/hers elf.


One solution to this problem is to use an RTS/CTS (request to send / clear to send) protocol, where before a packet is transmitted the transmitter sends and RTS packet and waits for a CTS reply, at which time the receiver knows to hold all of its own transmissions until the packet arrives.

this solution is not feasible for broadcast tra.c, nor in networks with large propagation delays.


RELATED WORK Cellular networks have been an active research area in recent years.

the interplay of voice calls and data services in 4G LTE networks has remained largely unaddressed in the research community.


So if the rebroadcast probability p is set to a far smaller value, reachability will be poor.

if p is set to a far larger value, many redundant rebroadcasts will be generated.


if the receiver does not discover the RNDZ START message (i.e.


We .nd evidence of a weak tradeoff between operating range and performance optimizing for a smaller range did help modestly over that range.

the improvements in objective from narrowing down the operating range were modest, and each Tao Figure 2: Evidence of a weak tradeoff between operating range in link speed of a congestion-control protocol and performance.


Multiple replies from destination allow exploration of multiple reverse paths concurrently thus speeding up the search for a bidirectional path.

allowing multiple destination replies in basic AODV has little bene.t unless those replies take non-overlapping paths to the source.


Individual radios are allowed to have their own rate control algorithm.

since the default 802.11 ACK is turned OFF, the driver, which performs the rate control, does not have access to the successful packet delivery information.


The conventional approach taken by the network stack and web server application has been tuned to perform well when delivering large content by utilizing OS primitives and NIC hardware features.

multiple simultaneous short-lived HTTP connections are considered a heavy workload that stresses the kernel-userspace interface and reveals performance bottlenecks: the size of the transmitted data is not enough to compensate for the system cost.


One mechanism the WiRover system uses to mitigate link failures is to migrate network .ows from the failed network to an active network.

it is important to understand the e.ect link migrations have on network traf.c.


accounted for through a link or virtual link congestion indicator (i.e, cg ) only.

one might note that the above i, j formulation requires that each edge node keep track of and run a separate ODCL for each and every flow xi that traverses the node.


The only di.erence is that since .2 is less than 2 Mbps the corresponding RTTs are similar to those resulted from .0 and .1.  resulted from .2 to .4 are still larger than that of .0 and .1 because .2 to .4 are larger than the available bandwidth.

compared to Figure 5(a), the average RTT and the std for .2 to .4 decrease.


the aggregate arrival rate to an input or output port is less than 1.

their performance typically degrades when tra.c is non-uniform [19].


Other TCAM- and trie-based schemes in [2,12] utilize an IP cache scheme to boost up lookup throughput by multi-fold.

they simply use a modular indexing scheme and LRU, and provide neither an efficient indexing method for a small collision rate, nor Internettraffic-aware cache replacement.


In [16], threshold selection by noise power estimation was considered.

the availability of signal-free samples was assumed.


In its simplest form, each term s context contains those terms labeling all the nodes in the tree which are reachable from the one considered.

depending on the schema characteristics, it is possible to limit the context by excluding distant and, therefore, unrelated and potentially misleading terms.


In terms of load balancing, most of the existing QoS related load balancing algorithms focus on Routing Mechanism and Traf.c Engineering.

research on QoS-aware task scheduling and service migration is very limited.


The lower bound on T follows immediately from the fact that bv can increase by at most one each time step and the distance between a block and a vertex can decrease by at most one each time step.

we know from Lemma 3.1 that bv,x(b-k+d-1) = l J x(b-k+d-1) + k +1 - d = b.


Hence, it is possible to estimate the level of security they provide with a fair amount of con.dence.

x.509 infrastructures depend not only on cryptography, but also on various organizations and entities that are required to conduct their work in conformance with abstract processdescriptions.


Both report the ratio of delayed frames.

only the NS-2 based simulator produces accurate frame delays and data loss.


For example, data con.dentiality can be provided by using an iterated cryptosystem such as 3-DES or AES.

iterated cryptosystems are hugely complex and computationally intensive so the chances of being exposed increases signi.cantly.


The computation of A, for our simulated networks could take up to an hour on the same computer.

as explained earlier, we need to calculate A only once.


These opportunities include connecting GSM and UMTS base stations over Gigabit Ethernets.

to make this happen, it has to be carefully investigated whether these emerging metropolitan networks can meet the necessary QoS requirements at the presence of bursty data traf.c.


In a paid-access business model, the service provider may have an incentive to set up an AS.

for most small businesses, free access is an advertisement method to attract more customers.


As a result, an unavoidable task brought by supporting mobility in the global Internet is the introduction of an identifier1 namespace.

identifiers not only benefit mobility, but also facilitate other features such as host/site multi-homing, traversal of middle-boxes, security, content retrieval and so on.


SHARP relies on a novel proactive routing algorithm that is both e.cient and analytically tractable.

sHARP can use any reactive routing algorithm whose costs can be characterized analytically; our current implementation uses o.-the-shelf AODV.


Those users that scroll or click through an app to visit that offscreen content will experience a more responsive app.

for those users that do not visit that off-screen content, the penalty is wasted network consumption.


Given an MPI-based HPC application wherein individual processes of the application may be imagined to be vertices in a graph, and the communication among the processes may be imagined to be edges between these vertices, its corresponding application graph (using the vertices and edges described above) de.nes the structure of the application.

to understand communication performance, the application s communication graph alone is inadequate.


Furthermore, if the encoded bitrate is less than capacity, WSMstill responds to high loss rates (5%) as long as the loss is present at the start of streaming.

encoding rates between 1/2 capacity and capacity will result in WSMtaking more than a fair share of the available capacity if competing with TCP .ows.


Impinj [4]) uses a mono-static antenna for sending and receiving data, which has a sensitivity of -80 dBm.


Indeed, sector antennas have eliminated the hidden terminal prob- Goodput [kb/sec] 800 400 lem and asymmetry problem discussed above.

the system still deviates signi.cantly from the reference model for the following reasons.


The most straightforward way is that each line-card maintains its own PIT creates a corresponding PIT entry for every incoming Interest packet and removes the associative PIT entries for received Data packets, as shown by line-card .. in Figure 10.

this means will encounter serious problems.


If the communication overhead has to be minimized, then TC=0 might be the best option.

tC=4 offers a fair trade-off between topology knowledge and communication overhead.


[3, 4] present a secure routing protocol by combining techniques such as source routing, hop-by-hop authentication and ack-based probing.

for a forwarding path of length d, their scheme induces a key storage overhead of O(d2) and a high communication overhead equivalent to that of the strawman approach described later (§4,§7,§8).


3.3 Probability that FA joins in the multicast group For a given multicast group, an FA certainly knows whether it has joined in the multicast group.

the FA does not know which multicast group that an MN arriving at the next time interval belongs to and hence does not know whether it has joined in this multicast group.


Flat addressing simpli.es the handling of topology dynamics and host mobility with no human input to reassign addresses.


Deployments operating over the public Internet have to rely on end-users, and a popular strategy is to use P2P approaches where users collaboratively download from each other to decrease server load.

supporting the delivery constraints of streaming in P2P architectures typically introduces complexity such as elaborate mesh/tree topology construction [16, 7], or careful chunk-scheduling strategies [3, 22, 10, 15].


Since the Gnutella network is a representative unstructured network that follows an approximate power law with respect to the distribution of the degree of peers [18], it is valid to use network topology following a power law for the investigation of unstructured P2P networks.

the present paper does not consider dynamic changes in network topology.


The more general problem of inferring the original .ow size distribution from sampled data has been extensively studied in the literature [14, 19, 21, 28, 33].

and despite its relatively simple formulation, no conclusive estimation procedure or closed form estimate expression has been derived so far.


The drawback to this approach compared to GARNET s is that the user can only visualize the reachability of one set of sources (a host, host group, or subnet).

we could not develop any use cases that required the user to simultaneously look at the reachability from multiple sets of sources.


Some multi rate MAC layer protocols already exist in WLAN such as 802.11b/a/g [6] [7] [8] [9], and the data rate is dynamically changed according to the SNR at the receiver end.

for most of them the primary goal is to increase the throughput, not energy efficiency.


In fact, if a content is very popular, it is likely to be cached at intermediate CCN routers, so that asmall RT T (c)is be obtained.

contents with a very low popularity are mostly retrieved from the original server so achieving a large RT T (c).


A node that has not received the broadcast message at a particular time is referred to as an uncovered node at that time.

2 the results in this paper apply to 1D and to 3D networks, as well.


In settings where contention, external interference and time-varying conditions are common, Flashback can transmit at a .ash rate of 100, 000.

if the environment is calmer (e.g., a home with several Wi-Fi clients), then Flashback supports a lower .ash rate of 50, 000.


Usually it is positive due to the MAC (Message Authentication Code) or paddings (for blocked ciphers) introduced in the encryption process.

sSL supports stream-level compression that compresses the entire SSL stream before encrypting it.


To meet the communication needs, one can either reduce transmission power to increase throughput or increase transmission interval to decrease the required information distribution in a high traffic density situation.

increasing transmission interval and decreasing transmission range will increase the delay and the risk of missing communication opportunities when a vehicle passing by at a high relative velocity.


3.2 Timeout Estimation From the point of view of (7), an underestimate that is marginally smaller than the actual value is as good as an overestimate that is marginally larger than the actual value.

in the context of RTO estimation, underestimations trigger pre-mature timeouts whereas overestimations eliminate them.


To ensure quality of network connectivity, APs are usually deployed such that they cover partially overlapped areas.

due to limited number of orthogonal channels in the ISM frequency band, inter-AP interference is inevitable and hidden terminal problem arises [16] between APs.


The most important characteristic of this sensor-actor coordination is to provide low response delays so that the actor can complete the assigned task within speci.ed quality of service criteria.

in networks with multiple actors and di.erent tasks, the performance of the sensors in terms of responding within the speci.ed time bounds will degrade.


The BS subframe is divided into an MS-BS region and an RS-BS region to allocate bursts for MSs and RSs, respectively.

the RS subframe contains an MS-RS region to allocate bursts for MSs.


INTRODUCTION In a software-de.ned network (SDN), a logically-centralized controller responds to changes in network conditions by updating the packet-processing rules installed on switches.

any software system requires upgrades to .x bugs, add features, and improve performance.


Recently, researchers have proposed a few such hybrid routing protocols [5, 6].


This demonstrates the power and generality of the model in capturing the dynamics of the system and its adaptability to current system conditions.

there are a few outlier predictions with large errors.


System Link uses standard UDP/IP/Ethernet packets to transmit data.

the IP address and UDP port of every packet is fixed to 0.0.0.1 and 3074 respectively only the MAC address of every Ethernet frame is used to differentiate between clients and server.


If a .ow is transmitting too fast, then it can be slowed down.

if a .ow has a big lag or a high weight, then the .ow is allowed to transmit using a wider range of data rates, thus allowing it to catch up and avoid delaying other .ows.


(If any point on the perimeter of a sensor s sensing disk is covered by less than k sensors, then this sensor can locally conclude that the region is not fully k-covered.)

in the case of k-barrier coverage, individual nodes can neither locally say yes nor no to the question of whether a given region is k-barrier covered.


We o.set this weakness by invoking PROOFS only for the .ash duration.

it is not limited in PROOFS system, other simple, robust P2P system can be a choice.


Thus, the fully distributed algorithm has a more elegant convergence property than the partially distributed algorithm.

the fully distributed algorithm may not achieve the optimal tradeo.


Multipath propagation severely affects ToA-based and DoA-based localization systems, since in both cases multipath components may be mistakenly interpreted as direct path signals.

lOS existence will generally improve the performance of such systems since the LOS component arrives earlier (for ToA systems) and is of greater power (for DoA systems) with respect to multipath components; thus the probability of false ToA or DoA calculation is lower [1].


In general, the associated Di should be chosen so as to minimize collisions, for example, using a collision-resistant code.

due to the size of the problem, RPM employs random codes as it is more practical.


Straightforward approach will be the implementation of XML interface.

we can follow a software defined network (SDN) approach, to enable further extensibility.


ThefrstalarmisaDestRepatdestination5,whichmeans thattheimplementationisnotsettingtheinitialhop-count T¢ Table6:TypicalMeta-trace Time:0.003449342s,AlarmDestRepraisedat5fordest5 bestrouteat5for5: observedrouteat5for5: Time:0.004823314s,AlarmDestRepraisedat5fordest5 bestrouteat5for5: observedrouteat5for5: Time:2.567054284s,AlarmDetectRErrraisedat4fordest5 bestrouteat4for5: observedrouteat4for5: Time:2.567054284s,AlarmDetectRErrraisedat4fordest5 bestrouteat4for5: observedrouteat4for5: valueinanRREPcorrectly.Allfourinstancesofthealarm inindicatethattheinitialvaluehasbeensetto1.So T¢ wegointothecodeandcorrectthissimpleof-by-oneerror, changingtheinitialhop-countfrom1to0.Thisproduces anewimplementationP1,whichweusetoproduceanew traceT1,byrunningthesimulationagain.


From the .gure, one can observe that increase in the size of SC-DAS obtained by each algorithm gets slow down as the value of k increases.

it is also prominently noticeable that the G-CMA algorithm performs the best when k =1.as k increases, the performance of the G-CMA becomes the worst.


One solution is to introduce additional mechanisms that verify the correctness of the selected routes.

it may be dif.cult to deploy such modi.cations within existing protocols.


(1) knows that v has been already colored.

since the distance between u and v is less than d, in all black messages initiated from v and reached u, there must be one traveling less than d hops.


* Intra-session Fairness or TCP Fairness: As shown in section 4.3, Ra~inbow shows TCP friendly but not intra, session fair behavior.

rLC shows intr~-session fairness but is not TCP friendly.


This is a natural assumption for omnidirectional transmitters.

if both SUs are directional with equal range, the beam of the SUSS lies entirely within the union of all beams of the SUBS.


Of course tribute should be given to scholars who have attempted to unravel the complex dynamics within e-government.

settling in the existing argument levels poses serious reservations on the real potential of e-government to deliver development in underdeveloped countries.


Also, RDMA needs some handles (remotememory keys) be cached at remote peers, which makes the problem even more dif.cult.

applications for traditional networks generally use the sockets interface, where all complexitiesare hidden inside the kernel and can be changed transparently aftermigration.


Some aspects like channel assignment are already realized in a distributed way.

estimating the interference graph as well as the distributed antennas in a distributed way is a challenging task.


The packet forwarding portion of the algorithm, Lines 25 40, is based on the following observation: we prefer to route from a node down one or more subtrees if their summaries are positive, because this allows for directed .ooding.

there is no guarantee that every node is reachable in this fashion.


SUMO implements lateral movement only in discrete steps and we found that it is difficult to improve this feature in SUMO.

we found that while reading mobility traces from SUMO, the NS-2 implementation ensures that lane changes do not happen abruptly.


A suitable heuristic to remove these con.icting pairs is to move them around until they hit the boundary of the system, where they are more likely to disappear alltogether due to the smaller number of nodes that the boundary nodes have.

if these con.ict-moving changes are done at random, the resulting motion of the defects resembles random walk, and while in a .nite system such walks eventually reach the boundary [12] it does not happen fast.


Tree Bitmap may be additionally extended to support variable strides.

for a worstcase pre.x distribution, variable striding and compression-based schemes do not bene.t the total memory size much, as we discuss in Section 6.


Representation : In Section 3, we de.ned CPTL s representation of network architecture as a graph that captures pairwise relations among network resources.

not all relations between assets may be pairwise.


In contrast, one of the contributions of our work is to offer a .exible platform to facilitate autonomic management as demonstrated by our case studies in §5.

autonomic management by itself (e.g., alarm correlation, fault diagnosis, intrusion detection) is not the focus of our work.


The client will most likely run on a PC or workstation that intermittently communicates with the mobile device.

there is no reason why the client could not run on the mobile device itself to improve resolution latency and provide continuous communication with the broker.


There is an existent increasing interest in network emulation for service evaluation.

nobody has thoroughly studied ns-3 limitations on emulation.


Our scheme eliminates many of the errors that time synchronization schemes have to contend with since we compute residence times close to the device [3, 4].

perhaps to a greater extent than those schemes, our scheme is impacted by clock drift.


We begin by sending a DNS request for a hostname within our domain to the FDNS under study and then immediately issue a DNS response for the same hostname to the FDNS that binds the requested name to IP address X.

when the request arrives to our ADNS in a normal way, the latter answers with a response containing IP address Y .


Processing packets arriving from the transport layer  4.2.3 Processing transport layer packets In our framework the processing scheme of packets arriving from the network does not bring considerable changes to the existing HIP RFCs: signaling messages are processed in the normal way with the extensions introduced above, while incoming data packets are treated completely according to the standards (SPI values are used to identify the appropriate SA).

in case of packets arriving from the transport layer (originated by the applications) the standard way of operation changes because the fitting SA has to be selected for the outbound communication (Figure 8).


Once the space for sampling can accommodate all the large .ows, i.e., m = h, the variance falls of as am-h for small a.

if there is not room to sample all the large .ows, i.e., m<h, the estimation error persists even for small a.


5.2 Installation 5.2.1 J-Sim Once J-Sim is downloaded, it can be easily imported into EclipseusingEclipse s JavaProjectfromExistingAntBuild.le .

some additionaljava archivesforXMLhandling (jaxp, xalan and crimson) must be installed before J-Sim can be executed.


It is straightforward to design an engine that can search over a library of human-designed protocol families: For example, a protocol family with sleep cycles, and another family without sleep cycles.

such a solution is unsatisfactory, as it still employs humans to generate those protocol families in the .rst place; hence, this does not constitute true protocol generation.


2.1.2, only a di.erence of 1MHz is enough for two channels to deliver a reasonable throughput.

the work in [29] did not discover the advantage of continuous frequency allocation; it focuses only on adjusting CSMA.


Recall that the MD-FEC coding can ensure a minimum video quality if at least 3m1M N error-free packets Qkg1  are received for a frame.

if most of the packets are transmitted within a bad period, it is possible that less 3m1M N than Qkg1 packets can be received and the video frame cannot be decoded.


This is likely due to the heavy path loss which 2.4 GHz transmissions su.er in this environment.

we feel that a range of 60-90m using the high gain antennae is still quite useful for many applications.


First, even though a PI controller can guarantee robustness to some extent [6], once the uncertainty to be tolerated for stability is relatively large, the response becomes sluggish [10].

the regulation on control parameters is still an intractable problem.


In its current implementation, the CAVE serves, except for the transmission of the CAVE user position, as an observation device for scenarios constructed on the table top s surface.

the CDPP is open for mutual interaction.


tl inter-AS intra-AS 0.04 53.6% 46.4% 0.02 56.9% 43.1% 0.01 57.8% 42.2% more than 95% of the paths in the validation set are consistent withtheinferredloss rates.

predictably,theaccuracyof the LIA algorithm increases as we increase m. the accuracy.attens out when m is signi.cantlylarge(m> 80).


This work may 1 K+1 if .i =1 be the most related work in the literature to our work.

our work in different form this work mainly in that the work of [8] where .i = .µ ri ri is the traf.c intensity of Qr in node i.


RFC3517 also banks missed sending opportunities through the di.erence ssthresh - pipe.

these banked opportunities are subject to the inaccuracies of the pipe variable.


If it is faster to forward packets via the contact server over the server network than to send packets to a remote server directly, allocating servers near the edge of the server network (and close to the clients) reduces the overall synchronization delay.

this comes  at the expense of increasing the number of servers in the session.


This scheme is often combined with the end-to-end intrusion detection scheme.

we abandon this scheme due to several reasons.


Copying multi-.ow state for the second client s .ows avoids the crash, but skipping the other multi-.ow state results in a 28% lower cache hit ratio at S quid2 compared to copying all multi-.ow state (i.e, the entire cache).

the latter requires a 14.2x larger state transfer.


The f attack is included to account for attributes whose truth values do not have any direct relationship.

an indirect relationship can be established collectively.


In [4], a cooperative in-network caching scheme is proposed, which could achieve collaboration of a cluster of caches with hash-based partitioning of content space.

as the cluster grows, the overhead of inter-communication of caches could increase significantly.


and limited in functionality (cannot run the entire control process protected) [20].

despite the limitations, given the nature of routing, we can take advantage of the separation between the control plane and the data plane in routers.


The systems proposed in [13, 4] show how to securely built an incentive system on top of a DTN.

in both systems the incentive itself is not clearly de.ned, but rather an abstract token.


In systems such as 802.11 WLAN, we can estimate the CFO using preambles, and then compensate for the CFO for the whole packet.

estimation error may leave behind an uncompensated residual CFO.


If all o.ered choices in a negotiation were secure, an adversary who successfully launched a downgrading attack would still not succeed in breaking the system.

the prohibition of all weak EAP methods, protocol versions, and ciphersuites is not practical, because the negotiations serve to accommodate .exibility for vendor implementations, backward compatibility with older protocol versions or algorithms, export restrictions, e.g.


For example, virtualizing and customizing the radio access network might be technically feasible and would enable new functionality and services (protection against subtle radio access or control plane attacks, or radio access protocols specialized for speci.c services).

realizing such functionality at scale might not be economically feasible.


This is because a selection of these is likely to be observed but not compromised.

random selection bene.ts roughly linearly in the number of routers shifted from medium to high trust.


INTRODUCTION  Recently, P2P technology has become so popular that a large number of .les are being exchanged by millions of users concurrently.

due to the signi.cant growth of P2P .le sharing, even copyrighted .les are also actively exchanged so copyright infringement has become a serious issue.


For example, if A s intended receiver can capture B s transmissions, carrier sense should be used to defer B s transmission to prevent it from interfering with A s transmission.

if A s intended receiver can tolerate a parallel transmission from B without signi.cantly a.ecting A s delivery rate, carrier sense (right ), senders record .and s, but do not wait for .to fall below sbefore transmitting.


This approach is only e.ective when a single connection cannot fully utilize the link capacity of the client, that is, when the connection bottleneck is in the core network or at the CDN servers.

in a CDN serving mostly residential clients that we target, the bottleneck is typically at the last mile to the client.


The overall power consumption with clusters increases due to the increased achievable throughput, which is fully utilized under the fully backlogged assumption we use.

as we will show in Sections 6 and 7, clustering causes little increase in power consumption while enabling a much more e.cient energy utilization.


This process requires simultaneous usage of multiple processing units.

the overall provisioning cost for the infrastructure provider is vastly reduced due to economies of scale [27], and the service being subscribed by a large number of automobile users.


He may not know the number or kind of the tables it has, so normally he will synchronize the entire database.

using a well defined policy, the user does not require knowing anything about the database; he manipulates the clients and orders in the way the developer has designed and forgets about when or what to synchronize.


This is reasonable if ad hoc nodes could have permanent addresses.

addressing in ad hoc networks is likely to follow recent trends towards dynamic address allocation and autocon.guration [29, 3].


Here, enabling polling on the driver could help to solve the issue.

we found that the POLLING option, a static compile time options for many drivers, did not improve theperformance in our tests.


The ring-walk [8] and Jump-Stay (JS) based channel-hopping algorithms [19] are analyzed in symmetric and asymmetric channel models (S/ACHm).

in [8] it is assumed that nodes know the largest possible ID, i.e., the network size n, which also in.uences the period size composed of n time slots.


Compared to TCP Reno, Ack Regulator improves the throughput by up to 15%.

tCP Sack performs very well and has almost the same throughput as Ack Regulated .ows as long as the rate variation is not extremely large.


This is the likely mechanism if the PC is a centralized entity and controls the entire paging group.

it is possible that a given PC may not be able to directly communicate with a particular BS.


Therefore, parent nodes should not wait until they are so close to dead state to notify their neighbors.

changing the parent frequently would cause ine.ciency by posing additional message transitions.


Therefore, the performance of the two approaches are comparable.

having the whole frame following the same frame rate makes it readily composable with the spatial layers, and therefore o.ers more .exibility.


Short term indications can be derived from the retransmission ratio (RR), which is commonly used in the uplink for the adaption of the transmission rate.

it is substantially useful in the downlink direction as well, as we will see in section 5.


However, it has been demonstrated [8] that if no additional security measures have been taken, a sensor node can be compromised within one minute.

the attacker can use side-channel attacks [9] in order to obtain the secret keys.


VariousschedulingalgorithmssuchasiSLIP [30], DRRM [28], and maximum weight matching (MWM) [36] have been proposed to achieve high throughput.

many of these algorithms are complex, or require nearly instantaneous communications among input and output schedulers thatareusually placed far apart on different line-cards.


In order to increase the aggregate forwardingcapacity of a sensor network it makes sense to deploy multiple SAPs.

it is not clear how nodes should pick a SAP to avoid hot spots and realize this higher capacity.


Note the low A-reception rates obtained in case of CR=200m due to the high incoordination caused by the load offered to the medium (CBT=93.3%).

higher CR values, which cause higher PLI and channel load, do not experience a sensible decrease of the successful reception of messages 4Note that the .gures do not include the curves corresponding to sensed due to better readability.


However, if the period is too small, it will increase the communication overhead.

a larger period might lead the nodes to use inaccurate battery power level.


Links are then assigned by randomly picking two node copies and assigning a link between them, until no more copies remain.4 For most of the rest of the paper, we focus almost exclusively on PLRG as the sole degree-based generator.

the results for other degree-based generators, presented in Section 4.4, are qualitatively similar to those of PLRG.


Via a sequence of iterations, each node will be lead to its destination by the virtual forces exerted on itself.

a node consumes energy on its movement which is usually larger than other activities of its sensing application.


The control algorithm operates as follows: if too many idle intervals are observed compared to the target, Pa is needed to be increased additively, which in turn will decrease the expected number of consecutive idle slots ni.

if too few idle intervals are observed compared to the target, Pa is needed to be decreased multiplicatively, which in turn will increase the expected number of consecutive idle slots ni.The following algorithm implements the theory: target If ni >ni ,Pa .


The WiFi driver in Linux kernel release 2.6.33 used in our prototype implementation sets interrupt coalescing timer to 2 ms [4].

it is observed that the µCode actually overrides the interrupt coalescing timer set by the driver and enables immediate interrupt for TX command response.


Such replica streams have high probability of being caused by the same routing loop.

simply merging replica streams in the same subnet underestimates the length of a routing loop if there are points in the loop where there are no replica packets to detect.


The programs recorded by these o.erings are expected to be the most popular shows.

recording all the top-n shows for all users could yield negative energy savings (§6.2.1).


When the bursty multimedia traf.c .ow is delivered over a WLAN, the required effective bandwidth for QoS guarantee at the IP layer should be provisioned by the MAC layer under the connection or call admission control (CAC).

it is very dif.cult, if not impossible, to derive an ef.cient analytical tool from the saturated modeling for effective bandwidth provisioning and admission region calculation.


In [14], the maximum data collection problem was formulated as a linear programming problem and an iterative approximation algorithm was developed.

all these works don t consider topology control problem, and they don t consider the impact of the exchange of maintenance messages.


Clients may be able to overhear transmissions from other APs (as in Figure 1b) or nearby mesh nodes, or relays(asinFigure1c).

the relayhas no way of knowing the client can overhear without explicit knowledge of the client s presence.


In other word, FEAT allows for the presence of unaware receivers (those who do not know about FEAT) in the network, e.g., Charlie.

if the network environment does not require the condition of absolute transparency (i.e., the network does not have 0.2 an unaware receiver), we could embed a frequency o.set in 0 any number (as low as 1) of OFDM symbols.


The main property that fueled this attractive performance is the improved tit-for-tat incentive mechanismthat reducesfree-riding andincreases user cooperation.

this performance-awareness , which altersthepeerselectionbased on measurementsoftheachieved download or upload rate, canhave seriousimpact on thedynamics of the underlying native layer.


Intuitively, if the sensing range is high, we may expect that the level of frequency reuse is low, which in turn will reduce the e.ects of load balancing.

if the sensing range is low, the degree of frequency reuse will increase, but unfortunately this will also increase the probability for packet collision.


In the fragmentlevel compression, BiM could provide better compression ratios than GZip.

in OMA BCAST Service Guide, no fragmentlevel compression is available, and compression is only applied to the Service Guide containers that will be discussed later.


Having a model of application requests is important indeed.

that alone is not sufficient to make prefetch decisions.


Thus, purely ECC-based mechanisms for signature and veri.cation would cause unacceptably high delays for on-path veri.cation.

eCC signatures present a viable solution for securely exchanging the anchors of hash chains in the beginning of an association (cf.


2.1 Trajectories To record the true movements of objects, we would have to know their positions at all times, or better, on a continuous basis.

current technology only allows us to sample an object's position, i.e., to obtain the position at discrete instances of time, such as every few seconds.


Therefore, Harvesting method Figure 2: Ratio of tra.c volume per email address for various harvesting methodologies our technique is fully automated as it expands, and no further manual intervention is needed for collecting more names that will be used as seeds.

document crawling, generic dictionary attacks, and attacks based on surnames present very low scalability as the search terms are static, unlikely to change and have a limited dictionary size.


NotVia with oFIB can also prevent micro-loops after single topology changes.

the path stretch takes longer time before it drops to 1, suggesting that traf.c stays longer on the suboptimal paths.


The values kept in this .eld must be strictly increasing along a route from destination to source in order to prevent loop formation during the route discovery processes [2].

when a bridge node is inserted into an active route as in the proposed expand process, this monotonicity may be disturbed because the .eld s values in upstream nodes from the bridge node are no longer correct; they need to be increased by 1.


Tables which provide the attenuation of di.erent wall types [18] can alleviate this burden somewhat, though this still requires knowledge of the building s construction materials and may not capture the e.ect of objects like metal bookshelves that can alter a wall s attenuation.

our approach automatically estimates the attenuation of walls from training data.


The unicast routing protocols (BGP, RIP, OSPF, and IS-IS) are clearly functionally separate, and most routers only run a subset of these.

as we will see later, the coupling between routing protocols is fairly complex.


2.2 Existing Solutions and Drawbacks Transmit power control and rate adaptation are well researched topics in wireless networks.

our study reveals that no solution provides a comprehensive and easily realizable approach to simultaneously address the challenges discussed in the previous section.


Many researchers have proposed alternative peer-to-peer (P2P) architectures [1].

while P2P may be more economic by utilizing inexpensive clients, they still face the same geometric partitioning problem due to uneven user distribution.


In addition, it could be inconvenient to recharge the battery, because nodes may be deployed in a hostile or unpractical environment.

the sensor network should have a lifetime long enough to ful.ll the application requirements [2].


Since it obviously has higher coverage percentage than STree_Flat routing, MTree_Flat routing has better space and time complexity than STree_Flat routing, and also better trade-off.

as the size and complexity of the topology increase, the number of routing states which cannot be covered by the spanning trees will still be extremely large, and so will the space and time requirement.


For instance, the last switch on a path of a .ow is the most representative of the receiver because loss of packets can occur beforehand.

such a strategy leads to a large load on this switch.


Such a problem has been analyzed in the literature for the case of macro Base Stations (BSs) [15,16]; however, due to the high power consumption of this type of BS, the big size and high cost of the required solar panel and batteries caused a scarce success of this solution in the market.

small cells have more limited transmission power and computational capabilities than macro BSs; as a consequence, their power ampli.ers are smaller, and cooling systems are not needed, thus reducing their total power consumption.


In the educational network, with the exception of the iOS devices, the majority of the DHCP requests are renewals.

in the corporate network a considerably smaller percentage of the requests are renewals.


Thus, in the worst case, if every instruction is a CSTORE, a TPP can add a maximum of 50ns latency to the pipeline; to avoid losing throughput due to pipeline stalls, we can add 50ns worth of buffering (at 1Tb/s, this is 6.25kB for the entire switch).

the real cost is likely to be smaller because the ASIC already accesses memory locations that are likely to be accessed by the TPP that is being executed: For instance, the ASIC always looks up the .ow entry, and updates queue sizes for memory accounting, so those values needn t be read twice.


In this case (k) vk = c· c =(ckc0 + ck+1c1 + ... + cn-1cn-k-1) +(c0cn-k + ... + ck-1cn-1) = Sk + S ' k The terms in the sum Sk + S ' k are in general not independent.

in particular, if k = n/2, then Sk = S ' k. we observe the following.


As mentioned earlier, DQS can consider the endto-end path situation for every packet.

priQueue schedules packets with the FIFO policy, while EDF schedules packets based on a given per-hop delay without considering the end-to-end path situation [15].


Additionally, even traditional baseband processing for wideband systems, such as OFDM, can cause substantial delay.

since these overheads are common to both zero-forcing and conjugate, we omit them from our analysis as they do not provide additional insight in the performance tradeo.s; they essentially have the e.ect of further shortening the coherence time.


In this case, iProxy does not replace any entry and all of U RL1, U RL2, and U RL3 stay in the table.

a conventional proxy replaces potentially valuable U RL3 content by U RL2; it also wastes storage in caching the content for both U RL1 and U RL2, although they both refer to the same underlying information.


tackled individually, it is possible to provide the desired predictability, reliability and high capacity.


Changing the network yields different IP address.

changing the IP address results in loss of already established connections.


In those studies, the authors assumed a simple setting where the location of the base station is .xed.

it has been well recognized in the sensor network community that a mobile base station (MBS) offers signi.cant advantages over a static one (see, e.g., [1, 5, 7, 13]).


Generally speaking, reactive routing protocols are implemented in a platformdependent fashion and not portable.

our implementation of the protocol can run on all platforms that AT-MOS operates.


By using parameterized QoS information, the HCF makes STAs to access wireless mediums with di.erent priority levels.

pCF and HCCA are designed only for single-hop networks.


INTRODUCTION The emergence of smartphones over the last few years has provided a new platform for application developers to develop and showcase innovative apps.

connectedness for mobile applications (apps) means being connected to the cellular network as well as some Internet service for the delivery of real-time information (e.g., a message or voice).


A key problem is that no direct measurements are available for source-to-destination flows (i.e., T(e) is not known), because that would require complex source and destination MAC address processing which our architecture obviates.

a pseudo inverse of the measurement projection matrices can be used to indirectly estimate input traffic from measurements.


Therefore, the total credits assigned to both v1 and v2 can not exceed 0.75m because both v1 and v2 can reach both d1 and d2.

in Fig.3,the totalcredits assigned for both v1 and v2 can be m because there is no destination that is reachable by both v1 and v2, which nulli.es the e.ect of the commonly received packets by both v1 and v2.


Clearly, if the application mapping changes, a new PDG has to be generated.

this limitation is shared by all trace based simulation techniques, and we consider it a fair tradeoff for the potential gains in simulation speed and accuracy.


Td becomes a predominant parameter in determining the system performance.

our extensive simulation and analytical results advocate that we should avoid selecting time parameters that satisfy Td » Ts, as this condition results in a large value of .


The APs use 12dbi omnidirectional antennas and exploit orthogonal (nonoverlapping) channels e.ciency: channels 1, 6, 11 in rotation.

we found some adjacent APs using the same channel during an o.-line experiment (the reason for this is mentioned in section 4).


For networks that require short paths due to reasons like constrained energy or capacity, the simulation results may suggest using GLS.

it is possible to use WSR as a location service as we discussed before.


ASYNCHRONOUS RENDEZVOUS PRO-TOCOLS The energy saving of proposed rendezvous protocols can be evaluated based on the number of active slots in the whole sleep-wake pattern interval.

it is di.cult to compare the energy e.ciency of di.erent methods because each rendezvous protocol de.nes its pattern interval (i.e., duty cycle), parameters, and metric di.erently.


Theoptimizedpathselectionprobabilitiesweresuchthatfortheresultingscalarpacket.uxwehave Fmp1(r)=0.61 · Fsp(r)+0.39 · Fout(r), and(subscriptmp denotes multi-path ) Fmp2(r)=0.5027 · Fsp(r)+0.3763 · Fout(r)+0.121 · Fin(r), wheretheformeryieldsamaximum.uxof0.397 ·.,andthelatteramaximum.uxof0.3763 · .,i.e.,the.uxcorrespondingtotheouterradial-ringpathsattheboundary.ThenumericalresultsaregiveninTable1,whererowsindicatedwith1)and2)correspondtotheoptimalweightsforrandomizedpathselectionwiththegiventwoandthreepathsets,respectively,andcolumn multi-path containsthecorrespondingmaximumscalar.uxes.


With the knowledge of the exact version of the TCP source and the round trip time from the RNC to the source, it is possible to compute an exact estimate of AckReleaseCount.

since we would like to be agnostic to TCP version as far as possible and also be robust against varying round trip times on the wired network, our algorithm tries to maintain a conservative estimate of AckReleaseCount.


(16) These last equations complete the model, which is solved using .xed-point iteration.

the metrics of interest in the present article are the probabilities of empty, successful and collision slot, and also the throughput.


The ACK-based feedback is only effective if the packet intervals are so short that the best antenna selected during one packet transmission will remain the best for the next.

it is more efficient than the RTS/CTS-like feedback because the latter incurs overhead due to the extra packet exchange.


We observe that for one, two, and .ve end hosts on every side, the algorithm is unable to .nd the optimal weights in the beginning.

for n = 10 clients and servers, the algorithm reliably .nds the optimal weights.


When traffic load decreases, topology knowledge increases again.

figure 6 shows the amount of nodes that are selected as MPRs during the simulation time.


This function provides di.erentiation between the forwarding probabilities of nodes that receive the same packet in a broadcast area.

it assigns a probability equal to 1 to at most one node in each opportunistic broadcast area.


This degrades the performance of the network code.

algorithm 2 would build z = y4, z = y1 .


In this work, we establish the capacity of general multichannel networks wherein the number of interfaces, m,may be smaller than the number of channels, c. We show that the capacity of multi-channel networks exhibits di.erent bounds that are dependent on the ratio between c and m. When the number of interfaces per node is smaller than the number of channels, there is a degradation in the network capacity in many scenarios.

one important exception is a random network with up to O (log n) channels, wherein the network capacity remains at the Gupta and Kumar bound (.)


INTRODUCTION Recent advances in hardware and wireless communication technologies have led to an increasing interest in ad hoc networks that are temporarily constructed by only nodes with a wireless communication facility, e.g., mobile hosts and sensors.

tDMA (Time Division Multiple Access), which is a conventional wireless communication technique, has the ability to provide collision-free packet transmission regardless of the tra.c load.


On alarge scale,it is notclearthat such node-centric supportis needed when nodes are far apart.

instead, supportforgeographicallydistributednodes may bebetteroff relying on3G-orhot-spot-based solutions.content-centric applications, which rely onprobabilisticdissemination ofdatabetween clusters, match well with existingDTN-based communication.


Any functionality that requires frequent events (such as per packet processing) imposes a prohibitively large overhead on the control plane, and therefore cannot be implemented as a control application.

changing the data path ASIC to add any new functionality for handling frequent events can be extremely costly, may take a very long time, and obviates most advantages of SDN.


Our model of export policies is based on the Gao-Rexford condition GR2: GR2 AS b will only announce a path via AS c to AS a if at least one of a and c are customers of b. GR2 captures the idea that an AS should only be willing to load his own network with transit tra.c if he gets paid to do so.

because GR2 does not fully specify the export policies of every AS (for instance, an AS could decide to export paths to only a subset of his customers), it does not su.ce for our purposes.


Category Failure LDNS Non-LDNS Error 100count timeout timeout PL 191168 83.3% 9.7% 7.0% BB 10792 76.0% 24.0% DU 899 77.7% 22.3% 80 60 Table 4: Breakdown of DNS failures Cumulative Percentage of Failures 40 20  4.1.3 Packet Loss and Transaction Failures Several previous studies have considered packet loss rate of TCP connections [24, 33].

we only .nd weak correlation between packet loss rate and the failure rate of end-to-end transactions in our data set (the coe.cient of correlation is 0.19).


For example, an image can be .ngerprinted using a histogram of colours and will be immune to compression.

a further complication is introduced when encryption is employed, rendering even .ngerprinting techniques useless.


Removing this bias was not a design goal of this paper.

this is not a limitation of our work either.


Each client is given a priority,whichisexpressedasa rate.

thisisnot an absolute rate, but rather a relative one.


Also, geolocation of end-hosts can be achieved by combining network positioning information with the geographic locations of a few well-known nodes.

cell phones pose challenges for latency-based network positioning.


If the master begins producing outputs that differ from the standbys, or crashes, then one of the standbys is chosen as the master.

the downside of this approach is that an incorrect route may be written to the FIB.


[11, 31], then FS-BGP-PD with no PKI is just as good as with fully deployed PKI with respect to such an adversary.

the only provably secure accountability protocols that are known to date require nodes to deploy a PKI or have shared keys, so having no PKI for FS-BGP-PD would yield no practical gains if the Internet does deploy a provably secure accountability protocol.


The vision of an all-service IP/WDM network is conceptually attractive in that it simplifies the architecture of the network, reduces the number of network layers, and eliminates a legacy SDH transport layer.

such a network requires more IP packet processing at intermediate nodes, and hence larger routers with higher energy consumption.


If the instantaneous SIR value at the data frame is higher than the threshold, the TPC bits are set to 0 , requesting a transmit power decrease.

if the SIR value is lower than the threshold, the TPC bits are set to 1 , requesting a transmit power increase.


Thus, it is assumed that the integrated behavior of the installed .lters will globally implement these policies.

the following con.icts become apparent: (1) the semantic gap between the controller platform (e.g., NOX [13]) and the .lter tables in the data processing units, (2) the distribution of access control that supports aggregate .ows (wildcards) and many di.erentactions,(3) theability of sharing one controller by di.erent users, and (4) the ability of using multiple controllers in the same domain.


Our results show that the most common modulation type for WMs is FM.

fM deviation and side-tone placement is not generic for FM modulated WMs.


Moreover, it is assumed that the clusters are NSIS-aware and the transport of MUSC-P messages is controlled by GIST.

in order to simplify the explanation, the interaction between MUSC and GIST will not be described.


The reason for the high FN is that some of the C&C communications of botnets do not have distinct characteristics, which results in the prototype missing small parts of flows from bots.

the prototype performed well in terms of FP and successfully identified all 20 bot-infected hosts.


In terms of false negativerate,itisdecreasingforNMF algorithmwhen more failureinstances areprovidedasinput.

when there are more than 250 failure instances, both the NMF and the k-means algorithms provide satisfactory results.


In general, either increasing k or reducing d will result in an increase of the edge coverage.

we observe the number of covered edges converging when d> 0.5 and k exceeds 40 for HTTP and above 50 for DNS.


It might appear that resource constrained sensors can be overloaded, in terms of energy consumption, and cost, with the addition of the pulsing mechanism.

we argue that the addition of the WFP signal alleviates several problems associated with reliable message delivery, and can in fact provide bene.ts that far outweigh the costs.


On initiator side of Table 1, the puzzle resolution takes signi.cant energy and time depending on the di.culty K. It implies the puzzle mechanism, to some extent, can protect against I1 packet DoS attack.

it also imposes considerable overhead to establish connection with new nodes.


Twovirtual slices residing onthesamephysical nodecanbe made to operate in sync through the hypervisor.

this provides reliability against software failures at most, since the slices reside on the same node.


TDMA has long been dismissed as an impractical solution for mobile wireless ad hoc networks for its lack of scalability and adaptability to changing environments.

it provides a good energy e.ciency and collision-freedom.


With underestimated range values, more vehicles positioned beyond the underestimated range are assigned to the earliest time slot, thereby resulting in more transmissions.

inaccurate range estimations directly a.ect the expected end-to-end delay in DOT.


The .rst step towards designing e.ective caching schemes tailored for CDNs is to understand the characteristics of content requests because their dynamics strongly impact CDN caching performance.

little prior work has been done towards this end.


SUMMARY: HOW TO APPLY VCM IN PRACTICE In practice, to apply VCM, we startfrom a set of sensor nodes arranged as atwo-dimensionallattice(identi.edbytheirinteger coordinates).

in an actual wireless network, the set of neighbors may notbeexactlygivenby theset of nodeswithina .xed range R.noticethatavalid h-hop coloringforagiven R,isalso a valid h-hop coloring for R ' < R (although likelynon-optimal).


Until recently, the Computer Science discipline was a member of the Science and Mathematics Department of the College of Arts and Sciences.

with strong growth over several years, the department has become very large and will be split into several smaller departments.


SEAMLESS CONNECTIVITY We consider host-based routing on a set of stationary nodes con.gured like the example in the last section and a set of mobile nodes.

we can not simply apply ad-hoc routing protocols to them since most of ad-hoc routing protocols assume on operation under the single-channel environment.


From the results, we conclude that BATMAN presents more robustness than OLSR against the impairments introduced by the wireless medium for video transmission.

bATMAN presents some scalability issues compared to OLSR.


There are several protocols that have been introduced that return accurate results in case of node failures [7, 16, 4, 14].

these approaches do not consider the presence of malicious nodes that are trying to perturb the aggregation result.


On one hand, the goal is to minimize the network load and improve spectrum e.ciency.

inappropriate network con.gurations can decrease the battery life of the handset and increase its communication latency.


So, the design and implementation of an Intrusion Detection System (IDS) is very important with respect to key renewal.

this issue is beyond the scope of this paper.


An alternative solution for preventing spoo.ng attacks on BFD and PSC messages in non-IP MPLS core networks is to use hop-byhop security (MACsec).

cisco does not support MACsec in its routers.


In wireless communications, such interference model is considered as a reference model since there exist practical coding schemes to approach its solution in real systems.

thedi.culty associated with thephysical model isits computational complexityin obtaining asolution,particularly whenitinvolves cross-layer optimizationin a multihop network environment.


The IPHC mechanism as described in (RFC 2507) is a hop-by-hop Header Compression (HC) mechanism intended for point-to-point links.

applying hop-by-hop HC scheme to achieve endto-end HC is undesirable as the packet path then includes several compression-decompression cycles in the intermediates nodes in the core network and therefore increases the end-to-end delay.


The main path is defined to be the one with the smallest amount of delay.

if the delay for two main paths becomes equal and we cannot decide based on the main path cost, we will switch the decision to the next smallest delay reserve path and this procedure may be continued for all other reserve paths.


The CRHB method makes the broadcast schedule considering the playing time of the highlight scene and TAS.

the conventional BEAHB method and HeRO make the broadcast schedule considering both playing time of the highlight scene and the main program.


We are planning to do a trial installation of such a network in Malawi using commercial TV white spaces devices for Internet access in a joint collaboration venture among the Malawi Communications Regulatory Authority (MACRA), the Chancellor College of the University of Malawi and the International Centre for Theoretical Physics (ICTP).

the heatmap and the graphs of maximum measured power versus frequencies also identified certain frequencies, like the ones centered in the TV channel at 546 MHz that warrant further investigation to find out if they correspond to spectrum usage without the local regulator approval or just random noise peaks.