Total Candidate Candidatesdetected Candidates detected Anomalies Evaluated by Deviation Score by Holt-Winters 39 II 38 37 II In each case we were somewhat tolerant of discrepancies be- tween the anomaly timestamps in the journal's log entries and the times at which the automated methods reported anomalous network traffic.

we allowed a discrepancy of as much as 1.5 hours since both automated techniques sometimes shift the report significantly from the time of the event's on- set.


CASE STUDY: WHERE SECURITY CLAIMS FAIL AND COMPROMISE EAP SECU-RITY In this section we present attacks that exploit special properties of EAP systems to break EAP security claims.

the attacks break the channel binding, protected ciphersuite negotiation and cryptographic bindings of EAP methods that claim to provide such security properties.


Range-free approaches locate nodes using network connectivity information.

range-free approaches use the communication with each other instead of accurate distance measurements between nodes.


children(w) where D(w) = D(x) and w = x.

following CA, y extends an adoption invitation to x if y is at least as close to the sink as x (has the same depth or smaller than D(x)) or if y is a child of some node with the same depth as D(x).


Alternatively, we can reuse these building blocks across the middlebox applications as in Figure 4.

the processing logic and data structures for session reconstruction and HTTP parsing are shared across the IDS, proxy, and the web .rewall.


Hermitian codes are constructed using min / algebraic geometry (AG) principles.

hermitian codes are derived from a Hermitian curve in a finite field.


(t), such that a simple Boolean operation over all k values in HN(t) necessarily yields h.(t).


The way this signature is formulated with respect to the ACN follows.

to introduce a mathematical notation for this behavior, let  denote the event that an IP packet was transmitted from port b on host a to port d on host c at time t .(a, b) represents the client address and port and (c, d) the server address and port (note: this di.ers from the tcpdump format).


We express the transmission cost in terms of depth, which is at most t, and prove that the running time of the protocol is n °(t) .

this im- plies that the protocol is efficient whenever the number of Byzan- tine vertices is constant.


Many of the simple heuristics used to estimate link interference only predict whether a pair of links interfere with each other or not.


In addition to the main algorithm and data structures, we created some auxiliary programs to generate parameterized loads of .lters and messages.

we have identi.ed and used the parameters listed in Table 1.


Sn is equal to 1 if node n is transmitting a MAC data frame or waiting for a MAC ACK frame after a MAC data frame transmission.

sn is 1 when node n has captured the channel.


Although intentional inference motivates a di.erent perspective (such as the one in Section 5), the corresp onding analysis often tries to answer the same questions.

while initial models only considered the role of relative timing on the frame level and the received power [18, 19, 34], more recent capture models report observations that agrees with our analysis.


A visual indication is given to the user to deploy a new relay when the highest running RSS average goes below a threshold, Sth.

letting Si,j be the RSS mea surement from the ith replying node during the jth probe 0 -5 -10 period, deployment is triggered when N 1 max Si,j<Sth.


After these steps, all emulated BGP routers communicate with other BGP routers for propagating inter-AS routing information.

the emulated inter-AS network has been constructed.


However, traditional compressive sensing algorithms are computationally infeasible to apply in this setting because A has as many columns as the number of nodes in the network (e.g., one million itemsinaWal-Mart store).Todevelopa practical solution, we exploit the sparsity in x to eliminate large chunks of columns in A.


(10) T 3K gl,r when ß = L , only the local execution is applied.

d 6aL 2 when the application prefers to of.oad for remote execution, it can always achieve better processing speed than the non-of.oad case.


2.1 If Hi* is empty, i.e., no other hops of the packet has been scheduled, set t = t0,where t0 is a reference time.

2.2 If Hi* is not empty, .nd h ' so that |h ' -h*|= minh.Hi* |h-h*|.h ' is the hop closest * to h* among all the scheduled hops of packet i.


On the other hand, the distribution under Random-Walk has a considerable shift to the right side.

there are about 20% routes experiencing a stretch factor of 2.0 or higher (which means a routing path at least as twice long as the shortest path).


Finding an e.cient temporal path is made di.cult by the lack of a-priori knowledge of the evolution of the dynamic network topology.

nodes can base their forwarding decisions on their local knowledge based on a limited temporal and spatial scope only.


Consequently, it emulates the MN s home network on the access network for each MN.


(The success probabilities are calculated by the well-de.ned broadcast probabilities for the corresponding round.

the success probabilities for a given row x are calculated for the case where no node has received a message through round x.)


Focusing on the design of power ef.cient optical networks in the context of CapEx minimized networks, the works that are the closest to ours are [16, 18, 19].

in [16] the authors focus on two network architectures (IP-over-WDM with gray interfaces and IP-over-Optical Transport Network (OTN)-WDM), providing a break down of normalized power consumption over the IP equipment and OXCs/Electrical Cross-Connects (EXCs).


Recent studies [5] indicate that each class of protocol is suitable for a certain network and user pro.le.

the protocols that follow the path construction approach behave well in low mobility rates, while their performance degrades in the case of highly mobile users.


In an effort to evaluate LDA in realistic scenarios, we use delay and loss distributions drawn from the literature.


So far, LG servers have been considered as a secondary source of inter-domain routing data for discovering links in the Internet topology [2, 7, 9, 18].

lG servers have been used to augment some AS links to the AS topology extracted from BGP traces [7], or used to help verify the AS links found in the IRR [9].


For some of our classi.ers and some of our algorithms and some .eld permutations, the running time occasionally exceeds one minute; fortunately, these cases can be ignored as they almost always result in poor compression.

we can set a reasonable limit such as one minute or .ve minutes for running a compression algorithm and terminate the algorithm and discard the result for the given .eld permutation if it exceeds the given time limit.


= .D.Using the same bd,i, E[EPG] - E[EMG]isgiven by .D cPI s0 + [(cPR - PV )s0 +((c- 1)PR - cPV )s] >0, 1 - .D because PR » in practice.

e[E * > PV PG] E[E * and the MG] when the AP transmits data with PMAX same bd,i * according to Props.


Although conceptually simple, this approach has certain limitations.

this approach is feasible only so long as the placement of files on disks can be carefully controlled (to ensure mutually exclusive storage of files).


In each test, we ensure that each mesh node will route data to its nearest neighbor only.

no node will send tra.c directly to nodes that are two nodes away in the chain.


Note that the situation is assumed to be saturated in which Qs is always backlogged.

qs always has packets to be transmitted.


= a is a large constant, but is always asymptotically less than poly(N), that is, .< O(poly(N)).

tape Each mobile node functions as a carrier of a moving tape of polynomial size of the network scale N. each mobile node carries a tape of O(poly(N)) bits.


The Zip.an nature of the Internet tra.c implies that there are a large number of small .ows and only a few large .ows.

when ni|/( ni+ i becomes larger, ni becomes smaller, and |ni - ni ) becomes larger.


3.4 Breaking Channel Bindings Informally, channel binding is a service to assure a peer that an authenticator is eligible.

it provides post EAP security for subsequent lower layer communications between the peer and the authenticator.


In the week Thedu proxy is deployed, the number of shorter disconnections are marginally higher compared to the week when the stateless proxy is deployed.

the mean inter-meeting time is 5 minutes in the earlier week and 8 minutes in the latter week.


CONCLUSION The successful deployment of WiMAX as a BWA technology will be strongly dependent on how it will support multiple users and how it will be able to distribute multimedia applications such as VoIP, VoD and IPTV.

the performance of video streams over WiMAX is an important challenge, both from the perspective of the Internet Service Provider (ISP), which wants to maximize revenue while keeping customers satisfied, and the customers, which want to have a good service level with the minimum cost.


Each relative throughput MS also requires 500 Kbps.

a new MS start sending out tra.c 10 seconds after the previous MS. the .rst MS starts transmission at time t = 10, the second MS at time 20, the third MS at time 30, and so on.


Our experimental simulation results demonstrate that the life time of the routes chosen by the methods in [3] is much shorter than that of network-wide flooding on average.

it becomes much worsen in either one of the following three cases: (i) The distance between a source node and a destination node is far way from each other.


As further work, we will investigate other advantages providedby mrinfo exploration.

we are interested in the alias resolution issue and thepossibility to provide better topology model for both intra-and inter-domain levels.


With random on-demand replication, the node always picks a segment with probability 1 to store.

the node faithfully m replicates a segment to its local memory.


In this setting, our SRCM protocol is around 500% faster than the most ef.cient existing multiple-set protocol, i.e., PET.

while all existing protocols require more than 10 minutes to provide an estimate with relative error oof 0.01, our SRCM protocol can achieve the same estimation quality in 2 minutes.


We study the performance of the stable mobile path and the minimum hop mobile path when generated under different simulation time periods.

we evaluate the number of route transitions and the average hop count when the minimum hop mobile path and stable mobile path are generated over simulation time periods of 1 to 1000 seconds, 1001 to 2000 seconds, 2001 to 3000 seconds, 3001 to 4000 seconds, 4001 to 5000 seconds.


The problem of cooperative beamforming has recently gained the interest as it allows for reliable transmission of data from a source to a destination.

multi-hop relaying is attractive in high dense sensor networks where, due to the limited power constraint, nodes can only transmit reliably to the neighboring nodes that fall within its proximity.


The carrier sensing (CS) range is slightly smaller than the receiving range.

we found that a packet success rate (PSR) around 10 % is a good indicator for CS.


In these networks, for a proper functionality, nodes must forward tra.c unrelated to their own use.

these networks rely on network cooperation schemes to work properly.


Thus the problem can be formulated as follows: Maximize T0 such that the average waiting time for broadcasting the .rst link change during an update interval is bounded.

maximize T0 such that E(t0) = a,where a is the bound required on the mean value of the delay with which the update about the .rst detected change in an update interval is broadcasted.


This intuitionisincorrect,however,and causesbothfalsepositives and falsenegatives.Twodependent flowsmayalwaysoccurtogetherin thetrace,yethappensorarely(lowProb(X.Y))thattheirdependenceisnotidentified.Ontheotherhand,anunrelatedpairofflows canhaveahighjointprobability simplybecauseoneof the flowsis verypopular.

we take an information-theoretic approach to identify statisticallysignificantdependencies pairsofflowsthathavemuchhigher jointprobabilitiesthan merelydueto chance.we setup candidate rules ofthetype X .


We then discuss future applications and limitations of these results and their analysis methods.

we address the invariance property of not only contact-based metrics but also other mobility-related metrics such as network connectivity under the same framework, and discuss applications of these invariance properties in MANET study.


7.1 Routing for Delay-Insensitive Applications We extended the wireless package of the J-Sim Simulator [1], which implements the whole protocol stack of a sensor node, in order to simulate the characteristics of the underwater environment, as discussed in Section 4.

we modeled the underwater transmission loss, the propagation delay, and the physical layer characteristics of underwater receivers.


A routing solution can be considered a feasible solution only if all the throughput constraints speci.ed in the high-level speci.cation phase are satis.ed.

the XY routing can be used, as well as a custom routing algorithm that performs a recursive iteration over the mapping solutions provided by the previous phase, computing all the possible routes from each source to its corresponding target, storing the throughput of all the connections and verifying that the maximum limit of throughput is not reached.


The longer paths in Valiant routing also have the disadvantage of requiring the use of additional virtual channels to guarantee deadlock freedom.

the Valiant routing variant for dragon.ies as described in [13], which we will call Valiant [Kim:2008] , requires 3 virtual channels (instead of 2 for shortest paths) for the L links and 2 virtual channels (instead of 1 for shortest path) for the R links, to guarantee deadlock freedom [2].


Further, future work also includes the speci.cation of the integration of the mobile compact routing architecture with an indirection scheme to locate the mobile nodes and enable all-the-time reachability.

the scalability of the route look-up should be of the same order as that of the routing.


6.1.5 Maximum Transmission Count (MTC) To improve packet delivery reliability, one common approach is to retransmit lost packets.

when a node sends a packet to its next-hop forwarder (or the base station), the node will keep transmitting the packet until an ACK is received or the packet has been transmitted up to a threshold number of times, which we call the maximum transmission count (MTC).


Although it might seem natural to set the DHCP lease time to about the time of a typical class period; however, in practice, usage patterns are highly variable.

class periods are variable, wireless networks are deployed in many other parts of the campus (e.g., common areas), and the campus network must support an increasingly wider range of devices that use dynamic addressing (e.g., gaming consoles, phones).


In the remaining of the Section we show how a power law behaviour emerges, or not, depending on the con.guration of the mobility model.

there is a power law behaviour when the density of the scenario, both in terms of communities and external social links, are su.cient to explore enough distances.


One way to solve this problem is to allow a node to dynamically change the channel coding rate via negotiation with its neighbors.

if no parallel receptions are needed or the number of parallel receptions is small, a node can try to increase its data bit rate by reducing the channel coding rate.


They are subject to several constraints: Minimum and maximum power constraint: If PminGlk + N0 = ß, then vkl = 1.

if the receivedpower atthetransmitter oflink k is su.ciently large even when the transmitter of link l is using the minimum power level, then vkl should always equal to one.


While this works for the simple example we discussed above, it does not work well in general.

policies at various nodes in the clique can, in theory, cause longer path lengths to be explored .rst than shorter ones (if they happen to be more preferred).


In typical vehicle-to-vehicle communications the horned and the narrow Doppler spectrum will be present with high probability since the wave propagates mainly in the azimuth plane between transmitter and receiver.

the narrow spectrum usually happens in the .rst or second tap of the channel impulse response when there is strong LOS between transmitter and receiver.


Let Ri and Rj denote the sensing radii of sensor i and sensor j respectively.

we have d(i, j) = Ri +Rj when j is a sensing neighbor of i.j must fall into 8(i, Ri + Rj ).


Despite a wide range of work on this in the past, for example [4, 3, 13, 5, 8, 10], the classi.cation of network traf.c continues to be a challenge.

network traf.c classi.cation is a complicated multi-factor system involving the mutual interaction of a range of networks, hosts, applications, and protocols.


Further analysis showed that the median number of messages forwarded per node was similar, but some nodes transmitted disproportionately many messages using BUBBLE, especially in Flunet/ SHED1, implying high energy usage and potential bu.er over.ow at the over-utilized nodes.

25% of the nodes transmit over 45,000/22000 messages, using BUBBLE.


As Gq(t)(·) is strictly concave, Gq(t)(·) must be increasing along the line connecting p to .j(q(t)).

for all p in the interior of  and for q(t) .= 0, () j .


While previous work had modelled and analyzed the broken incentive structure subjacent to forwarding tra.c from an economic perspective, work on re-feedback and congestion exposure [17] pioneered a practical means of alleviating the tussle surrounding resource sharing.

congestion exposure advocates the use of congestion volume, rather than throughput or tra.c volume, as the by-product by which the impact of tra.c should be assessed.


As expected, the throughput falls and the delay increases as the shipping activity approaches to 100 %.

the impact of ship activity on the end-to-end delay is significant above 75% (see figure 11).


For instance, (1) a group of nodes may employ TFT, and the other may use GT; (2) a node may take TFT in the bootstrapping stage, but it may switch to GTFT in a later stage.

we need to study the mixed-strategy situations.


Note that the adaptive pacing algorithm aims at improving TCP performance in the wireless domain and thus has to be implemented at the entry point of a TCP connection into the wireless network.

for connections spanning across wireless and wired networks we distinguish the two cases: (1) the TCP source is a wireless device and the TCP destination resides in the wired Internet; denoted as wireless-to-wired flows.


For ZE{I,S}, we will obtain a lower bound on Pr[iEZAk(i)] and show it to approach 1 as so.Let Xk(i)be a random variable assuming a value of 1 if the crossing line iis not k-covered, and 0 otherwise.

xk(i)is an indicator of the event Ak(i).Let Xk ZXk(1) Xk(2)Xk(1Z1).Now, .


Traditionally, hidden terminals in a reservation based MAC protocol need to back off until data transmission is completed.

the hidden terminals are required to keep silent during data transmission.


The selection of r(Ti) also determines the new turning center with coordinates (cx(Ti),cy(Ti)).

r(Ti) is the distance between the vehicle s current location (lx(Ti),ly(Ti)) and the new turning center.


Despite their appeal, there are signi.cant barriers to the practical use of anomaly-based detectors in IT security infrastructures.

anomaly detection relies on formulating a robust definition of normality that sharply separates wanted from unwanted traf.c.


This results in reconstructing the multicast distribution tree, which incurs substantial delay due to the graft latency [8].

the proactive MBS scheme removes the tree update delay when an MS hands over from an active LMA to an inactive LMA if the inactive LMA already has joined the multicast tree and proactively broadcast MBS packets.


Note that the lifetime of a sensor node is the inverse of its normalized power dissipation.

thus we can de.ne a utility function for sensor node i as a function of its normalized power dissipation zi.1 ß ß+1 Vi (zi)= zi (22) (ß +1) and the utility of sensor node i with respect to its normalized power dissipation is negative, and given by -i (zi).


Modes shift according to the time threshold.

if no request arrives on a disk for a period longer than or equal to the time threshold, the disk will transit its mode to a lower power mode.


The unweighted version of the problem, where the goal is to minimize the number of Steiner nodes, is the special case of the weighted version where the terminals have weight 0 and the non-terminals have weight 1.

in this paper, we present a 0.775d-approximation algorithm for the problem of computing a Steiner tree with minimum total weight of the Steiner nodes for graph classes that admit spanning trees of maximum degree at most d. this yields a 3.875-approximation algorithm for unit disk graphs, an O(1/a2 )-approximation algorithm for a-unit disk graphs, and an O(A)-approximation algorithm for (A + 1)-claw-free graphs.


Based on the analysis, we proposed the corresponding solutions to problems which may occur when the NTLP protocol interacts with the Mobile IPv6 protocol.

we also present the cross layer signaling flows in different mobility scenarios.


5.5 Mixed TCP .ow round-trip times TCP is known to be unfair to long-RTT .ows.

short-RTT .ows tend to dominate .ows with longer RTTs when competing at the same bottleneck, as their tighter control loops allow them to more quickly increase their transmission rates.


Simulation results showed that these algorithms work well; Yet, we believe there is still room to extend this research.

if the node locations are not available, we need to .nd a way to divide the sensors according to the in-network nodes neighborhood information.


Consider a PoP with N core routers, numbered 1,...,N, each with L line cards having P ports each.

the line cards across the various CRs are numbered 1,...,N· L. Similarly, the ports across the various CRs are numbered 1,...,N · L· P. the ports of the .rst CR are numbered 1,...,L· P, while the ports of the .rst line card of this CR are enumerated from 1,...,P. The ports of the second CR are numbered P·L+1,...,2·P·L, and so on.


5.3 Nonce Re-use The third repair is to eliminate the intermediate states on the supplicant side.

the supplicant can re-use the values of SNonce until a legitimate handshake is completed and a shared PTK is achieved between the supplicant and the authenticator.


These di.erences can be seen in Figure 6 and are summarized in Table 5.

the subgroups generally have a larger corpus size and more days observed online than the set of all GUIDs.


Moreover it can also be shown that it is even hard to develop a polynomial time approximation scheme for it.


In this paper we present the design of Named-data Link State Routing protocol (NLSR), which runs on top of NDN.

nLSR uses NDN s Interest/Data packets to exchange routing messages.


As illustrated in Fig.1(a), we increase the sampling probability of the nodes within the circle centered at node S with radius r. After a few rounds iteration, the sampling will converge to the target event regions.


3.1.1 Handling Domain-level Topology Changes As discussed in the previous section, one of the key challenges for inter-domain routing in MANET is dynamic changes of the network topology.

a single domain may be partitioned into multiple MANETs due to node mobility and the gateways in the domain must detect the event.


Therefore, we conclude that to get sB from Bob, Alice has to send valid s1 (with valid CA and VA) in step (1) and perform honestly in step (2).

alice has to send s1 = ßh(m)d1 mod n to Bob unless she does not want to get Bob s signature sB , where ß .


Thus the design principles are di.erent from the ones that inspired the definition of IP.

some applications only require broadcasting or unicasting of short messages, which can be obtained even without a network layer.


Observed Structure of Addresses in IP Traffic Eddie Kohler* Jinyang Li t Vern Paxson* Scott Shenker*  *ICSI Center for Internet Research tMIT Lab for Computer Science kohler@icir.org, jinyang@lcs.mit.edu, {vern, shenker}@icir.org ABSTRACT This paper investigates the structure of addresses contained in IP traffic.

we analyze the structural charac- teristics of destination IP addresses seen on Interuet links, considered as a subset of the address space.


Although most of prior works focus on caching proxies placed in the network (e.g., hierarchical caching proxies [18], caching proxy placement [21], and caching within 3G networks [20]), we emphasize that in cellular networks, caching on handsets is particularly important because it does not incur any network-related overhead.

it eliminates data transmitted over the last-mile, i.e., the radio access network, which is known as the performance and resource bottleneck of a cellular network [31].


Thus, the attacker s goal is to match identities between the transmissions he heard before and after the vehicles change their identities.

the attacker observes two sets of packets from each observed vehicle: one set before the mix zone or silent period and one set after the mix zone or silent period.


An earlier study has shown that when the number of paths used for each SD pair is limited, the path selection method for ECMP can have an impact on the routing performance [11].

using link disjoint paths (disjoint path heuristic [11]) for each SD pair results in higher performance than other path selection schemes such as random paths.


Note that the physical interference model is representative of a scenario that does not use CSMA techniques; instead, transmissions should be carefully scheduled so that only sender/receiver pairs that do not con.ict with each other transmit simultaneously.

the physical interference model is suited for use with TDMA-like channel access schemes.


Interestingly, the latter paper shows that, if the users are given the possibility to allocate their power over multiple channel states, there is little performance loss in terms of sum-rate by transmitting only private information and only when the interference is suf.ciently small.

under the stated assumptions, rate-splitting and common information transmission are not necessary.


Since the paper proves negative results about BGP convergence properties, it is sufficient to consider a restricted subset of the protocol.

the study establishes that the problem of checking the convergence properties is NP-complete, even with full knowledge of the routing policies of each AS.


As per theorem 1 this amount of memory does not depend on the number of .ows, .ow size distribution and packet size distribution.

s3 can, theoretically detect .ows with some granularity z,with prescribed accuracy, using a memory that does not depend on the total amount of tra.c nor on its speci.c properties.


Two nodes are referred to as directly connected if there are no other nodes between them.

if the packets that bridge A sends on port x are received by port y on bridge B without going through any other device, bridges A and B are directly connected via ports x and y, respectively.


NETWORK AND MBS MODELING We consider a WiMAX network in which there are total N cells; we assume that the LMA-based MBS handover is supported in the network.

the WiMAX network consists of multiple MBS zones, each of which is divided into multiple LMAs.


To explore these aspects, we refer to the application of economic models to the Radio Resource Management, an open .eld for research on which several contributions have appeared in the recent literature.

the concept of utility functions and issues taken from game-theory have been employed to represent a tunable Quality of Service (QoS), for example obtained through variations of the terminal s data rate [4, 5].


However, DCP tremendously reduces the transmission by degrading the reported information.

in Boolean sensing model, when node number is 5, the overall primitive I is 63.01, the overall I reported by N-DCP is 90.52, the redundancy ratio is 0.43.


Furthermore, we showed that the optimal manner of adapting to increasing error is to increase the number of forwarders by increasing the slope of the forwarding probability function.

the number of certain forwarders has the most impact on performance and they need to be increased with respect to error conditions.


Note that all variables are considered to be instantiated in the description of Rno-auth.

let  X, Y be honest agents, where X =.Y , let X, X. be threads executed by X and Y a thread executed by Y , and let n, m be nonces.


We like these ideas, and believe that this area of research is likely to evolve, more or less following the evolution of peer-to-peer systems themselves.

research in content-based routing on peer-to-peer overlays should look at the following questions.


In the .rst case, pre.x continuity is also used to restrict the construction of the multicast tree.

a branch cannot be built between a node and the root if they do not share the same pre.x.


Transmitter noise is by de.nition noise and is random.


we map entities described in the syslog .les to individual routers and links in the network topology.


ANALYSIS After showing MTurk experiment being more efficient as an experimental methodology and effective in collecting user opinions, we analyze further the data sets acquired from the lab and MTurk experiment.

we are interested in whether gender or age plays a role in the user scores.


The single-hop technique is applicable, though, if probe packets experience queueing delay only at a single, speci.ed hop h of the path.

this is possible if probes are treated with higher priority than data tra.c at all hops except h.such hopdependent priority queueing endows measurement packets with a hop isolation property.


As a result, short and long .ows compete for a shared set of network resources (e.g., link capacity and switch buffers) in an adversarial manner.

the buffer-.lling nature of long-lived TCP .ows often causes short .ows to get queued up behind packets from long .ows.


What we do is .nd the best oblivious routing for any directed graph.

for digraphs that are equivalent to undirected graphs the result of R¨acke will hold.


We know that, under the assumption of exponential service times, the FPI policy improves the optimal static policy and is thus maximally stable.


Failing claims may cause authentication, key exchange and other security features to fail as well.

we will focus on the following security claims which we brie.y describe in the following: protected ciphersuite negotiation (Claim 1), cryptographic binding (Claim 10) and channel binding (Claim 13).


However, the fpr describes the overall network performance only indirectly.

in order to capture better the actual bandwidth consumption due to false positives, we introduce forwarding e.ciency asametrictoquantify the bandwidth overhead caused by sending packets through unnecessary links: #Links on shortest path tree fwe = (3) #Links during delivery  forwarding e.ciency is 100% if the packets strictly follow the shortest path tree for reaching the subscribers.


For all experiments, the errors were assumed to be caused by collisions.

no wireless channel errors were considered.


To execute a list of call branches, the system treats the call branches as sends followed by receives.

the system acts as if the principal sends the message x * after guaranteeing the formulas F, * then recvs the message y and relies on the formulas .. the the runtime trust management system selects a branch, within which it can successfully guarantee the formulas F. It calls the associated subprotocol procedure f with the parameters x * instantiated using the values in the resulting extended runtime environment.


(1) k iki ik i=1,i =k With the above expression, the data rate Rk for link k can be computed as  M B (m) Rk = Ck .

m m=1 Rk is the aggregated data rate of link k over all M subcarriers.


[10], whether stability and .nite delivery times for all packets can be achieved against all adversaries of rate r=1.1 As discussed above,we show that for some sequences of packets injected at rate r= 1,it is impossible (even by an of.ine scheduler) to have a .nite upper bound on the delivery times of all packets.

an adversary that is committed to have itself a schedule for the packets such that there is some .nite bound on the delivery times of all packets,is a weaker adversary than the rate-1 adversary.


Throughout this paper we count levels from leaves to the root , i.e., we de.ne the level of a node u in a-HST as the distance in hops from u to any of its leaves.


The received signal is also represented as a stream of complex symbols spaced by the sampling interval T. These symbols differ, however,fromthetransmitted symbols, bothinamplitudeand phase.

if the transmitted symbol is x[n] the received symbol can be approximated as: y[n]= Hx[n]+ w[n], (1) where H= he.


Several WBAN protocol proposals can be found in the literature, as well as studies of applicability of existing Wireless Sensor Network protocols to WBAN scenarios, see for example [7].

[7] consider the IEEE 802.15.4 standard as reference, [3] mainly focus on reducing devices duty-cycle to save energy, while [4] proposes a Time Division Multiple Access (TDMA)-based Medium Access Control (MAC) protocol.


A good design of a scheduling algorithm should take into account not only maximization of the system throughput through service differentiation, but also being fair to users who use the same service and pay the same amount of money.

scheduling algorithms should balance the trade off between maximizing throughput and fairness.


CONCLUSIONS Inthispaper wehave consideredthephysical-layertechnique developedin[9,10] toprovide authenticationbetweenAlice and Bob assuming a more general model for the attack employed by Eve.

we provide the optimal Eve s strategyin the case of single attack and weperform an analytical computation of E[PMD] with respect to channel distribution.


Accordingly, the MPP decides to use PCF-enabled mode for next superframe if Q0 is larger than the queue threshold in the MPP, Q0, or if it receives a PCF-enabled mode request from its neighbor MPs.

the MPP changes the operation mode from contention mode to PCF-enabled mode if Qi >Q i for i=0,1,2,··· ,n. (1) Let R be the channel bit rate and TCFP be the maximum operation time of the CFP.


However, some results exist in radio network literature whose models are essentially the same as ours.

chlamtac and Kutten [7] study the complexity of minimum latency broadcast scheduling with interference and show that the problem is NP-hard for general graphs.


It keeps the link to the closest processed neighbor, say v1, in GG, and removes all links to all neighbors in the .-dominating region of v1.

the neighbor v1 dominates all other neighbors in its .-dominating region.


It allows the network operators to determine, collect and evaluate data on service usage when users transfer their ongoing communication session(s) from one device to another or a set of devices within its domain or across multiple operators environments.

we describe the interactions required between the signaling protocol and the accounting protocol in support of session mobility.


In the following we prove that the backwards rewrite theory (SP , EP , R -1 ) is sound with respect to the forward BP rewrite theory (SP , EP , RF P ).

we need to show that if we .nd a symbolic initial state S0 from a symbolic attack pattern S then, for any concrete initial state s0 such that S0 >.


The proposed context information set for the mobile network selection includes service requirements, user preferences, device capabilities, interface power consumption, user mobility, service criticality and end-to-end QoS (e2eQoS) prediction information.

for providing the near-accurate estimate of the e2eQoS and minimizing power required at the mobile device to search all the available wireless networks, the QoS prediction context source located in the fixed network provides predictions on the availability of mobile networks and their estimated e2eQoS along the user s travel path.


The results clearly show the same trends as observed at hotspots in Figure 8(b).

music is the leading application at locations corresponding to night hotspots even during the daytime as well; social networking istheleading applicationatlocations corresponding at noon hotspots even outside noon intervals; dating is the leading application at locations corresponding to evening hotspots even during non-evening periods.


Using the result of Palacios and Tetali [14], 0 one nk nkn B = can explicitly compute all the hitting times of such a chain.

theorem 2.3 of [14] states 2 2(k-1) k-1 01 - 2 (1 -) nk nnk 2 0 0 2 nk 1 - 2 nk Summing over 0 = t * = T * - 1, T * -1 T * -1 E [.t* ] = (k - 1)cXY T Bt * XQ0, t* =0 t* =0 The rest of the proof is algebraic; we compute the eigenvalue decomposition of matrix B and based on that, we eT * -1 establish the lower bound on E [.t* ].


This question is important because ranking autonomy and .ltering expressiveness re.ect the realities of how ASes specify policies today, and little is known (beyond the results surveyed in Section 2) about the tradeoffs between autonomy and expressiveness as far as routing stability is concerned, particularly under .ltering.

our work is the .rst to develop necessary conditions for stability under realistic assumptions about autonomy and expressiveness and the .rst to derive necessary conditions for stability in policy routing.


3.1.1NotationsandAssumptions In the proposed scheme, the proxies are assumed to be partially trusted.

the proxies are assumed to convert a received ciphertext using the proxy cryptography and forward it correctly.


Sweeping attackers periodically and simultaneously switch channels irrespective of channel activity, and they jam their channels until the next period.

each sweeping radio changes the jammed channel every sxa time units and jams the channel for (sx - 1)a time units.


(2) False positives (FP) the fraction of cases in which the classi.er estimates a weak channel, whose expected throughput is less than the average throughput across all available channels.

false positives account for scenarios when CSpy hurts performance by switching to a weak channel.


6.1.3 Sensitivity toApplicationPortfolio Next, we evaluate the effect of varying the applicationportfolio.

we consider the case where the router implements only a subset of the six applications described earlier.


It is easy to show that the distance from p s sphere to q s sphere minus t is always less than p s sphere to a s sphere minus b if q wasinlockstepwith a.

informally, ¯¯ ¯ this is because PQ < PA-1 and therefore PQ-1 -t< (PA -1) -1 -(l + b) < PA-1 -b.q s ¯¯update of its active set will always arrive before a s sphere enters p s the boot radius.


All of our techniques use non-parametric procedures.

we directly leverage on smoothing and density kernel estimators [14, 12, 18].


In this paper we present the design of MultiScan, its prototype implementation, and demonstrate the usefulness of our approach for seamless handoffs in 802.11 WLANs.

we evaluate the performance of MultiScan using traf.c .oods and a popular commercial VoIP application Skype [15].


In this paper, we extend NDN data plane to support deadlineaware packet processing.

we propose to add a new attribute called deadline in the NDN data name, give concrete forwarding strategies that differentiate packets by their deadline attribute, and show its potentials in reducing latency.


It also knows the type of the packets going through itself, e.g, whether the packet is a data packet or a control packet.

when non-private routing protocol is used, the insider attacker is able to know the communication ends for the Mesh connection.


Such an approach relies in turn on the commonly shared group key material, and thus, as discussed in Section 4.3, cannot assure source authenticity of rekeying messages.

group members cannot be sure that a rekeying message has been actually sent by the GC.


On more advanced interconnects, however, the semantic gap between overlay features and physical interconnect features presents di.cult performance challenges.

guest OSes see only a relatively simple Ethernet interface and so do not provide the overlay with higher-level semantic information about desired network semantics.


Nevertheless, for overlay diagnosis, we naturally inherit the scalability and load balancing from [10].

to diagnose an overlay network of n nodes, we only need to measure O(n log n) paths instead of all the O(n 2) paths.


DIFFERENTIAL BANDWIDTH ALLOCA-TION By decoupling ef.ciency and fairness, XCP provides a .exible  (a) Time (seconds)  (c) Time (seconds)   (b) Time (seconds) (d) Time (seconds) framework for designing a variety of bandwidth allocation schemes.

10 the min-max fairness controller, described in §3, may be replaced by a controller that causes the .ows throughputs to converge to a different bandwidth allocation (e.g., weighted fair ness, proportional fairness, priority, etc).


A subtlety in the passive estimation approach is that no loss information is detected between successful packet receptions.

if a node disappears, its estimate should degrade to zero.


It then (virtually) tags each packet meant for a client with the two best antennas from the client s preference list.

a packet for this client is considered for MU-MIMO transmission only if at least one of the two antennas it has been tagged to is available as illustrated in Figure 6.


In particular, strategies may be sorted in decreasing order of e.ciency as Rate-Limit, ProportionalKeep-Lowest, Proportional, Proportional-Keep-Highest and Keep-Highest.

removing bandwidth from strong ties can reduce the bandwidth consumption considerably while incurring a lower age than the one experienced at the same average bandwidth when removing weak ties.


We found that the success rate of VRR is less than 100% in our experiments because the link failure detection protocol implemented does not always work.

in theVRRimplementation,alinkisdisabledifthepercentage of received packet falls below a threshold, and re-enabled whenthereceptionratioisgreaterthanit,usinganexponentially weighted moving average (EWMA) .lter.


In particular, an allocation d is called a-portion fair if di = ad¯for all backlogged .ow i.

each .ow receives at least an a-portion of its fair dominant share d¯.


The Q-learning algorithm learns an estimate Q of the optimal Q-function by selecting actions and observing their e.ects.

each step in the environment involves taking an action ak in state si and then observing the following state sk and the resulting reward.


MCAs are designed to reduce the ability of AOAs to construct accurate traces.

mCAs camouflage the mobile user s movements by routing them together yet attempting to minimize the overhead of additional travel.


An exhaustive comparison is out of the qA jqE rithm R such that for all m.MqA and all m. scope of this work.

mqE , 5there may be further communication at the E inter .. qA P(F (m,mjqE )= mqE+1) face to communicate the setAq to the adversary.


It turns out that when implementing the algorithm in hardware, the bytes of the data are reversed before the CRC is taken.

a byte with bits 01234567 turns into 76543210.


For example, FTM can translate different levels of WCS: if evaluate(P1) == 2·evaluate(P2), then the allocation represented by proposal P1 has twice as much survivability as P2.

a module can provide a cardinal rank that accurately re.ects the magnitude of one option over another.


The dominant resource of a packet is de.ned as the one that requires the maximum packet processing time.

let tr(p) be the time required to process packet p on resource r. The dominant resource of packet p is rp = arg maxr tr(p).


In addition, in our simulations we let the overlay graph topology change over time contrary to what we assumed in our model.

we let users join and leave the peer-to-peer network according to the Law and Siu algorithm[9] which webrie.y outlinebelow; we referthe reader to[9] foramoredetaileddescription.


Asfor theformer one, the authors do not consider the presence of an attacker; assuming link and sensor fault probabilities,theyfocus ontheinformation survivalthresholdin sensors and P2P networks.

they analyze the conditions that lead to aquick spread orquick extinction of thedatum.


on the port cards of the router (as is typically done for IP forwarding).

there is no fundamental architectural reason for ESP packets to be diverted far from the fast path for processing.


However, we need to solve some additional security issues to securely query past data.

if a sensor is compromised at a certain time, the attacker should not be able to alter the data collected in the past before the sensor was compromised.


Moreover, such drastic reduction in communication bandwidth coupled with high latency makes the whole network vulnerable to congestion due to packet collisions.

systematic .ooding is unacceptable as it would be intrusive to other services (e.g., a number of AUVs with different tasks).


In the early days of the web, well before the advent of ICN, there was a .urry of research about web caching [9, 27].

one popular design goal was that of cooperative caching [13, 21, 23], in which each cache called upon another cache as needed before contacting the content server.


Here, the transmission time of the AP should not exceed the packetization interval because the wireless nodes need to send at least a packet within a packetization interval to keep their queues empty.

xAP + t · P<i (5) Figure 4: Simulation topology Then, i - xAP P< (6) t Eqns 4 and 6 are plotted in Fig.


For example, we will have a report that lists the source IP packet hogs, and how many packets each of those sources sent.

these reports allow answering of many common questions asked by network operators.


In our algorithm, after a client sends a request to the server, other clients can download the data.

after one cache miss, other clients may be able to access the data from their local cache.


For this reason we need to analyze the sensitivity of the nonfading probability s to the queueing performance.

we assume that the nonfading probability s is estimated through a measurement of the channel condition.


Be aware of the drawbacks and limitations of existing wireless network emulators, we aimed to design and implement a new one that is able to emulate network topology and mobility of mobile hosts.

with a set of network parameters, EMWIN can map the target mobile wireless network to an emulation configuration in a laboratory private network, which consists of several emulator nodes and wireless devices if necessary.


For instance, in .gure 5, both sensors s1 and s3 satisfy the condition .1 - .2 =0, however sensor s2 satis.es the condition .2 - .1 = p. Figure 6: Avoiding Skinny Triangles Due to errors in angle measurements, sensors should be very careful in selecting the anchor pairs they use to localize themselves.

a sensor should avoid using any anchor pair that forms with the sensor a skinny triangle.


We experienced that TinyNET represents a change of perspective with respect to the usual development of TinyOS applications, as it endows TinyOS developers with the chance to follow the well known divideand-conquer design strategy for complex systems.

tinyNET allows to subdivide the development into many simpler independent parts, each to be handled separately.


One interesting kind of error we observed was correct .ltering based on incorrect registry data.

if the ISP database and registry database become inconsistent, then the ISP s routers can be con.gured correctly but still suffer from miscon.guration as other ISP s routers .lter their announcements based on incorrect registry entries.


We observe that the short-term nonuniform access can fundamentally alter the BEBA operations as assumed in the ppersistent scheme in the following aspects: 1) the shortterm nonuniform access renders a lower probability of successful transmission compared to that obtained in the ppersistent scheme; 2) the probability of successful transmission achieved by BEBA is less susceptible to the number of contending stations than that predicted by the p-persistent model.

as the network size grows, the former falls at a much slower rate than the latter; and 3) the probability of collision experienced by BEBA is signi.cantly lower than that predicted by the p-persistent model.


To make the analysis easier, we also denote by Si,j (x) the set of nodes whose values x should have received if we deliver all the original values instead of a synopsis in the gossip algorithm.

si,j (x) is the aggregation of the values in the set Si,j (x).


These identi.ers have some similarity to the key used in our proposed scheme (as described later), however, the manner in which the key is used is quite di.erent from the use of unique identi.er suggested in [12].

[12] suggests that the unique identi.er be included in each message.


We evaluate the framework itself and study two deployed urban mesh networks using measurement sets from approximately 30,000 client locations in each network.


If such functions are present and they have not yet been taken over by other nodes, these functions are recognized by the node as damaged functions.

a sensor function in the NMT that is not listed in the HELLO packets periodically sent from the node having the function is treated by its neighbors as a damaged or broken function.


In this paper, we focus on investigating this adaptability issue with respect to proactive MANET routing protocols.

our system is built as an extension to OLSR.


Finally, we expect that the servers will allow a .exible, scheme-agnostic approach to naming at high level.

publishers are basically free to name their content as they see .t.


For each data collection round, whether a node successfully received data sent to it by its child nodes was determined randomly but with a speci.ed intended loss rate for each node.

as the number of data collection rounds increases the actual loss rate of each node should converge to the intended loss rate.


First, each member function must distribute a highly correlated set of input values (IP packet pre.xes), P, as uniformly as possible over the hash s result value space.

for a hash function H : P.2m in F, and distinct packets x y .P=).


Here dt(i, j)denotes the Euclidean distance between nodes i and j in time slot t, and r is the common transmission radius.

a pair of nodes are neighbors if their distance is no larger than r. To further characterize a successful reception of a transmission, we consider the classical protocol model [20], i.e., a transmission from node i to node j is successful if for any time t within the duration of the transmission, dt(i, j) = r and each node i. except i with dt(i',j) = (1 + .


Policy at host B is an application level weight policy and the same as of host A in case 3, as follows.

(-, -, (RTT300Kbps), (BW, 1.0)) the application policy is used to any direction of any traffic class, with requirements on RTT and speed, and concerns only bandwidth as factor.


Available technologies, such as Platform Terminal Transmitter (PTT) and GPS tags [18], cannot hope to achieve these goals because their power demands conspire to make the tags useful for only single aspects of the study described above.

they can either collect a handful of daytime .xes at regular intervals over long-periods, or they can collect high-frequency movement data over short periods.


Then, the weight of edge (v, r) should satisfy: For vertex x: W1 +w(v, r)<w(x, y)+W2, For vertex y: W2 <w(x, y)+W1 +w(v, r).

w2 - W1 - w(x, y)<w(v, r)<W2 - W1 +w(x, y), and there is a feasible choice for w(v, r).


The analysis of all possible combinations of .ow pairs provides instead the basis to evaluate the packet loss probability p (the other fundamental variable that we need to compute the throughput) of a node in an arbitrary topology.

two-.ow scenarios are the building blocks that can be used to evaluate the collision probability of a transmitter in any network topology: a transmission on a link is successful if it does not collide with any other transmission on neighboring links.


Applying UDmap to this range, however, we identi.ed 7045 IP addresses as dynamic.

the range from 148.202.33.64 to 148.202.33.255 was identi.ed as dynamic, where 73 IPs in this range were used to set up mail servers.


Thus by Lemma 7.4, GoodExits(uVt)Choose max[(PossibleExits(uVt))S[for all tT1.

as noted in Section 6, BestRoute(uVt)bestu(route(GoodExits(uVt)Vu)) bestu(route(S[Vu)) BestRoute(uVt)remains .xed for every node ufor all t T1.


An attacker could either be an outsider who wants to gain access to our data or services or a PN owner that has become a trusted member of a PN F. For each one of these cases we have to examine the respective threat trees.

we should analyze the outsider threat tree (figure 1), which represents a usual attack process of an outsider (government agencies, industrial spies, etc) and then the unpredictable human factor threat tree (figure 2), which represents the involvement of a PN owner (might be a PN F member in the worst case) into the hacking procedure.


The SCC AS has a key role in IUT since it constitutes an anchor point for IMS signaling for all devices that a specific user needs to engage in a Collaborative Session.

it terminates the session control signaling paths (access legs in IMS terminology) of all IUT-enhanced devices participating in a session.


5.3.Initial stride and number of sub-tries The selection of the initial stride determines the number of subtries a trie will be split into.

an initial stride of k will lead to up to 2k sub-tries.


We use the same distinction but also consider the special case of the sink s neighbors [4], whose energy consumption pro.les are fundamentally different if the sink s radio is not duty-cycled (i.e., it is always on), as is often the case and as we assume throughout this paper.

for sink neighbors the footprint of unicast transmissions, di ut, is typically three orders of magnitude smaller than for regular nodes because tw (generally of the order of seconds) is replaced by the packet transmission time (of the order of ms).


In addition, although existing scheduling algorithms can take both packet delay or throughput and channel conditions into account, they cannot provide the guaranteed QoS to RT users and achieve good channel usage efficiency.

existing scheduling algorithms cannot provide a good tradeoff between the channel usage efficiency and QoS provisioning.


Toaddprotection,FlexCastdesignsaratelessvideo codecbased on raptor codes [24] that allows the sender to protect bits in dif ferent distortion groups according to their relative importance.

it has the property that if a particular group of bits is encodedwithmorebits,thenitsreconstructionerroriscorrespondingly lower after going through a noisy wireless channel.


By accessing the physical layer of 10 GbE in software in realtime, minProbe can insert or remove /I/ characters from application tra.c as needed.

two variables of the probe tra.c are of interest: The gap between packets and the overall rate of packet trains.


Therefore, in the proposal based on the node degree, we use an opposite approach.

the higher the degree of a vehicle at a given neighborhood, the higher its priority to rebroadcast the message, i.e., the lower the waiting delay.


Each link is associated to an average Signal-to-Noise Ratio (SNR) value which determines its quality.

our model is based on a fully-connected network to account for any possible interaction between nodes at the physical layer.


So, the attacker can derive KAS only by a single explicit guess of KAB .

the maximum number of times the attacker has attempted is just 2|KAB|.


WMNs are also cost effective as they eliminate the need for a core network.

nodes no longer require a wireless router to connect to each other since each node acts as the client and as a router, thus reducing the number of components that need to be purchased as well as the network setup costs.


Note that AS paths of length 1 (2 AS hops) are always valley-free.

relationships supported by links observed only in paths of length 1 can be treated separately and removed from the input data (indicated as no-cons in the table).


> U , and (c) both the seed and peers use RF.

we show that in such a single swarm system: study a universal system comprising 3 swarms with 3 pieces .K .


However, the sender and receiver have to put their mobile devices together.

only hi-end mobile devices have built-in NFC tags.


Table 2 answers the second question: how different are the endpoint information sites in different world regions?

table 2 shows top entries for three different world regions we explored (details provided in the next section).3 While some sites, e.g., projecthoneypot.org or robtex.com, show global presence, other top websites are completely divergent in different world regions.


The impact of feature selection to learning accuracy, memory footprint and FP rate of class c (bad) is demonstrated in Table 3.

it compares the accuracy using all 7 features to the accuracy of using only one feature.


While most of these components can borrow virtualization solutions from the wired network [5, 14, 16, 25, 28, 31] and desktop/server [15, 17] domains, the access network has to additionally deal with wireless resource virtualization, which is the focus of this paper.

several unique challenges get introduced in the virtualization of wireless resources: (1) Unlike wired networks, co-existence of slices with bandwidth-based and resource-based reservations is not straight-forward since the bandwidth achieved by a slice from a given amount of resources varies with the channel quality of the users and the .ow scheduling policies.


If this difference is too large, it indicates that a portion of some packet classes that rarely appear in the training data increases signi.cantly, or that appear regularly decreases signi.cantly.

this serves as an indication of the presence of an anomaly in the network traf.c.


Proof: Wlog, let w2nbr(v)be such that w=6u.

then, by the shortest path property, we have cvu+Dud =Dvd<cvw+Dwd (12) This implies that Dvd;Dwd <1 (13) c vw and Dvd;Dud =1 (14) c vu Using equations (13) and (14), we get Dvd;DudDvd;Dwd (15) cc vuvw Using equation (15) and the fact that V(x)is a monotonically increasing linear function of x, we conclude that V(Dvd);V(Dud)V(Dvd);V(Dwd) (16) cc vuvw the force in the direction of uis maximum and positive.


between the detection performance and the energy consumption.

the .rst one leads to a combinatorial problem of identifying a path which achieves the largest possible mean detection-probability-to-energy ratio, while the second one reduces to .nding a route which minimizes the consumed energy while maintaining a predetermined detection probability.


in terms of link availability and available bandwidth).

this project determined that for user downlink communications, such a system could support, in the 28 GHz frequency band, data rates of 60 Mb/s per cell for 99% of the time with a bandwidth of 12.5 MHz and up to 120 Mb/s per cell with a bandwidth of 25 MHz and clean air conditions.


9.4 Importance of Cooperation & Soft Values We are interested in quantifying the impact of cooperation on the reliability of WLANs.

how much improvement in loss rate should one expect from combining packets across APs?


In doing so, we have developed an infrastructure that allows this class of schedulers to be easily implemented and tested at Gb/s line rates.

we have extended the ONL API to include functionality which provides ONL users the ability to place their own scheduler on the router, added measurement tools to the suite of standard router code that can run at up to a 100 µs granularity, and added flexible traffic generators which can produce Gb/s flows of any size packets with the additional ability to synchronize multiple generators to start flows to within 15 µs of one another.


The key difference between physical and service mobility is that while the first one attempts to continue the service uninterrupted even as the device (user) moves, the latter attempts continuous service experience even if this is consumed from a different device.

(traditional) physical mobility puts a single user device at the center of a network/ system (made of cells, or different network types), and attempts to offer service continuity; service mobility, as conceived in this paper, puts user media at the center of a device/system (made of multiple devices, running possibly over several types of networks), and attempts to offer service continuity by moving media seamlessly from one device to another.


All of the elements in the right hands side of (13) are either known from the of.ine tuning of the system or determined after channel estimation and magnetic-beamforming vector calculation.

isi = ßiIs where Is is the AC current, and IL = miIsi .


Other algorithms have attempted to minimize end-to-end delay mod- We also note that these results indirectly indicate that for any net work node v, the routes to destinations that are distant change much less frequently than routes to destinations that are close by.

route .uctuations are con.ned to destinations that are close to vand thereby improves the stability of routes.


4.2 Scenario 2: Heterogeneous Cache Sizes We proceed to relax the assumption of homogeneous caches.

we expect that as research in the area matures, caches will be sized according to a speci.c norm or a set of guidelines.


function and the set of actions for player i.

a maxminimizer is an action that maximizes the payo.


No other device in the reception range is allowed to transmit frames during this interval.

when an ACK frame occurs in our traf.c logs, we expect a DATA frame to precede it.


Furthermore, this work strives to provide a better understanding for the practical performance of the private reconciliation protocols and thus shows their suitability for a wide range of applications in practice.

our proof-of-concept iPhone application underlines the protocols practical relevance.


Extensive simulation using realistic classifiers and traffic traces shows that the proposed pipeline architecture outperforms HyperCut and B2PC schemes in classification speed by at least one order of magnitude, while with a similar storage requirement.

with different types of classifiers of 4K rules, the proposed pipeline architecture is able to achieve a throughput between 19.5 Gbps and 91 Gbps.


Moreover, this approach applies to the receiving capacity of the hosts.

the number of layers which the child host desires is shown by a real number.


In our algorithm, we use the vacancies as the commodity instead of mobiles.

we push the vacancies from the cells with fewer than k sensors to the cells with free mobiles.


Therefore, to address this problem, we propose a dynamic home network pre.x assignment (DHNPA) scheme where both the .xed pre.x model and the shared pre.x model are employed and dynamically selected.

for mobility session continuity, a shared network pre.x is used.


Intuitively G j is the number of successfully- N utilized slots per time-slot unit in the entire network using the jth code-word assignment combination.

if the information carried by a slot is called a packet, G j is the number of packets N successfully delivered in the entire network in an interval of time equivalent to a slot and using the jth code-word assignment combination.


Once a data request is received, the BS will only allocate slots to it up to the next q frames provided that the data UT still has packets to send.

the data UT must disconnect after q frames irrespective of its buffer status and enter the contention process again.


As part of our future work, Smart Prediction could be evaluated when nodes have heterogeneous wireless interfaces.

nodes are not required to have similar transmitting, receiving or idle power.


This algorithm is run at the start of the simulation, concurrently while the simulation is proceeding.

eliminating redundant and partial messages only occurs after the graph center is found.


While these schemes bene.t links such as wireless links with high bit-error rates, they are not universally applicable in the general Internet context.

these schemes do not apply in the case of congestive losses or link failures, the major causes of loss in the wired Internet.


2.3 Improving Communication Overhead sensor nodes is rare and unnecessary in many applications.

the public key authentication is mostly used by neighboring sen- The naive scheme and the above memory-ef.cient scheme are sor nodes.


However, due to the geographic scale and diversity of a wide-area wireless network, such statically deployed monitoring nodes are mostly inadequate.

such static monitors are unable to capture the impact of mobility on user performance.


Evaluation Settings The parameters used in simulations are compliant with the IEEE 802.16 standard [7].

the frame duration is either 4 ms or 10 ms, depending on the channel bandwidth, which varies from 3 MHz to 10 MHz.


That is why, the nonrepudiation is ensured in our approach.

if an incident has occurred, the network administrator can assert that the network administrator is not the attacker.


A key part of the analysis is to show that E [.t* ] is positive, i.e., applying the PD for one period of time results in an increase in the expected number of cooperators.

the following claim establishes the non-negativity of E [.t* ].


Accordingly, the total buffer space which should be provided at the Internet gateway is given by n awndi packets, where n denotes the number of active TCP i=1 flows running through the Internet gateway.

for a flow with a TCP data packet size of 1460 bytes and a receiver advertised window of 64 packets, we only need 187 Kbytes of buffer space for caching packets at the Internet gateway, which make up about 1.4 Mbytes for 15 flows.


One predicate of interest for this paper is the Contains predicate, which is used to reason about the relation between two terms.

contains(t1,t2) is de.ned by means of the subterm relation .


We do not allow direct communication between two mobile nodes.

the minimum hop count between two mobile nodes, even if they are within range of each other, is two.


Forwarding engines in many routers are designed to handle worstcase scenarios where all incoming packets have the minimum size.

assume that a router can support a KLmin packets per second where L is the link speed in bytes per second; Kmin (typically, Kmin = 40 bytes) is the minimum packet size; and a = 1is the ef.ciency factor.


Note that our notion of local timeouts allows the simulator to give di.erent delivery guarantees for protocol-internal connections than the real adversary does.

three repeaters implement two repeaters (cf.


Our work both corroborates known patterns of undesirable behavior in P2P systems, and provides more insights into them.

our .ndings on DDoS con.rm recent works where researchers showed the feasibility of exploiting P2P systems to launch DDoS attacks on the Internet [7, 9, 18, 30].


The idea of labeling each node such that the distance between two nodes could be determined using only their labels was proposed in [24].

a distance labeling scheme for n-vertex trees was proposed, using O(log3 n)bit labels.


In this paper, we leverage an automated tool for .ngerprint construction to study novel scenarios for WiFi-based device-free localization training and testing that are di.cult to evaluate in a real environment.

we examine the e.ect of changing the access points (AP) mounting location, AP technology upgrade, and outsider e.ect; on the accuracy of the localization system.


We reconcile the strategic model and the distributed computational model by using techniques similar to those in [18].


We seek a way to e.ectively visualize the information contained in D. To do so, we start by observing that in practice, we .nd that D has low e.ective rank.

although D is a n ×n matrix it can be well approximated by a matrix of rank r with r .


However, every additional constraint risks causing the symbolic formula to become unsatis.able.

if we mistakenly constrain a state-dependent protocol .eld to its original value, of course we will be unable to .nd a satisfying input.


4.3 Campaign to build the measurement database with DDP, NDDP and UDP scenarios As explained in Section 3.4, the idea was to obtain and store sets of RTT measurements performed at several fixed distances (4, 6, 9, 12 meters), including all the channel profiles for every distance.

for every scenario (a given profile at a given distance) sets of 1000 RTT measurements were obtained.


We can stack abstract protocols in the same way regular protocols can be stacked.

we can de.ne an abstract protocol on top of another abstract protocol.


In terms of data, instead of using BGP or traceroute data, our approach relies on the geographical location of end users or eyeballs (i.e.,, IP addresses) that are associated with an AS.

the starting point of our work is a dataset consisting of the IP addresses of about 48 million users of three popular P2P applications that map to a total of 1233 eyeball ASes.


The membership adjustment algorithm works as follows: for any Meridian node M, we need to check each of its ring members Mi 0.4 0.2 to see whether the prediction ratio of the edge between M and Mi is within a safe range.

if the prediction ratio of the edge is smaller than certain threshold ts or larger than another threshold tl, we need to place that corresponding node into rings not only based on the real measured delay but also based on the predicted delay.


The location of such a bubble is irrelevant.

the establishment of the bubble can be carried out locally, in the same switch where the routing decision is taking place [6].


In this work, we describe a new multivariate forecasting technique that enables the NWS to automatically correlate monitor data from different sources, and to exploit that observed correlation to make better, longer-ranged forecasts.

this new correlative method allows the NWS to combine infrequent and irregularly spaced expensive measurements (possibly obtained through instrumentation) with regularly spaced, but far less intrusive probes to make predictions that would be far too expensive to generate with probes alone.


Basically, the communication middleware is interfacing with the network through sockets that give the application little possibilities to in.uence the behavior of the underlying protocols.

the communication middleware has no in.uence on how packets are routed in the physical network.


The updates logged by these monitoring projects are generated either by individual route changes,or are part of BGP table transfer.

a session reset between a monitoring station and its BGP peers can result in the peer sending its entire BGP routing table to the monitoring station.


As for delivery ratio, Epidemic routing, H-Bubble Rap and ML-SOR performance is very similar.

the multi-layer social metric of ML-SOR and H-Bubble Rap works quite well producing a latency lower than classic Bubble Rap for most TTLs.


Theorem 1 refers to the symmetric super-graph of Gk,in which a link that is physically unidirectional is considered as bidirectional.

the connectivity of G+ k is in general higher than that of Gk, since in G+ k there are links that do not exist in the actual communication graph.


This requires a proper synchronization between the AP s of di.erent classes under the same cluster.

aP s from di.erent classes under the same cluster must be well aware about the sequence in which they will remain activated during the allotted class-time.


the guaranteed stability region in [10] is derived by linearly transforming the capacity region (with the s * (G)I matrix, where I is the identity matrix) using the smallest diagonal entry in S * (G).


Satisfaction of users is dependent on ful.llment of their expectations for individual experiments followed by consistency of multiple related experiments.

while the initial design and implementation phase was functionality centric, we have since graduated to a user centric enhancement phase.


3.3.1 Feature Extraction from Nodes In order to .nd patterns that nodes of a graph follow, we characterize the nodes with several features, so that each node becomes a multi-dimensional point.

each node is summarized by a set of features extracted from its egonet (egonet of a node includes the node itself, its neighbors, and all the interactions between these nodes).


Our scheme is better because it is information-aware.

it simultaneously prioritizes frequently referred entries as well as entries that cover more URLs.


A large national ISP may have an internal level of hierarchy in address allocation.

it may split its allocation into address pre.xes, one each for the different geographic regions where it has infrastructure customers from a particular region get address space from the address pre.x assigned to that region.


Although the total number of sensor nodes (N) in the network is large, the number of simultaneous events that produce sensing data are limited.

we assume that the number of source sensor nodes that actually producing sensing data (i.e., the number of nodes sENwith T5>0) is not a large number.


A major advantage of the Uniform Sensing Protocol over the static and dynamic active time slot approaches is the fact that uniform sensing does not leave any large openings in the network to be exploited by intruders.

an intruder always has the same chance of being detected, regardless of when it attempts to in.ltrate into the network area.


5.2 Evaluation Methodology In general, to compare the analytical and the simulation results, we use the .2 (Chi-Square) statistical test ([16]).

for the performance metric of distribution of the number of infected nodes as a function of time, the range of integers from 1 to N is divided into k bins, where a bin is assigned a range of integers that correspond to the number of infected nodes at a particular time instance.


On the contrary, DNS is an useful infrastructure of service providing subsystem on the Internet if the above problems are solved.

these problems are seriously revealed when some kind of communities, which are groups we call Virtual Communities (VCs), are dynamically built on the Internet.


Given the current DAG, it is intuitive that one schedules the requests starting from those with no dependencies, such as the Dionysus [6] algorithm.

the algorithm identi.es those requests without dependencies, which we refer to as independent requests, and schedules the independent request that belongs to the longest path .rst.


The upper bounds represent solutions to the tra.c grooming problem whose performance is precisely characterized.

when only two-hop segments are allowed, the logical topology is such that either all the odd-numbered or the even-numbered nodes are opaque, i.e., it consists of either single-hop or two-hop lightpaths.


5.1 Estimation of parameters of bipartite network from DTN In order to successfully establish a correlation between the two domains we need to .nd a value of the time varying threshold v in bipartite network functionally equivalent to the value of the parameter b in DTN.

the relationship between these two parameters creates a bridge between the two domains.


In the case of the lifetime is expired, the state is changed to the idle mode.

the MH stays in the active mode until its lifetime expires.


It is possible to modify XCP to maintain 100% utilization in the presence of multiple congested links.

we could modify XCP so that it maintains the queue around a target value rather than draining all of it.


To make the problem of extracting anomalies more challenging, we manually added to the candidate set .Fj .ows that had one of the three most frequent destination ports but had not been .agged by all histogram clones.

the most popular destination ports were port 80 that matched 252,069 .ows, port 9022 that matched 22,667 .ows, and port 25 that matched 22,659 .ows.


According to our work[2], the expected transmission range is essential to the calculation of critical transmission range.

we can investigate the impact of obstacles from the perspective of reachable transmitting scope.


ij 1 - or ij Because ExOR only transmits packets for a single destination in anygiven batch, a node can consider each batch fragment transmission independently.

for a batch fragment originating at s destined to node d, forwarding node iselects the bitrate as follows.


OMRMN makes use of all the paths and allocates exactly the same amount of tra.c on each path.


Our results include:  multiQis as accurate as Pathrate, which is active.

85% of the measurements are within 10% of their correct values.


The valuations function of all nodes are policy consistent, the export functions of all the nodes but m obey consistent export, and the network has path veri.cation.

then there is a BGP-compliant strategy for m that sets rm(·) = vm(·) and obeys all-or-nothing export (and therefore also consistent export), such that this strategy is optimal (utility-maximizing) for m. using the export-all rule is one such optimal strategy.


Thus, we statically associate an uplink channel with an IP multicast address at each SoDA.

in the example above, node A cannot selectively forward B s packet only to node D. All data on A s uplink is multicast to B, C, and D, regardless.


For example, we may decide to use MD5 or SHA1 for hashing blocks, while the hash function for the window is chosen such that it can be e.ciently rolled over the .le.

for e.ciency reasons we need to be able to compute an updated hash value in constant time from the previous hash value whenever the window is shifted by one character, which is one of the main bene.ts of the hashes described in [18].


Afterthispoint, the number of movements is equal to m. However, until t = qlog2(m/m0) there are fewer movements under replication than under the multiple random walkers mechanism.

under the latter mechanism mq log2(m/m0), while under the for- Llog2 (m/m0 ) 2i mer mechanism m0qi=0 movements take place, assuming that m/m0 is an integer power of 2.


InthesecondphaseBob receivesa message which comprises P OFDM symbols and uses an hypothesis test[14] todecideifthetransmissionisperformedbyAlice or Eve.

let H be the estimate of the channel obtained by Bob on the pilots of the message according to (7), where now the average is done over P OFDM blocks.


Next, we consider how geographically disperse these APs are.

we study the distance traveled between consecutive associations by a single client.


The utility of agent i from allocation Y is:  yij ui(yi) = min {}.

j.Siaij Si is the set of resources that agent i uses and aij is the rate of the consumption of each unit of resource j.


At the ports, shown at the lefthand side of Figure 2(a), a transaction-level protocol is used.

iPs connected to these ports issue read or write-like transactions.


The improvement will further ensure the mobile sensor can reach the destination successfully.

in each step of movement the triangle inequality theory is validated.


6.1 InformalDescriptionoftheProtocol The protocol assumes a public key infrastructure.

only bidders with registered signature keys can participate in the protocol.


The x-axis in each of the plots represents the number of (almost) equally sized partitions.

when x is 0, there are no partitions (or the network is one large partition), whereas for x = 25 the network has 25 partitions with 4 nodes in each partition.


assume there are two .xed ng = nb such that ga(na)=1, and gb(nb)=1.

when the HMC is in the good state (resp.


It is therefore not possible to simply shift all sessions to the radio interface that would be most energy-ef.cient if fully utilised, without paying attention to the actual throughput rates of those sessions and detailed energy models for the interfaces.

we know that it is sometimes more energyef.cient to use one interface, sometimes it is better to use another interface, but how can we optimise MPTCP s .exible handover of .ows between interfaces to maximise those savings?


So at that point she gives up and sends the entire message using an error correcting code and incurs a constant blowup.

say that for some .xed e > 0 she gives up when the block size is log1+e n. This means that the last phase before she gives up is i such that v n log n 2i = log1+e n ( ) 1 1 i = log n - + elog log n 2 2 The error threshold for this phase is 4n i+1 4= log1+2e n Let s analyze the cost of this algorithm.


When multihoming is handled at the LMD level, the external entities to the LMD (the HA, the CNs) will not be able to distinguish the situation in which the MN is using more than one interface from the situation in which it is using one.

the MN will only register one CoA per HoA.


We examine the effects as this data ranges from plentiful (frequent 16MB transfers) to scarce.

we wish to study how well NWS 64K messages can be used to predict large messages that are separated by several hours as the network conditions often change over this time scale.


Proposed Hybrid DV-Hop Most WSN applications are centralized.

a base station or the operator room is used to issue warnings, and take the necessary measures.


Such a system can provide the same function as we describe above in IWAS framework.

the client can also get access to the intranet through satellite.


Yet, in this case, he could keep zp(C1+.C ) entries at C1 +.C at the most, which is 1/z on the average.

the energy he may gain in a stretch of any size C su.ces to keep, on average, 1/z counters at zpC at the most; .ushes in between only diminishing this energy.


As mentioned, we used a maximum chunk span of 10, and an n-gram matching threshold of 2.

we only considered string chunks within a neighborhood of plus/minus 10 as candidates for input element labels, and we required a score of at least 2 for algorithms that involve n-gram matching.


There is a maximum allowed delay time, Max-ACKDelay, for acknowledgment.

upon the completion of a reception, any other ongoing receptions will be terminated if waiting for the completion of another reception will make any pending ACK to be delayed more than MaxACKDelay.


In this work, we focus on the second approach, where the decision if a node can substitute another node is based on the consideration if the substituting node satisfies certain conditions.

if a node N1 would like to change its state from passive to active and a neighbor node N2 would like to change its role from active to passive, this role changing can occur if and only if N2 is on a certain number of active paths of N1.


Control information for QoS management is broadcasted through the Beacon frame generated by the AP at the beginning of each beacon interval (usually 100ms).

the EDCA Parameter Set element (see Figure 2) of the beacon frame is used to send the EDCA QoS parameters to the wireless stations.


Second, the WSN has lossy links greatly a.ected by the environment, which results in transmission delay unpredictable.

the end-to-end delay of real-time .ows should better be tightly bounded.


To avoid border effects, we consider wraparound conditions at the network edges.

the network area is assumed to be the surface of a two-dimensional Torus, denoted by ...The v network physical extension .. is allowed to scale with the average number of nodes, since this is expected to occur in many growing systems.


Third, we completely characterize the mean .eld regime by PDEs, which allows us to both obtain e.cient solution methods and derive analytical conclusions.

we show that the dynamics of this system follow linear multidimensional ODEs when focusing on low and high age, which gives new insight into the impact of base stations and opportunistic node contacts.


Furthermore, these features vary in a predictable manner as a function of the amount of traf.c carried in the OD .ow.

we show quantitatively that the largest OD .ows in both networks are primarily deterministic and periodic; OD .ows of moderate strength are generally comprised of both bursts and noise comparatively; and the weakest OD .ows are primarily bursty (for Sprint-Europe) and primarily noise (for Abilene).


Figure 1 - Overall architecture of the hybrid delivery ofmultimedia streams As illustrated in Figure 1, in our work, we assume that all serversare independent with respect to the coding of their media streams(with the possible exception of scalable streams).

the timestamps of media units produced by different servers are notrelated, e.g.


More precisely, denoted as T'(S) a minimum spanning tree of G'(S) and as MST (G'(S)) its cost, considering T'(S) rooted at the source station s, the heuristic directs the edges of T'(S) toward the leaves and sets the range r(x) of every internal station x of T'(S) with k children x1,...,xk in such a way that r(x)= ( · maxi=1,...,kdist(x, xi) ' .

r is the range assignment of minimum cost inducing the directed tree derived from T'(S) and is such that cost(r) : MST (G'(S)).


It is the topological anchor point for the MN s home network prefix and is the entity that manages the MN s binding state.

it maintains the reachability state to the MN s address while it moves within the PMIPv6 domain  MAG: a functional entity that handles all mobility-related signaling on behalf of an MN attached to its access link.


In [11], authors propose Push&Track (PT), an o.oading solution based on prede.ned performance targets used by the network controller to compute the number of content replicas to inject.

the controller, at .xed time steps, operates content re-injections in order to force the opportunistic dissemination trend to follow a target dissemination evolution.


The .nite network area A is divided into large number of small tiles of size a, and each tile is smaller than the physical size of any mobile node.

each tile is virtually a node position A to stand on.


Based on our results, we identify geographical areas where spectrum sensing would help the most in improving the performance of spectrum databases.

the goal of the study is to characterize spectrum sensing readings that are most accurate (i.e.


MANETs are an occasional infrastructureless network, formed by a set of wireless mobile hosts that dynamically establish their own network on the fly, without relying on any central administration [2].

mANETs dynamically handle the joining or leaving of nodes in the network by self-organizing.


is a value of m under which the average value of TWPS is lower than the average value ofTMSP.

mSP is better than WPS when m > 4 for cases a and b, and when m > 5 for case c. As the value of m increases, the advantage of MSP over WPS becomes higher.


In summary, we see that RCE is low for the MCD algorithm for all the deployments.

mCD algorithm did not display sensitivity to the type of deployment in this con.guration.


(t-x ) (1)n -1 i =1 where x is the average of time instances at which the samples are gathered from the environment.

coincidence is the variance of sampling times of the packets that arrive at the sink under one aggregated packet.


From Lemma 7.2, for any fair activation sequence, there is some time after which all the exit paths in the system are valid.

from any con.guration, any fair activation sequence eventually results in such a valid con.guration.


Second, IP addresses for cell phones are itinerant similar IPs can be exposed to a server by devices at geographically distant locations.

iP addresses do not intrinsically embed .ne-grained information on the location of mobile end-hosts.


To expose a virtual topology, OVX resolves LLDP messages coming from the NOS.

when an LLDP message arrives at a virtual switch element with a certain outport speci.ed in its body, OVX knows where the other end of that link is.


Therefore, each TCP stream is characterized by a .xed number of packets (the TCP window size), which are travelling in the network.

in the steady-state condition a series of TCP data segments (in the forward direction) and TCP ACK packets (in the reverse direction) are constantly in transit from the AP to the hosts and vice versa.


We observe that for a visibility scope of l = 2, when the transmission ratio > 5, the network coverage of the required number of VSs is always smaller than the network coverage of the same number of VSs needed to ensure connectivity in secondary network.

for a speci.c area, the number of VSs required for a visibility scope of 2 is always larger than that required to ensure full connectivity in the same area.


the throughput of SUs with random M-sensing(i.e., all sensing) is much larger than that with random 1-sensing(i.e., random sensing).


In contrast to SOTIS, Tra.cView is node-centric, not spacecentric.

reports of nodes which are close to each other are aggregated by averaging their current speed and position.


We .nd that a path that experiences relatively many short failures does not necessarily experience many long failures.

bad paths for short failures may be different for bad paths for long failures.


Hence, the reward per packet should be 8 irrespective of the choice of threshold.

lof)and threshold-1 multicast policy should achieve the same throughput.


Our MB-facing ( southbound ) API de.nes how MB state is represented and how it can be access and manipulated at .ne-granularity.

state is represented as key-value pairs, with the key being either a string constant (for con.guration state) or a .ow identi.er similar to the OpenFlow 10-tuple (for supporting and reporting state).


If an output does not receive bids for at least ST cells, it does nothing during this round.


On the other hand, the multicast member size m has only minor effects on the performance compared to .min.

the minimum tree power is an increasing function of m and the maximum tree lifetime is a decreasing function of m under a fixed .min.


In fact, the concept of broadcast disks can be used to generate broadcast programs on multiple channels.

the data items in each group can be allocated into a channel where the groups containing data items with higher access frequencies have less data items such that the average access time for these data items is reduced.


MPR nodes are selected based on original MPR selection heuristics; MPR nodes of any node under consideration will be selected from one-hop neighbor of that node which covers two-hop neighbor nodes.

any one-hop neighbor node, which is selected by the other nodes (called MPR selector), is declared as the MPR node.


To address this effect, we associate each flow i E jr with a parameter C th, which acts as a bound on the instantaneous virtual goodput Ci(t) of flow i.

a flow i agrees to be compensated upto the threshold, beyond which the network does not try to address the errors.


Then, we find among all cases that Trunc FM needs to be used are not N-feasible, which are the ones where this Round Robin Trunc FM variation will not lead to a (N-1)-feasible solution for each node that could power off.

we are interested in cases where, e.g., when node1 is chosen to power off, then the other N-1 nodes achieve their targets, but when node2 is chosen to power off, then the other N-1 nodes cannot achieve their targets.


Each bu.er .ag is associated with a particular room in the bu.er and represents the status of that room.

if the kth room is occupied then Fi[k]=1 (as illustrated in Fig.


W-TCP uses purely end-to-end mechanisms.

it uses the ratio of the inter-packet separation at the receiver and the inter-packet separation at the sender as the primary metric for rate control.


In this context, Contact Graph Routing [4], the most prominent routing scheme, relies on the deterministic nature of space communications.

all nodes utilize knowledge of both their current state and all scheduled communication contacts to compute plausible routes.


This model of aggregating and transmitting is also suitable for function computation.

we can use this setup if the sink requires any divisible function [5] of the sensor measurements.


Such a model may also incorporate zero byte .ows.

if a connection fails, the likelihood of that connection s destination of being visited again may change.


By comparing CPU and memory usage, its scalability can be compared to existing models.

they show the quality of the new OBS model.


it can be very di.cult to create reproducible, multi-hop networks with such short distances between nodes.


Set i = 0 and start by picking a code-word W j randomly for the given node (node 0) out of the qk code-words.

w = W , where x is a uniformly distributed and i=0 x discrete random variable that takes values from the k set J= {0,1, , , q -1}, 2.


An item d is said to be a-persistent in window Serif pd(e, r) = a(r - e + 1).

d must have occurredinat least an a fraction of all slots within the window.


This random variable represents the angle a showed in Figure 2.

for each sensor, a random variable with normaldistribution with mean µi and variance si 2,(i =1,...,n)is generated, and solutions are constructed sampling from these variables.


Figure 6 merges parts of Figures 1 and 4 to illustrate how constraint di.erentiation works: we pick one, say s4,ofthe overlapping states s2 and s4 in Figure 4 (where t2 = t4) and replace the from constraint that does not appear in the other constraint set with a D-from constraint; this yields the transformed state s4 " .

we use di.erentiation of constraints to restrict the extension of one of the two symbolic states to those ground states that are not covered by the other (as illustrated by the shaded part in the set of ground states).


ImTCP can continuously measure bandwidth by using data and ACK packets of a TCP connection under data transmission.

the TCP sender transmits data packets at intervals determined by an inline measurement algorithm and checks the arrival interval times of the corresponding ACK packets to estimate bandwidth.


NUMERICAL RESULTS In this section, simulation results are presented to evaluate the performance of the proposed multi-path handoff scheme.

the proposed multi-path handoff scheme is compared with two single-path handoff schemes described in Section 4.


From this perspective, a hybrid .rewall one in which an exchange of messages controls the .rewall function corresponds to a routing protocol.

a routing protocol dynamically controls what paths traf.c should take to a destination; a hybrid .rewall dynamically controls what is blocked.


fp Among the .ve combinations,(bid, fth)= (3, 3)(bd = 1) exhibits the smallest X0.001.

(bid, fth)= (3, 3) shows the best performance when R=10.


M-TOP applies to the operator placement problem in data stream processing environments and considersa setof application-speci.c QoS-targets for operator placement.

provided a set of nodes to place a set of operators, M-TOP searches for an operator placement that ful.ls the speci.ed QoS-targets.


An important observation in .gure 2 is that the energy savings increase sharply as B increases from 1 to 2 or 3.

while switching entire links on or o. as suggested previously [4] would only allow us to reduce the energy consumption of the associated line cards by 54%, if all links consist of three cables, the savings increase signi.cantly to 73%.


we investi gate whether the semantic neighbours of my seman 1347tic neighbours are my semantic neighbours, and there1000 710 10000 fore can help when searching for .les.


In addition, the experiments in [34] were not performed in a well-controlled test environment.

both, the length of the set elements as well as the number of elements in a set were changed at the same time.


Some of the possible explanations for the heterogeneity of the implemented security levels can be captured by more elaborate equilibrium models.

(1) users have incomplete information on the levels of security deployed by other users, (2) the perceived bene.t of installing security patches may be smaller than the overhead patching incurs, and (3) some users may be gambling (knowingly or not) on the seriousness of the security threats they face.


E(L) almost everywhere, (1) N i=1 i.e., for all sample sequences up to a null set.

the ensemble average E(L) ofone epochofan RWP process with many nodes is equal to the long run time av- N erage 1 li of an RWP process of a single node.


And h is from 0 to n / log(4 ßn) -1 (represented by the rows of Table 1).

let s consider the link length classes Sk and Sn-log( 4 ßn)+k , which are the shortest length class kth and the longest length class in the scheduling round, respectively.


In this case, the genie is able to generate all possible matches by looking into both bu.ers.

the genie uses information from both nodes to make the swap decision.


While failure detectors are typically designed as stand-alone modules independent from the applications they serve, an implementation can save bandwidth through a tighter integration between the detector and higher-level system functionality.

aggressively harvesting information on node failures from higher levels can enable the detector to v delay or skip probes, saving bandwidth.


If everything is in order, the TTP stores d2 securely, and creates a voucher VA by computing VA = S ignT T P (CA, w, sw).

vA is the TTP s signature on message (CA, w, sw), which guarantees that the TTP can issue a valid partial signature on behalf of Alice by using the secret d2.


This immediately implies that if every transmitter uses a no-regret algorithm then the average performance over time is good.

in the protocol model we design a game that gives the following result: Theorem 2.1.


The peer-list is contained in each bot, each entry of peer-list is a four tuple , IP and PT denote a peer s IP and port, respectively; FC denotes the cumulative fail count and CL denotes the confidence level of a peer.

cL is the core of the reputation mechanism, it falls into three categories: source, authentic and available.


However, it allows the system to better adapt to the existing and changing requirements.

the different spectrum sensing techniques could be scaled in terms of their capabilities and characteristics.


Assume now that OR is used with a list of 2 candidates.

we assume that upon transmission, if any of the next 2 neighbors receive the packet, the closest node to the destination opportunistically becomes the next hop towards the destination.