This natural phenomenon remains an open problem, as there are few data of environmental monitoring that relate to the hives external temperatures with their internal temperatures (microclimate).

the Wireless Sensor Networks (WSN) now constitute a mature alternative to distributed sensing and environmental monitoring, with a wide range of applications [1, 14, 15].


In contrast, with low density only a low percentage of the nodes receive all messages.

below a certain threshold (around 150 nodes) even simple .ooding cannot reach all nodes.


However,NAMA does not address energy e.ciency,and nodes that are not transmitting switch to receiver mode.

tRAMA addresses energy e.ciency by having nodes going into sleep mode if they are not selected to transmit and are not the intended receivers of tra.c during a particular time slot.


Due to the exclusivity of bandwidth partition, the complete bandwidth division scheme has the advantage to guarantee a special service class s QoS by assigning it a larger bandwidth partition.

when the bandwidth partition of a service class is exhausted, its incoming call will be rejected even if other service classes have enough unused bandwidth.


FR3generates outage at an average number of16 usersper cell.

with CR1 there is outage at an average number of 18 users.


Our implementation of PMNF has a running time of O(|V ||E|).

one may replace PMNF with any other algorithm without impact on fundamental contributions, and therefore we shall refer to the procedure static-coloring.


Many local-control strategies for maintaining such overlay networks have already been suggested, but mostly high-level wireless models have been used for their analysis.

since mobile ad-hoc networks have many features that are hard to model in a clean way, it is not clear how well these strategies may actually perform in practice.


Thus, the algorithm will have a possibility to timely update the information and correct computations if required.

it might be not the case in the event of successive packet losses.


For instance, a CER may have a queuing policy that pertains to four different classes.

it is possible that no traf.c is ever classi.ed as belonging to one of the classes, and hence that portion of the queuing policy is never exercised.


It is furthermore di.cult that end-host users get requested domain names because the namespace in DNS is .at.

dNS is an useful infrastructure of service providing subsystem on the Internet if the above problems are solved.


In contrast, in these workloads, the optimal hit ratios for caching 10% objects are only 0.52, 0.48, and 0.54, respectively.


By Observation 1, the center of mass of the points moves with velocity at most 1.

the center mass of the convex hull and the center mass of the boundary of convex hull can move with velocity exceeding the maximum velocity of customers (See Figure 3(a)).


It is known that the bound based on the Lyapunov approach is tight in terms of order only for restricted network topologies with special structures.

our complementary approach produces results that apply to any network topology, but under the heavy tra.c regime only.


INTRODUCTION AND QUALIFICATION OF THE PROBLEM Beekeeping has been identified as a sustainable alternative of income generation for communities who work on family agriculture [18] as well as increase the flow of pollinators in agroforestry areas like the cerrado (biome similar to savanna), and contribute to the production of fruits [12].

most of the creators and producers have suffered heavy losses in off-season periods (when the highest temperatures are recorded) due to swarming by abandonment, which occurs more frequently and Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page.


On the other hand, the location update cost in GPMIP increases linearly with a.

the packet delivery costs are not affected by a because MN and CN always communicate directly in GPMIP.


In principle, one geo location server, say OLS, would be su.cient.

since the urban Internet infrastructure (or wireless access to it) may fail, we also maintain VLS in the Urban Grid.


Its node-selection mechanism of choosing randomly from known domains constructs tunnels that empha- Systems may attempt to combat this by exposing relay selection to users [26, 13], in order to encourage host diversity.

much of the information available to users cannot be authenticated, and it may in fact be used to bias their selection.


An issue of the preceding algorithm is that it needs to .rst generate all rules, compute their ordering constraints, and then assign priorities.

maple s trace tree has special structures that allow us to make simple changes to BU IL DFT to still use in-order trace tree traversal to assign minimal priority levels.


RELATED WORK Many previous papers refer to WSNs based on the IEEE 802.15.4 standard, which is considered the reference technology in this context.

the suitability of the 802.15.4 MAC protocol for wireless sensor networks especially with focus on reliability has never been extensively analyzed.


They use the idea of probabilistic key sharing [6] to establish trust between two nodes, with di.erent emphasis on enhanced security protection [2], .exibility of security requirements [27], high probability of key establishment and reduced overhead [12], or utilization of deployment knowledge [4].

they are not designed to handle insider attacks, such as event fabrication, launched by compromised nodes.


When the attacker power is matched to the legitimate transmitter s power, correlated jamming results in an error rate of 0.5 (i.e., no information due to complete cancellation of the transmitted signal) while coded jamming results in an error rate of 0.25 (since coded jamming sends random symbols imitating the physical-layer chain of the source transmitter and since the source transmitter uses BPSK with alphabet size of two, there is 0.5 chance of coded jammer sending con.icting symbols and, when that happens, there is a conditional probability of 0.5 for the event that the receiver tunes into and decodes the symbol that coded jammer sent; thus, 0.5 ·0.5 = 0.25).

the legitimate user performs very well against transmission-independent Gaussian jamming since we incorporate redundancy at the physicallayer and the receiver uses soft-decoding to use the information of multiple samples to decode a symbol (as described in Section 2.3) and thus e.ectively mitigates transmissionindependent noise; coded and correlated jamming, on the other hand, knows the MMSE-based receiver strategy and customizes its signal injection accordingly.


This way we can always retrieve Data quickly through the best paths.

it will also incur signi.cantly high overhead.


The inclusion of social networks within vehicles has attracted researchers to devise social aware routing protocols and architectures in order to build vehicular social communities and to facilitate human interaction between commuters on the road.

several issues defy the purpose of VSNs.


As ICN decouples content name (and how it is accessed) from the location it is stored, it would stand to reason that mobility, both for the content provider as well as consumer, would be relatively easy to achieve.

as pointed out in [12], content provider mobility still remains one of the biggest research challenges in almost all ICN proposals [1, 7, 10, 11].


This makes mobile users accountable for the bad channel conditions due to their mobility, while not a.ecting the static users (in Figure 2(b), static user s throughput is not a.ected).

slot fairness adversely impacts static users at cell edge, users with shadowing such as due to buildings and trees even while static, users in a building basement as opposed to higher .oors with better signal reception, etc.


Hence, the worm impact on the host is proportional to the transaction load.

typically worm infections impose their own processing load on the host, independent of any other transaction load.


On the other hand, for request probabilities p = o(1/n), our model correctly predicts the asymptotic behavior of the load on the users and the load on the server, as seen in -2 System Size 5 x 10 Figures 10 and 11.

we note that we overestimate the behavior for low values of n and that our bounds are not as close as the ones obtained for the same probabilities underthe randomwalk(Figures4 and5, respectively).


2.2 Example:AdverseSelectioninBasicOpportunistic Routing The basic opportunistic routing protocols assume that user nodes are obedient and follow the protocols.

a user node may deviate from the speci.ed protocols.


We can see that with a high prediction accuracy (i.e., 0.9), TOP has a nearly comparable performance to TailTheft and TailEnder.

if the prediction accuracy is reduced (i.e., 0.7), the energy saving of TOP decreases remarkably.


The ability to track and monitor the health of mobile devices is challenging in itself.

such a deployment generates troves of data that must be collected and analyzed which requires automated mechanisms to collect both raw usage data and user feedback data.


For example, if a .ow between two nodes is short-lived and only carries a small number of packets, then search cost dominates the total cost incurred by this .ow.

if a .ow is longlived and carries a large number of packets, then search cost is insigni.cant with respect to the route length.


Network Management Architecture Toward Universal Communication Yoshihiro Kawahara, Ahmad Kamil Abdul Hamid, TaeYoung Song, Kei Wada and Tohru Asami Graduate School of Information Science and Technology, The University of Tokyo 7-3-1 Hongo Bunkyo-ku Tokyo, 113-8656 Japan {kawahara, kamil, t-y-song, kay-wada, asami}@akg.t.u-tokyo.ac.jp ABSTRACT Ubiquity of networked devices is one of the first steps toward realization of universal communication services.

not much attention has been paid to the management architecture of the mashed-up services provided across the network domains.


These algorithms also have delivery rates similar to our above mentioned algorithms.

they have very high (almost three times larger than the deterministic algorithms) power dilations.


In case of embedding over wired networks, the problem is known as requiring computationally intractable complexity (i.e., NP-hard) for achieving optimality, and thus various heuristics have been proposed, see e.g., [1, 2].

due to various features unique in wireless networks, e.g., link interference, the embedding problem becomes much more complex and harder.


To evaluate the detection speed for the controlled-tra.c trace, our timer is started when the .rst packet is transferred to a tracker of each torrent .le.

we do not know which IPs are trackers in the normal-tra.c trace.


There is exactly one defense action between two adjacent states.

a defense action can be a null action, but neither an attack action nor a good access action can be a null action.


For large-scale systems, the inter-VFI data exchange through traditional mesh NoCs may introduce unnecessary latency and energy overheads.

it has been already shown that small-world network architectures with long-range wireless shortcuts can significantly improve the energy consumption and achievable data rates of massive multicore-based computing platforms [1].


Hence, 7 http://www.cs.cmu.edu/~healthline it allows decision-makers and supervisors to quickly analyze and respond to program information.

uganda s Rakai Center and others are utilizing similar systems to enhance information management and treatment provided to HIV/AIDS patients.8 none of these systems have explored methods for reporting information in settings where phone calls are costprohibitive.


Functionally, at the core of any IPS there resides a signature matching engine that potentially compares every byte of incoming and outgoing tra.c to a signature database containing known exploits or misuses.

steady increases in tra.c volume, growing signature database size, and increased signature complexity have turned signature matching into a performance-limiting bottleneck.


From the received RREQs, the destination selects two multiple node disjoint paths and sends a Route REPly (RREP) packet.

no method to take care of misbehaving nodes has been implemented.


Measuring an RTT started, when creation of a request started at peer 1.

rTT does not include the time needed for random-generating the payload.


Nodes that are outside are typically moving, unless they are waiting at a tra.c light.

nodes that are inside do not move for considerable amount of time.


Interestingly, SAA alone (without adaptive routing) provides a small improvement of up to 13% over the baseline NC (no rate control, no adaptive routing), and adaptive routing alone (AR) even increases the completion time with three or more permutations.

when the two are combined (SAA+AR), they yield a major improvement of up to 50%.


Therefore, the Sigcomm data does not contain very precise time measurements in comparison to the data we collect with microsecond resolution.

the Sigcomm data can still be used for estimating clock skews, albeit using more samples.


Moreover, nodes with directional antennas are also used for energy conservation (e.g., [27, 32]).

existing proposals mostly assume omni-directional sensors and antennas.


Since different types of traffic have different QoS demands, the same type of traffic should share the same assigned slots whenever possible for ease of management.

different types of traffic can also be mixed in a slot.


Due to the broadcast nature of the acoustic transmissions, all nodes within the radius communication of a sender will receive the message.

as the MSG REPLAY messages are addressed to a speci.c node, all the other nodes which have received the message will discard it after examine the header and determine that it is not the destination.


Flat routing is implemented in case of unlimited memory resource, to achieve the best time complexity of O(1) with the largest space complexity of O(N2).

scarce memory resource is the main factor to limit the size of network simulation.


Hence, for energy e.ciency, the lower bound of |G| in (13) is selected as the minimum number of spectrum sensing sensors of group G: & log(1 -Q¯d) |G|.

(14) Pmin log(1 - d ) this formulation does not mean that the size of G is optimal in terms of minimizing the total sensing energy consumption for cooperative spectrum sensing.


For example, a MicaZ mote can perform a 160-bit ECC signature veri.cation operation in about 2.43 seconds using TinyECC [19].

a node cannot afford performing many such operations due to the intensive computation and energy consumption.


2.2.2 OFDMA-FDMA random allocation In the OFDM-FDMA random allocation method (adaptive frequency hopping) [14] which allocates based on the idle and busy of subcarriers for users accounts the different subcarriers.

it does not have any attention to the network interference.


all found ASes are well-known tier-1 provider.


The proposed scheme and EDF would meet the deadline of every packet on the error-free channel, as long as the o.ered load is less than or equal to 1.0.

gDF misses some deadlines when the o.ered load exceeds 0.7, because it cannot optimally schedule the real-time packets.


Seoul National University tkkwon@snu.ac.kr Seoul National University jychoi@mmlab.snu.ac.kr Seoul National University escho@mmlab.snu.ac.kr Yanghee Choi Computer Science and Eng.

seoul National University yhchoi@snu.ac.kr  ABSTRACT The DNS has performed the resolution for quasi-static hosts sofar.mappingfromthe namesof mobile hoststo their locators is increasingly important.


Of course, all assessment, validation, estimation and analysis can only be made based on this information.

the measurement and monitoring facilities must be: Fully transparent for the network, its traffic and the load of the machines involved in the experiments.


When new clusters are formed in the splitting event, this k-hop value is also used.

in cluster maintenance, the maximum distance is allowed to stretch to k.-hops (k. = k).


1, assuming the hose-model bandwidths for both tenants are 500Mbps, and all link capacities are 1Gbps, the physical layout shown in the .gure could potentially satisfy the guarantees.

just placing VMs without any enforcement of bandwidth limits does not necessarily satisfy the hose model guarantees.


That is, these nodes should all belong to S1and we have S1W1+U1.

if the optimal objective function is positive, then some nodes iEU1must have positive Eivalues and these nodes therefore do not belong to the minimum node set S1.


between communication and computation is well known [22] and is exploited for in-network processing solutions.


stage i only when it attempts a transmission.


Device H is also attached to the portal.

it carries only G s traf.c in addition to its own.


Asummary ofthe issues in thissectionaregiven inTable3.

4.1 Overall traf.c considerations Overall, asILNPv6does not use aHomeAgent(HA) andForeignAgent(FA) con.guration, noextrasignallingtraf.cisrequired inorder toupdatetheHA,asisthecaseforIPv6.ILNPv6 generates DNS traf.c which Mobile IPv6 does not.


[10] do a joint channel and user association).

we believe that if channel selection is performed jointly with user association, then the network con.guration could run into stability issues, as client channel gains change much more rapidly than AP-AP gains (e.g., closing of a laptop lid, lifting and moving a PDA, etc).


SPAN [8] allows a node to delay the announcement of becoming a clusterhead for random amounts of time to attempt to attain minimum con.icts between clusterheads in its one-hop neighborhood.

deterministic criteria can determine the clusterheads in a single round.


gorithms that depend upon the values each sensor wants to transmit can be devised (note that unlike in a traditional EbT based scheme where sensors have to look out for overlapping packet durations, in CtS sensors have to look out only for overlapping start-stopintermediate signals, the positions of which are directly determined by the values), WSNs being resource constrained environments, such algorithms can turn out to be highly resource intensive.

a unique characteristic of CtS might allow for a relatively simple contention resolution scheme to be used very effectively.


In this sense, and based onpreviousmeasurements[5], wecharacterizetheduration of o.oading periods as heavy-tailed.

[8] and referencesthereinpresentwell-knownmodels of the behavior of single .ow tra.c, which describe tra.c burstiness in terms of long-range dependence and heavytails.


Fortunately, neither certi.cates with plesk nor localhost were ever found to have valid chains.

by far the most answers occurred on relatively few hosts (2 10).


The .rst set of constraints represents balance equations so that at every node, and for every destination d, the total number of received credits should be no less than the total number of credits assigned to next-hop nodes that can reach destination d. For example, in Fig.

1(a), node s can split the credits it has between nodes v1 and v2 because all of {d1,d2,d3} are reachable from both v1 and v2.in Fig.


f1 f1 Researchers have proposed several worst case end-to-end delay analyses for the traf.c in an ARINC 664p7 network, including analyses based on NetworkCalculus [14, 13], Finite State Machine [32], Timed Automata [6] or Trajectory Approach [11, 12].

none of these analysis methods are applicable to TTEthernet, since theydo not consider the impact of TT messages on the schedulability of RC messages.


In the case of asymmetric channels, solutions proposed [5] include ack congestion control and ack .ltering (dropping of acks), reducing source burstiness by sender adaptation and giving priority to acks when scheduling inside the network.

the magnitude of asymmetry in 3G networks is not large enough and can be tolerated by TCP without ack congestion control or ack .ltering according to [12].


On the other hand, distributed approaches typically involve message communication only with neighbors, and thus are easily scalable.

distributed protocols for target coverage maximization have received relatively less attention.


Simply encrypting each packet with OCB provides secrecy and authenticity, while an increasing counter can still be used as the IV to provide for partial ordering of messages.

without synchronized counters, there is no defense against replay attacks.


For example, for large synthetically generated databases with 20% of the rules containing zero length pre.xes, the performance of ABV without rearrangement grew to be slightly worse than BV.

the addition of sorting again made ABV faster than BV by an order of magnitude.


PDFPQ gives rtPS more transmission opportunities to deliver their critical packets.

qcrit is only set once in the beginning of every frame.


0 (1) b For the test distribution q to be classi.ed as non-malicious, we expect Dsym(qg)to be less than Dsym(qb).

if Dsym(qg) is greater than Dsym(qb), the distribution is classi.ed as malicious.


Hence, we strongly believe that higher numbers of class B base stations and higher penetrations of femto base stations will bring similar bene.ts.

network planning is required to decide about positions of additional class B base stations, which is out of scope of this paper.


The NiMH battery is more than adequate to supply the energy needs of the images that can fit in this constrained storage space.

from Figure 5(b) we note that a microdisk con- sumes more energy for transcoding images.


This, in turn, can result in some unsuitable computation being mapped to the embedded processor in the sensor node (which is typically much less powerful than the one in the central base station), thereby reducing overall performance (i.e., increasing application execution time) and impacting energy consumption behavior negatively.

a very large c value can be overly conservative and can result in a code mapping that does not make use of the processor in the sensor node at all.


Most requests not on the main site are indirect.


However, the LP solution may contain fractional placement of some of the content with the corresponding xjk variables set to fractional values between 0 and 1.

in our experiments only about 20% of the variables in the optimal LP solution were set to fractional values between 0 or 1, and the rest took integral values of 0 or 1.


we have extended their ideas signi.cantly, both to enhance the functionality of the matching algorithm and to make it appropriate for use in the forwarding function of a content-based network.


Since retransmissions are not necessarily useful for these timesensitive applications, they have a great deal to gain from the use of Explicit Congestion Noti.cation [35], which lets congested routers mark packets instead of dropping them.

eCN capability must only be turned on for .ows that react to congestion, which requires a negotiation between the two endpoints to establish.


it is currently well-known that PC processor architectures are rapidly adopting the multi-core paradigm, instead of increasing their internal clock or computational capacity, as suggested by Moore s law.


Layout Inferencing: Thus far, we have focused on identifying items within the shopper s .eld of view.

limiting ourselves to such items would not be suf.cient from the viewpoint of our goal of tracking physical browsing.


Hence, for generating the numerical results from the v analysis, the upper limit used is Ninstead of 8.

this doesn t take care of the edge e.ects that will arise in the simulations, which causes deviations from the analytical results, especially for small k. 4.1 Simulation Set-up We consider .ve networks of size 49, 121, 225, 361 and 5293 .


For ZRP, as introduced in Section 2, a few mechanisms based on topological information have been proposed to help reduce the duplicate queries.

those solutions still have intrinsic problems since the network topology cannot provide effective information for guidance.


If a client insists on C2 or C3, the decision has to be on R2.

if a new client requests on R1 while servers are already doing R2 for existing clients, the new request for R1 may have to be disregarded as it is simple and efficient for servers to process all requests by one form of replication.


It is unknown how the performance of VS scales as the NIC line rate reaches 10Gbps and beyond.

it is safe to predict that the hosts can hardly support a scalable number of VMs while dealing with the workloads of packet switching at 10Gbps rate.


INTRODUCTION ICN (Information Centric Networking) [1] has received much attention since it inherently provides attractive functionalities such as mobility support, caching and name-based routing.

many issues should be resolved so that ICN networks are widely deployed.


To satisfy the .rst requirement, i. e., obtaining a wide coverage of popular hosting infrastructures in terms of traf.c volume, one approach is to sample all possible hostnames.

due to the sheer size of the Web an estimated 92 million active domains only for the .COM top-level domain [6] querying all host names in the Internet would be way too cumbersome from a measurement perspective.


Assume that the data items Ri, 1 = i = 6, are of the same size and Figure 1a shows a .at broadcast program, where data items are evenly allocated tothe twobroadcast disks and the speeds of two broadcast disks in the broadcast disk array are the same, meaning that the expected delays for all data items are equal from one to another.

figure 1bshows another broadcast program with its channel allocation tree (or abbreviatedly as allocation tree).


The worst case discrepancy for a queue of Quantum 10000, after 100 rounds of scheduling, would be 150000 bytes.

as we have shown in the Chernoff bounds, the probability of discrepancy greater than 30000 bytes is less than 0.13 for the randomized de.cit round robin.


The meanpathdurationand thepathpersistencewritten as expectations of functionals of the multihop path process are the unique solutions of a system of integro-di.erential equations.

any direct method to solve them is quite problematic and depends very much on the speci.c characterization of the multihop path process (number of nodes,deterministic motion,jump rate,transition measure).


If A broadcasts OI Da and B broadcasts OI Db, A will not receive OI Db from B and B will not receive OI Da from A.

since E can snoop on and broadcast to A and B, it can receive both OI Da and OI Db and then replay those messages such that A receives OI Db and B receives OI Da.If A and B then exchange resolutions, they will be under the false impression that they were co-located.


The SP -power algorithm that minimizes the total communication energy of a packet is obtained by applying Dijkstra s shortest path algorithm with the weight of the edge as ada + C, where a, a, and C are constants that depend on the radio models.

the SP -cost algorithm, which maximizes the node s lifetime, can be obtained by applying Dijkstra s shortest path algorithm with an edge-weight of f(ni)= 1/gi.


Devices in the core network typically route to each other freely, and major content providers form signi.cant networks in their own right (e.g., Facebook and Google), often referred to as clouds .

activities that are simple in the cloud such as establishing peer-to-peer links are disproportionately complicated in the edge.


This technique is valid if the measurement point is located at the sender side.

if the measurement point is away from the sender, we virtually shift in time the observed timestamp values by the time delay between the sender and the observation point.


As a result, TCP data delivery suffers significantly.

uDP-based application (such as SopCast) is less sensitive to gateway changes.


This, in turn, has led to the notion of link metrics and link-based routing.

interference depends on the existence of other sources/intermediate relays and their spatial separation.


They must also be augmented with additional mechanisms to adapt the video codec rate to .t the available bitrate.

softCast provides a uni.ed design that eliminates the need to adapt bitrate and video coding at the source, and instead provides the receiver with a video quality that matches its instantaneous channel.


80000 60000 40000 20000 0 23:00 23:30 24:00 24:30 25:00 25:30 26:00 26:30 27:00 Time [min] collected trace highlights that the UDP stream is quite regular, hence assuring some QoS requirement, while the TCP .ows with lower priorities tend to have a higher oscillation.

on average, nodes have the bandwidth obtained via the PRIMUS system guaranteed.


Transmission with higher power increases the probability of successful transmission, yielding increased end-to-end throughput.

high power strategies also result in more cross-node interference, which can destroy existing transmission bands, causing the network to have blocked connections and decreasing e.ective network capacity.


A similar behavior is observed in the CBR-512kbps video.

with this compression rate, the gap between the packet loss rate and frame loss rate is lower (5%).


A system with a task scheduling algorithm can work much better To maximize the usage of system resources, services migration algorithm should be introduced into the system.

currently, most of the load balancing approaches on QoS focus more on message routing and traf.c engineering.


Some new architectural research combines intelligent algorithms and novel architectures to eliminate many of the unfavorable characteristics of currentTCAMs[14].

all such solutions still depend on specialized hardware, which is avoided by Storm.


in this case, no priority list is provided.


The Pagoda network has a constant degree, a logarithmic diameter, and a 1/logarithmic expansion, and therefore matches the properties of the best randomized overlay networks known so far.

in contrast to these networks, the Pagoda is deterministic and therefore guarantees these properties.


Our results show that, contrary to the .ndings in [19], the network-community pro.le (NCP) suggests the existence of large low-conductance cuts in Internet traf.c.

the conductance of the three industry-communities is several orders of magnitude larger than the best cuts of similar size.


When a single node transmits (Fig 2(a)), the signal exhibits two levels, which can be used to distinguish a 1 bit from a 0 bit.

when transmissions from two backscatter nodes collide (Fig.


The GREEDY algorithm takes this into account and groups the items into clusters with similar access probabilities.

it still employs the FLAT method for each channel to cyclically broadcast all the items allocated to it.


On one hand, each link in the tree should have a good quality.

tree depth should be small to avoid latencies.


Experi-ments have shown that summary cache reduces the number of inter-cache protocol messages, the bandwidth consump- tion, the protocol CPU overhead significantly while main- taining almost the same cache hit ratio as the ICP.

when the number of proxies is large, the network traffic for updating cache contents could also be large.


The solution is straightforward when the terrain is .at and nodes can all hear each other well.

this may not be the case in real-word applications.


Therefore, providers are reluctant to enable pacing despite its proven e.ectiveness.

if we have a system that can measure the number of active .ows, we can dynamically switch between paced TCP and regular TCP to ensure the system is always at its peak performance.


(7) The situation for the messages in Min(S) is almost symmetric.

the messages are sent from the random intermediate destination (xr,yr)to a position inside S. the actual node sending the message might be at distance rcov from (xr,yr), therefore we must accordingly adjust the angles for which there is congestion at node v. Instead of the value obtained in (6), the probability of rcov +(.pad +1)rI Cm,v can now be upper bounded by P(Cm,v)= p·s .


15b 93040 Regensburg, Germany dominik.herrmann 93055 Regensburg, Germany hannes.federrath @wiwi.uni-r.de rw@jondos.de @wiwi.uni-r.de ABSTRACT Privacy enhancing technologies like OpenSSL, OpenVPN or Tor establish an encrypted tunnel that enables users to hide content and addresses of requested websites from external observers This protection is endangered by local traf.c analysis attacks that allow an external, passive attacker between the PET system and the user to uncover the identity of the requested sites.

existing proposals for such attacks are not practicable yet.


With the focus being on addressing the SI problem, current works have primarily looked at FD from a peer-peer standpoint, with both nodes of the link being FD enabled.

to allow for widespread adoption of FD, it is important to enable FD in commercial networks.


On one hand, f1 has better propagation characteristics and a longer transmission range than f2 due to its lower frequency of operation.

f1 is affected by the PU s activity and is not always accessible by the CRN.


In principle any mapping system designed for LISP canbeused.

avery simplesolutionistouseacentralized approach where mappings are stored.


Further, the DAS traf.c of all the constituent sectors simply share the radio resources through a common DAS con.guration on b ' carriers.

the FFR for the constituent sectors is executed individually within each sector (and not jointly), albeit on the same set of B - b ' carriers.


Instead, mobile communication is provided by wireless infrastructure, most typically over the radio spectrum.

limited available spectrum and interference e.ects limit mobile communication to lower data rates.


Pathload was the .rst tool to consider the variability of avail-bw process and to report a variation range (called grey region ) rather than a point estimate.

pathload does not specify the percentiles that correspond to the grey region, and it does not allow the user to control the desired percentiles or the measurement time scale.


when it has already received a message with a higher value from another node in SG(bi,bj ).

this cannot happen since bk is the most distant node in SG(bi,bj ).


In most of the envisioned applications, there is a clear relationship between the objective of the application and Jens Mittag Karlsruhe Institute of Technology, Germany jens.mittag@kit.edu its requirements.

there is one example which on the one hand aims to improve tra.c e.ciency, but on the other hand su.ers from the same time-critical requirements as safety applications: dynamic intersection tra.c management based on virtual tra.c lights (VTL).


These methods assume that all routers in an AS select the same route and make routing decisions based only on the shortest AS path.

these assumptions do not hold in practice.


Analysis shows that a recent-model cell phone under a typical usage consumes about 6 kJ per day from the battery.

if the charger is left plugged in all day (as is not uncommon) the total energy usage is 110 kJ, an efficiency of about 5% [Nicolaescu01].


Thereinto, the ALOHA system proposed in 1970[1], is an attractive option because of its simplicity and .exibility.

in such kind of traditional medium access control (MAC) layer random multiple access protocols, * Zhejiang Provincial Key Laboratory of Information Network Technology, Hangzhou, 310027, China Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for pro.t or commercial advantage and that copies bear this notice and the full citation on the .rst page.


Both A-AODV and ARDSR are on-demand anycast routing protocols, and do not have to exchange the routing table periodically.

a-AODV and ARDSR suffer the typical drawbacks of on-demand routing, such as high routing overhead and low scalability.


These sub-spaces do not provide an accurate representation, and hence may match events that do not belong to the original subscription (sub1) resulting in the dissemination of unnecessary events in the switch network.

if another decomposition step is performed on dimension d2, then sub1 can be accurately mapped by the newly generated sub-spaces, i.e., {0000, 0010, 1000, 1010}.


With the emergence of interactive Digital TV, it is possible to use a STB or Digital TV as a Residential Gateway.

there are some di.culties about the integration between iDTV and Home Networks.


Molecular communication can exist inside a biological cell in an aqueous environment where biological molecules can survive.

molecular communication ubiquitously occurs even outside a biological cell.


Process migration has many advantages, including processing power management, resource locality and fault resilience.

process migration has suffered disadvantages with regards to implementation complexity and in.exibility.


In this case, however, the coding gain is signi.cant, because the probability of getting a redundant packet is reduced to near zero.

the computational complexity is non-trivial and must be performed regardless of whether the adversary is or is not inserting packets.


Figure 1: Disconnected RBSes In Footloose [27], the candidate devices whose states need to be synchronized are part of a network.

the RBS(es) do not share any network connection; therefore, we need an alternate medium to carry the required data from one RBS to another.


2.2.1 Variation in Packet Count Ratios It is assumed that top ports will constitute the majority of packet counts.

some degree of normality is expected within these top ports assumed from the Central Limit Theorem.


This mechanism can prevent the attacker from .ooding requests with spoofed IP addresses.

as the attacker can compromise a large number of zombie machines, it can launch an attack without using spoofed IP addresses.


node and networkinitiated) requiretwo roundtrip time(RTT): one RTT for context transfer exchange and one RTT for MOBIKE SA address update which is the same as the new IKE/IPsec SA establishment.

in case multiple CHILD SAs are already created then our proposal will provide better performance since it is always restricted to two RTTs withoutconsideringthe number ofCHILD SAs.


The situation becomes even worse when the capacity of the output link is 40Gbps or higher.

another kind of work-conserving schedulers, the round robin schemes are simple to be implemented and have O(1) time complexity, but they are well known for their output burstiness and short-term unfairness.


4As in any backscatter system (including RFID), it is possible thatthe two impedance states result in little or no difference in the amplitude of the signals at the receiver.

the probability ofsuch an event is very low since it requires the channel phase tomatch exactly to cancel the effect of the two impedance states.


The most challenging part of emulating NIRA is that an AS can allow or prohibit routes based on the upstream hops as far back as the core providers.

in the usages of pathlet routing we have seen so far, policies depend only on the immediately prior hop and any downstream hops.


Because our analysis approach is conservative, most of the imprecision leads to false positives (which are later eliminated).

there is one source of imprecision that may lead to false negatives.


2.3 Observations At a glance, our Stackelberg game for CCRN is similar to the Stackelberg game for CRN in [1].

there are di.erent characteristics which need to discuss more deeply including: Since some SUs increase spectrum resource production in the spectrum market by cooperation, the number of SUs n has more impact on pricing and investment.


Simulation was used to evaluate the throughput fairness issue for TCP, UDP and mixed traffic.

the studied set of possible link interactions is limited.


In this case, it is infeasible to provide strict guarantees on message delivery time.

opportunistic contacts may greatly enhance the performance of many peer-to-peer (P2P) applications: as proposed for website prefetching in the 7DS architecture [20], and podcast dissemination (series of content items on a channel), in the Podnet project [14].


Our scheme relies ontheinformationprovidedby theseprotocols and thus works only as well as the information they use.

our schemecanleverage newadvancesinsuchprotocols and thus become more e.cient with improvements in them.


We note that the lower bound on ps can be signi.cantly improvedby employing moretimeslotsinstep3 of the relay selection algorithm.

these improvements do not change the asymptotic results obtained in this paper.


IEdy ' T .P , where T.is either needs not to explicitly guess P .


The advantage is that several code versions are not required for di.erent mobile platforms.

since the app must be installed like a native application, installation of PhoneGap apps do not meet the lightweight and convenience requirements of localized proximity applications.


Therefore, YouPorn videos seem to have developed temporal properties similar to news and weather shows [6], which are highly temporally dependent (e.g., weather forecasts from the previous day are rarely of interest).

contrary to news and weather content, there is no temporal dependency in adult content videos created a year ago would still seem to be suitable for viewing today.


Our results for improved quality with B-frame dropping compares with earlier results (e.g., [9]).

[9] uses a quantitative metric called PSNR and expresses the gain as 2 to 3 db gain in PSNR using B-frame dropping, while we use perceptual loss thresholds.


In our testing, we .nd that Huawei, Vyatta, HP, and Mikrotik use a shared per-destination PMTU cache.

we can already resolve aliases of these devices using speedtrap.


3.2 Network Throughput DTN2 achievedbetter throughputthanIBR-DTNforboth memory and disk based storage for bundle sizes up to 10000 bytes.

for the largest bundle size, IBR-DTN performedbetter using bothstorage mediums.


Therefore, during a cache miss, the TS algorithm and our algorithm have the same query delay.

in case of cache hit, our algorithm can reduce the query delay by a factor of m. As shown on the right graph of Figure 4, as the mean update arrival time increases, the cache hit ratio increases and the query delay decreases.


Proposed Scheme 4.1 Motivation and Overview Packet Reception Rate (PRR) In a real WSN, it is crucial to forward a packet efficiently using local information due to the limited resources of a sensor node [9].

0.6 previous routing schemes are not adequate to be used, as Connected Transitional Disconnected they do not consider the asymmetry of wireless links or they have Region Region Region 0.4 0.2 0.0 0 5 10 1520 253035 Distance between two nodes (m) Figure 1.


However, this strategy has to display the same advertisement repeatedly.

using Max(f) guarantees that peers do not view repeated advertisement; however, it results in signi.cant surplus in advertisement content.


For example, Kernel-AODV maintains the nodes own sequence numbers in this way.

there are two possibilities to disallow self-entries: if a node receives a route reply and would create a self-entry, it silently discards the message (Interpretation 3c).


Revertibility: Assuming we can accurately identify the AS A responsible for a problem, we can use BGP poisoning to target it and cause other ASes to route around A.

a will eventually resolve the underlying issue, at which point we would like to be able to revert to the unpoisoned path, allowing ASes to use paths through A, if preferred.


Nonlinear Modeling of the Internet Delay Structure Xiao Wang, Yang Chen, Beixing Deng, Xing Li Tsinghua University, Beijing, China wangxiao.thu@gmail.com ABSTRACT Modeling the Internet delay structure is an important issue in designing large-scale distributed systems.

linear models fail to characterize Triangle Inequality Violations (TIV), motivating us to research on nonlinear ones.


This is about one timeslot per microsecond for 10 Gbits/s links with 1500byte timeslots.

parallelism can enable longer runtimes: if the allocation of multiple timeslots can be run in parallel, allocation of each timeslot can take longer while still maintaining the arbiter s processing rate.


The straightforward approach is to simply explore every compromise represented in the underlying multiple-prerequisite graph, by starting at each state node in turn and walking down the graph to all reachable states.

this is essentially quadratic in the number of hosts.


Consecutively the problem is NP hard for only one MN too.

there are alternative solutions giving a solution what is good enough.


3.3 Aligning VPCS with Network Topology Without Geographic Information The method described so far for assigning the virtual space is su.cient to provide reliable node to node routing, as describedinSection 4.1and Section4.2.

inorder to take advantage of the extra cross-links in the ringed-tree structure, we need to label the nodes in such a way that a node can know which cross-link it should use, if any.


Not too many years ago the answer to this question was clearly no ,becausethecostwasprohibitiveand setting up an Emulab required an extremely talented system administrator.

recent enhancements to the Emulab software combined with falling hardware prices have changed the playing .eld to the point where one can consider building their own Emulab.


3.5 Handling parallel transfers of similar content Thus far, we implicitly assumed that an image being considered for upload is compared with images that were already uploaded previously and stored in the server database.

it is quite possible that in our scenarios of interest, multiple user devices attempt to upload similar images almost at the same time (close to when the event is occurring).


To ensure the fairness in the contention process, existing proposals adopt a simple unbiased contention resolution rule based on random number selection [10, 8, 9, 5, 6], such that either a contention source or a contention destination has an equal probability of winning the pairwise contention.

the existing design of a self-coexistence protocol fails to consider the successive events that may be triggered by the spectrum redistribution during a local spectrum contention process.


[5] proposed an e.cient GKA protocol for low-power mobile devices.

this protocol requires a special user Un called the server who will perform most of the computation on behalf of other users in the group.


5.2.2 Local Energy Savings  5.2.1 Compression Size and Time Results Figure15showsthatlargeenergysavingscanbeobtained TheprimaryadvantagetousingtheSTasopposedtothebycompressingwiththeST.AlloftheschemesyieldenergyBWTisthattherearenostringcomparisons,soitisex-savingsonalloftheradiosforallthreedatasetsevenwhentremelyfast,andtherefore,muchmorelikelytoconservecomparedtoalready-goodS-LZWcompression.

cC2420 CC1000 6 Effect of Reliability and Replication on Compression Bene.ts Tothispoint,wehaveassumedthatpackettransmissions  areperfect.inrealnetworks,transmissionarenot perfectandthiscanhaveasigni.cantenergyimpact.Com RLE-ST MC16-ST MC8-ST MC4-ST  pressingsensordatacanhaveadditionalbene.tsasthenumberofretransmissionsrequiredincreases.Inthissectionweexplorethebene.tsofcompressioninbothnetworkswith Algorithm variablereliabilitiesandinopportunistic,mobilesystems MC8-STMC4-STMC2-STS-LZW-STBasic S-LZWRLE-ST  S-LZW-ST MC16-ST Basic S-LZWBasic S-LZW MC16-ST MC8-ST MC4-ST MC2-ST MC2-ST RLE-ST S-LZW-ST thatusepacketreplicationtoincreasetheprobabilityofsuc- XTend cessfullytransmittingpacketstothesink.


Ideally, any allocated resource should be fully utilized.

there is often a gap between resource allocation and utilization due to the lossy nature of wireless transmissions, inef.cient protocol design, and the time-varying quality of wireless channels.


Interestingly, DES also improves with the fusion-only transformation (not shown).

the deadlock-free VC assignment for the combined TransCom con.guration results in degraded performance.


9.CONCLUSIONS Becauseweworkwithin a model of routing policies, we caution against interpreting our results as hard numbers that measure the impact of an attack launched by a speci.c manipulator in the wild.

the trends uncovered by our quantitative analysis do allow us to arrive at a number of useful insights; indeed, many of these insights are obtained by averaging over multiple possible (manipulator, victim) pairs, and we suspect that they hold up even if some ASes deviate from the policies in our model.


Summary: In Madcity mesh network, because of bandwidth shaping policies enforced, hop count did not really seem to be the bottleneck for performance.

this is mostly true in absence of shared congestion; that is in presence of multiple .ows sharing the same backbone path, the throughput of higher hop-count routes would be lower.


The standard definition of the leader election problem for static networks [1] is that 1. eventually there is a leader and 2. there should never be more than one leader.

complications arise because partitions can occur in an ad hoc network.


In regards to the performance of Figure 8 b), the two algorithms which are compared by sequential assignment also generate the extremely small number of idle cycles compared to the method of Figure 8 a).

as the suggested algorithm transmits query only for the existing tags on one bit collision and series two bit.s collision, the performance was improved by 67% compared to QTA and by 51% compared to 4-ary when the number of tags is 16,000. a) 32 bit random b) 32 bit sequence Figure 8.


The original design of the Java Anonymous Proxy (JAP) [4] infrastructure based anonymity network had clients exchange constant tra.c with the .rst mix of a cascade, in order to defeat end-to-end tra.c analysis.

this countermeasure was abandoned in the JAP deployment because its bandwidth overhead was considered too high.


Based on the archived data from RIPE RIS [l], AS 15412 normally originates only 5 prefixes.

on April 6th, AS 15412 suddenly originated thousands prefixes due to a configuration error[5].


soBGP: Under soBGP or any other Routing Topology Path Veri.cation protocol, paths are veri.ed to be consistent against a database of known inter-AS routing information.

recall from Section 3 that in our analysis, we only allow soBGP to use authenticated topological information from ASes that are soBGP speakers.


If a data packet is lost in a multicast network, the simultaneous retransmission requests from several participants of the multicast group increase the load and possibility that more packets may be lost.

some systems, such as DIVE, still prefer reliable multicasting.


Like current APs, a ZigZag AP decodes every packet from Alice, the high power sender.

un likecurrentAPs however,ZigZag subtractsAlice s packetfromthe collisionsignal andtry to decodeBob s packet.ifAlice s powerisexcessivelyhigh,evenasmallimperfectioninsubtracting her signal would contribute a signi.cant noise to Bob s, preventing correct decoding of his packets.


2.1 Traditional versus Sensor Network Synchronization NTP is scalable, robust to failures, self-con.guring, and has various properties that are needed in the sensor network world.

wireless sensor networks pose a number of challenges beyond traditional network systems.


Monitor and oversee participants hands-on exercises  The methods to facilitate interactions between the lecturer and participants such as question and answer are important.

they will be supported at the software level such as IRC, instant messengers, which are irrelevant to the StarBED facilities.


For example, applications, such as VoIP and IPTV, can dynamically adjust their service level that can be sustained by varying link-quality in the network.

link-quality-aware routing protocols [17, 21] can accurately locate a path that satis.es the QoS (e.g., throughput and delay) requirements based on the link-quality information.


The system can operate for almost a full day if powered by the car battery.

with this con.guration, the risk of depleting the car battery low enough to prevent the vehicle from starting is too high.


Power control does not have significant impact on either the number of packets received or delay.

as shown in Figure 11, power control does reduce accumulated energy consumption by 50% to 80%.


The technique used by Aqua to obscure tra.c on its client links has some similarity with Tarzan s mimics.

aqua splits payload tra.c along multiple paths, enabling it to better utilize available bandwidth within existing anonymity sets.


Local hosts use this information in the form of software patches to remove the worm and prevent future infections.

without methods to e.ectively and swiftly disseminate the patch in a secure way, these methods may not prevent a worm from propagating throughout the network.


The cluster header nodes receiving the data announcement packet store it in their cache.

since the proposed protocol uses permanent grids, there can be void grids that do not contain sensor nodes [4,6].


In contrast,our mobility emulation approach is good for testing core ad-hoc network mechanisms.

ns2 emulation is more accurate for end-host applications because it simulates all layers (physical layer and up).


Information propagation processes in such static networks have already been well studied [1].

this kind of static view fails to capture the network dynamics, that is shown to be very critical to the information propagation problem.


Note that the CS threshold and dCS is configurable until it reaches the lowest boundary determined by the sensitivity of the carrier detect circuitry of the given radio hardware [14].

we adopt a smaller, fixed dCS (350m) in the proposed scheme because the adaptive adjustment of this value would be complex [29].


Procrastinator and IMP represent two different points in the design space.

iMP is a system designed to optimize prefetching.Procrastinator never prefetches on its own it only delays fetching of network objects.


Theoretically, our task scheduling solution is effective because it implements a static load-balancing scheme.

it can not recon.gure the system structure, which means it can not solve the problems caused by imbalanced services distribution evolved in runtime.


A global picture of the network is required to run these algorithms.

wSNs are usually largescale networks which contain hundreds of nodes.


It is critical in such synthesis that the important properties of real TMs are accurately represented in the synthetic TMs, otherwise incorrect results may arise.

the properties of real-world TMs have not been exhaustively studied as yet, and it is not currently known which are most important.


When a stream s cutoff threshold is reached, Scap creates a .nal data processing event for its last chunk.

its stream_t record remains in the hash table and in the access list, so that monitoring continues throughout its whole lifetime.


The localization error is accounted for in the following analyses.

we show that it has no impact on the asymptotic results derived in this paper.


Then, each node computes a Minimum Spanning Tree (MST) on its own local graph.

not links between all nodes but only virtual links between cluster heads are considered.


We now need to account for the fact that in each epoch a set is not subdivided with probability 1 -p. When a set is not subdivided its size will still decrease somewhat in each epoch because the algorithm always removes from the set any silent nodes that are directly transmitting to a node in R and re-routes the remaining nodes in the set.

to get a rough upper bound on the running time of the algorithm it su.ces to ignore this subtlety and assume that in each epoch the size of the set stays the same with probability 1 -p. Hence, the probability that the algorithm takes r+iepochs to complete () r+i-1 is at most r (1 -p)i .


When nodes move, routes break and must then be reestablished or repaired.

neither RaWMS nor shuf.ing suffer due to mobility, since they do not use multi-hop routing.


On the other hand, time dimension is flexible enough to adjust the number of available instances of virtual networks and dimension capacity by controlling lengths of unit time slot and superframe.

space dimension is somewhat complicated.


6.1 Protocol Timers A system with perfect clocks could implement the TDM protocol operation through synchronization using a single slot timer.

due to imperfect clocks, additional mechanisms are needed to keep nodes synchronized.


In practice, the default path can be the one that leads to the controller.

as the routing policy is relaxed, the actual path to follow to reach a suitable egress point is not imposed.


Using these optimal schedules as the theoretical reference point, we demonstrate that existing neighbor discovery algorithms like Quorum [23] and Disco [7] are 2-approximation algorithms of the optimal.

the U-Connect protocol achieves a 1.5-approximation of the optimal, and also solves the asymmetric asynchronous neighbor discovery problem.Wehave used approximation algorithms for performance comparison of different neighbor discovery algorithms as it is a well known technique applied to minimization problems in computer science.


Finally, it is worth mentioning that correlations and variations in time of the PRR of a given link, may in.uence successive retransmissions and they form part of our future work.

some of our empirical tests show that good and bad channel periods of a static link follow an exponential distribution (i.e.


Optimal gateway node placement in multi-hop wireless networks is investigated in [25, 43] from an optimization viewpoint.

in these papers, the impact of myopic behaviors by autonomous domains on the overall network performance is not studied and quanti.ed, which is the key focus of this paper.


Modelling Posix threads as cSimpleModulesisadvantageous regardingthelogical coherence of entities receiving and emitting messages.

in order to simulate conditions that trigger Posix threads an additional message must be provided.


It also has control overhead and forwarding-table sizes that are proportional to the number of subnets (i.e., pre.xes), rather than the number of hosts.

introducing IP routing breaks many of the desirable properties of Ethernet.


Continuing this model, [7] proved that if the previous conditions hold and a domain can check whether packets follow the advertised path, then BGP is incentive-compatible.

[3] concludes that this may not be the case if the preference function of ISPs is sensitive to the level of attracted traffic as well.


In a sense they are optimized for the specific applications they support.

running three separate infrastructures comes with significant costs for an enterprise.


An analysis of the BGP data show that the average number of BGP updates for whitebox testing (instrumented RCS), blackbox testing no queuing (single BGP announcements sent to RCS at a time), blackbox testing over 24 hours is only 6 messages per second.

real-time (BGP announcements sent to RCS in real-time) averaged over 30 second intervals, the maximum rate is much higher, going well over 100 messages per second Figure 8 shows the amount of memory required by the RCS as a function of group size and for different numbers of pre.xes.


In particular, we focus primarily on URLs embedded in email content because they form the most critical part of spam emails URLs play an important role in directing users to phishing Web pages or targeted product Web sites [2] 1.

the following two observations make it challenging to derive URL signatures that distinguish botnet spam from others.


In reality, we will not have even distribution of .ows into various buckets.

when the number of .ows is far larger than the number of buckets, which will be the case with our parameter settings and intended workload, we can Algorithm 2: Algorithm to compute Lp norm with bucketing 1: Pre-processing stage 2: Initialize a sketch M[1 ...k][1 ...l]toall zeroes 3: Fix l p-stable hash functions sh1 through shl.


PROO F. Suppose there is no common bit shared by all of the higher priority rules; that is, all higher priority rules cover all possible bits at each location in the match.

there exists an optimal general rule, P *, that has only 1 bit un-wildcarded for a packet that does not match any of the higher priority .ows (e.g., a rule matching x1xx or xxx0).


Moreover, all possible configurations of system parameters have been specified in the current standard.

to the best of our knowledge there are no specifications on how to determine the optimal combination of system parameters in order to support the committed QoS in terms of throughput, delay and delay violation probability.


In case of LBP, it is enough to include one ACK slot in UL ACK-CH for the multicast stream.

bMMM requires N ACK slots, where N is the number of multicast recipients in the coverage area.


This is because if the entropy of the possible error sequences is low, one should need fewer bits of redundancy to correct them, no matter the length of the error.

schemes such as Reed-Solomon lack the ability to adapt to any arbitrary error pattern, because they aim to correct all errors of a given byte length.


by unilateral deviation from his strategy [1].

nE constitutes a rather weak notion of equilibriain repeatedgames[1] andhencewefocusonNE with a specialproperty,known asthe Subgame Perfect Nash Equilibria(SPNE) [1].


They range from proprietary ones such as Adaptec s Duralink[2], SUN s SunTrunking[16], 3Com s Dynamic Access[1] or later ones following the new standard such as HP s Auto Port Aggregation[12].

while all these technologies are able to share multiple links from a stream of packets, none of them provide proportional sharing among multiple streams.


If a user breaks out of his VM and gains full access to an IB adapter, he can circumvent the redirection of his management operations.

the key-based protection in every node will keep him from actually modifying the network con.guration.


From the previous result, we know that the value of p only depends on L and e. Thus, given the same probability of establishing direct keys between sensors, our proposed scheme has no limit on the total number of sensors it can support.

the random pairwise key scheme can only support at most p c sensors, where c is the number of cryptographic keys a sensor stores [5].


Inthisprocedure, wedonotneed to .xthemaximumlength ofthegenerated random walk.

this random walk terminates wheneverthe walker steps on a sink node.


A least squares approach can still be used to obtain an estimate for the position.

these errors are likely to degrade the performance of TDoA based localization.


We implemented theCell-ID localization and tracking into a GSM network.

the concept is applicable generally to anycellular network with HLR and VLR functionality and a signaling protocol similar to SS7 MAP.


This happens when the residing grid row and/or column of C(a) is part of the perimeter of HCell(a).

due to randomized distribution of SPs, it may not always be the case.


Overall, analyzing the rule sets we come to the surprising conclusion that packet classi.cation databases in the core, which we did not study here.

iSP2 did have large edge router databases.


Conventional end-to-end timing analysis considers that a malicious AS observes traf.c from the Web server to the last relay, as well as from the .rst guard relay to the client2 .


perhaps slightly mistaking one growth type for another, when the data shown consists of a combination of many di.erent models, is acceptable, however it is not acceptable to confuse normality with irregularity.


In H.264/SVC, scalability refers to the removal of parts of the video bit stream in order to adapt it to the various preferences of end users as well as to varying terminal capabilities or network conditions [29].

scalable video coding as H.264/SVC still requires end-to-end QoS for maintaining the priority of which frames packets of which layer are supposed to be dropped .rst in order to control video traf.c congestion and deliver better video quality [30].


Stochastic Carrier behavior is much alike the above mentioned behavior.

stochastic carrier is a state which can only be reached from the recruit state.


This technique does not require to reorder packets, because packets are processed overlapping together.

this technique can only be applied to static scanning engine because the maximum length of a pattern is priory known.


This might tempt one to conclude that as soon as more than one .ow is active in the network, giving too high a weight to channel diversity can be detrimental and it might be simpler to just ignore it.


The di.erent lines indicate that larger bu.ers at the client side lead to the more desirable e.ect of increased stall time, but fewer number of stalls.

(1) con.guring too large a bu.er size would unnecessarily delay the video playout in the beginning, and (2) adapting the bu.er size dynamically based on overload would require a new protocol between the network infrastructure and the client players.


Sequential semantics force consistency because policy evaluation is terminated before a con.icting statement could be reached.

by terminating evaluation mid-policy, EPAL renders sound local reasoning impossible.


These children propagate this information.

a node that detects a partition and is implicated in such a branch chooses as its new Leader the most valuated node in the cluster and sends a message to inform all the other node in the new cluster.


This may result in the device choosing a small T and wasting energy.

we can still safely upper bound Pmiss by 12 Pshort(T ) for the Pareto distribution.


If the object is not selected, w =0, i.e., usage which is not sampled makes no contribution to usage estimates.

if the object is selected, w =1,the the contribution x to usage is scaled up by a factor 1/p(xx)relative to the actual usage.


The critical conditions are asymptotic results that get more and more accurate as one considers a larger and larger deployment area (so that the number of sensors deployed gets larger and larger).

deployment regions, in practice, will have a .xed dimension and therefore one might ask What kind of con.dence can one get in real deployments when using our critical conditions to determine the minimum number of sensors to deploy?


Some people may think that we do not need to worry about the lack of processor power because the increase of its power may be rapid enough to catch up with the power for processing huge amount of packets.

in fact, the number of packets in networks is increasing too.


From the table we can see that in average case for all the scenarios the range has covered for more than 87 (or 93%) observed signal strength value, for n equals to 1 (or 1.5) respectively.

in the worst case, n=1 results in around 30% samples be treated as out range.


Since then, a huge array of subsequent research has been made to develop distributed medium access algorithms with high performance guarantee and low complexity.


This .nding is unsurprising since users often visit search engines to navigate out.

we .nd that when visitors navigate to other domains, OSN visitors are more likely to spend more time at the external domains compared to search engine visitors.


To increase service availability in a cost-effective manner, cloud providers are deploying their services across geo-distributed datacenters [23], and building their networks based on a scale-out design using inexpensive commodity hardware [17, 34, 36].

as http://dx.doi.org/10.1145/2523616.2523638 the number of devices and links in a datacenter grows, failures become the norm rather than the exception.


In the centralized mechanism such as LKH [2], a group manager controls the whole group members and distributes a group key to only authorized members following the key hierarchy tree.

the centralized schemes have problems of a single point of failure and 1-a.ects-n , which means that a membership change of a member a.ects the whole group [3].


Thus, we do not claim that MinimaLT is formally veri.ed.

we do claim that MinimaLT will be far easier to verify than TLS, and that there are far fewer opportunities for mistakes in MinimaLT than in TLS.


Despite their disparate characteristics, in early days these two access networks were often presented as competing ways to create wireless capacity.

support of unlicensed and licensed bands on client devices and pressing need to relieve traf.c overload in capacity starved cellular data networks caused by unforeseen growth in smart phone use and mobile video has pushed greater integration of these networks.


Second, most class-based fair-queuing schemes aim to provide isolation between packets of different classes.

we expose traf.c at each limiter to all other traf.c in the system, preserving whatever implicit notion of fairness would have existed in the single-limiter case.


FlexCastisalsorelatedtodigitalfountaincodes[14]inthesense thatitdoesnotmatterifapacketislost,anditcanrecoverfromthe other coded packets.


The cascaded propagation of Bloom filter changes in both cases of service additions and removals is limited at most to 2d hops, which should set an upper bound of service update traffic.

it does not affect the correctness of the protocol operation, i.e.


According to the de.nitions in Section 2.2, a transmission of v using a power pv will increase the beaconing load at vehicle u since it is located inside CSA(v,pv).

the beaconing load observed by vehicle u also depends on the communication behavior of vehicle w because CSA(w,pw) covers u as well.


At this point in the protocol, the provider is con.dent that the consumer has access to the private key associated with the public key received in Step 1.

the provider does not yet have a high level of con.dence that the consumer is indeed whom the provider believes they are (e.g., someone other than the consumer could have stolen the consumer s smart phone).


Even though the percentage of correlated eventsisfairlylarge (41.8%), ignoringthe correlationdoesnotsigni.cantly degrade accuracy.

this algorithm greatly reduces required memory compared with the optimal algorithm.With the optimal algorithm, the memory use increases linearly with time for most sensors.


Physically realizing small-world networks with uniformly distributed long-distance connections is thus not realistic and distance, i.e., the wiring cost, needs to be taken into account, a perspective that recently gained increasing attention [20].

a network s topology also directly a.ects how e.cient the communication is, and thus how e.cient problems can be solved.


Encryption : Payload methodologies fail for encrypted payload which is bound to eventually become common, especially for newer versions of P2P protocols.

our methodology, at least in its current form, is inferior to payload analysis regarding detailed analysis of speci.c P2P protocols.


Moreover, the metrics considered in [14, 17] are not suitable for our setting: the type of errors considered there, such as those that correspond to the Hamming or edit distance are more suitable for general error-correction of biometric key extraction, [14].

here, we need to correct a di.erent class of errors that correspond to the shifts present in the runs within one of the two bitstrings (relative to the other).


Thus V (y)is enclosed by a disk centered at y with radius 2, denoted by D2(y).

the point on the boundary of V (y) closest to y,say v, is realized as the mid-point connecting y and one of its Delaunay neighbors (the sensors whose Voronoi cells are adjacent to that of y s).


the proxy  Table 4: Relationship between energy, delay and bandwidth Table 5: Webpage benchmarks Name URL # of Files Size (KB)  Figure 8: QATO TCP interface has to pay extra energy and bandwidth to get Ti, and the total cost isCcost i .


This was attributed to the fact that the measurements are made over a time window, .Tmeas .

during this period the endpoints still employ the power-control algorithm on their transmissions.


In these cases, speedup is also necessary.

researchers tried to resolve the speedup issue replicating different elements.


One way to handle multiple pre.xes would be to run a separate instance of VPref for each pre.x the elector can reach.

this would leak some information: If an AS A is invited by its neighbor B to participate in a VPref instance for some pre.x p, A can conclude that B has a route to p, even if B never exports such a route to A via BGP.


Indeed, Figure 6(c) shows that the percentage of lost streams in Snort and Libnids is proportional to the packet loss rate.

scap loses signi.cantly less streams than the corresponding packet loss ratio.


Then, they return to sleep mode again to save power.

while the connections of a MSS in the IEEE 802.16e have their Quality of Service (QoS) delay requirements.


PlaceLab provides software that enables users to easily setup a positioning service.

the tools needed to do researchhave not been releasedby the project management.


IEEE 802.11 Distributed Coordination Function (DCF) provides some basic mechanisms for coordination of these transmissions.

due to its distributed nature, DCF suffers from coordination failures, e.g., due to the very well-known hidden terminal problem.


To avoid recurring bu.er underruns and frequent quality switches, both of which are harmful to the viewer s quality of experience, several research groups have evaluated the performance of adaption schemes [5, 8, 10] (and proposed changes [11]).

they all use di.erent bandwidth traces due to lack of an available dataset, e.g., Akhshabi et al.


We could employ a more realistic model and assume that a state transition occurs at regularly spaced intervals (e.g., once every certain number of transmissions) and could still arrive at the same conclusion.

the derivation would be unnecessarily complicated and hence the expressions would be much less insightful.


The trace includes only international TCP traffic; KAIST sends domestic traffic on a path that was not traced.

the trace does include all external DNS traffic, domestic and international: the primary name server of the campus, ns .


A low-speed connection may use several concatenated lightpaths with the aim of being accommodated (multihop grooming facility [13]).

it is not allowed to split a low-speed request into lower speed connection and routed separately.


Brief Announcement: Efficient Flooding in Power-Law Networks* Farnoush Banaei-Kashani Cyrus Shahabi University of Southern California University of Southern California Los Angeles, California 90089 Los Angeles, California 90089 banaeika@usc.edu shahabi@usc.edu ABSTRACT Flooding is an effective mechanism for both broadcast and unicast modes of communication (in unstructured networks), providing broad coverage and guaranteeing minimum delay.

flooding is not a scalable communication mech- anism, mainly because of the communication overhead it imposes to the network.


The implicit requirement for this to hold is that radio waves arrive from all angles with equal probability, in which case the correlation coef.cient of the fading signal can analytically be shown to be approximating zero [23].

in real life it is not always true that multipath signals arrive from all angles equally and therefore larger distances are necessary to remove the correlation.


To accurately estimate the load, the geographic topology and traf.c pattern must be known.

such information is dif.cult to obtain in MANETs.


With 220 cycles the en nergy consumed d during the nig ght is higher than the c provide and the no ode stops its e one the supercapacitor can pr operatioon before sunriise.

ddaylight consum mptions will have fe ewer restrictions than nodes with hout recharge capapacities.


In a multi-hop network, power control can be used to limit interference from a transmitter to a local cluster of nodes with cluster heads acting as bridges between clusters [8].

power control cannot reduce the tra.c density within a cluster since densely deployed sensor nodes may remain single-hop neighbors even at their lowest power levels.


Sampling rate control, which is favored by higher z, appears at first to be opposed to the goal of variance control, which if favor by higher Z.

we argued that these goals could be rendered compatible provided the billing timescale is sufficiently long.


5.5 Dual-stack failures It would be interesting to know the proportion of connections that failed the dual-stack sub-test, because the clients tried to retrieve the test image unsuccessfully over IPv6.

we cannot di.erentiate reliably between IPv6-related dual-stack failures or other connectivity failures.


User Involvement: One could imagine requiring the user to walk around the home, trigger measurements, and manually label the physical location of each measurement.

minimizing information and tasks required from the user make it more usable.


In fact, even in networks with low level of spatial reuse, the correlation is still acceptable.

the separation metric does not work well in noise-dominated networks.


These aregenericproblems and the BusNet is of very much relevance to developed countries with good communication infrastructure.

the road surface monitoringsystem that uses theBusNetis of moreimportance todeveloping countries.


the expensive core switches/routers with higher wiring cost, since it uses more and longer communication links compared with the tree-based structures.

we believe this cost is well justi.ed by its scaling and fault tolerance features.


The system is insensitive to the exact value of p. Introducing a small amount of uncertainty/noise allows us to search over many more possible failure explanations, especially those with inaccurate descriptions, that might otherwise have been infeasible.

the uncertainty is small enough that, in general, a diagnosis that has one or more guess edges would have a lower probability of happening than one that has all edges acknowledged in the description.


Further, the exact analytical model can achieve more accurate results with non-optimal parameters.

the complicated calculation from the exact model is not convenient for larger networks.


(Figure 2), for each of which VFS offers an adaptation module.

the implementation of the module, its configuration and the creation of the mounting points require computer skills that not everybody has.


It also uses a two way message exchange instead of a one way exchange as in RBS [5].


We show that for local movement along edges in the communication graph, the information potentials can be adapted using a simple iterative distributed computation.

for non-local movement, the potential .eld might change signi.cantly, and iterative computation leads to packet loss and packet delivery delays.


This actually underestimates the in.uence of VeriSign, because VeriSign, Thawte, and Equifax are all owned by VeriSign and collectively they dominate the market.

because each brand o.ers a somewhat different user experience, we have chosen to break out the CAs by brand.


This scheme allows detection of spoofed IDs and of EMs modi.ed in transit by malicious nodes.

an additional scheme is required in order to detect malicious messages with incorrect content.


2.2.4 Releasing sensor nodes: During Tabu search after reallocation of Voronoi clustered nodes, it is good idea to release all nodes altogether.

this strategy may leave out good solutions and will consume more memory space.


With the help of other peers that are willing to offer their bandwidth, a mobile client is able to receive data even if it is not in the range of the neighboring APs.

in some real scenarios, the mobile clients tend to move actively and/or have a relatively low density, making it difficult to establish or maintain an instant end-to-end path.


5.1 System Overview In order to guarantee the integrity of a Web page through Internet, a Web sever should have a valid certi.cate which proves its authentic.

as mentioned in our design requirements, we want to reduce the system deployment cost for Web sites.


Under IEEE 802.11 MAC DCF mode, node 4 will first issue a RTS packet to node 3.

node 3 cannot successfully receive the RTS packet due to the ongoing transmission from node G to node 2.


An exception of the indicated message delivery ratio behavior happens when t=0.75, at which the cost is extremely low, indicating that routing has been severely limited to the most popular 25 percent area of the map, ultimately having an obvious e.ect on the delivery ratio.

as shown in Figures 3(a) and 3(b), the Space Syntax Sliding Scale algorithm considers a larger map area for routing as the threshold value increases.


Peers nodes responding to the receiver request are identified as Candidate Peers .

for the efficiency reason, the receiver peer will select a sub-set of candidate peers to start streaming video packets; these selected peers are called "active peers" The mechanism for peer selection, peer activation, and stream switching is modelled and presented in the following sub sections.


Subsequent researchers [2] [10] have addressed the issue of reliability by more complicated algorithms.


Similar to AODV-BR [20], SLR [27], and query localization [10], WARP limits the range over which nodes search for a route.

wARP differs from these approaches in that it actively probes and incrementally builds new routes without relying on a source or a destination to initiate route recovery.


An alternative design to RON would be to use a generic overlay infrastructure like the X-Bone and port a standard network routing protocol (like OSPF or RIP) with low timer values.

this by itself will not improve the resilience of Internet communications for two reasons.


The results in [12] present improvements in performance in terms of throughput over orthogonal schemes.

there are two issues with the work in [12].


Europe, on the other hand, had one of the the best frame rate distributions but has the second worst jitter distribution overall.

for the cutoff of imperceptible jitter at 50 ms and the potential upper bound of jitter at 300 ms, all servers, except Asia, are comparable.


at work in the PUSH&PULL protocol: setting µ -2 1 small means nodes query their neighbors early, thus reducing the latency, but at the cost that most nodes issue unnecessary requests, thus incurring high overhead.

setting µ -2 1 large means nodes wait a long time to issue query requests, so they don t issue as many unnecessary requests, but necessarily incurring a longer per hop latency.


This is an advantage since the estimation of local rates is much more dif.cult due to the small number of samples available.

there are two reasons why their measurement may be worthwhile: (i) they could extend the time intervals over which the difference clock Cd(t) can be used to measure time dif ferences, and (ii) to optimize the performance of .


This brute force algorithm has a worst case performance of O(n(2L - 1)) possible wildcards.

we can be certain that we will .nd the best possible rule this way, so it is useful for calculating the approximation of the optimal solution by the heuristic algorithms.


Human mobility in PSN has appeared for several years.

there is little works, which apply dynamic mobility features into the routing design.


The promotion delay is not included in either the upstream RTT or the downstream RTT in Figure 7, since the promotion (if any) has already .nished when the monitor observes a SYN packet, as illustrated in Figure 9.

we are able to infer the promotion delay using the TCP timestamp embedded into a TCP packet when the packet is about to leave the UE.


CAMBrowser offers an alternative to cumbersome navigation menus or text coding that is valuable for low-literacy users.

for our work, the users were literate and given the complexity of implementing CAMBrowser, we decided that the cost outweighed the benefits.


If these updates are broadcasted too often, it may lead to wastage of resources and ine.cient performance of the network.

if these updates are broadcasted too infrequently, nodes may maintain incorrect picture of the network, possibly leading to lost packets, routing loops and delays.


For example, the power law structure of the AS graph only considers the adjacency of ASes: the link between Sprint and AT&T, for instance, is modelled by a single edge.

in the real world the Sprint and AT&T ASes are connected to each other in a large number of places around the world.


When the responding Data packet returns, due to the symmetric routing property, the Data packet will be received by line-card ...

line-card .. fails to .nd the Data packet in its PIT because the corresponding PIT entry is on line-card .., thus this Data packet does not know where to go and will be discarded.


Consequently,thefaultlocalization properties of NetworkConfessional are provided only at the granularity of deployment informally,thesub-graphof the domain topology whosevertices are participating domains and whose edges link participating domains only over domain paths that include no participating domain in the topology.

theloss offault-localization resolution dueto partial deployment can be viewed as an incentive for adoption: a domain hasto reportonits performancein ordertopreventits neighbors from blaming their problems onit undetected.


The intuition is that if we only schedule the big .ows we can fully utilize all the bandwidth, and yet have a small scheduling cost, as dictated by the small number of .ows.

data center traf.c analysis shows that .ow distributions are not Pareto distributed [6].


Solutions that are less e.cient from a technical perspective may do a better job of isolating the collateral damage of tussle.

the current trajectory of IP QoS design tries to isolate tussles.


A naive solution to this problem would be to maintain per-.ow counters that are updated upon every packet arrival.

as shown in [1], this approach cannot scale to the link speed of OC192+ since fast SRAM modules can only hold a tiny fraction of per-.ow state due to their size limitations, yet large DRAM modules cannot support such speed.


As in scenario 2 monitors in Cr provide a majority of noti.cations about r1 s manipulated packet to s1.

just like s1 all monitors in Cs received the same majority of noti.cations and thus have the right packet.


An unsolicited ARP reply will be generated to advertise that the IP has been moved.

the location dependentresources and the need for hardware level reliable service leads to additional challenges for the migration of OS-bypass networks.


When the Flag is false, however, CSPR will recover the path if the amount of packets accumulated in the group is suf.cient (the number will be given later).

if no entry matched, CSPR creates an entry for this new path group, initializes Flag as false, and inserts the packet into the buffer.


For example, HTTP protocol includes the size of objects in the head message.

in a typical application protocol session, multiple objects will be transferred, which makes the use of the header information impractical.


4.1 Improving Content Delivery The basic DONA design provides support for server selection, which is useful when accessing widely replicated data or services.

dONA can provide better support for content delivery in three ways.


Another possibility is to .x the travel speed and to adopt electronically-controlled nozzles to adjust the .ow rate for smaller areas in the .eld.

the simplicity, good accuracy, and low cost are signi.cant advantages of the former option.


Existing protocols cannot exploit thisproperty.

sourceSync can leverage thefactthat multiple routersinameshoverhearthe samepacketto have these routers transmit the packet simultaneously towards the destination.


Femto-cells enhance coverage in a small area such as a home but generally provide access to a closed group of subscribers.

deployment in the same frequency as the containing macro-cell can cause strong interference to external users in the same region.


REDUCING EXPANSION OF RANGE RULES Ternary CAMs are directly suited for storing ACL tables that have rules with wildcards.

a range cannot be stored directly in a TCAM since a TCAM supports storing only 0, 1 and x (don t-care) states.


However, for larger noti.cation areas, where the position and the number of the broadcasts matters, we observe that only our approach and epidemic message dissemination achieve acceptable performance.

as we see in Figure 8, the message overhead of epidemic is again much higher due to the high number of polls.


As the number of candidate .rst hop ASes increases to 3, the actual .rst hop AS minimizes the difference between hc(S, D) and hc(S, T )+ hc(T,D) about 75% of the time.

the number of ties signi.cantly increases and thereby degrading the accuracy to about 65%.


In particular, the con.ict detection algorithm in FortNOX only conducts pairwise con.ict analysis between new .ow rule(s) and each single security constraint without considering rule dependencies within .ow tables [11, 13] and among security constraints (represented as a .rewall policy in our approach) [26].

when FortNOX detects a security violation caused by new rule(s) installed by a non-security application, it simply rejects the rule(s) without offering a .ne-grained violation resolution.


Severswitch: A cept for the least signi.cant digit.


We believe this push analysis to reasonably capture the essence of LwPBCast.

we chose Pulling and have the following nonrigorous argument to support our choice.


As the density of APs grows there is generally more throughput available, as the vehicle can choose between a great number of APs and is more apt to select those with greater signal strengths.

as the number of APs grows to as high as 120 or more, throughput is generally as good as lower numbers of APs.


INTRODUCTION Peer-to-Peer (P2P) .le-sharing is a popular, cheap and effective way to distribute content.

p2P .le-sharing applications su.er from a fundamental problem of unfairness.


The interaction between MUSC and MIRA occurs in all Q3MAs and only in Q3MA-H and Q3MA-C the SessAnnounce message is triggered, because they are the ingress point of the session in the clusters C2 and C1 respectively.

in Q3MA-B, since it is an access-Q3MA, MIRA configures the network and the multicast tree only on the outgoing interface.


Tang and Gerla [10] investigated the issue of fair sharing of MAC among TCP flows in wireless ad hoc networks and a yield time scheme is proposed to improve fairness by introducing a larger yield time.

larger yield time for every node will even penalize the node that used the channel less than its fair share, only because it is the node that used the channel last.


As it is shown from these figures, in the first case the bottleneck of the design is the processing power of the 1 2 3 4 5 g m h c i f p g t m g i  1 2 3 4 5 2 3 4 5 1 6  1 7 1 8  1 9  processor.

in the second case, the bottleneck of the design is the bandwidth of the common bus.


When f = 0, the equation is a pure diffusion process leading to uniform y and realizes a global view.

when f = 1, the in.uence only depends on a local one-hop view.


However, this heuristic is not scalable to a graph of thousands of servers.

our simple algorithms optimize the mean end-to-end delay in a geometric problem instead of on a graph, and easily scale to any number of servers.


Under safety applications, Vehicle Collision Avoidance (VCA) has attracted considerable attention since it is directly related to minimizing number of accidents on the road.

non-safety applications may include real-time road traf.c estimation for trip planning, high-speed tolling, collaborative expedition, information retrieval, and entertainment applications.


Thus smaller |s| o.ers larger freedom of RTT heterogeneity across each route to maintain its negative de.nite property.

it is a less contingent condition since each source is typically enabled 2 or 3 routes in reality.


Also, all concurrent transmissions in either set seem to start almost simultaneously.

such TDMA mechanism is nowhere speci.ed in the protocol.


This is because AMS cannot resolve packet mark collisions of routers at the same distance.

rPM has small amount of false positives at all distances.


They address not only HNB security issues but also suggest possible future direction to secure the HNB architecture.

most of this research considers and frames security threats and issues abstractly.


Such a message being redundant serves no useful purpose and hence occupies precious bandwidth; thus being irrelevant to traffic in the other direction.

it can relay messages by acting as a forwarding node.


Figure 11 shows that with our protocol, by increasing the number of deployed nodes, more nodes are turned off.

the number of on-duty nodes does not remain constant under different deployed node numbers.


Forwarding a message to essential nodes is still restricted to forwarding via a single node.

because of the fact that there can exist multiple paths to essential nodes (e.g.


We see that within networks with low degree of heterogeneity, those with a higher change event rate see more trouble tickets.

we do not see such positive correlation in networks with a medium degree of heterogeneity.


Then, it compares their properties with those of the information and informs suitable subscribers.

to ensure scalability, P2P-based Pub/Sub solutions apply distribution trees.


IP multicast can overcome infrastructure problem by providing one-to-many live streaming using multicasting at the network layer protocol to serve a large number of users.

its limited deployment limits the availability and scope of the service to the interested user[11].


When ( continues to increase, the ContactOnly algorithm achieves a little higher network throughput since only the nodes with best topologies are still remaining after extensive delete operations.

if we consider the number of uninterested nodes in the relay sets that the two algorithms, we .nd that the ContactOnly uses more uninterested nodes than that does InterestSpread when ( is increasing, which is not what we expected.


This message will include an extra field containing the minimum signal strength with which this packet has been received.

the node that knows the route to the destination generates a Route Reply where this extra field is set to the same value that this field contained in the corresponding Route Request.


speeds up the recession and thus stresses more the preference of forwarding packets to visitors of the destination s close neighborhood.

as desirable as it seems, if all packets are .ooded to these visitors, their bu.ers might be overloaded and start dropping many packets.


DISCUSSION In the previous section, we showed that novel wireless protocols can be implemented within the Airblue framework.

airblue is not amenable to implementing all wireless protocols.


Second, this paper considers mainly wireless mesh networks with low dimensionality (in particular 2-D mesh networks).

unstructured peer-to-peer networks exhibit more randomness and have high dimensionality.


1 sec), which means that if the end-user receives the beacon signal in the first overlapping area between VCZ-1 and VCZ-2, he/she will receive all the beacon signals between each consecutive couple VCZ-M and VCZ-N and, in this case, the probability for a successful handoff is increased.

the packet loss in MEC case is decent, since it is less than 0.5% for velocities up to 180 km/h and increases to 1.3% and 1.8% for 190 km/h and 200 km/h, respectively.


If there are no pending packets for the PSC I connection, the size of the subsequent sleep window is increased to be twice that of the previous one.

this increment process repeats until the size of the sleep window has reached the maximum value T I if packets are destined for SF .


The delayed reordering procedure cannot completely eliminate timeouts or triple duplicate ACKs when one path is signi.cantly delayed or lossy.

it signi.cantly reduces the rate of these undesirable events to the point that we can ef.ciently explore multiple paths and outperform single-path TCP in many cases, as discussed in Section 6.


Packets are DMAed to and from the VM directly to the NIC using the VF, avoiding the hypervisor copy and associated context switches.

the processor and BIOS must support SR-IOV and provide IOMMU functionality so that the NIC can access VM memory, and deliver received packets directly without hypervisor intervention.


In FastAuth, only 1-bit information (moving or staying)needs to be announced in each beacon.

without considering the dependency between beacons, the vehicle has to encode i possible positions for beacon Bi at T = i, because the vehicle can be anywhere between position 0 and i.


In general, when capturing honest sensor nodes, the adversary may be able to compromise their cryptographic secrets (assuming that such secrets are used in the system).

in this paper, we assume that the adversary cannot compromise cryptographic material.


DETECTION TIME In the previous section, we characterized the fraction of area being covered at any given time and over a time interval.

these measures do not reveal how quickly mobile sensors detect targets in the .eld.


The .rst solution may be more precise to estimate absolute distances because it relies on two dimensional data and not evaluation of a distance.

the precision of the GPS method is based on the assumption that we are in a obstaclefree simulation space.


Of course, one can augment the above propagation model by taking different types of materials or multiple building floors into account [6, 7].

propagation models quickly become overly complex if one aims at high level of accuracy.


Failure to do so may lead to catastrophic or lethal consequences.

road traf.c monitoring applications that measure several parameters such as traf.c density and vehicles speed to estimate the state of the traf.c on the road network require periodic transmission of the collected data.


According to the related work [23], the accounting gap would be given by data_suspension_time × application_sending_rate in principle.

this equality does not hold for the mobility scenario.


In order to maintain a large number of online players it is becoming essential for the game service providers to estimate game player perception and performance for their games.

advanced information about game playing conditions would allow game players to select different online games, different networks and ultimately different tariffs.