The start time rate p is used as a measure of the number of traffic sources.

as the number of sources changes, p changes, but the finite sample distributions of the gj change in ways much more complex than just the change in p. the univariate distribution and the autocorrelation function of the gj change.


Starting over from a clean slate has the bene.t that you will often be able to streamline the design further and avoid costly detours that expended time and resources the .rst time.

evaluation study design is often smoother the second time around.


Since we target X3D clients specifically, SWAMP directly adopts X3D s scene-graph model.

sWAMP describes changes to fields of scene-graph nodes.


From the classic result of Fred Cohen (a Ph.D. student of Leonard Adleman) (see [7] for an account of the results) that detecting a virus by its appearance is undecidable, it follows that By knowing the defense mechanism, it becomespossible to build a virus that infiltrates into the systemi.e., fools the defender.


In that theorem we use a new notation: for any real number x, we de.ne {x}as x -LxJ.

{x}is the fraction part of x. THEOREM 1.


We assume to replace a standard TCP session between a client and a WEB server with a CONET session (exchange of CONET CIUs) between an end-node and a serving-node, or an intermediate cache.

we assume that: -an URL  is replaced by the network-identifier: namespace= www , principal= IP address:80 , label= path ; -TCP segments are replaced by carrier-packets that convey segments of named-data CIUs; -TCP ACKs are replaced by carrier-packets that convey interest CIUs (see Sec.


Consider two routing mechanisms S1({ai}) and S2({bi}) such that either bi is same as ai or ai is a constrained attribute and bi the corresponding unconstrained attribute.

.i (bi = ai)OR(ai is constrained AND bi = ai).


Link Management Protocol (LMP) runs between data plane adjacent nodes and is used to manage TE links.

lMP provides mechanisms to maintain control channel connectivity (IP Control Channel Maintenance), verify the physical connectivity of the data-bearing links (Link Verification), correlate the link property information (Link Property Correlation), and manage link failures (Fault Localization and Fault Notification).


Therefore, to disconnect the graph it is necessary to create a sensing void, so that it is impossible to draw a continuous covered path connecting a node in V1 to a node in V2.

as illustrated in Figure 2, the nodes of V1 may all lie in region S, the nodes in V2 may all lie in region Q, and a set of nodes W must be removed to make a region T that is 0-covered.


This may be achieved by redirecting the packet delivery tree (of the old location) to grow in the direction of minimum distance to the new location.

a branch should be established from the new location of the MN to the nearest point of the delivery tree.


3.6 Connectivity Finally, a peer-to-peer system of highly mobile devices over the mobile Internet has to face external adversities.

the underlying distributed data structures must be able to deal well with intermittent connectivity.


Moreover, our impossibility argument uses a 2-partitioning argument but does not require the system to (temporarily or permanently) decompose into k + 1 partitions.

there is no further restriction on the communication among processes within D and within D. Despite its main purpose of showing impossibilities, our theorem is also useful when developing new algorithms for achieving k-set agreement.


Lemma 4 illustrates the limitation of FIFO in the face of a single adversary, where a single message transmission can be exponentially complex with capacity constraints.

many simple distributed algorithms including the emulation of a single round in a Byzantine agreement  (a) (b) Figure 2: (a) Single adversary case.


5.1 CAPSAFE I CAPSAFE I employs a strategy that selects a single frequency with a general optimization goal of save the group .

the CAPSAFE I optimization goal is to select the single shared network frequency that produces the maximum aggregate link quality.


A Dynamic Bandwidth Allocation Algorithm for Supporting Real-time Applications in 802.15.3 WPANs G. Boggia, P. Camarda, L. A. Grieco, G. Tomasicchio DEE -Politecnico di Bari Via Orabona, 4, 70125 -Bari -Italy {g.boggia,camarda,a.grieco,g.tomasicchio}@poliba.it ABSTRACT The 802.15.3 Task Group was formed to create a standard that would enable wireless connectivity of high-speed, multimedia capable portable consumer devices within a Wireless Personal Area Network (WPAN).

the 802.15.3 standard de.nes a piconet as a wireless ad hoc data communications system, con.ned to a small area.


We can easily see from Fig.8 that when SNR > 5dB,packet loss rarely happens, SEP is always lower than 0.2%, and CEP does not exceed 1%.

when SNR > 10 dB, the errors caused by pure noise is negligible even at the chip level.


Experiments In this section we describe the experiments 2 we have performed on various of the Multiparty Computation Protocol that we had speci.ed and analyzed in [17].

in that paper we analyzed a num ber of protocols that were speci.ed using a dedicated uni.cation algorithm for equational theory H. Equation (7) was used and nothing else.


6.2.2 Bounds on Deviation From Expectation We now bound the probability that W deviates signi.cantly from its expectation.

for any random variable W and any t> 0, we have the following Cherno.


Conclusive results have been found only for scenarios where the interference power is either stronger or weaker than the direct (useful) signal.

it has been shown that with strong interference, transmission of only common information is optimal, since the interfered receiver can decode anything that the intended receiver can, while for weak interference only private information should be transmitted and treated as noise at the interfered receivers (see [4] for a review and further results)1.


Note that while our algorithms are targeted at nodes behaving in an altruistic manner, there are also practical considerations that make them more feasible than simply relying on the altruism of end users would.

these algorithms are implemented not by end users, but by equipment vendors.


Thus S is an optimal choice of observation statistics.


These links have many other transmitter locations i ' which have spatial link di.erences di-i,,j <..

many missed detections come from these few links (i, j) with unusually high temporal variations.


If there is insu.cient bandwidth for this, the device shall defer its transmission until the following superframe.

the data packets generating in the end of the short active period are very probably forced to delay their transmissions to the coming active period.


Previous studies have shown that in order to avoid starvation due to asymmetric links, the transmission power and the CCA threshold need to be jointly tuned for all nodes of the same connected (sub)network [10].

the product C = PL · CCAL must be the same for all nodes.


INTRODUCTION This paper addresses the development of a management mechanism for overlay networks.

we examine management tasks that relate to the content of communication being exchanged by applications.


The feedback in the probes bounds the send rate along any path.

each TeXCP agent, s, maintains an additional per path variable gsp, which is the allowed rate on path p. When it receives a probe ack, it updates gsp as: gsp = gsp + a+ - a- × gsp, where a+ and a- here are the positive and negative feedback from the probe ack.


INTRODUCTION In wireless sensor and actor networks (WSAN), a large number of sensor nodes obtain information which must be transmitted reliability to any of several actor nodes in an energy e.cient and timely manner [1].

actoractor coordination selects the actor which each sensor is associated with; sensor-actor coordination .nds the optimal means of sending and receiving information between an actor and its sensors.


The primary innovation of Alliances over NDMA is the use of spatial instead of temporal diversity.

an order j collision in Alliances is resolved by having a subset of j relay nodes transmit their received mixture of the collision to the base station.


To allow a gateway node to send frames consecutively in an non-interruptible manner, we leverage the transmission opportunity (TXOP) option in the IEEE 802.11e speci.cation [17].

a gateway node that succeeds in grasping the medium is granted the right to use the medium for a period of time speci.ed by TXOP.


This group of features characterizes the regularity of flow size behavior over time for both benign and C&C servers.

we extract the mean µFi,j and standard deviation sFi,j separately for both incoming and outgoing flows of each server.


By trying to address the short term unfairness encountered in the algorithms based on the totalitarian approach, WGPS implements in fact an egalitarian approach which might ac- tually lead to "too good a fairness".

should 14 one terminal be experiencing very bad channel (black out), WGPS would "fairly" reduce the rate of all other termi- nals leading thus to the undesirable effect of degrading com- pletely the network throughput.


The .gure also shows, for each pair, the range of delays on the available paths.

for each pair of multihomed sites, we draw a vertical bar.


8.7 Performance for a New Mobile Device How well does EZ localize a new mobile device that has never been used to generate the model?

how does the receiver gain difference among receivers, as discussed in Section 7, affect performance?


However, we .nd that two algorithms that are compatible under static conditions may not compete equitably under more dynamic conditions, even over long time-scales.

while slowly-responsive TCP-compatible algorithms are safe to deploy in that they do not mistreat TCP, it is also true that they may not always get their equitable share when network conditions change dynamically.


Nodes are moving with some mobility pattern; for our analytical study, we do not specify a particular mobility model, and we only require that the mobility pattern be random and independent, unconstrained, and stationary.

that the velocity (speed and direction) of a node is chosen randomly from some fixed distribution and independently of that of the other nodes; that a node can freely move into any location within the network (i.e., that there are no exclusion there exists one infected node (vertex), while all the remaining N1 nodes are susceptible.


In this paper, we present a novel density-driven DLS that overcomes these limitations.

our service never .oods the network, does not employ multi-hop routing nor relies on any geographical knowledge.


While heterogeneous communication systems have been considered before (e.g., in some satellite networks), our solution explores some unique opportunities that arise in vehicular systems.

we describe a system called Scout that uses a front radio at the head of a vehicle to look ahead and identify the best channel parameters to be used when the rear radio eventually reaches the forward post.


1|Si = Although a few standard inference algorithms exist, they have an exponential running time on our augmented graphs (see §2.2).

the exact junction-tree algorithm [8] typically used for inference in Bayesian networks takes exponential time.


In a similar direction, in [16], the performance of sparse Low Density Parity Check (LDPC) codes was analyzed in terms of error probability as a function of their weight.

the authors showed that for the binary symmetric channel and the parallel Z channel, the block error probability of LDPC codes could be reduced by reducing the code weight.


Specifically, in [8], a sensor network deployed over a belt region (such as international borders) is said to provide k-barrier coverage if every path that crosses the width of the belt is covered by at least k distinct sensors.

k-barrier coverage guarantees to detect any intruder crossing the belt (border) along any path by at least k sensors.


X is the same regardless of the order they were hashed in.

it is the accumulated hash of the set X.


A second test we performed was using a TCP .ow from S12 to S01, respectively the top left corner and the bottom right corner of .gure 1(a), thus, passing up to 7 hops, depending on MeshDV version used.

using MeshDV-HC, the number of hops was continuously .uctuating between 5 and 7.


The green (or light grey) areas contain a high number of subscribers.

in this scenario 25% of the vehicles are subscribers.


In this new 2003/04 study, we observed over 7,000 unique wireless cards using over 550 access points over the course of a 17-week trace period.

our study extends previous work by examining trends in behavior of a mature WLAN, and by examining geographic mobility within a large WLAN.


In contrast, H2 points to routing differences as the primary culprit behind occurrences of poorer IPv6 performance.

promoting IPv6 and IPv4 peering parity is probably the single most effective step towards equal IPv6 and IPv4 performance Categories and Subject Descriptors C.2.1 [Computer-Communication Networks]: Network Architecture and Design Distributed networks;  C.4 [Performance of Systems]: Design Studies General Terms Measurements Keywords IPv6, adoption, performance, measurements * The work of the .rst two authors was supported in part by a grant from Comcast Corp. and by NSF grant CNS1116039.


We observe that in the uplink direction, most state transitions are I.D.

for SSL, DNS, and QQ, the I.D account for 50% of state transitions.


NS-BGP ensures that a route announced to a peer or provider does not change based on the presence or absence of any non-exportable (e.g., peeror provider-learned) routes.

in this example, node 3learning(32 d) (a provider-learned route) should not affect whether node 3 exports (3 d)to node 1 (which is also a provider).


nodes that meet large number of other nodes, or nodes at the edge of the current node range.

the number of connections should be reduced dramatically by inverting the connection criteria to furthest node in the range instead of the nearest.


The work does not aim at balancing memory utilization; rather, it focuses on guaranteeing worst case performance bounds.

it focuses on leaf-pushed unibit tries using a technique called jump nodes, which limits the number of copies of a leaf-pushed node.


Based on their speci.c requirements, di.erent policies are applied to the provided mechanisms in order to ful.ll the desired goals of each .ow.

it is possible to use the same GDTP across multiple link layer con.gurations.


Therefore, a cost of each link in Mroute should be considered a monotonically increasing function of the packet arrival rate, and on the packet distribution from K[i]to J[i] in a base station, g(p(bs,K[i])) is a monotonically increases for p(bs,K[i]), g(p(bs,J[i])) is a monotonically decreases for p(bs,K[i]),and G(pbs[i]), which is the sum of g(p(bs,K[i]))and g(p(bs,J[i])), is a multioptimization function of p(bs,K[i]) (see Fig.4).

g(pbs[i]) has some local minimums for p(bs,K[i]) and the packet distribution meeting Eq.


An important additional feature of the gmcps model is that all these performance measures are insensitive with respect to the speci.cform of the .ow size distribution, depending on its mean D only.

4.2 Proportional fair radio access selection As is immediately clear from expressions (9), (11) and (12), the proportional fair ra selection schemes with either switched or parallel mrtd,the .ow-speci.c throughput function is a more complicated function of (O,) Q and the l s. it cannot be split into distinct components comprising the e ects of Q and the l s, respectively.


Indeed, in addition to their simplicity, they can be combined with name-dependent schemes that perform well for speci.c classes of graphs but poorly in general.

the uniform scheme can be combined with a scheme that is ef.cient for large classes of graphs, in order to preserve the v O( n) greedy diameter for general graphs.


These techniques exceed the capability of previous solutions.

unlike the previous attempts, the secure singlehop pairwise synchronization technique can handle high data rate such as those produced by MICAz motes (in contrast to those by MICA2 motes).


We believe solving the problem of stimulating cooperation in the task of building and maintaining the network topology is fundamental to a successful realization of the wireless multi-hop paradigm in a non-cooperative environment as this task is a necessary building block on which protocols at higher and lower layers rely.

it is quite unrealistic to assume (as, for instance, has been done in [11]) that network nodes act sel.shly in performing the routing task, while they are willing to cooperate in the task of topology control.


And even for higher values of S I Rreqd , we continue to have most of the links formed.

a large part of the topology is 2P-compatible, even with a high value for the head-room in S I Rreqd .


Overall, we found that factors at different layers can affect resource utilization in mobile web browsing, including web contents, HTTP, SSL, and even TCP.

although many mobile websites have tailored their appearances for smartphone screens, many of the adjustments are very super.cial, and the resulting sites are often poorly interacting with the cellular network.


This hierarchical well-separated tree is going to approximate the original graph metric G by a logarithmic distortion factor, in terms of the shortest path distance between any two nodes.

what we propose to extract is one a-HST, chosen by a distribution D from a family S of a-HSTs such that for each HST T in the family S, the distance dT (u, v) between any two nodes u, v in the tree T is greater than the shortest path length dG(u, v) in the original graph G, and that the expected distance between u, v, ET .S [dT (u, v)D(T )], taken over the distribution D on the family S of trees, is no greater than ß ·dG(u, v), where D(T ) is the probability of T in the family S. Such a family of HSTs is said to ß-probabilistically approximate the original metric G, with ß being the (expected) distortion factor.


characterized several aspects of packet loss behavior in [39].

that work reported measures of constancy of loss episode rate, loss episode duration, loss free period duration and overall loss rates.


Using these it forms m sketches for each of the four .ow features (SIP, DIP, SP, and DP).


4.2 Handling Classless Allocations Often overlooked in DNS proposals is handling the classless allocations.

one should not overlook an allocation such as 129.82.0/18.


We note that the crucial difference in the two executions (one unstable, and the other stable) is the order in which the route re.ectors send and receive messages.

this is an example of a transient route oscillation where the ordering of messages may cause route oscillations.


5.2 Protocol Simulator The simulator program is a discrete event simulator that simulates a single routing algorithm under a given topology and link event sequence.

it simulates n instances of the routing algorithm running in parallel, one on each node.


As a result, its contents will be the outcome of the optimization performed by Psephos, our distributed caching mechanism, as described in Section 3.3.

when a user s request is satis.ed, the website retrieved is not placed the public cache; it is stored by the user in a private storage space and viewed separately.


In [7], this problem is solved by verifying the code image on a per packet basis.

each packet pi is authenticated by the previous packet pi-1.


In contrast, the packet-rerouting technique outperforms the privacy-zone technique in protecting ud s address privacy.

assume that the adversary only compromises us.


Pre.x 00* already exists in the disjoint pre.x set, and thus this insertion only leads to a modi.cation of the corresponding NH array in the SRAM of the merged lookup path.

the NH array corresponding to pre.x 00* is changed from [A3, 0] to [A3, B7].


A similar argument applies for the relative performance of Vegas and Reno with respect to buffer size.

for a smaller buffer size, Vegas will be more aggressive relative to Reno, but for .xed a and ß, fewer Vegas sources can share the buffer and attain their target backlog.


However, several of the designs can be augmented to include sequential neighbors, especially for recovery, essentially by de.ning a separate ordering (aside from the ordering used for normal routing).

viceroy and CAN (see [18]) have incorporated sequential neighbors.


So it is straightforward to calculate M1, ..., Mn,to get thesame r value.

in order to have fair partitioning regards to r value, all partitions (in our example the three partitions) should have the same fairness parame (P miss (P miss (P miss +Pc) +P c) +P c (in our example, ter = = (P * +Pc) 2 3 3 3 ) +P c (P miss+P c ) +P c Fig.


fI of the interference power (18) is illustrated for di.erent values of >0 .

>0 is obtained from (11), with Ts/Tp =1000, pX (X =1) =0.5 and for >T ranging between 0.01 nodes/mm2 and 0.1 nodes/mm2 .


Network emulation tools are designed to allow controlled, reproducible experiments with network performance sensitive/ adaptive applications and control protocols in a simple laboratory setting.

these tools allow an inexpensive PC-based router to emulate numerous complex performance scenarios, including: packet delay, congestion and background loss, bandwidth limitation, packet reordering, and packet duplication.


If this node is receiving or transmitting in a given time slot, then we want to ensure that the radio neighborhood of this node is silenced.

if u is a receiver/transmitter in a given time slot then we would like nodes w in the neighborhood of u to not be transmitting to/receiving from u or any other node in this time slot.


However, we highlight that our eventual argument utilizes the geometric properties of the cut and hence is distinct from [15].

the claims and the proof in [15] is applicable only to routing, while our bounds apply to NC.


We hypothesized that, because large pre.xes exhibit geographic diversity, large ASes might exhibit similar geographic diversity.

aSes with high degree (according to the RouteViews table) might announce pre.xes from many diverse geographic locations.


The ab-sence of decorative features in the area makes it a reasonably good approximation of a structure being built.

the space consists of concrete floor, ceiling and pillars and metal beams to support the load of the structure.


That is, in the upper level cluster the cluster head receives streaming content from the source server and by ex- Figure 3: Queue Model of Normal Peers 3.2 Cluster head Cluster heads join two clusters.

a cluster head will be a member of two clusters concurrently.


Assume that we have detected an anomaly, and for each sketch we have determined the bin or bins which contain the o.ending IP .ows.

in sketch S1(X), we know that bin f1 contains the o.ending IP .ow, and so on.


This new scheme can generally be used in applications that exhibit an asymmetry in signing capabilities of the individual parties.

while one party (in our case HN) can generate valid signatures on its own, the second party (in our case FN) requires the other party s cooperation in order to generate a valid signature.


It focuses on protocol modeling and analysis and on traceability of the analysis process and communicating the results to the stakeholders.

protocol design and implementation fall outside the scope of our framework.


For example, doesn t statistical multiplexing, and the sudden arrival of short bursts have an e.ect?

we might expect the (very bursty) TCP slow-start phase to increase queue occupancy and frequently .ll the bu.er.


8 PROPERTIES OF 7p We now turn from the multifractal address model to the 7p metric itself.

we investigate 7p's properties as a concise characterization, or "fingerprint", of the traffic visible at a location.


datalink/network, are highly dependent from the adopted wireless technology and from runtime conditions of communication channels.

each wireless technology can be characterized by several static parameters, e.g., per-byte transmission cost, battery cost, and localization resolution.


mobility models, the slope of the exponential tail is given by g(t,N)/t =1/D2 .

the slope of the tail in a semi-log scale is inversely proportional to the area of the bounded domain (D2).


We de.ne BD(p) as the largest frequency component of D0(f ) that can be restored from Dp(f), i.e., only frequency components of d(k)with |f|= BD(p)can be reconstructed from dp(k).

if we .lter dp(k) using a low-pass .lter with bandwidth B,such as H(f) 0.445 whose cuto.


On the other hand, the geographical distribution of M2M device population, especially those with high tra.c volume, exhibits attraction to high volume smartphone devices.

the information provided by the analysis of mobility characteristics of M2M devices is mixed for network operators.


When using power control, nodes adjust their transmit power to compensate for the path loss which increases with distance.

for all pairs of communicating transmitter and receiver nodes, all the receiver nodes receive an equal amount of signal power from their corresponding desired transmitter.


Our scheduler needs to extract several pieces of information from the MAC layer.

the scheduler gets feedback from the CSMA/CA layer about each of the following that are factored into the scheduling algorithm by snooping the broadcast channel.


That is, the market staircase of bidder iequals the sum of the staircases of each link in his path: for each quantity prices are added.

qi is the largest quantity such that his marginal value is just greater than the market price, whereas pi equals his marginal valuation at qi.


For example, code that examines the content of a particular .ow rarely requires access to information about other .ows; and our example scan detector has no need for correlating counters between sources.

partitioning events by unit of processing also partitions the detector state in independent subsets.


As far as packet reordering is concerned, the extreme case scenario happens when, upon their arrival, Pi is appended to the end of F Ei s queue since it s almost full and Pj is placed at the front of F Ej s queue since it s empty.


After slots, node transmits a third pulse and wins the channel contention.

note that the tie breaking scheme stated as above can be biased to nodes with smaller ID s. if multiple nodes choose the same back-off value during the contention, the node with the smallest ID always wins the contention in tie breaking.


VNET associates every inbound and outbound IP packet with a connection structure which ensures that slices send and receive only packets associated with connections that they own.

slices can only: Send packets associated with new connections or connections that they initiated.


Every time a handoff happens, management frames are exchanged at the lowest available bit-rate between the station and the AP, and they degrade network performance by increasing network congestion for all the clients on a particular channel.

at the IETF meeting, 10% of the total wireless resources were wasted due to too many inef.ceint handoffs.


In total, 39,004 accounts were sending tweets promoting these two account markets.

we detected 22,003 victims for the English-speaking market and 17,001 victims for the Portuguese-speaking one.


In terms of passive measurement techniques, Vasudevan [16] and Lee [10] attempt to estimate the radio link quality from observing tra.c patterns.

vasudevan observed that beacon frequency changes slightly as load on the AP changes.


H2: Di.erences in routing choices between IPv6 and IPv4 are a major cause of poorer IPv6 performance.

(C) is the major culprit for poor(er) IPv6 performance.


The parameter P TX is estimated by each node based on the number of active nodes around each neighboring node j and the maximum number of simultaneous .ows allowed by j in its neighborhood.

a node estimates P TX based on its two-hop information announced through a Hello message at network layer.


The .nal step is to set up the data plane by obtaining an IP address through DHCP.

let T be the total delay during hand-o., Latency (seconds) 5 4 3 2 1 0  Figure 2: Comparison of hand-over latency for different schemes.


BLUETOOTH DATA ELEMENTS The Bluetooth is a byte-aligned protocol (almost all fields are a multiple of eight bits), which in many parts is similar to (but of course in detail different from) the ASN.1 Basic Encoding Rules [7] in its encodings.

a type field and a length field followed by the actual value is used for what Bluetooth calls "Data Elements".


Thus, the pre.x 1* with length one is equivalent to the union of 10* and 11* with length two.

the expanded pre.x will inherit the next-hop of the original pre.x.


j=1 .d,jb * d,i log2 PMAX /Ki the AP uses the maximal power to transmit.


It can be observed that at 7 meters approximately 70% of EPC errors had been correctly ACKed.

most of the times the reader was able to correctly decode the 16-bits string (RN16) but not the 128-bits ID from the same tag.


With EDCA, high priority traffic has a higher probability of being sent than low priority traffic.

a station with high priority traffic waits less, on average, than a station with low priority traffic.


Given the trace tree for a switch, the optimizer compiles the trace tree to a prioritized set of .ow rules, to form the .ow table of the switch.

there are two key challenges to compile an ef.cient .ow table for a switch.


VideoApp is a popular video streaming service (anonymized for business con.dentiality) that uses progressive HTTP streaming [7].

it uses HTTP to download a short video, which is bu.ered for a short time before playback starts.


In our previous work [27], we developeda formal modelto reason aboutthe consequencesof injecting routes across routing domains.

that model can be used to explain the permanent inter-AS forwarding loops and IP pre.x hijacks mentioned above.


Alternative interpretation of the information potential value at some node is the probability that a random walk starting from that node will hit the sink before it hits network boundary.

potentialbased routing takes into account not only the length of the shortest path to the sink, but also the robustness of that path, i.e.


according to de.nition 2, the distance from any interfering source to this node is at most (2 + d)r. all the interfering sources are contained in a disk of area AR1 = p(2 + d)2 r 2 .


Possible victims to our attack are all mobile stations that support the UTRAN and the GSM air interface simultaneously.

this is the case for most of the equipment used during the transition phase from 2G (GSM) to 3G (UMTS) technology.


Content delivery in NDN operates at the level of data chunks.

each Interest Packet requests a particular data chunk, and a matching Data Packet consists of the requested data chunk, the data chunk name, and a signature.


If the lengths of the new gaps are less than the lower bound limit la/k, the prioritizer must shift the neighboring levels to meet the limit.

denoting the new level as mth level, the prioritizer determines the least number of neighboring levels n that satis.es .


Here, it is observed that for our approach the relative number of misclassi.ed customer-to-provider edges is nearly independent of the amount of pre-knowledge.

already a small amount of correct relationships is enough to infer a high-quality classi.cation among the ASes.


, n - 1, we have: by the .rst i - 1 packets in the probing train (a1, gI , s, n)and experienced by packet pi.


For the routing table computation, the Dijkstra algorithm is applied on the network corresponding to each ID separately.

the paths within one network will not interfere with paths in another network.


From the above, it is clear that achieving provider mobility is an important next step.

it is important that mechanisms are put in place to ensure that real-time content is not compromised during hand-o.s.


Diversity helps overcome burst losses because when the vehicle is in a burst-loss phase with one BS a second BS can deliver packets to it.

most burst losses are path dependent (e.g., due to multipath fading) rather than receiver dependent.


Weaddressthoseissuesinthiswork and give an improved model.

we use ensure convergence to realistic values using nested iterations.


However, all those schemes are not abuse-free [23].

a party can get veri.able intermediate results when the signature exchange protocol is executed unsuccessfully.


(3) We empirically demonstrate the e.ectiveness of our scheme on real data set from CitySee [15].

we show that the recovery error of our scheme is only 0.1 with packet loss ratio up to 15%.


In contrast, the MPA is designed for the D-Cloud as it tries to maintain a lower stress level, obeying the geographical restrictions.

in a scenario considering geographical constraints, the MPA will work at lowering the usage of resources inside each geographical region of the D-Cloud.


using a major router vendor routing operative system image.

we simulated the migration from a .at IS-IS con.guration to a hierarchical OSPF.


Finally, we utilize the fairness reference model to explore fairnessconstrained system capacity.

previous studies such as [15] consider network capacity without fairness constraints, which can result in signi.cant unfairness were a protocol to realize such a capacity: for example, in certain scenarios a capacity-maximizing strategy would give all bandwidth to one-hop .ows and starve multihop .ows.


However, the duration of ............. would vary each round and .

we introduce the notion of .. .. is impacted by all matching algorithm developed by H. Kuhn commonly referred to as the Hungarian method [8].


The car rental agency acts as relying party R in a selective attribute disclosure transaction with A. Conversely to how such a transaction is carried out today, where R would require A to release personal data such as her name, address, or driver s license number, the rental agency will only request the attributes that are strictly necessary for renting a car.

it will require a proof that A has a valid driver s license to drive the car she wants to rent as well as information that allows R to bill A.


Figure 3: How the Dk matrix is updated 3.2 Connected and Feasible states Considering the availability of routing standby features in network routers, it is necessary to introduce modi.cations to network management.

during low tra.c hours, it is needed to modify network paths so that routers in routing standby nodes do not execute IP processing functionalities.


However, we also assume that the attacker does not have unobstructed access to the network core.

our model allows for the attacker to take over an arbitrary (but .nite) number of hosts, but only a small number of routers.


In Fig.s 4 and 5 we compare the performance of the considered authenticationschemewith respecttotheinformationtheoretic bound computed in Section 3.3.

we plot the PMD in terms of the number of pilot tones N for M/s2 =15and20dB, respectively, and considering P .8, d/.c =20anddi.erent values of PFA.


The most recent work SEBA [7] can only provide 0/1 authentication result with probabilistic guarantees for a batch of tags.

it only tells whether there exist counterfeits in veri.ed tags, no further information.


More precisely, a protocol that does not produce any outputs is at least as secure as any other protocol.

reactive simulatability does not enforce liveness.


Path Change : A routing event is classi.ed as a path change if its pstart pend.


While we argue that the full 6LoWPAN extracts too heavy a memory and code overhead for our wireless sensors, our proposal still adopts key features of the 6LoWPAN architecture.

we propose to use 6LoWPAN, or a similar network, to create the backbone mesh between routers.


Since improvements in spectral efficiency per link is approaching theoretical limits with 3G and LTE, the next generation of technology is about improving spectral efficiency per unit area.

lTE-Advanced needs to provide a uniform user experience to users anywhere inside a cell by changing the topology of traditional networks.


This work will therefore define optimal routing as that which satisfies a primary requirement for energy depletion to be minimized so that network lifetime is maximized.

because transceivers consume a relatively large amount of energy, the primary criterion to define optimal routing will be to minimize the time spent transmitting and receiving.


WedonotproposethatMOSAICinits currentformcanserve as a plug and play replacement for existing network infrastructures.

our work provides an execution framework, we leave as future work the challenges of automatic composition, including overlay network feature interactions.


Depending on the requirements of the system, the network administrator can potentially choose a particular point in the solution space.

we investigate two points in the solution space: 1.


Pro.tability: The platform should not incur a de.cit.

the value brought by the winners should be at least as large as the total payment paid to the winners.


Therefore, the above bounds simplify to: dmin -2 = OCSP(G)= dmin -1 if dmin = d(G * );  dmin -1 = OCSP(G)= dmin if dmin < d(G * ).

if d(G* ) = 1 (i.e., there is a cut-vertex in G * ), then OCSP(G)= 0, i.e., even single-node failures cannot always be localized.


Installing a new link along P1 will have the same effect of flipping paths for AZ traffic as that in Figure 2 for Example 1.

during the soakin period, A is forced to switch to the lower path via P2 and T1 to Z.


First, some packets can be lost due to the forwarding algorithm of the routing protocol.

when the current forwarding node does not .nd a proper next hop to forward the packet, it may drop the packet or store it temporary in the local bu.er, depending on the particular algorithm.


There is the need to stimulate the development of locally designed, mobile based solutions to African opportunities by supporting local technology entrepreneurs (both for profit and not for profit) .

our evidence is an expanded approach, with the objective of maximizing the potentials of mobile phones.


Our system currently assumes that the environment remains consistent from training to localization.

we assume that people are minimally present when we attempt to localize.


Principally, such a morphological thinning based method, attempting to realize Blum s grass.re model [3], is very sensitive to the distance metric and typically fails to accurately localize medial surface points [4], and it is also sensitive to boundary noise.

a small change in boundary surface may result in a considerable change in the surface skeleton.


Related to the partition sizing problem is the development of some predictive capability.

it wouldbeextremely helpful if previous historical data could be used to predict future data rates.


When a node receives this token, it knows the transmit times of all the internal nodes visited so far.

it knows the transmit times of the nodes which could interfere with its own transmission.


In Section 4 we .rst introduce the new concept of roaming with key splitting and then focus on its application to WLAN.

we introduce a new method for distributed DSS signatures in Section 4.2.3.


In fact, the update traffic per hour is N/)~.

there is a tradeoff between the probability of error in geocast group memberships, and the signaling load on the network.


Even though BCH decoding can be employed to .nd a high degree polynomial among samples, no known algorithm can e.ciently identify multiple polynomials among samples.

its path reconstruction does not scale with multiple attack paths.


However, in a mobile environment, the set A must be updated as the distribution of the nodes evolves within the network.

the cardinality of the sets A and CA(w), .w .


= 0, there are O(log n) di.erent blocking links egh for which dih is in the range Therefore, we can apply the bound given in Lemma 4.3.

at most C log n receivers of links in B. can be ij located in any ring between the radii speci.ed in (2).


The concept is further analysed in [25].

the authors focus on the capabilities of the VTS to reduce tailpipe emissions.


Some additional interesting results for the applied gmcps model have been derived (see [8]).

the conditional expected transfer time Tn ({) of a class n .ow of given size { D 0can be computed explicitly and grows linearly in {,i.e.


We argue that this insight can be broadly applied to protocols in general.

environmental information can be used by protocols to: (1) choose better initial operating parameters and (2) tune their behavior to better handle the amount of packet loss or delay at any point in time.


Note that, this .ow is already feasible.

the maximum interference is 1 and the .ow scaling step in 7 has no e.ect.


Assuming that the payload size is .xed, let Nt be the maximum number of possible aggregated subframes for a given aggregation time bound To.


The PROMETHEE method is based on pairwise comparisons of the alternatives.

it considers the difference between the evaluation of two alternatives over each criterion.


Such a constraint does not exist in conventional cellular networks.

it is clear that a node must be encouraged in some way to relay information for the bene.t of other nodes.


As mentioned in Section 1, overlay routing is different from routing directly on the physical network.

the physical route for an overlay link is dictated by network-level routing and may involve multiple physical links.


Table 1 lists the default settings used for our Gnutella implementation.

taking into account the small size of ad hoc networks with respect to real Gnutella overlays, we sized the connection lower and upper bounds respectively to 4 and 8.


Placement af.nity: NIDS/NIPS are not monolithic systems: they consist of modules that analyzedifferenttraf.c patterns.

the modules may have topo   logical constraints on where they will be most effective.


For an endpoint r and a node S that queries the oracle, this oracle can answer questions about membership of endpoint r up to a speci.c time t. t is the latest time that satis.es d (t S)p+t :t0 where t0 is the current time and d (t S)is the minimum delay from endpoint r to node S starting at time t5 .

if endpoint r joins or leaves a group at or before time t and sends this information to other nodes by .ooding, assuming no contending traf.c in the network, node S should have received this information by the time of querying the oracle.


The algorithm computes the distribution function and the moments of the delay seen by the video packets.

the expected value of the queueing delay W is given by [ E[W ]= 1 2.+ µ(2)p. 2(1 - .)


However, relatively, overall energy is balanced.

node 23 shows that its energy is balanced with its neighbor nodes.


Here, xf (t) is the assigned rate of the connection.

this is the rate which the system will try to enforce on f. The actual rate used by the connection, denoted by x f (t), will be different and typically it will be smaller.


To reduce the time for establishing the tunnel between MAGs in the vehicular networks based on PMIPv6, each MAG along the road, pre-con.gures the tunnel with its neighboring MAGs and then the tunnel will be activated when a new MN arrives.

the proposed enhanced fast handover scheme relies on the fact that the MN s direction is limited by the roads in the vehicular networks, so that highly accurate predictions can be made about which MAG the MN is going to hand over.


INSUFFICIENCY OF EXTANT ROUTING FRAMEWORKS In this section, we discuss why extant routing frameworks are insu.cient to support inter-domain routing in MANETs.

we explain why a BGP-like protocol is inapplicable in the ad hoc environment, and what in extant ad hoc routing frameworks are missing to support interoperation among multiple MANET domains.


[7, 8] have done such a large-scale network analysis of one to one human communications using phone data.

they observed the coupling between the tie strengths and the local network structure of users.


In the following, the notation bp(i, j) refers to the probability to have a router having a degree of i and j L2 neighbors (0 <j = i).

bp(i, j) corresponds to the probability distribution function given in Fig.


Finally, a capacity injection tier distributes capacity across the network.

a single AP is connected to a 100 Mbps .ber gateway, whose capacity is further distributed through directional links to 3 APs.


This t-reliable protocol executes (in parallel) the (To, T1)-reliable protocol for every pair of sets of size t, and the receiver learns the message that was sent from the sender by analyzing the results of these executions.

if t is constant and the (To, T1)- reliable protocol is efficient for every To, T1 of size at most t, then the resulting t-reliable protocol is efficient.


Let Ci(t) be the post-calibration sensor reading.

ci(t) is the sensor reading after driftcompensation and sensor fusion.


Thus, we argue that directly comparing the .nal p(k) with the PMF obtained by simulations p s(k) is not meaningful enough.

it is not possible with such a comparison, as done in [13] to know whether the errors between the simulated and analytical PMF come from an inaccurate model or originate from the inversion of D(Z).


A 10 Gb/s link dequeues packets every 1.2 µs, which stretches the limits of today s hardware timers.

we found that the best timer resolution offered by Linux s High Resolution Timer (hrtimer) subsystem was about 1.8 µs, whose limits depend on the frequency of the hardware clock, and its interrupt and programming overheads.


Let us consider how we would implement Multi-rate for a wireless system using these three phase-based modulation schemes.

we want to emulate the behavior of all of the three different modulation schemes within a single data packet, without actually changing the MAC and PHY implementation.


2.2 Deducibility algorithms Thesearealgorithmsfordeterminingwhetheranintruder can deduceatermfroma setoftermsalreadyinits possession,giventhat termsobeyagivenequationaltheory.Inthis case, onestartswitha set T ofterms knowntotheintruder, aterm t theintruderistrying tolearn,asetofinferencerules describing operationstheintruder can perform, and an equational theory E.Thededucibility algorithm is a procedure for determining whether or not the intruder can derive a term from s from T such that s =E t.Anumber of algorithmshave beendevelopedfordifferentclassesof equational theories,including associative-commutative and homomorphic operators[1].Asurveyofdeducibility withrespecttoequationaltheories may befoundin[12].

algorithmsforaclassof theories known as subterm convergent(convergenttheoriesforwhichtheright-handside isaeither anirreduciblegroundterm or subtermof theleft-hand side)havebeen developedin[15] andforalarger classof convergenttheoriesthatinclude encryption homomorphicoverafree operator[8] andhave beendevelopedandimplementedinthetools KISS and YAPA, respectively.


Report Generator to produce an account of di.erences across several runs of the same control program and network tra.c scenario.

it highlights changes in network topology, di.erences in rules and actions across network switches, and performance variations, and displays these di.erences to developer in a meaningful way.


(2) i N(u, i) 0.7 Modeling the transitions within a cluster amounts to try ing to isolate the salient features of how transition probabil ities are distributed for intra-cluster moves.

an interesting question is whether all transitions are roughly equally likely, which would be the case for a random walk model, or whether there exists some other law governing this Cumulative distribution 0.6 0.5 0.4 process.


To decouple TE functions, the programmer needs to create a separate dictionary for Route, and send aggregated events from Collect to notify Route about .ow stat updates.

collect sends updates to Route when the .ow s bandwidth consumption passes a threshold.


Opportunistic Real-Time Routing in Multi-Hop Wireless Sensor Networks Junwhan Kim ECE Dept., Virginia Tech Blacksburg, VA, 24060, USA  junwhan@vt.edu ABSTRACT Wireless sensor networks (WSNs) are subject to signi.cant resource constraints.

routing protocols for lowrate WSNs su.er from maintaining routing metrics and stable links of paths.


If the log Li is a sequence (..., op1,change1,change2,change3,op2, ...), the log Li can be changed with (..., op1,change3,op2, ...) since change is an overwriting operation.

a delete operation of a subobject r compensates an add operation of the subobject r. the state obtained by performing add and then delete on a state s of a replica oi is the same as the previous states on which add is performed.


SS | Cn > 0 and x(C) < xNE(R)}, such that sn(C) = k k -1 Pr[wn = ws | state(p ) = C] .

sn(C) is the probability of station n's tentative switch to ws in timeframe k conditional on the current game state.


mesh with unicast) offer more gain from reducing overhead, reducing load or increasing radio rate.

load balancing can signi.cantly amplify the impact of routing protocol ef.ciency gains.


(n) when we partition the network and implement a localized scheduling algorithm in each partition, we will prove .l(n)= T(.g(n)) (6) is possible if we partition the network and design the localized scheduling algorithms appropriately.

given .g(n)=T(f(n)), we will demonstrate the way to achieve .l(n)= T(f(n)), regardless of the function f(n) that depends on the particular assumptions on the interference, location and communication models.


Since theWiMAX frame is .xed, it behaves non-work-conservingly.

if there are slots that are not allocated to any connection, then some bandwidth resources will be wasted.


In this work, we examine two closely related problems on information propagation in predicable DTN.

we assume that during a certain time period, the interacting process among nodes is known a priori or can be predicted.


The purpose of self-recharging currency is to eliminate reliance on fragile mechanisms to recycle currency through the economy.

it is not necessary for each consumer to contribute in proportion to its usage, although a global policy could punish free riders by draining their credit budgets if desired.


Now, it may not always be possible to ensure complete coverage for some deployment scenarios.

for a particular combination of forward-reverse paths, and a given constraint on the maximum allowable link load, we may not have a feasible solution to ensure that each covc =1.3 In this case, we want to minimize detection misses and thus, we introduce a new term in the minimization objective to model the fraction of traf.c that suffers detection misses because we cannot monitor both sides of the connection.


C2, u is a successor of v), then the values of the states in C2 are dependent on those in C1 (but not vice versa).

components C1 and C2 can be calculated separately in a reverse topological order.


We will illustrate some examples of applications in Section 4.

it can accommodate per-packet delay constraints and rate adaptation.


Our demonstrator will also provide a customized tool for monitoring the performance of MAC program executions.

we will show the capability to guarantee a precise scheduling of the medium access times and standard interframe spaces by post-processing a channel observation trace in terms of busy/idle times.


We found that both the sending patterns of the identi.ed botnet hosts and other hosts are well spread in the space.

when viewed individually, botnet hosts do not exhibit distinct sending patterns for them to be identi.ed.


To ful.ll these requirements, each message should be encrypted between the sender and the receiver using wellestablished cryptographic techniques.

the location update procedure of the routing scheme has to be secured to prevent attackers to send false location updates and redirect all messages of a given users to themselves.


If Qk .= -1, let Mk denote the minimum length of critical k-barrier covered zones.

mk = min{SZ : Z is a critical k-barrier covered zone}.


If considerable degradation is observed via the measurement, it is desired to investigate the internal status of the customer s AP since unexpected users may be parasitic on the AP or a lot of packets may be dropped due to a poor channel status.

the statistics based on the exact measurement could help KT invest restricted resources in a costeffective way.


CONCLUSIONS In this paper we have investigated the node spatial distribution generated by a wireless ad hoc network whose nodes move for a large number of steps.

we have tested whether this distribution can be approximated by the uniform distribution or not.


These de.nitions coincide with previous property-based de.nitions in some cases, and are different in other cases.In particular,theanalysisoftheAtEparadigmleadstoageneral formalization of the malleability of con.dential channels and encryption schemes, and the previous notions of non-malleability appear as special instances of the proposed formalization.

the AtE-transformation is sound for all encryption schemes with suitably restricted malleability.


First, data fusion is very e.ective in improving sensing coverage and reducing network density.

theorem 2 suggests that the performance gain of data fusion increases when the PSNR is lower.


Several multicast schemes have been proposed on top of p2p overlay networks.

scribe [6] and Bayeux [29] are built on top of two similar p2p substrates, Pastry [22] and Tapestry [28].


The second binding (between the name and key) can be established using an external authority such as a Certi.cate Authority (CA).

in our example above, the string CNN in the name would be suf.cient for the user to determine that the RWI associated with the name is CNN, and a CA will verify that a key belongs to the name containing CNN.


It is worth remarking that one of our goals was to carry out diagnosis in a non-intrusive way.

we did not want to allocate new real SIP call towards the caller or the callee, because they would be annoying and could be easily classi.ed as SPIT.


A natural question that arises is whether this uneven workload distribution is correlated with, and hence explained by, the arrival time of spammers joining a spam campaign.

do spammers that join a campaign earlier than others send more spam for a given campaign, potentially due to their con.rmed ability to deliver spam?


Another approach to QoS routing is to exploit the dependencies between the QoS parameters and solve the path selection problem assum- ing specific scheduling schemes at network touters [26, 29].

if Weighted Fair Queueing (WFQ) scheduling is being used and the constraints are bandwidth, queueing delay, jitter, and loss, then the problem can be reduced to a standard shortest path problem by representing all the con- stralnts in terms of bandwidth.


In IPNL, the IPNL header is the end-to-end addressing header, and the IPv4 header is delegated the role of an encapsulating link header.

at every nl-router hop, the IPv4 header of the incoming packet is stripped away, and a new IPv4 header is attached to the outgoing packet.


We can reduce thefalse negative rates showninTable1by assigning ahighercosttofalse negativesthanfalsepositives through Asymmetric Boosting [5].

we show results when the cost of a false negative is twice that of a false positive3 .


In Figure 3, we see that most devices in normal operation do not send ARP request broadcasts in bursts.

it is not normal for a device to broadcast a substantially larger number of requests over a short period than on average.


The hybrid delivery of multimedia streams as defined in the previous section follows the same approach butwith new requirements.

the bootstrapping information should enable the player to locate multiple resourcesfrom different networks using different location schemes.


For a node j to be a jammer a node which can con.ict with the transmission but cannot be heard Sj > Si -T and Sj < Ni-1 +T , where Ni-1 is the hardware noise at mi-1.

its signal strength must be within T of mi s received signal strength at mi-1 to con.ict and also be within T of the noise .oor such that it can never be heard.


This hidden variable accounts for unobserved and unobservable context variables which influence future network availability.

For predicting network availability, we propose a generic and novel Dynamic Bayesian Network (DBN) based context prediction model, which is different to any that has been proposed.


This is because in ALS, sink agents establish the anchor system in a fully distributed and asynchronous manner.

every sink agent recruits di.erent set of grid nodes as anchors when it enters the sensor network.


Because this disk D can be covered by smaller disks of radius dij in such a way that every point in the plane is covered by at most two small disks, it follows that 2p(c1 +2)2d2 B = pd2 |ij |= C log n · ij =2(c1 +2)2C log n. ij Bounding the cardinality of B> is signi.cantly more in ij volved.

we need to distinguish three kinds of blocking links in B> depending on which line of the ij , check(eij, Lt) subroutine caused the returning of false.


Unfortunately, the result was consistent with our .ndings above and in Figures 15a and 15b.

we found that MGRP could not report valid results when it was used in high-speed networks (10Gbps Ethernet).


This enables the protocol to save a large fraction of communication cost.

when the user roams to a foreign domain far from his home network, the saving on communication cost with our protocol is much signi.cant since it requires only local communication.


As a consequence, the QoSManager requests the QoSPolicyHolder service to provide admission policy for that traf.c stream by calling the GetTraf.cPolicy action.

this action will return a UserImportanceNumber parameter used to determine the stream s relative priority as accommodated by the user.


This paper addresses the problem of anonymity in mobile opportunistic routing schemes and argues that using only social network or label similarity for forwarding can be damaging for maintaining sender s anonymity due to routing protocols repeatedly using similar nodes for forwarding and anonymising their messages.

we propose to Ivan Vaghi EarlyMorning 20127 Milano, Italy ivan@earlymorning.com design a new adaptive anonymisation overlay in mobile opportunistic networks that aims to maximise the quality of anonymisation while maintaining high success ratios of answered queries and low delays.


Our major contributions are a suite of novel techniques for the network owner to verify query-result completeness (§ 4).

our .rst construction is a deterministic approach that is an extension of the technique in [4] to multidimensional cases (§ 4.1).


ij Note that (28) is true for any trajectory Bof node B.


Within a node, a common solution to prioritize traf.c is buffer scheduling [21].

a node will empty its HP buffers before sending any LP data.


The .rst four measurements are used in these evaluations to form the channel history, while the .fth is used as a test measurement.

n = 5 and the history is composed of measurements n =1,..., 4.


Every link-layer packet contains a grant duration .eld, which grants the channel around the transmitter to the receiver of the packet.

upon overhearing or transmitting a packet, nodes can only transmit after the grant duration has expired, and only the receiver of the packet can transmit immediately.


The duration for the vehicle to maintain its current centripetal acceleration t (Ti)= Ti+1 - Ti follows exponential distribution as motivated by its memoryless property [18].

the probability density function of t (Ti)is f(t (Ti)) = .e-.t(Ti),  where .


For these middleboxes, we cannot directly match the payloads of individual packets because one .ow into a middlebox can be mapped to multiple .ows going out of the middlebox, and vice versa.

we do not have a bijection between Incoming and Outgoing any more.


Idealized MPR: As a special case of the MPR-kmodel, we study the idealized MPR model, where k= n- 1.

an arbitrary number of packets are decodable simultaneously at a receiver.


An interesting observation arises from the comparison of Figures 1and 3.

under the presence of interference (Figure 3), even at higher RSSI values compared to the interference-free settings (Figure 1), the PDR achieved is much lower.


Figure 4 shows the application access probability as a function of discrete mobility spans.

we explore groups of users that have been seen at that particular numberoflocationsduringthesevendayperiod.


TVA has the following key features: TVA is backwards-e.cient with 802.15.4 (see section 8.4).

this means that energy will not be wasted sending extra redundancy or special packets unless the receiver can utilize them.


R If {X1, ··· , XR}are identically distributed and mutually independent from each other, we have Pfn(k)= P[X1 > k].

(6) thefalse negative ratio is equal to the CCDF of X1.


A FairCast .ow should then, in a similar manner, increase its threshold to be more tolerant to loss.

here follows the algorithm: min{thrr(t)+ a, 1}, if .c(t) > .r(t) thrr(t + 1)= (17) max{thrr(t) -b, 0}, otherwise where a and b are .xed parameters we will shortly investigate, .c(t) the highest of the lambdas received from competing nodes at .ow r and .r(t) the lambda computed by .ow r. if nobody complains, .ow r keeps tightening up its threshold.


It is worth noting that, although the algorithm has been shown to perform well in a variety of scenarios, it has recently been found that it does not completely eliminate free-riding [16, 17, 23].

a peer may improve its download rates by downloading from seeds, acquiring a large view of the peers in the torrent, or bene.ting from many optimistic unchokes.


Interestingly, the separation between successive CDFs decreases as the number of humans increases.

the separation is larger between the CDFs of no humans and one human, than between the CDFs of one human and two humans.


In this section, we try to derive the optimal values of ri for which the expected overhead is minimum.

given a desired end-to-end reliability r, what should the desired reliability at each hop be in order to minimize the total overhead?


It is known that in the continuous case the medial axis is sensitive to noises on boundaries [3].

a small bump on the boundary can incur a long branch in the medial axis.


ix :NC-ri<x T xr=NC i=1 ' Note that P' (N)and B(N)are the respective unnormalized i versions of P(N) and Bi(N).

it follows from Lemma 1 that: M ' N .iB(N) i P ' (N)= .


In this technique signal prints are interpreted as relative signal prints according to the best signal received therein.

when you assemble the signal print of a mobile station, it is rewritten so that each value represents the difference between it and the best signal obtained therein.


Since we focus, in this work, on pure VoIP scenarios, we make the following simpli.cations: i) the various delay measures collapse into a single one, the mouth-to-ear delay, and, ii) the default values proposed in [4] are used for all parameters in the expression of Idother than the delay itself.

the in.uence of echo is supposed negligible.


5.2 Decomposition of the traf.c load series 0.2 0 -0.2 0.2 0 -0.2 -0.4 A bene.t of the above eigenload-based categorization is -0.4 that it results in a decomposition of any given tra.c load 0.4 0.4 series (normalized or not) into its principal features.

we can reconstruct each time-series in terms of two con stituents: the contributions made by the deterministic and the noisy eigenloads.


returns a typing environment G '' such that the formulas in G '' entail C and the variables yl+1,... ,ym, corresponding to the public messages that are returned by the veri.cation destructor, have types Tl+1,... ,Tm in G '' .

g '' proves that the zero-knowledge proof has the stronger type ZKProofn,m,S ((y1 : T1,... ,ym : Tm){.x1,... ,xn.C}) speci.ed by the user.


Even when there are no obstacles in obtaining non-access, i.e., core-level traces, problems still remain.

accurately classifying traf.c in an online fashion at high speeds is an inherently hard problem.


As already mentioned, the simulation is based on the UDelModels tools [13, 24] for the computation of the nodes mobility and propagation.

uDelModels is used to generate realistic node trajectories and to compute the communication channel loss between any two radio stations in the three-dimensional urban scenario with the granularity of 1 s. The UDelModels results are used as input by our ad-hoc simulator whose major functionalities are: to simulate the radio contacts among the nodes as far as the channel loss is below a threshold a;  to implement the management of the bu.er B;  to simulate the exchange of collected items among the nodes in radio contact;  to simulate the mobility and radio propagation of R nodes, that are not available in UDelModels; the direction of the trajectory of the R nodes is updated randomly every second and their speed is drawn according to a uniform distribution;   Figure 1: A zoom of the simulated urban area: nodes ROI are depicted as squares.


This is because in a squarer network, paths tend to cross each other more than in a rectangular network, which increases x 10 MANETs.

0.8 we see that performing congestion-aware 0.6 routing can improve some metrics in a MANET, but it re 0.4 mains to be seen about how we can incorporate our insights 0.2 into the routing protocol design for improving MANET rout- Pkts.


Hence, location traces should also be altered spatially.

the spatial and temporal correlation between successive locations of mobile nodes must be carefully eliminated to prevent external parties from compromising their location privacy.


In this .ltered set, 48 % of users are .ne-grained users, i.e., reporting only .ne-grained geotags, 21% are coarse-grained users, i.e., reporting only coarse-grained geolocation, and 31% are hybridgrained users.

about 79% of users report at least some highly accurate geo-coordinates.


We build the framework of the standard IEEE 802.11n.

we put all the preambles needed for synchronization and channel estimation.


The evaluation of the GUIDE prototype by field trial was subject to a number of constraints.

we felt acutely aware that we would be impinging on the leisure time of tourists.


Bavailable(K) is a good example to show XLEngine s components cooperations.

it is evaluated by LocalCLE and is given by relation (1): Bavailable(K)= ChCap - Bself (K) - BN (K) - BCSN (K)(1) ChCap is the overall channel bandwidth read from CLIC.


When the views are not truly random, there is a possibility that while most nodes receive all messages, a small number of nodes do not receive messages at all or receive only a small fraction of all messages.

if there are some nodes (e.g., low degree nodes) that are not uniformly distributed among other nodes views, those nodes will be constantly denied messages and thus suffer from probabilistic starvation.


We assume that each static sensor can cover a disk with radius r = v1p centered at it.

every sensor can cover a disk with unit area.


We examine the cases where the trajectory is a line (we call the mobility function Mline) or a circle (Mcircle ) that is fully contained in the network area.

the tra jectory is characterized by its length l. the linear trajectory consists of a horizontal or vertical line segment passing through the center of the network.


The initial Haggle project analysis focused on the distribution of node inter-encounter times.

given an encounter between a particular pair of nodes, how long before they come into contact again?


the MN receives 4 TCP messages through MAG 1 whereas remaining TCP messages are received through MAG 2.


delay( d¯acc(j)) of a link l for a tra.c class j, takes into account the success rate, number of contending nodes and their tra.c loads, and tra.c priority.

it measures the duration of time that includes the time that the medium is detected busy (because of successful or unsuccessful transmissions from contending nodes), the time for unsuccessful transmission or collided transmission and the random backo.


This relation can be used to infer the existence of subnets among a number of IP addresses in the collected set of path traces.

we can form candidate subnets where some set of IP addresses can be grouped into a subnet address range under an address pre.x of length /x.


In this paper, we shall study the minimum frame length scheduling problem for OFDMA systems.

we shall investigate the problem in case of only one class of non-real time tra.c.


Using route re.ectors reduces the memory and connection overhead on the routers, at the expense of compromising the behavior of the underlying network.

a route re.ector does not necessarily select  Figure 1: Routing Control Platform (RCP) in an AS the same BGP route that its clients would have chosen in a full-mesh con.guration.


We found that cellular IP addresses are very dynamic.

in the social network dataset examined, 67.1% of the cellular sessions used an IP address that was previously used by another user or device.


(using (3)) (13) 2D2 The theorem suggests that there is a minimum investment Similarly, but using (12) instead of (11), we arrive at: that is required in order for the infrastructure to have an P [] 1+ E 1-d bi > n D1 <a exp[-e.ect on the performance of the network.

if there are n wireless nodes, more than n 1 2 access points are f(E) 1-d ].


Fig.3 shows that unslotted CSMA with all sensing(i.e., m = M = 12) has better performance than that of other two schemes.

the throughput of SUs in all sensing is much larger than that in random sensing.


The analysis is aimed at identifying the factors that need be considered when designing an IEEE 802.16 based WMN.

the following network and system configuration parameters are considered: frame duration and XmtHoldoffExponent (Section 3.2), network size (Section 3.3), and two-hop neighborhood size (Section 3.4).


While the models in [11, 12] seem to be reasonable for analyzing the performance of low-vehicle-density DTNs like the UMass DieselNet [7], they are unlikely to be applicable for commercial Drive-thru Internet systems to be deployed in a densely-populated urban city like New York City.

with the high-density of vehicles (which are often packed with one or more bandwidth-hungry wireless users or applications), any performance model for the corresponding Drive-thru Internet systems must address the issues of (a) potential resource contention amongst multiple vehicles concurrently covered by an AP and (b) the dynamic changes in the membership of the group of vehicles being served by an AP due to vehicular movement.


low17 medium of IXP members, but does not distinguish them in terms of high size or type.

there are several reasons why one and the same AS can show up in the membership list at a number of di.erent IXPs; e.g., increased resilience, con nectivity with a particular member, connectivity in a par ticular location served by the IXP.


Andfurthermore, we takeinto considerations more sophisticated scheduling schemes.

we studytheprioritized scheduling scheme where relaydestination transmission is given higher priority than source-relay Notation Description N number of nodes ß pair-wise inter-meeting rate B number of packets that can be exchanged during a contact .


We .rst considered a case in which a given total amount of service capacity (300 Mbps in our experiments) is split equally among multiple paths.

we compare the performance achieved by a single path with 300 Mbps bandwidth, by two parallel paths with 150 Mbps each, by three parallel paths with 100 Mbps each, etc.


The key idea is to speed-up the classi.cation of endpoints coming from the same web sites/domains under the assumption that URLs from the same domain contain similar content.

we implement the website cache as a hashtable indexed by the domain part of the URL.


The persistent homology of the encounter complex should approximate that of a sphere.


In fact, in order to take full advantage of the control plane .exibility provided by OpenFlow, the forwarding plane must be designed with an equivalent level of .exibility.

we need to extend the SDN concept also to the lower network layers, generalizing the recent advances in softwarede.ned radio [12], programmable wireless devices [13] and software-de.ned photonics [14] to a cross-layer and holistic scenario.


The content provider can serve for other content consumers normally (at least serve another 32000 Interests per time slot).


The second one is that the process stays at the same state R. In the first case, the sender has to find the data rate of the next retransmission that maximizes the throughput.

it retransmits the multicast packet at the best transmission rate exclusively chosen to optimize EMTH of its next-hop receivers that have not yet received the multicast packet.


Generally, the set of (d +1)K-graphs is a subset of dK-graphs.

larger values of d further constrain the number of possible graphs.


Finally, in our current design, we only seek responses from one-hop neighbors.

there is no relaying of requests or responses.


For the second set of experiments .rst we adapt OpenFlow to support TagFlow features and showed such a support is light in terms of overhead and then adde user-de.ned actions to the system.

to be comparable with related work, for both sets of experiments we implemented two security actions borrowed from FRESCO [16].


In addition, parallelizing our approach for large-scale computation is straightforward.

we devise a multi-step approach to discover correlated domain groups for each anchor domain.


In [5], .rst, we employed multi-homing architecture to prevent degradation of communication quality due to handover processes.

as an MN with two WLAN interfaces (a multi-homing MN) can connect with two APs before starting handover, an MN never experiences degradation due to handover processes.


Every time node I forwards a packet, neighbors of I observe this and increase their reputation value for I by µ.

rX (I) = RX (I) + µ, X n N(I) Suppose that node J is a sel.sh node that drops the packet from the previous node I on a route as shown in Figure 1.


3.2 2P Operation on a Single Link With these above two modi.cations, SynOp is feasible.

synRx and SynTx are individually feasible.


In the attempt to turn o. a radio, we must clearly control the e.ect of moving .ow away from some links on the total utilization of the collision domains of other links.

we require that the total utilization of all the collision domains be less than the threshold .0, except for the collision domain having a total utilization above .0 before solving the LP, for which the total utilization must not increase above the current value.


Leveraging the data from these users, we report our .ndings from 107 cellular carriers around the world.

we studied the policies of two large nation-wide U.S. carriers in more depth and corroborated our .ndings carefully with controlled experiments.


We call the pro.les generated using such phase o.sets RONS channels.

3If the redundancy pro.le of the block that RONS is deployed is odd and periodic, then f = p is equivalent to the signal that a correlated jammer will transmit once the victim transmission is present.


Our experimental results show that the considered algorithms allow to recognize the position of the user arm with an accuracy of a few centimeters, which is desirable in applications where different arm positions may be spatially close.

we describe a practical prototypical implementation of a wireless motion capture system based on the use of the SunSPOT technology [1].


In order to relieve the user from a tedious device discovery and configuration process, we propose an out-of-band signaling mechanism, based on Near Field Communication (NFC) connectivity, for enhancing IUT operations.

we specify the utilization of an intuitive NFC touch interface for (a) user and device discovery and (b) negotiation of media stream properties (e.g.


Even with IOS 12, we have ob- served that LSAs originated by a single router are clumped together.

summary and external LSAs origi- nated by some routers tend to be refreshed in big bursts.


We demonstrate with examples that, contrary to common belief, devices implementing the same IEEE 802.11b/g standard often have differing MAC level behavior.

we demonstrate that in certain cases, devices may not be conformant with the standard (e.g., due to incorrect implementations), where as, in other cases, they may differ in details that are not a part of mandatory specifications of the 802.11 standard.


The issue occurs when certain background data traf.c is running in some voice call scenarios.

it happens when the voice call fails to be established (for OP-I), or no matter if the call is established (for OP-II).


In this case, the brute-force approach will have another problem.

the MTs does not know how to choose the right set of credentials since it does not know with whom it is try to authenticate with.


First, we must maximize the throughput subject to stability.

we must design a stable transmission policy that maximizes the throughput among all the stable policies.


As a result, in NCR-DSA, SUs and PUs make friends with each other via NC to create a unique win-win situation for both.

nCR-DSA o.ers incentive to PUs (for embracing DSA and allowing spectrum access by SUs) through increased throughput and reduced delay of PU tra.c.


For practical applications in tra.c monitoring, we require that the relative error be low (say less than 23%), so that the accuracy of applications such as anomaly detection and tra.c clustering is not a.ected.

an accurate estimate of S may not necessarily give an accurate estimate of H.when H is very small and S is close to its maximum value, a small relative error estimate of S may not correspond to a small relative error estimation of H.Let S be the estimated value of S and H the estimated value of H computed from S, i.e., H = log (m) - Suppose we have an algorithm to compute S/m.


Second, the source explicitly requests a SNACK packet by sending an EOF.

the sink does not send a SNACK packet on its own.


One-club peer: A one-club peer is a peer that has all pieces except piece one.

the one-club is the group of peers of type {2,3,...K}.


There are a number of disadvantages with using GPS.

the acqui- sition of GPS location information incurs a high delay, and GPS does not work in indoor environments or cities.


In this section, we present two modes for ALPHA that allow better adaptation to the bandwidth, memory, and computational resources of a multi-hop network.

we evaluate the use of these modes for end-to-end and hop-by-hop authentication.


MessageLength do 7 eCount[j ]=sum(Et[startPos +(j - 1) * bitPeriod, startPos + j * bitPeriod]) 8 foreach rotatedInstance in rotatedMesgVec do 9 currentDist = 0; 10 foreach ith bit in rotatedInstance do 11 if ith bit == 1 then 12 currentDist = currentDist + max(0, 1e -eCount[i]) 13 else 14 currentDist = currentDist + max(0,eCount[i]-0e) 15 // Update Min distance 16 if currentDistance < minDistance then 17 minDistance = currentDist; 18 RxCandidate = rotatedInstance; 19 return RxCandidate Algorithm 1 .rst converts the discrete timing event information to a event/no-event time series data.

if the received sequence of event is Ediscrete = {E1,E2, ..., Em} in which Ei is ith event, it will be represented by a vector in the form: Et = [Et1,Et2, ....Ettmax ] where Eti =1 if there exists an event Ek such that Ek = i,and 0 otherwise.


Another method would be by any demonstration by M that pack-ets to A from C have been received by M. An obvious example of this would be for M and C to have undergone the TCP [18] three way handshake, with M using address A.

for a connection between M and C to have been created before node M moved.


This means that forwarding tables at lower tiers may be more regular and more compressible (to the point that a single-homed AS s routing state is compressible to zero bits in theory), suggesting that these ASes su.er 0.5 0.25 way lower scalability stress than those at top tiers.

from the lower tiers we see a much more heterogeneous Internet, with most of the pre.xes available via only a few primary upstream providers (which therefore concentrate lot of pre.xes, introducing a huge bias into the next-hop distribution in the routing function) and customer and peer ASes contributing very little to the entropy.


A graph is a forest if for all nodes in the graph,there existsnopath of non-vanishinglength that starts and ends at the same node.


It tries to minimize the number of reassignments for each graphlet.

it re-colors only the vertices whose coloring from the previous graphlet is illegal.


3.2.1 Data correction During the course of our analysis, we discovered several bugs in the Tropos accounting mechanism.

a number of .elds are susceptible to roll-over, but such events are readily detectable.


As a first attempt, we consider the properties of latency and cache size as the basis to cluster the mobile peers/devices.

mobile devices are divided into one group with Low Latency (//  PV ) and Big Cache (%& !


Transitive-trust dependencies also nullify e.ectiveness of DNSSEC, [RFC4033-RFC4035], and impede its adoption [1, 3].

if name servers or other resources of a signed zone are placed under unsigned domains, the DNS re CDF (%) 100 90 80 70 60 50 40 30 20 Legend alexa tld tld w tt 10 1 2 4 8 16 32 64 128 256 #Collocated Zone Files Figure 4: Zones coresidence on name servers among 25K-top Alexa domains and TLD, and servers in transitive trust dependencies of Alexa domains and TLDs.


For example, we might require (for additional security), that a user have the ability to access ob ject ob1 at location l1 and time t1, and then be at location l2 at time t2 in order to access object ob2.

without having been to (l1, t1) and having accessed ob1, the user would not have the requisite access control information needed in order to access ob2 at location (l2, t2).


Routing classes are derived from packet headers.

each flow has an associated traffic class and a hash class.


amount of time it takes between a source calling send to transmit a packet and the time that packet is delivered to the receiving application.

our goal is to minimize theper-packet delay, as opposed to minimize the delay needed to transmit an entire .ow.


To compute the transition probabilities of this Markov chain, it is useful to introduce some auxiliary probabilities.

let us analyse what happens when there is a successful transmission on the channel and the network is in state Yi,j.


Use of a stepparent is also useful for backup purposes.

if the real parent becomes disabled, then the orphaned devices belonging to the disabled parent can rejoin the network via the stepparent.


On the other hand, multiple operators compete with each other to get assisted transmissions from multiple SUs.

both operators and SUs show the con.ict of interests as far as the wireless channel conditions and locations of SUs are concerned.


(3) No cycle of customer-provider relationships (topology condition): No AS is its own (direct or indirect) provider.

the AS-level topology does not contain any cycle of provider-customer edges.


A very interesting observation arises when the packet size was 128 bytes.

the router showed an unusual behavior when the whole load approached the interface s capacity (100Mbps).


This scheme rests on a controller which is responsible for ensuring the desired behavior of the system, for guaranteeing a high degree of system perform, and for encouraging a convergence of the state of the system.

the controller makes the self-organized system manageable by controlling some of the components within the self-organization scheme to accomplish the above objectives.


The intended receiver of this response PDU is the searching manager, but the broadcast address is used since the manager and the agent may have IP addresses belonging to different subnets.

dr. Nespot is designed to perform properly even if the IP addresses of the manager and/or APs were not properly configured.


We build the recharging pro.les of sensors for MDG-SH by using real solar irradiation measurements collected by the Baseline Measurement System (Global 40-South PSP) at National Renewable Energy Laboratory [27].

we choose 30 days of year 2009 and categorize them into three sets based on the irradiance statistics.


The approach is based on stationary analysis of the number of alive messages and an AMP which utilizes this stationarity assumption.

we consider .rst a stationary CTMC which captures the evolution of the number of alive messages in the cache.


Denote the ef.ciency of wireless charging by µ(DiB (p)), which is a decreasing function of DiB (p),the distance between node i and the WCV located at p. Then the wireless charging model is as follows [10]: µ(DiB (p)) · Umax if DiB (p) = Dd UiB (p)= (2) 0 if DiB (p) >Dd , where Umax is the maximum output power for a single sensor node and Dd is the charging range of the WCV, beyond which wireless charging will not occur.

dd is de.ned in a way such that the power reception rate at a sensor node is at least over a threshold value d.  2.3 Dynamic Data Flow Routing Recall that the base station is co-located at the WCV and all data generated from the sensor nodes shall be delivered to the base station.


Two of the main problems encountered in a L3 handoff process are the detection of a subnet change and the long address acquisition time via DHCP [5].

regarding the .rst point a few considerations must follow.


The emergence of customer-installed cellular networks led us to ask the question: can we design 100% self-sustained cellular networks?

is it possible to design a network that provides the services users expect from today s GSM/3G networks and grows autonomously without any centralized infrastructure or planning, yet allows su.cient control and management in order to satisfy the operational, legal, and regulatory requirements of the environment in which it is deployed?


Otherwise, there will be a gap along the edge of C that cannot be covered by any Ci (1 =i =n).

ci s (1 =i =n) must overlap in order to fully cover C. The theorem below gives the probability that a sensor is completely covered by its n random neighbours: Theorem 2: n(n -1) Pr{A} =1 -nPr{A1}+ Pr{A1A2}.


However, there are also several challenges when using a larger number of simpler processors.

the management of these resources becomes more complex.


within one hierarchical structure Therefore, unlike most other MIPv6 based micro-mobility schemes, the macro-mobility of CUIP is enabled through CUIP itself and the MNs are still addressed by the universal address.

as long as the originating and destination wireless access networks are CUIP enabled, macromobility can be manipulated without relying on MIPv6.


Under this speci.c condition, we analyze the size of the population ultimately remaining in the system, in the limit where the initial population size, N, goes to in.nity.

we show that the size of this ultimate population decreases geometrically with the total number of coupons, K. when the ratio K/log(N) is above a critical threshold, we prove that this number of left-overs is of order O(log(log(N))).


There exists an optimal solution d * to (21) where d i * = 0 for all 2 = i = n - 1.

d * is given in the following three cases: Case 1: µ1/µ2 < t¯n,1/t¯n,2.


The form of this equation exposes the fact that this problem is closely related to the minimum weight k-node-disjoint paths problem discussed earlier.

let us set the source transmission power, T(S), to be a constant value, TS <,max.


(Lattice color repetition)Becausetheperiodic coloringisobtained by repeating the color pattern, the nodes W such that U UW is alinear combination of UUV2havethe same color asU.

uV1 and Uthe setof nodes W having the same color asU forms a lattice of Z2 withgenerator vectors UUV2: the vector U UV1 and UUW canbe written as UW U= a UUV2 with a and ß inZ2 UV1+ ß U.


is is the base station increases the amount of feedback resource allocated to mobile is by (1 + d)pis,ks L if there are su.cient remaining feedback resource.


The ack message is used to confirm the efficacy of a particular transport.

just because an agent is listening on a particular transport, and requests its use via a comm message, doesn t guarantee a viable path between the agents.


Our work is motivated by the recent advances made in [8] that provides a promising approach for managing this critical QoS metric.

[8] provides a throughput-optimal algorithm that is parametrized with a design variable a = 0, which improves service regularity as a increases (see Section 3 for more details).


The foregoing analysis can be extended to general holding times without di.culty, because of the well-known insensitivity property.

the stationary state distribution depends only on the mean service time (channel holding time), and not on the service time distribution.


To compare the impact uniformly, we shall choose ap > 1 for positively aligned parameters and 1/ap for negatively Figure 4: 802.11, Line, Flooding, 24 Mbps radio  aligned parameters.

for the remainder of this section, 802.11, Mesh, Unicast, Radio Rate=54 Mbps we will use a =2for W, and a =0.5for .l.


Now assume towards a contradiction that packet p is still at the tail of edge e at the end of time step t +LwrJ.

there are LwrJother packets that crossed edge e in [t +1,t +LwrJ].As before this identi.es LwrJ+1 distinct packets that require edge e, are present in the network at the end of time step t or later, and are injected by time step t +LwrJ-1.


TheIDs range[L...R] is partitioned into Nexp nearly equiprobable intervals.

we divide the range of possible IDs into intervals, where in each one there will be only one tag (with high probability).


In ANODR, route pseudonym sequence is generated by feeding the shared secret seed Kseed into the fast one-way function f, then feeding the output back to the input repetitively.

the i-th pseudonym is ni = f(f(···f(Kseed)···)) = f i(Kseed).


We anticipate that the delay and jitter requirements can be used as constraints at the interleaving stage.

these requirements will determine the maximum distance between two consecutive slots within the frame.


Aquiba considers collaboration without community bonds, i.e., the collaboration could take placeautomaticallyamongstrangers, evenwithoutthembeing aware of it.

sensing tasks of each cellular phone are reduced autonomously according to the availability of nearby mobile sensing devices; thereby energy consumption is also reduced correspondingly.


Unlike the .tness scalarization and lexicographical approaches, Multi-Objective Evolutionary Algorithms [10] are based on the assumption that all the ob jectives of a problem should be considered at the same time.

in order to capture the complexity of the search space of two con.icting objectives, an algorithm cannot provide a single optimal solution, but rather should generate a Pareto front, that is, a set of non-dominated solutions such that none of the ob jective functions can be further improved without degrading some other ob jective value.


Second: our DCB scheme uses a dynamic RAD that adapts to network conditions, namely, number of neighboring nodes.

it uses very low RADs for extreme neighboring conditions, and medium to high RADs for medium neighboring density as was depicted in Error!


2.2 A Stackelberg Game Model We model the interactive behavior of the ISP and users as a two-stage Stackelberg game.


Increasing the number of videos while .xing the other two parameters reduces the number of concurrent customers per video, thereby reducing the chances for data sharing and narrowing the performance gap between EHS and SHS.

as the number of videos increases while .xing the total request arrival rate, the videos become increasing less popular and thus data sharing decreases.


In practice, we found that we can group .ows into sessions without any HTTP information.

by looking for a change in the server IP to determine when a new video session for a user starts, we can detect session starts correctly with 98% accuracy.


The conception and design of RF-IDraw are inspired by astronomical interferometry, where telescopes are used to image the sky and search for planets [20, 34, 2].

in astronomy, pairs of telescopes with large separation are used to produce high-resolution fringes.


A traf.c-oblivious routing protocol requires limited traf.c information and achieves worst-case performance guarantee.

by sticking to a .xed routing strategy, the worst-case performance is optimized.


Similarly, in [10, 12, 15, 19, 23], routing decisions were mainly based on the so-called contact probability of two users (or one user visiting an access point if available).

[11] has considered algorithms to calculate the contact probability based on deterministic mobility of the users, which is suitable for satellites/buses with .xed paths/routes, but is not applicable to an ICMAN having mobile users.


In Maude-NPA, strands evolve over time; the symbol i is used to divide past and future.


SVD factors an m × n matrix A into the product of three matrices U, W ,and V T .

u is m × n,and W and V are both n × n.A = U · W · V T (1) This factorization has three key properties: 1.


The congestion of a route matching solution is de.ned to be the delta congestion due to the new routes.

the congestion values are reported by subtracting the original congestion value (before routing the net group) from the new congestion value (after routing the net group).


0 The upshot of this result is that as long as the delay-utility function representing user impatience is known, we can always determine the number of copies QCR must make to drive the allocation towards its optimal.

the optimal reaction function can be derived in a simple expression for all the delay utilities previously introduced, as seen in Table 1.


Finally, information collected so far in the State List is stored in the Learning Table.


Since the ULE-DVB network has no MAC address, the ARP lookup request will not be responded, and the packet will never be written into the RX of the virtual network device.


The resulting timing values can be used for, e.g., estimating throughput.

the timeline accounts for the data transmission time, that is, for the time the medium is in use.


Given the same constraint on the tra.c and network, similar results as in [28][9] can be obtained from the analysis in this paper.

for the same network studied in [9], it can be veri.ed that the per-.ow end-to-end performance measures computed with the concatenation property Theorem 3.2 are also bounded by O(HlogH) that is the key result of [9] and is much better that O(H3) with the analysis in [28], where H is the number of nodes passed by the .ow.


An optimization problem can easily be formulated as to .nd the values of .i s so that the minimum si among all i =1,2,...,B is maximized.


Compared to all existing schemes which satisfy only some requirements in a so-called versatileness criteria, the CRPV+ scheme meets all requirements.

the performance improvement of our schemes does not rely on tradeo.s among di.erent requirements, but comes from the use of our constrained random vector strategy.


After N steps of iteration, the complexity is N. O(n) = O(n).

we can obtain the arbitrary approximation of the solution in polynomial time.


Also, the curve of battery discharge is different for the individual links.

the battery of mote 3 shows a strange steplike behavior that we could not explain and battery of mote 5 shows a step and is much more variable.


One potential issue with our application of the binomial test in this context is the known problem that given a large enough dataset, the test will consider even minor deviations to be signi.cant.

with a large enough sample of throws, an unbiased coin could fail to pass a .2 test for .tting the predicted binomial distribution [26].


As an example of the output, we present results of the 24-bit key sequence generated at each of the locations A through N using the .rst channel state estimates from Experiment 2.


Tup: A routing event is classi.ed as a Tup if its pstart = e. A previously unreachable destination becomes reachable through path pend by the end of the event.

tdown : A routing event is classi.ed as Tdown if its pend = e. a previously reachable destination becomes unreachable by the end of the event.


In this work we propose leveraging SDN technology to adaptively slice and distribute a copy of P2PTV tra.c into a Deep Packet Inspection (DPI) layer.

a load balancing application on top of the controller distributes the tra.c among deep packet inspectors.


Different from the previous approach to mitigate the impact of incast congestion by a .ne grained timeoutvalue,ourideaistodesignanICTCP(Incast congestion Control for TCP) scheme at the receiver side.

our method adjusts TCP receive window proactively before packet drops occur.


Storing this additional information will always result in more conservative TFMCC behavior.

when network conditions for the new CLR as well as the old CLR improve simultaneously, TFMCC will switch back to the old CLR before increasing the sending rate.


Hence, the next question to answer is what parts of their end-to-end paths should the vehicles share with each other to be included in the aggregates.

every vehicle should only share its trajectory over a limited area contoured around its present location with neighboring vehicles.


For these reasons, we introduce a model that allows investigating some fundamental characteristics of the underwater environment.

the model highlights the underwater channel utilization ef.ciency as a function of the distance between the corresponding nodes and of the packet size.


Here, we see more than 20% of the packets have out-of-order delay larger than 150 ms, even without including the one-way network delay.

given that Sprint 3G s average RTT is about 200 ms, if we consider the one-way delay to be half of the RTT, its overall end-to-end delay (prior to be available to associated application) is (200/2)+100 = 200 ms, which is much larger than the duration that most modern real time applications can tolerate.