If this difference becomes sufficiently small at some point, the query point is assumed feasible.

if after a certain number of timeslots this difference is still large, the query point is assumed infeasible and a new estimate for e is returned based on the attained average link rate.


The transmitting node must lie inside this squarelet or 8 adjacent squarelets.

each transmitting disk can cover receivers from at most 9 squarelets.


Please recall that anonymous key exchange is typically used to provide privacy.

we just demonstrated that, in the presence of an active adversary, anonymous tunnels cannot provide privacy.


For example, anAGR of0.5 representsa50%decreaseintra.c, 1.0 represents nochange,2.0 represents a100%increase,3.0 represents a 200% increase, and so on.

as discussed in Section 2, changes in the commercialprobeinfrastructure can complicate ourgrowth estimation.


The result of the contracted coverage of the loaded sector is essentially a capacity gain.

users migrated from the loaded sector to the supporting sector will increase the interference level of the network.


In other words, most of the received spam corresponded to routing advertisements that were not shortlived.

this technique appears to be used intermittently, and during time periods when this activity was more prevalent, as much as 10% of all received spam coincides with routing announcements that lasted less than a day.


Mutation allows new genetic patterns to be introduced into population.

there is no guarantee that mutation will produce desirable features in the new chromosome.Generally, the mutation rate used in a GA is very low.


[5] improved prioritybased approach and proposed a new crossover operator, weight mapping crossover for solving the SPR problem.

the nature of the priority-based encoding is a kind of permutation representation.


Today, protocols such as Universal Plug and Play (UPnP) support zero-con.guration networking and are used for data-sharing and entertainment.

security mechanisms are neglected and are not integrated into current UPnP devices.


Considering performance in initial packet delay, average delay, packets delivery ratio, and implementation cost, AODV is believed a more suitable routing protocol for maritime mesh networking.

conventionally, AODV routing packets are delivered as usual data packets, and then it needs to apply bandwidth for routing information delivery.


3.4 CorrectingMulti-Con.ictsforSINR Protocol Model The protocol models may result in poor actual performance because they neglect interference from several sources and/or fail to fully exploit spatial multiplexing.

due to the relationship between the protocol model and the MWIS problem, we seek to extend the protocol model to improve the actual performance.


(a) Sample Topology (b) Sample Level and Label Assignment Figure 1: ALIAS Applied to a Sample Topology: Level and Label Assignments clusters by automatically locating pockets of strong connectivity in the topology groups of switches separated by one level in the hierarchy with full bipartite connectivity between them.

even assigning a common pre.x to all hosts connected to the same leaf switch can reduce the number of required forwarding table entries by a large factor (e.g., the number of host-facing switch ports multiplied by the typical number of virtual machines on each host).


IEEE 802.11 0 1000 2000 3000 4000 achieves a cumulative throughput of 188.2kb/s and a fairness in 10 00 1000 2000 3000 4000  Time [s] Time [s] dexof 0.64.

eZ-.owincreases the cumulativethrough- Delay F without EZ-flow Delay F with EZ-flow 3 3put to 304.6kb/s (a 62%throughputgainover the standard IEEE 30 25 20 15 10 30 802.11), increases thefairness index to 0.8, and drastically reduces  1000 2000 3000 4000 25 the end-to-end delay by an order of magnitude at least.


KEYWORDS: Inter-domain policy, Peering, Data-oriented Networking, Internetworking, Network Architecture 1 INTRODUCTION The Internet architecture was originally developed for the needs of distributed computing, such as telnet, FTP, and RJE [4].

the majority of the present Internet traf.c, especially between network domains, is of content delivery nature, such as .le sharing, static web content, Internet radio, or other recorded voice or video, or control traf.c needed to locate or deliver any wanted pieces of content.


In a unicast environment(when thegroup sizeis1),quota-basedprotocols(e.g.,Spray and Focus-A) perform only slightly better than smart .oodingbasedprotocols(e.g.,Prophet).

thegapbetween quota-basedprotocolsand.ooding-basedprotocolsbecomes much larger as the group size increases (as shown in Figure 2 (a)).


We observe larger variance in the number of active IP addresses for smaller bins.

the number does not decrease propor- tionally as the bin size decreases.


These results show that both measures generally increase within each constraint level as the network size is increased.

there is a signi.cant drop in both measures as the coordination constraint is tightened, reducing the chance of backo.s by limiting the number of eligible coordinators.


The Table 1: Notation DHT stores information required to contact other UAs for sendingthem applicationlayer signaling messages.

the information stored in the Pr2-P2PSIP DHT di.ers from P2PSIP.


In a fire situation, for instance, it is very important to have a reliable, fine-grain monitoring of the physical environment so that it is possible for the rescue teams to understand what is happening and take the best emergency actions on the environment, avoiding lives and patrimony losses.

in order to understand what is going on in the environment and take the right actions, it is necessary to interpret the collected events accurately.


The crash occurrence percentages are not negligible.

we make the following observations: (i) we consider only vehicles coming to a full stop but in many cases a simple slowdown would be su.cient to avoid the danger, (ii) we do not consider the actual road conditions that correspond to the given, adverse channel model; when the road is congested, drivers tend to adjust their speed to their neighbors, thus avoiding or signi.cantly reducing the exagerated here danger, (iii) the application model we employ could be improved, for example, by bu.ering emergency messages originating from not yet validated vehicles, in order to speed up the provision of the alert to the driver once the message is validated.


This package tries to load the whole graph into main memory to increase the performance.

loading the complete graph based on two weeks of e-mail tra.c was not possible, despite the fact that our processing machine has 16 GB of memory.


The original measurements appear to be very noisy featuring multiple spikes and drops.

by using a weighted moving average .lter with a = 0.9, we can smooth the overall signal capturing the long term behavior of the AP across time.


IP-layerREhas recentlybeenleveragedinthecontext of cellular wireless networks, providing up to 60% bandwidth savings on lasthop cellularlinks[22].

rEfactortakesREastep furtherby adding thebene.ts of content overhearing, afeature not currently available in commercial cellular networks.


This agent is responsible for replacing both the encryption and decryption module of the visited router with the newer version.

when the distributed dependencies of the encryption modules towards their peer entities (located at the other host) are ignored during the upgrade process, the correct functioning of the encryption services will get disrupted.


LR reduces the overhead of route setup to O(n log n)and nodes only hold state for their immediate neighbors and their next hop to each landmark.

lR requires a protocol that creates and maintains this hierarchy of landmarks and appropriately tunes the landmark scopes.


This strategy clearly ensures WPE, if (but only if) the updates of round 2 are sent out after packets forwarded according to the rules before round 1 have left the system.

if packets can incur arbitrary delays, then there might always be packets left which are still traversing the old (solid ) path from s1 to s2 .


Thus, the analysis we can perform on the Default MDT is limited to aggregate analysis based on sending data at ingress PEs.

the Data MDT had a higher rate of agreement.


Similaris the casefor the usablepath routing strategy(U), appliedextensivelyinEthernet switching4 .

the rest of the routing policies listed in the table are incompressible.


DA-ARC successfully adapts its behavior to DA-RR to avoid limiting network capacity for dense network cases while still following the performance of DA-WR for sparse network cases.

the last chart for NL = 320 pps holds the same trends seen at NL = 240 pps, with DA-WR degrading its performance further and yielding only less than 0.1 PDR at TS = 2000 m. DA-ARC does not degrade its performance much even at this network load for both dense and sparse networks, yielding 0.82 PDR at TS = 2000 m and 0.5 PDR at TS = 5500m.


However, they focus on single-antenna, single-user transmissions and thus the characterization is restricted to metrics such as path loss, delay pro.le, and attenuation through materials.

our work focuses on the aggregate effects of these metrics with respect to MU-MIMO transmissions, namely temporal and spatial correlation in outdoor and indoor environments.


Thus we developed our model to examine Bluetooth s neighbor discovery performance.

our model is general and can be adapted to other radios.


They .nd that google.com, yahoo.com, youtube.com,and facebook.com currently rank among the most popular sites in terms of number of visits.

in this study we analyze popularity in terms of traf.c volume.


Moreover, leveraging the broadcast nature of wireless media enables SPAWN to reduce redundant transmissions.

the peer discovery method which is based on gossip mechanism, incurs packet overhead; and the proximity driven piece selection strategy induces delay which might have negative impact on the performance of a VANETwith high speed moving vehicles.


On a last note, we remark that the rubberband representation used in NoGeo algorithm [28] is essentially the discrete version of .nding a harmonic map between the simply connected domain de.ned by the sensor .eld outer boundary and a convex planar domain.

harmonic maps for multi-holed annulus can not be guaranteed to be a diffeomorphism.


Resource reservation uses packet or link scheduling on multiple logical or physical queues to explicitly reserve and allocate output bandwidth to each class of traffic, where a class can be a single flow or a group of similar flows [8].

explicit resource reservation changes the current, effective "best effort" nature of the Internet, and the al-gorithmic complexity and state requirements of scheduling make its deployment difficult [11].


3.2 Asymmetric Bagging The purity of extracted negative samples is critical to the performance of the .nal classi.er used for testing.

we observed that simply applying a traditional classi.er in the iterative method cannot guarantee the high purity of obtained new negative samples.


In this case, ep can be numerically obtained from (5) and (7), given FXm (·) expressed in (2).

it is di.cult to calculate the explicit forms of FXp (·)and eq.


The architecture proposal is based on agents, called of Distributed Network Agents (DNAs), that compose the management overlay and can execute connectivity and QoS monitoring tests in a distributed fashion.

the proposed architecture allows only fault and performance management.


Several recent e.orts by researchers and vendors have reduced the energy-related costs of individual base stations, such as using more energy-e.cient components (especially power ampli.ers),better cooling, turningdownresource usage at idle times, or applying alternative energy sources [4, 5, 9, 18, 31].

limited attention has been given to designing or optimizing the overall network architecture to make it more energy-e.cient, either statically or dynamically.


We also extend the evidence-to-opinion mapping operator of subjective logic, so that mobile nodes can represent ignorance during the establishment of trust relationships with other nodes and also when they move away from those nodes due to mobility.

evidence-to-opinion operator holds only for direct and observed opinions for the reasons explained in Section 3.2.


However, gradient based schemes are not very agile and are unable to cope with dynamism such as node failures [9].

the bio-inspired nature of Fire.y based synchronisationshows that itcancopewith failure.


Regarding the energy consumption of the streaming links, observe that among the four partitioned schemes of Figures 5(a), 5(b), 5(c) and 5(d), the 7:1 has lower energy consumption as a result of the high spreading gain.

in the 1:3 the energy consumption is much higher than in any of the other schemes.


Our system can overcome the potential bottlenecks because we allow its results to be approximate.

we want to achieve the most accurate results possible with the existing resources.


In IrisNet, the nodes that implement this interface are called sensing agents (SAs).

services must store the service-specific data the SAs produce in a distributed database.


in selecting the energy threshold to keep the minimum total energy consumption and the maximum total detection error probability as low as possible at the same time, especially when the minimum SNR condition is bad.

under the good minimum SNR conditions, for example when .min = 5dB, a wide range of .


The reason is that the level of noise over these channels is very low and since IEEE802.11 transfers video data only, more data is available for the video decoder resulting in slightly better video quality than that of under ACE.

as the BER increases, PSNR values under IEEE802.11 ARQ tend to decline rapidly.


Stations A and B cannot sense transmissions by station C; simultaneous transmissions by C and B would cause corrupted packets at the access point, AP.

not all simultaneous transmissions lead to corruption.


INTRODUCTION Modeling the performance of routing in heterogeneous delay tolerant networks (DTNs) is challenging since it must handle amount of di.erent nodes with wide characteristics coexisting together.

with the rapid growth of different types of users (in the terms of coverage range, transmission power, bu.er space and bandwidth), heterogeneous DTN is a trend in the further.


2.3 Discussion We argue that the Speedtest data are compelling from the perspective of their richness, availability in a huge number of markets and broad adoption by users.

there are several limitations that are important to acknowledge since they could in.uence the conclusions drawn from our study.


For packet thinning, the process is simple since only the retained packets have to be classi.ed.

for .ow thinning, all packets have to be put into .ows before they can be discarded.


Moving an existing base station requires the cells surrounding the old and the new position to be re-trained.

since base stations are typically wall-mounted and require power and a network connection, they cannot be moved easily, so changes of this type should be very rare.


This causes more messages to be routed through the high-degree nodes.

the output network of CKN has a more uniform degree distribution, which helps the routing load to be more evenly distributed among the nodes.


[9], [11], [17]) and new transport protocols such as ATP [15] were proposed for multihop wireless networks.

only little work focused so far on improving fairness and performance of TCP over hybrid wireless/wired networks comprising a multihop wireless IEEE 802.11 network and the Internet.


R2CP: RADIAL RCP We have shown in Section 3 that a receiver-centric transport protocol like RCP has performance gains over a sender-centric one, in terms of intelligent loss recovery, scalable congestion control, and ef.cient power management.

the recent trends where mobile hosts are increasingly equipped with heterogeneous wireless interfaces, have severely exposed the limitations of the functionalities provided by existing transport protocols.


Nodes switch from one slot to the next according to a .xed schedule (every 10 ms in our current parameter settings).

the decision to switch channels may occur while a node is transmitting or receiving a packet.


For increasing x, the number of external pre.xes remains roughly constant up to turning point (a) around pre.x length /24, and decreases exponentially for x> 8 bits.

the number of internal pre.xes falls exponentially with x and levels o. at turning point (b) around 16bits.


This output gave us an error of 0.4 meters for this one estimation example.

this output can be treated in order to improve accuracy.


There isanobviousdi.erence inthetimeat which activity peaks within the two ASes.

the actual peak is di.cult to identify from a single 24 hour period.


However, Vivaldi is not very accurate at .nding the nearest neighbor.

although Meridian can .nd the nearest neighbor much more accurately, Meridian requires online measurement probes.


The concept of clusteringisinnoway newandithasbeen used asameansfor providing optimized communication inbothDTNprotocols toimproveforwarding decisions[8] andinlast-hop stylevehicularnetworksto support extended connectivity totwo or morehops around an access point.

if one looks at clustering not as an optimization possibility, but as an intrinsic characteristic of vehicular networks, clustering not only shapes the network topology, but also resultsin a set of applications with requirements and communication patterns that are so different that clearly they cannot be supported ef.cientlyby a single communicationparadigm.


It is also a complete mobile middleware and allows a full integration with Web services and applications.

there are no commercial devices making use of Android although a great e.ort was invested in implementing a full featured open operating system for mobile devices.


In the context of open broadband access networks, such mechanisms may be applied to subscription data or other static information such as the overall capacity of the local loop.

the bandwidth being consumed by the residential user changes in an unpredictable manner and accordingly cached values while potentially indicative cannot be relied upon.


These works mainly concern the homogenous networks, where nodes are distributed according to Poisson Point Process.

the heterogeneity of CR networks, caused by the heterogeneity of spectrum opportunities over time and space, makes the study of CR networks different from that of homogenous networks.


Recently, a routing protocol was developed, combined advantages of the former and the latter, called AODV(Ad hoc On-demand Distance Vector).

despite advantages of AODV, it makes overall network performance weak due to nodes that move frequently, resulting considerable routing control traffic.


If the data delivery is successful, node A ends the current packet forwarding session.

if the transmission fails, the node A wakes up again at time t2 and tries to send the packet to the node B2.


It can be seen that when the network load is low, both EVCs and baseline perform well as packets are able to use pipeline bypassing to shorten the critical path.

as the load increases, the latency gap between the baseline and EVCs widens.


Although this cost is minimized due to recent technology advances, it could still be considered signi.cant for simple users.

superpeers can be viewed as tra.c aggregation points.


One could argue that interference in the beginning of a mic recording might not be cause for concern.

when clients are mobile, a mic may be sensed only in the middle of a recording.


For example, link breaks (path failures) caused by mobility will also result in very low throughput of some TCP .ows.

such low throughput should not be recognized as unfairness (at least not the unfairness issues targeted in this paper).


aRi(t - 1) + (1 - a)di(t), where a< 1 is a constant typically close to one.

thus, we have a recipe for achieving PF allocation of rates [2]: m For all timest,assign dataratesdi(t) suchthat i di(t)/Ri(t-1) is maximized among all feasible di s. this maximization problem can be challenging for two reasons.


In literature, we have found two works that have used this class [4, 14].

for some instances the final result was smaller than klb and in our work this is not possible.


We conclude three major distinctions: 1) The data structure to implement the ENPT in Original NCE involves complicated memory management, such as data movement, fragment management; 2) Original NCE allocates consistent codes to components and does not allow identical components be encoded to different, dynamic codes, which fundamentally contradicts with the code allocation function .. in this paper; 3) Original NCE only achieves lookup speedup,but does notexhibit good support for insert and delete operations.

in this paper,NCE not only signi.cantly accelerates lookup,but also insert and delete operations.


SNMP enables network management functionality but its focus lies more in the status of the network device itself.

these protocols are not suitable for Wireless Sensor Networks due to high overhead and also WSN often use di.erent protocol stacks.


2.3 Reducing Backlight Power Consumption As mentioned earlier, the backlight accounts for signi.cant energy overheads in a low-power device.

signi.cant energy savings are possible by operating the device at a lower backlight intensity levels.


Since the saturation throughput is slightly lower than the maximum throughput which the network may achieve, this can also be viewed as a conservative estimation of the clique s capacity.

for admission control decisions, a conservation approach can always ensure better QoS guarantee.


Our previous overlay-emulation results show the potential for good performance from ILNP [26].

we present a summary of some related work, focussing on those solutions that have been reviewed by the IETF or the IRTF.


Based on the assumption that leechers leave the system upon completion of download, one model proposes to optimize average performance by lowering the download rate for high uploaders to keep them in the system longer [9].

in practice, many leechers already remain in BitTorrent systems as seeds [22].


A parallel methodology could be based on FIN .ags, since all TCP sessions should end with a FIN packet.

there may be many .ows for which this is not the case: a SYN-.ooding denial of service attack that employs .ows comprising one SYN packet.


From the perspective of an agent at source s, the routing decision made at intermediate node r in.uences only the performance of the path section from r to t whereas the performance of the section from s to r is .xed.

in order to make the routing decision, r must gather traf.c information about the set of paths between r and t. r cannot control which one of the possible paths a packet will take once it has been forwarded to one of the vi s. Thus, r cannot exploit exhaustive information about all possible paths.


Unified approach: One might speculate that the various problems we aim to address could most easily be solved by distinct mechanisms, working bottom up, perhaps loosely tied together at the top.

the KP as we conceive it is a single, unified system, with common standards and a common framework for knowledge .


The other option is to have fingerprints overlap each other as seen in Figure 3.b.

this configuration takes longer to gather and configure.


In opportunistic routing, vehicles are allowed to communicate even if there is no directly connected path available.

this communication is only possible with the cost of delay.


We veri.ed, by analyzing all BGP updates collected by RouteViews and RIPE NCC RIS, that all BGP routes stayed up without interruption.

figure 16 shows that the darknet traf.c sharply dropped at March316:57:00 UTC.


In particular, network management stations within the domain require access to local network statistics in order to detect failures, diagnose and isolate con.guration errors, track link and server loads over time, identify intrusions and attacks, monitor service levels, etc.Although local network managers stand to gain the most by exposing information within a domain, we note that distributed services/applications within the domain may also utilize this information to optimizeperformance(e.g., load balancing requests across a server farm).

one might conclude that it is best to hide all management statistics from nodes outside the domain perimeter, while permitting all access from inside.weargue that this policy is more restrictive than necessary.


In addition, the path-loss e.ect of a micro/pico-cell is calculated by Fmi =Fpi = 140.7+ 37.6 · log 10D(BSi,UEj ).

to calculate the environmental noise, we employ the AWGN (additive white Gaussian noise) model.


If dth = d, the probability of detecting the node as connected is 0.5, and Fconn is approximately 37% lower than Frss.In fact, Ir(d, dth)=2/p ~= d. =0.63 for dth  2.4.3 Discussion Comparison between Frss and Fconn shows that RSS measurements always carry greater information content than connectivity ones.

this is only true as long as the nodes are within the radio range of each other.


Satellite links are cost prohibitive, optical .bers cannot reach the rugged terrain of rural areas, and microwave links are expensive both in terms of monetary cost and engineering [9].

cellular, longdistance WiFi, and WiMAX based solutions require physical towers which substantially increases the cost of even a small deployment [21].


1) is well suited to the mobile ad hoc network scenario due to its better scalability, shorter response time and less communication overhead.

existing works addressing SDP in MANETs do not take the signi.cant delay in VANETs into consideration, so they will not work well in the VANETs environment.


At this point, identification of invariants entirely depends on human experience and skill.

some general criteria for considering the overall quality of a candidate set of invariants would include at least the following: Is the set complete?


At .rst blush, the J-standard architecture appears to thwart confusion and evasion dialing since LAESP messages contain the switch s interpretations of DTMF tones.

a target of a CALEA wiretap can circumvent her TSP by using a thirdparty service (for example, a calling card service) to route calls.


It is not di.cult to verify that Lemma 1 and Theorem 1 also hold even if .n .

0 for some n. if .n .8 for some users, Claim 1 and Claim 2 of Lemma 1 should be modi.ed for these users as follows.


It is noted that end intuitively we attempt to deploy a routing node at the ver-Record the observations; tices v1, anticipating that the deployed routing node would end e.ciently connect all the nodes (for .exible vertices, were n = n - 1 nodes to be deployed there) in its neighbor collection S1.

end as discussed in Section 4.1, it is not clear that deploying a node at the vertices v1 will produce a maximal Algorithm 2: Algorithm for dynamic deployment probability of connectivity between v1 and all its neighbor nodes.


As the increasing of random loss ratio, throughput is degraded as the increasing pw.

by using one-way delay jitter congestion detection, OWDJ-TFRC can approximate the optimal throughput to provide better application QoS.


If such a node has a higher cost value than itself, then a cyclic dependency might occur.

such a cycle causes the cost values in the heartbeats to increase.


The authors also provide a rule of thumb to avoid problems during IGP migrations, i.e., update edge routers before the backbone ones.


Using the above transformation, the vertex cost is converted to an edge cost.

any .ow passing through that vertex has to traverse an extra edge with positive cost cv.


Considering alarge numberofhostswithinanaircraft,theneedfor network mobility(NEMO) arises.

thebaseNEMO protocoldoes notsupport route optimization(RO), afeature whichprovidesbetterend-to-enddelayperformance.


3.2.1 Effect of extraneous traf.c 8 R and G (a)= dt is the gamma function.

te 0 for workloads with a limited number of objects, the deviation of the average number of references to objects (denoted as (y)) from Equation 4 can be non-trivial, especially when (y)is small (since the minimum number of references is 1, not zero).


We used a low-end laptop with 1.66 GHz CPU and 2GB DRAM to measure the decoding throughput.

the measured decoding throughput is 160Mbps(for chunk size =32B).thedecoder throughputfor aSHAhashbasedschemeis only50Mbps, even with128B chunks, because clients have to compute SHA1 hashes for each cached chunk.


To illustrate, let us consider a node that experienced bad channel conditions during an entire decision window, and it s trust may be reduced.

when the channel conditions change it gets a chance to redeem its trust.


For example, when the code length is 4, the implementation has better performance than the theoretical except between -5 and -1 dB.

with increasing code length, we use an increasing number of adjacent subcarriers, increasing intercarrier interference and degrading performance.


Thus, our system can avoid blind .ooding, which is often adopted by unstructured P2P networks.

since peers may join and leave the network at will, their relationships have to be updated as the network evolves.


During an authentication process, it is possible that attacker falsely claims to have the ID of a valid sensor, so as to confuse the CU about which one is legitimate, or simply prevent a legitimate sensor from being successfully authenticated.

this can be regarded as one type of DoS attack.


The duration of such an infection cycle is Trsp + Tinf + Tidle.

an infection cycle that has no device infected corresponds to a recurrence in the Markov chain.


Of course, the multi-radio increases the hardware costs.

these costs can be o.set by having less interference, higher channel re-use and high increase in the overall system performance.


20dbm) as well and obtained promising results.

due to space limitations, we also omit these results.


K. Then, each user s only needs to set its own As(t + 1) as a part of a solution to Problem 2.

user s cannot have the global knowledge of Qs ' (t), Xs ' ,k(t), Ys ' ,k(t) for s ' .s.


Users connect to our WiFi hotspot just as they would at a co.ee shop and some users may have the expectation that their experience will be similar in both environments.

in the vehicular environment it is necessary to use wireless back-haul networks and the .uctuating performance and link failures of these networks must be contended with.


For example, in the SoA model, all directly connected neighbors receive the message.

the selective forwarding algorithm forwards the message to one randomly selected reachable node at each snapshot.


By using LEGO, each .ow achieves an average 98% of the ideal throughput after recon.guration, whereas local re-routing achieves 82% of the throughput because of its use of detour paths.

the greedy approach causes degradation of neighboring links, while partially recovering from the original link failures.


Because the Gilbert process introduces more error in the path measurements, the accuracy of both Sum-Tomo and Norm algorithmsdeclines(Figure2c).

because the Analog approach is more sensitive to measurement errors, we see a larger accuracy decrease in Norm (by about 25%).


Similar to prior work, EINIC integrates a redesigned NIC onto a CPU.

we extend the integrated NIC (INIC) to multicore platforms and examine its behaviors with the network receiving optimization.


The works [12, 17, 18] study the joint problem of allocating data rates and .nding a stabilizing scheduling policy in a multi-hop wireless network.

our problem is different than the ones considered in [4, 5, 12, 17, 18]; we consider the problem of minimizing end-to-end delay by jointly optimizing routing, scheduling and power control.


Inthe absence of anIMD sessionthe shieldperiodically(every200 msin ourprototype) estimatesthis channelby sending a probe.Sincetheshield stwoantennas areclosetoeachother,the probe canbesentatalowpowertoallowothernodestoleverage spatialreuseto concurrently accessthe medium.

widebandchannels: Ourdiscussionhasbeenfocusedonnarrowband channels.the samedescription canbe extended toworkwithwidebandchannels whichexhibitmultipatheffects.


Collisions due to hidden terminals: Contention resolution schemes are not designed to cope with hidden terminal problems.

when using 802.11, the exponential increase in backoff may eventually separate the hidden terminals in time, permitting a successful transmission.


Their corresponding HTTP responses are implemented by Data packets.

in order to implement the integrated HTTP protocol in NDN, we should extend the functionality of Interest packet to accommodate the rest methods.


A .rst approach that suggests itself is trying to predict Ct and setting d accordingly.


Therefore, in the absence of the clusterhead for any reason, the cluster will collapse and a new cluster would be reformed.

in the SERC protocol, the SCH will take the clusterhead responsibility when the PCH can no longer be a clusterhead.


Our previous papers [17, 28] have looked at bottom-up analysis of the VLAN design of an operational network, and reachability policies of existing networks.

our focus in this paper is on systematic design in these areas.


Epidemic routing protocols replicate packets at transfer opportunities hoping to .nd a path to a destination.

naive .ooding wastes resources and can severely degrade performance.


TRW [10] is a state-of-the-art algorithm with fast detection time and high accuracy.

tRW relies on knowing if a source has made a failed or a successful connection, and therefore requires stateful protocol analysis of the sources.


Not surprisingly, per-packet delays have increased over the 12-channel case due to increased MAC contention delays and a larger number collisions.

we observe that RanOp-wIR provides the lowest per-packet delay primarily because power control reduces APs collision domains signi.cantly, reducing both MAC contention and the probability of packet collisions.


Our results on the WARP SDR platform shows that our approximate communication system, provides signi.cant improvement in video quality (ranging from a 5 dB to 20 dB in different scenarios).

this is a small .rst step in realizing the full capability of this system.


Note that because of the centralized round-robin like scheduling of the cellular network model, perfect fairness is achieved.

in the peer-to-peer network model, because of the distributed protocols and because traf.c can be distributed randomly, the throughput enjoyed by the different .ows can be very different.


In terms of throughput (not shown here), ViChaR's improvement over DAMQ and FC-CB is a more modest 5% (on average).

viChaR would perform substantially better in latency-critical applications.


Therefore, it is mandatory to repeat the synchronization process frequently to guarantee certain bounds for the synchronization error.

precisely synchronized clocks between two synchronization points can only be achieved if the relative clock drift between nodes is compensated.


The same local optimizations can be performed for PMIP which brings the worst-case scenario for PMIP close to it s best-case scenario.

in a very large PMIP deployment the LMA might not be always positioned topologically optimal for each MN.


Furthermore, the subtraction step does not require anysynchroniza tion between transmitters,5 works withOFDM systems and various modulation schemes, and can accommodate single tap and multi-tap frequency selective channels [19, 10].

prior to this paper, interference alignment has been a purely theoretical idea with no practical implementation.


One major difference between a traditional application and a content distribution application is that the content distribution application often needs a large number of connections, requires frequent resource adjustment (e.g., connect or disconnect peers, reallocate bandwidth share among peers), and must be sensitive to control overhead due to the real-time nature of content distribution.

with an in-network storage infrastructure like SAILOR, resources are consumed at a remote location and cannot be directly observed.


All prior solutions require terminal involvement and feedback in the calibration process, an unacceptable overhead in a largescale MUBF system.

the relative calibration in Argos is done internally at the base station without such overhead.


Proactive schemes: here the rate adaptation action is of the reactive type (i.e., after an event has happened).

the server could have a proactive role in the rate adaptation action (e.g., looking in advance at the future of the media bit stream to be transmitted, in order to understand its characteristics and better adapt to outages in bandwidth availability).


The root of each separable tree typically has far fewer entries than a subarray.

to achieve high packet throughput, multiple packets must be able to lookup different trees at the same time.


The boundary defense also demonstrates ratio reduction in a large network cluster.

boundary attack on large cluster has not reduced in the same manner as inner or core attack because it has more opportunity to detect intruder on border line with boundary defense.


even legitimate domains (e.g., www.microsoft.com) In this case s was approximated with Sh(q)·Nq, where Nq is the can be queried by these hosts and could receive a high value for total number of times a query qj has been made during the traffic P(qj | Ihi=1).


This strategy has to wait for intruder to reach the core area then it raises alert signal to strike back.

boundary attack and inner area have weaknesses, and a node can be captured without notice.


What we observe in the data, D, is a subset of U since requests of UD (the relative complement of D in U) are already served by the handset cache so UD does not appear on the network.

remember that in order for a .le f to be cached, it must be transferred over the network (i.e., f .


This approach can be introduced incrementally and does not require changes to current protocols.

it can result in deviant cliques of nodes forming timing loops (which are similar to routing loops) when nodes have frequency errors that are not independent or real-world quantization errors are considered.


For example, only 65% of all AS records contain OrgID information, with AP-NIC and LACNIC providing none whatsoever; other ASes provide OrgIDs for the majority of records (59% for RIPE, 82% and 95% for AfriNIC and ARIN).

even when coverage is good, many organizations use a number of di.erent OrgIDs making OrgID clustering di.cult.


As a result of this, a BGP router administrator needs to keep replacing their existing router with a brand-new router whenever new solution is adopted as the best solution because the existing approaches to BGP security require that a BGP router administrator must purchase a brand-new router to have a capability for the new solution.

the proposed solution can give a new capability to the used BGP router by updating the RRVT, so a BGP router administrator doesn t need to replace the existing router.


Note that mobile phone aborts earlier at 48s before the server tears down the TCP connection at 82s.

skype voice calls: When the CS call ends, Skype is designed to resume its original call session; it may still fail similarly to FTP, and the root cause will be discussed in Section 6.3.


The HI is the public key of an asymmetric key-pair.

because of its length, it is not possible to use it during actual communication.


The .gure shows that IPv6 is still dwarfed by IPv4 traf.c (by roughly two orders of magnitude).

both IPv4 and IPv6 peak traf.c volumes are generally increasing, and IPv6 is on a strong upward trajectory.


This means, sensor nodes start receiving a page Pi only if the previous page Pi-1 has been completely received.

deluge allows for out-of-order packet reception within a page.


Packet traces recording real-world Internet traf.c are especially useful for research on traf.c dynamics, protocol analysis, workload characterization, and network intrusion detection.

sharing of Internet packet traces is very limited because real-world traces contain many kinds of sensitive information, such as host addresses, emails, personal web-pages, and even authentication keys.


A quantitative evaluation of k-Neigh in mobile environments is beyond the scope of this paper.

here we present a brief qualitative discussion of how the protocol can be adapted for mobile environments and how it compares to other algorithms in this case.


Mobility impacts the slow variations in the .rst order statistics of the wireless channel.

rapid .uctuations in the channel, which determine the statistics used to approximate coherence time, are a result of Doppler cross correlation ratio 1 0.9 0.8 0.7 0.6 0.5 0.4 0.3 0 0.05 0.1 0.15 0.2 0.25 0.3 0.35 0.4 time (seconds) Figure 4: Cross-correlation statistics in an indoor o.ce setting at 2.5 GHz, collected using Hydra.


Limited by the smartphone, using acoustic signal for TOA-based ranging is the only solution.

making the acoustic signal for ranging and localization in real situations has a lot of challenges.


They used CTP [5] as their routing algorithm which is a structured routing scheme.

the network codingbased algorithms proposed for WSNs do not consider coding opportunities in the route decision phase.


In interpreting results taken from this network, it is important to note that it is an access and interconnection network for research institutes and universities without a signi.cant residential population, and is therefore somewhat biased toward weekday, working-hour tra.c.

we focused on several subsets of the tra.c collected, in order to attempt to derive general number for .ow concurrency on the wider Internet from this tra.c set: All tra.c crossing the border of the network at large; we use this as a proxy for a large interconnect point.


We have designed a simple and lightweight framework (called CLIF) to facilitate the cross-layer exchange.

we do not focus on CLIF in this paper because of lack of space.


It is interesting to note that if the PEP/SNR relationship is nominal or steeper, then opportunism provides a bit-rate that is approximately the same as deterministic forwarding.

if the PEP/SNR relationship is shallower than nominal, opportunism provides a bit-rate that may exceed the bit-rate provided by deterministic forwarding by approximately 50%.


In contrast, SpeckMAC-B determines whether the receiver is to be turned on for reception of the data frame, based on information contained in the wakeup packet.

figure 6 show that when sending broadcast packets, SpeckMAC-B consumed more energy than SpeckMAC- D. when unicast packets were transmitted, SpeckMAC-B turned on its receiver for a shorter duration as a node was able to distinguish whether it was the intended destination using the wakeup frame and the receiver was turned on or off accordingly.


We consider that all segments have the same width 2E.

for the purpose of positioning the nodes, each segment individually is considered as a one-dimensional space, and we position all nodes over imaginary lines located at the center of the segments.


Moreover, [13] proposed a coding-aware algorithm based on opportunistic routing to take advantage of the broadcast characteristic of a wireless channel for data delivery for wireless mesh networks.

all the coding-aware routings discussed above have Copyright 2012ACM 978-1-4503-1628-6/12/10 ...$15.00.


The mapping from the HIT to IP address(es) is not lost because it is valid at least for the lifetime of the IPsec SA.

the callbacks are only a part of the problem.


Paris-Sud, CNRS Bat 490, 91405 Orsay, France awal@lri.fr ABSTRACT In wireless communication systems, adaptive modulation and coding (AMC) is used to improve the downlink (DL) spectral e.ciency by exploiting the underlying channel condition.

aMC also reduces the uplink (UL) throughput because of feedback (FB) overhead which is used to carry channel information.


This value is also proposed in [13] ( 32 · 4=6 MSS).

contrary to [13], our results again show that disabling RTS/CTS sometimes reduces throughput.


The number of clusters k determines the amount of signaling exchanges required during the routing process.

the two quantities cannot be minimized simultaneously; we must, therefore, minimize one and set the other one as a constraint.


Speci.cally, for each computational task the protocol requires node i to complete, ai may replace the task with an arbitrary polynomial-time algorithm; for each message the protocol requires node i to send, ai may either withhold the message or replace it with an arbitrary message and send the new message at an arbitrary power level.

to simplify our model, we do not allow ai to send more messages than it is supposed in the protocol.


This idea has been suggestedasafoundationforactivemeasurementof end-to-enddelayandloss[3].However,the asymptotic natureofPASTA means that when it is applied in practice, the higher moments of measurements must be considered to determine the validity of the reported results.Aclosely relatedissueisthefactthatlossis typicallyarare event in the Internet [39].

this reality implies either that measurements mustbetakenoveralong timeperiod,or thataverage rates of Poisson-modulated probes may have to be quite high in order to report accurate estimatesina timelyfashion.increasing the mean probe rate may lead to the situation that the probes themselves skew the results.


In the absence of this global information at every node in the network, it is still possible to write a generic set of policies that can allow run-time adaptation based on local state available at each node.

characterizing the optimality and stability of such composite protocols in a general sense is an open and orthogonal problem.


Thus, if the distance between two routers with high commu- nication frequency is short, the grouping algorithm in our method effectively works.

if the distance between two routers with high communication frequency is very long, it is difficult to group routers effectively by the algorithm.


What we can conclude is that the basic solutions work with approximately the same cost.

e-PMIP shows that it is possible to improve the performance while not changing the protocol at all (only on the MN side).


Nine player game PMF and Q-Q plot (HL2DM) 5.1.6 Half-Life 2 Counterstrike Half-Life 2 Counterstrike also shows good agreement between the empirical and predicted distributions in Figure 23, Figure 24, and Figure 25.

as with the other team games, there are some peaks among the smaller packet lengths that are difficult to capture in the synthetic model.


Understanding DET and designing CENTAUR: The above results made clear that even a simple centralized scheduling technique can provide signi.cant performance gains when downlink hidden terminals occur.

theperformancepenaltiesinthe normalinterferencecase,andthelackofgainsinexposedterminals needfurtherinvestigation.Itturnsoutthatmuchofthisinef.ciency 2Note that the con.ictgraph canbe computedin stages with each instance taking 2.5ms.


Discussion: The inference capability presented in this section shows that it is possible to infer the network bottleneck location without probing the path with some level of accuracy.

we need suf.cient information on the links in the path so it is important to properly design the training set to reduce the number of links for which we have little or no data.


We realize that several factors may in.uence the detection rate: the region size, the probability of singing, the population size and the number of sensors.

these results seem to show that an optimal con.guration must be studied as a function of the population size.


engines of vehicles to reduce air pollution as they are waiting at intersections.

tCU can dynamically adjust the tra.c light timing to minimize the number of vehicles stopping at an intersection based on the observed vehicle arrival and departure rates.


After this point both MACs offer similar CSMA performance for 3, 4, and 5 hops from the sink.

the loss rate over the first two hops is considerably smaller when using funneling-MAC over B-MAC.


if users distribute information on behalf of others anonymously, it is quite dif.cult to collect personal information about users.


Therefore, if we have suf.cient memory, .............. we can choose to minimize the communication overhead, i.e., we turn to the naive scheme described in Section 2.

we do have a constraint on the memory usage; therefore we have an optimization problem: given the memory usage limit...... .


The focus in the nse [9] emulation framework of the ns simulator has been on network emulation.

our goal is to use the ns-3 emulation framework [1], which has been completely re-designed with respect to previous versions of the ns simulator.The ns-3 emulation framework allows executing ns-3 IP stacks over real physical devices implementing layer 2 (L2) functionalities.


4.4 Fairness of TCP Vegas The two main .ndings from previous investigations of TCP Vegas fairness, reviewed in 2.2, are: (1) Vegas removes Reno s bias against .ows with large propagation delays [4, 18, 21] , and (2) Vegas creates persistent congestion which causes unfair distribution of the throughput due to inaccurate measures of baseRT T [5, 18].

these issues have primarily been analyzed in environments where the Vegas sources experience no loss.


One invalid packet can trigger more thanone pushback.

only one pushback is needed to warn ofthe bad packet.


For example, a node at level 1 (a direct child of the root) is de.ned by a pair composed of a random seed and a group index as in the previous scheme.

to select a group represented by a level 2 node, we need .rst select the tags belonging to its parent node, and then divide them into W sub-groups by another random seed.


The task of a switch is to receive a packet, .nd its destination, and transmit it from an appropriate output port.

when the arrival rate of packets exceeds the transmission capacity of a switch, some packets will be lost.


In such a situation the MS may migrate between BSs multiple times to acquire a better channel.

one needs to remember the amount of connection drops with a small Ttrig due to numerous handovers.


We also gradually add links based on our scheduling algorithms to investigate how many wireless links are adequate to achieve a considerable improvement in performance.

the bandwidth of a wireless link, which has an impact on .t0, is also an important factor.


In constrained streaming, under relatively short RTT, i.e., R = 50 ms (corresponding roughly to same coast in US) or 100 ms (roughly between two coasts in US), for various settings, the performance is generally good when the achievable TCP throughput is twice the video bitrate.

for large RTT (R = 300 ms), high loss rate (p =0.04) and timeout value (TO =4), a startup delay of 60 seconds is required in order for the fraction of late packets to be below 10-4 for T/µ =2.


of Posts and Telecomm., China Department of Computing, Hong Kong Polytechnic University, Hong Kong §Nokia Research Center, Beijing, China .Institute of Industrial Science, The University of Tokyo, Tokyo, Japan {cslcheng, csjcao, csjsiebert}@comp.polyu.edu.hk, {canfeng-david.chen, jian.j.ma}@nokia.com, hongyang@mcl.iis.u-tokyo.ac.jp ABSTRACT Cooperative forwarding has been considered as an e.ective strategy for improving the geographic routing performance in wireless sensor networks (WSNs).

we observe that existing works do not fully utilize the forwarding opportunities provided by available neighboring nodes.


Intuitively, it might be tempting to consider combinations of the above basic approaches in order to improve upon a certain performance metric.

as we demonstrate below, the combinations may not necessarily achieve a better trade-off between the performance metrics as compared to the basic approaches, and may therefore be unfavorable in practice.


This fair allocation is represented by dashed lines in Figure 5(b) when we take into account the minimum probing cost.

using MPTCP with LIA, multipath users get a larger share of bandwidth as soon as C1 = C2/(2+N1/N2).


A similar approach of mobility emulation is in [21], in which a receiver side filter is used to determine if an ingress packet should be accepted.

this approach only supports one filter per mobile host, which considerably limits its application.


Due to this change, the transmission rate of the 802.11p protocol is half that of 802.11a, 27Mbps compared to 54Mbps.

because of the narrow channel bandwidth, it will increase the ability to reduce inter-symbol interference (ISI).


In our approach, we tried to follow these rules as close as possible.

since we are modeling domain specific knowledge in a microtheory, our rules are quite specific.


In 802.11s mesh network, packets are forwarded to the destination through several MPs.

the basic random access protocol of IEEE 802.11, the distributed coordination function (DCF), is not well-suited to multi-hop environments since it causes backo.


The first two methods are believed to be vulnerable to spoofing and routing attacks [7].

when MD5 is used to exchange keys, that link is considered to be secure.


6Each CFP has a proposed upper bound for the CFP duration.

the AP may end the CFP before this proposed CFP length after polling all vehicles in its poll region.


Cognitive radio (CR) has been recognized as an important technology for enhancing spectrum e.ciency, while many dynamic spectrum access techniques are developed to better utilize the allocated spectrum [17].

millimeter wave (mm-wave) communications in the 60GHz band has gained considerable interest from academia, industry, and standards bodies [10].


IMPACT ON NETWORK LOAD We have seen that the proposed service management system o.ers signi.cant advantages for service users.

periodic requests generate additional network load which is unfavorable especially for wireless networks with sparse transmission resources.


Most important, Figure 12 indicates that ECN+ does not achieve performance improvements by sacri.cing system stability.

tCP endpoint control still applies exponential backoff, and some .ows necessarily experience multiple timeouts due to extremely heavy congestion, as shown in Figure 12.


2.2 Active Probes and Monitoring Sending active probes or monitoring production traf.c allows for measuring the ground truth behavior of the data plane.

doing so requires the network infrastructure to allow for traf.c to be trapped and/or logged as it traverses the network.


As the allocated channels are assumed to be orthogonal, the inter-channel interference is often neglected.

the inter-channel interference does exist and its impact on link capacity and the performance of multi-channel protocols are systematically explored in [24, 27].


When there are many failures in the network or when nodes are mobile, this randomization helps the CountTorrent protocol to converge despite the failures and every surviving node gets the .nal query aggregate.

when there are negligible failures or when the nodes are relatively stationary, the randomization unnecessarily slows down the convergence.


This inconsistency limits the scalability of our approach for validating Netsweeper installations in Yemen.

we identi.ed another way to validate that Netsweeper is being used for censorship.


A signi.cant number of the states can be discarded probabilistically due to the low-likelihood state metric, derived from the likelihood computation procedure.

xc(n - 2) X (2) Figure 1: Bayesin Data Likelihood Tree (DLT) direct computation of the likelihood metric at every state results in a drastic increase in the computational complexity, due to the large cardinality of the state subspace.


Since membershiptypically changes rapidly due to the nodes independent mobility patterns in mobile networkslikeVANETs,multi-hop clusters aretypicallydismissed due to the amount of overhead required for electing a cluster head and maintaining cluster membershipinformation.

the use of multi-hop links has been proposed in VANETs without explicit clustering.


It enables each host to have a backup route.


The interest in ad-hoc or opportunistic networks has also led researchers to investigate mobility patterns in those networks [31, 32, 33].

little has been published on the analysis of mobility patterns in large scale cellular networks.


We .nd that adding Traf.c Engineering (TE) extensions to OSPF does not substantially change the stability properties of OSPF.

multiple failures that are close together in time can lead to potential instabilities.


Traffic signals provide the key mechanism to regulate traffic, and promote safe and efficient traffic flow at intersections.

incidents of red light running can compromise the safety of the system.


Feature B shows that the AA services and CDNs receive most information in the role of a third-party.

user-centric services (i.e., services with personalized content) and news services receive most information as .rst-party since users often visit these services directly.


On one hand, they are means to prescribe non-geometric components to signal reception, which is useful for simulation studies (which M B -S I N R cannot provide), but which could be captured more accurately by actual measurements.

these can also model aspects that are necessarily random, in which case they could complement the deterministic M B-S INR.


To improve the accuracy of neighbor tables we may add information about the node s speed and/or its direction of travel to the beacon.

such information would not help to discover new neighbors.


Finally, this section would be incomplete without paying tribute to the vision of active networks [15] whose authors were probably the .rst to tackle the need to enable innovation within the network infrastructure.

as should be clear, our approaches are diametrically opposite.


For example, the client can tell whether it has detected any wireless networks or APs, been able to associate with a network or obtain an IP address, or experienced partial or total wide-area communication failure.

local observations only provide a limited view.


One of the primary technologies used to accomplish this was the Embedded Java.

even though the cell phone industry has embraced Java as a core component, the embedded computer industry as a whole is strangely slow in accepting it.


First, while BLE .ts well our communication scenario, it supports only a relatively small bandwidth [2, 4].

opportunistic networking can exploit higher bandwidth channels, e.g., IEEE 802.11 or Bluetooth EDR.


If a spectrum sensor (SS) equipped with cognitive radio desires to operate, it senses its electromagnetic environment on the licensed band and determines whether or not interweaving.

the sensing reliability may extremely decline due to the deep fading or shadowing.


It is shown, that the throughput decreases as the background traffic increases because of the congestion and the lost available bandwidth.

the measured throughput is always higher when per-application mobility management is used, and the gain is getting more significant as the background traffic increases.


Figure 1(a) shows that the similarity stays close to 1 in the static case because the CSI matches across time on a stable channel.

the similarity drops sharply under environmental or device mobility.


The overhead of installing new OpenFlow rules into Current OpenFlow-enabled devices can be quite high (e.g., one hardware switch we have access to can only accept six rule updates per second).

newer devices already support much lower rule insertion overhead, and we expect that trend to continue moving forward.


As an example, traceroutes from George Mason University to a network in Russia started failing, with the last responsive hop in TransTeleCom.

our system located the failure as being along the reverse path, in Rostelecom, an ISP that did not appear on current or historical forward traceroutes.


Since it uses unicast-based probing, EAR can collect more accurate results than broadcast-based probing.

by employing cooperative monitoring, EAR can reduce the active probing overhead to as low as BAP s overhead (e.g., 1 packet per second).


For example, a .ood mechanism tailored to FRESH could gain from exploiting the directionality of the route discovery and by avoiding .ooding the same nodes in two consecutive searches.

our objective here is to show that FRESH is highly e.ective even with a simple .ooding technique that is not optimized for the task at hand.


Intuitively, if more than one Hotmail user is observed to use the same IP address, it is likely that this IP has been assigned to more than one host and hence is a candidate dynamic IP address.

counting the number of users for each individual IP in a straightforward way is not robust due to two reasons: (1) it is likely that not all the addresses in a block will appear in the input dataset; (2) a small number of individual IPs in a dynamic IP block may still appear static by having a single user (e.g., a dynamic IP assigned to a home router that rarely reboots).


R1 and R2 send ResvCTS in the 4th mini-slot only if they have sent CTS in the 2nd mini-slot and received a ResvRTS in the 3rd mini-slot.

r1 and R2 cannot receive ResvRTS in the 3rd control mini-slot (and consequently they cannot send ResvCTS in the 4th mini-slot) because as they send CTS in the 2nd mini-slot simultaneously, collision occurs at their common neighbor E3 which sends a CR in the 3rd mini-slot preventing R1 and R2 from receiving the ResvRTS.


The PlayN-Cool protocol increases the end-to-end gain by factor of two to four folds in the wireless mesh network.

playN-Cool does not consider the correlation between channels.


Of course, in practice, the message source identi.er should also be included in the message header along with the destination.

pEAR does not care about the source of the message, so we consider it as optional.


Protocol BS-Pkts BS-Attacks BSAll-Pkts BSAll-Attacks TCP 98.99 95.76 98.68 25.45 UDP 0.25 0.78 0.40 59.50 ICMP 0.03 0.90 0.03 0.26 Table 2: Pctg contribution of protocols to attack tra.c in backscatter data (BS: backscatter using 60 sec 100 packet .lter, BSAll: all backscatter data without .ltering, Pkts: Number of packets, Attacks: Number of attacks ) A recent work in progress presented by Nazario [10] also based on backscatter data from a mostly unused /8 network suggested that attacks are shifting from TCP to the UDP protocol.


The reason is that SNW uses random distribution and passive waiting which are not e.ective in large-scale group mobility situation.

rENA and RAPID-ODP make use of broadcasting control packets to construct a local predication and active transmission.


Other approaches such as PTCP have also been proposed at the transport layer for bandwidth aggregation [14].

these schemes rely on the congestion window to be a tight approximation of the available bandwidth-delay product to be able to e.ciently stripe di.erent packets in the di.erent interfaces.


As SocialDTN, these implementations aim at provide communication means in challenging scenarios (e.g., intermittent/disruptive communication, long delays).

socialDTN is meant to exploit social proximity and interaction patterns between users devices, which can be achieved through the use of Bluetooth technology.


One point is worth emphasizing: the smoothed MUSIC algorithm is conceptually similar to the standard antenna array beamforming discussed in §5.1; both approaches aim at identifying the spatial angle of the signal.

by projecting on the null space and taking the inverse norm (as described in Eq.


On one hand, our evaluation results show that DEAR can generate a relatively high revenue despite 15 randomness.

the evaluation results show 10 5 that DEAR achieves good di.erential privacy.


C may not have a signi.cant impact on average packet latency of .ows F1 and F2 because the other link with just one VC becomes the bottleneck.


In [23], the authors provide a simple design example of a shallow water network, where routes are established by a central manager based on neighborhood information gathered from all nodes by means of poll packets.

the paper does not describe routing issues in detail, e.g., it does not discuss the criteria used to select data paths.


Likewise, even a simple post-condition such as execution reaches the same .nal ei p as speci.ed in so could be thwarted by a program that, for example, checks whether a cryptographic pseudorandom function computed on the input iv is equal to the state sv.

for most programs, one would not expect the problem of .nding an input to cause that program to reach a desired .nal state to intentionally be made into a hard problem.


Selecting this arrangement we obtain less consecutive numbers in the set.

we can see that with PoP, node A also has a problem to intersect with node D in its .rst two periods, but it intersects with node B and C without problems during the depicted periods.


For example, a router that uses the lenient depref invalid policy can lose connectivity to an invalid route if all its neighboring routers use the 2The idea that the RPKI is a default-deny architecture is unintuitive, given the unknown route validity state.

a BGP route without a matching valid ROA is unknown only when there is no covering ROA; see Section 2.2.


For example, in [13], the add-a-wire-and-remove-a-wire strategy was used on timing critical paths for performance optimization.

since there is no information regarding the relationship between the target wire and the alternative wire, all target/ alternative pairs have to be evaluated (in terms of timing improvement).


In general, nodes that are not addressed in a packet header as the destination temporarily turn their radio unit off to save energy.

it might be more ef.cient if some nodes stay awake and overhear the packet, even if this requires more energy.


I would assume that the IP address of other users are stored in some directory node (or supernode) which can only be queried when a call is about to be placed.

a normal user may never query the directory node so frequently (every 3s).


Our elementary problem instance does not allow any parallel transmissions and thus only serial broadcast schedules are possible.

a problem instance of [7] may require solutions with parallel broadcast transmissions.


In the case of p2p applications however, the major advantage of satellites compared to terrestrial solutions is the broadcasting capability and the large scale coverage.

the wide acceptance of a satellite-based topology depends strongly on cost-e.ectiveness which can be achieved by ful.lling the aforementioned characteristics.


Thus, the probability that RSU receives the status information increases.

this improvement brings redundancy into the networks.


Compound System behaviour with parameters 100H, 64 KB, 10 P, 1 m/s Figure 3.

compound System behaviour with parameters 100H, 64 KB, 10 P, 1 m/s for the remaining of test cases, the plots show a gradual packet overhead reduction attributed to the learning system, which takes place approximately one-third into the simulation period.


We have experienced similar performance because our operating environment is practically the same as that of Daknet.

daknet does not implement a generic architecture that can be used to build new applications, support integrated location management system, operate across multiple levels of disconnections, or allow (to our knowledge) data privacy.


Hence the data processing center can identify any surfaced submarine at the granularity of hours on the timeline.

given the typical mobility speed of a submarine (e.g., 10-15 knots), the submarine hunting task force has to locate the target in an area of hundreds of square nautical miles due to the coarse granularity.


[20] proposed an approach to identify network application dependencies by using process IDs on operating systems as well as packet traces.

this approach requires a process monitor to be installed at each end-host, so deployment in some networks, such as a campus guest network, is dif.cult because each end-host is owned and administered by each user.


In traditional quality-scalable videos, the hash of each enhancement layer is attached to the previous layer, providing the hash of the base layer as the video frame digest.

in MGS quality scalability, it is possible that some video packets of a higher MGS layer be kept while some packets from a lower MGS layer are discarded, depending on the extraction process [2].


From the Response Header, we use the Content-Length .eld to determine the size of the corresponding object that is being downloaded by the subscriber.

there are cases where the Content-Length .eld is either missing or set to zero this is generally due to the data requested being dynamically generated so the HTTP server does not know the size of the object it is serving.


While providers are mainly interested in AAA1, clients are interested in ease of use and having mobility capabilities.

we believe that most demands from both users and providers can be satis.ed if the access control architecture implements a minimum set of features: i. mutual authentication; ii.


A radically di.erent approach, Active Networks [14], allows one to deploy new routing functionality without the need to have direct access to routers.

due to the general programming models proposed for Active Networks, they present di.culties in both router performance and the security and reliability of the resulting infrastructure.


The con.guration complexity of this solution works against multicast deployment.

backbone operators are currently overprovisioning their networks so they have little interest in using multicast.


This is as expected, since the additional loss due to rain impacts longer links.

the range (100+m) is still suf.cient to support picocell operations.


This shifting of multicast support from routers to end systems has the potential to address most problems associated with IP Multicast.

the key concern is the performance penalty associated with such a model.


For example, if we allocate more sensing nodes to idle channels (i.e., Xi >Xa), we will reduce the mean sensing interval for idle channels and, consequently, reduce the error in detecting the beginning of activity on a channel; the mean sensing interval for active channels is increased in inverse proportion.

the improvement is not entirely guaranteed, due to stochastic nature of both the sensing process and the activity of primary users.


And the average delays of multi-channel MAC protocols are lower than that of the IEEE 802.11.

the DCA-PC uses one channel for control packets and 2 data channels for data transmissions while there is 10% overhead of the ATIM window in the MMAC.


Among others maximum likelihood (ML) detection scheme [3] has the best error performance for MIMO systems.

we can t use the ML detection scheme for practical implementation due to its high computational complexity.


(3) Independent scheduler: One option is to design AVIS as a scheduler that jointly optimizes the resource allocation across the DASH .ows, regular video .ows and other data traf.c.

in our design we leverage wireless resource slicing techniques [6] to separate the resource management of DASH videos from regular video .ows and data .ows.


While keeping the cameras always on achieves lowlatency detection, it is very energyinefficient, since cameras and nodes will continuously consume energy.

the camera and the sensor node can be dutycycled and woken up periodically to acquire an image and detect the presence of new objects.


On the one hand, the evolution of LN(t) depends on the rate at which queues are served, and in turn depends on sN(t).

when the queues Proceedings of the 2011 23rd International Teletraf.c Congress (ITC 2011) LN(t)are .xed, the process sN(t)is a reversible Markov process on the set of possible activation states whose transitions are functions of LN(t).


The median number of connected sectors in a stationary period is 4.

in mobile periods the subscriber tends to associate to multiple non-adjacent sectors with frequent handovers.


All protocols show larger duty cycles as sensing range, and thus traf.c load, increases.

rI-MAC has a much smaller rate of increase than do the other protocols.


Note: There is no requirement for the clock granularity G used for computing RTT measurements and the di.erent state variables.

if the K*RTTVAR term in the RTO calculation equals zero, the variance term must be rounded to G seconds (usually G <= 100msec).


This degradation occurs because a larger percentage of ECN-enabled .ows better utilize the available bandwidth in this scenario and keep the average queuing length closer to RED s maxth parameter; this causes a larger number of SYN ACK packets belonging to non-ECN-enabled .ows to be more frequently dropped at the router.

figure 10 indicates that the degradation is not signi.cant.


A simple fairness policy is to deliver packets based on the order of arrival, in a .rst-come-.rst-served (FCFS)manner.

fCFS policy turns out to be non-work conserving, aspacketsdestined toPSM clients cannotbedelivered until the client wakes up.


(7) k.Uk.U  3.2 Coverage in Identifying Bad Links In the previous section we saw that the link k at the head of a maximal bad subtree is increasingly likely to be bad when bad links are rare.

we did not exclude the possibility of bad links elsewhere in the subtree.


To applications that don t use the NPEs, this process works much like it would on a conventional PlanetLab node.

there are some configuration steps that must be implemented under the covers, to make this as seamless as possible.


We detail our improvements on the original algorithm in section 3.

failure handling according to CMS still present some drawbacks in WSNs.


If a value of 1 is obtained for bit m, then the rule Rm is part of set S. However, the algorithm selects the rule Rt with the lowest value of t. Thus the simplest way to do this is to compute the matching rules from the smallest position to the largest, and to stop when the .rst element is placed in S.We have implemented this scheme.

in what follows we prefer to allow arbitrary rearrangement of .lters.


Therefore the authors propose a degree distribution called (Deconvolved Soliton Distribution) DSD which is used by each source to produce the encoded packets.

in this scheme each source should be aware about the total number of sources in order to choose the right degree distribution to produce its encoded packets.


Thus, in static environments only new or rare services will be created.

very dynamic environments will make this method computationally heavy and not suitable for nodes with low processing capacities.


To brie.y restate, GWF attempts to equalize w * Si + (1 - w) * (Bi/M) (1) for all users i over a time interval, where 0 : w : 1 is a weight con.gurable by a network operator, Si is the number of slots allocated to user i, Bi is the number of bytes served for user i, and M is the number of bytes per slot for the highest MCS.

they leave it to the network operator to con.gure the right value of w. We propose that an accountable resource allocation solution should simultaneously employ multiple fairness metrics within a base station, each tuned to suit a di.erent factor responsible for variations.


Such a scalability requirement is inherent to any technique that needs coordination.

this overhead can be made considerably small when channel coherence is very large (compared to an OFDM frame) or by adjusting the number of IA transmitter-receiver pairs.


For example, 4× mobility gives ESNR the CSI from every fourth trace record.

packet reception still uses all trace records.


Among them [8] are solutions that utilize the contention-free W-CDMA medium access, using directive antennas to increase channel reuse and reduce interference and power consumption, and using Global Positioning System (GPS) to facilitate the routing [10].

improper channel assignment could induce high packet delay and signal collisions.


On one hand, these studies are related to ours in also performing long timescale studies of the BGP system.

these studies do not emphasize the global evolution of routing decisions but focus mainly on the dynamics of routing traf.c.


This is known as Virtual Output Queuing (VOQ) at the switch level.

the queue requirements grow quadratically with the number of ports, thus becoming infeasible for high-radix switches.


Basic PF ensures the lowest run time compared to GSF which is due to the extra computation that GSF algorithm introduces.

to respect the reactivity requirements of VANET active safety applications and at the same time preserve a certain level of accuracy, 10 particles shows to ensure a trade-o.


THE IMPLICATIONS OF DISCONNECTED OPERATION One can argue that, in the future, fully connected environments will be commonplace in outdoor as well as indoor environments.

it seems unlikely that the problem of excessive power consumption, caused by fully connected operation, will disappear in the near future.


SMTP sessions consist of both an exchange of control information and a unidirectional bulk transfer for the messages (and attachments) themselves.

both of these take time propor-  1 0.8 0.8 Cumulative Fraction Figure 5(b) shows the distribution of 0.6 0.6 IMAP/S connection durations across a number of our 0.4 0.4 Cumulative Fraction datasets.


Their work is speci.c to BitTorrent and only gives priority to senders in the same AS as the receiver, but resorts to random selections for senders outside that AS.

our algorithms is more general in the sense that we consider the ISP and the PoP topologies when selecting senders in ASes other than the AS the receiver is in.


Secure Multi-hop Network Programming With MultipleOne-way Key Chains * § Hailun Tan, Sanjay JhaDiet Ostry, John ZicVijay Sivaraman{thailun,{diet.ostry,john.zic}@csiro.au vijay@unsw.edu.au sjha}@cse.unsw.edu.au ABSTRACT Current network programming protocols provide an e.cient way to update the program image running on sensor nodes without physical access to them.

given the open environment in which sensor nodes are deployed, securing network programming is a challenging task.


Wehavenotyetnumerically veri.ed that model against experimental data in a manner that is mathematically rigorous.

it o.ers plausible explanations for almost all the observed features in the goodput graphs.


We need to solve pq = pqPq for the steady-state distribution of PHqTq (h, t).

as indicated in (7), px(h, t)depends on pq, and, hence, Pq is a function of pq.Therefore, the standard Markov chain steady-state analysis can not be applied.


As shown in the second column, an IP address is used to bind state in the transport layer, but is assigned to a speci.c physical interface it acts as an identi.er at the transport and physical layer.

the IP address is also used at the network layer for routing it acts as a locator.


This could be because our switches implement their MAC learning process in control-plane software, and some FIB table updates might not complete within an RTT.

the results are not fully consistent with thishypothesis, and they require further investigation.


These tactical radios are functionally robust and resilient due to the salient characteristics of the designated military bands.

they often provide very limited bandwidth, ranging from 10's of Kbps to a few hundred Kbps.


Therefore, at time t = i, ALG schedules the packets in Si and preempts the packets from Si-1.In this way, ALG successfully transmits only one packet p k 1 overall.

oP T schedules 2k packets, namely all the packets from Sk.


The blocking probability indeed improved at shorter thresholds.

radios spent more time unjammed and consequently spent more power in transmission/reception, and attackers spent more time channel-hopping, resulting in a small JDPE.


Second, if we model the aggregate e.ect of such interactions at the packet-level, we may not be enable to correctly evaluate new designs like MAC or wireless TCP, since their impact is already unnecessarily re.ected by the derived models.

.ow models, together with other complementary models such as wireless channels (e.g., [4]) and network protocols, allow us to evaluate new networking designs in comprehensive wireless settings.


Further, since MAC layer broadcasts are not acknowledged it may not always be possible for a node to determine if the block it transmitted was received correctly without collision by its neighbors.

since none of the encoded blocks are critical, this is not a deterrent to the correct operation of VANETCODE.


This is to conserve the bandwidth available on each unique medium.

in case of real-time traffic, each node has to maintain constant CFP Repetition interval (CFPRate) on its own medium in order to minimize or completely avoid the delay jitter experienced by applications [1][3][4].


Currently, network operators translate their set of high-level objectives into low-level statements with the guidance of the configuration manuals of the router vendor.

there is no efficient way for network operators to decode the configuration files into their initial intentions.


Another advantage of this approach is the fact that more than one IP packet feature can be used for classi.cation.

it requires complex datastructures and thus a lot of time to create the FIS tree and therefore we neglect this approach in our early research stage.


location based advertisement networks and theft locators) [4, 3, 1].

most existing geo-localization techniques require GPS information or additional control of hardware infrastructures such as WiFi access points or GSM base stations.


During normal operation, a primary LR-PON is permanently connected through OLT(P1), with ranging having taken place as normal.

if L1 fails, the protection OLT that serves residential customers through OLT(S1) must activate and range prior to traffic being restored.


No studies have yet been performed to address supernet degradation.

studies for single compnets provide a foundation, by quantifying degradation and explaining the tradeoffs between call blocking, handover failures and compression or delay.


While the bound derived does consider energy consumption both in the transmitting/receiving state and in the idle state, it is restricted to the GAF scheme proposed in [21].

the lifetime derived in this paper is independent of power-saving schemes used.


All wireless terminals, including access points, obtain this transmitting right in a fair manner.

owing to this fairness, bu.er over.ows occur at access points, so many ACK packets are discarded.


It can not be directly applied in AODV, because if one node receives a packet, its neighbors do not know which node it should forward the packet to, and can not tell whether it has forwarded the packet in the correct manner.

the watchdog can be extended to work with AODV-S, because each AODV-S node keeps track of the route entries announced by its neighbors, which explicitly include the next hop .eld.


Recursive Flow Classi.cation [8], Crossproducting [18, 20], HyperCuts [15], Extended Grid-of-Tries [1] are some examples; refer to [19, 23] for details of these techniques.

in the past few years, the industry has increasingly employed Ternary Content Addressable Memories (TCAMs) for performing packet classi.cation [5, 9, 12].


Having per-worker output queues relaxes cache bouncing and lock contention by avoiding 1-to-N sharing.

we do not apply the same technique to the input queue in order to guarantee fairness between worker threads.


Note that stability of the system requires .<1.

di.erent schedulers can be derived depending on the accuracy of the .ow-level size information.


... .....1... .... v a number of performance studies have shown that self-similarity can have a detrimental impact on network .11. performance leading to amplified queueing delay and packet loss is the residual distribution function of ..... .


While there are many asynchronous communication pro-tocols(e.g.,BMAC[19],SMAC[20]), the majority ofthese assume that alldevices(which we call nodesfromhere on) have symmetric sleep patterns (i.e., run at the same duty cycle).

realistic scenarios, for both mobile social networking and sensor networks, are more likely to result in nodes with varying energy requirements and so asymmetric duty cycles.


The limitations of static QoS identi.cation have prompted research in automatic classi.cation of .ows to provide for speci.c QoS, removing the need for users to con.gure their wireless APs to prioritize traf.c.

in addition to the limited ability to classify new applications, changes in the wireless network connectivity can bring down the overall performance and quality of the home network if .ows with poor connectivity are given higher priority.


This work does not take into account the protocols based on top of the backbone.

it can be envisaged to create a protocol-speci.c measure that would count the overhead induced by the backbone (size and stability) compared to an optimal solution.


In these ways, proper scheduling yields a multifaceted improvement to device performance.


However, these techniques function at the timescales of hours.

measurement studies [13, 5] of data center traf.c have shown that data center traf.c is bursty in nature,and unpredictableat suchlong time-scales (especiallyat100s orlongertimescales), making theseISPorientedtechniquesinapplicable.


Packet headers are stored in a single bu.er slot, thereby eliminating the need to reassemble the header before the packet can be processed, making packet processing more time e.cient [1].

the control words in the SPI protocol have to be .xed and cannot be changed.


When more users share the same secret, and if the attacker compromises the key, from a single message it knows only that the user belongs to a group of users.

if the keys are pairwise with client and the access point, compromising the key compromises the user completely, and the access point discovery messages could be then easily used to track the single user.


Traditionally, the APs are stand alone devices which are responsible for RF functions, tra.c management, security and other functions.

this architecture makes it dif.cult to form a mesh network with a medium or large size (such as dozens of APs or more) due to the complexity in coordinating the APs.


As expected, when the number of radios and channels increases, the interference margin attainable by all schemes increases.

the increments tend to .atten out for more radios and channels.


When the distance is larger than 900 meters, it falls to a level less than 1.

in most cases, AODV-QL-O s level is always larger than 1.


An example of this would be analyzing the traffic of specific IP address every 100 queries.

this strategy has the pitfall of being heavily skewed by a domain containing several subdomains that all have similar labels.


An open question is therefore exactly what the delay and overhead involved in this would be.

any delays associated with this process could perhaps be mitigated by cached copies in other networks.


3, we see that path p1 to the destination has no available bandwidth (shown as 0) until tend; 11 however after this point in time, it has a large available bandwidth (16 units).

path p2 does have 4 bandwidth units available immediately.


In addition, iSCSI does not place a limit on the number of R2Ts that a target may issue to complete one SCSI Write command either each one of which would require a host processor interaction on the initiator, all in the span of one Write command.

if iSCSI is mapped over the RDMAP layer, an R2T PDU can be transformed into an RDMA Read Operation on the target side in the iSER layer.


As it can be seen by the similarities in the wiring topologies obtained for both the SP and MP runs, WP is relatively independent of the MP problem, validating the usage of the geometrical center of the terminal s ports in the MP case.

by taking advantage of the MP an average reduction of 25% in the rectilinear wire area is achieved, without a significantly increase in the execution time, given the efficiency of the path finding algorithm implemented.


Thus, the cost of maintaining the value of each and every combination (a table with one counter per combination) would result in a space usage of 1.4M × 1.5M × 4 bytes, or more than 7.5 TB of storage capacity.

if we use 4096 counters in each sketch, our method needs only (1.4M + 1.5M) × 4096 × 4 bytes, or less than 45 GB.


The authors concluded that the 22->13 23->1 4->19 5->28 average rate adaptation algorithm unnecessarily increased the rate 22->13 23->1 4->19 5->28 topology average (c) Throughput comparison, RTS off (d) RTT comparison, RTS off 20 topology to 11 Mbps, resulting in packet losses.

18 3000 1MSS 2MSS 3MSS 4MSS Unclamped       the result in Figure 4 shows that 11 can be supported in some RTT (msec) 16 cases(for .ows23 .


With oFIB, each router waits for its upstream routers to .nish their updates before it can update its own, and later noti.es its downstream routers after it .nishes updating.

safeGuard allows all routers to update independently, as it does not modify the convergence process.


We demonstrate that our algorithm for the layered case can be adapted to provide a solution for this case.

the computation required of the adapted algorithm becomes proportional to 2 ¢, and thus, this algorithm is only applicable for the case where I is small.


As Figure 5(a) shows, regular weekly muling with intentional mobility was successful for the .rst 5 weeks of operation.

the .gure also shows a weakness in relying on human mobility: the gap in weeks 8 through 10 is due to December vacation by our mule carrier.


Note that the transmission power Pp of re r,j  ceiver j causes no interference to itself, since we adopt selfinterference cancellation techniques.

similarly, for the secondary network, s Pt,il(Yi, Yj) SINRs , (2) ij = N0 + Ips + Iss where s s Iss = Pt,kl(Yk, Yj) + Pr,k l(Yk, Yj), k.T s{i} k.Rs{j} Pp Pp Ips = l(Xk, Yj) + l(Xk, Yj), t,kr,k k.T k.Rp p Pp and Ps do interfere with the r,j r,j eavesdroppers.


3.2.1 Self-destroying data One reason for computing devices becoming outdated is that they run out of storage space.

in many cases, it is likely that the storage space contains information that is of no use to either the system or the user.


There are diverse operational conditions due to device diversity and distance ranges.

existing coding schemes do not cater to these.


f(0, 1) + ((y - 1)n - i) × 2 (x=0,y=2..n-1) i=1 (1) With such arrangement a quorum is composed of smaller and larger numbers (Figure 3).

choosing a quorum based on the .rst row and column (0, 0) from a 4 × 4 grid we obtain following the grid elements: {0, 4, 5, 10, 11, 14, 15}, from since both Pair-onPair arrangement methods do not satisfy the Rotation Closure Property, the nodes using the same grid-size array will encounter a problem with a rendezvous while their cycles are not aligned.


To erroneously remove an edge between i and j,both predicted ratios of con.ictfree locations (qi j and qj i ,de.ned by Eq.

(1)) must exceed ..erroneously adding an edge between i and j only requires one of these two estimates to fall below ..


NanoQplus also supports the LLN-optimized IP-based protocols for small embedded devices [1].

since our router supports them on the more powerful machine, we used only several basic primitives such as 802.15.4 MAC, timers, and serial communications that are required for the operation of the base station.


BRG1(u)and BRG2(u) by using 2-hop neighbor information.

the rebroadcast decision by BRG2(u)depends on the maximum coverage constraint.


It sometimes even performs better than the LP solution.

note that we used an LP relaxation that does not necessarily represent the optimal case.


The restrictive model of source speci.c multicast foresees an explicit source .ltering following source-based client subscriptions.

an attacker using spoofed IP addresses can pose similar threats as in the open host group model to receivers and the network infrastructure.


6.6 Veri.cation of withdrawals Similar to S-BGP [17], SPIDeR uses signed route announcements to enable the consumers to verify that a received route actually exists in the underlying topology.

as in S-BGP, the consumer cannot easily verify whether the route continues to be valid once it is announced.


If different branches are placed on orthogonal frequencies or are suf.ciently spatially separated, then the results obtained for a single branch represent system-wide behavior.

if different branches are within radio range (an issue beyond  TA() denotes the aggregate traf.c .ow ingressing at TAP.


Browsers providepadlocks andother cues toindicatepage encryption.

these cues are oftenignored or misunderstood[17].


2.3 Problem with asymmetric links RPL and Legos protocols assume that the links are symmetric.

the presence of asymmetric links can be predominant in WSNs [5].


Hence, most operators around the world (e.g., China Mobile, AT&T) are aggressively deploying WLANs for additional capacity since WiFi is cheap and easy to deploy at scale [2, 3, 4].

sustaining good QoE 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.


CAMEO relies heavily on accessing user context to enable targeted advertising.

the user should be able to specify which context data can be used by CAMEO.


In Figure 7(a), the computing thread can read symbols from all input queues; once it gets a data block from one queue, it computes partial results for all output queues, e.g., an SD server calculates the products of an entire column of H+ and the input symbol block of Y .

this may create heavy contention for the output queues as multiple computing threads may try to write to the same output queue at the same time.


We expect PGM to perform well in terms of exposure at the receivers because its NAK state at the routers allows it to block retransmissions headed for receivers that did not request them.

unwanted messages may still traverse non-PGM deployment only at the edges, retransmissions and NAK confirmations may traverse the entire network before they are blocked by PGM routers.


Also, AODV has great knowledge of network connectivity by using the HELLO message [2].

the HELLO message leads to unnecessary bandwidth consumption.


5.3 Integrating RRAA-BASIC and A-RTS While RRAA-BASIC and A-RTS address channel .uctuations and hidden terminals respectively, one might think that a simple combination of both algorithms would su.ce.

their coherent integration is actually non-trivial because RTS frames may also be lost due to col lisions with the hidden terminals.


The basic WCN was able to provide stable network con.gurations for a large class of wireless network topologies.

it was highly susceptible to packet drops greater than 1%.


On the one hand, technical and administrative restrictions result in a general unavailability of raw network data that would facilitate botnet detection on a large scale.

were this data available, real-time processing at that scale would be a formidable challenge.


In our experiments on operational backbone networks we can test the results with real user tra.c.

we have no control overthe tra.cpattern or the systemload.


The bitrate during the bu.ering stage is the same as in the prior experiment.

during the post-bu.ering period WSM chooses a lower bitrate for loss rates greater then 5% instead of thinning the 540 Kbps rate.


Based on De.nition 1, we can verify that any single node failure is identi.able, as for every two non-monitors, there is a measurement path traversing one and only one of them.

these three paths cannot identify simultaneous failures of two nodes.


Sampling and data aggregation are complementary techniques and many detection systems use both methods to achievescalability.

detection systems today typically use and produce only one data abstraction.


Hence, the PB-routing paradigm is loop-free as long as the potential function is single-valued and time invariant.

now consider any packet pat a node v. Since palways moves in the direction of the maximum positive force, pwill be forwarded to a neighbor wthat satis.es the following V(v);V(w)>0 (4) this is not possible if vis a local minima,1 i.e., we have 8w2nbr(v)V(v);V(w)<0 (5) 1The term local minima means that the potential of pis lower than that of any of its neighbors.


We thus base ourselves on scheme aHC presented there.

as presented there, aHC relies on the existence of a common reference string, whereas here we only have access to Fzk.


End-to-end security protocols have been developed to provide con.dentiality and integrity (e.g., Transport Layer Security (TLS) protocols).

providing assurance of availability is a more challenging problem as it involves the entire network infrastructure.


At present, as its algorithm is simple and easy to implement, the access control protocol based on CSMA model has been widely used in MANET with directional antennas, for example the D-MAC [3][4].

this model has some problems such as hidden terminal and deaf node.


introduce the information coverage concept and derive the cooperative sensing coverage for parameter estimation applications.

the estimator used in [4] requires the fusion center to know the target location in advance.


The main achievement of the RBS time-stamping of a reference broadcast is that it eliminates random delays on the sender side.

timestamping the radio messages in the low layers of the radio stack used in our method has practically the same effect and eliminates the jitter of interrupt handling and decoding times, as well.


Furthermore, protocols such as BGP which do not have an explicit statement of their goals are less successful: BGP aims in general to provide automatic policy routing including recovery from link failure in the global interprovider routing system.

it is not clear what its detailed goals are: in particular, if presented with a network topology and a set of policies, it can be very difficult to compute how BGP will behave in the face of a link failure.


Vehicles A and B also are inside it, since they lie in the interval [ p 2 - ., p 2 + .].

vehicle C is outside it, since C does not lie in any of the four previously de.ned intervals.