(2) Dipartimento di Elettronica, Informatica e Sistemistica Università di Bologna Viale Risorgimento, 2 -40136 Bologna Italy {pbellavista, lfoschini}@deis.unibo.it users are willing to have ubiquitous and continuous access to both traditional and novel context-aware Internet services while they move in smart spaces, such as smart museums or airports.

novel context-aware services should be aware of all the possibilities offered by each wireless technology and their respective limitations.


We also assume that the sequence of array indices to be incremented is arbitrary.

the probability bounds we derive in this section will apply to any increment sequence.


2) Secrecy: Nothing is learned about the secret exponent a even if k-1 shares of it are disclosed.

data delivered to the responder through proxies in order to compute the initiator s public key will not reveal partial information about secret exponent.


it consists of a SIFS for switching andwait time, and2symbols per co-sender channel estimation.


We .nd the expected cost of node u and the forwarder list of node u based on the expected cost of the neighbors which are already assigned an expected cost.

here we want to choose a subset of neighboring nodes N(u) as a = euvi (1) i=1 Let .


Flexibility Using transmission zone testing has another advantage, namely, that the transmission range is not restricted to be short.

the base station (BS) cell size is not required to be small.


Consequently, the efficiency of channel usage is important in managing the broadcast transmissions.

efficient channel usage helps reduce the overall interference level and in turn impacts on the broadcast reception performance.


The improved performance observed for a single row routing table is due to the fact that the .rst hop under random selection makes little or no progress towards the message destination.

while DHT paths are made up of a series of hops of exponentially decreasing length, the .rst random hop potentially adds a long hop to the path; thus seriously degrading the quality of the overall end-to-end path.


Data aggregation schemes and transmission scheduling algorithms are shown to have signi.cant e.ects on data delivery performance.

we .nd that simple schemes that choose gateways randomly and give equal priority to tra.c in both directions between gateways and the ferry achieve good delivery ratio while utilizing more information about contacts and tra.c load provides certain improvement.


However, this approach produces other challenges in practice.

who should choose which routing plane to use and how?


This lemma implies that the total data that can be sent out from any grid during any time interval t is at most Wa · .t for a constant .. To prove an upper bound on the capacity, we will only consider the grid cells that are disjoint from the disks de.ned by base-stations.

for nodes located inside these gridcells, it cannot reach the base-stations directly and its data has to be relayed by some other nodes to reach the base stations.


4.5 Decoding Phase Decoding is the phase during which a receiver nanomachine retrieves a message from the information molecules that the receiver nanomachine receives.

the retrieved messages could be used to produce new biological molecules, to perform a simple task, or to invoke chemical reactions [21].


Considering broadcasting only, we have less timing constraints.

we do not have to cope with dependent transmissions like Acknowledgement Frames (ACKs) or Request/Clear To Send Frames (RTS/CTS).


Also, to our knowledge, there is no related work on QoS capable NICs and on co-evaluation of QoS-aware routers and NICs.

our design includes a VIA-style NIC that is QoS capable.


Based on sequentially acquired primary RF-power measurements, we derived a sparsity-cognizant PU state tracker that can solve the above regression problem online and in a distributed fashion [1].

we derived a distributed version of the on-line coordinate descent (OCD) least-absolute shrinkage and selection operator (Lasso) algorithm where, at each iteration of the algorithm, consensus is reached on the entry of the unknown vector p(t) that has to be updated.


Althoughthisprotocol achievesthesecuritypropertieswe desire,itis slowbecauseit usespublickey cryptography.

onAP and consumerelectronicshardware,asingle private key decryption can take over 100 milliseconds several orders of magnitude greater than the time required to transmitthe message(see §5).


As the network topology is constructed in a best effort fashion, different topological trees can be constructed depending on the signal strength and the locations of the sensor nodes.

throughout the tests mentioned here, the queries carry the information of the fixed parameters: node id, parent id, temperature and humidity.


Thanks to this additional routing layer, a mobile node is always reachable with its home IP address, even though connected through a foreign network with a completely di.erent address space.

the default Mobile IP routing scheme is called triangular routing: IP datagrams sent to the mobile node are intercepted and routed by home and foreign agents, while datagrams generated by the mobile nodes are routed as common Internet tra.c, .owing directly from the mobile node to the destination.


Therefore, we focus on the LSA traffic in this case study.

we introduce a general methodology and associated pre- dictive model to investigate what the LSA traffic reveals about network topology dynamics and failure modes.


log(ni) gives more weight to the Pcell_i of towers that have been seen more often.

the more samples we have of any tower, the more we trust Cell ul ar 4 3 Id eal vs. 2 Simp l e 1 its estimation.


In other words, TCP Reno induces packet loss in order to obtain information about the available bandwidth(-delay product) of the network.

even when the congestion control mechanism of TCP works perfectly, the TCP sender experiences packet losses in the network at some intervals.


In this game, each unit of overlay routing traf.c .ow travels along the minimum-latency path available to it, where latency is measured with respect to the rest of the .ow; otherwise, this .ow would reroute itself on a path with smaller latency.

all paths in use by an equilibrium .ow have minimum-possible cost.


To a certain degree, we argue that EDR, EED, and EEC metrics are more generic data forwarding metrics, considering both link quality and sleep latency.

eTX and DESS are two special cases of a more generic DSF solution.


4.3 MMSE bit-allocation A third possible bit-allocation strategy is based on the behavior reported in Figure 2 and the analysis carried in [18] for the scalar Gaussian wiretap channel.

it appears clear that the most critical losses in using .nite QAM constellations for secret transmissions are experienced whenever the transmission power exceeds the optimal power allocation reported in [18] and the corresponding secrecy rate starts to decrease.


Some of these events became target of our study.

in our data collection campaign we targeted the following scenarios: 1) Events of national 1http://dl.ubnt.com/src_datasheet.pdf  Frame Ctrl Duration DA SA BSSID Seq Ctl SSID FCS ... ... ff:ff:ff:ff:ff:ff 10:9a:42:42:42:42 ff:ff:ff:ff:ff:ff ... null (Broadcast) ... ... ... ff:ff:ff:ff:ff:ff 10:9a:42:42:42:42 ff:ff:ff:ff:ff:ff ... Free WiFi  ... ... ... ff:ff:ff:ff:ff:ff 10:9a:42:42:42:42 ff:ff:ff:ff:ff:ff ... Home WiFi ... Table 1: Example of Probe Requests sent by device with MAC address 10:9a:42:42:42:42.


F , the transmission delay from the root to each node in T is no bigger than a given threshold Dh > 0.

the delay height of each tree is bounded by Dh.


In general, accurate estimationishard, inpartbecause overhearingprobabilities canchangeat .netimescales[6].However,asshownin§5,highly accurate predictions are unnecessary.

we .nd that directly using the measurements in Table 1 may be good enough and estimatingreceptionfractionsfor eachdeployment maynotbe needed.


This technique thus forces M to either return all the data satisfying the query or risk being caught.

to enable spatial crosscheck, we introduce a gossip phase at the end of each epoch t, in which sensor nodes exchange information about their sensed data before sending them to M. Then each node that has data to submit appends some randomly-chosen received information to its own data buckets and then sends encrypted buckets to M. during the gossip phase of epoch t, each node with data for submission, say Si, broadcasts a gossip message within cell C which contains each of the generated bucket IDs {Vi,j }Yi j=1 with equal probability pb.


Subsequent runs produced comparable results and thus support the conclusion that our algorithm provides random bits.

maurer s test showed the average entropy of our bit-sequences is very close to the value expected for a truly random sequence.


In reality, the switching tables can be more ef.ciently implemented with better data structures.

switching tables may use an aggregated information representation and longest-pre.x lookups or provide a default mapping which is used for all those names that do not have an explicit mapping in their switching state.


{1,...,k},there exists a party a such that .i implies dis(a).

each .1,...,.k determines at least one misbehaving party.


We take Phase 2 to last until time TP 2 TP 1 +2(1 + W * /2)- 6log(g)/g, so that: *-g(Tk-TP1 )6-g(Tk-TP2 ) |ai(Tk)- a |= A0ke= gke.

(31) it is easy to check that given (22), g 6TP 2 = g, which implies that for Tk = TP 2: 6-g(Tk-TP2 )6-g(Tk-TP2 ) .k g ke= gTke = g. (32) Phase 3.


Let the bit-to-subcarrier assignment be that A1 .G1, A2 .G2, A3 .G3, and A4 .G4.

the bits in bit block A1 are assigned to be carried by subcarrier group G1, those in A2 by G2, A3 by G3, and A4 by G4.


It is important to note that the optimal bit rate may differ depending on whether the nodes can exploit correct bytes in partial packets.

if the nodes cannot utilize partial packets, theywill typically maximize their throughput by using a bit-rate at which the vast majority of the packets are received fully correct.


In this paper, we formally explore such theses, by studying individuals incentives in non-cooperativegames.

we focus on the impact of heterogeneous agents on system security in different network structures.


We .nd that PDQ provides signi.cant advantages over existing schemes.

pDQ can reduce by ~30% the average .ow completion time as compared with TCP, RCP and D3; and can support 3× as many concurrent senders as D3 while meeting .ow deadlines.


Tra.c validation needs to accommodate this abnormal but non-malicious behavior.


It is practically infeasible for a CCN router to maintain an up-to-date global knowledge of such mappings considering that applications themselves are constantly evolving and new applications are being developed everyday.

cCN needs to operate e.ciently even in the presence of fake content in router caches.


As previously mentioned, differing from REP, the three approaches are designed blind to the geometric features of networks.

dV-hop targets isotropic networks and suffers large measurement errors in anisotropic networks with holes.


In our analysis, we assume that transmitter i has the highest priority for transmission, and is targeted by all the jammers.

all nodes in the transmitter s recipient list will avoid interfering with the transmitter (we revisit this assumption in Section 9 and consider the case when all nodes have equal priority).


The forwarding of Interest Packets in the actual plane for Algorithm 2 coincides with the forwarding scheme described in (10).

all the Interest Packets for a particular request for a given data object are forwarded on the link with the maximum average VIP .ow rate over a sliding window of size T prior to the arrival time of the Interest Packet for the .rst chunk of the data object.


We conduct experiments that demonstrate the feasibility and practicality of our attacks.

we verify that common US telecommunications carriers provide consumers with su.cient resources to exhaust the capacity of CALEA systems that implement the J-standard s recommended wiretap con.guration.


In this paper, we show how our architecture can proficiently manage mobile game traffic.

this architecture is meant to support online games that require an access to the Internet, in order to reach a game server or other nodes involved in the game session.


To keep the pipeline easy to control and avoid the packet out-of-sequence, each PM will process active node IDs in the strict serial way.

if there is an active node ID currently being processed (some hash tables are therefore occupied), the processing of next active node ID could not be started, even if there are hash tables available to use.


3.2 Security Analysis A compromised (or redeployed) monitee may attack our scheme by adjusting the real transmission power level.

the redeployed monitee uses a power level other than pdata either higher or lower to send regular packets.


The performed experiments concerned both the tra.c generated on clients and destined outside the local mesh cloud and the tra.c between clients associated to di.erent MeshDVBoxes.

we measured the delay and the throughput, and evaluated the behavior of our approach when clients move and change the MeshDVBox they are associated to.


However, here the problem is more challenging, since the network is more dynamic.

in [10] we assumed that clients rarely change their locations, and so the protocols optimized static operation.


EVALUATION 4.1 Similarity estimator In this section the proposed similarity estimator is evaluated using the alarms reported by the twelve con.gurations.

the sensitivity of the similarity estimator to the traf.c granularity is discussed.


One negative aspect associated with the network e.ect can be observed in such applications as chat and social pro.ling sites: users will often choose to utilize a service not based upon its quality, but because the provider has achieved the highest popularity in their social circles.

the connection can be worth more than the platform.


This is a processing-intensive operation.

there is a tradeoff between sensing interval and the accuracy of sensing and the processing cost.


Let us denote the data rate of carrier c for user i in time slot t with r(i, c, t).

user i transmits r(i, c, t) bits in time slot t if carrier c is assigned to it during such a time slot.


Additionally, blindly using diversity even when it is unlikely to o.er bene.ts, rarely hurts performance.

it appears that using the simple diversity scheme we inves tigate is safe across di.erent types of channel conditions.


While the basic Trickles protocol is designed to be entirely stateless, and thereby consume little memory, it can be easily extended to take advantage of server memory when available.

the server host need not discard minisockets and reconstitute the server-side TCB from scratch based on the client continuation.


The question, therefore, is: Convergence: When does the sandwich close?

under what conditions does the message passing algorithm converge?


4.2 Parallel Instances Some may discount this DoS vulnerability as arising from insufficient modelling of the characteristics of wireless networks.

we have assumed that an attacker may intercept messages and possibly interfere with the delivery of messages.


The main problem is that the Radio Network Controllers (RNC) do not have the information about the instantaneous transmitted power of each user, and need to know what the exact number of PtP connections that are equivalent to a single PtM connection is.

the determination of the ideal switching point between multiple DCHs and FACH is essential for the reduction of the transmission power.


The rationale for this is that in the case of switched mrtd a number of ras are left idle, which are utilised under parallel mrtd.

note that the gain from parallel mrtd quickly vanishes in the practically rather likely case where Q exceeds O.


Mobile Agent paradigm exhibits good heterogeneous systems adaptation capabilities and provides user-customized remote setup procedures.

the Mobile Agent paradigm allows network load reduction, dynamic load balancing [23] and asynchronous user-defined task execution [24] [25].


Our scheme is also the .rst to provide guaranteed average case e.cient publishing.

our service ensures that the expected cost of updating the data structures due to a node s movement is bounded as a function of the distance of the movement.


The nodes were considered to be in contact when they were closer to each other than the transmit range.

immediately when two nodes were in reach of each other, a connection was established.


All the links between the machines were operating at the maximum data To establish a baseline for our measurements, we set up static IP routes between these machines to form a chain topology.

a packet from A to D was forwarded via B and C, and a packet from D to A was forwarded via C and B.


In XRP intermediate nodes have to approve both the destination and method of reaching destination.

before a selector can be sent back to the destination, the XRP resolution request has to be processed.


110 100 90 80 (a) Speedup 120  Relative Delay (%) 100 80 60 40 20 0 (b) Overall latency Figure 11: (a) Speedup of the 16-node system with The result can also be a serious performance issue for chip multiprocessors.

a bus architecture should not be written o. as a possible solution for on-chip interconnect.


Figure 15 shows the ideal redundancy by content type.

javaScript shows over 90% of redundancy with the smallest chunk size of 128 bytes.


T DC - 2 requires about 3.6 dB less Eb/N0 than the single path uncoded scheme to receive the entire message.

with the same Eb/N0, e.g., 7.6 dB, T DC - 2 achieves full throughput and maximum e.ciency at a 1/2 DC code rate.


In this case, the recon.gurations minimization phase requires only 3.36 s. Figure 5: The two best placement solutions on a 5x4 grid of applications A to B  4.3 Timing performance Table 2 presents the timing performance of the proposed design .ow for recon.gurable NoC-based architectures.

the design .ow has been used to generate a recon.gurable system for each application presented in Section 4.2 plus other more complex video/audio streaming applications (C, D and E).


Many e.orts have been made to address the congestion issue in the DSRC research community, the industry and the government.

in the US, some of the OEMs have conducted independent studies of congestion control algorithms [16, 14].


We model a batch size of the arrival process as a uniformly distributed random variable with geometrically decreasing upper bounds.

at the ith batched arrival event, counted from the starting of the incident, the size of the batch, bi, is uniformly distributed from 1 to U/di, where U is a predetermined constant, and d is a discount factor.


total energy can be conserved, (ii) throughput will be compromised, and (iii) the increased network cost will pay o..

we identify three open issues that are fundamental to altruistic cooperation: 1.


Our contribution to the energy framework extends beyond the introduction and example implementations of the energy harvester.

we extend the set of implementations of the current energy framework to include a model for a supercapacitor energy source and a device energy model for the energy consumption of a sensor.


We also examined the properties of the modi.ed choking algorithm in seed state and the impact of initial seed capacity on the overall system performance.

we showed that an underprovisioned initial seed does not facilitate the clustering of peers and does not provide effective sharing incentives.


On the .ip side, asynchronous wakeup is easier to implement and can ensure network connectivity even in highly dynamic networks.

asynchronous wakeup trades energy consumption for the robustness of network connectivity.


This is crucial since we assume the coherence time to be longer than the delay.

this section gives an intuition on how stable channels in a lab environment must be in order to guarantee that our framework operates correctly.


APPENDIX 8.1 Proof of Lemma 2 Recall that the values of A[i], i =1, 2, ..., N are initialized to values uniformly distributed over {0, 1, ..., 2l - 1} independently.

v1(0), V1(0), ..., VN (0) are mutually independent and each of them has the following distribution: 8 >0 with probability 2-l , > > < 1 with probability 2-l , Vj(0) = >... > > : 2l - 1 with probability 2-l .


We focused on the power con-sumption of the connected standby mode.

we meas-ured the energy cost of receiving emails without any user in-teraction and the screens of the smartphones were off while receiving email.


This edge-based notion of con.ict graph is quite complicated, and can be considerably simpli.ed by observing that, under the assumption that no per-packet transmit power control is used, the notion of interference in the physical model is associated with nodes, and not with edges.

the interference level generated at a receiver v by a transmitter u, which is transmitting to a third node, say w, is independent of w, because u uses the same transmission power for all communications (of course, due to our link-layer reliability assumption, the interference generated by w when sending its ACK packet must also be included).


If there are paths that are not connected into cycles, then we tour the coarse boundary R and connect them into boundary cycles.

we start from anywhere on R and tour along R; when there is a neighboring node (in 2 hops) who is on an extremal path Pj , then we branch on Pj .


In this paper, we present experimental results that highlight the fact that WLAN devices from different vendors in the market can have heterogeneous MAC level behavior.

we demonstrate with examples and data that in certain cases, devices may not be conformant with the 802.11 standard (e.g., due to incorrect implementations).


While traditional systems have eschewed such solutions due to the potential perturbation caused by additional monitoringloads[23],giventhat modern machinesare increasingly bound in performance by memory bandwidth rather than CPU speed, we advocate an approach in which data-near analysis is used both to reduce monitoring data volume and to rapidly gain insights from captured data.

we posit that it is often cheaper to quickly analyze data and then send out data summaries or abstracts thanitistocopy rawcaptureddataitems thisfacthasalso been showntoholdfordatadissemination across networked machines[7], and wenotethatforthesame reasons,physical systems using smart sensors are increasingly common.


Thus, we refer to a distributed implementation of a content-based communication service as a content-based network.

we assume an interconnection of routers, where the connections between routers may be physical links or overlay links (this distinction is inessential at this point, although it is clearly important when designing an actual system).


N varies from 10 to 130 with an increment of 10.

we vary network density from 10-5 to 1.3 ×10-4.


After a group of dAPs win channel contention, the mAP needs to match them with a set of clients.

it needs to modulate their data and budget the transmit power of each dAP, so as to cancel cross-talk interference and maximize multiplexing gain.


LS sequence number > valid LSA s sequence number  The attacker advertises an LSA on behalf of the victim saying that the victim has only a single link which is connected to Net1.

no link is advertised which connects the victim to R2.


Moreover, owing to the the ratio between the maximum packet processing capacity and the traffic offered load, in terms of packets per second that require header processing.

by assuming that the packet 24 hours time scale variability of traffic load dynamics on processing unit in a component can be modeled as a single server2 queuing system, with finite buffer and generic arrival/service time Internet links, in many cases rush hours and low utilization time distributions (i.e., a G/G/1/N queuing model), we can express its bands can be easily identified.


The set of i=1 1 bility and the destination is among other nodes L.-f|S| (1-f)|S| outside S with probability 1- .

for each L.-f|S| node u not in S1, the attacker assigns the probability of u being the destination as: 1 u .


In this paper, we revisit hash-routing techniques and apply them to Information-Centric Networking (ICN) environments, where network routers have cache space readily available.

we investigate whether hash-routing is a viable and e.cient caching approach when applied outside enterprise networks, but within the boundaries of a domain.


It is no surprise that the number of admissible (active) 3400 3200 MSs increases with traf.c intensity .. Interestingly so does the aggregate throughput.

the multiuser diversity gain 3000 remains dominating through the whole region of ..


Unfortunately, while we can optimallysolvethe one-dimensional problem,thereare complexinteractionsbetweenthedimensions that complicate the multi-dimensional problem.

the total range expansion required for each rule istheproduct of the rangeexpansionrequiredforeach.eld.


To measure short-term fairness we consider the sliding window application of Jain s fairness index as de.ned in [2], adapted to the case where di.erent stations can have di.erent weights.

let yi(K)= zi(K)/wi,where zi(K) is the fraction of transmissions performed by station i in some window K and wi is the weight for station i.


Especially for MAC, although there is some convergence on the techniques to be used [13], there is still little evidence on the way these techniques can be effectively used in BAN.

what is missing, is full understanding of the trade-offs created by these techniques and knowledge to optimally mix them for different BAN Permissiontomakedigital or hardcopies of all orpart of this work for personal or classroom use isgranted without fee provided that copiesare notmadeor distributedforprofitor commercial advantage andthatcopiesbear this notice andthe full citationonthefirst page.


5.2 Traf.c traces For our evaluations, we used parameters derived from two real-world Internet tra.c traces.

the traces that we used were collected at di.erent locations in the Internet, namely University of Southern California (USC) and University of North Carolina (UNC), respectively.


The error vector is a vector in the I-Q plane between the ideal constellation point and the data interpretation by the receiver[13].

it is the difference between actual received symbols and ideal symbols.


Instead, it uses sensors to interface with the real world.

an OCCC gathers real-world data via sensors without humans being conscious of it.


As a result, Atends to have small effective rank compared to their actual matrix rank.

a small subset of eigenvalues of AT Atend to be much larger than the rest.


Root servers very rarely answer with A or AAAA records, so we only plot NS record TTLs returned by root servers.

a and AAAA record provides a direct mapping from a hostname to an IPv4 address and an IPv6 address, respectively and the NS record provides a reference to the authoritative nameserver that should know the queried hostname when the nameserver being queried does not know the IP address of the queried hostname.


In fact, lowering the rate will expose the packet to higher probability of error since the packet is in the air for a longer time.

rate adaptation is effective in dealing with propagation losses and not with interference losses.


In this paper we have focused on how best to display forms on these devices.

we have shown various strategies for selecting descriptive labels for the various input elements that appear on the summarized forms.


In our context, the popularity of an ASlink can also be captured by the number of di.erent end-toend AS-level paths (discovered by the probes of a traceroute campaign) that traverse the particular link.

the frequency of AS-link Traversing Paths, or ALTP-frequency.


(2) The mapping service integrates some knowledge given by the domain model.

the presence of the obstacle, its position, and length.


Moreover, the caching service must be able to cache both the data and code that manipulates the data in order to be generic.

methods manipulating the data must be executed on the local caches themselves in order to reduce the amount of communication.


2 shows that each sensor generates and transmits a 28-byte packet per sample time, ts.

m packets arrive at the WSN-GW every ts.


Finally, due to simulation running time constraints, the node step size granularity is high.

in Figure 3 the derivation for mesh unicast in Appendix A is really valid only for large N and therefore we see higher discrepancy at lower N. The simulation results attest to the fact that the approach taken and approximations and assumptions made do not excessively compromise accuracy.


A cost set is a commutative monoid with operation + over a set S with partial order <, such that x + y = x for all x, y .

s. we consider the set S = {0, low, high, expensive} and the sum de.ned as .a, b .


will be loaded on each satellite and when the new bundle will be served.

for each candidate HS, the method computes the number of satellites needed to upload the queued bundles and the new arrived bundle on satellites.


Easily, this corresponds to the selective algebra(R+ ,0,min,=), and so W is compressible by Theorem 1.

under the tree routing scheme duetoFraigniaud andGavoille[10] widestpath routing can beimplemented using5logn bit addresses and3logn bits local memory, or log2 n bits using the scheme of Thorup andZwick[4].


In order to simplify the analysis we assume (without loss of generality) that in the optimum Knapsack solution, at most one carrier is partially assigned to user i and this carrier has the highest index among carriers assigned to user i.

if there exists a carrier c such that Qsi b(i, c ) >ß( c)and b(i, c ) <r(i, c )then c = c .


The prior studies in this area mostly focus on the caching decision algorithm, and the caching replacement algorithm , such as Least Recently Used (LRU) and Least Frequently Used (LFU); the latter of which are originated from the computer architecture literature.

the rationale behind LRU and LFU is that most of popular objects are consumed many times once they are used, and their popularity generally follows Zipf distribution, which re.ects the power-law effect [4], a relatively small number of popular objects are requested by a large number of users, which account for the majority of the Internet traf.c.


The customer multicast packet is encapsulated using GRE [9] and transported across the backbone to the PE routers using IP multicast.

the customer multicast packet is encapsulated in a provider multicast packet between the ingress and egress PEs.


This problem can be easily addressed through a simple graph transformation.

we replace each source node at a non-leaf node by creating a new leaf node and placing the source node in it, and then connect the new leaf node to the non-leaf node where the source node is originally located by a link with in.nite capacity1.


property, we propose using SPLD as a more sophisticated signature to select mapping candidates.

when we try to select a node v ' in Gb as a candidate to be mapped to a node v in Gp, we only select the v ' from these nodes that have the same SPLD as v. This is effective because two nodes with different SPLDs cannot be mapped to each other.


As the step of the forwarding probability function increases, so do the forwarders and the average packet delay is reduced due to this e.ect.

in high error conditions, the .ow bene.ts more from this increase, similarly to the single packet scenario presented in Section 4.3.1.


Since most of the APs are deployed along roads, the simple instant model should work well.

when a mobile client has visited multiple APs in sequence, which is represented by (, , ) where li and ti denote the location of the ith visited AP and the time of this visit, respectively, it is predicted to move in the same direction and velocity as it did between the last two visited APs, that is, ln í lní1 vp = .


These results indicate that by suitably selecting an appropriate MAC layer protocol, the performance of the multi-path protocol can reaches as high as the theoretical maximum [5].

our explicit measures of the number of collisions in the network shows that our protocols signi.cantly reduce collisions.


The max-product BP equations converge to a .xed point after t > t* iterations.

for any edge (i, a) in the factor (t) (t *) (t) (t *) graph and any t > t* , µ= µand µ= µ i.a i.a a.i a.i.


We present in the next section the main principles of the Autonomous Decentralized Management Architecture Figure 1: Autonomic Control Loop (ADMA) that we proposed to provide MANETs with autonomic principles.

we focus our interest on the self-con.guration property.


For example, the United States (US) may require all its ISPs connecting to the external world (outside the US) to deploy RBFs.

all such RBFs will .lter out BGP announcements received from external worldbut involving network pre.xes belonging to the US.


Second, TPUT is proven to be instance-optimal on common data series.

analysis shows that by using a pruning parameter a< 1, TPUT achieves a qualitative reduction in network tra.c, lowering the optimality ratio from O(m *m) v to O(m * m) for data series following Zipf distribution.


Thus, the paths corresponding to x and y may be probed in the same timestep if and only if x and y are not adjacent in the original graph.

the original graph has an independent set of size k if and only if at least k of the paths in the network constructed can be probed in the same timestep without sending more than one probe across any single link.


If the occupation is different from 1, nothing must be done, because the scheduler is already turned on .

the scheduler must be turned on in the event of the first cell is received.


Note that these challenges will become more severe in 3D environments.

some true S-Skeleton nodes may not identify themselves as skeleton nodes due to even width , etc.


This investigation leads to a number of guidelines indicating the necessity of complementary measures or alternative approaches.

network discovery and dynamic establishment of roaming agreements (proactively) emerge as major requirements in enabling fast inter-domain handovers.


The skew presented in Figure 3 is measured directly between the client and the server.

it is one hop distance from the viewpoint of overlay network.


First and foremost, the focus of this work is on evaluation of these sampling algorithms within the framework of anomaly detection which is heavily based on .ow measurement.

.ow arrival time series are utilized by the wavelet-based volume anomaly detection, and exported .ow records are required for TRWSYN and TAPS, respectively.


Nevertheless, it remains uncommon the usage of data about human mobility for discovering patterns which could support the dynamic resource allocation in urban areas.

occasional large scale events impose patterns that may strongly di.er from those observed in daily routines.


However, HWNs must also accommodate future applications and their tra.c characteristics.

rRM frameworks for HWNs must not be tied to speci.c modes of traf.c.


min = n Speci.cally, D can be bounded as follows: min V V m K K ~ Dmin ~ 2 m , (2) nbmn where bm is the volume of a unit ball (a ball of unit radius) in the m-dimensional space.

b1 =2, b2 = l, and b3 = 34 l. 8 The proof of this result is straightforward, and is presented in Appendix A for completeness.


As a result, an invalid signature takes only 34 µs (amortized) to reject.

since a correctly veri.ed hash chain element from an invalid signature can be cached, it speeds up the veri.cation of the next valid signature, and represents a cost which would otherwise be a part of the next successful veri.cation.


Though DHT is a powerful substrate in building scalable services, it still relies on the underlying native routing protocols to forward messages.

when building the framework over heterogeneous networks each with its own routing protocol, the interoperability between di.erent networks becomes a great concern.


One limitation in our testbed stems from the use of prototype APs that host the modi.able wireless cards.

our wireless adaptors do not implement per-client rate adaptation, a function supported by all commercial APs.


If on exchange of DH values X, Y an attacker M computes a correct value MACKm (t), for some input t,where Km is the MAC key derived by the KDF from X, Y , then there is an extractor machine M ' that on the same inputs of M outputs the keys Km and Ks.

4 there are no shortcuts available for the attacker in computing the MAC without going through the key derivation steps and explicitly computing the MAC key Km as well as the companion key Ks.


However, for the purpose of considering dynamic variations of the QoS, Equation (9) is inappropriate.

it is unable to describe rate control performed during the connection, where the impact of rate modi.cation can be heavier.


Outcome : The outcome can be determined by backward induction.

given any pricing strategy, each user decides her own bandwidth consumption by maximizing her utility.


In this work, we focus on Intermittently Connected Mobile Ad hoc Networks (ICMAN) formed by a group of mobile users roaming within a geographical area that is fairly large relative to the wireless transmission range, who either have no access to the infrastructure, or for other regulation or application speci.c requirements, could not or do not want to use the infrastructure for transferring certain delay tolerant data amongst themselves.

the features of such ICMAN include those of ICN, as well as those of MANET such as lack of infrastructure, and nondeterministic mobility pattern of the users.


We present a simple model to evaluate the .lesharing dynamics under this pollution attack.

we model the number of peers that have a good (non-corrupted) copy of a particular .le, and the number of peers that have a bad (corrupted) copy of the same .le.


This paper shows a very strong result: there exist failover implementations for OpenFlow that achieve a maximal robustness, in the sense that connectivity is always ensured as long as the underlying physical network is connected.

we show that the problem of computing failover tables is related to graph search, and present three di.erent algorithms achieving di.erent tradeo.s, in terms of the number of required failover rules, the number of tags, as well as the resulting path lengths.


Nodes usually resolve around these landmarks.

nodes would stay in the neighborhood of a landmark or move to the neighborhood of other landmarks with their own preferred probability.


We introduce a faultlocalization methodology based on the use of risk models and an associated troubleshooting system, SCORE (Spatial Correlation Engine), which automatically identi.es likely root causes across layers.

we apply SCORE to the problem of localizing link failures in IP and optical networks.


i We now show that the rate vector pr *achieves the maximum aggregate rate.

there does not exist another feasible vector pr ;;T * with a one-hop solution such that Tpi>p.


The items chosen are kept in the same format as the input set.

if a stream of packets is sampled the result will also be a stream of packets.Another approach is data aggregation in which an input data stream is transformed into an output stream with a di.erent format that is typically less storage and computationallyexpensive.


counter behavior of a tagged station as a discrete Markov chain model.

bianchi s work captures all the protocol details, and motivates a signi.cant amount of subsequent analysis work.


Feasible throughput capacity for multicast: In a WAHN of n nodes, where each node is a source of a multicast session and transmits its packets to m random destinations, a throughput of Cm(n) bits per second for each session is feasible if there is a joint spatial and temporal scheduling transmission scheme, such that every source node can successfully deliver Cm(n) bits per second on average to its m chosen destinations.

there is a T< 8 such that in every time interval [(i - 1)T, iT ] every source node can send TCm(n) bits to its destination nodes.


Note that if T is not a cluster as in a flat network, the large weight assigned to a new link during soakin will achieve its intended effect of discouraging traffic.

since the topology of T is visible to A when T is not a cluster, A will continue to take P1 to Z.


It is achieved by a time division multiple access (TDMA) mechanism, in which a temporal slot (sub-frame) is allocated to each CL-AP, proportional to the bandwidth requirement of its BSS and, hence, fair allocations among APs in terms of traffic load.

the total duration of a super-frame is separated into n sub-frames, where n is the number of CL-APs and corresponding BSSs.


Although the medium access scheduler delivers opportunistic throughput gains, it does so at the cost of losing some of the desirable features of the current 802.11 MAC.

the scheduler prevents the forwarders from exploiting spatial reuse, even when multiple packets can be simultaneously received by their corresponding receivers.


A comparison of these results with the lower bounds allows one to effectively identify the op- timal blocking probability.

in our experiments we see that the Repacking scheme is near optimal since it comes close to achieving one of the lower bounds (the sub- set pooling bound), while other more easily implementable schemes such as Least Busy Frequency are also not too far from the optimal.


In this paper we present a large scale measurement study of the DNS infrastructure currently deployed in the Internet, focusing on characteristics that are indicative of how DNS servers are deployed and managed.

we analyze availability and load characteristics of DNS servers, as well as deployment styles within different organizations.


Other paradigms may also present themselves, and the region must be prepared for any reasonable destination of the notification.

our challenge is to develop a single abstraction that can cleanly and efficiently support all of these models.


an imputation x is said to be unstable through a coalition S if v (S) > .i.S x i.the players have incentive for coalition S and upset the proposed payo.


In the following, in order to reduce the overall system design complexity for elaboration, each of mobile devices and base stations is assumed to have a total of .+ 1 radio ports.


These ab- stract interaction elements must capture user intent, not device mechanism.

base elements of user interaction must abstract away the differences in the devices.


INTRODUCTION A major recent development in computer networking is the notion of Software-De.ned Networking (SDN), which allows a network to customize its behaviors through centralized policies at a conceptually centralized network controller.

open.ow [13] has made signi.cant progress by establishing (1) .ow tables as a standard data-plane abstraction for distributed switches, (2) a protocol for the centralized controller to install .ow rules and query states at switches, and (3) a protocol for a switch to forward to the controller packets not matching any rules in its switch-local .ow table.


By introducing such a variable base  , we can ensure that the rate that a node transmits a message is at least the rate that the message is generated.

if the message is generated by a node at a frequency messages per second, the node should be able to transmit at least  data per second.


Range of Latencies: Consider a three-node network with nodes A, B, and C located in the Internet such that tBC = 2tAB =2tAC .

the delay between Band Cisat least twiceaslong asthe delay between AB and AC.


Logic buffer cells are labeled by the buffer delay they introduce.

cell iof the logic buffer is itime slots away from the output .ber, as shown in Fig.


Let Cbsc(p) be the BSC channel capacity, then for any number of passes L such that L·Cbsc(p) > k, the BER goes to 0 as n goes to 8.

the spinal code achieves capacity for BSC with an ML decoder.


This attack arises from the fact that a secondary user can gain access to a channel if and only if the presence of the PU is not detected in this location (e.g., out of the coverage of PU).

any event that an SU can or can not access to a channel with the presence of the PU will leak his location information partially.


A Security Mobility Domain (SMD) is a set of Security Domains in which each R1KH can obtain PMK-R1 from any R0KH in the set.

an R0KH within an SMD can derive PMK-R1 for any R1KH in the SMD, even those not in the same Security Domain.


As shown in Figure 2b, AC proves not only its superior performance but also another interesting feature.

its performance are not strictly dependent on the speci.c nodes currently present in the network, or some speci.c con.guration of content requests.


n - wl+1.n-l], w1 l=1 and 1At =1if At is true, else 1At =0.

at time t, the loss event interval estimator .


For instance, we might be interested in what noti.cations are sent from the server and how the client reacts independent of how the noti.cation mechanism is implemented.

we wish to monitor communication in terms of application level abstractions.


Therefore, the US and China have much greater energy consumption than Japan and Korea.

we look at heavily energy-consuming top 10 websites in each country, and Flash websites among the top 10.


One popular technique is the use of virtual forces among nodes [9, 18, 17, 4].

[4] proposes force-based algorithms to solve a connectivity and movement problem that has similar objectives as ours: maximize the number of connected nodes while minimizing the movement.


.. resources introduce a significant impact on catering for their | (7)utilization.

short round times could deem many slower resources useless to the network, or incur significant control overhead in their discovery and utilization, and longer round times would impact the discovery rate of faster moving resources or ones with shorter duty cycles.


In fact, according to the orthogonality condition in (3), we also have g(.1),··· ,g(.M ) exactly lying in the signal space Us spanned by u1,··· ,uM.

u1,··· , uM are indicating the most correlated directions.


Ouralgorithmsdonot require nodestohaveany estimate of the number of neighbors.

we show that not knowing n results in no more than a factor of two slowdown in the algorithm performance.


First, we discuss the behavior of ECr n as a function of n( nmeasures how aggressively erasure coding is used).

r we derive the asymptotic distribution for ECr n (when n .8).


Moreover, the inspiration and techniques we use come not from the distributed computing literature, but instead from the algorithmic game theory and learning theory literature.

we study a notion that generalizes the famous price of anarchy: the price of total anarchy, originally de.ned in [3] as a way of weakening the rationality assumption behind the price of anarchy.


Since the contents of the UII~ depend on the previous IR, each client has to receive the previous IR in order to use the UIR to validate its local cache.

if a client missed the last IR when it receives an UIR (by comparing the timestamp associated with the UIR and the timestamp of the last received IR), it cannot answer any query until it receives the next IR, and use the received IR to validate its cache.


In this report, we have undertaken a bioinformatics investigation to determine TFBS and CRMs that are the principal components of a transcriptional regulatory network.

we focus on the two interesting, and statistically significant motifs, viz.


However, because ORPL selects the .rst awoken neighbor that o.ers routing progress as the next hop, the resulting end-to-end latency is more stable than with RPL.

the irregularities of link quality and wakeup schedule are compensated by ORPL through adaptive path selection.


NAMING AND SECURITY Network security is often broken down into four components: integrity, con.dentiality, provenance, and availability.

the security measures in the network infrastructure and end-host network stacks must ensure that data is delivered reliably (availability), comes from the appropriate original source (provenance), and has not been tampered with (integrity) or read by others (con.dentiality).


If the Serving ASN-GW does not receive Context Rpt message from the Serving BS, it will wait until receiving the RR Req (Resource Reservation Request) message from Anchor SFA.

the MS has already completed network entry procedure.


In order to avoid timeouts, most existing DHTs [2, 5, 20, 26] contact each neighbor periodically to determine the routing entry s liveness.

a node can control its routing state freshness by evicting neighbors from its routing table that it has not successfully contacted for some interval.


Specifically, our experimental results indicate that (i) using a combination of request sizes and air interface data rates is desirable, (ii) time multiplexing users in continuous bandwidth conditions is superior to code multiplexing, and (iii) when user rates are discretized, a combination of time and code multiplex- ing with a dominant time muliplexing component, results in broadly satisfactory performance with various measures.

eDF schemes based on the stretch and flow metrics, such as RMAX and SRPT, strike an excellent bal- ance between network and user throughputs.


As can be seen, deploying relays decreases the overall SINR by a few dBs because there are more transmitting nodes in the system, which in turn increase the overall interference level.

the lowest SINR value of -3dB can decrease further down to -7dB with three/four RS nodes.


Note that we assume that nodes can localize their positions using existing localization techniques.

we use protocols where nodes can passively learn their positions from other nodes (e.g., AUVs) to minimize energy consumption such as Dive N Rise (DNR) [11], mobility prediction [41] or using autonomous underwater vehicle [10].


It shows that channel hopping makes sense.

blind channel hopping (with a whitelist containing all channels) achieves better connectivity, lowers average ETX and lowers network churn compared to a single channel solution operating on any channel.


If a signal is bandlimited with B, then the cyclic spectrum Sx(a, f ) can be nonzero only for a diamondshaped region around the origin of the bi-frequency plane, as shown in Figure 2.

the potential cyclic spectrum support for a bandpass waveform is directly related to its center frequency and bandwidth, and the ISM band during one round scanning can be reasonable seen as nonbusy which implies signal sparseness.


However, in this case, the payoff the player gets is the net change of the weighted-delivery debt.

the payoff is an N -dimensional vector v =[v1,v2,...,vN ], where vn =(qn - 1)/pn if the server accomplishes a job for client n in the interval, or vn = qn/pn if not.


This process continues itself until the queue becomes empty.

all cells are in a force-equilibrium position.


Whatisrelevantto us,however,istheimpact ofdynamically generated data to the scalability of the forwarding and cachingplane.

there is no bene.t in caching dynamically generated data that are accessed only once, as it reduces the speed of theforwarding nodesdue to cachelookup andit causes eviction of otherdatathatmightbeaccessed morethanonce.


do min min Since the minimum beamwidth is a constant number, we find that the approximation ratio .1 is bounded by a finite number given in (30).

given a network example, its upper bound can be expressed as 2p µ .p =·K (,2 ).


The free function symbols in G denote the attacker s computation of its messages from the previous outputs of the agents.

the attacker s inputs are g1(t1), g2(t1, t2), g2(t1, t2, t3) etc.


However, a high degree of interactivity has been observed in many real workloads [1, 4, 6, 16].

users of real media services typically do not access the media sequentially.


np For such a k = T(1/np), we insure that G(k) has a giant n,bp,p component of size at least g(d)n and diameter bounded by O(k log n )= O(klogn).

after O(log n ) time steps, log n. np we can apply the result of the previous case, and, after additional log n steps, .ooding is complete.


Any binding to RWIs (whether key RWI or name RWI) involves human-level notions of identity so the binding cannot be completely reduced to cryptographic mechanisms.

we imagine that search engines and social networks will play an important role in future trust mechanisms involving RWIs.


In this paper we present SDN traceroute, an alternate tool for measuring paths in an SDN-enabled network.

it provides the path an arbitrary packet with user-de.ned header .elds would take if it were injected into the network at a certain point.


However, Gaussian distributions have certain attractive properties which makes them a good choice for modeling priors.

they yield another Gaussian posterior distribution with easily computed parameters which enables performing the cleaning at the sensor level, they are known to be analytically tractable, they are useful for query processing and yield closed form solutions as we will show in Section 4, and .nally they also have the maximum entropy among all distributions [9].


.1(d/va) vaE[N2(d/va)] vb vb - 1 - ln va va (53) It is noteworthy that (53) is completely determined by the ratio vb/va and is independent of the transmit range r and connection time limit c. With reference to Figure 5(a), we observe that the ratio .1(d/vb)/.1(d/va) is always larger than 1 for all choices of va and vb.

when the difference vb - va is large, say va =2 and vb =30, the ratio is as large as 2.25.


A CN should be open also in the sense of its connectability to ISPs and telcos as it cannot operate in an isolated way.

we should choose the technology by considering the requirements of the applications and expected coverage which has been identified in the previous step.


Clearly, this needs to change if IPv6 is to become a viable solution for an impending scarcity of IPv4 addresses.

failure to convince the existing IPv4 Internet to adopt IPv6, i.e., become acces 1See http://www.nro.net/news/ipv4-free-pool-depleted.


high µ(R)) a larger number of particles can be set to sleep in order to save more energy.

en can be adjusted in a way such that a target µa(R) is achieved given the expected µ(R).


There exists a large conceptual gap between the high-level application requirements and the low-level MAC protocol operation [23].

it requires expert knowledge to .nd MAC operating parameters whose performance satis.es given application requirements.


We also assume each link has enough bandwidth to satisfy two incoming tenant requests: R1  and R2 .

r1 requires a cluster of 5 VMs connected by virtual links (hoses) of bandwidth 100 Mbps, while R2 requires a cluster of 10 VMs connected by hoses of bandwidth 200 Mbps.


Note thatthis nullingat rx1does notprevent tx2fromdelivering its packet to its own receiver rx2.

say tx1 is transmitting the symbol p and tx2 is transmitting the symbol q. Intuitively, since rx2has two antennas, the received signallivesin a2dimensional space.In this space, the two symbols p and q lie along two different directions, as shown in the bottom graph in Fig.


ACKNOWLEDGMENTS We would like to thank a number of network operators and BGP routing experts for the advice.

randy Bush and Geoff Huston provided useful insights on the operation of large ISPs.


Bidder utility (ui) The utility of bidder i is the residual worth of the channels.

ui = vi · dai -pi if i obtains da i channels, and 0 if it obtains none.


From our observations, we conclude that the stability of the TXR is comparable to PSR.

in the evaluation versions during night on channel 14, the di.erences in TXR are insigni.cant.


Abstract One of the major challenges in today s economy concerns the reduction in energy usage and ....2 footprint in existing Public buildings and Spaces without signi.cant construction works, by an intelligent ICT-based service monitoring and managing the energy consumption.

interoperability between heterogeneous devices and networks, both existing and to be deployed is a key features to create ef.cient services and holistic energy control policies.


When the 3G module adopts various bandwidths in a time interval, the total amount of transmitted data is the sum of the multiplications of each adopted bandwidth and its corresponding time duration.

when th and tl are the time intervals that a 3G module operates under Bh and Bl, respectively, then the total amount of transmitted data is Bhth + Bltl.


After applying this transformation, the game is simpli.ed.

terms of the form Z(M) are simpli.ed to constants when the length of M is constant, which removes the dependency on M. CryptoVerif then applies similar steps for keys kT and kC .


The problem formulation and the algorithms take into account realistic properties of an ultra-low-power IoT node.

ioT nodes that are powered by the motion energy will likely to be implemented in ultra-low-power architectures.


Here ANODR employs trapdoor commitment , a cryptographic concept explores the collision-resistant property of one-way functions.

given an output of one-way function Kc(dest), it is computationally hard to .nd the input, or another input collision that can produce the same output.


(d/2k"")+e O for any factorization (k",k"") such k"" that k" · = k. This illustrates the e.ectiveness of multiple channels when dealing with unknown request sequences.


Theorem 3.3 implies that given that the maxima] cycle length in the Mobility graph G is n, a sufficient condition under which D*(zl, 12) -d(zl, =2), where 11 and 12 are cells visited by the user, is that R = [.~2].

if G is a ring graph of length n, a sufficient condition is that R -- [~_Z].


Our evaluation demonstrates that Disclosure is able to perform real-time detection of botnet C&C channels over data sets on the order of billions of flows per day.

we show that Disclosure is able to recognize approximately 65% of known botnet C&C servers in both settings while producing 1% false positives.


While simple, we demonstrate that this mechanism works e.ciently and thus dismiss the need for more complicated mechanisms.

our mechanism results in no tangible download throughput reduction for all reasonable server switching frequency and network path characteristics.


The problem of ensuring strong connectivity while minimizing some measure of energy consumption has also been considered in a more theoretical framework, where it is referred to as the ranged assignmentd problem.

it has been shown that determining an optimal range assignment is solvable in polynomial time in the one-dimensional case, while it is NP-hard 1 A directed graph G=(V,E) is said to be stronglydconnected if, for every u,v.V, there exist directed paths from u to v and from v to u. in the two and three-dimensional cases [3,8] 2.


the two solutions, we see that k(n + 1) + 2n +1 lim = n +1.

k.8 k + n +1 the optimal solution is better by a factor of n + 1.


Nevertheless, [2] s approach is based on cryptographic indistinguishability which measures security in regard to key length n. Our approach is different from this earlier work as we seek to prove that the failure probability of a secure routing protocol is negligible in regard to a network metric x, which is the network scale N in this paper.

the larger the network scale is, the more secure the network is in an asymptotic manner.


Temporary schedule inconsistencies During the time of multiple frame durations it takes for a schedule (control or data) to reach from the root to the remaining nodes, over several hops, the network is in a temporarily inconsistent state.

some nodes are follow- Figure 4: LiT MAC operation: an illustration ing the old schedule while some others have learnt the new schedule.


A Dynamic Scheme Like the dynamic BS scheme [I I], we can modify our method a little bit to further reduce the size of the report when the number of items updated is small.

instead of using an N bit sequence for B , we explicitly use the IDS of items that have been update since T(Bo).


Finally, WSN applications on top of an HR infrastructure should be partially aware of the limitations of the infrastructure.

their design should anticipate disruptions in node connectivity as well as changes in node addresses, so that they can recover after such events (e.g., via buffering).


Instead, we look for conditions that ensure that a node has no incentive to be dishonest if it knows that everyone else is honest.

we try to ensure that no node has an incentive to unilaterally deviate from using BGP-compliant strategies.


For example, in Figure 1, we show how closely we can approximate xln(x) 1.05 - x 0.95 using 10(x ) within the interval [1,1000].

if all transport-layer .ows in an OD .ow S have less than 1000 packets, we can estimate the entropy norm of the 8000 7000 6000 5000 4000 3000 2000 1000 0  Figure 1: Comparison of entropy function and the approximation OD .ow as -||S||0.95 It turns out that this 10(||S||1.05 0.95 ).


By focusing on the network protocol architecture viewpoint, MANETs are challenging scenarios for many protocol layers.

the Medium Access Control (MAC) layer protocols are deeply investigated in the effort to obtain a good design and adaptive, tunable compromises among distributed and centralized implementation, communication performance and reliability, resources utilization and system scalability.


Doing so however also reduces true positives.

the algorithm will miss all periodic transfers with a periodicity of one minute, whichdominates theperiodicitydistribution, occurringin sessions shorter than .


This resulm in: More accurate protocol models.

while keep- ing requirement (a), we discard requirement (b).


A striking aspect of the .gure as that the data points do not lie above the 45 degree line.

recall that the total outage time as seen by a receiver consists of three components: the time required for a successful association,thetime requiredfor associationfailures(possibly zero), and an additional network component.


LIGHTWEIGHT VIRTUALIZATION In this paper we argue that a lightweight mechanism, combining source code, can be used for supporting virtual networking.

enabling multiple concurrent customized data planes to run together on a shared platform.


Let L thebetotal needle length at a data node.

if the data node does not duplicate its data to any other nodes, then culation andapproximation.


Using equations (1) and (3), and the assumption that the transmit power at each node iis the same, we see that CijCjifor all i j.

we can assume that all the edges in the graph Gare symmetric in terms of capacity.


We simulated the tra.c produced by a six-electrode ECG sensor, which sends 10-byte packets (a timestamp and 1 byte per electrode) at a rate of  Table 1: Comparing energy cost of three protocols SlyFi SPINS Adapt-lite Overhead 256-bit 64-bit variable Security & Privacy1 Yes No Yes Avg.

power (mW) 27.60 14.74 13.11 Battery life (hr) 25.49 47.74 53.68 1whether the protocol achieves the security and privacy goals described in Section 5.


First, we present a framework for congestion control algorithm design that incorporates key issues encountered in CSMA-based multihop wireless networks.

data transmission capacity is a critical input to utility maximization based congestion control algorithms.


The probability of a successful link transmission does not change between retransmission attempts.

we assume that the probability of transmission failures on successive attempts on a link are independent and identically distributed (IID).


We set i s time frame to be 2a where a positive integer a is chosen to satisfy condition 2a-1 < 2a : Fi - 1.

i uses the si -th slot in every 2a time frame (is slots are l · 2a + si, for all l = 1, 2, 3, .


Table structure is crucial because it helps to answer question Q2 about the impact on router implementations.

some router vendors do IP lookups based on compressed multibit tries [11, 12].


As hold time increases, the percentage of time for which the system allows six or more users in the system decreases.

congestion is reduced as hold time increases.


To go further we also evaluated how this correlation between a user and her friends impacts the probability for this user to be connected by taking into account the aggregated behavior of her friends.

we wanted to answer the following question: is the probability of a user to be connected at a given time impacted by the fact that her friends are also connected at this particular time or are these two independent events?


In the output interfaces, the Class based Weighted fair Queueing scheduling packets from the 3 supported QoS services.

2 queues have been defined, one full priority queue and one normal.


These C++ blocks can be linked to Python applications by using SWIG as an interface between two languages.

gNU Radio provides a signal processing runtime environment which, combined with (low-cost) external RF hardware (USRP), allows users to deploy different SDR applications over wireless medium.


= .max/.min, as a function of a = 1, corresponding to the link margin allocated for fading.

-10 log10 a is the link margin in dB; for example, 3 dB corresponds to a = 12 .As showed in Figure 2, we note that a link margin of 5 dB is enough to reduce the outage probability to 2% for antenna separations bigger than 5.. 0.35 where .max and .min correspond to the eigenvalues of the Wishart matrix HHH .Note that .


The 140 nodes we did measure still provides ample room v for optimization savingafactorof 1 140 could still reduce band 4 width to one third of what the naive approach would require.10 Moreover, the savings would continue to grow with more nodes.

we expect that one of the most effective applications of our routing algorithm will be to the Skype scenario that we outlined in Section 2.


Note that X1 is the singleton set containing the initial .ow f. X2 is the set of all .ows which result from the application of all matching rules on f .

x2 contains all .ows which are reachable from f in a single step.


We express properties of the protocol in terms of the traces it gen- erates.

we focus on correspondence assertions of the kind for every generated trace, if action [~ occurs in the trace, then action ct must have occurred at some previ- ous point in the trace that is concisely written as ct +--, I~.


Next, we exploit the preamble to resolve phase ambiguity.

we calculate the cross correlation of input signal and modulated symbol zero.


Again, we find that proxies are less effective in reducing the tail of the response time distribution as compared to the reduction in the average response time.

the reduction in the 99 th percentile of server response time due to proxy caching and the resulting savings in server capacity is 15-20% (as compared to a 30-50% reduction in average response time).


between the increased level of spatial reuse and the decreased data rate each node can sustain (because of the decrease in the SINR) be quanti.ed?

is there an optimal range of transmit power/carrier sense threshold in which the network capacity is maximized?


At the other extreme, we analyzed the scaling laws of network-wide cooperation.

we studied two examples of network-wide cooperation, namely sequential and forward/reverse cooperation.


However, when a MN is aware that the handover is imminent, it sends Report message to the SMAG.

the PSMAG registers on 150 100 50 Wireless Link delay (ms) Figure 4: Impact of Wireless link delay  5.


The service requirement of each packet at each queue is equal to unit.

the service requirement of all packets are i.i.d.


3.2.1 Entropy Timeseries Previous work [13] has demonstrated that entropy timeseries of the four main IP header features (source IP, destination IP, source port, and destination port) is a rich data type to analyze for tra.c anomaly detection.

for every measurement vector v i at time i there are four measurements vi,j ,...,vi,j+3 for every ingress router (for example).


It could be used for continuous maintenance of the virtual network in order to guarantee the developer s requirements.

the minimax path algorithm could be used to reallocate a virtual link whose current delay is greater than the maximum required.


It is our strong feeling that, considering that p is likely to be relatively high in realistic VANET scenarios (say, p = 0.75), the dominating factor in the above described stochas tic process is the starting time ti of the geometric process.

we believe performance is optimized when ti is reduced as much as possible, and the best possible value of p¯is obtained after minimizing ti.


The analysis suggests that the coordinates primarily use two to three dimensions, with little variation in the others.

insofar as the data is Euclidean, it is only two-or three-dimensional.


Finally, we point out that even though our discussion in this paper caters to ISPs and their retaining control over the Internet, it also lays the seeds for new entrants to enter the .eld as proposed in [1].

iSPs might choose to sell their willingness to route anycast to the third-party Next Generation Service Providers (NGSPs) proposed in [1].


Unfortunately, it is very expensive in terms of the number of transmissions and buffer space.

it does not appear that this approach can scale as the number of messages in the network grows.


We deal primarily with the global behavior that emerges when an event of interest is detected by a randomly chosen sensor node in torus lattice T containing sink nodes at concentration c. This event should be then reported to one of the sink nodes through random walks.

we study thedelay timein numberofhops experiencedby thepacket thatbearsthateventtobetrappedby the .rstencountered sink node.


Each node admits a maximum receiving bandwidth for each interface it holds.

for each interface i and for each node j, the value bi,j represents the maximum bandwidth at which node j can receive by means of interface i.


[6] Given various medical sensors and algorithms for localization, Heracleia researchers have created a pervasive environment of sensors in order to improve the quality of life, provide better safety for the aged and support the caregivers of Alzheimer s patients.

they have developed distributed localization algorithms, which, combined with up to date sensor information, provide information on patient movements.


Unlike [6], however, we use a decomposition method for the capacity analysis so that systems with any number of service classes and any spectrum overlay pat- terns can be analyzed.

we find that any overlay pattern is the combination of two simple basic overlay pat- terns, and hence the capacity estimation can be decomposed into low-complexity calculations.


In contrast to ping and traceroute (as well as other middlebox detection tools like tracebox), we do not leverage out-of-band mechanisms (e.g., ICMP) in our design so as to avoid complications inherent in relying on external dependencies.

note the di.culties with Path MTU Discovery as TCP operation is linked with ICMP traversal [33, 36].


We also note that the Android connectivity manager imposes additional challenges when 3G is utilized simultaneously with WiFi.

in order to improve the battery life, every time the WiFi interface is activated, Android turns the 3G data connection off.


From a path switching perspective, two paths with such high loss factors are equally undesirable, in spite of their PSNR differences.

even a positive PSNR difference should not trigger a path switching decision.


We examine cache expansion without making any assumptions about traf.c properties and thus real-world cache hit rates.

we measure resulting cache sizes in the worst case, when there is network scan on a high entropy .eld (e.g., 216 entries for a scan on L4 destination ports).


Assuming that MDC and MRC have the same coding ef.ciency, i.e., they share the same parameters L and N per delivery segment within which we perform NC, the bene.t of applying NC is the same for both schemes.

mDC-C4isexactlythesameasMRC-C4andtheresults forMDC-C4applyinthesamewaytoMRC-C4too.Thiscanbe explainedbythe propertiesofthe canonical scheme.Ifanyhigher numberedlayerisdecodedbyMDC-C4,alllayersbelowitarealso  (a)MDC-C4vs.


As benchmark scheme we consider an epidemic-based data dissemination  1 0.8 Hit Ratio 0.6 0.4 0.2 0 Figure 7: Hit ratio of the least popular channel for e.cient.

we have shown that our model is suf .ciently accurate to capture the transient and steady-state behaviors of key performance indexes of the data dissemination system, such as data replication levels and hit ratios.


Our re.ective sensing architecture provides a structured methodology to support dynamic adaptation needed by sensor applications.

adaptation is performed at both base and meta level.


The goal of JF nodes is to reduce the goodput of all traversing .ows to near-zero while dropping zero or a small fraction of packets.

jF nodes employ one of three mechanisms.


Theorem 1 For any a>d = 2, there exists a constant 2a·3d c1(a, d) = depending only on a and d such that a-d Tp = c1(a, d) for wireless multicast.

there is a constant which depends only on the power gradient and the dimension of the space, that bounds the coding advantage for minimizing the power needed for multicast.


The second examines the stability criteria and discusses techniques that can be employed to guarantee stable convergence under all operating environments.

a gain saturation technique is introduced that is only engaged when device density exceeds conservative estimates.


It is obvious that there are going to be very few subscribers on road segments that do not lead to the point of interest.

the subscribers are not evenly distributed inside the publication area.


The advantage of using a tone is that any number of recipient nodes can signal a tone at the same time.


FARA makes this a private matter between consenting entities, just as end-points under the current architecture may use clear-text passwords, ssh, shared-key crypto, etc.

two entities might use a means of mutual identity that does not reveal their identity to third parties.


The candidate solution/test/state of an agent may be up- dated as the algorithm proceeds.

the test should be formulated so that on subsequent application, ran- domly chosen sub-components of a candidate solution are evaluated.


For bounded growth graphs, i.e., graphs where, for any node u and any radius r the number of nodes within distance 2r from u is at most a constant times the number of nodes within distance r, our augmentation process proceeds with high probability in O(log n log D)communication rounds, with O(log n log D)messages of size O(log n) bits sent per node and requiring only O(log n log D)bit space in each node, where n is the number of nodes, and D the diameter.

with the only knowledge of original distances, greedy routing computes, between any pair of nodes in the augmented network, a path of length at most O(log2 n log2 D)with probability 1 - O(1/n),and of expected length O(log n log2 D).Hence, we provide a distributed scheme to augment any bounded growth graph into a small world with high probability in polylogarithmic time while requiring polylogarithmic memory.


Current video streaming systems use WMANs to broadcast videos, in which each mobile device independently receives and decodes the video data from the base station.

every bit of data is used at most once before being discarded.


COMMUNICATION PARADIGM The communication of the system is based on Push-and-Pull (PaP) [6] algorithm.

a user agent fetches a document from the Web Server using HTTP protocol as usual.


To characterize the inter-service time, we introduce a counter Tl for each link l, namely Time-Since-Last-Service (TSLS), to keep track of the time since link l was last served.

each Tl increases by 1 in each time slot when link l has zero transmission rate, either because it is not scheduled, or because its channel is unavailable, i.e., Cl[t] = 0, and drops to 0, otherwise.


Each node in the simulation scenario (including the source and destination) moves according to the random waypoint model.

the wireless node randomly selects a destination, moves in the direction of this location at a speed of 5 m/s, and when it arrives then pauses during the interval known as pause time.


4.2 Simulation Results Table 2 shows that our proposal can reduce at least 50% of the trip time for the assessed scenarios.

when we keep the vehicle insertion at a constant rate of 8000 vehicles/hour and vary the accident duration (Figure 4(a)), our proposal reduces about 30% on the average trip time.


Today, however, the vast majority of Internet usage is data retrieval and service access, where the user cares about content and is oblivious to location.

the user knows that she wants headlines from CNN, or videos from YouTube, or access to her bank account, but does not know or care on which machine the desired data or service resides.


Intuitively, our decentralized and stateless protocol dynamically modulates its transmission power according to a power-law distribution.

our approach allows sensors to save power with no negative impact, neither on the time needed for reaching all the sensors, nor on the number of messages sent.


(5) Ti.F,Rj.F Based on the notion of worst-case intrusion, problem (5) is of great interest for the intruder detection problem.

solving problem (5) allows us to answer an important question: How many transmitters and receivers are needed and where do we place them for providing the required coverage such that at least one BR will receive an SNR above some prede.ned threshold, regardless of the intruder s path?


This means that |Ri s| indicates the number of pull requests that the sink node issues to si.

re i Rs i indicates the requests that the sink node can ful.ll.


CONCLUSION In this paper, we studied di.erential games in networked environments with constrained communication resources leading to delays, losses and .nite rates in information state updates.We limited our focus to a pursuer-evader game known in the literature as asset protection , and formulated optimal strategies under communication constraints, established bounds on the information requirements of these strategies, and derived scaling laws for these bounds.

we showed that the min-max optimal pursuer strategy of the full information game extends to networked games, provided that the sampling period and the delay for the evader state information updates scale linearly with the pursuer-evader distance.


Compared with the popular lazy release consistent protocol, our protocol shows better performance in most of the cases.

our protocol shows performance improvement of up to 29% for the case of 3D FFT.


We study the convergence rate of bandwidth shares for constant a, where convergenceisde.ned asbeing within0.1% of the opti mal bandwidth shares.

we are interested in studying the sensitivity to a.


In a .at2hier scenario, some routers change their next-hop towards destinations E1 and E2.


Under threshold, there exists a near-linear relationship between R1 s SNR and R2 s PRR, as shown in Figure 3(b).

fading correlation induces approximately linear relationship between the quality of R1 s link and reception probability of R2.


The adaptive approach achieves performance gains also in terms of average delay and energy consumption.

the average delays under the adaptive scheme are 2.01 and 1.34 seconds for the balanced and unbalanced topologies.


For these reasons, the objective of this paper is to explore the capabilities of underwater MIMO links, and to leverage these from the perspective of higher layer protocols, and in particular at the medium access control layer, with a cross-layer design approach.


A network enforces an NIDS detection policy i. the event speci.ed by the policy always raises an alert.

for an event E : (S, D, L), an alert should be raised if any packet in L leaves a host in S and arrives at a host in D. if L .


The next experiment is designed to investigate the performance of single path routing algorithms with practical tra.c patterns.

our optimal oblivious routing algorithms (OSRM2 and OSRM3) group SD pairs in a certain way so as to guarantee worst case performance.


The fusion algorithm in Section 4 accomplishes this task by using measurements from n> 3 sensors.

it exploits the availability of more sensors to produce a robust solution in the presence of noise (i.e., background radiation), statistical errors (due to the random nature of the source being measured), and measurement errors (due to the limited sensor e.ciencies).


Recent versions of semiconductor roadmaps show that technology improvements are generally slowing down.

improvements are continuing in some dimensions (e.g., cost-per-transistor), slowing in others (e.g., speed), and recessing in others (e.g., power, reliability, and resilience).


The standards for communication between vehicles are speci.ed by the IEEE WAVE (Wireless Access in Vehicular Environments) standards [15] in United States.

the physical (PHY) and the media access (MAC) layer of the WAVE standards are speci.ed by the IEEE 802.11p standard [3].


Since transmitting messages is the most cost intensive factor in WSNs, it is crucial that the transmitted messages are short.

the message sent to the sink should be short since the transmission of this message involves multiple forwarding en-route sensor nodes.


At the node level, analytical models for all the most common hardware blocks were proposed even before the advent of WSNs.

detailed energy characterizations are available for hardware circuits, sensors and microcontrollers [8], memory banks [7], and radio circuits [9][15].


The insight behind thisisthat,with multipleco-located staticsensors, n their spatialRSSdiversities arelimitedtotheirgeographical area, whereas a single mobile sensor canfully exploit spatio  (1-.n)M +2.n NM Ms (11) temporalRSSdiversityasitkeeps moving aroundtheentire =+ , sn 2 2NoPR1+.n cell, the area of which is much larger than the correlation n o where sn 2 is the variance of the test statistic,i.e., sn 2 = N2 .

ms we would like to express PMD in terms of sensor speed, i.e., vn.


This statement is of course based on the fact that the characteristics of each UA should not be limited on what is defined in [6], but be extended with information about the access networks that currently serve a user.

we claim that the connection to a certain type of access network is a capability of a UA and should be recorded.


As a consequence, various simulators rather limit the range at which any signal can propagate and thus can interfere.

disregarding the radio range model effectively used for the received signal strength computation, the simulator does not generate receptions at nodes further than a given range from the source.


Based on our experiments, even though each NIC receiver has 3 antennas, the spatial diversity is not signi.cant enough.

the mouth motion s impacts on di.erent links in one NIC are quite similar.


4.2 Transport-layerAnalysis In this subsection, we look into the transport layer and analyze how TCP and UDP packets each contribute to the signaling load.

we focus on signaling load due to different types of TCPpackets.


These can be realized in different ways, either by manual identi.cation of boundary nodes during deployment, or by automatic detection of holes.

there are ways to detect some samples of sensors on the boundaries of holes by only the connectivity of the network.


While several approaches for achieving multicast service survivability have been proposed in the literature, their suitability for deployment in large scale peer to peer networks is still an open issue for research.

loop detection and guarantee of connectivity upon failure in a multicast tree are some issues that could pose problems in large scale overlay networks.


Our algorithm is intended to update the current network con.guration to adapt it to variations in the tra.c load.

our algorithm determines which radios need to be turned on (and on which channel) or o. to keep the required level of performance given the new tra.c load, without changing the channels assigned to radios that stay on.


Such a broader view point of the spam traf.c potentially reveals the global behavior of spammers.

it potentially captures snapshots of many spam campaigns, each of which targeting many destination domains.


A pre.x is inserted as a child of a node withF alse, otherwise the longest matching pre.x.

a parent-child relation in a AS number X, and returns true, if the origin AS of the pre.x p is not X and X is in the AS-PATH of p; otherwise, it returns false.


For instance, considering a desired CTR rc = a, then the granularity is limited by g = eaµ/(ln(eµ) - 1).

supposing a =1/2 and µ = 10, then the granularity cannot be greater than 16.


We demonstrate that our multiclass DCF analysis is a versatile analytical framework when combined with the IP-layer queueing analysis, where the QoS performance, statistical multiplexing gain, admission region, contention window design, fairness in resource sharing can all be investigated.

we show through numerical analysis that the proper selection of contention windows plays an important role in improving the MAC capacity for a larger admission region, while the optimal contention window for each class and the maximum admission region can be jointly solved in our analytical model.


We are exploiting our past experiences on the field to achieve this goal.

two prototypes have been realized over the past two years: one for BT, which implements the LSSH scheme (see section 4.1.1) along with NCSOCKS1 (see 4.2.2), and the other for Wi-Fi, implementing the handoff detection (see 4.1.2) and the Multimedia Streaming facility2 (see 4.2.3).


As analytically proved in [25], if the radio transmission range is at least twice as large as the sensing range, network coverage implies connectivity.

as long as the set of working nodes completely covers the monitored region, the network is connected.


As in the previous case, the number of nodes affects the TDMA cycle length, and consequently the power consumption.

as the number of nodes increases new slots are added to the TDMA cycle, and therefore the duty cycle of the radio is reduced.


This leads to the notion of robust .-sM The symbolic RCF-execution SExec: This semantics is de.ned by taking the de.nition of the computational RCF-execution, and by replacing all computational operations by the corresponding symbolic operations.

the symbolic and the computational RCFexecution are essentially the same algorithm, one operating on terms, the other doing the corresponding operationsfrom the computationalimplementation.


In this paper, we show how users of a supercomputing facility can perform remote, interactive visualization of time-varying data stored at the facility by using a combination of pipelining and image compression.

our test results show that to keep up with parallel rendering rates image compression plays a key role.


(log n) probes, with probability at least 1 - n1 , .


We design Micro-Play so as to explicitly use local connections between smartphones and exploit overhearing over the shared wireless medium (WiFi).

we host the games locally, i.e., one of the phones acts as a server and the others act as clients.


priority + 1; 17 B U I L D(t+, mt); that its value is increased by one after each output of an FT rule.

bU ILD assigns each FT rule with a priority identical to the order in which the rule is added to the FT. BU I LD processes a node t according to its type.


Numerical results obtained through computer simulations show that the transmission is possible, given a certain threshold.

the performance has been evaluated in terms of outage probability.


Accordingly we can categorize these nodes either as PA nodes or ch nodes.

we can view n1 to n3 as PA1 to PA3 and n4 to n7 as ch4 to ch7.


many multimodal lognormal distributions have a ccdf that is approximately straight.


In our system, we capitalize on an infrastructure with a ubiquitous, wide-area network to help enable the creation of a local mobile ad-hoc network in an e.cient, scalable, evolvable, and manageable way.

in an architecture inspired by softwarede.ned networking, we decouple the control plane and data plane in the mobile devices and shift the control plane to a centralized controller.


ATMOS provides a virtual link interface, which pretends to meet the requirements of IP subnets, over MANETs.

existing protocols designed for IP subnets are operable over the MANETs without any modi.cation.


We wish to explore just how far it is possible to go to improve performance.

we seek to answer the following questions: Conventional network stacks support zero copy for OSmaintained data e.g., .lesystem blocks in the buffer cache, but not for application-provided HTTP headers or TCP packet headers.


One explanation of this could be that like any other active probing based topology collection tool, tracenet is a.ected from rate limiting routers or ISPs.

routers or ISPs regulate their responsiveness to probes based on the tra.c load or any other rate limiting policies.


Lemma 1 can be easily proved based on the de.nition of optimal fair rate allocation, as in De.nition 3.

lemma 1 reveals an important property of optimal fair rate allocation; this property will be used later to establish the equivalence between optimal fair rate allocation and optimal QoM-aware rate allocation under some settings.


We obtain the import update pattern by feeding the wildcard update to the import policy of each neighbor.

two import neighbors belong in the same import group when the following update pattern attributes are identical: local preference, communities, prepending.


However, maintaining order of delivery between TPDUs transmitted on different streams is not a constraint.

data arriving in-order within an SCTP stream is delivered to the application without regard to data arriving on other streams.


In this case, the destination has a routable IPvN address, its home domain advertises this address into the IPvN-Bone routing topology and hence all IPvN routers know how to forward the packet through to that address.

in this case, routing is based entirely on the IPvN destination address, using the IPvN routing protocols.


Together with the computational soundness of encryptions and digital signatures in CoSP, this implies the computational soundness of the applied p-calculus with encryptions and signatures.

the result shows that CoSP is capable of embedding a formal calculus that is well understood and accepted by the scienti.c community, that is expressive enough for expressing and reasoning about stateof-the-art protocols, and that is accessible to state-of-the-art veri.cation tools.


policies may favour unimportant data and thus restrict error propagation [13, 10].

in error-prone environments such as wireless networks important data may be stronger protected using selective FEC and ARQ policies in order to reduce extra bandwidth demands while preserving signal .delity.


However, distributed localization algorithms cannot perfectly estimate every nodelocation [10].

target-tracking algorithms are highly dependent on node positions so that the impact of localization errors need to be exploited.


The simulation results show that for one-TCP connection Bypass-AODV performs similarly or better than TCP under AODV.

this behavior is rapidly changed with increasing the physical distance between the end nodes beyond 2 hops.


From the table, we see that CFA dramatically reduces the TCAM space requirements over XFA.

cFA requires 92% and 95% less the number of TCAM entries on Bro1 and Bro3 respectively.


Hence, there are several mechanisms implemented in the layer2 and layer3 network to enhance the service reliability.

two static layer 2 paths for both datasets.


The results show that Japanese commercial traf.c has modest growth rates over the last three years.

the average annual growth rate of residential tra.c has been 27% from May 2005 through May 2008.


WMN has different features from cellular networks.

the hidden node and exposed node problems are very important in WMN.


In this paper, we focus on the deployment of proactive DDoS mitigation by an Internet service provider on behalf of its customers.

we allow a provider to protect customer traf.c up until the customer s access link, after which the customer has the ability to protect its own infrastructure and servers.


We also plan to perform a more in depth analysis on the dynamic window approach to estimating the current channel bandwidth.

determining if it tracks the change in bandwidth in the most efficient manner.


First, we should look beyond port and address distributions for .ne-grained anomaly detection.

we should consider distributions that complement each other in their detection capabilities.


A component that uses the link weights to .nd a good path for a given destination.

the link weights are combined to form a path metric.


DISCUSSIONS In this section, we discuss how to setup the parameters of the algorithms and their impacts on the performance.

we .nd that the algorithms can save up to 22% of the energy consumption without sacri.cing the throughput.


Next, in section 4 we provide a set of recommendations to guide researchers in designing more e.ective wireless experiments.

we discuss some of the considerations that may impact experimental results and how interesting wireless scenarios might be set up.


For the lengths of the sessions, however, we allow general probability distributions.

we assume the session length of stream i is determined by an arbitrary probability distribution Di.


Measurements were conducted under identical conditions and up to 4 client cards of the same vendor were used in each trial.

cisco 350 series AP and Cisco 350 cards, Linksys WPC-11 cards were used.


The choices of the nodes in V  R are independent of the choices made by nodes in R. Hence, we can use the principle of deferred decisions as if all choices made by nodes in V  R are made after R has been determined.

first, the choice w of a gossip partner that u contacts at round r has constant probability of being outside R. Second, applying Lemma 4.2, we obtain that round r su.ces in expectation for w to obtain m from v in a path P that does not intersect R. Pw(r) contains a path P originating from v that does not intersect R. Accordingly, with constant probability u obtains in round r a new path for m that does not intersect P u(r).


While we have looked at how to reduce the number of ancestor changes in the system, another important direction is to reduce the perceived impact of an ancestor change.

mechanisms such as maintaining applicationlevel buffers to smooth out interruptions could help while the affected descendants are looking for new parents.


In the paper we present a game theory framework to describe the interaction among the network providers that cooperate by using only a few (or even one) access networks.

we use the cooperative game theory that mainly deals with the formation of cooperative coalitions, that allow the cooperating player to strengthen their positions in a given game.


sequence can also change with only modest changes in the participant movement speed.


Mirage allocates time on a heavily-used 148-node wireless sensor network testbed.

we focus on observed strategic user behavior over a four-month period in which 312,148node hours were allocated across 11 research projects.


In fact, if we count the actual improvement ratio samples that were negative, we got under 2% (see Table 1).

over 98% of the time, the TCP-DOOR had improved the performance of TCP .ows when the network is uncongested.


In practice, Weighted Fair Queueing (WFQ), a packet- by-packet protocol, is often implemented to emulate the fluid behavior of GPS.

wFQ gives priority to the packet that would finish traversing the link first under GPS.


The transmission range of a base station is also assumed to be r. In other words, a base station can only directly serve nodes within distance r. The total data rate that a base station can serve all ordinary wireless nodes is at most Wc bps with Wc = Wa.

a base station can serve at most W. c .ows if each .ow requires a data rate .. Each base station is connected to its adjacent base stations (at most 4) by wired lines or wireless channels (using frequency different from the frequency used between ordinary wireless nodes).


These two different steps (hospital to CI, CI to researcher) are modelled as two different abstract protocols.

they are represented in TRIPLEX as sequences of messages (Figure 2a): we indicate the format of the messages and the type of information that they contain.


Combing (12) and (13), we see that .N (gI ,s)-S(gI ,s)=0when gI =a2.

the .rst two linear segments on Fcoincide with S. When gI <a2, Property 4 implies that the deviation .N (gI ,s)-S(gI ,s)is positive.


From the perspective of game theory, the resources are e.ciently utilized for increasing system throughput and/or maintaining fairness.

for the optimal relationship of system throughput and fairness, every point (i.e., resource allocation) on the tradeo.


We believe that our .ndings are not unique to the stub network used in our measurement study, but also hold in general for other stub networks.

the prevalence of the shared AS path segment in the Internet is corroborated by our analysis of BGP data from the Routeview pro ject [4].


{1,...,K}), the feedback requirement is MT real scalar values when using the receive ZFB.

the vector feedbacks {.ik}MT For instance, user 1 in the given i=1 .


We show that, for a large spectrum of parameters p and q, the reachability threshold is by several orders of magnitude smaller than the .ooding time.

we show * A part of this work was done during the stay of the second author at University Paris Diderot as Invited Professor.


An overload is said to occur when both classes use up their entire allocations (resulting in saturation) or the queue of pending requests exceeds a threshold.

(i) Median,(&) 1 Rbe and Perc,(U,t) > R,t; or (ii) qbe > Q or qrt 1 Q, where Q is a large threshold.


Although they introduce sophisticated measures of document similarity, they report that most clusters of similar documents in a large crawler data set contain only identical documents.

simple aliasing is the dominant form of similarity in their workload.