InSection4, weshow the correct methodology of using the protocol interference model.

by combining reality check mechanism and appropriatesetting of theinterference rangeintheprotocol model,itispossibletoobtaincomparable resultsunderboth models.


With JPRA-MT we observed higher gains with the 20MHz channel width.

our results (Figure 8) indicate that JPRA-MT delivers upto 75% more network throughput than Standard Rate Adaptation.


2.3 Comparison with MAODV MBEAN has been implemented as a reactive routing protocol.

the route is formed only when there is a message available to be multicast.


Thus, the work presented here concludes that if we continue on the path that we are on using TCP Reno as the networking substrate for high-performance computational grids overall network performance will suffer.

tCP Reno s congestion-control mechanism induces burstiness and dependency between streams which ultimately limit the effectiveness of statistical multiplexing in routers.


As the density increases, the delay for all protocols decreases.

degree has the lowest delay, while CC has the highest.


The examination of acquisitions of companies points to the potential of signi.cant growth in aggregate data.

the acquiring company has older data that they could not have otherwise obtained.


Moreover, as expected, Geosphere s throughput gains increase with the condition number and ..

for the 2 × 2 case, Geosphere can provide a throughput increase of up to 47%, while for the 4 × 4 case it can be more than two times faster.


Figure 3: Con.ict avoidance based on receivers Note that these conditions are in general stronger than what is needed for avoiding con.icting transmissions.

it is possible for two transmissions not to have any con.icts even if they do not satisfy any of these two conditions.


4.2 API to Export/Import State We leverage our taxonomy to design a simple API for NFs to export and import pieces of state; it requires minimal NF modi.cations.

we leverage the well de.ned notion of a .ow (e.g., TCP or UDP connection) and our de.nition of state scope to allow a controller to specify exactly which state to export or import.


We also consider a CT that seeks opportunistic use of licensed spectrum in the same region.

cT is considered as a SU to both systems, and it is then allowed to use licensed spectrum only if doing so does not interfere with PUs belonging to either WiMAX or HSDPA.


Suppose the average progress be R' by using the analysis in [26] and the transmission range be R. Then the minimal ideal hops should be l/R,but the expected minimal hops in our real sensor network is l/R'.

the distance we evaluate is always R/R' times of the real distance.


The rank of usable path P is de.ned to be one plus the number of edges in the longest path in G from vertex d to vertex P. In particular, the rank of path dis one.

because G is an acyclic graph, if there is an edge from P to Q,then Q is ranked higher than P.if Qis either an extension of Pto some node, or has the same origin as Pbut more weight, or, having the same weight, is less preferred, then Qis ranked higher than P. The ranks of paths of G can be determined recursively, noting that the paths of rank jare those that have no edge pointing to them in the graph obtained from G by withdrawing all paths with rank less than j.


In Figure 12, we show a snapshot of the network connectivity for each of the considered propagation schemes.

figure 12(a) shows the connectivity graph computed using CORNER.


These can be broken down into two broad categories: pricing based [2, 3], and reputation based [4, 5].

previous work in this area includes virtual currency [2], in the form of so called nuglets, Basically, intermediate nodes charge a price for performing packet forwarding.


Even if some other node is transmitting a reasonably similar signature, the listening interface may not .nd a high correlation due to the differences in their frequency offsets and other hardware idiosyncrasies [12].

the frequency offset naturally creates some dissimilarity between the signatures, helping in keeping the signature short.


For that reason, our approach may delay the sending of packets in case of energy constraints.

the value for f(v) is incremented in order to reduce the frequency of packet transmissions.


Monitoring using Gossip protocols for Aggregation This section summarizes one of our recent results in the context of robust and scalable monitoring.

we report on a gossip protocol, G-GAP, which enables continuous monitoring of network-wide aggregates.


Hence, each of these items must be re-inserted in the table.

for inserting one item, we need to reconsider all and only the items in those kbuckets.


These rules work under the assumption that Prop.2 and Prop.3 are satis.ed.

for any goal de.ned for an instantiated parameter, there are facts de.ning the subgoals of the goal, and these subgoals are de.ned for 3The .nal impact depends on the symbol of the relationship.


Let {(R1(t),...,R|E|): t =0}, be the rate process associated with the network.

ri(t)is the packet rate on link i.Eat time t=0.


While this reconfiguration algorithm works in combination with the basic algorithm CBTC(a) and in combination with the asymmetric edge removal optimization, we must be care- ful in combining it with the other optimizations discussed in Section 3.

we must be very careful about what power a node should use for its beacon.


We design a universal augmen v tation scheme that overcomes the O( n) barrier.


If the current token node is 1m, then set token status to balanced and pass the token to master node 0m+l .

we basically undo the updating (piconets merging) caused by the previous node leaving event.


The agent is generated by the source node, and only the source and destination nodes are authorized to control this agent after authentication.

intermediate nodes cannot encrypt and decrypt any information through this agent.


Tag sets aggregate analogously to pre.xes.

a descriptor X subsumes all other descriptors Y that contain X.


This definition is independent on how a particular level of communication density is created.

a large number of vehicles transmitting messages at low power as illustrated in Scenario 1 in Figure 1 below could produce the same communication density as by a smaller number of vehicles transmitting at a higher power as illustrated in Scenario 2.


In .g.6, the relationships between pairs of nodes aredepicted asthey emergefromthetaxonomyproposedin [14], where the followingcategories are distinguished: whole one shot day all > 5 min latency 2.87 h 1.48 h 2.83 h broad mean latency 6.63 h 2.55 h 4.74 h cast median latency 6.68 h 3.85 h 3.95 h max latency 15.73 h 5.04 h 24.41 h mean # hops 4-9 3-7 2-10 coverage 98% 100% 44% min latency 1 1 1 uni mean latency 2.91 h 40.42 57.73 cast median latency 2.21 h 33.62 46.12 mean # hops 2.98 2.81 2.97  community: high number of contacts with long duration;  familiar stranger: high number of contacts with short duration;  stranger: low number of contacts with short duration;  friends: low number of contacts with long duration.

the mean has been used as a criteria to discriminate among classes, for both the number of contacts and theintra-contacttimes[7].


These algorithms have the attractive property that they achieve a desired bandwidth utilisation at equilibrium.

at equilibrium, every link j is either at the target utilisation Cj, or else, increasing .ow at that link would cause another to exceed the desired rate.


4.4 Import and Export Filters At the beginning of this section, we stated a reciprocity assumption according to which we infer the import .lters: if a RS member is (not) blocked by the export .lter it will also be (not) blocked by the import .lter.

if an AS is willing to send tra.c to a RS member it will also be willing to accept tra.c from it.


DACON performs the search process in the incremental manner, as opposed to many other distributed search engines which always inquire the same set of peer nodes.

the user in DACON .exibly decides how broadly the query will be distributed in a single DACON or across multiple DACONs.


This scenario corresponds to .ows carrying variablebit-rate traf.c, such as MPEG video streaming.

we assume each of .ows 1 5 generates one packet with probability 0.9, and each of .ows 6 10 generates one packet with probability 0.6, at the beginning of each interval.


Therefore, the results presented in this paper hold for a broader class of network scenarios.

both immobile and mobile networks with an arbitrary mobility pattern are in this class, as well as networks whose nodes are able to maintain any number of simultaneous transmissions and/or receptions.


Furthermore, dynamic switching will be unimportant to the design; the choice is a matter of economics.

because the core will not change often, circuits can be provisioned manually without any loss of functionality.


7(a), where the age packet delays, respectively, when the different link metrics are distribution of data delivery delays is reported for the Full Metric used.

when the full link metric is adopted, the aver-(the delay distributions associated with the other two competing metrics is omitted for lack of space).


BLOCK CODING So far, we have not allowed to algorithms to perform block coding, i.e., strategies that combine several consecutive function computations that correspond to long blocks of measurements.

data aggregation was only allowed between data of the same measurement cycle, not between subsequent cycles.


Given a Poisson traffic arrival distribution, we derive estimates of the sector blocking probability.

we present lower bounds that are independent of the specific call allocation algorithm, and also examine specific call as- signment algorithms such as Repacking, Least Busy and Op- timal Random Routing.


Although these new devices are not been directly used for the task migration, we believe these elements provide us the interconnection capability between the mobile device and the original task executor.

these elements could be used for constructing a continuous adaptive connection through di.erent network nodes to solve the mobility problem while the remote resource continues the task execution.


This implies that improving the reliability of the DNS lookups will go a long way towards improving the overall web browsing experience of the clients.

it is important to address the performance of the .rst mile (i.e.


A Euclidean lattice L is a discrete subgroup of Rd that spans the Euclidean space Rd as a real vector space.

there exist d vectors {v1,...,vd } in L that are linearly indepen .d dent over the real numbers such that L = {k=1 ak vk |ak .


We do not use these simplifying assumptions in subsequent sections.

we stress that our algorithms are designed to operate in a symmetric fashion on both uplink and downlink tra.c.


In the case where the two available channels consist of an average and a bad channel (Figure 2), we see that diversity consistently outperforms the single channel con.gurations.

when 0.90 = Pmin = 0.95 the improvement is dramatic, e.g., for Pmin =0.94 diversity delivers an improvement of more than 400% in ER.


The above condition requires i to equalize the weighted mean rates of all upstream links whenever possible.

it requires i to assign bandwidth to the upstream links in proportion to their aggregate .ow weights.


Since Wi-Vi has a single antenna, the received signal will be a superposition of the antenna arrays of the moving humans.

instead of hav ing one curved line as in Fig.


In this paper, we systematically explore the design space of acknowledgment-based protocols to identify a packet dropping adversary on a forwarding path.

we investigate a set of basic protocols, each exemplifying a design dimension, and examine the underlying tradeoff between the performance metrics.


A guard interval is employed at the beginning of each time slot to eliminate the tail e.ect of the previous time slots from unintended transmitters.

the use of guard interval in a time slot allows independent PD-IA scheduling of time slots at all nodes in the network.


It is this question of path restoration in response to link failures that we address in this paper.

we consider routing and restoration strategies that provide useful performance guarantees both on the original network and on the network after one or more link failures.


A schedule is said to strictly implement DRF if for all .ows i and j, and for any period (t1, t2) they backlog, we have Di(t1, t2) = Dj (t1, t2).

(1) a strict DRF schedule allows each .ow to receive the same dominant service in any backlogged period.


4.2 Probabilistic Failure Modeling Network devices and links that are experiencing a failure often drop only a fraction of their overall tra.c, depending on the nature of the failure.

issues caused during maintenance or by device malfunctions are fairly common and typically cause small performance degradation or a small packet loss rate (less than 5%).


Our proposed model, that captures the e.ect of overlay graph on the scalability of the system though the relaxation time, canbe usefulin addressing otherquestions as well.

aninteresting futuredirectionof thisworkwould be to investigate the scalability of di.erent query propagation mechanisms, including variants of the above mechanismsthatincludepath replicationorcachingofdataitems.


Therefore, there is a path between v0 and vn that is composed of clusterheads of the nodes on the path p and other clusterheads, doorways or gateways that connect them.

v0 and vn are still connected in the CDS.


If we condition on being in a shorter period of constancy, then we find very similar curves.

if we are not in a period of long-lived constancy, then, per the plot, we find that about half the time we are in a lo-minute interval or shorter, and there is not a great deal of difference in the duration of constancy, regardless of whether we consider one-minute or lo-second constancy, or loss runs or loss episodes.


Therefore, other applications, such as video, which usually starve for bandwidth, could occupy the remaining CFP, which is a large proportion of CFP.

applications like video could be allocated large portion of bandwidth even they are not placed on the top of the polling list.


In our modeling, such transmissions are excluded from the graph.

if direct wireless connections can not be established between v1 and v2, edge (v1,v2) is removed from the wireless transmission graph.


Another sampling rule which follows more or less the same rationale can also be used for G updating i(), as will be explained in the following section.

vt observe that the group mobility model proposed here is very general as there is no need to define reference points for the followers.


After describing the techniques we used to build King, we presented an extensive evaluation and analysis of its accuracy and consistency.

our evaluation demonstrated that the accuracy of King is significantly bet- ter than the accuracy of IDMaps, and that King tends to preserve order among its latency estimates.


As a solution to the above problems, in this work we propose the Fountain Reprogramming Protocol (FRP), which uses a Fountain Code [2] designed speci.cally to meet the needs of sensor network reprogramming.

this Copyright is held by the author/owner(s).


The two tree adaptation heuristics can achieve desirable energy e.ciency while minimizing tree recon.guration overhead under a wide range of tra.c patterns in WSNs.

the pathquality based heuristic can accurately capture the path quality .uctuations in presence of bursty data requests while the reference-rate based heuristic is more suitable for the data requests with unknown durations.


In this paper, we describe our protocol using ICMP.

the proposed protocol satis.es four important properties: stealthiness, lightweight, con.dentiality and integrity, and reliability.


For this reasons, the WBAN MAC protocol should be designed to satisfy all of these different requirements.

qoS is one of the most important issues of designing WBAN MAC protocol.


This is because the constraint of completely eliminating inter-cell interference reduces the antenna usage into a binary form.

one antenna can be used for either transmitting or receiving streams, or cancelling inter-cell interference.


The medium access is made using orthogonal codes (UMTS uses a code sequence called Walsh-Hadamard) [1].

for each slot, every active connection has a unique orthogonal code, so, when the information from different users overlaps, it is still possible to decode each channel.


The outer circle (1a) represents the boundary of decodability for a single-user system.

in the absence of all interference, a user within the outer circle would be able to decode a signal from the transmitter, while a user outside the circle would not.


A direct attempt at adapting the three-step approach of [20] to more general latency functions fails immediately.

for non-linear latency functions (even for quadratic latency functions), there is no constant c for which a scaled-down version f/c of a Nash .ow f is optimal for the reduced tra.c rates r/c.


However, we must be careful to preserve application and overlay semantics.

if dynamically switching maintains the same endpoints on route requests (as RON, above, does), then the switch is permissible.


This result stands in sharp contrast with several previously proven facts.

roughgarden and Tardos [20] studied a related model in which network users may carry more than a negligible fraction of the overall tra.c and showed that the cost of routing sel.shly is provably larger in general networks than in networks with parallel links; Roughgarden [17] showed that the equilibria in a Stackelberg game related to the tra.c model of this paper are 1For example, it su.ces for the class to satisfy a mild and standard convexity assumption, to be closed under multiplication by positive scalars, and to possess some latency function that is positive when evaluated with zero congestion.


In such schemes, dense regions of objects are considered a cluster and low density regions are considered as noise.

we selected DBScan [20], since it is well known and offers several advantages: it automatically determines the number of clusters (contrary for example to the k-means algorithm); it is robust to noise, i.e., isolated samples; and .nally it does not have any bias versus any cluster shape.


3.1.3 Optimization Schemes Strategy 1: In the stragegy 1, the simple mobility model is used.

to reduce geocast latency error time(i.e., to reduce Pc), we have to decrease geolocation update time interval, r. as the mobility model will show, Pc ~ 0 as T ~-+ 0.


Assume node 0 has a piece of data (B bytes) that nodes 1, 2, ..., k need at times .t,2.t,..., and k.t, respectively.

the data is used only at the respective times at each node.


4.3 Lower Bound on Eavesdropper Throughput We carry out an analysis similar to the one in Section 4.2, to derive a lower bound on .E(n) in our construction.

we obtain su.cient conditions for .e(n) such that: lim P(.E(n)= µ)=1,forsomeconstant µ> 0. n.8 We derive a lower bound on .E(n)that is independent of d and hence the phase of operation.


The DUCK s clock is considered to be in sync with the external source when the offset error is within +lO ticks at the synthetic frequency.

for the Dag3 architecture the maximum offset error will be around h-600 nanoseconds.


Initially, level-0node(the source)is always awake andtheprobabilitythatit receives thepacket withdelay0is100%.


We thus can establish the desired cost-e.cient communication backbone by .nding the minimum cost path for each pair of gateway nodes iand irn.

the desired mini im mum cost backbone is an undirected graph (also a spanning subgraph of PCG), denoted by MCG(s), where the set of 2A multi-hop path may exist which has a smaller aggregate cost than ..


Having evaluated the packet clustering technique in isolation, we now explore how this technique can be used to perform complex tra.c analysis attacks.

we demonstrate that the ability to associate packets with their transmitting devices with relatively high accuracy provides su.cient information toperforma sophisticated website .ngerprinting tra.c analysis attack in which the source of an encrypted HTTP session is discovered using only packet size information [4].


Also, for large values of k, the matrix L is extremely sparse.

it has many density-two rows (corresponding to degree-one vertices in H).


Our studies show that, on the days without known BGP pre.x hijacking attacks, RBF will on average only .ag 215 AS and pre.x pairs as attacks each day, with the help of a small table to maintain the legacy cross-region BGP announcements.

network operators only need to examine a small number of potential hijacking attacks each day.


Note that a threshold-based design can be both unsafe and inef.cient in the same location.

with the median thresholditis unsafein locations2 and6,but alsowastes a few bins in those same locations.


The focus of this paper is on proposing and analyzing the benefits of proxy services.

our proposed architecture associated with bundling and compression yields significant energy saving.


Moreover, note that the MSS can transmit/receive PSC II packets through this connection during listening windows.

the PSC II connection can wake up to serve packets during listening windows without unnecessary switches from sleep periods to awake periods.


Our proposed algorithm tackles k-redundant edges for k = 2.

we achieve a better result by a means that is totally different from those given in [2, 3].


But the dispersed network might not be dense enough to a.ord the connectivity and coverage requirement and triangulation perfectness.

there might be small regions which are not triangulated in SparseDT graph.


Such a revocation process can possibly lead to chain e.ect.

the registration message of a SP-node previously incorrectly blocked will now continue to propagate until the blocking rule is satis.ed again.


Consistently, we see that less ofhigh priority packets have been generated with DCS-NPDD-MAPS.

dCS-NPDD-MAPS has achieved its superior performance using less of high priority packets, which indicates a more e.cient network utilization.


We illustrate the three above possible scenarios through numerical experiments.

to investigate the .uid limit, we examine the evolution of the number of packets over time in a network that initially has a lot of packets at each node.


This was done to minimize the effects of learning and fatigue on the test results.

we wanted to prevent users from anticipating future test cases based on previous ones or losing motivation to pay proper attention during the pairing procedure.


Since most of the topologies in our data set are .at, we arti.cially built a hierarchy (i.e., the separation in zones) in order to consider scenarios in which hierarchical con.gurations are needed.

we grouped routers according to geographical information present in the name of the routers.


The subsections above describe the dif.culties we faced in doing so.4 These observations prompted us to modify our goal from inducing cooperative behavior to preserving cooperative behavior.

we wanted to design a system that stays cooperative if it starts with cooperative nodes.


3.1 MAC layer enhancements Channel Bonding: Legacy802.11 devices operate on 20 MHz channels [13].

each 802.11b/g channel is 22MHz wide, while each 802.11a channel is 20 MHz wide.


In the following, we will show how such modules interact and access the data structures whereas functionality details will be given in the next section.

as to the data structures, besides the already presented XML schema each peer maintains the Semantic Mappings that provide the connections with its neighbors.


CSI: First, the control plane must be able to measure, collect, and learn channel state information (CSI).

nodes must be able to measure CSI by overhearing tra.c or through an explicit channel sounding/probing procedure.


Finally, power-law graphs can arise in a number of ways (see [1]).

they occur as a protocol objective in Freenet [9], and in networks in which the access link capacity has a heavy-tail distribution and a node s degree is made proportional to its access link capacity.


To preclude such manipulations, we propose a combination of lightweight cryptographic methods and incentive engineering.

we take advantage of the presence of multiple sellers in envisioned applications.


While this basic idea is rather simple, it leads to some interesting perspectives and requires several non-trivial optimizations to minimize overhead.

we de.ne a hierarchical k-level partitioning of a .le, which is determined by parameters b0 , b1, .


The reason why VF+comp and VF+comp+int have fewer good requests is due to longer response time, in which case some of the requests were classi.ed into tolerable requests.

both the VF+comp and VF+comp+int cases had the same service capability, but had slightly longer response times.


We want to know the expected downstream bandwidth at the next time step.

from Figure 2(b) above, this yields: X cf(x0, 1) = p0j · bbw(xj ) (1) .j the expected downstream network bandwidth one step in the future is the sum (over all states in the Markov chain) of the best bandwidth observed at each  Figure 3: Example Markov model with best-bandwidth results.


Routers forward data to their outgoing interfaces according to the interface s speed, therefore links always remain fully utilised.3 Each interface of the router keeps track of the requests that it has forwarded upstream (towards the source) for all other interfaces, per unit time.

each interface calculates the following ratio for each of the rest of the interfaces of the router: Reqs for Ii yi-.i = (1) Reqs for "Ii- where Ii is interface i and Ii- are the rest of the interfaces.


The contributions in this paper are manifold.

we: thoroughly examined and quanti.ed the interaction between TCP, on-demand ad hoc routing and wireless 802.11 MAC protocols, illustrating the signi.cance of such interaction, analytically investigated the TCP operational range and used the insight from that investigation to propose the fractional window increment (FeW) scheme,  evaluated our proposed scheme over a variety of scenarios and showed signi.cant improvement over legacy TCP,  compared our proposed scheme to recent related work (namely, ADTCP and LRED) showing the signi.cant advantages gained by using the FeW scheme.


Then, using Bayesian game theory, we investigate the equilibria in the incomplete information game and derive the equilibrium strategies for each node.

we have derived equilibria to achieve location privacy in a non-cooperative environment.


Such networks are formed in an ad-hoc manner, relying on the wireless transmitters of the participating devices.

each device s transmitter has a limited range.


Probes were generated every 40 ms, and the collected loss traces were fed to the loss estimation process that drove the path switching decisions.

the loss parameters of each path were estimated every no r 3 minutes (probes), which was also the time granularity of path switching.


The MERIT ratio is to be computed by taking the mean of the weight ratios for a large number of randomly drawn s-t sessions under the same simulation conditions.

w(P ) MERIT ratio = E.. real ÷÷ = 1 (2) w(P ) « ideal .


We see that TVA maintains the fraction of completions near 100% and the average completion time remains small as the intensity of attacks increases.

our design strictly limits the impact of legacy traf.c .oods.


TDMA makes great use of the advantages of planned scheduling.

scheduling can both prevent collision and estimate the traffic load.


In this paper we review the most recent Locator/ID separation proposal and explore the bene.ts that such an architecture may bring.

we evaluate the improvements that can be achieved in terms of routing tables size reduction and traf.c engineering.


As a case study, we then experiment with ACs in the GPRS network, using a prototype implementation.

we investigate and measure the performance in terms of service and transfer times when ACs are introduced in the mobile environment.


2(a), we observe that, in 80% of the cases, a path contains at least one router that replies with a Full ICMP .

tracebox has the potential to reveal more middleb oxes in 80% of the cases.


Last we compare the proposed policies in the case of multiclass messaging using simulations.

we de.ne two classes of messages with clients subscribing to them arriving with rates .pop and .unpop correspondingly with .pop > .unpop indicating the popularity.


To interpret mobile associations with cell sectors, we .rst need to model where a subscriber is likely to be while associated.

we need to understand the coverage of the cell sectors.


But also proprietary protocols occur in CPV power plants.

manufacturers of sun trackers bring their individual implementations.


7.2 Local Traf.c Matrices Another appealing alternative to collect additional information with minimal cost is to collect local router traf.c matrices.

for the router to keep a table of traf.c from in-interface to outinterface.


In fact, they assume all nodes have an in.nite number of packets to be transmitted and, as a consequence, the probability of collision is constant over time (an exception can be found in [9] but for the case of IEEE 802.15.4 networks).


A clear bene.t of this categorization is that it cleanly decomposes any given OD .ow into its principal features.

we can reconstruct each OD .ow in terms of three constituents: the contributions made by d-eigen.ows, s-eigen.ows, and n-eigen.ows.


Second, the theoretical framework of metarouting is to be found in the long tradition of path algebras (see [7, 2, 19] for several examples).

the means of describing routes and comparing route preference is captured in algebraic structures having rigorously de.ned semantics.


However, the z value determined by Eve can potentially correspond to any possible x.

the observation of z does not reduce the entropy, which means mutual information is zero at Eve, and Eve cannot use z to recover the original symbol s; i.e., we achieve perfect secrecy for the header and the payload (provided that B is secret).


4.7 Enforcement of System Management Actions The usage of SDN in our risk analysis environment is two-fold: it manages flows according to applications requests and creates a feedback loop into the system.

when the SDN application receives a notification of the existence of an anomaly, it can decide to initiate some countermeasure (the Data Fusion component in the Figure 1 does not make such decisions).


It is well known that acoustic power decays, at a minimum, as the square of the distance from the transmitter.

doubling distance causes a 6dB decrease in the received power.


we give the correctness theorem stating under which conditions the results of the abstract analysis entail computational security of a cryptographic protocol.


5.2 Basic Idea in Channel Assignment with Synchronous Base Stations The CAWM class of channel assignment algorithms operate at the carrier level.

a base station acquires an entire carrier and assigns all its channels, i.e., TDMA slots, to users in its cell.


This background prepares them to tackle a comprehensive approach to WSNs, taking advantage of the fundamentals that they have learned so far.

while they have learned programming and design and have experience with applications and projects, including hardware-software co-design, they have not had experience with low-level (system and communication) programming and debugging.


In OAR, the total packet transmission times for the three data rates are approximately equal.

the times taken to send 5 packets at 11 Mbps, 3 packets at 5.5 Mbps, and 1 packet at 2 Mbps are approximately the same.


First, it runs TopTracker, which is capable of emulating any desired OSPF topology, making the target router behave as if the emulated topology exists behind a TopTracker interface.

topTracker generates LSAs for all nodes in a given emulated topology and floods the LSAs to the target router.


As the .gure shows, the NMF-based algorithm has a lower false positive rate on average, and its standard deviation reduces to 0 when the number of samples is more than 30.

in the balanced topology, the NMF-based algorithmcanalways .nd thecorrectFGsgiven enoughfailuresamples.


The .gure shows that the QAC algorithm is able to control l(t) so that it properly follows step increases and decreases in the available bandwidth.

the transient times required for l(t) to match bandwidth increases/decreases are less than 20s.


3.1 TIE Ranking Metric Our mechanism allows each router to have a ranking of the egress points for each destination pre.x.

router i has a metric m(i, p, e), across all pre.xes p and egress points e. For each pre.x, the router considers the set of possible egress points and selects the one with the smallest rank, and then forwards packets over a tunnel that follows the shortest path through the network to that egress point.


Figure 33 also shows that, as in the 2-hop scenario, TCP achieves optimal throughput when it uses an unclamped transmission window 0.

tCP-uc throughput is about 13% higher than TCP-3 throughput.


There are also strong demands on energy-ef.cient designs of 3G resource usages because of the growing popularity of 3G-powered devices, such as smartphones, and their serious energy consumption problem.

researchers have explored power management in communication-parameter control with respect to traf.c patterns [19].


Unless specific border nodes are provided, we implemented the early exit peering policy for an upstream ISP to select an intra-domain path to a downstream ISP.

the upstream ISP uses the peering point closest to the source (or ingress border node) as destination for path computation and selection.


As mentioned before, due to the lossy links, some MAC protocols such as 802.11 retransmit lost data frames to guarantee high delivery ratio at network layer.

one successful packet transmission at network layer may be the result of a number of transmissions (including retransmissions) at MAC layer.


The n-tuple of mixed strategies ( q1,··· ,q n) previous theorem: is said to be a relative .-Nash equilibrium, if for each i, " mn n 1 = i = n, we have: di( q1,··· ,q i-1,q i,q i+1, ··· ,q n) = XX X ae 2 ( qj,ewj )di( q1,··· ,q i-1,q, q i+1, ··· ,q n)+., forall q .S( qi).

f(Q)= ße qj,ewj + 2 e=1 j=1 j=1 a n-tuple of mixed strategies( q1,··· ,q n) # n X is not a relative .-Nash equilibrium, if there exists some i, 2 qj,e +ae qj,ewj (1 - )1 = i = n, and some q .S( qi)with 2 j=1 di( q1,··· ,q i-1,q, q i+1, ··· ,q n) Proof.


The goal of this work is to explore the interdependencies between the three functions in order to maximize the bene.ts from their deployment.

we want to: (a) understand the capabilities and bene.ts that one should expect from each optimization function, and (b) identify the conditions that are conducive for applying these functions in isolation or in combination.


In order for W to be able to pass the packet to Y, the links (X,W) and (W,Y) must not be broken and must be bidirectional.

the probability that W can pass the packet to Y and then inform X is p = [(1 - PB )(1 -Pv )]2.


Using the result in lemma 1, we propose to decompose the transmission range of radius r of a sensor node si , denoted by rr (si ) , into nccb = »r / dmin ÿ CCBs centered at si with interior radii 0 , dmin , , (nccb -1) × dmin , and exterior radii dmin , 2 × d , , , respectively.

each CCB min nccb × dmin has a width equal to .


Informally, we call a policy local when the handling of a connection depends only on its neighborhood at a router, i.e., the previous and next hops.

at each router, .ows are grouped into super.ows according to (input port, output port) pair.


Decode Forward (DF): In the LC mode, if the relay successfully decodes the source frame, then we can exactly create a 2 × 1 multiple transmit antenna situation.

we can implement a distributed Alamouti scheme by using the decoded symbols at the relay in cooperation with the source.


Tie persistence: It is the stability of ties across time as number of time-ticks in which a link is observed, over the total number of time-ticks.

pij = P Aij (t)/m, where Pij is the persistence of tie eij , Aij is 1 t if users i and j communicated in time-tick t and 0 otherwise, and m is the total number of time-ticks.


popularity is the fact that cell-based CIOQ switches with Lmax/2 - 3, regardless of the speedup used.

packet-mode schedulers cannot emulate OQ switches (with no relative queuing delay).


Although these are interesting results that characterize the Internet in a new way, it is important to note that this is a work in progress.

there are several interesting observations that need further study in order to understand their implications.


Despite the fact that the YouTube video search is the number one source of views in aggregation, the related video recommendation is the main source of views for the majority of the videos on YouTube.

for a large portion of videos with lukewarm popularity, the major source of their views is from users clicking related videos.


Collision Performance We next provide an analysis of the collision performance of Channel Selector.

we analyze the probability for a listener to successfully receive its broadcasting of interest, with the presence of hidden broadcasters.


The latter component raises a major challenge for the IDS as vehicles will continually enter and exit the area covered by the WSN.

the addition (elimination) of nodes into (from) the WSN should not trigger frequent responses that may lead to excessive false positives (that is, raising false alarms about non-existing attacks).


We replace active requests whose deadline falls outside the window, withequivalentsmalleronesthat fits within the window.

the smaller request has deadline t +W and has demand proportional (according to time) to its current unmet demand.


The path taken by a message can be determined at the source.

in the case of the Internet this can be obtained separately through a traceroute call.


(4) The three proposed solutions vary signi.cantly in performance, whereas the two variants of each perform close to one other.

using ERMT instead of Patching for serving clients with bandwidth capacities of 2b or higher is of less signi.cance than changing the solution.


A re- ceiver with longer transmission delay get less share of band- width.

rainbow inherits TCP's property of unfairness on transmission delay.


Most HCs (93%) displayed certi.cates from CAs which had more than 100 certi.cates in our total sample.9 This is strikingly di.erent from reports by some other researchers.

netcraft [13] in January 2008 reported approximately one quarter of the certi.cates in their survey as being self-signed.


The proposed distributed routing solutions are tailored for the characteristics of the underwater environment, e.g., our solutions take explicitly into account the very high propagation delay, which may vary in horizontal and vertical links, the different components of the transmission loss, the impairment of the physical channel, the extremely limited bandwidth, the high bit error rate, and the limited battery energy.

our routing solutions allow achieving two apparently con.icting objectives, i.e., increasing the ef.ciency of the channel by transmitting a train of short packets back-to-back;and limiting the packet error rate by keeping the transmitted packets short.


We then realized that some of our proofs apply directly to the mixed case as well.

lemma 1 should be relaxed to deal with reals instead of integers as follows: Lemma 3.


To our knowledge, our paper presents the .rst comparative study of energy consumption characteristics of all three technologies 3G, GSM, and WiFi that are under widespread use today.

our study of the energy consumption characteristics of 3G reveals signi.cant and nonintuitive implications for energy-ef.cient application design.


Finally, we note that, in practice, each node may start with i =1 (or anyother agreed upon constant) and run until atleastits respective estimate of dlglnn is reached before terminating for some constant d = 3.

there is no need to start at exactly round i = 3lglnn;indeed, nodes maynot agree on such a value and we discuss thisfurtherinSection4.2.


What is surprising, however, 0.6 is that the (observed) spam emails from botnets are switching away 0.5 from dynamic IP ranges to static IP addresses.

the 0.4 Fraction covered by most common hash value 0.1 0  percentage of spam campaigns that had at least 80% of dynamic 0.3 IP addresses dropped signi.cantly from 52% in November 2006 to 0.2 0.1 14% in June 2007.


Furthermore, the architecture we designed has a number of advantageous security properties.

malicious location updates by unauthorized hosts are prevented.


between fast change detection versus false alarm of change detection.

when the detection window size is small, for instance in the order of four samples of Z(m), there is a high potential of false change detection.


De.nition 3: A random geometric graph G(n, r)is a geometric graph in which the n nodes are independently and uniformly randomly distributed in a metric space.

it is a random graph in which the link existence probability p between two nodes u and v is determined by their geometric distance in a way that p =1 for .u - v.= r and p =0 otherwise.


We then present a vision for further research in this area as well as for the practical realization of a content-based network.

we discuss the implications of content-based communication for the network, the middleware, and applications.


As the AoA measuring procedure run by ACMod is concerned with only the relative phase offsets between the RX USRP2 units, we simply need to align the phases of the RX USRP2 units to one of them (e.g., the .rst RX USRP2 unit).

we can calibrate the i-th RX USRP2 units by subtracting .


So the IU cannot take a serious decision in this case and the best way of handling the situation is by requesting that the reporting nodes start more focused monitoring on the suspicious behavior.

the IU will broadcast a request to keep monitoring the suspicious behavior over a longer period of time in order to get more information about its nature.


Sub-optimal Routing Because the AS is the player who makes the routing decisions on behalf of the users, there exists the potential for a signi.cant moral hazard.

given a .xed amount of tra.c to route, the AS can, will, and (as a pro.t-maximizing .rm) should make decisions which will decrease (or perhaps even minimize) its cost, at the expense of poorer service to the user.


A part of the UAV research effort investigates the use of terrestrial wireless multihop routing protocols.

the analysis of how well mesh and Mobile Ad Hoc Network (MANET) protocols can transpose into the aerial context [18] highlights the interest of using node mobility, either observed or predicted, as a routing criterion.


The maintenance of per-.ow state is avoided by aggregating .ows into traf.c streams.

each node maintains state for each active aggregate traf.c stream between an inhop/out-hop port pair.


Z, the classi.er decides whether (i, j) corresponds to a true zero or a false zero and sets Tb(i, j) = 0 or 1 respectively.

our goal is to set the values of T (Z) (i.e., the subset of the elements of Tbthat correspond b to the indices in Z) in such a way that they agree with the corresponding values of T (Z).


This inequality is true because in Line 4, every demand is increased by at most a factor of 2 and crucially there is no fragmentation: Because demands are all powers of 2, and timespectrum blocks are assigned greedily in non-increasing order, it holds that when a demand DD is assigned, every ij available non-overlapping free space has size at least DD ij .

in the neighborhood of link (vg,vh) with maximal Sgh(t), the only reason why Fmax may be larger than Sgh(t) is the rounding.


In this case, edge qI k q k is J the minimum bridge over Qk I and Qk J .

we have |LE(qi, qj , |k8)| = |LCP(qi, qj , d|k ck)|.


the circuit when wr is added and wt is removed).

wr and wt are mutually alternative to each other.


4.3 Synchronization Concerns An existing mechanism for an anycast CDN with loadbalancing capability maps connections to edge servers at the granularity of an ingress router [6].

the load 0 10 20 30 40 50 60 70 80 Time(secon ds) Figure 8: Queue length versus time.


The main idea of Hovering information is to bind information to geographical locations in ad hoc mobile networks.

a certain piece of information is considered only relevant to a speci.c location.


In this work we want to design a new routing framework for id-based routing.

we want to avoid the long routing stretch caused by unstructured node id space.


This means that the quality of dropped calls perceived by users is significantly worse than calls with low quality.

a significantly small negative value is more characteristic of dropped calls.


When the distance is smaller than but equal to or larger than , misrouting is restricted to a minimal amount by assigning more weights on minimal-path directions.

minimal-path directions gain 50% more weight within this region.


In this paper we propose a different transition with ClosedFlow, illustrated in the bottom half of Figure 1, which allows SDN control over existing legacy hardware.

with no new hardware purchases an SDN controller, such as Floodlight [5] or Ryu [4], can run network controlling applications but instead of targeting OpenFlow switches, legacy devices can be targeted (with no modi.cations to the applications, only to the code that interfaces with hardware).


The harmonic mean can be updated with the most recent measurement of path i, wi(n), and the previous harmonic mean w i(n).


FD Management  A speci.c FARA-derived architecture must include a mechanism in the communication substrate called FD management, to provide FD manipulation and signaling functions.

the ability of an entity to move, changing its logical attachment point, requires a robust mechanism to update FDs to track these changes.


Figure 2: All 1012 alerts against time of day, recorded from 13 buttons deployed at the boys beds.

3) the caregivers must be informed of failing devices within a few tens of seconds.


Moreover, these packets will not suffer the environmental effects that can occur outdoors.

in the absence of collisions, each packet has a much greater chance of successful reception indoors than outdoors.


Centralized buffer organizations have been studied extensively in the macro-network realm, but the solutions proposed are not amenable to resource constrained on-chip implementations.

a unified and dynamically-allocated buffer structure was originally presented in [23] in the form of the Dynamically Allocated Multi-Queue (DAMQ) buffer.


In addition to batteries, the nodes can be powered by external energy harvesting boards.

we use Cymbet s CBC-EVAL-10 and CBC-EVAL-9 energy harvester boards (Figure 1).


Moreover, the GUI allows the users to set up the per-application policies and display the aggregated traffic over each active interfaces.

in Figure 3 it is showed a handover of the whole traffic generated from the interface eth1 to the interface eth0.


The node will generate another beacon if the CCA checks indicate busy medium, or will go to sleep otherwise.

on our MICAz motes, if at least 20 consecutive CCA checks indicate busy medium during this time, the RI-MAC adaptation code noti.es the BeaconManager of a collision; the BeaconManager then generates another beacon with a larger BW value, if necessary.


As a part of our main current investigations, we are validating our context modeling approach.

we are investigating how the assumption of decoupling context models and context provision management (Section 4.2) may limit our usage scenarios.


In other words, CtS on an average conveys a data frame size of 12 bits using 2 signals.

for k signals transmitted, CtS in effect transfers 6 * k bits of raw information.


Instead, our algorithm is designed to trade off between running time and the probabil- ity of missing some tags.

in the QT t protocol, if the reader receives no collision on a query string q, it will repeat sending the the same query string until it detects a collision or the same query has been sent for l times.


We note, however, that the above analysis only captures two extreme cases, and does reveal the true complexities associated with the authentication problem.

the analysis does not re.ect the possibility of an adversary capable of witnessing some APs and hence who possesses partial knowledge of the challenge pattern.


2.1 Intuition in the Continuous Case Picture the following continuous variant of our problem: Given a (possibly non-simply) connected region R .R2 and some point p .R we call that point seed , we consider the isolevels of the geodesic distance function dp from p in the domain R as in Figure 2.

for any point x .R, dp(x) denotes the minimum Euclidean length of an open curve G .R with one endpoint being p, the other x.Or in other words, dp(x) is the length of the shortest path from p to x which stays within R and avoids all holes.


We will not know the true F2(Se(t)) unless we do per-.ow analysis for each parameter setting, which can be prohibitive.

instead we use the estimated second moment F2est(Se(t)), as long as F est 2 (Se(t)) closely approximates F2(Se(t)).we try to .nd parameters that minimize the estimated total energy of F est forecast errors t 2 (Se(t)).


(i.e.CMT=false; denotedbya redlineonacolour plot).

the results obtained from the measurement look similar to the simulation results.


In addition, note that our approach produces only one inconsistency example per pair of di.erent output results.

we do not provide one examplefor eachpath thatproducestheinconsistency.


Thispaperpresentsthehigh-level concepts anddesigndecisions used to realize the key routing component of the MobilityFirst architecture, which is a clean-slate project being conducted as part of the NSF Future Internet Architecture program.

we describe GSTAR, a mobilitycentricgeneralized storage-aware routing approachbased on thefollowingkeydesignprinciples: separationof namesfrom addresses, late binding of routable addresses, in-network storage, and conditional routingdecision space.


3.4 Constraints Our proposal aims to accurately model the routing behavior of ad-hoc networks.

our model considers the following aspects: Nodes try to connect to the closest gateway with respect a routing metric.


For each complete graph, the link weight from node i to node j represents the capacity in terms of bit per second from node i to node j using a particular technology.

bCij and LCij represent the capacity from node i to node j by using the backbone and local technologies respectively.


According to [12] a graph is a line graph, if and only if it does not contain any one of 9 speci.c induced subgraphs.

the following graph is one of the 9 subgraphs, with vertices of Figure 3(b) labeled appropriately to show the correspondence.


To explore these issues, we have conducted extensive simulations for different conditions.

we have considered a simple, yet realistic scenario in which traf.c load is generated according to the statistics of actual web traf.c.


This occurs because our implementations are designed to maximize CPU/GPU utilization even if the number of input packets is low.

we still use a large number of threads by having each thread match the same packet on a different fraction of the rule set.


within proxy .ows, 56% of handset-issued RST packets are delayed by at least 1 second.


However, some path measurements might be unavailable.

measurements for the new path of an AS x .


Therefore, we expect that the breakdown load (or the asymptotic load value where the mean end-to-end delay approaches in.nity see Figure 1) for the deformed network (lower curve) will lie to the right of the breakdown load for the original network (upper curve).

the deformed network topology has a higher breakdown load.


For both problems, we derive key structural properties of the corresponding optimal strategy.

we show that it has a threshold structure and can be described by an index policy.


Since OF actions preserve the dependency relations, the result ONF fragment inherits a subset of the dependency from both operands.

considering a result and Rright rule Ri,j that originated from Ri left .


Now suppose we extend the prefix string by two bits.

the reader will query q00, q01, ql0, and qll.


However, the problem of contract signing becomes di.cult in this setting, since there is no simultaneity any more in the scenario of computer networks.

the simultaneity has to be mimicked in order to design a digital contract signing protocol.


Therefore, special treatment of the graph is required by a variety of network algorithms and protocols.

many geometry-oriented algorithms, such as geometric routing [1 4], autonomous localization [5, 6], sensor coverage [7], network segmentation [8], and distributed data storage and processing [9], all depend on a typeof subgraph called triangulation.


In this work, we demonstrate that it is feasible to successfully receive and decode OFDM modulation while sampling below the Nyquist frequency.

we show that a standardscompliant 802.11a/g frame transmitted at 6 or 9 Mbps can be detected, received, and decoded by a receiver running at a 50% or even 25% clock rate given suf.cient channel quality.


Also note that the criteria and the conditions to compare the different routing algorithms are based on former research [11], and are not in the scope of this paper.

this paper focuses on how the adaptation is carried out in the proposed system rather than the validation of why it is carried out; the reasons for which are clearly outlined in the former studies.


Importantly, A2 does not a.ect the .ow requests (to establish the call), periodic bandwidth requests (to maintain the call), and tear down requests (to terminal the call) that traverse in contention slots.

we do not observe any drop of packets belonging to primary application.


Earlier, others studied the effect of detail in radio propagation models on wireless network simulations [5].

they found that simple radio models can sometimes be effective in cases where either the applications or the metrics describing the applications are insensitive to the abstractions in lower layers.


Dynamic Routing In this approach, the routes from a node to a sink will depend on the position of the mobile relays.

the sensors need to know where the mobile relays are and redirect their packets according to the current position of the mobile relays.


sensor sleeping energy, and the energy required by the sensor node to measure its phenomena.

the wireless communication is the primary source of energy consumption.


While this approach is very powerful, it can also be sen- sitive to minor protocol violations and variations in im- plementation.

we encountered considerable challenges posed by network aliasing devices, such as load balancers, that required us to develop multiple techniques.


Such environments include parks, malls, streets in a city or other social gathering places where citizens interact.

an e.cient mechanism for selecting services to complete a request and forward service parameters to corresponding devices in an opportunistic network is proposed.


By induction, we easily i=1 i get that |T(k)|=2k-1 for every k =1and 1 =i =qk.Thus i qk =n/2k-1 for every k =1.

the number of phases of the construction is at most plog nl.


The ETT metric for a route is the sum of the ETTs for each of the route s links.

srcr assumes the following relation between the throughputs ti of a route s hops and the route s end-to-end throughput t: 1 t = P(1) 1 i ti This relation is reasonably accurate for short routes where at most one hop can send at a time [24].


Although the current version of OVX presents all the core features expected from a network virtualization platform, we are currently designing three additional functionalities that will improve the usability and the performance of the tool.

we are focusing on: Snapshotting and migration of vSDNs: in a virtualization environment, the ability to preserve the state and data of a Virtual Machine (VM) at a speci.c point in time has become a key functionality.


Hence, our proposed two-level antenna cancellation solution based on phase o.set can be readily extended to MIMO systems by using standard linear antenna array con.gurations.

to generate an N × M MIMO +FD system, we start by placing two sets of antennas (N transmit and M receive) on two perpendicular axis to allow for N × M MIMO (in each direction of FD) as shown in Fig.


Yet, in WPF, if the system wants to share resources fairly between users, it can give one time slot to each zone successively as it is done in WPF(1,1,1) where P(az)=1/3.

the probability to choose a user will be 1/3· 1/10(recall that users in the same Zone z have the 1 to be selected) exactly as in the ideal same probability nz homogeneous system.


entire architecture, not just the aspects that are easy to change today.

we want evolution to pervade the architecture, not be narrowly con.ned to its edges.


3.3.2 Data Transmission After connection establishment, the hosts transfer the data similar to TCP.

slow start, sequence numbers and ACK ing, .ow and congestion control work like TCP.


Recall that, messages are injected be bandwidth.

when two nodes encounter each Delivery Cost tween 3000 to 4000 seconds.


2.1 Incumbents to Protect Within 802.22, the sensing mechanism is designed to offer protection to two types of incumbents, namely, the TV service and wireless microphones.

wireless microphones are licensed secondary users of the spectrum, and are allowed by FCC to operate on vacant TV channels on a non-interfering basis (please refer to Part 74 of the FCC rules)4.


FARA assumes some network communication substrate that delivers data on behalf of associations.

fARA assumes a connectionless2 packet delivery mechanism with appropriate addressing and routing, although it does not restrict the particular choice of mechanism(s).


However, the design of the iWWT requires a careful attention to physical characteristics of the environment.

a scaled wireless environment that mimics realistic short-term and long-term channel variations needs to be developed to implement the iWWT;this paper discusses our preliminaryideas towards achieving this goal.


We present methodology for stressing server placement algorithms and evaluating their effectiveness.

we introduce a novel framework which utilizes empirical measurements for solving the joint optimization of worstcase survival of software services, machines moves, and bandwidth usage.


SIMULATION AND PERFORMANCE EVALUATION  4.1 Simulation Configuration  In this section, we present the performance evaluation of the proposed application-aware handover mechanism using simulator.

we have compared the performance of the application-aware fast handover with that of existing layer 2 handover method based on the IEEE 802.11 standard.


Energy-conservation fairness improves both aggregate system throughput and overall system energy-ef.ciency signi.cantly, because its airtime allocation is determined by considering both aspects of the transmission-strategy diversity: transmission-rate diversity and transmit-power diversity.

it improves the aggregate system throughput by more than 25% over that of airtime fairness and more than 2.5 times that of the DCF.


According to our formalism, the latter may be found in di.erent phases of its life, where each phase is constituted by one or more stages.

we de.ne six possible phases for the reference node, which are depicted in the diagram of Fig.


In[16]theauthorshavede.ned analgorithmwhich allowsto estimateit.Theterm DQk has been de.ned as in (7) to make a positive contribution when the instantaneous queue length qk is lower than its previous value, and a negative contribution in the opposite case.

the AWM gateway detects the bandwidth availability when the instantaneous queue length decreases, and informs the TCP sources by proportionally increasing the suggested window value for each of them.


This knowledge can be used for unicast communications.

the following functions are considered: Greedy (G) online: the utility of a relay increases with the number of times it has encountered the message destination so far [9].


Part of this experience has led to the idea of producing modular components that can be used to improve many other protocols.

.ooding is one such candidate for modularization, because it is undergoing constant improvement and because the performance of .ooding has such a dramatic e.ect on the performance of the protocol overall.


Third, we only append discriminating keywords.

if for some (clumsy) coincidence the name of the company located in San Jose was UniBasel, the con.ict would have produced the names john-doe-sanjose and john-doe-csdept.


INTRODUCTION The Internet is less and less about flows moving between static end points, but more and more about information disseminated across a large number of potentially mobile nodes.

the information super-highway has evolved into a complex organism of information diffusion, questioning the current analogy of cars and trucks on the information highway in this new very heterogeneous network infrastructure and device ecosystem of today.


Thus, in this example, we may safely discard the packets for any index C that have more than 24 packets.

we may safely discard any subproblems that would cause us to perform more than 38 = 6561 checksum tests.


With the exception of the top set of nodes in each column of the .owchart, the connections between the other six sets of nodes match those of the PA* case.

the .rst node in each group is connected to the .rst node in the neighboring groups, etc.


All our approximation factors are independent of network characteristics.

they are independent of the number of network nodes and the maximum degree of nodes in the network.


Therefore, afewhoursdelayin sending out alertsis acceptable.

thisis adelay tolerant application and the theBusNet is anideal networkforit.


The following result establishes that this condition is necessary and su.cient for .G(V)= .G.

to allow for maximum throughput achievability we must choose V to ensure that the path concatenations on these nodes form all missing paths in the network.


In our scheme, the initial value of DRMFT (DRMFTini)is set to highest data rate (54 Mb/s).

.rst multi-path trans Figure 9: Detailed procedures of HMR algorithm.


Within a single time-interval, the algorithm tries to maximize proportionally-fair spectrum usage by greedily assigning frequency intervals to nodes with active demands.A demand is called active if its duration spans the entire timeinterval [tcur,tcur + G].

demands are rounded to the next higher power of 2.


After having obtained the control of the simulation the application module checks whether any inter-vehicle communication events have to be considered.

the application examines if conditions in the current tra.c situation require the transmission of new messages.


(2) Tmu + Tu At the end of this time, the mobile will have become reachable if either Xu elapsed .rst (with probability Tmu/(Tmu + Tu)), or Xmu elapsed .rst and the new BS whose coverage area the mobile entered is reachable (which has probability Tr/(Tu + Tr).

the total probability that the mobile will be reachable after the time min(Xu, Xmu) is « « Tmu Tr Tu pr = + .


Therefore, to calculate the value of ResidualAirTimei[n], we let each node explicitly exchange the perceived channel status with the nodes within its carrier-sensing range.

we let each node broadcast its BusyPeriod table as a BUSY_PERIOD_REPORT message on the control channel to its carrier-sensing neighbors every Tbx seconds, where Tbx is referred to as the busy period exchange interval.


However, this link model does not conform to the classic model.

the link layer does not do everything for you.


We are also exploring how to combine these traces with other data obtained from the network infrastructure to address some our current limitations.

we would like to be able to identify what IP addresses where in use by what user at what time to combine our browser sessions into user sessions.


The Duration/ID .eld of the MAC header of each multicast data frame has to be modi.ed.

the virtual carrier-sense mechanism provided by the MAC should take into account the extra delay for multicast ac Figure 4: Receiver side of a 802.11 WLAN board Goodput[Kbps] 800 700 600 500 400 300 200 knowledgements.


=(.1,.2, ··· ,.n-1,.n) (or generally .S ) bits/sec is feasible if there is a spatial and temporal scheme for scheduling transmissions such that by operating the network in a multi-hop fashion and buffering at intermediate nodes when awaiting transmission, every node vi can send .i bits/sec average to its chosen k - 1 destination nodes.

there is a T< 8 such that in every time interval (with unit seconds) [(i-1)·T,i·T ], every node can send T · .i bits to its corresponding k - 1 receivers.


Constraints (4), (5), and (6) express conservation of .ows [16], i.e., each source generates a .ow, which is collected by an actor.

constraint (4) guarantees that a source node generates a .ow on the tree of the selected actor, and only on that one; while non-source nodes do not generate any .ow.


Internal ad hoc routing mechanism should be ef.cient, scalable, robust and with low signaling overhead.

the wireless part of the network has a lower amount of resources compared to high-bandwidth wireline networks.


Other research has focused on improving accuracy of ns2 [10].

considerable e.orts have been made in the vehicular networking community to extend the ns2 design to incorporate an accurate physical interference model, which is however tailored to vehicular scenarios [3].


In order to enhance this algorithm, we plan to modify it, so that it will also take the history of previous interactions into consideration.

we plan to use a learning algorithm that will also take into account the outcome of previous data transfers when specifying the transport mechanism for future ones.


Furthermore, the solution should be scalable; in practice this translates into being as stateless as possible.

the routing protocol should not require storing a lot of network information at nodes (i.e., SCs).


To this purpose we implement a modi.ed version of the L-IDM driver behavior, whereby some drivers brake and slow down.

one third of the drivers, when approaching the braking platoon (i.e., in the 100 m of road preceding the critical point), decelerate uniformly, down to a speed no lower than 70% of the average speed of the simulation (e.g., 90 km/h for the 130 km/h scenario).


When comparing two paths, .rst it is compared their bandwidth and if they are equal, then is compared the number of hops.

for origin and destination nodes, no and nd (no = nd), let be p(no, nd) and k(no, nd) two different paths connecting them.


In this section, we argue that this fact happens by no chance, but it is a consequence of the triangular inequality argument, which, although not valid as far as energy is concerned, turns out to hold (under certain assumptions) for multi-hop interference.

assume that the radio coverage area is a perfect circle, and that nodes are randomly, densely distributed.we model the distribution of nodes in (2-dimensional) space according to the Poisson process with given density parameter ..In this scenario, let N(S) denote the number of nodes in the surface S,and let µ(S) denote the measure (i.e., area) of S;then -.µ(S) (.µ(S))k Prob(N(S)= k)= e .


Several studies report on the rapid growth of this market; the market for network security appliances alone was estimated to be 6 billion dollars in 2010 and expected to rise to 10 billion in 2016 [8].

middleboxes are critical part of today s networks and it is reasonable to expect that they will remain so for the foreseeable future.


In deploying Mirage, we made the early decision to base the system on a repeated combinatorial auction known not to be strategyproof.

self-interested users could attempt to increase their personal gain, at the expense of others, by not revealing their true value to the system.


So, the heterogeneity of devices, the user s participation and a large amount of information to be processed and handled, present a risk for the survival of future paradigms and the new techologies that are on the way [3].

we are concerned about problems that may make the security and QoS inconsistent.


In TTDD, a sink updates its location by .ooding a local query to reach an immediate dissemination node, from which the query is further forwarded to the source along the grid.

given a .xed sensor density, the bigger the network area, the bigger the number of sensor nodes involved in the forwarding process.


Second, having the transmitter instead include only the statuses that a receiver is interested in would add signi.cant processing delays for the transmitter on sensor nodes with limited CPU resources.

since a transmitter does not in general know which neighbor will wake up next, the transmitter could generate the appropriate footer only after receiving the beacon from a neighbor.


Securable Intra-AS Communications: We assume that communications within an AS can be made secure if the AS desires to do so.

an AS may prevent source address spoofing within its network using any anti-spoo.ng method such as ingress .ltering [11] or link-layer security protocols [1].


7 Recently, network researchers have begun to explore how to achieve some of the tantalizing benefits promised by QoS through strategic provisioning alone.

they have begun to ask a more formal version of the question "how much bandwidth should we throw at the problem?"


After describing the techniques used in King, we present an extensive evaluation and analysis of the accuracy and consis- tency of our tool.

our evaluation shows that the accuracy of King is significantly better than the accuracy of IDMaps, and that King tends to preserve order among its la- tency estimates.


So, the medium will be free from update packets 98.8% of the time.

for only 1.19 % of the total time, the medium gets blocked by update traffic and the medium is free for 98.8 % of the total time for data communication processes.


Though Portolano proposes an infrastructure based on mobile agents that may appear to differ from our model, agents are an implementation option of our model.

agents interact with an application and the user, and appli- cations must be developed to utilize the agents.


When an as path contains an as set, we will remove the as set from the path attribute in determining the origin AS of the (aggregated) pre.x.

we consider the .rst AS following as set as the origin AS of the corresponding pre.x.


Discussion The directory service is designed for easy deployability on the Internet today while guaranteeing at least as much security as is currently obtained from the X.509 PKI used in TLS.

a client C checks an X.509 certi.cate chain leading to the long-term public key for server S, in the same way that web browsers today check such chains.


Then, we present qualitative examples highlighting the bene.ts arising from assigning encoding and decoding responsibilities across a collection of routers in an intelligent, coordinated fashion.

we show how this: (1) leads to ef.cient memory usage, (2) ensures RE-related tasks can be performed at full capacity, and (3) enables incremental deployment.


An overlay approach to name-based routing, by contrast, allows the access control policy decision to be made anywhere in the Internet.

it allows access control to be widely replicated and therefore more resilient to .ash crowds or DoS attacks [40].


While at high density the performance of both approaches is comparable, we see that at low densities BVR performs much better than greedy geographic routing with true positions.

while the success rate of the greedy routing is about 61%, the success rate of BVR reaches 80% with 30 beacons, and 90% with 40 beacons.


As a result, the value of e is dependent of f, and only f is required by our algorism.

our proposed evolution model for UAG requires six input parameters {a, b, c, d, f, PI Q }.


As traf.c changes over time, or as tasks enter and leave, an algorithm that continually estimates task accuracy and adapts resource allocation to match the desired accuracy (as discussed above) will also be able to achieve temporal multiplexing.

such an 2Operators may not wish to express and reason about accuracy bounds.


Here, the admission of a new user will significantly degrade the ongoing attached user s flows as well as gaining revenue for the operator.

the operator payoff increase corresponds to a user payoff decrease.


In our experiments, TransCom can reduce the client access latency by 2-3 times and improve the video playback quality by 2-20 times compared with the thin-client systems.

we .nd that when the number of clients is small (= 4 in our setup), thin-client systems can achieve lower client latencies than TransCom since the servers perform all computing tasks.


Recently, two studies have provided .rst insights on using passive network tra.c measurements, like NetFlow or packet traces, to detect and characterize network outages.


Most of identities never participate actively in this protocol (they do not transmit any message), but they have to be prepared just for the case of being chosen.

they just perform some local computations.


Let C be the feasible region of resource allocation.

the resource allocation vector x is feasible if x .C.


Higher arity nodes necessitate a routing policy to determine in which of several valid directions to forward a message.

in a network where all nodes are of arity 1 there is no need for a routing policy (although distribution of paths is still a required function).


For rate selection, recent work has made headway by measuring symbol-level details of packet reception.

softRate uses the output of soft-Viterbi decoding for each symbol to estimate the bit error rate (BER) [28].


Suppose further that the network uses either loop veri.cation or path veri.cation.

then there exists a BGP compliant strategy for m that uses rm(·) = vm(·) and obeys all-or-nothing export, which obtains the best possible stable outcome in terms of the utility function of m. On an intuitive level, Theorem 5.1 proves that any gains a manipulator gets from lying can be obtained by using a clever export rule.6 Theorem 5.1 shows the existence of an optimal allor-nothing export rule for the manipulator; however, this optimal export rule for m depends on the export rules chosen by the other nodes in the network.


This is because the Exploitability keeps Functional while there is no official fix ( Workaround was used for Remediation Level value) for this vulnerability at the time of calculation.

the vulnerability has been around for some time but the vendor has not released any official solution for it yet.


In the most basic form, p simply sends µp to q, and q applies E to all / mappings in µq .


3.3.1 Internal Calibration We .nd that it is possible to internally calibrate the base station relative to one of it s antennas, e.g., antenna 1.

we .nd all calibration coe.cients bm.1 (for m =2, 3, ...M) using Equation 2.


We next examine the e.ect of removing our two assumptions.

1) instead of the victim knowing the values of the qu exactly, it only has the information provided by the packets it has received: a series of samples from the probability distribution.


The genre-based weight pp G is then calculated as the cosine similarity between the user s genres and program s genres: G gu · gp pp (u)= (5) gu gp We can combine this with the previous predictor as follows: G+H HG pp (u)=max(pp (u),pp (u)) (6) Clearly, more sophisticated predictors can be developed.

we experimented with an item-item collaborative .ltering-based predictor, that predicts new accesses based on similar items accessed in the past.


The key contribution of our paper is to show that the maximum congestion in the lnternet scales poorly with the growing size of the Internet graph.

the maximum congestion for shortest path routing is at least as bad as n l+fKx), with the exponent de- pending on the exponent of the power law degree distribution of the graph ~.


[3] analyze the performance of the SCTP failover mechanism when used as a handover solution in multihoming scenarios.

they focus on di.erent radio channel variation patterns and di.erent degrees of link level reliability.


It is clear that most node dynamics, including birth, death, and net growth, happen mainly to the stub nodes.

one may note that the stub nodes net growth rate is 3.6 times of the transit nodes .


Although the rules overlap, which means a packet may match multiple rules, the packet only takes the action of the rule with the highest priority.

each point in the .ow space has a unique action (which is denoted by the shading in each spot in Figure 4(b)).


Several research efforts have focused on the detection of, and/or protection from, FCEs and DDoS attacks.

aggregatebased Congestion Control (ACC) is introduced to deal with such attacks by limiting the rate of (large) aggregate traf.c at the routers to reduce the impact of the added load on the underlying network and end-servers [21, 23].


To facilitate our later discussion on duality results in Section 4, we further re-formulate above LP.

we multiply both sides of (6) and (7) by T(which is a constant representing a given network lifetime requirement) and denote ViBfiBT, Vik fikT, VmifmiT.


9/10/06/...$10.00  One of the objectives of this paper is to examine the accuracy of (2.7) for a variety of scenarios in wireless and wired networks.

to determine the impact of the Coefficient of Variation of both the arrival and packet size distribution on the delay in such networks.


Additionally, the link lifetime metric plays a significant role in speedy environments, whereas the power control contributes to the performance of low speed scenarios.

the synergy effect of link lifetime and power control is observed through the simulation results.


THE MODEL Consider a computer network, such as the Internet, in which every node can transmit a data message to any other with proper acknowledgement if successful.

in its proper state the network is connected.


Note that there is a limit to the e.ectiveness of client tuning because server-side protocols also have a signi.cant impact on performance.

the TCP sender could be any host on the Internet.


PROMISE: Peer-to-Peer Media Streaming Using CollectCast Mohamed Hefeeda, Ahsan Habib, Boyan Botev, Dongyan Xu, Bharat Bhargava Department of Computer Sciences Purdue University, West Lafayette, IN 47907 {mhefeeda, habib, botevbi, dxu, bb}@cs.purdue.edu ABSTRACT We present the design, implementation, and evaluation of PROMISE, a novel peer-to-peer media streaming system encompassing the key functions of peer lookup, peer-based aggregated streaming, and dynamic adaptations to network and peer conditions.

pROMISE is based on a new application level P2P service called CollectCast.


If MPs in a mesh network should carry intensive tra.c transmitted from a lot of end stations, the performance of DCF-based IEEE 802.11s may be signi.cantly degraded [8].

the wireless medium between the MPP and its neighbor MPs may become a natural bottleneck because a lot of data packets are forwarded to/from the Internet through the MPP [9, 10].


As shown in Table 3, any closed range can be represented using fence encoding using a single ternary entry.

2W -1 bits are suf.cient for an encoding to reduce the worst-case expansion to 1.


2.3 Robot to Localization The localization of a robot moving around a certain operation area is accomplished by means of interacting with a Beacons Network (BN) which is comprised of fixed nodes and are aware of their position (absolute coordinates).

a robot is able to associate the BN Nodes (BNNs) falling within its coverage radius and to send them a beacon message; upon the reception of which BNNs reply with a ranging message (either in the Receive Signal Strength Indicator (RSSI) or ultrasonic domain).


In the model, we assume that immediately after a website recovers, its popularity is restored to its previous value.

once a website has been cleaned, the administrator informs the search engine and the blacklisting is removed without delay.


That is, the increase of delay jitters has raised the probability that a player will leave the game in every instant by 24%.

assuming an ideal case that the additional delay jitters induced by TCP could be avoided, the user departure rate is expected to decrease by 20% (1/1.24 0.8).


Based on such diversity, several researchers attempted to enhance network availability, focusing on concurrent (or alternative) use of multiple wireless technologies available on a host, a mobile user or a designated mobile center [8, 12, 17].

they have attempted to improve network availability within a single individual multi-homed entity.


Furthermore,the additional information for each link provides for relatively accurate topology validation and decreases the chances of using stale routes.

the link reliability is directly related to the expected link lifetime and is used as an additional explicit criterion for nodes to remove possibly stale links from their topology view.


We performed comprehensive tests of ten state-of-art HTTP libraries and mobile browsers, many of which were found  to not fully support or strictly follow the HTTP 1.1 caching speci.cations.

among the eight HTTP libraries, four (three for Android and one for iOS) do not support caching at all.


For error resiliency, we focus only on AM.

we look at how SDUs are discarded in the RLC layer: using a method of retransmission-based discard (RBD), an SDU can be discarded before successful transmission.


Note that a node that has identi.ed n different domains tries toput (n - 1) packets belonging to different forwarding domains between two packets of the same domain.

the proposed dropping algorithm attempts to put as different domains of packets as possible within any successive n packets.


Consider, for example, an attacker that knows the distribution of S in Table 1.

he might know that 129.132.115.90 has tentimes more tra.c than129.132.115.5.


According to the schedule sequence, it will then notify a certain STA that it is scheduled to obtain the transmission opportunity to transmit data by broadcasting the beacon frames.

the AP won t poll the STAs that have no data to send.


A single host cannot thwart an attacker with overwhelming resources [30], but MinimaLT protects against attackers with fewer resources.

minimaLT dynamically increases the ratio of client (i.e., attacker) to server resources needed for a successful attack.


VCG payments guarantee the strongest possible result for the restricted case: truthful behavior of all nodes leads to a dominantstrategy equilibrium.

a rational node s best strategy is conveying its true preferences no matter what the preferences of the other nodes are.


Client requests would, hence, no longer be forwarded to the failed servers.

iP anycast already ful.lls a good deal of the restrictions on technologies for deploying distributed media servers as presented in IV.


In this paper, we take a fresh look at the resilience of opportunistic forwarding to these challenges.

we introduce and promote the use of metric envelopes as a resilience assessment tool.


Furthermore, the system is con.gured so that the local decider modules signal coordination modules immediately after a change to the status quo is required.

coordination initiates without checking if the conditions that triggered the process persist over a certain period of time.


For those IPs that pass the checks of the certi.cate, we extract the names for which the X.509 certi.cate is valid and the purpose for which it was issued.

we check the following properties in each retrieved X.509 certi.cate: (a) certi.cate subject, (b) alternative names, (c) key usage (purpose), (d) certi.cate chain, (e) validity time, and (f) stability over time.


Simulation results show that the both proposed rerouting algorithms perform better than other previous proposed algorithms.

the MRCAW rerouting algorithm yields lowest connection blocking probability among the rerouting algorithms.


We argue that, to develop a data collection algorithm for wireless sensor networks, application-specific requirements need to be deeply understood and carefully considered.

data granularity as the representation of accuracy must be determined by jointly considering the QoS factors and constrains specified with each specific task.


6.4 Drawbacks of Our Proposed Mechanism The proposed mechanism works well when the datapath in the switches can also extract the values of the packet header .elds used in the match .elds of the pending .ow rules and tables and when the datapath can apply the user selected actions to the packets that match the entries in the pending .ow tables.

there might be some cases where the controllers use header .elds in a protocol, but the datapath cannot parse the packets of the protocol and extract the values.


ACE in the Hole: Adaptive Contour Estimation Using Collaborating Mobile Sensors Sumana Srinivasan, Krithi Ramamritham and Purushottam Kulkarni Department of Computer Science and Engineering Indian Institute of Technology Bombay, Mumbai -400076, INDIA sumana, krithi, puru@cse.iitb.ac.in Abstract This paper focuses on the use of mobile sensors to estimate contours in a .eld.

we focus on strategies to estimate the contour with minimum latency and maximum precision.


When a receiver of the group receives ROUTE-DISCOVERY, it sends a RECEIVER-JOIN packet back to the original sender as a unicast message using path reversal.

the RECEIVER-JOIN is relayed along the lowest hop-count path back to the sender, using the stored previous hop information.


Consequently, the number of non-.ltered .ows decreases such that aggregate TCP throughput decreases.

as the burst length increases, the sub-aggregate for which condition (C1) holds enlarges.


After evaluating fitness values for the current population of chromosomes, a subset of chromosomes is selected to use as parents for the succeeding generations.

four objective functions are incorporated in the fitness assignment phase to determine the reproduction probability of each chromosome and pick out the best chromosome reproduction in the tournament selection procedure.


Corruption is de.ned such that the adversary can corrupt the public/private keys of parties (via Fcrypto) and can corrupt instances of MC and MS when they are created.

the adversary can gain complete control over a party by corrupting her public/private keys and all her instances of MC and MS .


We show that because TCP was originally designed for unidirectional and network-limited bulk data transfers, it cannot adapt well to MMORPG tra.c.

the window-based congestion control and the fast retransmit algorithm for loss recovery are ine.ective.


RELATED WORK Tra.c analysis is a large .eld; in this section, we survey work in that .eld that is related to the analysis of anonymity systems.

we discuss prior work on passive logging, pro.ling (or .ngerprinting) attacks, and analysis of countermeasures to these attacks, as these are the most relevant to our work.


MULTI-TARGET OPERATOR PLACE-MENT PROBLEM Multi-target operator placement is de.ned as the process of .nding an operator placement for a given query graph by taking into account multiple targets for operator placement.

the quest is to .nd a suitable sequence of computing nodes that maximize or minimize a certain set of QoS-targets.


By the induction hypothesis, there exists a processor that performs a rightward transmission of M on behalf of a segment in {S(j+f-1)m,...,S(j+f-1)m+W -1} during phase p2(a+f-1).

during superphase .a+f-1, message M is transmitted via a rightward transmission on behalf of a segment in supertile Tj+f-1.


In this work, we focus on proactively mining network events from router syslogs.

we design an automated system (called SyslogDigest) that transforms and compresses massive lowlevel minimally-structured syslog messages into a small number of meaningful and prioritized high-level network events.


In the current literature, most of the defense schemes detect unfair ratings based on the majority rule.

mark the ratings that are far away from the majority s opinion as unfair ratings.


We have shown that the expected weight of feasible solution fIP 1 of IP (1) obtained by our randomized rounding is larger than E(wfIP 1 ) = E(wfIP 1 |ri .

sj )qi,j + E(wfIP 1 | i)q i (2) rj.S there exists at least one conditional expectation in E(wfIP 1 |ri .


One of the important performance measures that error rates do not capture is how uniformly the misclassi.cations are distributed across the population.

it is important that no NIC is consistently misidenti.ed as another one, since otherwise that NIC would be able to masquerade as someone else.


If the users with different speed are approaching a target entity and Entity Radius is set with the maximum speed, more users will be accepted as owner candidates since the size likely becomes too large.

this would cause the users with lower speed to send an ownership request too early, which in turn increases the queue size.


An AS u serving a metropolitan area is likely to have a re- gional provider v, and a regional AS v is likely to have a national provider w; it is very unlikely that a nationwide AS w would be a customer of a metropolitan-area AS u.

if u E customer(v) and v E customer(w), then w ¢ customer(u).


5.2 Network real measurements In order to see the performance of the developed CDN, we measured their behavior in the phase of initialization.

we observed how performs the CDN as the surrogates join the network taking into account their position, the distance with other nodes and the RTT.


This paper presents an analytical approach for the design and analysis of this class of network pricing control.

we propose an approximation method to estimate overall user value arising from all traf.c types, given the routes for QoS traf.c.


The ACTP is an application layer protocol designed to facilitate communication between heterogeneous agents.

we show how the ACTP supports various ways of communication, logical abstraction of the communication process, platform-independence, a naming convention, reliability in message transfers and a degree of flexibility.


When multiple DHCP servers are providing di.erent IP subnets on the same layer 2network,users may usejointhewrong networkbecause, by default, DHCP clients typically listen to the .rst DHCP server that responds to a broadcast.

dHCP lacks the ability to support heterogeneous DHCP con.gurations [4].


If an individual .ow transmits above its assigned rate, it may experience tra.c policing by at least one of the intermediate nodes on the path.

if at an intermediate node the rate of in-out stream to which the .ow belongs exceeds the assigned rate, the .ow will be sub jected to tra.c policing.


Goodput Control monitors the goodput of all TCP flows passing through the gateway and aims at achieving optimal fairness by throttling aggressive wired-to-wireless flows.

in case the Internet gateway IG recognizes that the goodput ratio between the goodput of a wired-to-wireless flow and the mean of the goodput of all flows exceeds a certain threshold S, then IG periodically probes the ability of the slower TCP flows to increase their goodput by throttling the rate of the faster TCP flows down to the value of the mean goodput.


Towards Universal Mobile-IP Robert Elz Centre for Network Research (CNR) Department of Computer Engineering Faculty of Engineering, Prince of Songkla University Tel: +66 74 28 7075, Fax: +66 74 28 7076 kre@munnari.OZ.AU Sinchai Kamolphiwong Centre for Network Research (CNR) Department of Computer Engineering Faculty of Engineering, Prince of Songkla University Tel: +66 74 28 7075, Fax: +66 74 28 7076 ksinchai@coe.psu.ac.th  ABSTRACT In this paper we discuss several issues with the present usage model for Mobile-IP that tend to limit its deployability and sug-gest solutions to most of these practical deficiencies.

we conclude that the Mobile IP protocols and implementations should operate with any number of Home Agents.


indicates a high occurrence of unnecessary cookie use: 73% of all cookied requests are for images and, overall, 34% of all requests are for cookied images.

more judicious use of cookies would likely cut their concurrence by more than half, substantially improving the effectiveness of CDN and client-side caching.


The reason for this is that in this scenario, the losses are dominated by queue drops at the penultimate node.

the system behaves as if there is a single link with 20% error rate.


the transmissions are heard in a circular region.1 transmissions are heard in all directions around the node within the transmission range (as shown in Fig.


For a fair comparison between the three protocols the periodic listen and sleep of S-MAC was only activated during the same window of communication as GWMAC.

nodes sleep (and sense) for most of the time but only communicate during set predefined windows during which all three MAC protocols execute.


Based on previous work, we chose to set the concatenation threshold to one.

when concatenation is enabled, the CM may combine at most one other packet from the queue with the current packet into one DOCSIS frame.


On the other hand, we don t show this in a .gure, but the number of packets that the average ampli.er sends all victims has actually gone up by about an order of magnitude, to somewhat compensate for the reduced number of ampli.ers.

remaining ampli.ers are being put to more use.


INTRODUCTION I n recent years, the electric power grid has been undergoing various changes focused on revamping the existing infrastructure in support of the concept of smart grid.

several countries have been encouraging research, development and implementation of active distribution systems [1, 2].


As shown in Table 2, there were a number of situations in which we could not reliably use the traceroute data for building network-layer topologies.

over 13M IP addresses did not have an associated DNS name with Table 2: Basic results from processing 19 months of Ark traceroute data using the algorithm described in Section 3 .


As expected, when the electrical network is less oversubscribed, the performance gap among the three network designs shrinks.

when the bandwidth of electrical network is higher, the bene.t of adding more bandwidth is relatively smaller.


In column4- , the scheduler ii will scan the terms from top to bottom, when the term is not 0, the scheduler will serve the corresponding flow.

the flows will be served in the following service sequence, 0 2 4 6 810 12 14 maintain any tags or states, SRR can achieve O(1) time time(unit:4ms) complexity, short-term fairness, and certain delay bound at the same time.


For example, have a correct temporal scalable video picture sequence.

reference pictures as I and P frames both are considered as the base layer while the subsequence of the hierarchical B frames are considered as the next enhancement layers.


The common feature shared by protocols based on [14] is that they rede.ne the throughput over an in.nite horizon.

they achieve high throughput at the cost of unreasonably long delay.


ALIAS supports intentional peer links with up*/across*/down* forwarding.

a packet may travel upwards and then jump directly from one HN to another, or traverse a set of cores, before moving downwards to its destination.


A potential improvement of the current work would be the study of more robust learners for use in the path prediction algorithm.

we are considering the promising possibility of employing Fuzzy Set theory for ameliorating the decisions taken by the algorithm.


Regarding its communication capabilities, A is identical to any machine Mi, which means that it can read from inA and write in outA much in the same way as Mi can read from and write in ini and outi,respectively.

this means that A cannot eavesdrop messages that were transmitted by devices that are not neighbors of A.


We have currently implemented all the mechanisms described in this section, except those used for guarding against false negatives .

the ability to calculate an actual location from a list of (AirMonitor, signal strength) pairs is not yet supported by the DAIR system.


More recent references can be found in [14].

there has been a lot of recent progress in designing compact routing schemes for networks of low doubling dimension.


We believe that this is a reasonable assumption given that the existing technologies that facilitate MANET deployment (e.g., WiFi or Bluetooth) only support host movement at low speeds given their reduced transmission range.

these technologies do not support rapid topology reconfiguration.


Every x consecutive time-slots (naturally ordered in time) are mapped one-to-one to the vectors in the ordered collection T above.

each time-slot, tj is uniquely associated with a vector in T as follows: t1 .


While this notion carefully captures that a distributed protocol does not behave any worse than an ideal speci.cation, it however does not capture any form of liveness guarantees, i.e., that the protocol ensures that something good eventually happens.

a protocol that does not create any output or that can be caused to hang inde.nitely by corrupted parties serves as a good implementation of every ideal speci.cation in the sense of reactive simulatability.


Naturally, we will use the VCG(Vickrey-Clarke-Groves) mechanism to induce the truthfulness from all relay agents; and the principal will conduct the routing only if the total VCG payment to all agents is at most its valuation.

intuitively, we will have the following routing scheme described in Algorithm 2.


The proposed allocation policy X is monotonic to all buyers.

if buyer i wins channel j with a bid vector (bi1, .


This allows one to formulate security statements in an asymptotic sense.

all of the above models include a notion of ef.ciency, which is usually a variant of polynomial time.


This ensures that any cycle containing the face f0 will have a total summation of w, and any cycle not containing f0 will have a sum of 0.

one is able to answer range queries by simply integrating the differential one-forms along the range boundary.