However, this would be true for all nonsteganographic privacy mechanisms.

with our approach, the probes do not leak user-readable names and the af.liations of the users.


In fact, prior to these results, researchers had already started adopting an algebraic approach to routing [7, 13, 14].

these algebraic structures may abstract away too many routing protocol speci.c dynamics and some possess properties that are not realistic for contemporary routing protocols.


These policies are typically de.ned based on IP pre.xes.

since pre.xes are assigned based on the topology, changes to the network design require these policies to be rewritten.


Nearly all of those using IEEE 802.11b have studied vehicular networks that incorporate Roadside Units (RSUs).

it has been shown that using IEEE 802.11b without or with simple adaptations to common WiFi models to mimic   Figure 5: Distribution of road tra.c simulators.


The .rst stream corresponds to a tornado detection query, which requires high resolution data in order to precisely pinpoint the location of the tornado, whereas the second stream corresponds to a 3D assimilation query and 3D wind direction estimation queries, each of which needs only less precise data.

a packet from the second stream is useful to two concurrent queries, whereas a packet from the .rst stream is only useful for tornado detection.


In the sni.ercentric case, both the greedy and the LP-round algorithms outperform Max.

we observe performance degradation due to the uncertainty in G and p, as would be expected due to the loss of information, when compared to the performance in the user-centric model.


To reduce the call dropping probability, few other CAC algorithms which take into consideration neighboring cells information have been proposed [6, 1, 7].

those algorithms only support users with fixed bandwidth requirements.


Second, network modi.cations, such as movement of departmentacrossbuildingsormovement of .ltersfromcoretoedge, cangreatly affect a network s reachability sets.

thepolicy units remain unchanged as the constraints applied to the network s hosts remain constant.


We can expect these networks to implement advanced data security protocols to prevent eavesdropping of data.

an attacker can still deploy receivers outside the wall of the building to passively measure di.erent parameters of the received radio signals.


Heuristics de.ned above are meaningful at local sites identi.ed by two neighboring routers and immune to path .uctuations taking place before and after the sites as long as the hop distance is preserved.

path .uctuations with varying hop distances while exploring a subnet potentially causes the subnet being observed smaller than its actual size.


For example, we typically ignore traceroutes that contains a non-responsive router ( * ) before or after the IXP address.

if we can map the IXP address directly to its corresponding member, we do not need the presence of an IP address after the IXP address.


The Standard distributed scheme proposed for LTE makes use of the OAM as well.

the tasks of the OAM are restricted to the transmission of a list of PCIs, from which the eNB under configuration chooses a PCI different from those obtained from UEs measurement reports, reported by neighbor eNBs over X2 interfaces or acquired through other implementation-dependent methods, e.g.


This system shares many similarities with SelNet, especially in the goals of the project.

the architectural choices that are made are quite different.


A s moderate bandwidth requirement is satis.ed.

a is the only one that is in a good location to help B.


A model characterizing the acoustic channel utilization ef.ciency was developed to investigate fundamental characteristics of underwater environment, and to set up an optimal packet size for underwater communications based on the applications.

the proposed solutions do not ensure reliability, which itself is the objective of our paper.


However, transmitting very long data packets may not be appropriate in many cases, especially when the radio channel condition is not stable enough.

obviously, using e.ective access control protocol to transfer single or small payload (e.g.


Mitigating asymmetric traf.c analysis: Using IP-layer encryption (e.g., IPsec) rather than SSL/TLS would thwart our asymmetric traf.c-analysis attack, by hiding the TCP sequence numbers from the adversarial ASes.

using IPsec would come at a signi.cant cost; because IPsec is not widely used, it makes Tor traf.c much easier to identify, and limits its applicability for important applications such as censorship-resilient communications.


LAS-MAC is also based on the periodic listen-and-sleep scheme.

lAS-MAC uses the listen period for multi-hop forwarding schedule (channel) reservationacross the multi-hop nodes, and the sleep period for execution of the reserved schedules.


The fastsweeping attackers consume half of their time hopping channels, and thus, they su.ered the most from increasing the hopping energy cost, resulting in the steepest increase in JDPE.

slow-sweeping attackers consume only 10% of their time hopping channels, and thus, are the least impacted by the increasing hopping power.


Hole approximation: We observe that awareness of the presence of routing holes and knowledge of the shape of the holes may help the sensor nodes a lot in .nding the optimal path to route the data packets.

as WSN is usually deployed in large scale with the number of sensor nodes maybe on the order of hundreds or thousands, the size of routing holes also maybe very large and the maintaining or spreading the complete information of the hole boundary is nearly impossible.


These extra observers are also candidates for alternative routes when needed.

in GAF-based networks, a wake-sleep schedule of a node differs from that of others.


The conjunction Ji between Ci,C(i+1) mod n can intersect edges of the outer cycle of the strong pattern in Ci n N2(Ji) and in C(i+1) mod n n N2(Ji).

these vertex-induced subgraphs do not overlap for any pair of conjunctions, which follows from the .fth condition of a strong pattern and Lemma 4.1.


For the latter, we picked the same parameters and values and implemented their algorithm as described in [8].

we note that we have not included the adaptation of the CW size for the Rawat et al.


Note that connectivity (Figure 4 (a, b) improves only slightly (less than a few percents) by using unidirectional links.

the average total communication cost (Figure 4 (e)) improves (up to about 7%, but mostly lower) when a large fraction of nodes is low power; the costs are similar when a small fraction of nodes is low power.


In case the path-loss of direct path is relatively small compared to transmitted signal power, decode-and-forward by employing the proposed QOSTBC presents performance bene.t.

when the path-loss is extreme, amplifyand-forward method outperforms decode-and-forward.


Usually, the destination node is the victim of a denial-of-service attack.

the destination node might be able to detect the attack at the application layer, based on the content of the received packets.


At the network level, decoupling location and identity means that using IP routing to send a packet to a given location (via IP) no longer means that the packet is going to the host with the intended identity (EID).

because EIDs are .at, they can hold cryptographic meaning; e.g., the identi.ers could be derived by hashing a public key.


While PeeringDB and PCH do not provide any peering information, the IRR seems to be a rich source of information since it yields some 18K peerings at only 80 IXPs.

in the absence of any ground truth for peerings at IXPs, all that Tables 4, 5, and 7 say is that while our proposed method clearly outperforms the currently available methods as far as detecting peerings at IXPs is concerned, there may still be room for improvements.


The ReP is an aggregation of these resources.

nT have deterministic sojourn times that are coupled with spatial limitations.


Assigning a mobility role is enough to diversify the mobility levels of the nodes.

in realistic scenarios nodes will change mobility roles.


Thus, we look at intercontact times on a node-pair level.

.tting di.erent distributions for each node pair would lead to an intractable Table 1: Estimated average inter-contact times.


Currently 2.5G and 3G systems lack such a large-scale of infrastructure to authorize and consequently charge mobile users for new services, as well as to provide digital signatures and non-repudiation services.

in the years to come it is very likely that mobile operators will incorporate PKI technology or become associated to Trusted Third-PKI Parties (TTPs).


Satellite networks have specific characteristics such as including global coverage, providing access for remote users to terrestrial wide area networks from any location within the satellite coverage area, and broadcast/multicasting, which make them an attractive solution in order to complement terrestrial networks in providing worldwide access to the present and future generation multimedia services.

at the same time other characteristics of satellite networks, such as long propagation delays (270 ms round-trip Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page.


This is dangerous because different schools have different premises and define different constraints, which leads to different opinions and models and in such a way often to contradictions.

an engineer is not able to analyze such details and will be mislead.


If we assume that only a single copy of each item is available, then we are required to solve an approximation of the unit-capacity online .ow problem, which has hardness results from (among others) [3].

if we assume large supply of each item we can immediately obtain such a black box using an exponential-cost routing algorithm.


Kernels and network simulators proof particularly valuable in this regard since VIPE can utilize a rich infrastructure for handling network I/O and packets.

the user space typically does not provide such native functionality, thus requiring its own yet simple implementations in VIPE.


In such a dense network, if all sensor nodes turn on their power simultaneously, the network will experience serious collision problem and consume lots of precious energy.

if only few sensors turn on power, there will be lots of coverage hole existing in the target area.


The bandwidth along the link between the broadband modem and the ISP gateway depends on the Internet subscription, with maximums differing from one country to another.

iSPs in general are providing increasingly faster broadband access to homes worldwide.


200 500 1000 distance [m] Figure 9: CCDF of jump size with varying rewiring is a good method for obtaining jump sizes that follows a truncated power law.

this is true only when the scenario is dense enough, in terms ofboth external links and number of communities.


Model 6 did not substantially improve prediction over model 5 for the Cray XT3 (27.9% over 28.4%).

when we use the same model for the optimized versions of BeamBeam3D (next section), we find prediction errors of 7.6% for both models.


Our approach is closest to [2] in the sense that we also use non-intrusive network packet capture to identify the dependencies.

rather than using analysis that relies on presence of communication patterns in data and gives probabilistic answers; we use additional instrumentation to identify the dependency information deterministically.


For example, a network operator may conduct traf.c engineering to improve network performance, and many traf.cengineering techniques (e.g., [18, 19, 39, 42]) require the modi.cation of con.gurable parameters (e.g., OSPF weights or egress point selections).

such parameter adjustments may cause disruptions due to human error or routing reconvergence.


We borrowed ideas from policers in the literature [16, 7, 18] for our rate equation policer.

without the bene.t of re-feedback they don t police the correct rate for the condition of their path.


We do not construct the normal profiles because normal traffic is sensitive to the practical networking environment and a high false positive rate might be generated when deploying the training model on a new environment.

the agglomerative hierarchical clustering is unsupervised and does not define threshold that needs to be tuned in different cases.


The di.erences between both timestamps obviously also contain the serialization and propagation delays of the wireless transmission.

it turned out that the monitored delay can be on the order of several hundred milliseconds which renders these two components rather negligible.


Unfortunately, it has been shown in [24] that there does not exist a dominant strategy solution in which every node always forwards others packets in an ad hoc routing and forward game.

there does exist a strategyproof payment scheme for the routing subgame.


The effect of UE speeds It is shown in Figure 4 and 5, when UE speed is low as 5km/h, by selecting large TTT values the frequent ping-pong mode switching rate can be prevented without a significant decrease in D2D offloading time.

when UE speed is high as 60km/h, D2D offloading performance is substantially degraded even when TTT values at 0ms.


A standard way to achieve low congestion with an oblivious unicast scheme is to use randomization in what is known as Valiant s trick [29].

for a unicast request (m,s,t), .rst route m from s to a randomly chosen intermediate destination v, and then from v to t. in its basic form, this trick does not work well for arbitrary worst-case sets of requests and in particular it does not work well for multicast requests.


Attacks of type (a) need to be handled primarily from the IT defense perspective.

protecting the system against (b) needs to be handled separately.


Let us assume that there is another MIS Cl with its cardinality I > k, which also includes flow f and can provide the same basic fair share for flow f as Ck.

it is easy to see that the choice of Cl will result in larger spatial reuse than MIS Ck, while providing the same basic fair share for flow f. this is impossible, because it means that both Ct and Ck will be the flow f dependent MIS but their cardinalities are different, i.e., l > k. This contradicts the definition of a maximum independent set for a given flow.


Since their work addressed the problem of incomplete paths, we directly apply their techniques to our dataset(Steps1&4).

identifying and modifyingfalsely mapped AS links is a signi.cant challenge that we address in this work.


In view of the above, we would ideally want to schedule background communication by factoring in the load as well as the link quality.

unlike the link quality, which can be measured passively by a cellular client, estimating load has hitherto required active measurements such as a trial download or packet-pair probes.


All these works focus solely on fairness, and use the goal of achieving work conservation as the only indication of ef.ciency, similar to traditional single-resource fair queueing [9, 21].

as we have shown in this paper, unlike single-resource scheduling, there is a general tradeoff between fairness and ef.ciency when packet processing requires multiple types of resources.


This is needed to reduce the chances of correlated failures such as energy depletion that causes both the host node and its power meter to fail.

in our solar-powered testbed, we connect both the meter and the monitored system to the same battery, charged by the solar cell, leveraging the fact that the power meter needs a lower voltage to operate, compared to the monitored system.


A complex graph poses no particular dif.culty for a software implementation  for example, when Click paths merge, no special arbitration needs to be done.

thereis animportantdifferencebetween software and hardware datapaths.


The resulting scheme keeps the nice property of the random pairwise keys scheme, that is, the compromise of sensors does not lead to the compromise of pairwise keys shared between non-compromised sensors.

unlike the random pairwise keys scheme, our scheme does not impose restriction on the network size.


In essence, sensor nodes should report to the sink once they detect the environmental parameter through intermediate nodes.

aforementioned to earlier discussion, the reliability requirement of each parameter differs.


It may seem counter-intuitive that the selection of context provides the randomness in our synthesis model, but that the results are not sensitive to the actual model chosen.

note that we are not saying that the PoP locations, and the tra.c don t matter.


In our examples below, the algorithm changes from FCP s original design, including the path price calculation, link price generation, and preloading strategy.

the invariant of Equation 1 remains unchanged.


If the amount of light measured during two consecutive slots is close to each other and if it is also similar to the ambient light measured earlier, the device can conclude that either there is no other device in its vicinity, or that it is synchronized to the other devices near by (within communication range).

if the device detects that the two consecutive measurement values deviate (with some hysteresis), this might mean that there is another light-emitting device in the vicinity.


Compared with TOA, RSS information is widely available and lots of work are dedicated to use the RSS of WiFi, bluetooth, or cellular signal, for indoor localization [27, 7, 11, 13].

the need of the prior information of the radio attenuation model, and the time varying features of channel make these approaches only suitable for applications with low location accuracy needs.


The details are not shown, but the tree is clearly too large to be used directly by a human investigator.

many of the smaller branches (shown in red) represent logical inconsistencies and can be pruned, while many of the vertices in the main branch (shown in gray) represent technicalities, such as event chains across multiple nodes, which can be summarized.


This choice works well if X(t-1) is a good estimate of X(t).

if X (t-1) is based on a few intervals worth of data, as in the .rst few time intervals after a noisy initialization, it may be extremely noisy and this can potentially lead to 0.94 0.92 Time interval t Figure 10: Sample trajectory of true and estimated .ow volume instabilities.


While electronically steerable antenna systems, such as those proposed in [7], also have the potential to increase throughput by taking client tra.c demands into account, electronically steerable antenna systems remain expensive(ranging several thousands ofdollars upward), which decreases their attractiveness for low-cost wireless networks.

this architecture also has two signi.cant disadvantages.


Abilene is an ideal starting point for understanding heuristically optimal topologies, because within its backbone, there is no difference between the link layer topology and what is seen by IP.

the use of Ethernet and other link layer switching technologies within the CENIC POPs makes the interpretation and visualization of the physical intra-CENIC connectivity more dif.cult, but inferring the actual link layer connectivity is greatly facilitated by knowing the con.gurations of the individual CENIC routers as shown in Figure 5.


Also, hierarchical names simplify generating content in response to a request by allowing to request content by a pre.x of its name, rather than by its full name.

the question of how identi.ers are represented has architectural implications far beyond mobility handling, and hence, we do not aim to settle the issue here.


Later it is slightly outperformed by SLEF and MLEF due to changing forwarding paths used by both approaches.

the LP solution still achieves signi.cant better results.


In the usual settings, the MAClayer at each node only transmits to the upper layer the messages that are targeted to it and ignores the messages targeted to other nodes.

by setting a node in the monitoring mode, it is possible to sniffpackets that are targeted to other nodes through a raw socket (as tcpdump does [7]).


2 Note that the sensor intends to wake up when the actor is transmitting the control-broadcast relative to the guess corona.

the algorithm works properly even if the beacon transmitted is di.erent.


This means a lot of network resources such as energy and bandwidth may be wasted, which is not desirable in MANETs where the resources are constrained.

on-demand routing protocols don t exchange routing information periodically.


In the random loss model, window size of TCP becomes small due to random packet loss.

since any packet losses do not occur in the no loss period in the burst loss model, window size of TCP can become large in this period.


A Security Management Scheme Using a Novel Computational Reputation Model for Wireless and Mobile Ad hoc Networks * Azzedine Boukerche and Yonglin Ren School of Information Technology and Engineering (SITE) University of Ottawa Ottawa, Ontario, Canada {boukerch, yren009}@site.uottawa.ca ABSTRACT Robust trust and reputation evaluation services are significant to ensure the security of mobile ad hoc networks, as centralized administration is not easy to be applied and these networks do not have fixed infrastructures.

malicious behaviors obviously can make wireless and mobile networks at risk so malicious nodes should be detected and excluded.


Hermes uses the Pan API for sending and receiving messages.

when Hermes content-based routing algorithm performs reverse-path forwarding [6] of messages, it does not use Pan s route operation but sends the messages directly to the destination.


In 218 runs, the handoff results are the same as the above example.

in the remaining 149 runs, two additional handoffs ( HSPA.


The practice of discarding packets is common among WAN networking technologies such as Ethernet [21] and ATM [27]; endto-end protocols such as TCP [24] are required to ensure reliable message delivery over these networks.

wAN-oriented protocols generally require total table storage proportional to N2 for N inter-communicating nodes [11, 8], and are therefore poorly suited to large distributed shared-memory machines.


Their result is useful for the client-server setting, where a server wants to engage in a sketching protocol with multiple clients without using a shared key for each, and then uses a report authenticated using a public key, c.f., Section 4.2.

an adversarial-sketch protocol that does not use shared randomness (keys) to create the sketch, v needs at least O( T) storage [23], and is thus much less e.cient than O(log T)-storage keyed sketches that we considered here.


Lots of scheduling algorithms for single-channel environments have been proposed in the literature.

in some situations, it is not always possible to combine multiple low-bandwidth physical channels into a single channel [9].


Indeed, if a user always chooses to download one or more .les with best-advertised download times, then a small percentage of nodes with maliciouslyadvertised download times is enough to decrease the successful download probability to zero.

a simple random strategy signi.cantly improves the successful download probability, and the random redundant strategy is even more successful.


Examples include protocols in the public domain, e.g., HTTP, and services whose provider can be forced or willing to reveal their implementation details.

we assume that the censoring authority is not willing to block the Internet entirely, nor a large fraction of the Internet tra.c.


in MSL* and MSL, as the number of the nodes goes up, the error in location estimates goes down.


Smith [16] models bandwidth demand to support both multicast and unicast for fast channel change, where channel switching is modeled as a renewal process.

the work does not consider the temporal dynamics within a day.


Yet, a spander construc tion needs to be carried out under such constraints; one may wish to employ the technique used for the complete graph to de.ne a spander over any given expander graph.

when the graph is not complete, choosing a constant number of neighbors at each node may result in non-expander graphs.


Thus, they dynamically compute the overall average waiting time or the average waiting time for each video.

the third scheme is highly intelligent and adaptive to server workload.


This may result in a degradation of overall performance if too many peers are unchoked.

we opted against the implementation of a more elaborated tra.c scheduling policy since BitTorrent s choking mechanism was essentially created to mitigate problems arising from TCP s congestion control (see [5]).


As most common RF channels are within the ISM band, heavy noise must be expected.

there is a trade off here, since the more complex and error resilient a beacon is, the more complex the Table 1: Key Characteristics of Hybrid Radios Bitrate RX current TX current Power on delay CC2420 250 kbps 18.8mA 17.4mA 1.3ms AM HRR18 4 kbps 70uA 2000ms AM RT5 4 kbps 4mA 10us Interrupt RX Pulse TX Pulse  process of detecting that beacon becomes, thereby adding to the energy cost of transmitter and receiver processing.


It is outside of the scope of this paper to describe ways to automate cluster discovery.

our analysis demonstrates that clustering of patches has a large potential grouping in reducing the complexity of a patch distribution system.


It can discard an unexpected response and retry the previous message or terminate the handshake if the expected response is not received during a given time interval and certain number of retries.

the supplicant (responder) cannot use a similar strategy.


In [11], VF2 was also used to directly identify attack patterns in networks.

here the graph matching method VF2 is used in a different way.


With highly pure suspicious clusters, the frequency threshold of fifty percent in the second criterion is, we believe, reasonable and acceptable.

there is great redundancy in the worm signatures selected based on the above two criteria.


Face walking involves following a right-hand rule, and is guaranteed to reach a nodecloser to the destination if the underlying network graph isplanar.

if the graph is non-planar then face walkscan loop even when a route to the destination exists.


OmniVoice provides good mean packet reception rate (PRR) for increasing numbers of clients.

because mean PRR is an aggregate statistic, in Figure 8, we also plot the total connectivity time of VoIP clients (the red bars), for increasing numbers of clients.


To addressthe above challenge, wedevelopinthispaper a novel spatio-temporal compressive sensingframeworkforTMinterpolation.Ourframeworkhastwokey components: Wedevelop SPARSITY REGULARIZED MATRIX FACTORIZA-TION (SRMF),which .ndssparse,low-rankapproximations ofTMsthat accountfor spatial andtemporalproperties of real TMs.Tothebestof ourknowledge,SRMF representsthe .rst genuine spatio-temporal model ofTMs.

mostpast approaches canbebestdescribed aspurely spatial(e.g.,[9,13, 14,31,33])ortemporal(e.g.,[3,27]).


From the above, we expect FSS to behave exactly as Sk with load a'.

whereas the number of .ows Nf entering FSS is a known constant, the number reaching the counter array is, unlike for Sk, a random variable.


If the .rst k peers have the chunk at time t, the uploading to peer k +1 can .nish by P1 , therefore the lower delay bound can be calculated k j=1 uj as N-1 X 1 D =1+ .


This demonstrates that mixing technique is practical in mobile ad hoc networks if appropriate values of playout window size and buffer size are selected.

it is a non-trivial problem to choose the best values for playout window size tX and buffer size rX .


When considering realistic radio propagation phenomena to various degrees, these incoordination problems can drastically increase.

transceivers with packet capturing capability might be able to deal with some of the uncoordinated packets.


Within a session, a node is able to link two messages transmitted in two di.erent message batches to a same sender, i.e., by using the assigned one-way key chains.

the node cannot identify the sender, as it cannot link an assigned one-way key chain with a speci.c node as proved in Lemma 3.


Con.guring and deploying an IGP listener to record such logs is neither technologically dif.cult nor novel [9].

an active listener carries the risk of disrupting network operations in the event of a catastrophic malfunction or compromise.


It is possible that the tra.c volume changes on those impacted links are small, and sometimes too small to be detected on each link using volume based detection algorithms.

the overall change in the tra.c distribution across the network can be quite large.


The coef.cients for both the analog and digital cancellation .lter are dynamically tuned to maximize cancellation.

dynamically tuning cancellation in a full duplex relay is more complex than standard full duplex.


Here, the authors investigate algorithms for the physical interference model and show via simulations that such modeling leads to more e.cient schedules relative to the protocol model.

the simulations use straightforward propagation and radio models.


In many cases, these factors lead to conservativeness, but we show reasonable experiments where the control is clearly non-conservative.

our analysis also suggests that our source should experience a higher loss event ratio than TCP, which would make non-TCP friendliness less likely.


After that, the attribute authority does, in principle, only have to store the seed, since the entire tree can be re-generated from this, and therefore, any portion can be regenerated from the seed when this portion is needed.

this is unnecessarily costly from a computational point of view.


To simplify the explanation, certain technical restraints are imposed on the model.

those restraints are not inherent in the general ViewCast concept.


BAP independently measures the quality2 of the link s both directions, and then multiplies them.

the results are bi-directional giving the same link quality in both directions due to the same type of probing used in both directions, and often under-estimate the quality of asymmetric links.


Without modi.cation, the use of a random link delay in the simulation will result in out-of-order packets since packet transmitted later with lower delay can overtake packets transmitted earlier with higher delay.

since delay variability in our model is caused by factors that will not result in packet reordering (e.g.


When there are TCP connections of both types of applications, the path selection algorithm is not ready to generalize.

we can still run Algorithm 1 (or Algorithm 2) assuming all of them are realtime (or .le transfer) applications.


First, although the AES framework was designed to support di.erent virtualization technologies, the AES only interfaces with VMware Workstation or VMware ESX.

we do not foresee any reason why plugins for other virtualization technologies such as QEMU, VirtualBox or Xen could not be developed.


DISCUSSIONS The ECN standard de.nes ECN-capable (ECT) bits at the IP header to indicate switches that mark the packet in order to make the connection respond in the same manner as dropping.

the behavior of switches handling non-ECT packets when ECN is triggered is not speci.ed.


However, as a result, address-based client authentication has become essentially obsolete, and mostly replaced with cryptographic alternatives such as SSH and SSL/TLS.

web security still relies, to large extent, on the Same Origin Policy (SOP) [5, 28], i.e., on domain/addressbased server authentication.


Voice packets are transmitted without contention during reserved slots.

r-CSMA and ER-CSMA achieve higher dropping rate than RRP due to the four scenarios of unheard control packets problem.


All of these studies, while valuable in providing insight into the behavior of real networks, use methodologies and hardware that is often not practical for many network operators.

in our own previous work, we considered whether lower-quality data sources, namely syslog and operator emails, could be used instead [17].


Most of them consider clean-slate designs by rearchitecting the control plane itself to contain the complexity of network design.

our work is relevant to both existing enterprise environments and clean slate designs.


With this general procedure, we would end up with one shortest-path violation for each router and for each destination in the input DAGs.

the number of shortest-path violations generated by a given set of forwarding DAGs can be optimized, for instance, by reusing sub-paths of IGP shortest paths which are compliant with Condition 1.


This methodology only targets the aspect of evolution of architecture and not other important questions such as the capabilities or functional distribution of the architecture.

we believe that an easy to evolve architecture is key for the success of a network in the long term.


6.2 Graded vs. Thresholded Physical Model:One Shot Scheduling We did not consider the graded physical model above as the greedy scheduling can only use a binary model (links are either feasible or not).

the graded model has proved to be the most accurate in our evaluations in Sec tion 5.


2.2 ModelStructure Here,wegiveabrief overviewof the model structurethat approximate the average behavior of a multi-hop wireless networkbased ontheIEEE802.11MACprotocol.

we will present the detailed set of equations in the next section.


At speeds of less than 10 kph, the SNR-triggered protocol with equal air-time assurance that was trained at 0 kph has the highest throughput.

at only 10 kph, the protocol which is trained at 100 kph becomes the highest performing, thereby, showing that multipath has shifted the speed of the most appropriate coherence time training.


Inthis case, a collision occurs andthetags willnotbe ACKed during the round.

these tags will be active in the next round, where they will choose a new random number.


There is also no obvious hindrance that prevents the implementation of fast hando.s.

there is a scalability issue with respect to the number of network names globally.


As the time di.erences between two traces (n)increases, the amount of correlation, not surprisingly, decreases.

this decrease is fast at the beginning (around one day) then slows down.


8.8 Training with Data from Multiple Devices All our results with EZ so far have utilized data collected using a single device for training.

in practical scenarios, multiple users would provide training data.


Intuitively, this choice of pt maximizes the per-slot throughput of a given node, as has been widely studied and well-understood in the context of the ALOHA protocol, leading to maximization of the discovery rate.

the crucial question of the time required to discover all the neighbors when nodes transmit with pt =1/n were unansweredin[13,19].


Avoiding the problem of rights of installation by installing at private properties and distributing the equipment and management costs among the participating users, such networks present a major cost-effective alternative for overcoming the issues that are stalling the deployment of carrierdeployed wireless mesh networks.

the deployment of user-contributed wireless mesh net- Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for pro.t or commercial advantage and that copies bear this notice and the full citation on the .rst page.


Note that the merging tree created by Patching is limited to two levels.

bandwidth Skimming may create arbitrarily deep merging trees.


According to the 802.11 scheme, only one transmission can proceed at a time since all nodes are within the carrier-sense range of each other.

according to CA-CDMA, three to four transmissions can proceed simultaneously, resulting in a signi.cant improvement in network throughput.


Many recent wireless scheduling proposals solve the above problem in principle.

this is typically achieved with per-packet information feedback, incurring considerable overhead.


The highest topology knowledge level, which is 100%, is reached after about seven seconds and then remains at that level.

the topology knowledge dramatically decreases when data traffic is injected.


This problem can be addressed by increasing n and transferring data chunks according to the playing progress of the video.

resources saved by the chunk mode decrease as n increases due to the tail e.ect.


Giving priority to TCP SYN packets is certainly not an acceptable option, because it opens the door to TCP SYN .ood attacks.

giving priority to SYN ACK packets at routers would certainly not have the same impact on performance.


provide network layer solutions, while RON o.ers application layer one.

unlike SBone and overlaid eBGP, our approach focuses on how a virtual network gets formed, especially in such a way that virtual links are all disjoint to avoid fate sharing, so that there may exist a virtual link that gets around a path failure.


procedure will involve either a session key transfer or a new session key setup.

the end-to-end ESVP security association that exists between the mobile user and the enterprise gateway will remain intact.


On the other hand, if there are multiple DS records for a child stored at the parent, it may be the case that one authentication chain works and the other broken DS records are simply old data that the parent has been slow to remove.

dNSSEC envisioned that a parent zone would have exactly one DS record for each child.


they do not dynamically change during path computations.

it is possible that some routing segments in the same path may overlap with each other.


2.1 Packet Salvaging at the Network Layer Ad hoc network routing protocols are designed to primarily cope with relatively infrequent but permanent link errors.

they may not perform well with more frequent, random and temporary link errors.


For instance, in a large building, an engineer/robot carrying a Sybot can conduct spectrum survey in a certain area (e.g., each .oor) and combine his survey results with others .

it is dif.cult to effectively divide the space and merge separate spectrum maps into one.


In our analysis, services are distributed such that every service is provided by at least one node in the network.

as described earlier, restricting the completion to the exact match degrades performance.


Therefore, to limit the increase in the number of hops required to .nd a requested .le, it is better to make as many .les as possible in peers of high degree when using random-walk-based query forwarding methods.

this causes a load bias to peers of high degree.


Essentially, it is important to balance the use of the available energy fairly across the multiple services.

given the dynamics of the systems and the environment it is deployed in, this fair share must be based on the utility of o.ering the service at a given time.


For instance, if S4 takes 3 time units to move F 4, and other switches take 1, Plan A will take 4 time units and Plan B will take 3.

if S2 is slow and takes 3 time units to move F 2, while other switches take 1, Plan A will take 4 time units and Plan B will take 5.


However, for conceptual clarity, in this paper, we focus on a framework that is similar to type-and attribute-based pub-sub paradigm [27] (details about the subscription model is provided later in the section).

the proposed architecture as well as the associated techniques can be adapted to topic-based or content-based publishsubscribe systems.


Re-ECN s capability of ensuring fairness could be used for ensuring fairness in cellular networks.

although the idea looks promising, its advantages and performance have been not yet been veri.ed thoroughly yet.


In [12], the one-to-all and the all-to-all paradigms have been addressed in DC-WSNs: approximation algorithms, complexity and experimental results have been achieved.

one of the main di.erences from our model resides in the assumption that sensors can transmit messages at any time, not only when they are active (awake), and the duty-cycle is considered only with respect to the receiving capabilities.


It is immediately apparent that 802.11b transmissions were much more likely to succeed than the faster 802.11g rates.

somewhat surprisingly, the difference in loss rates between 802.11b bit rates was small.


For example, while the AD of E.2 is 110, a route received from a peer OSPF process of E.2 may be con.gured to have an AD value di.erent from 110, say 90.

we realize it may be possible to take advantage of such .exibility and create guidelines on AD assignment to eliminate routing instabilities.


[13] considered a dynamic setting of the velocity range of each mobility anchor depending on the actual velocities of MNs which are currently serviced by the mobility anchor.

a general requirement for mobility management schemes that are based on the velocity of mobile nodes, consists in the guarantee of a high accuracy in the estimation of the velocity of mobile nodes.


That is, the Worldwide Interoperability for Microwave Access (WiMAX) system uses a VBR real-time polling service (rtPS) that results in additional access latency jitter and bandwidth allocation problems for transmitted multimedia stream variable data rates when the base station regular time interval polling to 802.16 entity (SSs) for contention bandwidth request period.

this scheduling algorithm solves the SS bandwidth resource allocation problem, and depends on initial values provided by an extended real-time polling service (ertPS) during a speci.ed period.


By setting the low and high value, the OS is able to describe a single send window within the whole send spectrum (Figure 3a).

by also using a modulo value, this single send window can be spread over the whole send spectrum (Figure 3band Figure 3c).


On the other hand, ad hoc wireless networks, with characteristics such as the lack of a central coordinator and mobility of the nodes (as in the case of battle-.eld networks), require nodes with a very high energy reserve.

advances in the battery technologies are negligible when compared to the recent advances that have taken place in the .eld of mobile computing and communication.


Hence the optimal values of objectives (2) and (3) are 2 -e and 2 -e2 respectively.

algorithms MaxWeight-Alg2 and MaxWeight-Alg3 both assign carrier 1 to user 1 since r(1, 1) >r(2, 1).


8.2 Variations on MIB MIB implementskey deploymentover the wireless communication channel.

the protocol could be adapted to use the sensors themselves.


One must keep separate track of RTTs for different paths, e.g., path a and path b , as is already specified in the SCTP standard [17].

what to do if a packet goes from interface 1 to the destination and the SACK (selective acknowledgment) comes back to interface 2?


Hence, the detection accuracy is low for low power changes of 2 and 3 dBm.

for higher power changes the detection accuracy increases.


CARE -CAPTURE, ANALYSIS, REPLAY AND EVALUATION In order to determine the feasibility of an all-wireless mesh of.ce, we need to evaluate the performance of real of.ce traf.c.

since wireless mesh networks are not widely deployed today, it is not feasible for us to acquire traces from them.


Since the AP is usually more powerful as compared to the MH in terms of power, computation ability and memory size, the measurement work will not burden the APs.

as is pointed out in [3], the load measured at an AP cannot accurately re.ect the practical channel contention due to multihop relaying.


While much is being considered today for business-to-business transactions, the Web also represents a marvelous opportunity for small retail establishments.

the needs of small establishments differ from those of larger firms.


They show that the two methods di.er considerably with the random selection method providing better results because the trace method produces more overlapping pre.x pairs.

rather than using an ad hoc trace, we prefer to stress ABV further by adding a controlled injection of groups of pre.xes that share a common pre.x to produce more overlapping pre.x pairs.


Vendor-supplied controllers [4, 14] that move, copy, and share NF state between multiple NF instances can leverage knowledge about the internal workings of NFs.

they cannot control network state in a way that fully satis.es all goals e.g., it is hard to provide optimized load balancing across network links.


C3S2E-10 2010, May 19-21, Montreal [QC, CANADA] Editor: B. C. Desai Copyright &#169;2010 ACM 978-1-60558-901-5/10/05 $5.00  University of Ontario Institute of Technology 2000 Simcoe Street North, Oshawa, ON L1H 7K4 905-721-8668  supreet.baweja@uoit.ca potential to provide high bandwidth efficiency and the lowest delay by directly engaging network routers in the process.

deployment of network-layer multicast in the Internet infrastructure has not kept up with the growth of various forms of multicast services in recent years.


The load balancing ratio between the tunnels is approximated by the number of entries for each tunnel in the hash table.

the proposal does not address the concern that replicating entries can exhaust switch forwarding table.


Thus, the way mobility is modeled has a major impact on the topological properties of a vehicular network, and, apart from overtakings, all of the motion features (.ows merging and the car-to-car interaction it is build upon, traf.c light management, multiple lanes) proved to generate unique cluster-and link-level effects, motivating the employment of realistic motion representations instead of approximate ones.

when focusing on networking protocols, the results prove that: protocol performance evaluations conducted on scenarios in which no realistic .ows interaction is considered can be easily misleading, as the vehicular network topology tends to be much more globally connected in such conditions;  street topology locations are not all equal.


978-3-9815370-0-0/DATE13/&#169;2013 EDAA Julien Penders Body Area Networks imec-nl Eindhoven, the Netherlands Julien.penders@imec-nl.nl With over 1 billion overweight people on the globe, and 300 million obese, weight is the 4th biggest risk factor for global mortality leading to 3.2 million deaths each year.

it is not straightforward to combine our daily work and life with healthy active living, as most of us spend the better part of a workday doing sedentary activities.


In [6], an analysis of the ARQ feedback types is presented.

the UDP tra.c, which is not sensitive to packet drops, is considered.


We naively expected that the users would usually generate their keys shortly after boot, thus biasing the pid towards small numbers.

while our data shows evidence of some biasing, the e.ect is not particularly strong, as shown in Figure 6, which displays the process ID histogram.


sary to link two route pseudonyms together.

cryptographically strong pseudorandom sequence generation ensures that pseudonyms used on the same hop are unlinkable in polynomial time by any Turing-complete algorithm.


Earlier Wi-Fi based approaches use a propagation model of receiving signal strength (RSS) from Wi-Fi access points (APs) to compute the receiver s location [15].

building such a model often requires the prior knowledge of AP positions and the accuracy much depends on the multi-path fading effect.


The above localization algorithm works for rigid geometries where two possible positions per neighbor are estimated.

there exist exceptional movement con.gurations when the core algorithm cannot .nd any meaningful results, namely equal parallel movement and excessive error con.gurations.


By inserting tagged UDP packets at the average queue length on transient congestion, CHIPS improves flow-controlled multimedia jitter.

this could harm the TCP flows and even make them time out by introducing a large extra delay when the multimedia traffic is taking a considerable portion of the output bandwidth.


Dynamic receive window adjustment (DRWA) [16] is proposed to address this issue.

such proposals require changes to TCP stacks, making their deployment potentially challenging.


Thus, the schemes may lose power inthe future.

crafting raw IP packets and simulating a TCP stack is a somewhat time consuming process, especially given most bots (85+%) we observed run Windows, and in modern Windowssystems the raw socket interface has been disabled.


On the one hand, we explore the ability of these algorithms to cope with moderate to high medium contention levels.

we investigate their performance on medium-distance 802.11links.


However, AHMAC can obtain a higher throughput since contention does not occur under high-tra.c con Figure 10: Average packet delay in an IEEE 802.11s mesh network with a single-interface environment dition.

when N>110, TH3 severely decreases since the frames of nodes located at three hops are not suf.ciently forwarded to the MAPs located at 2-hop distance from the MPP.


In 2004, the pure IPv6 ASes were located in a relatively central position.

we see pure-IPv6 ASes, a small fraction of all, becoming more prevalent at the edge after 2008.


Thus, it becomes clear that the bottleneck in terms of connectivity and capacity is the VANET.

the decentralized character of VANETs for distributing traf.c information is very appealing: a cooperative approach where every participant contributes, distributes, and consumes information, where no central institutions and no central infrastructure are necessary, where, consequently, the absence of single points of failure promises a robust service, without recurring fees for the users all this is obviously highly desirable.


As the volume of the transferred data is reduced, the energy consumed by the WiFi connection is also reduced.

the energy consumed due to processing increases (due to the computation of global/local features of the images).


Then value k will be less than we assumed.

we saw that number of nodes which are members of clique in the outside annulus is negligible.


The key design consid eration is to pick the right abstractions to balance .exibility against performance.


The reason is that the total throughput of VM traf.c is limited by the 10Gbps NIC capacity.

the packet processing capacity of OVS is larger than 10Gbps, which makes it possible to perform extra .ow replication even when OVS is forwarding high throughput .ows.


To ensure safe coexistence of different end-point resource allocation strategies, the system maintains a key invariant that the amount of traf.c a sender can generate is limited by its budget, which is the maximum amount it can spend per unit time.

numerous practical challenges exist in generating explicit price feedback, while allowing the end-points to dynamically change their .ows budget allocation.


Therefore, node A will transmit a frame for MAC address m. This frame transmitted by node A is intended for node P(with IPaddress b).

now node Q is in the vicinity of node A, and node Q also has MAC address m. Thus, nodes Pand Q will both accept the frame and forward to their corresponding network layers.


TCAM-based solutions are simple, and therefore, are de-facto solutions for today s routers.

tCAMs are expensive, powerhungry, and o.er little adaptability to new addressing and routing protocols [8].


However, running low-rate TCPs (or any application where it s known that the application will not exceed its share of the channel) might be acceptable.

reactive overlay routing is appropriate for most kinds of traf.c, though its overhead may be prohibitive for low-bandwidth .ows.


Since tra.c load is uniformly distributed over the network there is no need to separate threshold value used for HS-SFN for di.erent cells.

for networks with unbalanced tra.c load, the di.erent threshold value might be used for each cell to achieve the best performance.


This is the case of A3 and the adjacent bridge does not forward an unnecessary Associate TLV to the upper ToR switch because vsiState of the upper switch is ASSOC although forwarding of Associate TLV is acceptable.

de-associate message is sent from the source server to the adjacent bridge at the source port.


The 100 ms difference is due to a few scattered high latency measurements and consistent clock skew increasing latency for the last day of the measurements.

the uplink has an average latency of 572 ms with the same minimum.


Indeed, from Example 6, there are routing systems where nodes prefer 3-hop paths over 1-hop paths, and yet the system is safe under .ltering.

checking whether such systems are safe under .ltering requires global veri.cation; the theorems we have presented suggest that safety under .ltering cannot be guaranteed through local veri.cation alone, if some nodes are allowed to prefer (n + k)-hop paths over n-hop paths.


We compute the fraction of such losses for each source and compute the average for overall CNL.

unlike the original CNL in [7], we introduce d, which is a sort of margin for CNL.


(t) the problem can be rede.ned such that the new covariance matrix is non-singular.

the optimization problem is not a.ected since it depends only on L'.(t,.


Although a path p with the maximum or minimum w20 weight can be found in the DAG, it is not easy to find a path p for which w2(p) is as close as possible to c2 in polynomial-time.

very efficient heuristics can be developed based on the fact that we can compute the maximum and the minimum w20 from the source to every node and from every node to the desti- nation.


Hence, we cannot fit more than one such LSAs into a single LS Update packet.

a probe LSA with 50 links (n = 50) is 624 bytes long, hence we can fit up to two such LSAs in a single LS Update packet.


Even when consideringRTTs from pre.xes to nodes that are predominantly nearby, we .nd that more than 20% of pre.xes experience in.ation greater than 50ms.

less than 5% of paths were estimated to have more than 25ms in.ation in prior work [19].


These approaches give signi.cant results in the case of regular mobility.

they generally fail in random mobility conditions, except the model in [12].


With a fixed carrier sensing threshold, the stronger the transmission power, the larger the CSR area is.

besides CSR area, there is an interference area (IR area) near the receiving node.


These mobile channels run at high SNR, similar to our indoor channel.

the autorate algorithm can be challenged by the movement, making them potentially function more like the low SNR outdoor channel.


Again using the drill-down feature, we observed that this change was mostly attributable to traf.c between two nearby universities: from UCSD to UCLA.

tra.c between these two did not appear in any other cluster over the previous 30 days.


In practice, same-frequency transmissions are not simultaneous and therefore temporal changes in the channel propagation pro.le with mobility or the changing environment result in di.erent RSS.

if the channel is static, or highly correlated in time, the RSS can be approximated as being symmetric.


A small discrepancy occurs for high .c/.p ratios.

as mentioned earlier, in the case this ratio is high, the overall cost is not very sensitive to the precise optimal value for the number of replicas.


It is therefore interesting to have some insights on MPLS technologies in the Internet.

mPLS tunnels may hide IP-level information by masking MPLS routers from traceroute.


Packet losses in video transmission can be tolerated to some extent using techniques such as error concealment and interleaved packetization [13].

loss of the authentication information carried by a layer has a serious effect: some higher layers cannot be veri.ed and thus cannot be used, even though they are received and could have been decoded and used.


The natural solutions as well as the one we choose in this paper is to restrict the master scheduler the adversary in our case to fair scheduling.

the common de.nition of fairness based on in.nite runs and eventual message delivery is not suited for reasoning about cryptographic systems whose parties are required to run in polynomial-time.


ROLE OF ROUTING Since NDN s forwarding model is a strict superset of the IP model, any routing scheme that works well for IP should also work well for NDN [13].

today s IP routing protocols su.er from issues such as slow convergence or poor scalability.


So far in our discussion, we have assumed ni to be known previously.

we only know the number of Table 3: De.nitions of notation.


The impact of radio irregularity on protocol performance can be investigated through a running system.

few researchers have actually pursued this direction, because of two reasons: First, the complexity and cost of performance evaluations on a running system escalate, when sensor networks scale up to thousands or more nodes.


We carry out experiments under two di.erent IEEE 802.11 operational modes: one with the RTS/CTS mechanism and the other without.

due to the space limit, we present below only simulation results in the case that the RTS/CTS mechanism is deployed.


RTT-based timers are then used to trigger retransmissions.

this approach is problematic due to (i) the high variation in RTT commonly encountered in the Internet, and (ii) the coarse granularity of timers typically used in protocol implementations.


The reason is with increased network size, intermediate nodes also increase for data routing path, directly increasing the network delays.

tV-SITR has more network delays than TV-ITR.


To enable the multi-match packet classification on TCAM, some research work published recently [2][3][4][5] propose to add redundant intersection rules in TCAM.

the introduction of redundant intersection rules further increases the already high implementation cost of TCAM system.


This suggests that the amount of variation over time overwhelmed the amount of variation over space.

instead of just collapsing the temporal variation, we can explicitly remove it and focus more closely on the spatial trends.


Thomas Gross Computer Science Department ETH Zurich 8092 Zurich Switzerland trg@inf.ethz.ch  searchers rely on wireless simulators for evaluating new protocols/applications for wireless networks.

simulators are often based upon idealized and simpli.ed radio propagation and physical environment models that fail to capture the complex channel characteristics of a real system faithfully.


While our initial results are promising, several issues, which are the sub ject of ongoing study, need to be addressed before deploying VMScope operationally.

the .rst concerns the bandwidth overhead it imposes on the network.By joining the Default MDT group over tunnels to multiple PEs, the monitor will receive multiple copies of all its probe packets, as well as multiple copies of all customer packets transmitted on the MVPN.For a large MVPN this overhead could be substantial.the MVPN speci.cation provides a mechanism (see Footnote 1) to allowhigh bandwidth customer groups to be encapsulated in special Data MDTs in the provider backbone.This feature provides an engineering mechanism to limit the bandwidth on the Default MDT.


These three characteristics may have di.erent importances depending on what scenario or protocol is considered.

aggregating these measures with di.erent weight values to compare the performances of some algorithms is not in the scope of this work.


Some solutions have been presented for merging OPNET with MATLAB, such as [1].

this study on wireless networked control systems has little to do with smart antennas and the implementation would need considerable revamping for telecommunication uses.


No-Scheduler s performance drops to almost half as the number of interferers increases to 2 and gradually falls to zero, as the number of interferers increases to 6.

omniVoice provides the full rate for VoIP for up to 4 interferers, and falls only slightly as the number of interferers goes up to 9.


Similar models have previously been developed for TCP Reno.

several aspects of TCP Vegas need to be treated differently than their counterparts in Reno.


In this paper we are not concerned with the analysis of which are the scenarios where one speci.c routing solution for WMNs shows better performance than another speci.c routing solution.

the central question addressed in this paper is: How to design self-adaptive mesh networking solutions that autonomously and on-the-.y decide upon the best routing protocol for a tra.c .ow from a set of supported algorithms, given an estimate of the current network state?


Mapping these processes based on the hop-bytes metric would result into the one shown in Figure 1(b).

mapping them based on minimizing the maximum channel load (MCL) given that the employed routing algorithm is MAR would result into the one shown in Figure 1(c).


With few bit errors, PPR offers good gains because it avoids an entire packet retransmission.

when a packet undergoes a collision, many errors are likely, and retransmitting all of them can be wasteful.


4 Discussion and future work It this paper it has been assumed that ACPC usage reduces the threshold to purchase content.

validating this hypothesis will require a thorough investigation through a focus group type of consumer study.


Assigning di.erent time slots to vehicles clearly helps break the synchronization present in a plain .ooding, where all vehicles would rebroadcast nearly simultaneously.

a similar synchronization on a smaller scale can still occur when multiple vehicles are assigned to a single time slot.


The SSL Landscape A Thorough Analysis of the X.509 PKI Using Active and Passive Measurements Ralph Holz, Lothar Braun, Nils Kammenhuber, Georg Carle Technische Universität München Faculty of Informatics Chair for Network Architectures and Services {holz,braun,kammenhuber,carle}@net.in.tum.de ABSTRACT The SSL and TLS infrastructure used in important protocols like HTTPs and IMAPs is built on an X.509 public key infrastructure (PKI).X.509certi.cates are thus used to authenticate serviceslike onlinebanking, shopping, e-mail, etc.

it alwayshasbeen felt that the certi.cation processes of this PKI may not be conducted with enough rigor, resulting in a deployment where many certi.catesdo not meet the requirements of a securePKI.


Because channel assignment cannot eliminate all con.icts, power control yields improvements.

there is still a signi.cant performance gap between the best solution and our algorithms.


To be able to detect an attack, the detection thresholds have to be su.ciently low.

the thresholds have to be high enough not to cause false alerts for benign tra.c.


To enhance the efficiency of data collection, previous researches [6][7] utilize location information of the sensor nodes to construct an efficient share tree.

the appearance of the obstacles in WSNs might cause the tree topology to be disconnected and hence block the data collection functionality of the tree.


However, this content provider actively markets the RS connectivity and maintains many ML peering sessions.

c2 exchanges more than half of its traf.c via the ML peerings and we notice an increasing tendency towards ML peerings for this player over the last two years.


In principle, a guest VCPU could read its time triple T from the sharedinfo page and useit directly to compute the system time using the formula stxen = st+(TSC- ts)* mf.

the guest kernel neither uses stxen directly, nor doesit count thetimerinterrupts received.


For instance, in the slotted-1-persistence technique, vehicles decide based on the distance to the sender when to rebroadcast a message.

these techniques assume a connected network setup.


The short temporal compression implies the clusters have to agree for a short duration of time, which is highly likely.

we will require more model caches to compress the complete sampled history.


If each service were to works exactly as we estimate, the QoS success rate would be very high.

most of the time, there are many services running on each server node.


link state routing protocols are more complex, and running them adds an important overhead on routers in the form of memory and CPU utilization.


The approach .nally found to work was to use the time reported by the Linux kernel via the function do_gettimeofday().

this method too su.ers from some drawbacks.


For example, the ISP could perform per-.ow accounting on the edge router to police the contract.

some edge routers may not have the memory or CPU resources to perform the necessary .ow accounting especially if hundreds of mobile devices are connected and their applications keep shifting between foreground (where they can see advertisements) and background (where they cannot and the mobile OS closes the open ports) states.


[5]  6.6 Summary of Results [6] We see that dynamic pipelining is the only IP-lookup scheme [7] that is truly scalable in routing-table size, lookup throughput, implementation cost, power dissipation, and routing-table update cost.

all other IP-lookup schemes do not scale well in a number [8] of these requirements.


If peers have received pieces from the disconnected peer, their communication speeds come down temporarilly.

sending peers can be allocated to them again by updating the adjacency matrices periodically.


Hence, already admitted users are untouched until the end of their transmission and there is no allocation dynamics to account for.

since resource is scarce, after a certain number of admissions a new one will be infeasible.


As such, the router to which u0 forwards its traf.c (i.e., u1)is the router that advertised the route tou0 through routing instance .0.We conclude that u1 is alsoa memberof .0.

the active route at u1 is learned from a different routing instance .1.


Based on SOA and multi-agent system, a distributed traffic Simulation system was proposed [15].

all of the current SOA based solutions for transportations employ SOA clients in mobile devices [16-18] that access via the Internet or roadside infrastructures web services deployed on specific servers; thus SOA based mobile applications are not capable of running in the mobile devices independently and directly collaborating with each other over ad-hoc manner.


From the users perspective, the tool is primarily a graphical modelling editor (see Figure 6).

the main functionality lies in the deployment mechanisms initiated and coordinated by the tool.


The need for cooperation is strikingly clear.

a clear understanding of the needs of the data provider and the client is necessary before .exible, e.ective sharing between organizations can occur.


Mobile phones have become more or less synonymous with access in the South.

much has changed since mobile networks began rolling out in the early-to-mid nineties.


RSS .ltering is simple and easy to apply.

if strong RSS data are not uniformly distributed, the estimation of AP positions might be inaccurate.


LITERATURE REVIEW Gupta and Kumar s original work focused on the unicast capacity of wireless networks [16], an many subsequent contributions have been made on the capacity of wireless networks subject to unicast tra.c.

the focus of this paper, and therefore this section, is on the capacity wireless networks under broadcast and multicast tra.c.


A codec change from G711 to G729 and two frame size expansions from 20 milliseconds to 40 milliseconds are sufficient to recover the network.

we examine the impact of transmission rate reduction of a data session here and it would not be easy to recover the network since it has bigger data frame size (8000 bits).


How many handoff calls will arrive at a cell c depends on the number of calls in c's neighbors and on the mobility pattern.

if c's state does not include the number of calls in neighboring cells (as is the case in our model), we must find some way of estimating the number of calls at c's neighbors in order to estimate the handoff probability (which in turn affects the transition probability in the MDP).


Since our mechanism adopt a group sensor deployment, only edge nodes need to be PCK authenticated to the network.

for other nodes, we use the simpler basic-scheme establishment.


Recovery: BigBand recovers the frequency positions and their values by bucketizing the same spectrum multiple times so that  1The above gives the intuition.

technically, we compute changes in the signal power, not the actual signal.


In particular, the core protocols at the basis of the communication among the hosts are often tested using non realistic models, including random mobility models, such as thevery popular RandomWay Point model [9].

the performance analysis of protocols using random mobility models may provide inaccurate information and give wrong insights into the real applicability of protocols and applications.


An out-of-sequence forwarding on the other hand can overcome this problem as nodes that have lost a packet can continue to forward any higher (or lower) sequence number packets that they might have received.

such an approach can potentially lead to unnecessary NACK implosion, where downstream nodes will issue a chain of NACK requests for holes detected in the sequence of packets received, even when the concerned packets are not available.


For example, nodes may learn their position with a certain level of accuracy from GPS receivers.

localization can be acquired via interaction with other nodes (i.e., MANET nodes or a sensor network).


If the received packet does not contain CCN Extension header, CCN gateway forwards the packet to Internet.

if the received packet includes CCN extension header, CCN Gateway decapsulates receiving packet and sends interest packet to CCN router which is connected with CCN gateway.


In principle, we can further reduce the transmitter s interference in these two scenarios by leveraging techniques like full-duplex [7] and interference nulling [16].


Anycast addresses, as described above, are not aggregatable and must hence be advertised individually by routing protocols and lead to routing state that grows in direct proportion to the number of anycast groups.

for our proposed use of anycast, scalability is unlikely to be a concern.


As we can see from the .gure, greedy proxy discovery consumes more energy for the scenarios of high client density and low mobility speed.

energy consumption for the greedy proxy discovery is only between 0-50% higher than on-demand approach due to our scoped NBADV optimization (see Section 8.2.2).


SM transmits multiple data streams through multiple antennas to enhance the data rate.

sTBC transmits multiple coded copies of a data stream through multiple antennas to improve the reliability.


The other type of hidden-terminal interference comes from the side lobes of irrelevant communication sessions at the receivers.

because the receivers can adaptively adjust their reception beams to nullify the sources of the side lobes, we do not consider the harmful e.ect from side lobes.


We have taken Deluge for our reference implementation because of its popularity.

our scheme is independent of Deluge and it can be extended to any other network programming protocols, with assumptions in section 3.2.


In pairwise model d.1), this can be achieved by relying on overhearing the physical preambles like MAC addresses of transmitters, and resolving the respective classes.

this incurs considerably high overhead in dense networks.


We provide the hierarchical communication API to encourage application developers to perform more e.cient in network processing.

we provide the point-to-point API to support communication with mobile nodes while the connection between a mobile node and a computing instance in the fog changes as the mobile node moves.


It is important to note that the service provided by the iConnect plug-in could also be implemented at client-side or at serverside.

one of the design goals for the iConnect project was to keep the client software as lightweight as possible in order to maximize the number of devices through which users can Table 1: Performance evaluation of the implemented services.


As a rule of thumb, thelongeris thedistance theloweris the goodput.

workslike[12] suggestthatthegoodput does not decrease linearly with the increase of the distance but in steps, thus thresholds between radio coverage (RC) and goodput can be set.


Among those applications, video (including consuming and creating/posting video content) is increasingly popular.

meeting the growing demand for high quality video is currently a challenge in cellular networks.


We observe that the uplink bandwidth utilization shown in Fig .2 has a property that the segment closer to the uplink IGW has a better bandwidth utilization in its assigned slot.


pilottones [13] or cyclostationary features [6], are much more reliablesignal indicators than energy, which can potentially relax the perdevice sensitivity requirement.

these methods are morecomplex than energy detection.


Figure 3(a) shows that every value greater or equal to 0.3 is .ne for bringing the average latency time to 50% of the bcast.

c=0.9 appears to be the best value for achieving the overall best tuning time perforindex, proving that our proposal is a very easily con.gurable indexing scheme.


The three schemes perform similarly under low network load conditions.

the performance gains of the EN2 scheme are evident under moderate and high network loads.


Because the main purpose of the Tokyo-XP network is to provide transit services among academic organizations in di.erent countries, the network itself is relatively small in scale, with no more than ten routers in its OSPF backbone area.

through our 8-month study, we found we Figure 8: Number of total Router-LSAs and their changes on APAN Tokyo-XP network could also observe intra-domain routing instability on such a small-scale network.


Since the scheduler resides in the AP, it cannot schedule packets that are waiting in the stations directly.

the AP can generate a schedule from station requests for packet transmission, and issue polling messages to stations at the times specified by the schedule.


Not storing outof-order packets is certainly an option to avoid the DoS attacks.

this will lead to inef.cient code dissemination: Losing one packet at a node will result in the retransmission of all the later packets in the same page.


The maximization of the cache hit ratio, irrespectively of the link through which the requests exit the ISP network, has usually been the objective of ICN research.

we argue that the primary goal of an ISP is to minimize the 3For correctness, it is worth specifying that usually CDNs pay ISPs to send them tra.c only in case ISPs are su.ciently large.


In contrast, the 1-retry scheme usually needs two opportunities to send each segment, increasing the traffic in the network, thus increasing both delay (in waiting for transmission opportunities) and loss rate (due to higher traffic loads).

since the 7-retry system has seven chances to recover from transmission failures, the segment loss rate is zero when load is light.


Thus, more data were written to flash storage for larger email.

when the email is very large, the data amount written to flash stor-age does not increase any more.


To avoid this, a better way would be also propagate the con gestion noti.cation to 2-hop neighbors and ask them drop packets correspondingly.

as we mentioned in section 4.3, coordinating 2-hop neighbors requires non-trivial Queue size (# of pkts) 200 150 100 50 0 0 10 20 30 40 50 60 70 80 90 100 110 120 130 140 overhead.


There has been some work recently on secure localization mainly in the context of sensor networks [13, 12, 15, 16, 18].

many of these techniques would not be appropriate for the purpose of secure localization in 802.11 networks.


The reason is that with observing a very few link successes, EWMA quickly tags the link as connected and hence, other nodes stop listening to that node.

in many cases, it leads to degradation of data delivery performance, as it is shown in Fig.


Deadlocks: The scheduling algorithm resolves most cycles without deadlocks (§9).

we may still encounter deadlocks in which no operations in the SCC can make any progress even if the SCC have obtained all resources from outside nodes.


As the capacity Q increases, the call loss rates de-crease irrespective of the use of BLA.

the call loss rates are reduced significantly by using our location update scheme, especially when the capacity Q is small such as in An )~h ~ Capacity Q Prloss Przos8 4 4 10 2 9.14% 50% 10 10 10 5 4.91% 20% 20 20 10 8 6.12% 12.5% 20 10 10 8 1.66% 12.5% Table 1: Call loss rates of moving from microcell to macrocell tier.


6.3 Waxman Random Topology Model Figure 4a shows the similar behavior for success ratios for the four algorithms under Waxman random topology for changing values of the Weibull shape parameter as the ones under Barabasi model in Figure 3b.

figure 4b displays a little di.erent behavior for changing scale parameters under Waxman then under Barabasi in Figure 3c.


RNCs, which observe all handovers that users experience, can collect accurate information about which cell sector each user is using at all times.

not all equipment supports such .negrained user tracking.


Setting p =10, 000/C ensures onlythat the average number of .ows sampled is no more than 10,000.

the distribution of the number of samples is binomial with a small standard deviation (square root of the mean).


In general there are three properties needed at minimum to make reputation systems work: (1) entities must be long-lived, so that there is an expectation of future interaction with other such entities, (2) feedback about current interactions is captured and distributed so that such information is visible in the future, and (3) past feedback guides buyer decisions.

as various studies have pointed out, reputation systems are not infallible and further work is needed to improve their resilience to malicious behavior.


Due to these obstacles, it seems that in Ca-Fi, the polling based access mechanism (PCF) outperforms the CSMA/CA (DCF) proto-col.

as mentioned above, in practice, most 802.11 stations do not support the PCF mode.


The HIP layer is located between the network and transport layers and provides a new cryptographic addressing space for applications, where communication endpoints are identi.ed using public cryptographic keys instead of IP addresses.

hIP by itself provides no bene.ts unless there are applications using the protocol.


VServerbased systems such as PlanetLab do not provide such support.

uML s slirp interface can be used without root privileges.


by the de.nition of D,less than a fraction 1 - .


This technique still has very strong limitations, for instance it cannot support multiple roaming of the client in a short time.

it seems to be very pro.table even if a high-speed movement of the client is not supported when thinking about how usually of this system to use it.


This can reduce the load on shared access networks, which can often be the bottleneck [10].

while data of.oading has been viewed from theoretical and conceptual perspectives, there is little existing work on supporting these techniques in real networks.


15, it is clear that the value of eopt is proportional topropagationandprocessingdelays(C).

these are non-deterministic in the real environment.


Allocating a .xed frequency band to each wireless service, which is the current frequency allocation policies, is an easy and natural approach to eliminate interference between di.erent wireless services.

extensive measurements reported indicate that large part of licensed bands are in low utilization, for example, only 6% in most of the time [1].


The number of collisions have a signi.cant amount of variation from one execution of the experiment to another because of the randomness present in the MAC protocol.

clearly noticeable is the fact that a drastic reduction in the number of collisions (as shown by the cutoff at around 100 in Figure 5) indicates signi.cant reduction in interference.


Their perfor- mance gets better as x increases and decreases.

in that case, their computational complexities become at least 10 times that of our algorithm.


These plots show a better correlation between S/N and delivery probability.

the range of S/N values corresponding to intermediate loss rates is still Figure 10: Allan deviations of loss rate for various time intervals,for the four 11 Mbit/s links in Figure 8.


Table 1:3D stacking TSV diameter as per ITRS Global Level, W2W, D2W or D2D 3D-stacking 2009-2012 2012-2015 Minimum TSV diameter 4-8 µm 2-4µm Minimum TSV pitch 8-16 µm 4-8 µm  If we are conservative and say that we cannot have a TSV pitch lower than 8µm, we still get a TSV density of 1cm2/64µm2 =1,562,500 TSVs/cm2.

we will never need more than log2(10 ^ 15)=50 bits to address any part of the memory, and we will never need to access more than 1,000 input-weights in order to do one calculation.


Practical solutions, that determine the energy optimal communication settings by exploring the domain of parameter s values, work well when the domain is small [2].

once the domain de.ned by the number of channel width values, modulation and coding schemes (MCSs) and the resolution of transmission power knob becomes large, such as in .exible white space communication, we need to rely on the theory to restrict the empirical search range.


The essence of this idea is that these approaches have not even been considered because their seemingly high cost (or low e.ectiveness).

we believe that they merit to be reconsidered more openly.


From Table I, the mean original flow length, 455, is long enough that flows can be sparse for N as large as 100.

for N = 1,000, the flows tend not to be sparse for any timeout, and the be- havior is roughly the same as for non-sparse applications.


0.4 0.2 According to its grid size calculation, GAF uses a grid size of about 12 m. Like TECA, it employs the same timeouts Ti, Ta, Tp, Tv, and Td.

the sleeping timeout Ts is calculated differently.


With ICN, the victims can retrieve desired information without resolving server s IP address.

current NDN architecture basically assumes well connected networks such like wired or densely populated wireless networks.


However, the complexity of such approach is exponential for each iteration.

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


Both approaches generate safe worst-case response time estimates.

the latter approach, because of extending the request function, can potentially include more higher priority interference leading to worst-case response time estimates that are equal or more pessimistic.


By the service agreements with the neighboring ISPs, any external address can normally be reached via either ISP Y or ISP Z.

iSP X de.nes an inter-domain routing policy such that ISP Y is the preferred egress unless the destination is not reachable via ISP Y.


Identification of users when joining peer groups is thus an essential requirement, as it is in any electronical money transaction.

different levels of authentication, authorization and accounting can be applied into the context of these types of commercially oriented peer groups.


To achieve a good compromise in this trade-off, we observe that merging two separable trees usually results in a tree whose depth, and hence number of accesses, is much less than the sum of the original trees depths.

merging arbitrary separable trees may completely destroy separability and result in signi.cant rule replication.


Based on this information locally available through communication with neighboring nodes, the algorithms use gradient schemes to forward messages to other nodes in such a manner that maximize the value of this information, called utility.

their behaviors are unpredictable when local utility is very low.


randomized [13, 3], deterministic [9], and multi-user detection-based [1, 11].

these solutions require either apriori knowledge of the number of neighbors [13, 3, 9], or node synchronization [13, 9].


4[24] uses user-level instead of .ow-level.

they convey the same meaning in the context of [24].


One simple approach for media selection in DASH would be to identify representations to be played from the HTML content.

this would force the DASH player to select one given representation and we will lose the capability of DASH to switch between representations when bandwidth conditions change.


We assume that a peer with high reputation is altruistic, whereas misbehaving peers will have a low reputation.

a peer with a high reputation may be punished in two ways: a) The higher reputation a peer has, the greater the amount tra.c that will be forwarded to it and, thus, more of its resources (i.e.


The QoS Seeker Pocket PC version measured the round trip delay between a local server and Pocket PC clients.

due to the resource limitation on the Pocket PC, packet delay could be seriously a.ected by CPU usage.


i =(NCBPS /16)(k mod 16) + floor(k/16) (1) j = s × floor(i/s)+(i + NCBPS - floor(16 × i/NCBPS )) mod s (2) Smartinterleavers: Thegoalofthe standardinterleaveristo avoid long runs of low reliability bits by spreading adjacent bits apart to reduce correlated losses.

they do not consider that different subcarriers can experience very different loss rates and differentsymbols canhavedifferentimportance.


Messages are routed on the overlay without considering the differences of capabilities among participating peers.

the heterogeneity nature of participating nodes is quite important.


The event is deemed to be reliably detected at the sink and the reporting frequency remains unchanged.

greater proximity to the optimal operating point can hence be achieved with small t. as seen from Lemma 2 in Section 5.1, smaller the t, greater the conver gence time.


[6] also leverage the ability of OpenFlow for dynamically rerouting tra.c.

the objective is not to forward the packets towards a speci.c location for being analyzed but to frequently change the location of a host in the IP address space (Moving Target Defense).


Several methods [1, 2, 4, 5, 18] have been proposed in the literature to .nd the connectors.

all of these methods only consider the unweighted scenario.


On one hand, intermediaries can share the responsibility for maintaining the global mapping records, which may reduce the overhead of a centralized mapping system.

with intermediaries enabled, it becomes not necessary that mapping updates from the mobile travel through the Internet to reach all of its correspondences, which decreases the overhead brought by plenty of updates sent from the frequently-moving mobile.


Joining is the process in which a subscriber becomes a member of a multicast group.

the GGSN is ready to send data only when the Session Start phase has been occurred.


We .nd that the all-bus-pairs aggregated intercontact times show no discernible pattern.

the intercontact times aggregated at a route level exhibit periodic behavior.


These data centric applications would typically use our Grapevine API.

gV can also support legacy applications that are not written for the speci.c type of network in which it is being used.


As Vmax increases, location query success rates of both IBCLS and GLS decrease.

the location query success rate of IBCLS deceases more slowly than that of GLS, because B-nodes have large transmission range and then the position information accuracy decreases slowly.


When a transaction is completely .nished according to the mentioned steps, its status is recorded as successful.

if some steps are not realized and timeouts oc Figure 6: Timeline for a complete travel of the center pivot.


The Blockmon modular principle is borrowed from the Click modular router [20] which is itself a fundamental pillar in the history of device programmability.

the approach presented in this paper di.ers from the Click one since it is based on a purely functional language and PFQ Lang computations are (combinations of ) pure functions, while Click con.gurations are built by connecting elements that can have side e.ects.


The downside is that, the carrier has to maintain a timer for each 4G user to record how long (s)he stays in 3G.

another possible solution is that the operator immediately switches the user back to the 4G LTE network once the call completes.


When the testbed is relocated to a new location, we expect to get different radio characteristics due to differences in fading, interference, etc.

we do expect to get similar characteristics related to the layout of the experiment, e.g., topology.


This compromises a controller s ability to both react quickly to network events and operate with minimal resources.

dynamic assignment allows adjustments to be made in response to the volume of switch events, or current CPU load, and controller instances can be (de)allocated when additional (or less) processing capacity is required.


Fundamentally, this is because other than observing the links traversed by the probes from our vantage points, there is no way for us to verify the data-plane adjacency of two ASes as claimed by the corresponding control-plane advertisements.

this surely does not rule out ongoing pre.x interception.


In contrast, the Cyclops (refer Table 4) is much more energy ef.cient as compared to the CMUcam and consumes 33 mW for 892 ms, which is better than the CMUcam by a factor of 5.67 in terms of energy usage.

the latency of detection at the Cyclops is around 900 ms, which is more than 6 times as much as the CMUcam.


6, more than 97% of the time is the result of MaxChannelTime expirations in both full-Scanning and observed-Scanning algorithms.

the ratio of optimal waiting constitutes 46.3% in NG, and 72.0% in NG-Pruning, resulting in improvements in latency.


If an otherwise-legitimate router is compromised, it would be able to utilize network resources at an arbitrary CoS setting and send traffic purportedly originating from any user who s identity is known to the router.

if the message signature is carried end-toend (an option for DTN security), a legitimate user could repudiate the origin of any traffic generated in this manner at a later time.


In addition, such a protocol must coexist friendly with TCP, the dom- inant transport protocol in the Internet.

conges- tion control for reliable multicast remains one of the hard- est problems.


The simulation results illustrated in Figure 4 show clearly that the SA and the proposed game have quite the same performance, since the maximum di.erence between the mean value of the SINR obtained by the SA and the game is -3dB.

water-Filling obtains lower mean SINR levels and performance worsens for increasing number of users in the network.


This process may look similar to HARMONIA s SYNC/SYNCD .ooding.

in HARMONIA, as a SYNCD message propagates through a network, each node calculates the relative difference in the MCC readings between the BS and itself.


The major standards use the way measuring difference of SINR or B ER(Bit Error Rate) [5,6].

we cannot make reliable jud gement with only a sin gle SINR value because it has fault ent ailin g a sy st emic error sometimes.


Some researchers proposed the evaluation index for these schemes using the qualitative analysis [3].

such proposals have limited utility unless they take node replication attacks and robustness into consideration.


From the point of view of the cloud provider, covert channel and side channel attacks cannot be detected since they rely on legitimate use of the system [7].

cloud providers can mitigate these types of attacks; two possible solutions are proposed in [7].


Multihop operation can be implemented in high quality multi-media communication systems to achieve cost efficiency.

hidden and exposed stations which commonly appear in mesh environments might remarkably deteriorate the network performance.


From this we can conclude that EtherNet is more suitable to transmit large data information.

for the small data information in industrial control, Ethernet requires more overhead than Lonworks and CAN, so its efficiency is not high.


As shown in Figure 2, the end user does not need to send an HTTP query to CDN A.

dNS-based redirection can see the DNS resolver s IP address instead of the end user s IP address during redirection.


Figure 2: Group-based deployment methods is a factor.

our GKE scheme ensures that every pair of neighboring sensors can establish a unique pairwise key, regardless of the density or the distribution of sensors, as long as the underlying network is physically connected.


This is consistent with well-known results for the sum-rate capacity of non-fading Gaussian interference channels (see, e.g., [8]), where the sum-rate-optimal solution switches from all-private to all-common at a =1.

in our scenario, due to fading and the absence of CSI, we do not have a hard threshold, but rather a gradual switching between these two strategies, and furthermore, the switching tends to occur for a< 1.


Along with a SYN packet, we preload how much we want to send in the next RTT.

because we do not yet know the path price, we do not aggressively preload.


A Regional Cell Routing in Wireless Sensor Networks Dae-Young Kim and Jinsung Cho Department of Computer Engineering Kyung Hee University, Korea {kimdy,chojs}@khu.ac.kr ABSTRACT Among routing protocols of wireless sensor networks, hierarchical routing protocols are more e.cient, in general, because they involve less sensor nodes for data transmission.

when events happen regionally and dynamically, unnecessary overheads occur in hierarchical routing protocols.


The performance improvement is not obvious when M increases from 2 to 4, because the packet classification speed has already reached the speed limitation of single-dimensional search engines.

for ACL1 and ACL2, the proposed pipeline architecture needs more than 20 time slots to finish a packet classification when M=1.


For the first moving pattern, we tend to let the user move in walking speed on a straight line.

for indoor building scenario, there is no enough space to let a user move continuously move in one direction, and thus we let the user move in circle.


In the static scenario, when malicious nodes drop routing packets or routing and data packets, DSR and CONFIDANT have similar behaviour.

when only the data packets are dropped, the overhead introduced by CONFIDANT increases as the percentage of malicious nodes increases.


The probabilities calculated in the tables show that our algorithm performs well.

in real situation, when sensors are deployed in the .eld randomly, they may not have enough number of neighbors for the correct and complete analysis.


For perfectly reliable communication links,his can be achieved by the pursuer issuing an evader location query shortly before reaching the critical point.

in the presence of message losses, the pursuer needs to issue multiple queries within one sampling period and adjust the frequency of its queries according to the game state.


Therefore the number of newly created components is at most three (note that one existing component terminates at concave node).

while new component is sometimes created, the creation of two or three components is a rare event.


Accordingto[14],whentwonodes meet a messageissenttoanother nodeif thedeliverypredictabilityto thedestinationishigher than the other node.

as the node that forwards the messagecan.nd abetternodeorthe.naldestinationin the future, the forwarded message is not removed from the node,butis storedinbu.er(sincethereis available space).


The key idea in the design of PSFQ is to distribute the data from a source node by transmitting data at a relatively slow speed, but allowing nodes that experience losses to recover missing data packets from immediate neighbors aggressively.

pSFQ does not provide any reliability for single packet messages as it uses a pure NACK based scheme.


In such a case, if the tra.c is not considered as suspect, no speci.c rule has to be installed as it already exists (the controller might be requested to disable the mirroring to the middlebox).

when a suspect behavior is detected, a drop rule has to be set as shown in Figure 4(b).


In these applications, the sink represents the notion that the data collected in the WSN is only valuable to the extent that it can be removed from the network.

in many applications the implicit assumption is that the information coming out of the network will be used to monitor the environment and take action when necessary.


When the percentage of multicast receivers was 70%, MOTMRP per formance was slightly inferior to DODMRP and MTMRP.

it can be seen in Figure 6 that the performance of the compared protocols was equivalent in terms of energy cost.


4.2 Tit For Tat A second alternative is to use a Tit For Tat (TFT)strategy[2].

itwasgeneralizedin[15]forthewirelesscontext as follows: (0) p =0 i TFT (k)(k-1) p = p for k = 1. i TFT -i Milan et al.


streaming and file sharing applications, in particular napster (curve 3) and realaudio (curve 7) buck this trend.


that essentially use such model-based methods.

such model-based approaches have limited applicability in several scenarios.


Figure1(a)depictsthe route-sharing structureof twopathsfromS toD on IP, subnet (SN), and AS levels.

figure 1(b) compares them on each level separately, by calculating a longestcommonsubsequence(i.e.,LCS,presented as the boxed nodes).


We .rstnote thatApacheby itselfdoes notperform well with1,000 clients, and we could notgetit toserve10,000 concurrent clientsat all.Both xOMB and nginx show similar curves, although we outperform nginx for all connection sizes.


A global membership service informs each surviving member of the same sequence of membership changes, so that a consistent view of the evolution of the system can be maintained at each stage.

the inventory construction process does not need to produce consistent intermediate states: its goal is to converge quickly to a state in which each member agrees on the current membership.


Recovering this data incurs no energy overhead for clients as long as the measurements are only uploaded while the battery is charging, and our recent analysis of 89 million scan results collected from 139 smartphones over 5 months [13] has demonstrated the value of these measurements for network monitoring and debugging.

because smartphones are frequently idle, periodic scans may not re.ect either locations where users actually use their devices or locations where their devices use the network.