Furthermore, the system can now be entirely controlled as a signi.cant .exibility in the allocation of resources is introduced: If the system seeks to realize a fair rate sharing, it can give more slots to far users who are disadvantaged as compared to nearer users due to their small feasible rates, as for instance in WPF(1,1,4) where users in Zone 2 perceive a gain of 50% in comparison with PF.

if the system wants to maximize the overall throughput without causing the starvation of distant users (as it is done in the Max SNR scheduler that always serves the user with highest rate [4]), it can give more slots to close users than to far away users.


Taken together, this appears to paint a somewhat pessimistic picture of wireless communication for sensor networks.

we contend that there might be a simple set of mechanisms that can greatly improve packet delivery in the environments that sensor networks are targeted for.


Simulation results have shown that the proposed approach exhibits a better performance both in terms of coverage and the total moving distance compared with one of the best e.ective techniques in the literature [7].

the main strength of the proposed method lies in the fact that as the sensor density increases, the number of moved sensors as well as active sensors becomes considerably less than the existing sensor relocation algorithm.


This entire data structure mapping scheme is essential for most of the application data structures (e.g., a hash table or the virus-signature table).

for certain data structures such as the trie used in LPM it is possible to partition the data structure such that the most frequently accessed portions of the data structure (namely, the top-levels of the trie) are placed in fast memory and the remaining structure is stored in a larger, slower memory [9, 22].


In the case where all the .ows have a common RTT or have a small RTT di.erence, VCP achieves a near-even distribution of the capacity among the competing .ows (refer to Figure 8).

when the .ows have signi.cantly di.erent RTTs, VCP does not distribute the bandwidth fairly between the .ows that have huge RTT variation (with throughput ratio of up to 5).


Such mapping adds randomization in the constellation mapping block (described in Section 2.2) where message bits relayed from upper layers get mapped to physical-layer symbols.

the technique operates on the sample space of the symbol alphabets (the alphabet space consists of the options that the physical-layer symbols can take).


In essence, the Vehicular Grid is a large scale ad hoc network.

an important feature of the Vehicular Grid, which sets it apart from most instantly-deployed ad hoc networks, is the ubiquitous presence of the infrastructure (and the opportunity to use it).


Ideally, network redundancy should completely mask all failures from applications.

we observe that network redundancy is only able to reduce the median impact of failures (in terms of lost bytes or packets) by up to 40% (Section 5.1).


A possible way to overcome this situation is to have a common repository of implementations of algorithms for WSNs.

this is not trivial, because it is dif.cult to cope with the broadness that libraries require, together with the number of constraints that arise from the scarce resources available on sensor devices.


In the paper, the proposed metric is compared with sliding window Jain s index.

and the authors acknowledge this in their work, they study fairness under homogenous conditions: no host is disadvantaged by its signal quality, tra c pattern, or spatial position.


Since DSDV has been shown to not converge at high mobilities, AODV seems the more scalable of the three protocols.

using a more general traf.c pattern, a wider set of tradeoffs emerge.


For example, a read operation op1 and a write operation op2 confict with one another.

a pair of read operations are compatible with one another.


DTHR2 can improve the throughput performance with re spect to DT, for example in Scenarios 2 and 3.

qMFLC outperforms the other schemes in Scenarios 1 and 2, we neither believe nor expect that this is true for all pos sible scenarios; for example, if the direct link S D is much stronger than the rest, we expect DT to do best; and if this link essentially does not exist (e.ectively creating a line net work as seen in Scenario 3) DFLS (i.e., routing) does better than all others schemes.


First, for the ISM band case, none of the access points interfered with each other, while for the DTV whitespaces, several access points interfered with each other, with the number of neighbors as high as 4 in some cases.

the spectral ef.ciency in the whitespaces (typically > 2.5) is much higher than the spectral ef.ciency in the ISM band (typically close to 1).


Hedera[2]and MicroTE[5]advocate .ne-grained traf.c engineering over a .xed topology to alleviate congestion.


It is feasible to integrate bandwidth reservation and admission control with its route discovery mechanism with low overhead.

in long-distance wireless networks, since a node always has multiple radios, DSR cannot be used directly.


In this approach, there is a distinction between add/drop and regeneration nodes, since regenerator cards are not capable of adding/dropping traf.c.

regeneration can also be achieved using back-toback transceivers [19], in which case, regeneration nodes can also be add/drop nodes, and vice versa.


Therefore, applications of this metric include viral marketing and the study of rumour spreading.

temporal betweenness distinguishes individuals who act as key mediators between the most communication paths over time.


fewer network nodes), di.erent values of ./µ do not make a di.erence, as the sparsity of the network does not allow many events to take place and thus the results appear similar.

such di.erences are evident for denser topologies.


We omit a detailed description of the protocol that implements this congestion sharing.

we will note that this protocol can be implemented ef.ciently.


This makes it possible to cache negative results until the zone expires and a newcopy of the zone must be transfered.

it also means that the complete zone must be transfered even if only a small portion of it will be used.


Storm s Overnet Protocol: Storm bots connected to the Overnet network used the same ID space, message types, and semantics as the other clients, and earlier version of the Storm was connected with Overnet, which has been used for old eDonkey clients.

after Storm started encrypting traf.c using the Vigenère cipher, it has been disconnected from Overnet, forming a separate network.


Network Confessional meets this condition when nodes i and j are expected to sample the same packets (modulo loss and reordering).

if node i is expected to sample more packets than node j(e.g., because it uses a larger sampling threshold), then node i is free to lie about the packets that should be sampled by i but not by j.


[2] are one ofthe .rsttohighlightthe challenges of independentWLANscoexistence.UsingdatafromexistingWLAN deployments, they study the impact of interference on client performance.In[5],Ergin etal.provide experimental and simulation results of similar unplanned WLANdeployments.

they assume a single collision domain for all the WLANs and do not capturethe unfairnessthat arises over multiple collisiondomains.


RELATED WORK Extensive quantitative comparisons of distributed localization systems are presented in [7, 13], which are related to this paper.

in this work, we do not perform experiments to evaluate which algorithm performs best.


If a Trigger Point is met, S-CSCF sends the request to the AS associated with the Trigger Point to invoke it; on receiving the response from the AS, S-CSCF starts to evaluate the next iFC, until all iFCs are finished evaluating.

this service invocation mechanism, which is based on sequential evaluation of iFCs, has not clarified the detailed implementation mechanism for integrated services, which concerns multiple service capabilities that are correlated with each other.


While the above-mentioned report advocates the use of PBR in vehicular highway scenarios, it does not answer the question of how the beaconing interval should be set.

it indicates the trade-off between a low beaconing interval resulting in high position accuracy at the expense of high network load and a high beaconing interval saving network load, but leading to an unclear picture of the neighborhood.


This reduces the probability for false positives when matching the zFilter on the path.

adding forwarding table entries into nodes increases the sizes of the forwarding tables.


This includes all relaying and multihoppingschemeswheredi.erent transmittersuseorthogonal space/time/frequency channels so that their transmissions do not interfere with each other.

beamforming depends on transmitters interfering with each other in a carefully controlled way.


A router does not normally forward iBGP-learned routes to its other iBGP neighbors.

a router can be con.gured as a route re.ector (RR), which forwards routes learned from one of its route-re.ector clients to its other clients.


In the current state of the art there is a lack of studies on Green Communications (energy-e.ciency) in VANETs.

due to the possible interaction with devices that are fed with di.erent electrical sources and the proliferation of electrical vehicles, the power consumption by the wireless communications might become a major concern in VANET design.


Both of these protocols provide mechanisms to partition networks into regions in order to allow the protocols to scale to very large networks.

with both protocols the introduction of regions actually complicates the metric used for .nding best paths.


With paid peering determined by Nash bargaining solution, it is preferred by both ISPs with peering of low level and medium level.

the peering of high level still has much uncertainfactors causedby free-riding.We also proposed a regime equilibria analysis with BNE theory, ., and ch cAB = ., which is of the low level, we can get the = ..


In Figure 11, h = 2 is close, but larger than p 2 r 1.5, so for large ., isolated sensors dominate this probability.

the correction terms to the estimate ee -.hr for breaks result in the breaks dominating when .


This alternative can indeed help mitigate DDoS attacks and is, perhaps, the best we can do in the current Internet architecture.

it implicates Internet core routers in every end-to-end .lter propagation.


To be differ from WSDB, 802.11af adopt Cognitive Radio (CR) to sensing the unused channel and, thus, White-Fi can get benefits from the TVWS.


[7], also addresses the robustness of Geocast but not from the perspective of malicious activities.

their proposed mechanisms can be transferred to the security domain, because they can also detect intentional message losses created by attackers.


As such, they suggest to incorporate a parameter tuning method in IEEE 802.11 so as to achieve the capacity bound.

they only deal with IEEE 802.11 DCF without the RTS/CTS mechanism, and assume that all the stations always have packets ready for transmission (which is termed as the asymptotic condition in [7]).


i.e., 1(622 - 64)/15l =38 hosts, in the proposed ESnet, Proposed ESnet Topology; Poisson Sources; At LANL Router TCP congestion-control really kicks in and adversely mod 1 ulates the application traf.c.

over this proposed 0.9 ESnet, the adverse modulation by TCP is even more pronounced than in the current ESnet, i.e., the measured c.o.v.


In contrast, Client-Aware Policy (CAP) [5] classifies requests into different types and tries to dispatch requests of each type to all servers evenly.

it does not distinguish servers' capabilities and specialties either.


While the top plot in that figure shows the traffic rate process (all TCP) over the whole measurement period (i.e., 48 observation periods), the middle plot states that periods 23 and 31 have been identified as interesting by WIND.

upon closer inspection, the fact that the energy function corresponding to period 31 is almost flat turns out to be an artifact of the very low traffic load during this period (see top plot).


Existing cross-layer approaches mainly focus on satisfying a specific requirement of an application considering dynamic network conditions.

there are various types of applications in wireless mobile environments, and existing cross-layer approaches cannot support all different requirements of various applications.


If this is the case,thenthepeer cannot now(i.e.in round t)receive any unit c t-k such that t -k+m = t +1 or k = m -1.

re2 entails precisely that when we reach any round m = t = T + m all peers who still have not received unit c t-m arematched with the otherhalfofthepopulation, so to ultimately receive such a unit, that will no longer be distributed throughout the whole streaming.


Any value in this range can be legitimately substituted into the above inequalities.

a particular choice of value determines the ef.ciency of the system.


Therefore, present data center provides performance isolation among tenants.

it is limited to system resources, not network resources, nevertheless oversubscription that is caused by network interference entails troubles.


The latest needs a user intervention and is not interesting for a seamless transition.

in the proactive mode, the service is automatically retrieved whenever a low cost network is discovered.


Using either rule-based or machine learning based approaches [1, 2], application classes are commonly attributed to .ow records on the basis of the reported TCP/UDP port numbers, sometimes in conjunction with traf.c features such as total packets, bytes, duration, or combinations thereof.

the performance of such approaches often degrades when these .ow measurements are either inaccurate or incomplete.


Additionally, it is di.cult to guarantee distinct per-QVPN delay violation probabilities with EDF due to strong interactions among QVPNs sharing a link.

rate-based schedulers, such as the one we use, provide explicit performance isolation among QVPNs and are especially suited to guarantee QVPN-speci.c delay violation probabilities.


Outside hosts exhibit similar variability as that of inside hosts.

because some of these outside hosts represent gateways (such as Facebook and Myspace), their similarity values are not as low as that of the inside hosts.


Recently NoC router architectures with fewer stages were also proposed.

changing the number of router stages a.ects only the initial latency in our analysis (refer to details below), and therefore our approach can be applied to router architectures with fewer pipeline stages.


From the simulation, we can observe that it cannot recognize coexistence condition accurately by just using a single PRR value or a single SINR value.

the result of naive Bayesian classifier, the proposed algorithm which jointly considers PRR and previous state is equal to prior ............ .. .. value, respected result.


The probe rate model (PRM) is based on the concept of self-induced congestion; informally, if one sends probe tra.c at a rate lower than the available bandwidth along the path, then the arrival rate of probe tra.c at the receiver will match their rate at the sender.

if the probe tra.c is sent at a rate higher than the available bandwidth, then queues will build up inside the network and the probe tra.c will be delayed.


Finally, in [7] several selective DENM broadcast algorithms are compared, amongst others intelligent flooding that seizes after overhearing re-broadcasts.

no previous papers have evaluated the performance of the two messages types jointly.


BIND will usually focus queries on remote servers with a lowresponse time and probe other servers periodically to update estimates of response time.

it is di.cult to tell which queries are probes and which queries are real .


For instance, past work has addressed disconnection tolerance [20], support for mobile users [13, 16, 22], interoperability with legacy servers using proxies [14], and use of multiple networks and NICs [5].

all these solutions have three problems.


Probability of each phenomena appearance in context of other processes is not deeply evaluated in the introductory period, when specific structure of transformation matrix is identified.

each TM element is consequently evaluated in several steps process based on the detailed analysis of the particular telematic and communications configuration and its appearance probability in specific context of the whole system performance.


The price goes up with more CPU sockets: $87 in a dual-socket machine7 and $183 in a quad-socket machine8.

installing a cheap GPU (the price ranges from $50 to 6$240 per Core i7 920 processor (2.66 GHz, 4 cores) 7$925 per Xeon X5550 processor (2.66 GHz, 4 cores) 8$2190 per Xeon E7540 processor (2.00 GHz, 6 cores) $500) into a free PCIe slot does not require extra cost.


In practice, localization using NLOS radio signals could be inaccurate, such as at X; consequently, di may not indicate the magnitude of the error in ri .

as can be seen from Figure 1(a), di of some (or all) beacons should be associated with di >.i, since the signal propagation circles cannot intersect at a point.


We have E(k(t)) = t · E(p, rT ) and V ar(k(t)) = t · V ar(p, rT ) .

lemma 4 is scarcely useful in estimating P rob(Start(d,¯t¯)), since it gives little information on how close random variable k(t) is to its expected value.


Since the INTER-ESTpacketdoesnot includearequestorID,privacy for the requestor is already provided.

a strong adversary may infer a requester and content by combining INT ST with other information.


The content types that drive the local peaks are audio and text, which implies that many users are listening to popular music or reading popular online news while commuting.

these periodic bandwidth peaks cannot be addressed by standard Web caching that saves 14.4~18.2% less bandwidth than TCP-RE.


For multicast, a source based method like TBF should store the entire distribution tree in each packet, which could signi.cantly increase overhead.

in certain cases this overhead may be reduced.


Nowadays the evolution of computer technology has signi.cantly reduced equipment costs, advancing their deployment .exibility.

the increased mobile-oriented data volumes still maintains the network utilization cost high, creating signi.cant revenue problems for operators.


Payment for generating data and a reward for acknowledging received data are used in [34] to secure against cheating by a source and destination.

no existing credit schemes or security frameworks secure the behavior of a relay in face a packet is not delivered by that time, it is dropped/lost at the node.


WWANs have low data rates that result in the inter-packet delay being large, which in turn makes it a robust and realistic metric to use.

in WLANs where bandwidths can be in the order of tens of megabits per second, it no longer serves as a reliable congestion metric.


INTRODUCTION With advances in wireless communication and wide spread of multimedia applications, there is a growing need to provide quality of service (QoS) support to multimedia traffic in wireless networks.

qoS provision in wireless LANs is a challenging task due to the varying wireless channel bandwidth which is determined by the number of users in the network, the users mobility, channel interference and physical layer auto-rate adaptation (e.g., IEEE 802.11a/b/g [3, 4, 5] which support multiple modulation schemes).


can help in achieving larger advancements.

we do not observe a substantial performance improvement from, e.g., .


Prior work has considered RTS/CTS variants to schedule non-con.icting links [18].

most existing deployments do not use RTS and CTS [12], even with RTS/CTS do not exploit concurrency well.


The 802.11e standard also calls for mandatory admission control policies that are to be implemented by the AP.

there are no detailed guidelines provided on how the traf.c should be classi.ed or how the different MAC settings should be optimized to meet the QoS requirements of the different applications.


of Technology Carnegie Mellon University ABSTRACT Using entropy of tra.c distributions has been shown to aid a wide variety of network monitoring applications such as anomaly detection, clustering to reveal interesting patterns, and tra.c classi.cation.

realizing this potential bene.t in practice requires accurate algorithms that can operate on high-speed links, with low CPU and memory requirements.


We validate the model with a discrete-event simulation of several of the convergence phenomena described above.

we do not claim that the convergence problems that we demonstrate are likely to be common in real-world networks.


Further more, it also requires that all nodes in the network have to be aware of the realtime location of the mobile sink so that the sensed data could be forwarded to the sink easily.

broadcasting the current location of the sink would waste additional energy.


Note that the side of the cell as de.ned here is slightly di.erent from that used in the GAF protocol [22], which ensures that nodes residing in a cell can communicate with all the nodes in the upper, lower, left and right cell.

this slight di.erence does not impair the validity of our analysis for the GAF protocol.


With more than two IDSs we can also analyze the the majority rule, which can initially be thought to be the operating point in the LRT ensemble that minimizes the expected cost function for t greater than any likelihood with a minority of alarms and smaller than any likelihood with a majority of alarms (max {l(001),l(010),l(100)} <t< min {l(011),l(101),l(110)}).

the partial order shown in Figure 6(b) shows that in this case the above equation might not always hold.


Second, tomography systems [36, 24] use wireless absorption prop erties of the objects for imaging.

we use wireless re.ections and scattering to perform imaging, and hence require a different set of algorithms.


In the following we will refer to this distance dr as the robust distance (or range) against hidden nodes.

in case of probabilistic propagation models the bene.t of this range (robust against hidden nodes) clearly depends on the experienced attenuation variance and the proper behavior of the CSMA/CA mechanism.


IAC allows multiple client-AP pairs to transmit concurrently by interference alignment and cancelation with collaborative APs.

we believe it may be more likely the mobile station is the limiting factor than AP.


For example, if a user requests a video transcoding + face recognition service, the service composition layer will check if there exist instances of video transcoding and face recognition services, such that the output media format of the former can be accepted by the latter.

if all face recognition services can only accept the input media format of the transcoding service, the service composition layer may suggest the user to switch the order between the two services.


In [21], the goal is to .nd a placement strategy that minimizes the distance that needs to be searched to .nd an arbitrarily chosen piece of content.

it does not consider content popularity at di.erent nodes since they formulate the problem as the k-center problem.


Removing the old encryption module is trivial, since it has been deactivated in the previous phase.

there might still be packets on their way that have been processed by the old encryption module.


In the example of figure 1, the node C would transmits two packets if no NC were used.

in the X topology, node C broadcasts only one coded packet, and S1 (or S2) can decode its native packet by processing the coded packet from C and the overheard packet from P1 (or P2).


In state of the art models, if a node has started with low energy, or has lost a large portion of its battery reserves during multiple transmissions, it still has to abide by the general rule that is identical for all nodes.

it is of importance to the network how the aggregate remaining energy is distributed among nodes, as nodes with critically low remaining energy will compromise the long-run performance of the network.


This illustrates the trade o. between sampling rate and classi.cation speed.

we choose to operate at a point in the design space that increases the true positive rate at the expense of being less accurate in the detection of non-conversation because the cost, from a user s perspective, of being wrong when detecting a conversation is larger than the cost of being wrong when detecting non-conversation.


Direction tracking has been done in [1] by using set of tones and maintaining extensive network status information at each node in the network.

this is unrealistic in a dynamic scenario.


backoff parameters differentiation schemes) can react rapidly to the change of circumstances for optimizing throughput and transmission reliability.

while multimedia applications require specific qualities in terms of throughput, delay, and packet loss rates, the achievement of lower-layer optimization may not satisfy APP-layer QoS well.


forecast weather, road conditions, accident warnings) appears as an attractive one.

the mobility, the volatility, the limitation of the communication range of wireless communication interfaces and the massive decentralisation of devices impose new constraints regarding the design and the implementation of the services deployed on such devices, as well as on the middleware platforms hosting these services.


Also worth noting is the fact that when the system is low or medium loaded, the di.erence between calm and windy condition is negligible, as indicated in Figure 6 for less than 30 users.

when the system is heavily loaded, the delay introduced by wind e.ects can be quite signi.cant.


The cost factor works on the opposite direction if it is formulated by the number of switches used.

the Figure 9: Normalized throughput performance of the tandem queues in Figure 7.


Assuming that the transmission power is kept the same, small beam divergence results in longer transmission range and lower interference to other nodes.

a large number of transmitters also implies that the time necessary for the neighbor discoveryincreasesbecausethe nodeshaveto searchand rankmore directions.


The work in [21] uses ICMP messages to provide information about the link conditions and network environment to the layers above the network layer.

it does not define messages describing the mobility process.


Each arbitration level could be executed in one clock cycle since simple round-robin arbiters are used.

if the number of input queues per read port and/or the radix of the switch are high, the two levels may require several cycles, grouping a set of candidates in each cycle.


To evaluate the proposed network information models, this paper used a Commercial Content Distribution (CCD) application as workloads.

for more comprehensive evaluation, we are currently extending our simulations to include a broader range of realistic application models.


Obviously, this model can be easily extended to a three dimensional space.

in this paper, we focus on pairwise key establishments in the two dimensional case.


This may cause the deterioration of the channel utilization.

in E-ASAP, because the node of which the slot assignment is changed by RMA sends the updated information to its contention area, all nodes can have correct assignment information.


Once a node is covered, no weight or cost associated with dij is taken into further consideration.

in our work, a small value of dij indicates a small delay and, hence, better accuracy in metrics estimation.


IP Packet Distribution on Wireless Access Route Combining IEEE802.11/802.16 Links for Improvement of Application Performance Yasuhisa Takizawa Faculty of Environmental and Urban Engineering, Kansai University Osaka, Japan takizawa@kansai-u.ac.jp ABSTRACT The expansion and diversi.cation of wireless communication are proceeding rapidly with the di.usion of cellular phones, WiFi and WiMAX.

concern is increasing that the growth of wireless systems will exhaust .nite wireless resources.


Notice that in [5, 10] an ~2((d2/log d) log n) lower bound is proved.

in what follows, we describe the protocol MULTI-BROAD-A(n,d): It assumes that nodes know the maximum in-degree d and 260 the network size n. when d and/or n are not known, we can adopt the same dovetail technique introduced in [10].


This kind of network has some attractive features that have promoted their use, such as the absence of wires and the use of low-cost devices.

wSNs also have important shortcomings that a.ect some features like energy cost and quality of service.


we only iden- UDP Applications (Table IX) tify Napster and Gnutella traffic on the most commonly used ports.


On the one hand, clients can be assigned equally to neighbouring APs operating on di.erent channels resulting in better system performance.

even when neighbouring APs operate on the same channel, it makes sense to balance the tra.c of the associated clients among them in case of a slow backbone connection (e.g.


Therefore, irrespective of channel width, modulation 24 OFDM coding (24 Mbps at 20 MHz using 16-QAM, 1/2 rate encoder) carries the same 96 data bits per symbol.

since symbol lengths are different across channel widths, modulation 24 coding scheme gives 6 Mbps at 5 MHz, 12 Mbps at 10 MHz, 24 Mbps at 20 MHz, and 48 Mbps at 40 MHz.


GEMS [19] provides a timing model and network model on top of Simics, making it one of the most widely used simulators in the architecture community today.

since it runs on top of Simics, it is (obviously) even slower and less scalable, and unsuitable for fast design space exploration.


Many heuristic approaches have been proposed to cope with the scheduling problem in WiMAX mesh networks.

their performances highly depend on the network topology and the bandwidth requests and none of them achieves optimal for all cases.


This yields an optimal centralized scheduler.

since v can be as large as n2 (where n is the number of router ports), this is not altogether practical.


When using .=0.1and f=0.1, D= 1 is the minimum delay such that FW (D) >..


This proves that the basic idea of concurrent black burst transmissions is working.

our experiments suffered from the nature of the low power, spread spectrum transmitters used, which transmit their signals very well hidden in the noise floor.


Consequently, many researchers have focused their research on developing energy efficient communication protocols for wireless sensor networks.

in dealing with energy efficient communication protocols, the noise condition of the wireless channels among the sensor nodes is ignored in most of the previously published literatures.


Note: To calculate the T imesIn factor each router has to conjecture on the size of the rest of the routers on the path.

given that we do not know what amount of memory each router will have, or if backbone routers, for instance, will have bigger caches than edge-network routers, we make the following simplifying assumption.


Our click detection algorithm presented above enables operators to estimate session length and abandonment rate using only HTTP traces collected from the network.

session length and abandonment rate are relatively coarse engagement metrics because they are also in.uenced by user interest, which is a confounding factor that is dif.cult to measure for both network and website operators.


Given the realtime capability of the underlying simulation engine (QualNet or equivalence), we can replace anyLN(any connected subgraph of a reasonable size in the entire network topology) with an equivalent SVNrunning on the simulation engine at real time, or vice versa.

for wireless networks, due to node mobility and wireless signal propagation, two neighboring SVNs may have to exchange environmental discrete simulation events(inparticular,node mobility and wireless signal propagation events) to deliver correct simulation results.


Interestingly, in the presence of a slow initial seed, the protocol mechanisms lead the fast leechers to contribute to the download of all other peers, fast or slow, thereby improving performance.

whenever feasible, one should engineer adequate initial seed capacity in order to allow fast leechers to achieve optimal performance.


As we require, for example, O(n log3 n) random walks executed in parallel, where each random walk traverses O(log4 n) nodes, we get that in the worst case a single node needs to handle O(n log3 n) tokens given that all random walks traversed this node.

when the graph is a good expander, we argue that the probability of such an event is rather negligible.


Users have some means for limiting PII leakage via what information they provide to the OSN or browser/proxy techniques to control use of the Referer header and cookies.

these controls may break accesses to other sites or not completely eliminate PII leakage via OSNs.


It is possible for the policy node to decide that none of those actions should proceed at the moment.

a policy node sometimes need to consider the action nodes that might be executed in the future, because it might be a better choice to execute them rather than currently ready nodes.


(k0) In the second case, because ß> 0, 0 = .j0,i < 1, we can obtain the same inequality.

for all k, clearly we also have that (k) * ** ui(ai ,s-i) = ui(si ,s-i).


FC-BB-5 speci.es a con.guration with multiple FCFs, which solves the scalability problem.

such a system leads to high cost and management complexity.


The hetnet approach in theory provides O(N) growth in capacity for N small cells.

this has caveats in practice, especially for outdoor metro/micro cells due to co-channel interference across the hetnet tiers.


In current usage, all DNS transactions involve asking one question.

the DNS protocol supports multiple questions per request.


)r. (9) Knowing that the most e.cient route a message can take from a node to the BS is the one along the direction axis with equidistant hops of distances dchar, the minimum energy rate Plink-min that can be achieved is given as: ' Plink-min(D)= Kopt · Prelay(dchar), (10) where D is the total distance to the BS.

in a randomly deployed sensor network, the power consumed in a link of distance D ' = D with intervening nodes deviating from the direction axis can be formulated as: K ' Plink(D )= K Prelay(ci · dchar).


13 should be ascribed to the virtual environment).

adopting the naive approach of migrating routers in the random order, forwarding loops arose at step 6 and are only solved at step 34.


We will see later that this phase has to be run on a subset of nodes (the Surveyors).

predicting relative errors using the Kalman .lter (section 2.1), which occurs on every node, only implies a few simple scalar operations and is negligible in terms of required computing power.


As the number of hubs per client increases we .nd that due to the increased path diversity the average delay di.erence increases.

even with3 hubs per client the performance of LEQ routing is signi.cantly better than OSPF.


Because feature information is represented by a much smaller amount of data, it is possible to actually transmit the feature information of the received frame sequence back to the sender, which can then compare it to that of the original video and evaluate its quality.

such a solution is still inadequate for our purpose, not only because it requires modifying the video client to perform feature extraction, but more important because we need to estimate the quality of video transmission over multiple paths in parallel.


Unfortunately, all client tra.c on the mesh was encrypted, and hence, it was not 0.7 feasible for us to do any application-level tra.c analysis.

the MAC-level headers of all wireless frames were available through this method.


Their focus was similar to ours in terms of .ow interactions, and they extracted signi.cant communication patterns.

temporal information, such as the order of consecutive .ows, was missed because their approach partitions .ows into time windows to search related .ows.


The idea is to bring stability into the changes in neighbor sets and ultimately the routes.

this will introduce a latency which may hurt the on-demand properties of the protocol.


Recently, a few algorithms have been introduced to address the problem.

solving the problem to optimality for general wireless interference models is known to be NP-hard.


The volatile state has a scope limited to the composition, it is thread safe and represents a mechanism for classi.cation that can be triggered by in kernel functions.

the persistent state (one per socket, or group of sockets) en ables stateful computations (see Section 7.4).


3.1.2 Modi.ed Wireless Model The original model for wireless communications in the INET framework did not support multiple wireless interfaces per client node.

to test for instance the multi-homing capability of the LISP mobile node architecture, we modi.ed the existing wireless model to support multiple interfaces.


None of the related work cited support this feature as there was no need for it.

the notions of transactions and sessions are integral to SIP, so this feature is an essential requirement for SIP classification.


In the case where k =1, the d-hop k-datacoveragequeryis similar to .nding a d-hop dominating set in wireless ad hoc networks[2];however,thereare substantialdi.erencesamong the two problems.

[2] proposed a heuristic that can handle only the maximization of one dimension, i.e., of the sensor ID.DaCoNhandlesdata ofthe sensor andtherefore it is able to handle multidimensional values of di.erent semantics (maximization, minimization or combination of them, etc).


But the dominant protocols particularly TCP support a single path access only.

new protocols like the StreamControlTransportProtocol(SCTP)[1] comply with the requirements of multi-homing.


The relative skew, thus, can be expressed as s(t)= o(t)/t.

due to jitters, each sampling point (except the .rst one I1 since we arti.cially .x it and view it as the starting point) actually further exhibits a tiny shift, h, compared with the ideally stable sampling point.


This is manifested by the reducing gap between the two curves, demonstrating the reduced power of recalibrating the NetFlow estimate by the noisy SNMP link loads.

we .nd that once the SNMP measurement is not extremely distorted (e.g., a = 0.05), our scheme always has an observable improvement in comparison to raw Net-Flow traf.c matrix (the horizontal line in Figure 3(b)).


Three mobilitymodelswereused,RandomWaypoint,ShortestPathMap BasedMovement, andMap BasedMovement.

only the results with the Map Based Movement model willbepresented, since the results obtained withRandom Waypoint and Shortest Path Map Based Movement were rather similar.


There are other such con.gurations, for example, complete subgraphs (cliques), odd cycles, etc.

a complete characterization of these forbidden subgraphs is not possible.6 the key point is to note that the ILP constraints in Table 2 are both necessary and su.cient for any network graph.


Location updates should be processed with high priority.


8 shows that each of the satellites, on average, requires less multiplications using QuickSync.

the gains vary considerably among those satellites.


A simplest method for obtaining state from a large scale sensor network is to .ood the query for the named data to the whole network and get responses from relevant sources.

.ooding in large-scale wireless networks is a very expensive operation and in general needs O(N) radio transmissions, where N is the number of nodes in the network.


It turns out that the larger k is, the better delivery performance R-EC achieves.

it should also be mentioned that with a larger k value, more tra.c overhead will be experienced with the R-EC scheme.


But to explain why a tuple never appeared in a certain time interval, we must potentially inspect the log for the entire interval, which can be expensive.

it should be possible to avoid most of this overhead with a suitable index, which we are currently developing.


While a1,2 and a2,2 varied over time, we did not observe much change in the error statistics.

it is still not conclusive whether a window size of 20 is suitable for all cases.


For example, in IEEE 802.11b (operates in the unlicensed ISM band at 2.4 GHz) though there are 14 channels available, due to inter-channel interference, only 3 of them (1, 6 and 11) can be considered to be non-overlapping [9].

often a denser deployment of AP s is required for increasing the capacity and coverage of the W LAN s. Thus when more and more AP s are installed in a relatively small geographic area, the coverage areas of the AP s are likely to overlap causing the cochannel interference.


Non-crypto hash functions like City-Hash show noticeably better performance than cryptographic ones such as MD5 [3].

a security risk is involved in using a non-crypto hash because a lack of collision resistance makes a router vulnerable to hash .ooding attacks.


As a result, TCP has evolved over time with new congestion control algorithms such as support for generalized AIMD, background .ows, and multipath.

explicit congestion control algorithms have been shown to be more ef.cient.


The true positives rate increases from 51.25 to 78.13 percent, which means that the second con.guration correctly detects movement better than the .rst con.guration.

this improvement comes with the cost of a drop of the true negatives rate.


For example, the per- formance of the -optimal algorithm becomes close to that of our algorithm when = 1.

in that case, the average complexity of our algorithm is about 10% of that of the -optimal algorithm.


The aggregate throughput is also affected by the adjacent channels being used by the two radios for the same location.

the throughput remains fairly constant for a considerable amount of time (in the order of a few hours).


Proactive uses reserved bits in the TCP header for copied segments which can trigger middleboxes that discard packets with non-compliant TCP .ags.

in our experience, possibly due to the widespread use of reserved bits and the position of frontend servers relative to middleboxes, we did not observe this effect in practice.


From this subsection, we conclude that fake servers cannot attract users to stay longer.

fake servers do disrupt users stay time distribution at the rank of normal server.


It is easy to understand that for the first timeslot all the leaf nodes of the input tree are eligible to be scheduled.

only a subset of the eligible nodes can actually be chosen to be scheduled for any timeslot to meet the conflict-free criterions as discussed above.


3.2 Trust-aware Routing Protocol As soon as the candidate selection procedure is done according to the above-mentioned algorithm, the source node starts sending data packets towards the destination and candidate nodes will be responsible to cooperatively forward packets to reach the destination.

it should be noticed that there may also be some nodes in the network which act as uncooperative nodes and decide to sel.shly or maliciously attack the system, for example, by dropping received data packets.


Mitigating starvation in Wireless Ad hoc Networks: Multi-channel MAC and Power Control Duc Ngoc Minh Dang Department of Computer Engineering Kyung Hee University, Korea dnmduc@khu.ac.kr  Phuong Luu Vo Department of Computer Engineering Kyung Hee University, Korea phuongvo@khu.ac.kr Choong Seon Hong Department of Computer Engineering Kyung Hee University, Korea cshong@khu.ac.kr Chi Kwang Hwang Department of Computer Engineering Kyung Hee University, Korea chikwang16@khu.ac.kr ABSTRACT The IEEE 802.11 DCF (Distributed Coordination Function) is based on CSMA/CA (Carrier Sense Multiple Access with Collision Avoidance).

the CSMA-based random access protocol can cause serious unfairness or .ow starvation.


However, information is only transferred from the object to the device [1], indicating for example the location in a store, or need to be registered in advance [3, 7].

we envision fully bidirectional communication through which the user can interact with the functionality of the object.


Itis not always the casethatQoM are known a priori, and may be user-speci.ed at run-time via a tracking query, whereupon the nodes may consequently adjust their e.ective sensing range dynamically.

even with this consideration, the main advantage of SLS, when compared to the existing approaches, is preserved.


the authors of [2] introduced other low-interference topologies which, besides preserving connectivity, are good spanners.they consider Euclidean spanners, which in general are not good at reducing multi-hop interference.


Since there is no subscriber in D3 (Group(CD)= null), RP3 will not send an IP multicast packet.

it will send the COPSS Multicast packet downstream (through B324 and B43 to RP4) according to the ST. At the same time, RP3 encapsulates the packet into an Interest using RN(CD), i.e., RP1, and forwards it according to the FIB.


Two-phase pull reduces the penalty of asymmetric communication since choice of data path is determined by lowest-latency exploratory messages, both in the source-to-sink direction.

two-phase pull still requires some level of symmetry since reinforcement messages travel reverse links.


if there are several events nearby in a speci.c area, they will attract the sink even if there is another distant event, isolated in an opposite area, which will be negatively affected.

in the minmax approach the isolated distant event is more strongly protected.


The authors of [5, 6] propose to use dual-radio mobiles/relay stations to improve the network performance.

unlike our proposal there is no cluster formation among mobiles/relay stations.


An internal NAT changes the virtual to actual and vice-versa, and the external NAT applies the standard masquerade table for the virtual IP to external IP (and port) for the connection.

this involves more processing as the translation needs to be done twice.


L3virtual networking technology in core networks has been driven primarily by the large common carriers[12].

researchers andpractitionersdo not agree whetherprotocolbased virtual networks are secure from undesirable nodes.


Based on this t, we can calculate the expected delay and observe if it violates our expected delay bound.

it may impose a large processing delay due to the computation cost if we are to calculate the delay values for all future packets.


If this is the correct solution and it has a small Euclidean distance (as in the case of high SNR), a typical sphere decoder would require at least another nt - 1 partial distance calculations to prune the rest of the tree.

geometrical pruning prunes the rest of the tree without any additional calculation.


Recently researchers have explored mechanisms that assign .ne grained spectrum blocks on the basis of traf.c demands.

most of these mechanisms, such as DSAP [7], Jello [15], SWIFT [22], WhiteFi [6] and DIMSUMnet [17] are designed for non-802.11 systems and focus on deriving elegant algorithms for spectrum allocation that are primarily evaluated using network simulations or small-scale prototype implementation on software de.ned radios.


Other works, such as Pastry [4], introduce the concept of structured overlay introducing constraints on the logical location of shared data (or indexes built on top of it).

all of these works focus on large-scale systems (i.e., thousands of peers), carrying on evaluations under typical Internet workloads and connectivity characteristics.


This property might not hold all the time due to the unreliable wireless channels.

the probability of reliable transmssion can be made quite large using mechanisms such as acknowledgement/retransmission.


1 Note that this approach parallels the architecture of Open-Flow [20] devices to some extent.

our implementation predates OpenFlow s wide availability.


If the false positive rate also goes up as ß decreases, the problem is even worse.

if the false positive rate can be kept su.ciently small (below 0.1 in this example), then there is .exibility to decrease the delay without a major increase in tra.c loss.


This is to ensure that medical data is not exposed to an unauthorized person.

it ensures that medical data sent to healthcare professionals did not originate from a malicious node.


The merit of this proposal is to minimize the accounting gap caused by both handoff and insuf.cient coverage.

its prerequisite is that reliable delivery mechanism, e.g., acknowledgement mode [16], is enabled in RAN.


In addition, one advantage is that a container terminal uses light posts, which is connected by a wired optical network as APs infrastructure, without additional cost.

the actual measurement results di.ered greatly from our expectations, and we summarize a main reason is a container terminal has major obstacles -numerous stacked and moving containers, which block and interfere with radio propagation.


In other words, when we look at each applicationinisolation, application-speci.c strategies are appealing.

when weconsideraportfolioof applicationsin aggregate, a minimalist approach mightbe abetter alternative.


If E[BL]>tr, the value of D is set to 1 so that the next time the link is in error or enterstheE state ofFig.2,thelink willbedeclared down.

if E[BL]= tr, we keep D at its initial value, which is 100 in our experiments.


The intuition behind this algorithm is the following: Ideally, during the short sequence a sample s[n] should correspond to the sample s[n + 16] due to its cyclic property.

if noise and a frequency o.set are introduced, this is no longer the case, and s[n] s[n + 16] is not a real number, as in the idealized case.


Hence, instead of mapping an FQDN to a locationdependent identi.er to an IP address with DNS, the resolution system maps the authority .eld to the public key (or 2Of course, there may be additional .elds within the authority .eld.

as they are not commonly used and not essential for the current discussion, we ignore them in the rest of this paper.


We are not aware of any study quantifying the extent and impact of bandwidth cheating.

sneaky self-bene.cial misbehavior is far from harmless.


If the attacker succeeds, u s permanent neighbors discard f .

since the permanent neighbors always overwrite the oldest CCM*-MIC .rst, the attacker needs to send multiple ANNOUNCE commands.


On-chip SRAM can provide latencies ofaround 1 - 4 nsec per operation.


However, this will also require a mechanism for detecting when partitions merge, and each ARPrequest will have to be .ooded through the entire ad hoc network (since the network is now considered to be a single link for ARPpurposes).

the proposed Weak DAD scheme behaves similar to the scheme in [3] in that both may delay duplicate detection until it becomes necessary to ensure correct behavior.


ForHSDPA,85% of thepackets havelowerdelays compared toUMTSdue to thefaster retransmission mechanism.

the other15% of thepackets have even longerdelays thanUMTS.This resultisdue to thefact thatUMTS has .xed errorrateswhichleadstomorestableperformance,while HSDPAchannel variancehas strong effect on the end-to-enddelay.


This means that motes performance are not significantly influenced by slight variation in the temperature and/or humidity.

we observed a severe performance degradation in the presence of rain or fog.


Since cognitive users are generally low power radios in comparison with PUs, they receive the primary signal as high power interference.

in this condition no modification is permitted to be exerted on the primary system.


In particular, since the quality of the original scalable stream Sin is higher than the quality of the downtranscaled stream Sout over the range [Rmin_in , Rmax_in], then it should be clear that clients with access bandwidth that falls within this range can benefit from the higher quality (original) scalable stream Sin.

clients with access bandwidth less than the original baselayer bitrate Rmin_in, can only use the down-transcaled bitstream.


We .nd that the driving speed has no obvious impact on the block loss rate.

the block loss rates of all three FM stations are signi.cantly higher than that measured in the lab, as shown in Fig.


More precisely, OSLA worsens the energy consumption with respect to the case of no prefetching, while both PP1 and PP2 reduce the consumption.

pP1 appears in some cases ineffective for latency reduction, while PP2 is always effective also from this viewpoint, and in some cases provides results quite close to the OSLA policy.


This approach termed Wi-Fi of.oading has provided some needed congestion relief to cellular networks.

in many settings, Wi-Fi networks are experiencing congestion and despite continued improvements in Wi-Fi speeds (e.g: 802.11ac), many predict need for more unlicensed spectrum to support greater number of Wi-Fi channels.


We are interested in the problem of Constrained Hierarchical Aggregate Classi.cation: Under the weight balance constraint, among 5Note that in this simple example, s1 can send the numbers of 1s and 0s picked by its children (together with itself) to achieve better consensus compared with sending the majority voting result only.

this solution cannot work for the decision aggregation problem where only clustering results are available.


We also compare with WiT Maximum Available Power (W) 5 2000M based on their speci.cation sheet.

we cannot com pare with the UW prototype since [29, 30] do not provide informa tion about how they address orientation for phone charging.9 4 We note that since the compared schemes do not support the same distance, we could not .x one distance and compare all schemes.


The TUs are the nodes selected by the AP (listed in AP s CTS) and tries to utilize the sender s transmission time by sending their packets, known as the cached data (CDATA), to their helpers.

even if a node is selected as a TU, it may not send its packet.


Hence, his principle is to retry su.cient number of times to read the clock of another process with a given precision with probability as close as desired.

there are some fundamental limitations to the accuracy that can be achieved.


Due to the limited size, a message will be discarded from the bu.er of a place, after a certain time duration b, termed as bu.er time 2 .

due to sequential agent arrival pattern, we assume that the agents can store a particular message for their full life time, after they have got the message.


Overlay networks allow third parties to replace Internet routing with new, from-scratch implementations of routing functionality that run at the application layer.

overlay networks simply move the problem from the network to the application layer where third parties have control: implementing or updating an overlay routing protocol still requires a complete protocol design and implementation, and requires access to the overlay nodes.


If devices probe very infrequently, they might miss many of their contacts.

frequent contact probing might be energy ine.cient.


A trivial strategy to always provide a .ow with the maximum possible QoE is to statically assign a bandwidth slice equal to the maximum video bitrate.

this leads to underutilization in presence of external tra.c limitations, such as bottlenecks or CPU overload.


The .gures show that, for small documents, TLS upgrade contributes a major share of the retrieval latency with attestation-enhanced TLS.

for long documents, the download stage dominates the other stages.


Note that it has already been shown that the Max-Weight is throughput optimal for time-varying channels [23] and joint scheduling and congestion control algorithms based on the optimization decomp osition, e.g., [2], are utility optimal by selecting the schedules over time, both of which essentially track the channel conditions quickly.

a similar channel adaptation for CSMA algorithms may not be feasible for the following two reasons.


AEDP can therefore .lter the interference from the communication link and effectively reduce the false wake-ups to achieve a low duty cycle.

as the link RSSI decreases, the performance of AEDP degrades.


The trace follows all the .uctuations of the video tra.c used for the experiment.

the legacy multicast mechanism, using the default PHY transmission mode, is not able to send as much throughput and gets a constant goodput of about 800kbps9 .


If a node A fails to hear enough HELLO responses from its neighbor node B after some time, A infers that the link between A and B is down.

dTLSR operatesinaDTN,where nodes are assumed to have long term storage they can use for store-and-forward operationson messageseven when some links aredown.


an unresponsive protocol, like UDP, has no such backo.


The algorithms employ equi-sized cuts so as to identify the matching child via simple indexing into the child pointer array (Section 2.1).

the large variation in the rule-space den sity causes a considerable increase in the tree size.


We believe that when back bone resources are few, they should be shared fairly between users, regardless of their access link bandwidth.

when backbone resources are su.cient, they should be shared according to the access link bandwidth.


Note that the TTL-limited and tailgatingprobepackets mostly obtainpacketdelay and delay variation, whereasthepacketpairand train mostly obtain packet dispersion.

tRIO uses packet pairstoobtaindelayvariationfor computing asymmetric capacity of a round-trip path and does not overwhelm the bottleneck link.


Examples of intermediate nodes with split TCP connections are performance enhancing proxies (PEPs) [20] such as PEPsal [21].

split connections violate the end-to-end semantics of TCP.


A middlebox might modify sequence numbers in both the header and SACK blocks, but not understand the LO option.

if the sender places a SACK block in the extended option space, such middleboxes will not see it, and so cannot correct the selective acknowledgment numbers.


As depicted in Figure 2 the child transmits an activation frame immediately after receiving the potential parent s beacon message.

the parent switches to receive mode and polls the channel right after sending its beacon.


When the network load is low, carrying as much flow as possible will satisfy all (or most) deadlines.

as the network load increases, finishing more requests on time requires carefully spreading traffic across available paths and time.


5.1 Linear Predictors Moving Average (MA): Given a time series X,the onestep n-order MA (n-MA)predictor is: i X 1 Xi+1 = Xk n k=i-n+1 where Xi is the predicted value and Xi is the actual (observed) value at time i.If n is too small, the predictor cannot smooth out the noise in the underlying measurements.

if n is too large the predictor cannot aptly adapt to non-stationarities (e.g., level shifts due to load variations or routing changes).


One point examined by this paper is whether better performance is achieved from precomput ing alternative paths, such as is done in AOMDV, or by far better than AODV with 4.2 route searches per connec tion.

lBSP only needs 1.09 route searches per connection.


With both prediction windows, MLP neural network made predictions better than moving average but worse than exponential smoothing.

in practice, it is importance to notice that when incorporating the delay prediction mechanism with proactive routing, the prediction window should be always greater than one.


@chalmers.se ferrari@tik.ee.ethz.ch zimmerling@tik.ee.ethz.ch ABSTRACT An important building block for low-power wireless systems is to e.ciently share and process data among all devices in a network.

current approaches typically split such all-to-all interactions into sequential collection, processing, and dissemination phases, thus handling them ine.ciently.


For example, if SDRAM with 16-bit data bus is set to a BL8 mode, it always generates 16 bytes per read/write.

applications or cores request various data lengths to SDRAM.


When a data UT becomes active, it also needs to send a reservation request to the BS via a mini-slot using the random access method in Section 3.4.

data UTs do not contend for mini-slots in reservation slots until instructed by the BS that the reservation slots are open for data UT access.


Here as well the delays intro duced by the uplink buffer dominate in both user talks and user listens parts.

with combined upload and download ac tivity, the user listens is slightly more degraded than with only upload activity.


FortheN810platform wefocus onPSM savings as network activity is the major power consumer and S3 mode does not o.er much additional savings.

for T60 we focus only onS3 modeasPSM alonedoesnot o.erany worthwhile power savings.


A number of mechanisms has been designed in the literature (e.g., [6, 22, 24]) for soliciting the truthful cost declaration from sel.sh agents so that a certain optimal routing structure could be built to connect the source node and destination node(s).

several results (e.g., [9,11,19,25]) concentrated on ensuring that intermediate nodes will indeed forward the data packets.


Finally, we show how we used our platform to implement and deploy an application which was used by over 350,000 users creating more than 500,000 messages.

previous work [12] struggles to synchronize more than 10,000 messages due to very high false positive rates.


A signi.cant amount of research has been devoted to power control and capacity analysis in recent years.

there is still limited knowledgeregardinghowtransmittingpower e.ects network capacity.


Typically they are proved by taking adversarial control of message delay jitters and/or clock drifts.

jitters are random in nature and clock drift does not vary arbitrarily, at least not arbitrarily quickly.


In [18], the authors also consider the problem of minimizing the number of active nodes, which providing a desired coverage.

our work differs from [18] in two main aspects.


Second, It is widely recognized that the interactivity through the free view selection is the key feature of 3D video applications.

the feedback of user view does not play a central role in the control of media transmission.


latency in MIPv4-NEMO is an increasing function of the distance.

in our test-bed, even in distance 6, the hando.


Vibrations or rotations, where the movement is very small compared to the size of the sensor node, we consider to be micro movements that may need other approaches than what Sensei-UU currently provides.

that discussion is out of scope of this paper as the focus of mobility in Sensei-UU is on macro mobility.


Figure 2: Example of a safety violation DCN operators could conceivably circumvent the problems that stem from running multiple applications by developing a single application that performs all functions, e.g., combining TE, .rmware upgrade, and failure mitigation.

this monolithic application would be highly complex, and worse, it would need to be extended repeatedly as new needs arise.


Addressing the .rst bene.t, we observe in Figure 9 that, when keeping the same MBL, the lower overhead of DVDE/SPAV allows a higher transmission power to be used by each vehicle in the scenarios.

in Figure 10 we show results when adapting the MBL so that similar transmission powers are obtained.


In general, it is assumed that the attack surfaces are the same for both the attackers and the defenders.

it may not be true if the defenders are able to introduce pro-active con.gurations in the enterprise networks.


But this needs a lot of computation efforts and communication bandwidth to maintain the accurate routing tables.

the reactive (or on demand) routing protocols, such as DSR and AODV, try to find a route to the destination only when it is necessary.


As there is no need for route discovery and establishment, geographical routing is highly scalable and attractive for dynamic and mobile networks.

the forwarding decision at each hop along the routing path tends to be locally optimal due to the greedy nature of these protocols.


It is worth mentioning that the same problem for undirected graph was solved in [20] with the same order of computational complexity.

focus of this paper is on the directed graph which is ignored in [20].


In both protocols, the source node copies the packet to all encountered nodes.

while in the unrestricted multi-copy protocol an infected node can transmit the packet to any susceptible node, in the two-hop multiple-copy protocol an infected node can transmit the packet to the destination node only.


However, the role of IA vanishes in such scenarios, where AP cooperation/processing handles all the interference between APs.

even if APs are allowed to cooperate, the UDI problem (being speci.c to clients) will continue to pose a challenge for FD systems.


Figure 10 confirms that multi-channel multi-path CAMRA-RLB and CAMRA (max redundancy) schemes are able to mitigate the impact of frame losses, caused by interference produced by cross traffic.

cAMRA-RLB experiences lower system load (Figure 11), because the multi-path redundancy is applied by exploiting explicit feedbacks on the network conditions.


with the soaring of the number of network users since the birth of worldwide networks and the appearance of new bandwidth-demanding applications (like video for instance), demand for resource in communication networks has been growing exponentially.


However, since both methods broadcast packets or location information in entire network, they are not scalable.

our proposed method has high scalability be- cause our proposed method divides the set of routers into several level 1 groups and manages the location information of mobile host in each group independent of other level 1 groups.


That is, if the frequency o.set is zero, the desired signalis sampled atinteger fs anddoes not experience any cross-band interference.

the performance ofCSCis sensitivetothefrequency o.set.


Our testbed experiment results indicate that Flash-I, without any neighborhood contention, will complete much more quickly than a .ood using traditional CSMA.

by removing MAC delay and CCA, Flash-I will also likely experience more packet collisions and the .ood may not reach all nodes.


Further, it is still worth investigating those that do not erase evidence.

if there exists a security exploit in Windows, then one user can comprise every Internet-accessible Windows machine.


Because of the peculiarity of the situation, such a misconfiguration is not frequent.

the cases reported in our logs clearly show how detrimental it is in terms of network performance.


MASERATI and LoDASH show similar results in terms of the stability of video streaming because both of two algorithms re.ect the average condition of the speci.c location.

mASERATI outperforms (11% and 12% for the 3G and 4G LTE networks, respectively) LoDASH in terms of the playout rate since MASERATI further considers additional important factors for predicting the available bandwidth such as time, humidity, and moving speed.


BALUN cancellation was shown to yield 40 45 dB of cancellation; this coupled with 30 dB cancellation using digital cancellation provided the desired level of self-interference suppressionforWiFisignals.


In this situation, the MN should perform route optimization.

if the MN stays just a short period of time in the visited E-ER, the most efficient way connecting to the server is through the MN s HA.


The process procedure of two-stage packet enqueueing process in this enqueueing module is same as the process procedure of two-stage packet enqueueing process with a DQB allocation.

there exist differences in queueing buffer allocation between the DQB allocation and the OQB allocation; this causes that the two-stage packet enqueueing process has different process target with the different queueing buffer allocation.


With the availability of the SVC extension of the H.264 codec [1], [2], it is now possible to add or remove enhancement layers from the video stream so that its transmission rate can be adapted on the fly.

what is still missing to integrate SVC in mobile networks is a mechanism to detect changing channel conditions and decide on the appropriate transmission rate such that the exact number of layers to be added or removed can be determined.


When p4 is large, both TailTheft and TailEnder achieve an energy saving as high as nearly 30%.

if p4 is small, the energy saving of TailEnder comes to a large negative value, which means TailEnder increases the energy consumption heavily.


Compared to half-duplex mode, full-duplex has the ability to increase throughput and decrease delay.

surrounding surfaces can reflect and scatter transmitted signals in the visible light spectrum to create multipath effects which can hinder full-duplex communication.


The middleware presented in this work is dedicated to be used with Wi.bot mobile robots [20].

it can be easily adjusted in order to be used with other robotic platforms.


BOTNET VALIDATION Ideally, the AutoRE identi.cation results should be validated by comparing them against known URL signatures and botnet host identities.

in the absence of such information, our validation is based on the following three methods (Figure 8 illustrates the overall evaluation setup): We .rst study the quality of the extracted URL signatures.


[5] have designed a framework to manage the Ad-hoc networks with a policy-based administration.

they do not describe how to deploy the the system in organizational networks.


Our early useofPlanetLabgenerated tra.cat aboutdoubleourcurrent rateanddrewthreecomplaints fromtargets.


On the other hand, various traditional daily applications (e.g., emails and instant messaging) and recently popular applications in smartphones (e.g., Dropbox, Twitter, Flickr and Facebook) require a large amount of data transmissions.

a large fraction (nearly 60% [1]) of the energy consumed for data communication in cellular networks, including GSM and 3G, is wasted in the Tail Time [1, 4], i.e., the high-power state after the completion of a transmission.


As illustrated in Fig.2, a packet is forwarded by wireless communication through vehicles A, B to the static node S. When the packet reaches S, the best path to deliver it is northward.

there are no vehicles within communication range along this road at that time.


proposed a sequential localization algorithm based on trilateration graphs under noisy distance measurements.

their algorithm is effective only in relatively dense networks, while our Sweeps algorithm localizes a much larger class of network.


there is a well-known tradeoff between the capacity and the coverage area in cellular communications [l].


Usually communication protocols are evaluated with typical network metrics as goodput, latency, jitter, and in case of wireless networks, channel load and collisions.

these metrics are not adequate to assess the impact of communication on life saving applications, i.e., a high throughput might not be an indicator that a lot of accidents can be avoided.


It is assumed that, during the training process, both sensors and actor measure time in slots, which are equal in both lengths and phase.

every time a sensor receives a transmission from the actor, it can re-phase its own slot.


(In fact, inter-MANET traffic might also include traffic between two different MANET domains, or between a MANET domain and another type of external network, such as a local wired LAN.

this paper assumes for simplicity that all inter-MANET traffic is traffic between a MANET and the Internet).


Thus, in the asymmetric path setting, an adversary on the reverse path can arbitrarily increase the source s estimate of the failure rate on the forward path by dropping acks.

in the secure sketch protocol only a single authenticated report packet is sent on the reverse path, and so if it does not arrive Alice can deduce that the problem is in the reverse rather than the forward path (unless the forward path is completely blocked and Bob is not even aware of Alice s  Secure Sampling Secure Sym Asym Sketching Storage/Communication7 90KB 240 840KB 0.2 0.6KB Peer setting .


routes regardless of the future development.

an evaluation that takes into account all the dynamics and interrelations is signi.cantly beyond the scope of this paper our primary aim is to give an indication of the achievable bene.ts.


Furthermore, before being executed in the underlying processing engine, the user code is formally veri.ed against the strongly typed language and enforced by the functional model.

it is worth mentioning that middlebox programmers are not required to know gory details of the underlying data plane implementation as such details are fully hidden behind the set of instructions exposed by the functional language.


Each super peer maintains the information of its sub peers and the contents search is only traversed through super peers.

both super peer based method [11] and group P2P [12] have a high update overhead to maintain the network.


In our previous work [7] and [8], it has been shown that better performance in terms of throughput, packet loss, and delay can be achieved by supporting multi-hop-relaying functionality.

using a multi-hop relay system requires more radio resources to transmit data through different hops.


Owing to the uneven development of the economy and historical reasons, the Internet development in the Asia-Paci.c region was not as early as that of the North America region.

allocation history after 2003 in APNIC showed that the speed of Internet implementation dramatically increased.


This can be done by giving fewer credits if the same set of peers have many transactions with each other, especially if the .les comprise a small set.

care must be taken not to punish the peers who happen to perform many transactions with peers with whom they share common interests.


The commonly used caching scheme is the Least Recently Used (LRU) algorithm where the least recently used data is discarded when new data is received.

if the number of forwarded chunks exceeds the CS capacity, the frequent cache updates of CS will decrease how much information can be used from stored chunks [3].


The .gure shows that the JS-test covers signi.cantly more /24s in many pre.xes assigned by ARIN, and slightly more /24s in some pre.xes assigned by RIPE or several RIRs (the latter mainly in the old class B space).

the FAtest covers signi.cantly more /24s in pre.xes assigned by APNIC and a few more /24s in some pre.xes assigned by LACNIC.


MOTIVATION FOR THE WORK Historically, wireless communications have been governed by a .xed spectrum assignment.

the spectrum resources are becoming scarce and increasingly precious.


Considering probability laws instead of raw data allows scaling of the studied networks both in time span and number of nodes.

the realism achieved with these datasets is questionable.


As the offered load grows, the gap between COPE and CAPA continues to increase because it is hard to meet the requirement of spatial reuse due to heavy concurrent transmission.

cAPA provides greater throughput gains across a wide range of offered load, especially when the offered load is high, due to the fact that it can achieve good trade-off between coding opportunities and concurrent transmissions.


The false positive condition is satis.ed because we have v .

{0, 1}U and IvI2 =aT , 22aßT so with probability 1 -d, V = IwI< .The false a+ß negative condition is satis.ed because we have the number of drops is r> ßT (and packets dropped are unique so they 6CCF s [9] sketch can attain better success probability by using the median of estimates obtained from M independent sketches, for some number M. this increases the storage and update time by a factor of M.Also note that [9] can show, using 4-universal hashing and Chebyshev s inequality, that the number of bins relates to the error prob ability as N = O( 1 d ).


Previous solutions for energy saving using cluster-heads/local base stations focus on how to reduce the quantity of the data transmitted to the sink, but do not take the quality of the data in account.

our solution ensures data quality by employing similarity along with correlation for exploiting spatial and temporal correlation in sensor data.


The latter will also be forwarded to the remote party during IUT execution.

nFC negotiation of SDP parameters limits the UE2 s interaction with the remote party to a single message exchange.


We have mentioned that this requires the stream identi.er (label) and offset to be carried inside the transport header as well as the store-me bits and feedback about resource usage.

a more fundamental issue regarding accessing the stream buffers is that the source-driven logic of the transport protocols such as TCP does not match the receiver driven pattern of accessing a cache or in this case byte stream buffer.


The general MAC structure of the investigated system is thereby based on IEEE 802.16a.

concerning the Physical Layer there is an important difference.


We can see that AODV andOLSR,tend to createrouteswith aminimumnumber of hops.

as it has already been pointed out,theshortestpathisnot necessarythebest.


DSR's per- formance degrades as the route length increases and the prob- ability of successful delivery from the first attempt drops to al- most zero for route lengths greater than 5.

for recovery depths greater than 1, WAR exhibits a different behavior: it improves its performance as the route length in- creases.


As mentioned earlier, to compare the throughput of DMAC, MMAC and 0 0 500 1000 Sendi 1500 ng Rate (Kbps) 2000 2500 Figure 11: Average aggregate throughput of DMAC/MMAC over multiple simulations using random topologies and routes 802.11, we used identical routes in our previous simulations.

this is unfair for protocols that use directional antennas because routes suitable for 802.11 may be suboptimal for DMAC and MMAC.


Thus the links predicted by the GS remain stable most of the time.

as the velocities increase there are many link breakages leading to the GS sending an increased number of updates.


We observed that Type A calls were responsible for the surge in the average API delays during high load.

even Type B calls show greater variation with load for Hugged as compared to Holiday Cheers.


FINDING A NASH EQUILIBRIUM Nash proved that any strategic game has a mixed Nash equilibrium [12].

there are strategic games that have no pure strategy Nash equilibrium.


LTE promises a richer, more immersive environment that significantly increases peak data rates and spectral efficiency.

the plethora of mobile multimedia services poses the need for the deployment of a resource economic and efficient scheme.


RDMA achieved a peak bandwidth of 924 MB/s while TCP only achieved 699 MB/s.

tCP performs better for small messages (8192 bytes or smaller).


From our earlier work [21], under heterogeneous setting, the IMR of the node pairs .12 (and .21 ) for two di.erent classes(r1 and r2)can be computed as follows: 8.min(r1,r2)v .12 = .21 .

(2) pL2 .11 and .22 (beingthe homogeneous case) can be computed from Eq.


This is because the baseline takes an n-point IFFT and, hence, has to ensure that none of the n - 1 noise spikes exceeds the correct spike that corresponds to the proper alignment.

quickSync takes Figure 7 Gain of QuickSync over the FFT-based algorithm in number of multiplications.


Today s M2M Communication Networks Today we could use the industry standard (i.e., IEEE 802.1Q Virtual LAN [2]) for virtual networking as a M2M communication solution that can accommodate grid applications.

consider the following deployment scenario of a million scale communication-enabled measurement and monitoring end devices; a relatively-small number (e.g., 100~1000) of network switches; thus, a physical port (called port) in a switch must be logically (not physically) connected to more than one end device (i.e., multiple meters per port via a data concentrator); also, a device must subscribe to more than one VLAN.


For example, the calculation of the maximum value of the temperature observed over a region does not demand excessive computation power.

in habitat monitoring applications, the identification of a bird based on the recorded audio waveform requires the computation of the correlation of the spectrogram of the input waveform with a prestored spectrogram.


This severely wastes network bandwidth, affects userperceived experience, and thus causes provider revenue loss [11].

today s datacenter transport protocols such as TCP, given their Internet origins, are oblivious to such .ow deadlines which have already caused problems.


we are not given enough information to uniquely determine the path, and so we must guess some things.


At those locations, the received signal can still be decoded by EPC Gen 2 and QuarkNet because of the SNR bene.t of Miller-4 encoding.

it can be seen that this is a small fraction of the overall range of the reader.


It shows STD only works in .at fading channel and its performance signi.cantly degrades in medium level fading channel.

fSA achieves over 97% detection accuracy even under severe fading.


Therefore, it is important that the detector requires reasonable computational resources in terms of memory, processing time, and disk space.


The two /16 networks monitored by sensor III and IV, consist of some darknet areas and used areas in a same fashion with the sensor I.

the sensor II is monitoring /16 darknet IP addresses that are fully unused.


This is consequence of the fact that increasing the density will not change very much the position of the candidates chosen by the c2 case.

the probabilities change significantly for the c8 case.


However, these algorithms have not addressed the multicast problem within the traffic engineering prospective; thus one can hardly achieve the required performance to offer these applications in WMNs.

some recent studies support multicast communication using network coding [19], where all links in the network can be utilised, instead of a tree.


In fact, there is another delay between the time when incidents take place and the time when users experience problems.

the time when users experience the incidents is not an accurate timestamp, as we have discussed in Section 3.2.3.


is employed for all transmissions for ease of exposition.

if guaranteeing agivensecrecy rateisthegoal,separate thresholds for each of the eavesdropper and receiver can be employed, and identical scaling results can be obtained.


As there are 3 non-interfering channels in IEEE 802.11b/g, implementing directional antennasinIEEE802.11b/g based wireless mesh networks canfurtherincrease throughputby combining spatial separation and frequency separation.

in these VMNs, vehicle nodes have to perform hando.


We envisage network service providers will increasingly adopt NFV to provide network resident functionality, not only for reducing CAPEX but also for o.ering more .exibility to customers who would like customized processing of their packets.

managing such a network of dynamically placed functions can be much more complex.


The performance of the services will be crucial to ensure that the users remain loyal to the service, and that the user group grows.

it is a challenge to monitor the individual service perception for a particular user, in a centralized way [1].


In this perspective, taking advantage of the fact that cellular operators usually possess an important ADSL or cable infrastructure for wired services, the development of femtocell solutions has become very popular.

while femtocells can be an excellent solution in zones with poor coverage, their extensive use in areas with a high density of mobile users leads to serious interference problems that are yet to be solved.


Such topology and reachability dissemination may at .rst appear to be straight-forward as similar functions have been implemented in IP routing protocols.

because we implement NLSR using NDN Interest and Data packets, the design must shift away from the familiar concepts of IP addresses and IP data pushing (i.e., any node can simply send any packet to any other node).


TLS Handshake delay cost: Webpage load time has been an active area of research [8, 5, 6, 15, 11]; understanding the exact cause(s) of the in.ation noted above is quite complex and out of scope for this work.

it is still interesting to understand whether the overall page latency is primarily a.ected by network latency or by protocol overhead.


When these two ARs belong to the same administrative domain there are not many things that can be done to prevent the administrative domain from being aware of the movement of a single MN inside its own network.

when the two ARs belong to different administrative domains there is no reason for the pAR to know which the nAR is and the opposite.


Similar to accept completions, send completions (for non-pipelined HTTP requests) are largely super.uous because subsequent receive completions on a DTI can double as implicit send completion events.

(send completions are useful for managing the userver .le cache use count.)


is di.cult to deploy a large number of sensors such as disaster sites, planet and pollute areas, sensor nodes are deployed sparsely, and thus, su.cient sensing and data transfer cannot be achieved.

with the development of robotics technology in recent years, there has been many studies on sensors with a moving facility (mobile sensors) [2, 4].


Not surprisingly, due to the use of MI in the low-load region, VCP converges exponentially fast to high utilization.

vCP s convergence time to fairness is similar to other AIMD-based protocols, such as TCP+AQM.


Exponential Chase Algorithm The adaptive time modeling technique described in Section 3.3.1 enables a sender to make precise predictions for rendezvousing with a receiver.

it does not guarantee that a sender can model a receiver time perfectly accurately; the actual receiver clock rate and the receiver clock rate modeled by the sender may still be slightly different.


In Compound TCP, the loss window size is increased until a packet loss occurs.

compound TCP with the scheme proposed in [2], the sending-out window size is reduced when ACK packets are dropped.


While a similar protocol was known before, it only applied to the simple bandwidth allocation problem, and its stability and convergence time was not understood.

our protocols also apply to the more general case of Leontief utilities, where each user may place a di.erent requirement on each resource.


15http://www.insidefacebook.com/2009/01/23/  in far-off regions may be attributed to a number of hard-to-measure factors, such as social and technological development.

one OSN architecture-related reason can be the signi.cant roundtrip latencies experienced whilst contacting Facebook from regions far away from the U.S.


In this case, a BSS with a larger number of associated MSs should have a higher aggregated throughput.

this type of BSSs may be located in hotspot areas, and experience higher interference and have lower throughput.


Due to eliminate packet loss the mechanisms recovers lost packets and restricts the throughput to avoid the losses.

for real-time video streaming the unreliable transmission with UDP packets is more interesting.


As shown in Table 3,SRep has a relatively constant failure probability of 6% as long as there are at least two fast MULEs, but jumps to 52% when all the MULEs are slow.

prop is incapable of adapting to the mixture of path probabilities,and demonstrates notably worse performance when more than half the MULEs are slow.


If being con.gured in L2 only or L3 only mode, it could have 4k L2 or L3 only .ows.

if we want to match on both L2 and L3, we can only get 2K entries installed in TCAM.


Extra hardware is required as well in [12].

fLIGHT is not constrained by those limitations and FLIGHT can precisely calibrate clocks in an energy-ef.cient manner without any speci.c hardware.


One of the main reasons that our participants used built-in tools was that they did not need to install additional software themselves.

they mentioned that those tools, especially the ones in the router, provided too many unused low-level networking options for configuration (e.g.


The packets .owing in the network follow multi-hop paths, making such networks robust to node failures.

due to node mobility, the paths could change dynamically over time.


Wi =(i -1)T (1) Wi = Max{T1;T2 ;T3 ;...;T(i-1) } (2) In equation (1), a client i wanting to participate and enjoy modest stream application service in a multi-user scenario, has to wait for time Wi equal to a sum of all the waiting durations of the clients wanting to join before this client i.

in the newly proposed scheme, the waiting duration is reduced and optimized, as in equation 2, in to just the maximum among the waiting times between the 1st client and the (i-1)th client.


One approach is to periodically send out RTREQ messages to look for potentially better proxy clients.

there are two problems with this approach.


Another important direction of improvement is certainly the introduction of automatic validation tools for router con.gurations.

such tools would require .rst to simplify the router con.guration procedures.


Generalized sphere decoders [16, 18, 19] are designed for situations where the number of transmit antennas exceeds the number of receive antennas, and so the MIMO channel matrix is rank de.cient (as opposed to merely poorly-conditioned).

these techniques don t increase capacity, since capacity increases with min {na, nc}.


], an exact closed-form instantaneous BER expression was derived for code division multiple access (CDMA) systems with BPSK.

the analysis only applies to binary signaling and its generalization to higher constellations is by no means straightforward.


Remark that this approach is somehow similar to the NERD solution.

di.erently from NERD,here thereis only adatabase containing allpossibleEIDs sets, while the association toRLOCsisdone dynamically, thus enabling dynamic TE.


Disks staying in the idle mode provide a shorter response time to disk requests but consume much energy.

the standby mode consumes less energy compared to higher speed modes but requires for a longer response time and additional energy to spinning the disk up.


In [3],[4], methods to eliminate redundant packets while broadcasting is proposed using the topology information.

in an IVC network, the large number of nodes and high mobility make such pro-active approaches impractical [5].


Isolating networks at higher layers has the signi.cant advantage of allowing a node to potentially support multiple network endpoints.

administrative issues associated with centrally assigned identi.ers are exacerbated in decentralized wireless sensor networks.


Now, when sender arrives with the .rst send S1 of the tag, it will .nd a RECEIVER READY message with a matching tag.

since the local counter is 0 (to send the .rst message), the sender will decide that the RECEIVER READY is for a future communication, and will perform the communication using EAGER without matching the RECEIVER READY message.


This section discusses the Universal Mobile Telecommunications System (UMTS) as developed by 3GPP, for which initial studies of evolution exist [16][17].

note that nearly identical conclusions would apply both to other contemporary networks and their immediate predecessors.


HPEQ is another hierarchical cluster based protocol, which uses LEACH idea for aggregator selection.

the communication between cluster heads and sink nodes is done using the mechanism introduced in PEQ [3], which uses single paths from source to sink to transfer data packets.


This downward trend might suggest that DNS caching is working well.

the 1997 3% number should be put in perspective by considering it relative to network traffic as a whole.


the energy model may be relatively accurate only when the node density is very high and the average number of hops between thenodesissmall.


We remarkthat previous surveys,onlyprovidequalitative comparison of the protocols; as anexample, seeTable2in[30] andTables1, 2 and 3 in [1].

our results are based on extensive simulations with theONE simulator[15] whichis considered one ofthe reference simulatorforDTN[19].


Further, since the jamming sequence is generated pseudo-randomly for each transaction and never reused, it can be viewed as a random string for one-time-pad encryption 4 .

unlike Shannon s OTP, Dhwani does not apply the OTP encryption at the transmitter itself and may be vulnerable to certain attacks such as those based on shielding and directional antennas, which undermine the Wyner wiretap assumption.


It should be emphasized that the boolean model seems to neglect the e.ect of interference in the network.


These data may include body temperature, blood pressure, heartbeat rate and other measurements [1].

because sensor networks are characterized by high heterogeneity and may use different methods for representing the same measurements, it is imperative to use of a standardized encoding.


This simulation con.rms thatHARQneed tobe combined with AMC to cover a large dynamic range.

the proposed RCM scheme has been using the same set of parameters from 5dB to 30dB, and the overall goodput is higherthanthe Oracle combinedHARQandAMC scheme which knows exactly when to switch the modulations.


The approximate ratio of the number of SPs to that of LPs is P 1 .

in practice a new member will become an LP with probability much higher than 1 - P 1 .


However, even this mobile ad   (c) (d) Figure 1: (a) AN architecture -predictable well-structured .ight paths, (b) Predictable illstructured .ight paths, (c)Abstraction of predictable ill-structured .ight paths, (d) Unpredictable .ight paths hoc network of ANPs with completely unpredictable .ight path, should remain connected at all times.

this property can only be achieved if the on board transceivers have su.cient transmission range to ensure that, in spite of completely unpredictable .ight paths of the ANPs, they will maintain a connected network at all times.


In summary, by ensuring centralized control of software and data, centralized management with diskless clients is a promising solution to address the management challenges associated with distributed, inconsistent system states.

with centralized management, many issues of managing software at server repositories still need to be addressed, for example, developing scripts or tools to update OSes and applications across various disk image .les or database entries.


As a result, we want the ferry to contact the nodes with as high a probability as possible in each tour, as that would amortize this cost.

the other two components in route time, Ts and Tw depend on p. The service time Ts seems to decrease linearly with increasing probability.


A large value of d results in a higher number of messages that can be signed by a single HORSE instance.

a large d requires more storage and/or computation by the sender and larger signatures.


One of the main reasons is that there has been much focus on achieving only a high .ow accuracy.

on the Internet some large elephant .ows have a much greater effect on the network than small mice .ows.


Although this is an extreme case, it shows that, on the one hand, diverse network connections and heterogeneous devices demand different application protocols, for instance the Gzip protocol for low bandwidth network.

both ends of the session could be battery-powered devices.


The neighbor s location information can be verified by using secure location verification techniques [16].

the location information about a neighbor s neighbors cannot be verified by using these techniques since they are out of the transmission range of the verifier.


cases this maximum is not achieved, which indicates that co-channel interference is present.

on channel 6 only few nodes achieve the maximum TXR even at night.


To obtain the location information of a node, various existing wireless localization schemes can be employed.

they all have some location errors due to inaccuracy of their localization schemes.


One possible approach to this problem is to construct a distributed token bucket that limits the aggregate rate of all packets with a given resource principal identi.er.3 7.3 Replay attacks In the context of rate-based accounting, a simple model in which resource principals can use a .xed, aggregate bandwidth will likely suf.ce.

while (modulo cryptographic hardness assumptions) packet bindings cannot be forged, they may be replayed by an adversary, who may wish to waste a resource principal s limited bandwidth for a given capability.


Inherently, the only synchronization between the sender and the receiver is that the receiver completion of the operation depends on the sender starting the operation.

using the RDMA write-based rendezvous protocol, the following sequence of events must happen: SENDER READY .


Our pro.ling study shows that for the set of MapReduce jobs, the traf.c demand and hence the TIVC models generated across the VMs are of the same type and with the same number of pulses.

the rising and falling edges of the pulses can be offset, potentially due to the delay in task dispatching from the task scheduler.Table1 lists the standarddeviationof the rise andfall timings of the pulses for the four applications.


Ad Hoc Networks: The goal here is to reach an speci.c host (as speci.ed by an address or other identi.er).

because geographic routing is based on the coordinates, not the identi.er, one can t directly reach the intended target without knowing where that intended target is.


The reverse stream (Sky is the receiver, Figure 4) did not have any lost or duplicate packets.

16 packets (0.1% of the total tra.c) arrived later than 100ms.


Routing failures occurs when the source cannot compute a feasible path for the new connection.

setup failures occur when the source selects a seemingly feasible path that ultimately cannot support the new connection.


If Bc is very near B and hears all B s receptions, then the initial backoff windows size is 32 (i.e., 0..31), or doubled after each collision.

this is not always true and some of B s receptions cannot be heard by Bc due to hidden terminals.


The simulated network topology is shown in Figure 6 and it was used in a previous work [8] to evaluate the QoS of ATM connections.

in [8] a WF2Q (Worst-case Fair Weighted Fair Queuing) scheduler model [4] was used to serve ATM cells.


After the interested message: FormostComcastandCoxhosts,weobservedthattheconnectionswithBitTorrentmessagesweretorndownaftertheinterested messagewassentbytheleecher.