The two-way TCP tra.c share bu.ers on the common bottleneck, their behaviors signi.cantly in.uence the TCPs in the opposite direction.

the intermingling of ACK and TCP data in one bu.er may result in deteriorating the reverse link utilization and performance of the reverse TCPs.


The idea is to provide a central location for managing reputation.

when I interact with user U on website W, instead of rating him/her on website W, I go to a reputation centraliser (e.g., iKarma, Authorati) and enter my ratings there.


Our techniques leverage the DNS infrastructure in unanticipated ways.

while gathering a mea- surement, King relies on having third-party DNS servers generate and answer queries on our behalf, but without their explicit cooperation.


In comparison with the several previous proposals that utilizes a forbidding area, our scheme provides a sense of a warning area to each node but does not apply a real forbidding rule.

we avoid the utilization of a .xed forbidding area and therefore avoid concentrating traf.c on the boundary of such area.


In urban canyons, the radius of uncertainty zone can be much larger than one or two blocks.

the real location of the receiver can be a few blocks away from the estimated location, the center point.


We next investigate the performance of MoFA in the presence of both the hidden interference and the mobility.

a target station moves between P3 and P4 with an average speed of 1 m/s under the hidden interference from P7.


In addition, we assume wireless interfaces that support promiscuous mode operations.

if A is within range of B, it can overhear communications from B even if those communications do not directly involve A.


We propose a probabilistic IP prefix authentication (PIPA) scheme that leverages the existing BGP anomaly detection-based solutions as well as public internet registry information.

pIPA determines the authenticity of the pair (IP prefix, AS path) in BGP messages by using historical stability of the BGP information and internet registry data.


In the two scenarios the presence of the bottleneck will likely appear on di.erent param- From top to bottom: total packet count, RTT, FRTX, eters: loss and retransmission events in the former, larger delays and RTT in the latter.

the physical nature of the bottleneck plays a role in de.ning its impact on the tra.c and ultimately its signature .


For mobile operators, this growth is proving cumbersome to manage.

in urban areas, cellular access networks are showing increasing signs of congestion, especially at peak hour.


Note that we do not consider the pause times in the calculation of the averaged goodput.

we determine the amount of unique data received by the TCP receiver and divide it by the actual time needed for transmitting this data.


In fact, in cellular networks, most transport-layer losses are concealed by physical/MAC-layer retransmission and reduced by buffering.

buffers in LTE networks upstream from the airmile can play an important in absorbing the burstiness of the traf.c transmitted over the lossy wireless link, helping achieve a low loss rate.


At this point, most of the time the application works in system state 1, which requires 100% coverage of the warehouse and thus the redundancy in the network is low.

fewer possible sensor sets can support 100% coverage, and some sensors may be indispensable in all the possible sensor sets.


However, some internal speedup is required to allow all the input ports to transmit packets to the same output port at the same time.

output queues must either implement multiple write ports or use a higher clock frequency.


Rabin .nger-prints used in [24] are well-suited for high-speed implementation.

because Rabin .ngerprint computation relies on use sliding hashes, the .ngerprints can be computed in parallel with CRC checks, even as the bytes in a packet arrive into a router.


We now show RLT can obtain a linear relaxation for a polynomial term.

for the polynomial term P (i, j)a(i, j), we introduce a new variable to replace this polynomial term and add linear constraints for the new variable such that the nonlinear constraints are relaxed into linear constraints.


Besides, we found that the eigenloads, de.ned using the set of leading components, present a similar behavior across the di.erent tra.c load series.

we showed that they can be categorized in two classes: (i) the deterministic, slow-varying eigenloads carrying the major information content and (ii) the noisy eigenloads, which are related with the irregular variations of the tra.c.


The authors of [4, 6, 8] proposed a DBA for QoS to solve this problem.

the authors of [7] suggested an estimation based DBA algorithm for E-PON.


We see that for clustering and betweenness on both GP and GW , the average AUC over 14 days is nearly identical to what we saw for the .rst day.

on GP, the average is essentially the same for both clustering (i.e., 0.75 for Day 1 versus 0.744 for 14 days) and betweenness (i.e., 0.724 for Day 1 versus 0.718 for 14 days); and on GW , the average clustering (i.e., 0.787 versus 0.7625) and betweenness (i.e., 0.581 versus 0.562) are also comparable.


The radio board applies power to the analog baseband/RF waveforms.

the time domain signal after the IFFT stage is processed for power alloca  30 6  ?


An interesting aspect of the performance evaluation side of our work is that e.ectiveness of both proactive and reactive .ltering depend intimately on the connectivity structure of the underlying AS graph.

we show that powerlaw Internet AS topology [6] is crucial in facilitating small coverage with strong proactive and reactive .ltering e.ect.


The last column in the table shows the marginal information provided by the i-th looking glass when the .rst i looking glasses are used.

when we include one more looking glass into our monitor infrastructure, we obtain less than 1% more coverage of the entire peering topology.


Each user device then recomputes its new group.

for each BSi, a user device uj computes its weighted distance to that BS by Dw(BSi,uj )= D(BSi,uj ) × w,where w is a prede.ned weight.


= f2 In order to formalize this minimal security requirement, we introduce the following security objective function 8 ' < if .i,j : Ti,j ·Ei,j · `QQ´ FABEM 1, m ' m ' (conf ,T)= ·£=1 Ei,k+£ + £=1 Ek+£,j =0 : 0, otherwise where we derive matrix E ' with size n×n from E,so that E ' =1, if Ei,j = 8,otherwise E ' =0.

i,j i,j Ei,j ' =1, if vi cannot send a message directly to vj ,otherwise E ' =0.


Hence, the measured path performance can be signi.cantly di.erent than the actual path performance.

the measured performance of two paths sharing the same bottleneck link can be di.erent even though their actual performance is the same.


Moreover, the sleep ratio is also very much affected by the listening window size.

as expected, the larger the listening window size, the smaller the sleep ratio.


In contrast, under ORA algorithm, there is no unmarking mechanism within an iteration.

relay nodes that are marked earlier in the search process by some source nodes will remain marked.


We further improve the correctness validation and retransmission mechanism.

three communication protocols are designed, including mobile to GoG, GoG to mobile and RDS superset.


While the route history attribute can solve this the existence of a route to a destination.

visibility can be problem, we examine how the use of this attribute can violate in violated.


This .niteness of the state-space along with the irreducibility condition implies that the MC is positive recurrent [4].

starting from any initial position, the MC will return to a given state in.nitely often, and the mean return time is .nite.


However, as soon as pTunes collects network state, it detects a decrease in link quality and adapts the X-MAC parameters accordingly.


Although several of the vulnerabilities described in Section 3 can be mitigated using the above stopgap procedures, there are many design characteristics of CALEA systems that make them inherently susceptible to manipulation.

combining data from multiple IAPs into a single CDC, sending SMS and IP payloads via the CDC, and requiring a separate CCC for each call leg are intrinsic in CALEA designs based on the J-standard, leading to vulnerabilities that cannot easily be addressed by modifying the con.gurations of wiretap systems.


Note that in MRMA, once a reservation is confirmed, a slot is always provided on a frame-by-frame basis.

the reservation mechanism provides a hard guaranteed service.


3.3 The New AMVA-Decomp Technique A key hypothesis leads us to adapt the decomposition tech- nique reviewed in Section 2.3, to the AMVA context.

it may be sufficiently accurate to apply the decomposi- tion only at the level of the individual center at which there is a high service time CV.


FIB COMPLETION 4.1 Completion Approach Our .rst TCAM FIB merging approach, called FIB completion, addresses the pre.x masking issue described in the previous section in a direct way: whenever a pre.x from the UPS does not appear in a given individual FIB, we simply associateitwithavalidNHinthisFIB.ThevalidNHisthe one associated with the longest ancestor pre.x in the same FIB.

each null NH entry described in Section 3 is replaced by the .rst valid NH entry encountered when going up the corresponding trie branch towards the root.


This is an important aspect to evaluate when considering that one of the main advantages of DiSR against all the tree based approaches should be the ability of choosing whatever bootstrap node, without having to care of any particular root-node role assumed in the future.

after segments have been established, the bootstrap node is like every other node, i.e.


If the transmitter is aware of relative importance of data bits, it can place more important data bits in more protected positions and the less important data bits in less important positions.

a transmitter can ensure an unequal error protection (UEP) of its data by simply placing data bits in speci.c bit positions.


Third, traf.c-aware optimization saves energy more ef.ciently than pure optimization for discovery performance.

finally, in both mobility scenarios, single-radio PSM with traf.caware optimization achieves similar performance to dual-radio GPSM without the optimization., if the additional traf.c information available, the one-radio architecture could be tuned in a manner that would overcome the disadvantage of not having an extra radio.


Note that the median normalized value (as well as the 25-th percentile) of the kernel becomes 100% within just few rounds.

with a death-regulated birth process itbecomespracticallyimpossible to replace akernel at the waist of the hourglass.


We treat each ring at a given time as a random variable whose values are k-node subsets of SM .

we can talk about the distribution of a given ring, and about several rings being probabilistically independent from each other.


In the proposed multi-path handoff scheme, the packet loss ratio in Case I shows similar trend seen in the single path scheme without forwarding.

as RTT increases, the packet loss ratio decreases for a while and then increases.


Second, the methods should remain accurate even when the input is a small subset of all possible RTT measurements.

a node s coordinates should allow even the unmeasured RTTs to be estimated accurately.


So, it is desirable that the design for diagnosability analysis described below be done before the functional speci.cations at the functional block or register level are .nalized.

the sort of design for diagnosability at the system level considered here impacts circuit speci.cation more than circuit design.


Finally, it is stateless, meaning that no history information is necessary.

no neighborhood knowledge is necessary to execute the protocol.


Hence the procedure perfectly locates the anomaly in time, without the recourse of rupture or volume based detection procedures.

the anomaly is seen because its short time correlation structures di.er from those of the normal or background tra.c.


Given this, it is dif.cult to imagine a means of realistically implementing a checker for the above condition for a message received on line 2.

it is dif.cult to establish that the dispatching algorithm is right , i.e., that it ensures progress.


First, we can see that the received RSS gets maximum at 90. when the tag is in the center of the beam.

when the antenna plane is directly facing the tag, the tag harvests more energy and then re.ects more.


In addition, we focus on cases where one of the two ASes (say, AS D) never appears in a BGP AS path, except as an origin AS.

we assume that one AS (B)is using the address space originated by the other AS (D), rather than trying to capture cases where each AS borrows from the other.


Therefore, while a considerable part of transmission opportunities is used by the Common Channel assignment to send control packets, these opportunities are used by the MILP strategies to send data packets.

the MMFlow/Con.ict-free case performs much better than the Common Channel assignment especially under high data tra.c, because it computes a schedule for radio links so that collisions and interference are avoided.


The presence of data-caches also simpli.es the usage of hardware multi-threading.

in the presence of data-caches, NPs can simply switch context from one thread to another on a cache miss.


Hence this binomial spatial distribution is translated into a spatial Poisson point process [7] to model the random presence of the network nodes.

.1 can be treated as a mobile node s arrival rate of each standing position .


Because messages are published to the system rather than held privately by a module, the system can optimize when these messages are bound to new records.

we can apply aggressive pre-fetehing of messages when transferring a datum to a remote cluster node.


Our answer to this question is di.erent depending on whether one considers the directed or bidirectional version of the problem: For any oblivious power assignment p, there exists an instance with n directed communication requests needing O(n) colors when using p, but only one color when using a di.erent power assignment.

oblivious power assignments cannot yield approximation ratios better than n for the directed interference scheduling problem, which corresponds to the worst possible performance guarantee.


Let the form of p(y) be like the delay in an M/M/1 queue with a server of rate 2.

p(y)= 1- 1 y -1 2 (we make p(0) = 0 to avoid multiplicative decrease at zero network load).


For (iv), we note that having an in.nite number of overlays with in.nitesimal demands is equivalent to having all the in.nitesimal demands on a single overlay, Average latency (us) each of which tries to minimize its own latency.

(iv) 20000 is equivalent to having a single overlay using overlay source rout 15000 ing.


We do not claim that our inferred IPv6 router-level topology is representative of the IPv6 Internet.

our current research explores how to more e.ciently and effectively perform active probes in IPv6 amid large amounts of topological sparsity encountered in random probes [3].


In the case where we do have information about the variable, usually in the form of some set of mathematical constraints C, then the principle states that we should maximize the entropy H(X|C)of X conditional on consistency with these constraints.

we choose the solution which maintains the most uncertainty while satisfying the constraints.


Therefore, mobile users may communicate with each other using 802.11 interfaces, e.g., using WiFi-Direct capabilities [31].

multiple radios could be exploited for establishing cooperation via Device-to-Device (D2D) communications, e.g., to form clusters, as illustrated in Figure 1.


This paper presents a proactive-surge-protection (PSP) mechanism that aims to provide a broad .rst line of defense against DDoS attacks when they happen.

under a .ooding attack, traf.c loads along attack routes will exceed link capacities, causing packets to be dropped indiscriminately.


The quickest way (on an average) in which this query can be spread to all the nodes in the system is via an epidemic spreading model.

a node with the query periodically broadcasts and spreads the query to other nodes in its vicinity.


Collectively, these techniques achieve significant reductions in the energy cost of email syncing.

we have im-plemented them by modifying an existing email client on commercial smartphones.


have unpredictable and intermittent access to solar energy, we need a .exible energy architecture that opportunistically exploits available solar energy.

there will be situations when node batteries are either fully charged or fully .at.


The gain is smaller than in the previous scenario, because the background .ows also bene.t from losslessness obtaining a higher throughput.

the congestion window of NewReno and Cubic are kept open due to the absence of losses.


more demand D for the scarce supply U leads to greater variability in the download progress achieved.


In either case, it is easy to see that frequencies can be reused along a long path.

any path can be full-duplexed thus using no more than 3 frequencies, and perhaps 2 if appropriate code division multiplexing is used.


Rather than digging into the details of such an interaction, we present in this section an overview of some rich multimedia applications that can be built on top of Janus.

we will describe how di.erent plugins, sometimes with more than a single instance per user, can be used in an e.ective way as bricks to realize a much more complex application than the one each individual plugin was designed for.


In this paper, we propose to cache Web services in mobile wireless ad-hoc networks as a way of making such services more accessible to mobile devices.

caching can increase the availability of such services, turn them more predictable and scalable as most accesses can be satis.ed locally, and improve the user experience by reducing response time.


Indeed, as the slope of the ROC curve .attens, the increase in true positive rate is proportionally smaller than the corresponding increase in false positives.

a higher signi.cance level, although it always increases the true positive rate of the test, is not always productive as it eventually does more bad than good through increased false positive rates (i.e.


However, quality levels were not satisfactory for one or more users with a joint MAC-PHY solution for controlling multi-user access to the wireless medium in a VBR WLAN.

multiple access management issues arose when trying to propose an ef.cient strategy for resource allocation.


SUPER PEER ROUTING IN S-CHORD 2.1 Motivation A scale free network [2] is a network whose degree distribution follows a power law (PL).

the probability that a randomly chosen node has degree k is given by P(k)= k -a .


The figure also shows that with AS path prepending there are various possible outcomes.

aS path prepending already exhibit some of the behavior we see at the OPA decision process.


The lower bound and the upper bound of r is derived as follows: rlow = min{i|si < 10si+1 } rhigh = min{i|si < 2si+1 } After obtaining the range of r, we run our algorithm on eachpossibility of r from rlow to rhigh.

on each instance ri, the quality of the result is calculated as follows: ||X - U × V|| ||V - V '' || quality(ri)= .1 +.2 dn rid quality(ri) is the quality metric of how good the estimation assuming there are ri FGs.


The value of ai indicates the class i user s sensitivity to the QoS degradation (i.e., the increase in packet blocking), while ßi indicates the acceptable packet blocking probability for class i customer.

with the increase of packet blocking probability, ßi decides when the utility decreases and ai decides how fast the utility decreases.


Let qi be the set of sampled .ows associated with the index i using the hash function from the streaming module.

qi is the set of .ows in the sampled data whose .ow labels hash to i.


5. appoint -A PROS APPLICATION We have developed a proof-of-concept application appoint on top of the PROS library which allows the privacypreserving negotiation of a meeting time while taking user preferences into account.

the 3PRC -FNPimplicit protocol is being used to facilitate the negotiation.


a user in a bad area could quickly use the QoS Map to .nd a good quality connection to the WLAN.


Using these ISPs, we reduced their router-level topologies to PoP-level (city-level) topologies.

we grouped routers by their geographical locations which were inferred from their DNS names [22].


Figure 3 shows that the transmitted streams are somewhat discontinuous.

the streams are rather shortlived pieces at low tra.c load, but longer at higher loads.


If the value is too large, it will be too late to avoid the congestion when the notification of congestion reaches the source node.

the congestion will already take place before the source node reduces the transmission speed.


Inspired by the practice of visualizing a surface through meshing neighboring vortexes in computer graphics, in Modellet, we try to approximate the possibly irregular radio map by meshing neighboring .ngerprints.

modellet adapts to the speci.c local data density and environmental conditions by fusing information from both measured .ngerprints and signal propagation models, based on the key concepts of the supporting set.


First, comparing the two graph structures, Kautz provides higher availability, especially for node failures.

kautz maintains perfect availability under correlated failures even when half of all racks are unavailable.


We propose two novel solutions, .ow sample and hold and Bloom .lter tuple set counting , that present speci.c advantages over prior solutions.

.ow sample and hold improves accuracy for traf.c mixes for which packet sample and hold alone would be inaccurate.


This framework can be used to analyze connectivity properties of di.erent application scenarios and node deployment strategies, such as uniform and non-uniform distributions;  We show how to apply discrete percolation theory to characterize and solve connectivity issues in wireless ad hoc networks.

we characterize the CTR for connectivity in a regular obstructed environment;  We derive analytical expressions for the probability of crossing links between parallel and perpendicular segments sharing an intersection, and these results are used for deriving a lower bound for the probability of connectivity at intersection;  Combining results of discrete percolation theory and the probability of connectivity at intersections, we compute the CTR for connectivity in the overall network.


In order to reduce the overhead of region lookup of RBF, a BGP router can maintain a cache table of the legitimate pairs of ASN and pre.x.

after a router veri.es that a pair of ASN and pre.x observed in a BGP announcement belong to the same region, the router can add this pair into the cache table.


We presented preliminary results from an early version of the system which demonstrate that we are able to save energy in a localisation application.

our localisation runs show an increase in battery life from 9.2 hours using GPS to 22.2 hours using a combination of accelerometer, GPS and 802.11, with little change in the .delity of the location data.


The LST of Li is calculated by dividing the expected area of the func -sLi(t) tion e over an arbitrary cycle, by the expected cycle time.

[ C -sLi(t) -sLi ]E[0 e dt] Li(s)= E[e = .


Our Approach: We propose a mechanism to locally infer and judiciously propagate information about obstacle presence in the network, to early avoid the broader network region around the obstacle, towards achieving near optimal data propagation paths.

the sensors lying close to the boundaries of the obstacle are able to locally and distributively identify themselves as such, by the fact that the rescue mode used is again followed by greedy propagation closer towards the destination.


Due to the multiple local approximations at quantiles of stochastic approximation before convergence, it is quite possible that multiple quantiles estimated independently do not obey the monotone property.

the value of 90% quantile can be smaller than the value of 80% quantile.


Remap computes A1(G4) from A1(G1) ef.ciently.

a1(G1) in the frequencydomain consists of a group of subcarrier symbols, one on each subcarrier in G1.


The capture effect allows multiple transmissions to be correctly received even when the nodes are within the radio range of both senders [32].


Likewise, the children of a node X in T are sometimes called X s upstream neighbors.

our goal in the traceback problem is to identify the internal nodes1 of the tree T .we wish to identify the internal nodes in the universal tree U that correspond to routers unwittingly serving in the attack tree T to send attack packets to the victim V .


5.2 Effect of Sel.shness Let pself denote the probability of each CR acting in a sel.sh way.

at each channel access attempt CR selects its strategy between BFC and LITC probabilistically according to pself.


We also did a simulation study for this scenario, which shows significant improvement in PER using AC isolation and virtual division, though the improvement is less than for the cases shown above.

techniques like ours that avoid countdown collisions lead to higher channel occupancy, and thus higher hidden node collision probabilities.


Each pair of inside and outside host groups with strong interactions corresponds to a dense (bipartite) subgraph in the original TAG and the bipartite (hyper)graph induced by the low-rank core matrix is referred to as the (core) latent hypergraph of the original TAG.

the tNMF method approximately decomposes aTAG into a series of dense subgraph components and a (core) latent hypergraph representing inter-connection structures among the graph components.


Using the media layering concept, the presentation inter- val of a buffered frame is decided by the current presenta-tion quality, which is decided by how many media layers are transmitted.

a same number of stored frames in the buffer can have different semantics, i.e_, denoting dif- ferent presentation lengths, depending on which presenta- tion quality and which media layers axe currently adopted.


Table 4: Determining traf.c classes and user behavior Client tag Server tag Traf.c class, User behavior   web user, proxy user website Browsing mail server mail server Mail  node  Gaming [abuser][blocked] server n/a  Chat chat server n/a IRC server Chat [streaming node] [streaming node] Streaming   Malware affected host affected host p2p node p2p node P2P [ftp share] ftp server Ftp The unconstrained endpoint approach can be applied in a straightforward way to the traf.c classi.cation problem.

there is no reason to constrain ourselves to strictly observing packets and connection patterns.


How manyrandom nodes would a scalable overlay need to contact to .ndalow latency route?Figure1shows thatfor most host pairs, the bottom 50% of potential 1-hops(sortedby total latency) does not contain a single low latency route and even considering the bottom 97% of one-hop intermediates still miss manyof the latency improvements (only 30% of the paths would have lower than a 400 ms latency, compared to at least 45% of the paths when using the best 1-hop).

97% of the time, a randomly chosen intermediary will not signi.cantly improve latency.


A feasible sampling method for .ow records must (i) control sample size within a sampling budget; (ii) yield su.ciently accurate estimates; and (iii) provide samples in a su.ciently timely manner for applications.

the sample design must match the statistical distribution of .ow fea 1The analytic value of full data over summaries decreases with age, which may in any case be curtailed by policy.


The basic Mobile IP for IPv6 standard[10] defines a protocol that can be used to locate Home Agents, given only the prefix of the link upon which the Home Agent is expected.

in our case, the prefix of the Care-Of Address assigned to, or by, the Mobile Node when it arrives at its new link.


Note that when multiple RxRings are used, the smart Rx filtering scheme embedded in the high-speed adapter has to balance the traffic load among all the enabled RxRings with a suitable mechanism.

to avoid out-of-order packet delivery, it must assign to the same RxRing all packets of a certain flow, while at same time equally distributing the traffic Fig.


A very important component of such observation is that, the agents have a tendency to visit places depending on the attractiveness of those places.

there is a preferential choice driving the mobility pattern of the agents.


In order to run the experiments on a network with a larger scale and a more realistic topology, we emulate a fat-tree topology built out of 45 6port switches by slicing the switches of OCEAN.

we deploy a simple home-grown virtualization layer, placed between LIME and the switches, that maps the data plane IDs and ports of the physical switches to the virtual switch IDs and ports of the virtual 6-port switches (more details can be found in [29]).


We can de.ne the direction as that, which is vertical to the line that connects the obstacle boundary to the sink.

the beacon will follow a Southern path, if the rescue-mode phase follows a SouthEast path, and an Eastern path, if the rescue-mode phase follows a SouthWest path.


Traffic shaping, as a rate-controller in the network, can hold packets.

it postpones transmitting a packet until a specific time instant.


most of small .ows experience at least one TCP collapse caused by incast.


This approach is employed by Apple HTTP live streaming, Microsoft IIS server, Adobe Dynamic Streaming, Akamai HD Video Streaming, and Move Networks.

we present a Quality Adaptation Controller (QAC), which has been designed using feedback control, to drive stream-switching for adaptive live streaming applications.


As previously said, in the third set of the experiments the packet delivery ratio of OLSR and AODV decreases up to 66% and 60%, respectively.

from the log .les we notice that packet losses occur during the relay swap phase (i.e., from 20 to 40sec), in which only half of the number of packets generated by node A reaches the destination successfully.


Finally, we ran ad-hoc active measurements during the outage to some related pre.xes.

we sent ICMP echo requests on1 February at 09:00:00 GMT from GARR (the Italian Research and Academic Network), the replies to which revealed that at least three IPv4 pre.xes, among those announced by EgStateAS and not withdrawn during the outage, were actually reachable.


Third, the sensor nodes might be different from each other in terms of their physical properties.

some of them may handle computation very efficiently (conserving computation energy), it on the sensor node or on the base station side.


Thus, for the rest of the paper, we only considertheconservative4×memory overheadtogenerate anequivalent resource con.guration for the minimalist approach.

given the same amount of available SRAM the minimalist algorithms can only maintain one-fourth as many .ow counters as the application-speci.c approach.


Several studies have investigated the e.ects of di.erent physical layer implementations on wireless network simulation accuracy [2, 6, 16].


3.3 Integration of OAR with IEEE 802.11 via the Fragmentation Field The fragmentation mechanism de.ned as part of the IEEE 802.11 standard and mandated for implementation provides a simple and practical way for nodes to hold the channel for multiple packets when high data rates are measured.

as in RBAR, the receiver indicates the available physical-layer rate via the RTS/CTS messages.


Moreover, each local agent stores occurrences of a few relevant events, with their related data, on its local memory, in order to make them available whenever a Logical Reasoner request is performed to analyze past situations.

each node records a minimal amount of data relevant to reconstructing its state.


Then to de.ne the edge set, we record an edge between two nodes if those nodes share an af.liation in the two-mode representation.

an edge (ni,nj) exists in the one-mode network G only if there exists an af.liation node a .


However, they form the core of the XQuery and XPath query languages.

xML queries are usually expressed by means of XPath expressions which de.ne a way of navigating an XML tree (corresponding to some document) and return the set of nodes which are reachable from one or more starting nodes through the paths speci.ed by the expressions.


APPROXIMATING THE MINIMUM RA-DIUS In this section we present algorithms that uses sectors of slightly larger radius than the optimal one.


Although there exist many choices (i.e., different ISPs, technologies, and channels) in the current wireless network environment, they are not utilized ef.ciently due to the current ISP-centric service model.

most mobile users should use the same network, technology, or a single frequency channel to get a common service.


This is because, generally speaking, the behaviour of one MN does not affect the behaviour of subsequent MNs.

a particular behaviour will not be observed in an ordered fashion.


While it may be possible to design a congestion control algorithm to achieve fairness in a network with strict priority service, our scenario imposes a further design issue.

the service order here is unknown in advance, is topology dependent, and spans orders ranging from FCFS to strict priority.


However, a key distinction of our approach is that we work with any given wireless network con.guration and workload speci.ed as inputs.


Requirement(i)ismetonlyby theFON scheme,while requirement(ii) is onlypartially metby theOpenSpark and the Wi..com schemes.

we argue that the mobileuser should be able to attach to di.erent APs on-the-.y in order to bene.t from mobile Internet services.


for events P00xR01 and P00xR10 and their di.erences during e3 in Figures 16(a)-16(c).

figures 16(a)16(b) show thatgroup(i) exhibits a single mode at around 4 ms for the path queueing delays for both events P00xR01 and P00xR10.


Our work is related to [6], which also uses multi-servers, called a Virtual Mixer, to reduce delay in video conferencing.

it tries to minimize either the average or the maximum end-to-end delay using a heuristic based on Steiner tree optimization performed on a graph of servers and clients.


In Section 6, we build a proof-of-concept WISER prototype, deploy it in a building .oor, and evaluate its performance by real-world experiments across a four-month duration.

we demonstrate that WISER can identify 30%50% more indoor white spaces with negligible false alarms, as compared to alternative baseline approaches.


We also aim for a full development of the multimedia protocols, both for Control and Multimedia Transport.

the Control protocol should be capable of making decisions in a broad variety of scenarios.


This can be done using 12 colors in a greedy fashion.

for each variable in turn, we assign the colors for both literals of that variable at the same time.


We observe that in some cases (i.e., 1020m/s, Figure 9) UPN Protocols complete their task even faster than DropTail, which explicitly owes to the UPNLB algorithm.

dropTail guests get hooked to the .rst AP within range and stay attached to that speci.c one till they complete their task or lose connectivity.


More formally, we de.ne a failure in an evaluation study as an instance when you were unable to learn what you intended to learn from an evaluation study.

a failure arises from a mismatch between intent and outcome.


To ease deployment, we design an incremental algorithm with which the HartFi system works regardless of the number of WirelessHART interfaces.

if there is no WirelessHART, the HartFi system becomes the original Wi-Fi based system.


We assume that all routers iF -L announce equally-good routes to reach p. This assumption implies that our model considers the set of best BGP routes after applying policies.

we are only considering routes that are tied through step 5 in the BGP decision process (see Table 1).


The controller has to perform computational complex tasks such as optimal route calculation (distribution trees) or subscriber clustering.

these tasks become challenging in large-scale and highly dynamic systems with larger topologies, many publishers and subscribers, high churn rates, dynamic link state, etc.


That is, the mean number of arrivals between two consecutive visits to queue i, namely mi , must be smaller pi than the bulk service amount w. Assuming equation (45) to be an analytic function in the disk z : |z|=1+d implies that the numerator is zero whenever the denominator vanishes in z : |z|=1+d.

the numerator and the denominator of (45) have exactly the same number of roots in the above disk.


That is not to say that the difference in signal strength reporting between any two cards is always a linear relation.

dif ferent cards may use different techniques to actually measure the signal strength.


Hence, this approach requires that the protocol processing logic understand not only the semantics of protocol but also the semantics of the language, since the two are integrated.

the protocol processing logic is tied to the REL.


In this case, that descendant must reverse the portion of the tree between itself and the orphaned child.

its parent must become its child, and that reversal must continue until it reaches the orphaned child.


This could save processing power since we avoid to analyze all the packets belonging to the session, while at the same time we decrease the possibility that a random payload matches a signature and brings to a misclassi.cation.

table 1 shows the mean and standard deviation of the number of classi.cation attempts executed over unclassi.ed sessions; the number of searches is extremely high especially in case of TCP sessions, which are usually longer than UDP ones.


.p .p Each MLLS contains all the paths u ..v (u ..v .Puv) between an ingress E-ER u and egress E-ER v pair in the domain D. Also, each MLLS includes multiple levels and each level records a .p list of elements.

each element indicates a path u ..v. MLLSuv(i, j) indicates ith path from E-ER u to E-ER v that locates on the jth level.


The key idea is to query the Google search engine [6] with IP addresses corresponding to arbitrary endpoints.

we search on text strings corresponding to the standard dotted decimal representation of IP addresses, and then characterize endpoints by extracting information from the responses returned by Google.


For example, Pth = 0.2 means that 80% of path activation requests would be accepted on average; hence, the expected number of trials for successful path activation becomes 1.25.

pth determines the number of requests that should be made by an endpoint AD until successful path activation.


Now the VMST will have two links sq1 (corresponding to LCP(s, q1, d ) = sv3q1) and sq2 (corresponding to LCP(s, q2, d ) = sv3q2).

v3 appears in two virtual links sq1 and sq2 of V M ST (d ).


F airShare SetF lag(flowj .RateChanged) end if end for end function the system to be full distributed.

such functionality as .ow allocation to an outgoing port and update of the maximum possible sending rate for each .ow are local responsibility of each forwarding element.


IEEE 802.11e EDCA channel access  4.2 Our Approach via Software Upgrade A negative aspect of the 802.11e in the service provider s perspective is that it requires a hardware upgrade.

the legacy 802.11 MAC controllers cannot support the 802.11e.


Regarding Future Internet, additional network services to above traditional facilities are necessary to meet special type of requirements for new services and applications.

since Future Internet application experiments should be performed based on end-to-end federated networks between end users in the multi-domain global networks (e.g.


At each node, impedance tuning is done to minimize reflection As a result, when the T/R switch is on, the node absorbs 50% of the energy propagated thus far.

after 6 draining nodes, the signal energy in the transmission line is reduced to about 1%oftheoriginalsignal,nolongerasignifican sourcenoise.


Among them, two types of symmetries are of special interest and are stated below: Definition 1: xi and xj are non-equivalence symmetric (NES) in f(X)ifand only if f xi xj= f xi xj.

the exchange of xi and xj does not change f.i.e.


Figure 3: Correlation coe.cient r for di.erent Request Window Size Assuming that a typical application needs 90% data accuracy (r=.90) the Figure 3 states that almost 81% requests on average can be answered in a compressed fashion.

they all pass the CORRELATED as described in section 3.2.


All control and data packets are routed as described above without any translation to location based addresses.

control messages to setup new vset-paths are routed using the existing vsetpaths.


the rate (over time) at which nodes fail and join.

only failures the graph xaxis ranges from a rate of 1 failure per 3 stabilization steps to a rate of 3 failures per one stabilization step.


As mentioned earlier, one of the problems with overbilling is possibly neutralized.

as one practitioner can bill too much time (knowing or unknowingly) during treatment with basic procedure and documentation; the RFID yoking paradigm cannot lie.


After a lightpath is released, let N denote the number of source-destination pairs with one or more common available wavelengths before the rerouting procedure.

lightpath can be released, the proposed rerouting algorithms initiate.


Eventually, this must be a commonly edited object.

this must be the unconstrained editable global GUSL.


We observe that when the maximum bid value Viax increases, the degradation of TASC over the pure relay assignment algorithms decreases.

when buyers have higher true valuations on the services from relay nodes, TASC can achieve all the required economic properties without degrading the system e.ciency signi.cantly.


This is because the record structure used is the same.

in the minimal instrumentation scenario, instead of capturing the invocation of Boot.booted(), if the instrumentation process were modi.ed to capture one change of a variable, the memory usage would remain as shown in column 3 of Table 1.


The solution space for path selection is signi.cantly richer.

messages with di.erent sources,sinks,departure times, and expiration times may be assigned completely di.erent paths and replication strategies.


We vary the video length in Section 6.1.

we show that the model for constrained streaming is accurate for a wide range of video lengths.


For example, there may be two peers with identi.ers 56 and 40 with no other peer between them.

there is no peer whose identi.er is greater than 40 and also smaller than 56.


We solve the .rst problem through a Reinforcement Learning (RL) approach.

in our context a learning agent (the controller) interacts with an unknown environment (the opportunistic network).


When we use the term architecture, we are focusing on the waist of the Internet hourglass (or any future equivalent of the current waist) - that set of fundamental assumptions and agreements that binds all the participants.

our focus is that of the current Internet Protocol (and future possible replacements) as well as the concept of layering that comes with any choice of waist.


Therefore, using brute-force attacks to derive these aj and bj values is even harder than using brute-force attacks to directly guess each bit of the key.

if attackers try to derive these hash parameters to get those keys, they have to derive all these hash parameters correctly.


In contrast, a traditional packet simulator with n different types of devices will need to resolve the O(n 2) possible interactions between these deivces In addition, we remove the assumption that a physical world is necessarily being modeled.

we allow users to directly control the signal propagation channels between devices without necessarily considering a physical world.


Figure 9 shows the relationship between the sum of each individual RNP in each direction, and the actual RNP cost for all links when sending the acknowledgment immediately.

we could observe from Figure 9(b) that the sum of one-way RNPs is quite correlated with the actual link cost, with stronger correlation for smaller RNP values.


The ACTP has the flexibility to take that kind of decisions.

the ACTP offers a decision-making algorithm that is primarily based on the properties of the message being exchanged, like the size and the time-criticality of the message.


Fourth, the MAC addresses of the authenticator and the supplicant do not appear to be necessary for the authentication process.

it may not be necessary to include these addresses in the PTK derivation.


we depart the somewhat unrealistic assumption of exponentially distributed and hence unbounded transmission powers, and assume instead that all nodes employ some common, constant transmission power: Pk = P .


RELATED WORKS Even though the application of risk evaluation methods has been widely discussed and analysed, see, e.g., [1, 6, 14], among information security experts there appears to be no agreement regarding the most appropriate method to assess the probability of computer .. ..incidents[20].Inliteraturetherearemanyattemptstofacetherisk assessment problem; some of them de.ne systematic approaches while others provide more ad-hoc methods to evaluate the likeli hood of (a class of) violations.

we have found of interest Baskerville s description [3] of the evolution of various adhoc methods that sometimes could be combined to improve the ac curacy of the security evaluation.


Each test was repeated 3 times using different packet sizes to transmit the same load thus altering the access requirements of the background traffic sources.

the smaller the packet size, the more packets that must be sent to achieve the same offered load.


With (P4, pre-send) however, functioning servers receive A's multicast by T+ RTTd2, effect the membership change by T+ MC + RTI'd2, and also order the request by that time as the membership change involves an FME which helps order the request.

processing begins in P4 early by at least RTrcs.


12, which has less than 35% probability of identifying all links even if the fraction of monitors ./|V| is as large as 0.99.

for almost all the 17 In real networks, monitor selection may be constrained to a subset of nodes, e.g., gateways.


The protocol does not require any more information than what is provided by a link state unicast routing protocol, like QOLSR [7, 6].

each node needs only to know the network topology (partial or global) with QoS metric values on links (weighted topology).


We illustrate more problems through a careful performance study of the MAC using statistics collected from the device driver and packet-snif.ng tools [1, 2].

we show that link asymmetry or hidden terminals can either cause (a) poor fairness, sometimes even shutting off ing to poor performance.


This is true of .ood prediction and, although the evidence [6, 7, 33, 36, 37, 38] here is sparse, we can see mature applications in other areas.

statistical models have proven among the best in forecasting hurricane intensity (which presents similar challenges to .ood forecasting) [12] and are used for guidance in operational cyclone forecasting [24].


Our simulations show that the proposed algorithms indeed save energy and guarantee users performance.

the algorithms can reduce energy consumption by as much as 22% without sacri.cing throughput compared to a baseline MP-TCP algorithm.


The end-to-end performance of an application depends significantly on the performance of TCP.

when a mobile device moves between two cells an entire burst of packets might be lost.


This paper differs from such studies in that we study the impact of CSMA/CA based MAC protocols with consistent and inconsistent channel state on the performance of the utility-maximization congestion control schemes.

we explore the impact of the wireless channel, unknown data transmission capacity, unknown service order and unknown and incorrect system state on the performance of congestion control algorithm in environments with and without collaboration.


Host online times as low as few minutes can reduce the numberof remote uploadsby more than an orderof magnitude.


We also assume that the popularity of each video changes over time, so that we examine the behaviour of the caches when popularity changes occur.

it is assumed as in [9] that the popularity distribution changes every R requests.


The result of a low bandwidth-delay product is that conventional bonding works well in a wired access link setting with homogeneous links.

a small integer number k of links can usually be aggregated resulting in a near linear increase in throughput over the throughput of a single link.


Extensive simulation based on the ns-2 has shown MASA to offer as much as 25% higher packet delivery rate and 27% higher throughput than the DCF with the CBR (constant bit rate) and TCP traffic, respectively.

a significant reduction in packet delay, 86% and 70% lower packet delay with the CBR and TCP traffic, makes MASA suitable for delay-sensitive applications.


Secondly, and more importantly, is its effect on communications.

if sensors are deployed beyond communications range of one another, they will not be able to communicate reliably, if at all.


However, the random placement of an arbitrary number of controllers does not provide satisfactory performance [6], so some planning must be done to build an e.ective and reliable SDN.

a decision must be made on how many controllers are instantiated, where they are deployed, and what nodes are under control of each of them.


ATPG tests on candidate wires tend to collect the same implication repeatedly in the local region.

information from individual ATPG runs are not used properly.


Note that, in the case of dishonest majority, adaptively secure MPC does not imply adaptively secure broadcast because the usual notions of security for MPC do not guarantee output delivery or fairness (see [10] for a more extensive treatment) these properties are, in general, not achievable [8] whereas de.nitions of security for broadcast do require guaranteed output delivery.

the Hirt-Zikas impossibility result for adaptively secure broadcast in the non-atomic communication model says nothing about the feasibility of adaptively secure MPC in that setting.


Our instability proof entails new techniques that greatly simplify the analysis of the FIFO policy, and thus may lead to further improved results.

we develop a technique that enables us to construct adversaries for some acyclic networks, and then compose these networks and adversaries to form a cyclic network and a single adversary, that together show instability.


In our measurement, we focus on the download throughput of web contents replicated by CDN providers.

we identifyalist of contentproviders usingAkamai andLimelight and randomly select a subset of them to retrieve their web contents.AsdescribedinSectionII, aCDNprovidertypically assigns one of the replicated servers to a web client when responding to a DNS lookup.


The reason for this is that the value of max max ep /ep for TCP is smaller than that of IEEE 802.11 (ep /ep is 1.22 for HTTP over TCP with ed = 2272 bytes).

we do not .nd any strong e.ect of RPSP for wireless networks with heavily correlated bit-errors and ed=1460 bytes, which is commonly used as MSS (Maximum Segment Size) in TCP [1].


RSSI is stable and transmissions are quite robust to some environment properties changes.

the PHY layer in the Wavenis nodes is Figure 5: Box plot showing that bidirectional links follow the same distribution (with similar parameter s values robust to interferences because it uses frequency hopping.


We demonstrate thatpeering links between ASes are frequently redundant.

our analysis shows that more than half of the studied ASes pairs are connected through multiple physical links.


The   scenario mean migration intensity synthetic trace(DFS-500) 1.41± 1.61 synthetic trace(SLF)  2.13± 3.38 DNet range 100 3.20± 3.26 DNet range 500 4.38± 4.14 DNet SLF 2.16± 2.81 DNet range 500 with APs 20.88± 14.24 DNet SLF with APs 13.64± 9.30 CabSpotting 24 nodes 4.33± 4.99 Table 4: Migration intensity for various scenarios key quantity we look at when checking suitability is the migration intensity.

the rate at which the system will need to migrate virtual machines in order to run the trace.


At the end of superphase .a+f, q is in region Xj+f, that is, q is located in a segment with index at least (j + f)m - 1.

since q can cross at most 2 segment boundaries during superphase .a+f, it follows that, at the beginning of superphase .a+f (or, equivalently, at the end of superphase .a+f-1) q is located in a segment with index at least (j + f)m - 3 = (j + f-1)m. this means that q is located in region Xj+f-1 at the end of superphase .a+f-1.


Mechanisms are needed to integrate AUVs in underwater networks and to enable communication between sensors and AUVs.

all the information available to sophisticated AUV devices (trajectory, localization) could be exploited to minimize the signaling needed for recon.gurations.


These new RLT constraints are derived from the intervals of the original variables.


The reason we do this instead of obtaining a simple mean of Wmax values is because throughput is related to Wf quadratically (since it is the area under the curve in the 25 25  to the sender.

this duration can be approx imated by the average link delay with a full bu.er, T + 20  20  B/µ =tR.


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

cS-WFQ is defined as a STFQ based system as described in (9) where the fair shares {¢i}i~ are time varying and defined as of redundancy, while a negative ACK should lead to increas- ing the FEC code rate, provided that the estimated value ¢i if Ci(t) > C th Ci(t) C/(1 + a(t)) remains above the threshold C{~h ¢~(t) =/i(t)¢~ = (10) ¢i otherwise.


For example, in security-critical environments (e.g., in a .nancial institution), it is required that packets traverse certain checkpoints, for instance, an access control function (implemented by e.g., a middlebox [12], an SDN match-action switch [7], or an NFV function [3]), before entering a protected network domain.

in order to prevent a bad packet from entering a protected domain, not only the old policy p1 as well as the new policy p2 must ensure WPE, but also any other transient con.guration or policy combination that may arise during the network update.


Fig.9 demonstrates that, while both NORM and LOW are .awed, SWIFT can deliver on the fundamental goal of simultaneously achieving the high throughput and wide range of NORM, while being as narrowband friendly as LOW.

we see that: Throughput and range of LOW are limited: Fig.


3.1 System Model We study a network where mobile nodes are autonomous entities equipped with WiFi or Bluetooth-enabled devices that communicate with each other upon coming in range.

we describe a pervasive communication system (a mobile ad hoc network) such as a vehicular network [31], digital certi.cate validates the signature authenticity.


When PDUs are dequeued, the queue can check .rst the subqueue with the ARQ feedbacks, then the subqueue with retransmissions, and only then the subqueue with normal PDUs.

a connection queue implements internally the strict priority queuing.


This paper is focused on the first two phases, namely, suitability determination and creation of opportunistic networks in terms of finding suitable spectrum for the opportunistic network.

we consider the different techniques for obtaining spectrum availability information and how the selection between the techniques could be done in a practical and cost-efficient way.


Just like the traditional transparent HTTP proxies, in-network cache for HTTP protocol should be transparent to the end-systems.

hTTP requests are sent to the origin servers, and the innetwork cache is e.ective only on the HTTP responses.


4.2 Packet Latency Keeping the insights from the previous section in mind, we can now bound the expected time that a packet spends in the network between the time of injection and reaching its .nal destination (latency).

we show that for each packet with a path length d, the expected latency is O(d · T ).


The ciphertext simulator has a completely di.erent interface from the honest encryption oracle.

it expects the plaintext when being asked for the secret key, while the encryption oracle would expect these upon encryption.


First assume that the = in condition (21) holds.

q(np)loglog(np) (s) 1-(22) log(np) Consider the set of interior crossing lines I.Leas de.ned in the proof of Lemma 6.2.


We de.ne two parame t tt 22 2 ters .A, .B = 1 as v = .A v and v = ii i .B B vi 2 .

.A and .B represent the proportion of the intersection part respectively in set A and set t AnB AAnB B.


ALL-ANONYMOUS NTDP Although our sink-anonymous NTDP hides the location and the identity of the sink during topology discovery, it does not preserve the secrecy of the network topology.

it discloses the identities and the locations of all the nodes including the sink albeit without specifying its special role.


Let us note that traditional multimedia applications developed for the fixed Internet assume that only sporadic packet losses occur, i.e., only during network congestion/failure, and do not consider the possibility to change the communication channel during streaming provisioning.

frequent and potentially long packet losses can cause client side re-buffering, which results in possible playback discontinuities, while connectivity change imposes service restart.


We characterize the connectivity of pre.xes originated from customers of a large tier-1 ISP.

we examine how the ISP s customers advertise their pre.xes to it.


Within category (2), Collaborative Streaming among Mobiles (COSMOS) [9] is based on the idea that a node will rebroadcast a packet if a large portion of its neighbors have not received that packet.

a node calculates the ratio of the number of its neighbors that will benefit from its rebroadcast of a packet versus the total number of its neighbors.


The main di.erence between this extended counting algorithm and its more basic counterpart is that having disjunctions of .lters allows us to use the set of matched interfaces to shortcut the evaluation of the .lters.

we can eliminate a lookup in the table of counters for all the .lters linked to an interface that has already been matched.


This path P need not be time-out free in itself, because all of its nodes will be suf.ciently far away from x, and hence not time out during the interval [s ' ,t ' ).

we can simply invoke Theorem 2.1 for the existence of the path once we have ensured that the interval [s ' ,t ' )is long enough.


the smallest 802.11 frame transmitted at the highest rate).

vehicle Arrival Rate We assume that the vehicle arrival process is Bernoulli with parameter p. with probability p,a vehicle will enter range of the AP during one time interval (one slot) and with probability (1 -p) no vehicle will enter range during that slot.


i .i).i C)y (1) To identify the best hypothesis from our set of potential anomalies, we choose the hypothesis that explains the largest amount of residual traf.c.

we choose the Fi that minimizes the projection of yi * onto S .


7 depicts the con.ict ratios when L varies from 16 to 56 with corresponding optimal H. From the .gure, we see that the con.ict ratio is generally not high, i.e., < 9%.

when L is larger than 40, the con.ict ratio is smaller than 0.1%.


Therefore, in this paper, we explore how a homogeneous SDR architecture is used for ef.cient realization and execution of Medium Access Control (MAC) protocols.

we investigate the performance of two broad classes of MAC schemes on the Platform 2012 (P2012) many-core programmable computing fabric.


All users channel supplies and demands, including the ask and bid prices, channel quantity, bandwidth, starting time, and ending time, are randomly and uniformly chosen within certain ranges listed in Table 2.

the value of the maximum bid is changed from 3 to 8 at a step size of 1 sidered by the buyers in the auction.


The SCTP module [4] as well as our CMT-SCTPimprovementare also compatible withtheTCPDump and ExtInterface modules.

we have intensively used the SCTP packet trace analysis functionalities of Wireshark during development and debugging.


For example, if the initiator is using a path of two pawns, it will select the .rst pawn group G1 and then select a second pawn group G2 without replacement.

we are careful not to select G2 = so to ensure that the same key could not be G1 used to open both layers of encryption and see the message.


Then,by utilizing a rounding method we obtain an e.cient integral association.

we provide a 2-approximation algorithm for unweighted greedy users and a 3-approximation algorithm for weighted and bounded-demand users.


Each WLAN may be configured as ad hoc or AP-based, but in either case no control is exerted over the stations by any administrative entity.

no multi-WLAN mechanism relies on, or attempts to trace, the stations' identities--the stations are as good as anonymous (this assumption strengthens the model and makes it insensitive to spoofing or Sybil attacks [4]).


An important issue for future communication systems is quality provisioning relatively to multimedia applications, which often have demanding requirements.

video packets have stringent deadlines and are prone to packet losses [5].


Using these two estimates, we propose a hybrid system that attains the increased stability region of the universal swarm, while also ensuring that the so journ times remain small for a wide range values of L. The hybrid system alternates between the autonomous mode, whereby swarms operate in isolation while sharing a U/L portion of the seed s capacity, and the universal mode, where swarms are bundled together.

consider a system with L swarms, each requesting a .le of k = K/L pieces.


CSMA/CA (collision avoidance) mechanism is incorporated in DCF -a similar mechanism is also used in the proposed protocol.

when a node i wishes to transmit a packet, it chooses a "backoff" interval equal to Bi slots3 Bi is cho- sen uniformly distributed in the interval [0, cw], where cw is size of the so-called contention window, cw at node i is reset to a value CWmi, at the beginning of time, and after each successful transmission of a data packet by node i.


Most striking is the response time performance achieved under PI and REM with ECN at loads of 90% and 98%.

at 90% load response time performance surprisingly approximates that achieved on an uncongested network.


Under the circumstances, both ends using half the calculated sleep period is a fair way to share the possible sleep times between both ends and ensure packet meet their playout deadlines.

if one end calculates its sleep period as .


In this section, we no longer make this assumption and instead examine minProbe under bursty cross tra.c.

we evaluate minProbe using modeled synthetic bursty tra.c (CBR2) and realistic Internet traces.


IPv6 allows us to look at mobility management in an entirely new perspective and it would be most desirable to exploit the fundamental features of IPv6 such as hierarchical addressing, large address space, etc.

the solution must at least be able to utilize the huge address space provided by IPv6, which was the fundamental design goal of IPv6.


5.3 Parameter Evaluation Theparameters ofMembersOnlydetermineboththepropagation speed and resiliency to attack.

there is an interesting interplay between a and t, which was explored in the analysis from Section 4.


First, this document contains valuable information for those with the task of evaluating new services through emulation.

we take the perspective of services that expect a significant amount of clients, due to the current interest in them and their high resources demand.


(14) P Figure 5(b) shows the underwater packet ef.ciency .P when the packet payload size LD varies, for different distances (100 m and P 500 m).

for a volume with an average node distance of 100 m, the highest packet ef.ciency (.


It allows us to characterize (either directly or with suitable bounds) the average throughput in a robust manner, because the throughput characteristics depend on the tra.c only through the average tra.c load on each route.

no additional information is required about the tra.c to account for the .ow-level QoS requirements than what is already necessary for basic dimensioning.


A relay picks the next token holder among neighbors, which are closer to source (comparing to the relay), and selects the furthest one.

all neighbors whose ETXs (to source) are smaller than that of the relay are considered to be candidates, and pick the one with the highest ETX (to source).


Here, we develop a simple, yet illustrative model of TCP throughput under such a scenario.

we consider a counter-DoS 012345 50 100 150 200 250 300 350 400 450 Peak Rate (Mb/s) Peak Length (ms) Figure 16: Detecting DoS streams strategy in which TCP senders randomize their minRTO parameters according to a uniform distribution in the range [a,b].


Q |gi|2N0pi +(|hi|2pR+ N0) ·|gj |2pj + N0 j=1,j =i (2) In general, the utility function is increasing and concave in the receive SINR [6].

we adopt in the sequel the 2This assumption is imposed only for the convenience of notation, as in [15], and can be relaxed without a.ecting the analysis in this paper.


This is however misleading because aligning a signal at one receiver limits the ability of the transmitter to freely align it at a second receiver.

every alignment imposes new constraints on the encoding vectors at the transmitter.


The topology exploration algorithm takes care to report the topology of the network as accurately as possible.

the exploration of the topology is serialized.


The only explanation is that nodes are unable to receive packets as well in the presence of interfering traf.c.

the interference traf.c jams receivers along the ADMR path and prevents them from correctly decoding incoming messages.


Low power consumption is another critical requirement for a power meter due to the limited energy resource of sensor nodes.

many system issues are di.cult to diagnose without long term power monitoring at a high sampling rate.


If no major topology changes or no remarkable distance changes, no update will be performed until some pre-set timer expires.

we perform our algorithm periodically with a pre-set time.


3.3 In-.ight IPNL Address Resolution When a host initiates a connection, it only knows three addresses: 1. its own FQDN, 2. its own EHIP, and 3. the FQDN of the destination.


Rdenotes the radius of graph Gwith respect to s,which is equivalent to the height of the BFS tree.

then, an MIS U is formed induced by a non-decreasing order of depth of nodes in TBF S. the nodes are considered for inclusion in U based Layer i - 1 Layer i Layer i +1 Figure 4: Scheduling broadcast in layer i on a non-decreasing order of depth in the BFS tree.


At any point in time, the entire P-processor machine is dedicated to rendering a particular volume.

here we assume the pipeline effect is ignored.


In addition, the VANET environment implements a car-following model together with random cruise speed and several vehicles classes, selected according to empirical data.

in this paper we want to stress a situation where the tra.c is very congested because of the accident that our application aims to stream to the emergency vehicles.


Also, if T is of type nonce, ske, enc, garbage, skse, symenc then T must have been constructed by the adversary.

a term is adversarially well-constructed if the adversary knows how to construct this term from the terms that the analysis has found him to know.


We thus leverage program semantics to ef.ciently search the space.

we use symbolic execution, a static program analysis technique, of the protocol implementation to determine the set of packets that may induce honest participants to execute actions of interest, as a function of their current state.


Dual stack (IPv6/IPv4) hosts and routers can tunnel IPv6 packets over regions of IPv4 routing topology by encapsulating them within IPv4 packets.

the IPv6 packet is embedded in the payload portion of an IPv4 packet with protocol type 41.


Note that we use {STi , x, PTj } to represent an induced path derived from STi and PTj with x being the switching point.

the induced path {STi , x, PTj } contains the subpath from S to x in STi and the subpath from x to T in PTj .


Clearly, obtaining dij for all n nodes requires O(n2) measurements.3 However, we note that these O(n2) measurements do not have to be announced or be continuously monitored.

each node needs to monitor and send updates only for the k links that it chooses to establish, with O(n) measurements to all nodes in the overlaydone muchless frequently namely once per wiring epoch, which is de.ned as the period T between two successive evaluations by a node of its set of candidate links andpossible adoption of a new wiring(i.e., re-wiring) based on such evaluation.


Figure 4(middle) (for p set at 100% and cache size 10) we see that the popularity influences the benefit.

as a increases, the most popular files make up most of the requests and end up being in the cache of the content router, yielding less gain from network coding.


RELATED WORK Wireless sensor networks have attracted a plethora of research efforts due to their vast potential applications [7].

extensive research work has been devoted to providing energy efficient routing algorithms for data gathering [8-12].


These two kinds of networks behave di.erently as far as IP multicast is concerned.

when using Protocol Independent Multicast (Pim) as a routing protocol in a broadcast network, each router is a Pim neighbor of each other, and only one of them is elected as the querier [21].


The system utilization f decreases if the capacity µ increases or any user population mi decreases.


Representative work dealing with 802.11 fairness in various contexts, but without involving results from actual testbed experimentation, is contained in [14, 16, 8, 19, 15, 9, 20].

the work in [14] considers weighted fairness, where bandwidth is shared in proportion to weights.


It is also worth considering how to reduce materials within individual devices.

it should be possible for a user to buy a device whose modular design allows customization, so that only the specific hardware and software required by the user is included.


Note that, given a .xed Ttime , the MAC cannot retransmit a failed packet multiple times.

t 2-Fair overwrites the default 4-7 retransmission attempts carried out by the MAC in standard IEEE 802.11 systems.


Hence, it is even more unlikely that the shape of the potential surface changes faster than it takes for a packet (containing queue length information) to traverse a sub-domain (on an average).

it is very improbable that the traf.c potential .eld computed using (possibly stale) queue length information at a node would be signi.cantly different from the .eld computed with the latest queue length information.


WISEuses the CBN to mitigate this problem.

because when conditioned on its parents, a variable is independent of all variables except its descendants, we can use only the parents of the target variable in the regression function.


For di.erent experiments we used a variety of hardware to simultaneously connect multiple interfaces to the same or di.erent operator s networks.

we used three PCMCIA Sierra Wireless cards with 4+1 slots (4 downlink GSM slots, and 1 uplink), and two Motorola Phones (Motorola T260 Phone, 3+1 handset) that were connected through serial-line interfaces to the router.


If n n RSS= S , the mobile node adds WLAN to the n, prediction 2 n candidate list of vertical handoff; otherwise, it stays at the original state.

the predictive RSS from WLAN is increasing and n exceeds the state change threshold of S2 .


(23) d · µ · (µ - 2d · <(r)) 6.1.3 Simpli.ed Aloha approximation For simplicity let us next assume a basic Aloha MAC with .xed size packets and without any collision avoidance mechanisms.

each station tries to send a packet after an exponentially distributed interval and a packet is succesfully transmitted if no other transmission overlaps with the given transmission within the corresponding proximity.


we de.ne ui(pI, qI) as AP i s utility when it uses TP I, which depends on the service quality qI and the per unit traf.c charge pI.


Second, the gains in terms of QoE are usually large in the low rates, so the encoding of a large number of representations at low rates is valuable because a small increase of the link capacity at the client side can result in a signi.cant QoE gain.

the interval between two consecutive representations should be small at low rates and high for high rates.


A potential issue with this result is that while we show that the malicious users have to pay enough to signi.cantly o.set the damage they cause, it is nevertheless true that In any such game, Lben Lopt > 34 , and this bound is tight, in their payments go to the network operators, and not directly that for all E su.ciently small, there is always a game to the victims of the attack.

this distinction might not Lben with Lopt = 34 + E.for all n> 1,there always be signi.cant for instance, in the simple case of is always a game Benignopt with n benign players for n Lben 3n-4 which = .


An unsolved problem is how to protect servers from load swings when route preferences suddenly change: a DNS question becomes a routing challenge.

the analysis we present here extends work on measurement, performance and placement of DNS root servers [1] [1] [2] discuss the ubiquity of DNS miscon.guration in queries at the root servers.


Going further, Figure 4(c) shows the cumulative number of changes for a pair (i, j)for the year of 2011.

value at row i and column j of the heat map represents the fraction of changes corresponding to the i pre.xes and j ASes with most changes in the dataset.


The number of messages suppressed (left-hand graph) is only somewhat dependent on Tm with the large redundant threshold, many messages are suppressed (especially when Tm is small) even though they conceptually could be merged.

(as one might expect, dropping a message takes priority over merging one.)


Therefore, the handoff only involves network prefix BUs to MAPHMR s HA and all HAs of HMRs in this nested mobile network.

the moved MAPHMR will send network prefix BUs to it s HA as well as all HAs in the CNTable to update the binding of its network prefix to the new LCoA.


For distances in the order of a few millimeters, which is expectedly the transmission range of nano-devices, the use of low-weight channel codes can clearly improve the CER.

for very high node-densities, the improvement can be up to 150%.


Note that the only parts of an ESP packet that are modi.ed by processing en route are the instruction operands and the control bits (Loc, Err, etc).

the IP header is not changed; thus packets cannot be diverted from their original path.


First, if the simulator is accurate enough, controllers that transfer well can be created simply by evolving them to be robust.

if sensor values and actuator responses frequently vary in simulation, the resulting controllers will be robust against small discrepancies between simulation and reality as well [12, 13].


Yet, each node should reach a certain node number (k) in spite of the other part should be obliged to handshake the link.

we assure that each node would have an out physical node connectivity degree [3] equal to k. We also eliminated the collision problem synchronizing in time the sensor node transmission.


Then, the cycle_length is defined as .T K .where ..is the ceiling function.

the cycle_length is the size of a broadcast cycle.


unique home network prefix is assigned to each MN because PMIPv6 only supports the per-MN prefix model.

a MN always obtains its unique home address when roaming within a PMIPv6 domain,.


Our model lifts network scalability research into the realm we believe it naturally belongs to: informationtheory.

the model allows to reason about the scalability of general graph families or particular networks through analyzing the entropy of certain strings arising as forwarding tables at network nodes.


So the number of nodes that should forward is equal to the number of non-leaf nodes in the multicast tree.

the prob- lem of minimizing the number of packet forwarding is equivalent to the problem of finding the multicast tree that minimizes the number of non-leaf nodes.


In the .rst approximation, instead of calculating and storing a separate traf.c fanout for every instant in time during a trace, we create one fanout for every 20minute period.

we aggregate all the packets received in every 20 minute window and calculate the traf.c fanout due to those packets.


Let optG denote the value of an optimal solution over pure strategies assuming that all the injection rates ri are increased by a factor of G. Then, the bicriteria ratio R is de.ned to be the smallest G satisfying C = optG over all Nash equilibria.

the bicriteria ratio describes how many times the injected rates (the amount of traf.c in the system) must be decreased so that the worst-case cost in Nash equilibrium cannot exceed the optimal cost for the original rates.


We show, however, that the particular structure of this interference can be used to convert the modulation into a more complicated, but still decodable, form.

by folding the subcarriers on top of each other, we decode frames transmitted with a form of QAM as if they were encoded with a more dense QAM modulation.


This paper reviews how SDN can play a major role in implementing the network security functions like access control, network monitoring or middlebox deployment.

most of these approaches rely on OpenFlow which obtains a strong interest from the community after being initially proposed in 2008 [9].


However, the other node might in general be further away from t than the node where the next face exploration was started.

gPVFR might start at a node which is not located closer to t and we can not prove delivery guarantees following the idea of the proof for Theorem 3.


These allow, in normal network conditions, to narrow the gap between the priority classes.

aMPA decreases the differentiation between the traffic classes.


INFORMATION SHARING IN IEEE 802.11 In this section, after brie.y reviewing the IEEE 802.11 Distributed Coordination Function (DCF) protocol (see [7] for further details), we study the role of information sharing in the protocol s ability to provide a FIFO-like service.

we present two topologies in which IEEE 802.11 obtains severe performance degradations, in one case due to asymmetry of information, and in the latter, due to perceived collisions .


When a reader transmits seed Ri in its i-th frame, it does not generate Ri on itsown,ratheritusesthe i-th seed Ri issued by the central controller.

each reader generates the same sequence of nop seeds.


(m + k)|Q(m)] + 2T E. k=1 To obtain (12), we have used the fact that the weight of the maximum weight matching can be reduced by at most n per time-slot in the worst case.

w * (m + k) = W * (m) - nk, unconditionally.


In addition, we exploit the fact that many RIPE and AP-NIC records provide an additional source of administrativepertinent e-mail addresses in the changed and notify .elds.

we retain the e-mail addresses in all notify .elds and the most recent changed .elds, providing e-mail coverage in spite of missing point-of-contact records.


In this paper, we study whether attributes relating to the cellular network conditions measured athandsets can accuratelypredict hando.s.

we develop a machine learning framework topredicthando.sin the nearfuture.


DISCUSSION 6.1 Preserving similarity to the original input Replayer is designed to soundly address the problem formulation given in Section 2.

replayer produces an input iv that will replay and reach the desired .nal state satisfying the desired post-condition.


Session Level Techniques for Improving Web Browsing Performance on Wireless Links Pablo Rodriguez Sarit Mukherjee Sampath Rangarajan Microsoft Research Bell Laboratories Bell Laboratories Cambridge, UK Holmdel, NJ Holmdel, NJ pablo@microsoft.com sarit@bell-labs.com sampath@bell-labs.com ABSTRACT Recent observations through experiments that we have performed in current third generation wireless networks have revealed that the achieved throughput over wireless links varies widely depending on the application.

the throughput achieved by .le transfer application (FTP) and web browsing application (HTTP) are quite different.


Oceanographic parameters were sampled usinga thermistor chain and an acoustic Doppler current pro.ler, both located close to the VA.

the thermistor chain was designed for .ner sampling in the mixed layer (i.e., at low depth) rather than in the lower layers, in order to better track temperature changes between 10 and 40m of depth.


We observe that after transforming the channels across all the 64 subcarriers to the time domain, there are only few taps with a noticeable amplitude.

we empirically measure the amplitude of time-domain taps in the OFDM FFT window in our testbed.


We then present a preliminary evaluation of a subset of these solutions (3GPP IFOM [7], Multipath TCP and application layer) which are deployable in today s mobile networks.

we focus on potential overhead (in terms of signaling) with respect to di.erent classes of tra.c.


We focus on building general, simple intent models.

we believe that the concept of economic incentive can be used to model attacker intent in a general way.


Sampling is an alternative to either push-based or pullbased collection (see §3.2.2).

the sFlow protocol [42] allows a switch to report the headers of randomly chosen packets to a monitoring node which could be the OpenFlow controller.


The key property regarding isolated broadcast functions is that they are independent.

the behavior of one function provided a randomly generated support sequence is independent of the behavior of another function provided a di.erent randomly generated support sequence.


The aim of the two networks are di.erent in that 7DS has as its primary goal providing data connectivity to mobile hosts while PeopleNet aims to provide a mechanism for information search and access through a wireless virtual social network.

7DS provides access to existing electronic resources while PeopleNet taps into both existing electronic resources and virtual resources residing in people themselves.


We validate all the models and the prototypeof SIMULWATCH using the real traces.

we show that SIMULWATCH can estimate the unicast and multicast traf.c accurately, proving itself as a useful tool in driving the performancestudy in IPTV systems.


Further, RSSI changes rapidly within the range of 0 to 4m.

the same RSSI variation leads to a larger distance variation when the distance between two motes is larger than 4m.


Finally, we perform an extensive simulation study to evaluate OAR in realistic scenarios and to isolate the performance factors that determine OAR s throughput gains.

westudy theroleof nodedensity, node velocity, channel conditions, node location distributions, network topology, and interactions with TCP.


At the heart of our simulator lies a preferential installation process, accordingto which usersthathave already several applicationsinstalledare morelikelytoinstalleven more new applications.


taken by the protocol for command issue as Tpc.

within this time, all nodes in the network would have learnt of any command issued by the head node.


Unlike Wi-Fi, WiMAX shares the channel bandwidth equally among the  GPRS Protocol 1997 Date 0.8 Table 3: 3GPP standards Data rate (Mbps) Frequency (MHz) EDGE 2003 0.15 UMTS 2005 2 850 /900 /1700 /1900 /2100 HDSPA 2007 7.2 LTE 2010 > 100  Figure 2: UMTS simulation framework Throughput (Mbps) 25 20 15 10 5 0  Number of User Equipments Ciclix Prefix Figure 3: Wi-Fi maximum experimental throughput Figure 4: WiMAX maximum experimental throughput varying modulation and cyclix pre.x nodes due to its multiplexing feature.

we .nd that everyWiMAX node receives the same bandwidth share.


This graph model has traditionally been used assuming a collision channel [1], which we also call the oneto-one communication assumption.

two nodes can communicate directly if they are within a distance d(n), and the transmission from node Xi to node Xj is successful only if there is no other transmitter within distance (1+.


This group contains four features measuring the similarity of sender IP pre.xes and email addresses, and the similarity of the sender names.

we split the email domain address into two parts: the email pre.x and the email su.x.


Tolerances in these components give rise to identi.able characteristics in the waveform and modulation errors.

prior workhas examinedstartup transientsin the waveform, carrier frequency o.set, in-phase and quadrature (I/Q)o.sets, preamble modulation quality, and quadrature phase-shiftkeying(QPSK) modulation errors.


We have also measured the scheduling overhead in the experiments.

we con.gure the tradeoff scheduler for strict fair queueing by setting a = 1.


Inthispaper,wedesignaparadigmnamed SAILOR (simple, application-independent data lockers) to provide a shared in-network storage infrastructure for effective integration with largescale, end-to-end content distribution applications.

sAILOR provides end users and/or content publishers in-network data locker accounts.


On the downlink (i.e., from the switch to the N links), the merge network needs to be able to forward packets from any of the K switch ports to any of the N downlinks and be able to forward up to K downlinks simultaneously.

an important requirement of the merge network is that it operate entirely in the analog domain.the merge network in no sense receives packets.


On the other hand, the cognitive wireless device part including RF and media access control performs radio sensing, RX/TX, digital signaling process, and media control in each layer of 1 and 2, and interacts with the operating system.

the cognitive wireless device part are also categorized into several domains from the viewpoints of transmission power, utilization image, and media access control as shown in Table 1.


The mobility period is the product of the frame periods per second multiplied by the cell crossing time and rounded up so that it is an integral frame period.

movements take place at time instants that are integer multiples of the frame period (where of course the frame period depends on N).


LINK ASYMMETRY Several research groups [15, 11, 9] have independently observed asymmetric wireless link behavior.

several instances of asymmetric packet delivery rate have been observed, i.e.


For online analysis in real-time, we also monitor tra.c at individual DNS servers and on an individual workstation.

the tra.c is observed within the end host, either the DNS server or client host, at its network interface.


User perseverance: Perseverance of a user is de.ned as the average of the persistences of all his/her P ties.

pi =1/Ki * j Pij , where Pi is the perseverance of user i, Ki is i s degree (number of neighbors), and Pij is the persistence of tie eij as de.ned above.


The following inferences can be observed from the distribution of Ot: -SinceOT isdiscretenormal with mean1,theprobability of downloading the entire .le within the expected completion time is 0.50.

half of the downloaders complete within the expected time, while the other half does not.


We focus on the state management and the signaling transport mechanisms of the NTLP protocol in Triangle Routing and Route Optimization scenarios.

we also propose a cross layer signaling flow of our extensions in typical NSIS deployment models.


Once we obtain the underestimator u,we use it to bias our search for the global minimum of f(·).

we obtain new samples of local minima such that areas close to the underestimator s minimum have higher probability of being sampled while areas far away are removed from the search region.


EVALUATION OF UPDATE TIMES A Bloom Filter [6] is a data structure conceived to e.ciently perform membership queries on a large data set.

using an array of m bits, all initially set to 0, we can map each item to the corresponding footprint , i.e., every ID is hashed using k di.erent hash functions to obtain the positions of the k bits that will be set to 1.


SIMULATIONS Simulations con.rm our theoretical analysis as to how connectivity is a.ected by faults in robustly linked networks.

they show that even with relatively high link failure probabilities, thin strips of a few dozen nodes can maintain good connectivity at extremely long ranges (millions of hops).


Since the original SOTA router RTL is ASIC-oriented and was thus not optimized for FPGA synthesis, to make the comparison more fair, we modi.ed the SOTA router RTL by applying RTL coding discipline suitable for FPGA synthesis.

our changes only a.ect storage elements; we ensured that all register .les properly mapped to Distributed RAM, instead of discrete registers or Block RAM.


We model probe traf.c as a (strictly) stationary point process P of intensity .P .

a sample path of the process is simply the set of times {Tn} at which the (zero sized) probes arrive, and there exists a probability law PP that determines the probability of any event concerning sample paths.


We are interested in keys whose signals differ dramatically in size when taken over the .rst chunk versus the second chunk.

for a given percentage ¢,a keyis a heavy change key if the difference in its signal exceeds ¢percent of the total change over all keys.


SDR-based Passive Indoor Localization System for GSM Islam Alyafawi, Desislava C. Dimitrova and Torsten Braun University of Bern, Communication and Distributed Systems (CDS), Bern, Switzerland {alyafawi, dimitrova, braun}@iam.unibe.ch ABSTRACT This study deals with indoor positioning using GSM radio, which has the distinct advantage of wide coverage over other wireless technologies.

we focus on passive localization systems that are able to achieve high localization accuracy without any prior knowledge of the indoor environment or the tracking device radio settings.


For example, we could have two re.ections that are spaced 1ns apart (or 1 foot apart 2 in distance), but with a radio with a typical sampling rate of 40Msps, two consecutive digital samples themselves are spaced 25ns apart.

we have to get time resolution of much smaller values than even what our sampling itself can provide.


Speci.cally, if the service ratesofclass-k .ows in cell i are always Ci,A(k), then the cell in isolation behaves as a standard multi-class Processor-Sharing system with load .i,A = Ki .i,A(k), where k=1 .i(k)s .i,A(k)= .

ci,A(k) the reference system is stable if and only if .i,A < 1, in which case the stationary distribution of the number of active .ows of the various classes is given by Ki Ki p(m1,...,mKi )=(1-.i,A)k=1 mk .i,A(k)mk .


With this motivation in mind, our work takes a step in this direction.

our analysis focuses onproviding abound ontheperformance of apopular robustpositioning algorithm[SLR02] when appliedtosensor localization from only connectivity information, which is a highly challenging problem.


SYSTEM MODEL Using the traditional terminology employed by the security community, we consider three di.erent agents: Alice, Bob and Eve.

alice is the legitimate transmitter who starts the communication,Bobis thelegitimate receiver for whom the transmission is intended and Eve is the adversary who transmits toward Bob with the aim of impersonating Alice.


Further, it simplifies error detection since a simple request-acknowledge protocol can be used: If an acknowledgment packet has not been received a fixed amount of time after the request packet was sent, a transmission error occurred.

while similar protocols have to cope with variable, possibly unbound delays and variable numbers of outstanding packets, the protocol for Clint can rely on bounded delays and a fixed number of outstanding packets.


For example, if the objective is to achieve rapid network application deployment (e.g., dynamic addition/removal of servers), then the solution is likely to be software based, without involving hardware rearrangement.

the capabilities of network devices in.uence what transformation techniques may be used.


We are currently conducting study to evaluate the scalability of this approach.

we want to answer questions like,to emulate an ad-hoc network of certain size and certain density,what are the bandwidth requirements for the testbed network.


For rectangular belts Bs, this issue can be addressed as follows.

let Bsbe the belt region [0,s]x[0,1/s].B1is the Bswith s1.Let L1be the set of all crossing paths in B1.For each crossing path lEL1,de.ne ls{(x*s,y*1/s):(x,y)El},which is a crossing path in Bsnaturally corresponding to l. Now, (1) can be more precisely stated as VlEL1:limPr[Bsisk-barrieroveredmodulols]1. s-o For non-rectangular belts Bs, the issue can be addressed similarly by introducing a natural one-one mapping between B1 (the Bswith s1)and Bs.


Figure 5 shows that the IR was 60 in the Lw and 35 in the Lwo when LR=6.0 while the Lno had an IR of 30.

the IR of the Lw was approximately twice as large as that of the Lwo.


THE PORT-SORTING ALGORITHM In this section, we present the Port-Sorting algorithm that obtains an optimal solution for the MC-PDA problem.

we show that our algorithm activates the minimal number of components at every time instant.


Introduction Recent developments in wide-area wireless technologies (such as the IEEE 802.16 standard [6]) have led to considerable interest in the construction of multi-hop wireless mesh networks.

such networks are being proposed and studied as an enabling technology for multiple applications such as machine-to-machine (M2M) com- Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for pro.t or commercial advantage and that copies bear this notice and the full citation on the .rst page.


The goal of this work is to explore the role technology can play in alleviating some of the burden placed on social workers and parasocial workers who are attempting to serve the millions of orphans and vulnerable children (OVC) across Tanzania [1].

we explore the use of SMS (Short Message Service Permission to make digital or hard copies of all or part of this work for or text messaging) to improve the cost, regularity, and timeliness personal or classroom use is granted without fee provided that copies are of reporting data to the relevant government database so that not made or distributed for profit or commercial advantage and that resource distribution can be better informed and services provided copies bear this notice and the full citation on the first page.


The main drawback of active measurements is that results can heavily depend on the nature of the input we inject in the network.

we have to .nd a set of queries that are representative enough to give us an accurate picture of the network.


2.3 Static Scatternet Construction Given nnodes currently distributed in the network, the section gives an ef.cient algorithm to construct our de Bruijn based scatternet dBBlue, which has low diameter and bounded node degree property.

we .rst study the construction of the scatternet for a static n-nodes network, which will serve the base for our dynamic construction.


One is in how TCP reacts to the increased delays introduced by Juggler.

the .uctuations in the perceived round trip time cause TCP to change the rate of transmission for a long-lived transfer.


Afterwards, the information of the discovered topology and the proximity between the peer to receive or produce similar events is used to build an event routing overlay.

we have proposed different core selection strategies (exploiting global and local knowledge) to facilitate the construction of a communication e.cient event routing overlay on top of TDO.


Each goal G contains information useful for next peer selection.

it represents an arc in the network topology, starting from an already queried peer and going to a destination (and still unvisited) one.


Consequently, if each fi is shiftedbyanoffset d between the two time windows, then a is also shifted by the same value d between them.

any accumulation of drift d between the two intervals effectively results in a shift of precisely d between the two multipath pro.les.


Unfortunately, the group subscription mechanism also offers to receivers an opportunity to elicit self-bene.cial bandwidth allocations.

a misbehaving receiver can ignore subscription guidelines and raise its subscription unfairly.


networks simultaneously to realize a high data-rate wireless link and hence cater to applications requiring high bandwidths?


For a simple(monotone)payo.speci.cation, anexactpotentialis provided, any of whose maximizers is a pure-strategy equilibrium.

strategies become sequences of singletons:forapeerastrategyspeci.es,for any(perstage) contentdistribution overthe wholepopulation, whoto send arequestfor additionalcontent.


To model attacker motivations in a more realistic way, we incorporate constraints in our attack objective model.

we classify constraints into two categories: cost constraints and non-cost constraints.


To validate the relevance of such approach, we corroborated numerical results by simulations, which is very seldom done in this research area.

even with realistic conditions and real protocols, do the results obtained numerically keep on holding?


If it is not empty, the system will deal with the packets from the high priority queue whether the low priority queue has packets or not.

routing messages is offered to low time delay by ERTS algorithm that is included in resource scheduling of MAC layer.


His work brie.y presents the main features of each wireless technology, and the di.erences among them.

the author presents a theoretical comparative analysis, but no performance analysis is provided.


In [5], the authors consider that the residual bandwidth of a link is given, Residual bandwidth = link capacity * (1-U), where U is utilization vector.

the product of the link capacity by one minus the link utilization factor.