The host software can also be incrementally deployed; early adopters get a signi.cant bene.t, but they can remain (at least for a very long time) backward compatible with the old architecture.

we don t mean to imply that deployment will be easy, only that it won t be impossible.


This consequently increases the number of active links in the network (subject to the available power constraints).

(ji)(ji) if P>P, then it is possible allowed min (ji) for terminal i to receive j s signal but only if Pis allowed (j) less than Pmap (included in the RTS).


We are exposed to any combination of these common sources in everyday life, which is not a cause for concern and hence should be classi.ed as part of the background radiation Bi.

because each source is probabilistic and their exact combinations are not known and vary with time and space, a perfect characterization of the background radiation is impossible.


There are two broad design choices of emulating RDMA overUD, using zero-copy or copy-based.

using zero-copyover UD becomes dif.cult to accomplish as UD does not guaranteein-order delivery of packets.


Simulation results are the average over completed executions, which gives an indication of the exponential increase of the simulated delay.

beyond p(s) =0.2 the optimal policy progressively reduces the number of spawned replicas, and signi.cantly outperforms both the single and the greedy policy.


This indeed requires an individual physically signaling channel.

the precision of information in the request also largely relies on the implementation details, such as CC Interval frequency, CCI trigger and eligibility of clients for CC, which all introduce significant overheads.


In TSA, frame sizing for the new set of frames is established once and for all at the end of their parent frame, according to the observed outcomes on it.

as frames are executed and tags are identi.ed, the knowledge about the amount of discovered tags for each frame can be used to better estimate the number of tags to be identi.ed and properly establish the size of the following frames.


Application-transparent architectures like CANS [3] or Conductor [18] share goals with our approach in hiding the mobility artifacts and supporting legacy applications.

they are tied to their network architectures and intercept network tra.c at the interface between application and operating system.


However, currently, NFC is supported by only a few smartphone platforms.

cOBRA can be implemented on almost all smartphone platforms that are shipped with a camera, and also leverage the abundance of public L-CD displays for applications like advertisements.


The main reason is that with an MCSS of 1, sensors need only be in communications range of one other sensor.

as the MCSS is increased to k, sensors must be in the communications range of a minimum of k other sensors.


The adaptive array antennas are normally digital beamforming antennas.

eSPAR antenna relies on RF beamforming, which drastically reduces the circuit complexity.


However, a virtual router that is not running is easy to detect and therefore less of a concern than protecting the integrity of the software and data.

it is an area that does need to be addressed.


4.4 Dynamic IP Block Aliasing In the previous section, we have shown that we can enumerate the entire Storm network with high probability.

care has to be taken not to overcount the number of Storm nodes in the network.


Another approach to solve the problem of .tting multiple lines to a data set is to model the data as a mixture model and apply the well known statistical method of expectation maximization (EM) to separate the data [21].

the EM algorithm requires the initial parameters to be guessed and the accuracy of the results depend on the values of those initial parameters.


6.4 Discussion Overall, we can model regular and periodic behavior in alert .ows, and we detect sharp and impulse-like peaks and valleys (all .ve .ows) outside the day and the week rhythms of the alert .ow.

normal behavior of alert .ows consisting only of impulse like peaks, e.g.


Hosts (including servers) that do not actively transfer a large amount of data with mutliple hosts will not be falsely identi.ed using this ratio metric.

the activeratio metric with the threshold of 0.35 or more also signi.cantly reduce the true positive rate.


approaches 100% (this can be explained by Theorem 3.1), and (ii) U-CSMA Recently, it is shown that CSMA algorithms can achieve throughput (or utility) optimality where static channel is assumed.

in practice, the channel capacities are typically time-varying.


QUALITY OF EXPERIENCE METRICS Several conventional QoS metrics, such as packet delay, packet loss rate and jitter, are generally employed to gauge the impact of network performance on the applications transmission.

these QoS metrics only give information about the network condition (network/packet level).


So far the evaluation of context-aware forwarding protocols has relied heavily on simulations, due to the di.culty in modelling the complexity and variability of the user context.

it is generally highly desirable to have also an analytical model of the system, in order to complement simulation results with, e.g., theoretical boundaries on the protocol performance.


They work at a coarse per-ingress level and we cannot compute the applicationmetricsonamore .ne-grainedper-ODbasis.Again,this is not aninherentlimitation of application-speci.c approaches; we can also con.gure them on a per-OD basis.

this signi.cantly increases the complexity since we need an instance per application per OD-pair.


From Figure 4, we can conclude that S-BGP is doing exactly what it is designed to do: it is limiting the set of paths the attacker can announce, thus forcing him to announce longer paths.

in light of the results in Figures 2-3, we must ask ourselves why forcing the manipulator to announce longer paths does not seem to signi.cantly limit the amount of tra.c he attracts.


ROAM uses a route reply-request process similar to that used in AODV, DSR and other on-demand protocols.

a node can change its next hop to a destination without notifying its neighbors as long as it has a neighbor with a distance that is shorter than the node's own feasible distance value to the destination, where such a distance is the smallest value at- tained by the node's distance since it obtained a route to the destination after sending a route request.


Also, voting could be more tightly integrated into processing, for example, by voting at the end of the decision process.

code development may become more challenging, since this approach relies on knowing which parts of the code are functionally equivalent, and under what conditions this holds true.


ratio of qualified users,PUs or SUs 1 0.8 0.6 0.4 0.2 0 10 20 30 40 50 60 PU Solid line: PU compensation Dotted line: no PU compensation SU number of PUs users requiring 384 kbps The results show that all the PUs are served irrespective of the mix of PUs and SUs, but, as would be expected in a priority qualified user ratio 0.8 0.6 system this is at the expense of the number of SUs.

what is also noteworthy is that as the number of PUs increases, the total number of users decreases.


Web pages can be updated frequently to attract users and keep their popularity.


Just so, the results justify that there is a tradeoff between CDP and CBP [14].

the CBP of WB of our scheme is also somewhat greater than that of none optimization in Fig 5.


These extraneous edges not only waste memory but also provide mobile stations with unnecessary neighbor information, degrading the performance of the algorithm.

a carefully chosen edge-deletion timeout, T , can minimize the overhead, thus making the neighbor graph converge to the mobility graph continuously.


Moreover, the untended nature of sensor nodes and hazardous sensing environments preclude battery replacement as a feasible solution.

the surveillance nature of sensor network applications requires a long lifetime; therefore, it is a very important research issue to provide a form of energyefficient surveillance service for a geographic area.


For SMS and Location, BPEL proxies were created by using the WSDL interfaces de.ned by Parlay-X, these provide su.cient information for invoking the corresponding functionality from a BPEL work.ow.

java proxies were implemented by generating Java clients from these WSDL descriptions (using standard IBM tools) and wrapping inside our proxy structure.


We have shown that perfect proactivity no spoofed IP.ow can penetrate is intrinsically di.cult to achieve in Internet AS topologies while maintaining sparse coverage.

this is mitigated by the fact that those spoofed IP.ows that can escape the .lter net can be localized to within 5 candidate sites which facilitates e.cient IPtraceback.


One straight forward way to handle these overlapping rules is to translate them into non-overlapping rules which represent the same semantics.

this is not a good solution because Figure 11 shows that the resulting non-overlapping rules require one or two orders of magnitude more TCAM space than the original overlapping rules.


Whether an AS uses the all-in-memory approach or relies on disks depends on its aggregate load and other factors.

we note that a single fully-loaded Sun Blackbox (250 multi-core processors, 7TB RAM) [35] can easily handle the memory and processing requirements of a large ISP, so this is easily within the reach of today s technology.


Consequently, an edge q-node should be connected at least to another q-node.

a core q-node should be connected at least to two other q-nodes: . ''


Here, the transmitted data are the same as the case if the maximum power of the BS and RU is used on their links.

using (9) and (10) helps to prevent the waste of power, which would happen with the use of maximum power, due to the .nite amount of data in the queues.


They use produce frequency-based (spectrogram) features, similar to the features we use.

their approach assumes the centralized setting.


Also, a smart space middle framework with its emphasis on the contextaware service composition is suggested for OSGi (Open Services Gateway Initiative) driven mobile network environments [8].

in spite of many existing e.orts specially tied with service oriented networks (SONs) [7], the .exible composition of large-scale media-oriented services are only partially addressed so far.


4.2 Collaborative Calibration Problem De.nition Our analytical framework can handle classes of mobile and stationary sensors with arbitrary drift rates.

we will focus our discussions on systems composed of inexpensive, high drift rate mobile sensors, andexpensivebut accurate stationary sensors with low drift rates.


As expected, a downward trend still exists for all strategies as network load increases.

even at an event size of one, the occupancy + delay strategy yields close to an 80% gain in network e.ciency over no congestion control.


QoS-aware Directional Flooding-based Routing for Underwater Wireless Sensor Networks Junhwan Park, S. Lee, Dongkyun Kim School of Computer Science and Engineering, Kyungpook National University, Daegu, Korea dongkyun@knu.ac.kr ABSTRACT Previously, we proposed the Directional Flooding-based Routing (DFR) protocol where the .ooding area is updated according to link quality to provide reliable packet transmissions in loss-prone underwater wireless sensor networks (U-WSNs).

since the original DFR was designed to have static system parameters to consider a QoS requirement, it cannot meet the QoS requirement if the network condition changes dynamically which is inherent in UWSNs.


This is an optimal strategy for a secondary in a one-shot game.

fora repeatedgame,itmay notbeoptimal for example a secondary may choose not to buy bandwidth in a slot even if the price is less than his valuation, so as to induce primaries to lower prices in future slots.


DCTCP [4] was developed to accommodate the con.icting requirements of throughput-sensitive large .ows and latencysensitive small .ows.

it is a single-path data transfer scheme.


Throughout this section, we focus on the injection of individual packets and do not explicitly define sessions.

we can regard a single packet injection as a session with a burst size of 1, an arbitrarily small injection rate and an active period of 1 time step.


The past several years have seen a lot of research e.orts devoted to capacity analysis [4, 6, 9, 10, 11, 12, 15, 16] since the seminal workof Gupta and Kumar [5].

there is still limited knowledge regarding the e.ect that transmitting power has on the capacity of wireless ad hoc networks.


3a, the packet.lter thatprotects V6 contains four rules to separatelypermitV5, V8, V9andV10.

iftwo aggregatable pre.xes (say10.0.1/24and10.0.2/24)are assigned to V5 and V8, then the two VLANs can be permitted together in one rule that permits the aggregated pre.x 10.0.1/23.


In a small or medium size network, or if a node has plenty of memory, it may wish to maintain a large or even complete membership knowledge.

in a sensor network or a very large ad hoc network, nodes may wish to save memory and only maintain a partial membership view.


If the network is partitioned, the total dissemination latency is very di.culty to model.

our scheme still can facilitate the aggregation operations within a connected part of the network.


Figure 7 presents results that con.rm our intuition: slowing down LP traf.c improves the HP packet reception ratio.

naively increasing this parameter can impact the overall network performance for the following two reasons.


More speci.cally, one could simulate the moves of each individual user and wait until the system reaches equilibrium.

given the size of the network we are considering (see Section 5.1), such simulation-based approach may take a prohibitively long time to converge.


The connection tracking leaves per .ow state informa tion at ECRFN-capable routers which contradicts the aim to have a stateless network.

loosing this information due to power outages, re-routing, etc.


Intheliterature(see Sec.2foranoverview), severalproposals aim at reducing the overall network power consumption by turning o. nodes and links, and re-routing tra.c to save energy [8, 9, 10, 11].

these policies can be applied to transit nodes/links only, since at the network access, nodes and links cannot be turned o. to avoid disconnecting users.


In the wireless part, the QSTAs perform the role of End-Systems.

as we announced earlier, the wireless part of this hybrid network has several limitations that are related to the wireless medium.


Currently, the values used are a = 0.1, b = 1, c = 3, d = 1, e = 10 and f = 5.

they are subject to additional tuning, depending on the model of the controlled object (in our case the wireless interface).


As a result, there is no bi-directional active transfer in those protocols.

this bi-directional transfer of bittorrent occurs only in leeching peers that are connected to other leeching peers.


The ERA offers a proxy for the applicability of opportunistic computing schemes to a given network: if the ERA is low, any opportunistic scheme can be expected to fail due to a sheer lack of resources and/or connectivity among them.

if the ERA is high, success can be expected.


Designing an Inter-Cloud Messaging Protocol for Content Distribution as a Service (CoDaaS) over Future Internet Yonggang Wen School of Computer Engineering Nanyang Technological University Nanyang Avenue, Singapore 639798 +65 6790 6562  ygwen@ntu.edu.sg ABSTRACT User-generated content (UGC) has become one of the dominant media formats.

current approach to distribute UGC adds two middlemen (e.g., content aggregator and content distributor) in the value chain, resulting in a higher cost for media consumers.


Most mail delivery software can now be enhanced with .ltering products, for example, ProcMail [21] and SpamAssassin [27] can be used with Sendmail, Post.x and qmail mail servers to add .ltering extensions like blacklists and bayesian .lters, distributed checksums, realtime blocklists etc.

such extensions are done in a rigid, inextensible manner and may not cater to the needs of a particular site.


In order to correctly balance the contributions of the users and ensure a reliable data fusion, these protocols try to characterize the users, learn how they behave and at which extend they shall be trusted, using either probabilistic or reputation models.

in order to effectively track users, the sensing contributions that they make must be authenticated.


DISCUSSION We have presented a framework for traf.c management and resource allocation in small networks.

our approach leaves some issues for future work; we outline here the most important of these.


virtual antenna array by sharing the antennas of other devices with high channel quality to exploit the space diversity.

this cooperative method has a drawback of the transmission-rate loss since it requires time delay for transmitting signals to be distinguished at the destination node (D) in time-division multiple access (TDMA) system.


Similarly to Algorithm HGB, the algorithm iteratively adds trees to the broadcast scheme.

the way by which the duration time is selected at each iteration is di.erent.


The .rst is for network devices to give endhosts explicit feedback.

because these designs require hardware and con.guration changes and (for [6]) packet header changes, in-network solutions have rarely seen widespread deployment.


As can be seen, 50% of the clusters are formed in a short time, typically the first 50 slots.

for all clusters to be formed completely, it takes as large as 12,000 slots for the last of 5 clusters (see Figure 8).


Overthe lastfew years,extensiveresearchhasbeenconductedinthisarea to specify new routing schemes that meet the requirements ofVANETs [1], [2], [3].

up to now none of the proposed solutions has reached the RFC state.


The links within a single AS are more diverse and therefore, peers with low delays should be preferred as targets.1 The evaluations shown in Figures 3(a) and (b) use global knowledge to select the peers with lowest delays.

.nding kL nearest peers of a particular peer accurately in a distributed system is very expensive [5].


This makes their solution only valid for those DCS that performs such type of division, which is not standard.

our solution is valid for all type of DCS networks independently on whether they perform network division into cells or not.


The author also shows that the network restoration time is around 200 ms.

the centralize controller could be overloaded with recovery messages and thus might introduce scalability issues.


CONCLUSIONS In this paper, we presented a new localization method, MDS-MAP, that works well with mere connectivity information.

it can also incorporate distance information between neighboring nodes when it is available.


In FFR-3 scheme, FFR is applied to the macrocell users, and the femtocell users are randomly assigned from the full frequency band.

fFR is not adopted for macrocell users in NoFFR-3 scheme.


On highpower devices such as a car computer or a laptop, using all links simultaneously will give the best user experience; both performance and robustness are improved.

on energy constrained devices, the selection must also encompass power consumption considerations making the decision algorithm more complex.


Likewise, Figure 8b shows newaccess network from the NAR shortly after arriving, as shown near label b.

these packets contain out of order sequence numbers (higher than expected).


Even when the rate of a .ow traversing this path increases by one packet per second, a transmission on the link C-D will contend with all the other four packet transmissions on the path.

decrease phase: when the feedback rate is smaller than the current rate, the sender performs the decrease phase (lines 14-15) merely adjusting its current rate to the feedback rate.


Speci.cally, depending on various parameters, users of an onion-routing network who choose paths entirely out of highly trusted routers can sometimes minimize their risk of deanonymization via the correlation attack [31].

if other users are concerned about adversaries with a di.erent trust distribution, using only highly trusted routers would lead to di.erent users preferring different routers for their paths and the choice of routers itself may identify the user.


There is a willingness to remove the state machine abstraction and o.er developers familiar notions in order to enable converged services.

the consistency checks and robustness of .nite state machines are also lost in the process.


One example of a multi-channel MAC-layer protocol is MMAC [12], proposed for wireless communication using 802.11.

as clearly articulated in [18], protocols used for 802.11 nodes are too heavy-weight for sensor networks.


3.4 Objective It is desirable to design an auction scheme satisfying all four properties described in the previous section.

the well-known result in [16] shows that no double auction mechanism can achieve truthfulness, budget-balance, and ef.ciency at the same time, even putting individual rationality aside.


Failures introduce an inherent tradeoff: On one hand, one would like to use a routing which is optimal for the new network.

one would like to limit modi.cations to the current routing, since changes can potentially cause disruptions in service due to path shifts and route convergence time while the system reaches a consistent state.


Since network dynamics constantly change the topology graph characteristics, the graph should be constantly checked and updated for greedy support feature.

the distributed architecture of the network leaves us with no .xed landmarks that can be used as resumption references for the topology.


Note, that this is a one-time cost per OSN.

it is not possible to do the same kind of analysis for online shopping sites as these most likely use HTTPS rather than HTTP.


4.1 Scaling and Isolation To quantify the scaling and isolation aspects of HLP and compare them with BGP, we need a mechanism to analyze the routing dynamics of both protocols given the precise location and type of a routing event.

given the complexity and generality of BGPpolicies, a precise modeling of BGP s routing dynamics is a challenging problem.


Researchers need to test their communication protocols under various application scenarios and real network settings, and students should be able to implement and integrate small projects.

designing such a testbed, especially as part of a bachelor-level course, poses many challenges.


If N is large, then scanning is effective because a random selection of items is likely of .nding an inconsistency.

searching requires traversing the tree, introducing control packetoverhead.


These smart sensors have capabilities like sensing, computing and wireless communication as well as selfconfiguration.

they are limited in computing and communication abilities.


The destination is represented by a biogas plant in this scenario.

in other scenarios the destination might be a silo or a further processing plant.


The non-convergence issue is a major drawback of the k-means algorithm, especially when it is applied in high-dimensional data space.

the k-means algorithm with geographic information requires careful tuning of parameter .


Prefetching data over a cellular network will increase data usage if the prefetched item is never requested.

the mobile computer can prefetch data over a WiFi network and thereby reduce data usage by avoiding a subsequent demand fetch over a cellular network.


If CAP is insu.cient due to increased temporary tra.cs, IEEE 802.15.4 expands CAP by increasing SO in a beacon.

if SO increases, the size of GTS slots also exponentially increases as shown in Figure.


2.1.3 QuickerBoundsChecking OCaml automaticallyintroducesfastbounds checking codebefore every buffer or array access.

it is possible for bounds checks tobe selectivelydisabled through the use of an unsafefunction; e.g.


3.4 Authenticate and Associate Association is therefore a packet-based emulation of the act of plugging a laptop to a given base station, as would happen with a wired LAN.

this small di.erence is su.cient to create problems when combining association and authentication.


This is because if the session is terminated (using a BYE), then the creation of the new session would require the user to explicity make a new call or accept an incoming call.

our architecture is equipped to handle this situation e.ciently.


An important issue to be considered is that the materialization of large amounts of data in sensor nodes may cause memory overflows and consequently data losses.

the excessive sending of data packets to other nodes may result in unacceptable energy consumption levels.


6.2 BuildingPro.lesforNormalUsers In manyapplications, it is desirable to generate user statistics to help understand normal user behavior and distinguish abnormal activities.

it is dif.cult to obtain such statistics as malicious activities can pollute the data, especially when attackers create millions of accounts.


Furthermore, although this method converges eventually, its speed depends on network size and could take a very long time in large disconnected networks.

if we assume that nodes perform independent random walks, we can produce an estimate of M by taking advantage of inter-meeting time statistics.


In particular, the parameter p shows an interesting effect on security: if the number of authenticated messages sent by the sender per time interval is low, p = 10, 12 provides better security than p =6, 8.

as the number of authenticated messages sent by the sender increase, a better choice would be to set p to values lower than p = 10, 12.


For SC-Book, Figure 7(a) shows that 20% of sources complete their entire workload (100% on the x-axis) within the .rst hour of their arrival.

only 60% of the sources send 10% or more of their total workload within the .rst hour of spamming.


In TCP-Reno, packet loss is detected by a sender through reception of three duplicate ACKs.

in Rainbow, loss is conceded by a receiver and the receiver has to wait for more reordered packets reception before loss detection because ordered delivery cannot be ex- pected.


We are aware that with high probability this phenomenon is speci.c to the hardware we use.

to discard possible biases, in the rest of the paper we focus on communication over more ef.cient adjacent subcarriers.


IB token are currently available for EPblack .

no PCIe or IB tokens are currently available for EPwhite .


One of the popular DTN routing protocols is PRoPHET, which uses history of node encounters and transitivity to enhance performance over previously existing Epidemic protocol.

fault forwarding decision when two or more neighbour nodes carry equal or nearequal delivery predictability value is occurred in PRoPHET.


Assuming that 1 in N packets are selected on average, the total number of packets in the stream can be estimated by multiplying the number of sampled packets by N. Assuming sampling decisions to be independent of packet size, the total number of bytes can be estimated in the same way.

more detailed characteristics of the original traf.c are not so easily estimated.


We note that since the monitoring system is uni-directional, TIMO cannot cancel its signal at potential video receivers; hence, we observe thatinterferencedegrades the monitoring system sperformance at nearby locations.

in contrast to the current mode of operation, where 802.11 loses connectivity in most locations due to interference, TIMO is an improvement over the status quo because it reduces the range of interference to close-by locations.This moves the system to a scenario where the two technologies enjoy somelevel of coexistence, whichdespitebeing farfrom optimal,is more acceptable than the current situation.


Sociocentric Egocentric Node betweenness betweenness w1 3.75 0.83 w2 0.25 0.25 w3 3.75 0.83 w4 3.75 0.83 w530 4 w60 0 w7 28.33 4.33 w8 0.33 0.33 w9 0.33 0.33 s1 1.5 0.25 s20 0 s40 0 i10 0 i30 0 Figure 2: Bank Wiring Room network sociocentric and egocentric betweenness [25] The betweenness centrality CB(pi)based on the egocentric measures does not correspond perfectly to the sociocentric measures.

it can be seen that the ranking of nodes based on the two measures of betweenness are identical in this network.


However, .ooding based algorithm is ine.cient and not suitable for a large scale network because it signi.cantly increases the network tra.c as the number of the nodes on P2P network increases.

retrieving and forwarding on structured P2P networks are very e.cient because structured P2P networks have address structure in contrast with unstructured P2P networks.


Ideally we would get ground truth by con.rming, externally, what services run on each machine.

we cannot do this for our dataset since it spans a signi.cant portion of a university with hundreds of separately administered groups and thousands of privately run machines.


Hence, the irreducibility actually ensures that the graph is connected.


2.1 Studies of BitTorrent s incentives Cohen began the study of his BitTorrent protocol s incentives by demonstrating that tit-for-tat-based incentives make BitTorrent robust to strategic gaming [5].

cohen later found strict tit-for-tat to come at too high a cost [4], and weakened the protocol s incentives to achieve better performance.


The partitions are looked-up in parallel to .nd the matching rules which are then pruned based on their priority.

the partition size is unconstrained and there may be hash collisions, resulting in unpredictable performance.


We cannot claim to understand all the reasons for this lack of success.

we believe that one signi.cant factor is the enormous effort that developers must make to prototype and evaluate Bluetooth applications in the wild.


On one hand, the Expoitability increases as more advanced exploit technology and tools become available.

as the vulnerability is known to more and more people, it increases its temporal metrics value as it is subject to more exploits.


For example, sources 1,2,3, and 10 all talk only to destination a, while sources 4 and 6 talk only to destination c. This pattern suggests some common purpose to the traf.c in each of the two subsets of corresponding .ows, and hence suggests in turn that some notion of community may apply to these two sets of sources.

while source 9 also talks to destination a and source 7 also talks to destination c, they each talk as well to destination b.


Clients resolving a name would receive both a signed response together with the signer s public key, allowing the veri.cation of the response.

dNSSec requires the establishment of a trust relationship between clients and the resolution infrastructure.


Multiple NMs: Our current attempt has focussed on a single NM managing a given network.


Enforcing nodedisjointedness during path selection yields up to a 10% increase in PDR.

the latter path selection mechanism has a higher control overhead than the former.


This wisdom is mainly due to an assumption that performing route computation at the edges of the network (as opposed to within the network) requires awareness to very short-term changes in the routing state of the network.

through (possibly in-band) endto-end measurements, cooperating endpoints can obtain up-to-date routing state of the relevant parts of the topology and can respond to short-term changes in routing state.


The IETF DCCP protocol [10] allows users to activate a less penalizing congestion control.

it does not provide more QoS guarantees than UDP.


Because the frame setup does not explicitly use any topology information, this scheme is robust to routing topology changes.

this scheme requires an accurate precomputation of frame duration (the previous scheme su.ers from this drawback as well).


(a) PIM-SSM (b) PMI Figure 1: Relationship between policy and mechanism.

most of the existing multicast routing protocols are not so .exible and adaptable to di.erent types of applications.


INTRODUCTION Wireless networks have become increasing prevalent in the modern world.

as their usage increases the available communication capacity within any given frequency band becomes more congested.


A .rst interpretation of these results could be that existing routing protocols need to be extended or new routing protocols need to be de.ned to support the identi.ed properties.

this implies that every time a new operational need were identi.ed, a new extension to the existing protocols or a new protocol would need to be created, which could be a very lengthy process.


Because of the advantages, the new architecture SCTP/IPv6 will replace the TCP/IP architecture very probably in the future.

considering that the Internet was designed to meet the different needs of users, the evaluative criteria of a new network design has not changed and it must reduce to the following question: how happy does this design make the users?


These systems are however designed for uplink communication from the backscatter device to an RFID reader, and do not enable decoding on a low power backscattering device.

we present µcode, the .rst coding mechanism that provides the bene.ts of CDMA and can be decoded on a backscattering device; we also show that µcode can enable concurrent transmissions in a network of battery-free devices.


Of course, simply not retrying ACKs would not reduce the overall number of ACKs, as the tag will remain active and the retry ACK will e.ectively end up in the next round.

as retries generally do not provide a signi.cant bene.t, a more appropriate response would be to not waste time on retries, but instead change the physical layer parameters used in the next round.


Opportunistic user addition: The above mechanism for determining the number of permissible users increments the number of permissible users only until the observed utilization crosses the lower threshold.

it is desirable to maintain the observed utilization as close to the upper utilization threshold as possible in order to utilize the network resources more ef.ciently.


The main advantage of this technique is that it relies on the clock skews between machines, which are relatively stable and do not deviate much over time.

this technique was designed for wired networks and it actually requires some co-operation from the fingerprintee machine both the TCP timestamp option and response to ICMP timestamp requests can be disabled and even on Windows machines, TCP timestamps are not enabled by default.


To evaluate the ability of a network to cope with catastrophic failures and recover network services while in a disconnected state, several network resilience measures have been proposed such as the probability that all operative node pairs can communicate, the expected number of node pairs communicating, the expected number of operative nodes communicating [2,4, 9,10,15,17].

unlike connectivity-based reliability measures, network resilience measures have not been previously used in the literature as network design criteria.


Indeed, before summarizing routes, B3 and B4 prefer to send tra.c destined to E2 via B2.

when summarization is introduced, B1 and B2 propagate one aggregate for both E1 Figure 3: Route summarization gadget.


Equation 7 is only an estimation as it neglects interference from other sources that may be included in the measured RSSI value.

as mentioned above, channel 26 was used and while this is not free from all types of interference, it is outside the range of 802.11 b/g which might otherwise be a signi.cant source of it.


CDNs select low-latency servers by typically geo-locating the client (or LDNS server) IP address.

recent work [7] on 3G phones shows this will not work in the cellular domain.


This design is bene.cial when there is a concurrent mix of foreground and background traf.c.

our design provides apps with the capability to specify a quantitative metric to optimize directly.


Under these circumstances we assume that there willbeafallback procedure that relies on back-end message exchange to share the spectral information of the secondary.

the threshold test is able to determine the correct spectrum over a wide range of SNR which are discussed in §6.


Existing multi-resource fair queueing algorithms [13, 32, 35] use the goal of achieving work conservation as an indication of ef.ciency.

in the theorem below, we observe that such an approach is ineffective.


Recently, researchers have formulated analytical models for the problem of ef.cient data exchange among peers, and measurement studies using actual download traces have attempted to shed light into the success of BitTorrent.

certain properties of these studies have interfered with their accurate evaluation of the dynamics of BitTorrent algorithms and their impact on overall system performance.


Areductionof throughput around0.5isexpectedif thetwolinks are in carrier-sensing range of each other.

a reduction in excess of 0.5 implies hidden terminals, with the most severe hiddenterminalsapproachingathroughput reductionof1(i.e.,zero throughput).


** cwndest; RT Test 26: Advertise rwnd as the receive window size; 27: end if  not available(Line8).

if the timestamp optionis available, DRWA uses it to obtain a more accurate estimation oftheRTT(Line10 12).


The closer the client is to the cell tower, the higher the pilot power it sees and the higher the modulation rate that can be used.

the farther the device is from the tower, the lower the pilot power it measures and the lower the usable modulation rate.


For example, a 10Gbps network with a 500µs round-trip time (RTT)necessitates that switches have 625 Kbytes of bu.ering per priority per port.

the amount of bu.ering that can be providedinadatacenterswitchis limitedbycost(at10Gbps lineratesthelowaccess timeallowedperpacketnecessitate that expensive SRAMs be used to build switch bu.ers)and latency (having shallow bu.ers bounds the worst-case latency of a packet through a switch and, hence, end-to-end).


If the maximum contention window of high priority .ows is constrained to be too small, they will experience high degree of contention.

if this parameter is chosen to be too large, signi.cant bandwidth will be wasted by making low priority .ows wait very long unnecessarily when high priority .ows are not backlogged.


Formally, this corresponds to a new rule for the root and additional rules for the respective siblings.

we have to ensure that the remaining allow rules (i.e., rule 3) are not affected by the arti.cially inserted deny rule that covers all elements.


To the best of our knowledge, there isn t yet a design rule/formula for S-bend losses as a function of R, L, d, ..

measurements for d =10 mm can be found in [28].


the migration rate also depends on the choice of the parameter .


In [2], authors give a similar game theoretic analysis of Slotted ALOHA.

they also assume that all nodes are identical and only consider the symmetric Nash equilibrium.


The algorithm proposed in this paper aims to compute the best solution in this large solution space.

the basic pattern routing algorithms in [8] only explored different segment orderings.


One may emphasize on the benefits of scalable or layer coded video.

we need to keep in mind that we may not achieve a fine grained adaptation performance in layer encoded video since the more the number of layers, the less the coding efficiency.


Most of these works focus on inferring and analyzing the variability oftheRTTs and thecongestionwindows(cwnd) ofTCP.ows[12, 11, 10, 14].

noneofthesestudies aims to detect incipient congestion on the passing .ows based on the observed behaviors.


Each multicast session has one source and 3 receivers and no common node belongs to two sessions.

interference occurs at intermediate forwarding nodes in the .eld.


Further,mixing timer events with message-driven logic could make the programming task complicated and errorprone.

the slave controller is currently implemented with a simple message-driven loop.


Indeed, one might argue that some of these strategies do not constitute dishonest behavior .

it is important to consider these strategies in our study, since we shall .nd that they can sometimes be used to attract as much tra.c as the traditional dishonest strategies (e.g., announcing nonexistent paths).


The variable rectangle follows the triangle partition for migration rate.

despite of being high in migration rate, it shows that pre-migration rate is quite low compared to the others (10% lower compared to the hexagon).


The overall reductions in error are modest.

we note that not all links are equally important for overall coverage predictions.


Recentwork hasarguedthat pre-processing signals at the senders in a manner that aligns interference at the receiversincreases the total capacity of wireless networks[3, 6, 9, 21].

to the best of our knowledge, this paperis the .rst to present a system design and an implementation of interference alignment, showing that such idea works in practice.


High values of t increase accuracy in prediction but lower coverage.

low values of t result in inaccurate prediction.


Table1 reports theprobability to loose the information detected by our simulationsfordi.erent settings of ß and a (n = 100, while theresultsareaveraged over1,000trials).Once .xed ß, withoutthe knowledge ofLemma3.2, one couldhaven choose the minimum a greater than ß: For example, the values reportedin the columnsindicatedwith a1 or a2 couldhavebeen chosen.

this would havenotbeenagood choice.Indeed,choosing valuesfrom a1 implies to loose the information with probability 1, in contradiction with the prediction of the SIS model.


Thebasicideaistohave adedicated virtualAPfor each PSMclientin orderto completely avoid any contentionfromtraf.c due to other PSM clients.

onelimitation with virtualization supportisthat only alimited number of virtualAPs canbe created with onephysicalAP.For example, theAtheros chipset allows uptofour virtualAPs.


3.1 Optimum HA selection in Global HAHA networks As mentioned above, DHAAD is de.ned as one way of .nding the topologically closest HA by the MR.

it only considers the topologically closeness of MR and HA whichis not optimumif weconsider end-to-end communication.


However, the Random graph has a very limited distribution of degrees, and so the spread of link values is similarly limited, resulting in very limited hierarchy.

the Tree has the lowest level of correlation.


Deluge bene.ts from the fact that multiple packets can be acknowledged with one packet.

this technique is ine.cient in broadcasting single messages.


5.3 MAC Layer Timestamping Broadcasting time information using periodic beacons is optimal in terms of the message complexity since the neighbor is not forced to acknowledge the message as in sender-receiver synchronization schemes (e.g., TPSN).

the propagation delay of a message cannot be calculated directly from the embedded timestamps.


An enhanced channel selection strategy for this protocol has been presented in [24] and consists in selecting the best channel based on the power level sensed at the transmitter.

the Receiver-Based Channel Selection (RBCS) mechanism in [25] chooses the best channel on the basis of the SINR at the receiver.


In [4], Gibbons and Matias define and analyze counting samples similar to the ones we propose.

we compute a different metric, need to take into account packet lengths, and have to size memory in a different way.


LTE adopts an improved RRC state machine with a signi.cantly smaller promotion delay.

lTE also has lower round-trip times compared to 3G, which has the corresponding e.ect of having much smaller RTO values.


Our constraints preclude situations in which, unbeknownst to the server, a client has access to an algorithm that signi.cantly improves her odds of cheating.

the assumption that the probability of cheating is bounded is common to many mathematical and cryptographic P2PC projects.


Such express expansion of the fringe has the advantage that it leads to less missed traf.c for the fringe nodes and thus higher accuracy.

it also requires a lot of space, especially when Tsplit is very small and there are a large number of items with value above it (this can happen, for instance, when the maximum depth of the trie is large).


As described in the previous section, client applications work in the J2ME environment, using the JSR-82 APIs to access the Bluetooth channel.

jSR-82 APIs do not provide the required support in order to address a Web Services Container and make an invocation of a Web Service.


Intuitively, it was found that the effective communications range decreased as PCdesired and deployment imprecision increased.

it was also noted that the effective communications range often increased for an MCSS greater than 1, to a point, then decreased.


Several priority-based QoS mechanisms have been proposed as extensions to DCF over the last few years, including an extension to IEEE 802.11 called IEEE 802.11e, to provide service di.erentiation among different tra.c classes.

it has been reported in the literature [1 4] that priority-based mechanisms su.er from degradation of service di.erentiation of high priority tra.c, starvation of low priority tra.c, high throughput variation and a lack of fairness.


For lowdata-rate services, restoration times are on the order of milliseconds.

no restoration is usually availabletodayforfullwavelengthcapabilities.Therearetwo alternativesforprivate-line customers: eitherbuy expensive1+1protection whereif aprimary connectionfails, traf.cis re-routed to a backup, or wait for the carrier to manually restore connectionswhich meanslong outage times(4 to12hourstypically).


By not indexing a web page locally, FindAll incurs a cost, because the web page will have to be downloaded from the Internet.

findAll incurs this cost only if the user searches for the web page.


If we knew the dependence of accuracy on resources, we could solve the resource allocation problem as an optimization problem subject to resource constraints.

it is impossible to characterize the resource-accuracy dependence a priori because it depends on the traf.c, the task type, the measurement algorithms, and the parameters [31].


This corresponds to decreasing TP, whereas SDH grooming does not change TP.

as indicated above, processing in the IP layer may be more energy consuming than the SDH layer.


Thus, when a primary path fails, a new route search is not required.

time-varying channels does not only imply that links may break, it also implies that some links are better than others.


Their study relies on a large dataset collected by a European ISP, and mainly containing HTTP requests sent by 20,000 households during a couple of weeks.

the study does not focus on YouTube cacheability in particular.


On the other hand, MWIS and MCDS both seek to reduce the diameter of the spanning tree; as a result, they have shorter broadcast latency as expected.

the short bottleneck lifetime exhibited by these two methods render them unsuitable for use in an ad hoc network.


As seen from the location map in Figure 3, node locations 13 and 14 are very close in location; in fact, they are both in the same hallway, about 2.4 m apart.

at receiver 43, their temporal link signatures are noticeably di.erent.


Therefore, the vehicles which have the same direction will form a cluster.

this scheme only takes into account the direction; as a result, the cluster will change frequently.


Whenthe value of p> 0.01, the network stillhas small world characteristics.

the average minimumpathlength does notdecrease signi.cantlywiththe addition of more shortcuts.


Hence, actually we have '**'* pi(aC,a C)= pi(aC,a C).


This community has often complained that their only good data sets to test new technologies against are synthetic.

if they can still do their analysis with anonymized data, then they are more likely to obtain large, real data sets.


ß being platform dependent, can be calibrated by the client and fed back to the Central Controller for its appropriate estimation of I N R. Further, note that when SINR is directly measured, there is only one feedback value from the client.

when SINR is estimated from SNR and multiple INRs, then each of the SNR feedback (corresponding to INR) introduces an offset that needs to be compensated.


The authors of[10, 11, 7] demonstrated that directional antenna systems are very e.ectiveinimproving spatial reuseinseveralindoor experimental settings.

other work[9] has observed that spatial reuse can be only slightly improved in an indoor testbed presented.


GrooveNet is a VANET simulator, which provides a variety of useful models for VANET simulations, such as mobility models, trip models, etc.

nS2 presents a lot of well-developed low-layer protocols as well as easy programming interfaces.


We show that the price of stability is 1; hence, optimal (networkwide) performance can be achieved by solely requiring that an initial con.guration is imposed on the players.

it is not clear whether such a (best) Nash equilibrium can be computed in polynomial time.


We also evaluated the performance of ARCMA for different network sizes while maintaining the same node density.

we found that the network size does not affect the performance of AR-CMA for the same node density, and thus, we did not repeat the result here.


After that, for each ac- I l (11) n ( - wf (t0 ),ndrop ) := 2 log2 - 0 ) knowledgment received, the congestion window is increased wf (t - ndrop 1+by one.

and until the .rst retransmission succeeds, the number of outstanding packets is not decreased 2 round-trip times.


(8) and the average noise power at the branch.


Although group creation is a interesting problem, in this paper, wefocusprimarily on role-based orgeographic-based groups where nodes initially know which groups they are in and group membership does not change.

our algorithmsdo supportdynamicgroups where members might notinitially know all othermembers of thegroup and where group membership changes over time.


4.3.1 Macrocell Model (EBS) Hando.s between two EBS are always permitted, and over.ows from a CBS to EBS are always allowed.

if a call connects to a CBS, and the mobile user initiating the call moves out of a picocell, then that call may be handed over to another CBS if the new location is within the hotspot region, or treated as a privileged over.ow call to the EBS otherwise.


Another potential issue is that, due to asymmetric IP routing, we may see only one direction of the traffic between a given pair of hosts.

this is not a limitation for our measurements which aims to understand the P2P traffic pattern and its impact at single ISP, and therefore is concerned only with the traffic that is visible to that ISP.


In the modi.ed algorithm, bits are .rst modulated into complex numbers and then broken down into symbols just like standard OFDM.

instead of feeding these into a one dimensional IFFT, each symbol is .rst arranged into a two dimensional Hermitian matrix.


Finally, if the size of Wi-1 is between CWThreshold and CWmax, the size of Wi will be set to Wi-1 minus CWmin (linearly).

when a collision happens for the packet transmission, the contention window size will be increased to a large size.


Some use a second source of information to prevent additional nodes from retransmitting(asinthe counterbased andpowerbased algorithms)or to ensure a minimal number of retransmissions (as in GOSSIP3(p,k,m)).

byusing randomness as a key criteria, these algorithms run the risk of privileging nodesproviding a negligible contribution atthe expense of other,betterlocated, ones.


One could use directly the .ts to these curves to model the relative AP popularity data in clusters of di.erent sizes.

for the intra-cluster case, a better (and more generalizable) approach is to describe the variation of the clusterlevel .ts with the cluster size.


The core functionality of SCORE, o.oading content, requires only a basic DVR with user-local storage and a TV tuner.

in order to seamlessly switch to IP streaming when the content is not available on local storage, an internet-connected DVR is required.


The current de-facto standard routingprotocol used for externaldestinations is theBorderGatewayProtocol(BGP)[17].

therearetwo .avors of BGP.One is used to spread information externally(eBGP), and the other the Internal Border Gateway Protocol (iBGP) is responsible for spreading information about external destinations inside the AS.


as the BP does not specify any structure for the EIDs and since we do not want to introduce an unnecessary central point to the system, the uniqueness and authenticity of entries can not be guaranteed.


4.4 Dynamic IP Block Identi.cation After UDmap computes the IP usage-entropies, one might conclude that those IPs with usage-entropies close to 1are dynamic IP addresses.

we emphasize that dynamic IP addresses manifest as blocks.


An encap switch failure results in multiple such ECMP pruning operations at the neighboring switches for convergence, thus taking a few milliseconds longer.

the failure of a transit router that is a neighbor to an encap router requires a much longer convergence time (3.3 seconds).


In the first two cases, the percentage of misconfigured traffic is high enough that all measurements correctly trigger an alarm.

the detection algorithm appears to be quite sensitive to traffic anomalies, as the remaining portion of Table 1 shows.


VanetMobiSim, SUMO, CityMob, STRAW and C4R all have good software features and tra.c model support.

only VanetMobiSim provides excellent trace .le support.


Many of these costs are due to the congestion created at lower bit rates.

rAP is designed to be used only when necessary (Section 4.8), so these higher costs are only incurred when the underlying protocol is otherwise unable to discover a working route.


In [2], the authors showed that SSCH can perform well as long as the clock skew is very small relative to the timeslot length.

if the clock skew is non-trivially large, synchronous CH schemes cannot guarantee rendezvous between any pair of sequences.


Therefore, SDPP s degree of efficiency depends in part on the accuracy with which the host mobility model describes the movements of real people.

we note that mobility models that do not adhere to the Markovian property may still yield sub-optimal results when solving the SMDP [13].


However, though we ar range to equalize the diameters and bisection bandwidths for all the structure, FiConn still gives the worst performance on these two aspects.


When the network s graph is highly connected, the two measures yield the same results.

when the graph starts to be disconnected, e.g.


From the .rst half of the proof, Ti n Tj = 0/.

this contradicts the assumption ab that the intersection is empty for only one pair of ports.


Thus, in one interpretation can be regarded as a function from a thread to an agent.

in other cases X is used to denote a particular agent, and X is then interpreted as any thread executed by the agent X , as in the honesty rule HON [14, page 329], and the VER axiom [14, pp.


Such MCP and RSP problems are not strong NP-complete, in that there are pseudopolynomial running time algorithms to solve them exactly, and the computational complexity depends on the values of link weight in addition to the network size [5].

their complexity is prohibitively high when the values of link weight become large.


Going through all pre.x entries and generate the shared next-hop table require O(e), where e is the number of pre.xes in the common pre.x set.

redundant shared next-hop entries need to be removed to reduce the memory usage.


These approaches have proven to ef.ciently support contentbased routing between a large number of distributed application components.

implemented on the application layer, their performance is still far behind the performance of communication protocols implemented on the network layer w.r.t.


GKE can also use GPSR and GHT to .nd the route either from a sensor Sito the agent Sx,or between the agents Sxand Sy.

gu Gv Figure 6: Inter-Group Key Establishment there is a major difference between PIKE and GKE in this respect.


The main objective of TVDBs is to provide primary protection and they are not mandated to provide any additional information to secondaries on impact of primaries on their channel use.

dREAM capability can easily track channel quality impact of primaries.


The contracts in their line of work refer to the correct type check of parameters in a function call, and blame is cast on either the caller or the callee.

the blame assignment problem we try to solve is for component-based systems.


Modeling this dynamics as one game would make it unmanageably complex.

if we take a snapshot of the picture in Figure.


Moreover, the small signature size and small veri.cation overhead of BiBa works well for the bandwidth limited RDS network and allows the end devices (PCTs) to be simple and cheap.

biBa su.ers from large public keys and high signature generation overhead.


To generate a smaller number of clusters, LCA was improved by LCA2 algorithm.

generating a minimum number of clusters might not ensure a minimum energy usage.


Our system is more like an emulation for B2D, as we did not yet have 3G service on the phones, and hence initialized each device with coded chunks periodically.

the D2D part was achieved accurately through WiFi broadcast.


Without coding, 8 transmissions are necessary for each .ow to send one packet to its destination.

assuming perfect overhearing (n4 and n5 can overhear n1 and n3, and vice versa), n2 can XOR 4 packets in each transmission, thus reducing the number of transmissions from 8 to 5, producing a coding gain of 85 = 1.6.


If it proves a good forwarding, a counter which records the number of good forwarding behavior of a forwarder will be increased by one.

when a bad forwarding is proved, or the timer expires before the arrival of the PFM, another counter will be increased by one.


Most existing research on service composition in pervasive computing relies on the existence of one or more entities that maintain the global service information.

such an approach is not always practical due to dynamicity of the environment.


cPRM-based systems are dependent on the number of parameters.


Therefore, it is very easy for any intermediate node (and any outsider) to verify this con.rmation by checking Hm r = (rrM/bl-m).

it is infeasible for any intermediate node to forge the con.rmation of any block that has not been successfully transmitted to the destination.


If user A does not encounter user B we can remove the overlapping location PA PB = {6} from both PA and PB .

this intuitive approach to utilize non-encounter information is incorrect.


When the tra.cmanagementprotocolis optimizedto maximizethroughput, 1000 Mbps can be carried.

only 100 Mbps willbecarried whenthetra.c-managementprotocol is optimized to minimize delay.


WAVELET DENOISING To provide e.cient solutions to network problems, various types of signal processing techniques have been employed for modeling [14] and analysis [1, 4, 10] of Internet tra.c.

they are mainly used to infer static or long-term network information from a large set of data collected over a long time span.


The throughput of PF reduces signi.cantly as the number of scheduled users per frame increases.

all PF curves converge, for high number of users, to a value well below the throughput of CL(WRR).


Both offer reliable transport services, motivated by balancing bulk data transfer and increasing robustness.

in the single path case, TCP can only serve real-time communication within tight constraints of network characteristics [9].


In such applications, several participants may notice an event simultaneously (or within a short duration of time).

some or all of these participants may only have partial information about the event.


The emulation of network layer and transport layer of a mobile wireless network can be done by abstracting the target network to a model with a set of network parameters, which is sufficient for end-to-end protocol evaluation, as described in the previous section.

the emulation of multi-hop ad hoc routing in network layer needs more than those parameters.


In this paper, we present LOCATOR: an RF-based system for locating and tracking users in an 802.11 wireless LAN framework.

the core idea of LOCATOR is generic enough to be used for other wireless network technologies also.


Code Division Multiple Access (CDMA) cellular phone networks have long used macrodiversity to improve performance and to provide seamless hando.

between base stations [28].Both [21] and [33] applied the idea to use macrodiversity and frame combining on frames received from adjacent access points to improve uplink WLAN performance in the same way as MRD.[21] presents simulated results based on a capture model and ignores protocol level issues such as ARQ.The contributions of [33] lie in the theoretical performance evaluation in the context of a WLAN based on Bluetooth [11] radios.In contrast, our contributions lie in the design of a macrodiversity system that works well in CSMA-based WLANs and in conducting a performance study of a fully implemented receiver macrodiversity system on a real testbed.


Therefore, it is critical to control the number of connections monitored by each MSODA node.

the number of MSODA overlay connections in the mesh largely determines the success of service mapping.


More nodes are available within longer transmission range as candidates for relaying and thus routing protocols may exploit this to achieve load balancing, which in turn results in better delay performance and energy savings.

long range relaying might require higher transmission power levels for successful reception, and increase interference, possibly compromising network capacity, since more nodes are a.ected by the associated higher power levels this is particularly the case in dense networks.


Thus, at low network throughputs when the PPE CPU is not well-utilized, the network processing e.ciency of the ETA+AIO system is considerably worse than the baseline con.gurations.

at high network loads the PPE CPU is e.ectively utilized enabling ETA+AIO to have We compared a 2.6 kernel s networking to the 2.4.18 kernel and saw only a small performance increase.


This crowd e.ect causes severe chan nel contention, thus resulting in performance degradation as shown in the Figure 3.

the .rst download completion the average download delay of CodeTorrent decreases as mobility increases.


In view of the characteristics of diffusion events, time sensitivity and geographical scalability are major evaluation metrics of the performance.

energy efficiency is also an important criterion for the fume-diffusion-spotting sensor network.


The .rstnodeofaredundancygroupjoinsthe Chord space as a classic Chord node (see Section 4 andSection5).

thejoin requestsfrom subsequent redundancygroupmembers trigger a demand for predecessor(resp.


Again, the causal connections are the intuitive ones: tuples never existed because they never appeared, they never appeared because they were never inserted, derived, or received, etc.

note that, unlike their positive counterparts, all negative vertices are annotated with time intervals: unlike positive provenance, which can refer to speci.c events at speci.c times, negative provenance must explain the absence of events in certain intervals.


The questions below are not exhaustive nor requirements, in fact we will see that tradeo.s exist.

they provide us with guidance and metrics.


Because the distance between an AP and its clients varies, the signals from di.erent clients reach the AP at slightly di.erent times.

the AP is still able to .nd a suitable FFT window using a large enough CP duration.


Thus, we get hmin = k. Denote the input rate at each source by ., then the number of bits arriving at these n nodes in an interval [0,T ] is .T n. Thus, the total number of transmissions of all bits to their destinations is at least .T nhmin.

the total number of possible transmissions at any timeslot is upper bounded by that of the cells containing at least two users, which is no more than c. Hence, .T nk = Tc (8) i.e., .


Accordingtothespeci.cations,theagent has to return an error message if the output port will never be valid.

if the port may become valid in the future, the message might either be rejected with an error, or the agent may drop packets intended for this port while it is not valid.


Thus, monitoring applications that require transport-layer streams should implement stream reassembly, or use a separate user-level library, resulting in reduced performance and increased application complexity.

scap operates at the transport layer and directly assembles incoming packets to streams in the kernel, offering the opportunity for a wide variety of performance optimizations and many features.


It is possible to use the existing routing protocols to handle failures in the up-path, by leveraging ECMP and anycast techniques as shown in VL2 [12].

the down-path failure is much harder to handle, since there is only one down-path after the packet arrives at the bouncing switch.


A node is allowed to move along the direction of the street or avenue.

when a node reaches an intersection it can turn or continue moving in the same direction.


To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee.

10/06/...$10.00" few actual network protocols that exploit network coding have been proposed in the literature, nor have they been thoroughly evaluated for the network coding promises through extensive simulations.


Along with other features like slow start, fast recovery, and fast retransmission, TCP achieves congestion control successfully in the current low speed networks.

the current TCP can perform poorly in networks with high bandwidth-delay product (BDP) paths, since the AIMD algorithm, being very conservative, is not designed for large window size .ows.


OAR reduces the overhead to 49.37% per packet in later case.

there is still room for improvement, which motivates us to propose the concatenation of multiple packets in physical transmission.


We are not aware of any work directly performed on combining the data of several middleboxes DPI to a single service.

a similar concept was studied in the context of virtual IP-lookup, where trie-based data structures are considered [21, 31, 49].


The relative priority ordering among the heavy tasks is arbitrary for instance, heavy tasks could all be assigned the highest priority, with ties broken arbitrarily.

light tasks are relatively ordered according to EDF.


Since Asterisk does not need a dedicated PC, it could be installed on the same machine on which OpenBTS is running.

in order to isolate di.erent parts of the system, we install Asterisk servers as separate entities.


So this solution is close to the optimal solution for high energy constraints.

when the energy constraint is low, we can see that H2 performs poorly compared to both the optimal solution, and H1.


We note that, for unilateral identi.cation, this process only needs to be one-directional, that is Alice transmits to Bob and Bob maintains the veri.cation chain.

for full mutual identi.cation (as opposed to two separate unilateral identi.cations), the exchanges must be both bidirectional and it is necessary that they have the same channel with which to base their veri.cation chains upon.


At higher loads, as the load approaches the saturation point, SOTA outperforms CON-NECT 32, due to its higher clock frequency.

notice that in all cases CONNECT 128, which occupies about the same FPGA resources as SOTA, can easily outperform all other networks by a wide margin across all tra.c patterns and regardless of frequency adjustments; it consistently o.ers three to four times higher saturation throughput and more than three times lower latency.


Different components (edges) leaving the same node shouldbe encodeddifferentlyto distinguish themselves.Astraightforward method is to assign unique codes to all the components in NPT, ranging from 1 to .., .. is the number the edges in the NPT.

in our solution these unique codes will not help accelerate the PIT access speed.


For file transfer applications, the layer granularity leads to a higher transfer time (dependent on the layer distribution) than rate/window based solutions in case of small homogeneous groups.

a sender rate/window based multicast congestion control protocol must adapt to the slowest receiver.


If we call finalA and final B the labels attached toA's and B's final action, respectively, then the property might be expressed by finaiA({X}g) t-" finale({x},g), for x a variable.

in practice, all forms of authentication in Lowe's hierarchy [15] are captured by the scheme ct ¢--- [3. except the most demanding one that requires one-to-one bijection between ct's and 13"s. our scheme can be easily adjusted to include this stronger form, The scheme also permits expressing secrecy, in the style of [2].


In summary, it appears that RapidShare uses simple load balancing rules, allocating more upload requests to more recently deployed servers, and assigning more download requests to servers that do not also act as the indexing server of the group.

it seems that RapidShare does not try to control which ISP will be used for each download request (if they were doing so, the distribution in Figure 13 among the 10 download servers would not be uniform).


To minimize this overhead, sensor systems typically operate in a duty-cycled mode where the MCU is turned on for a minimal amount of time needed to handle the data, before switching back into sleep mode to conserve energy.

this optimization is no longer e.ective when this subsystem handles high-rate sensors.


Recent studies show that proactive routing protocols as OLSR generally outperform the reactive ones in terms of network goodput and end-to-end delay [9, 26].

the proactivity achieved by the continuous exchange of routing control packets causes network congestion problems, limiting the scalability and the global performance.


To determine the behavior of n-hop chains, we make the following observations based on our results: The throughput of a chain is independent of the type and number of self-interfering interactions.

the performance of a chain in terms of number of dropped packets, depends upon the types of interfering interactions between links of the chain as well as the location of these interactions.


However, in this case a censor with packet-recording capability can detect the injected packets by comparing the contents of packets with the same sequence number.

uDP is a connectionless protocol and easier to hijack.


For example, the estimation error, shown in previous sections, can be reduced by about 30~50% when we use an ANR value of 5 instead of 10.

this will increase the anchor percentage (AP) from 2% to 8%, requiring that more anchors be deployed.


This is quite clear since in these cases transmission is either always suspended (low SNR regime) or always the highest available modulation scheme is used (high SNR regime).

as the gain from imposing an average instead of an instantaneous BER constraint is generally relatively small, it is questionable whether the additional complexity involved with this approach is worthwhile in practice.


As can be seen, with SafeGuard the path stretch smoothly reduces to 1 during convergence, indicating that the forwarding paths gradually shift to the new shortest paths as routers update their states independently.

under vanilla IP forwarding, one can observe path stretch surges during routing convergence because of micro-loops: some packets reach their destinations after a micro-loop is resolved but have looped for dozens of times.


Amessagecomingfromagivenapplication can be sent to many other applications, remotely orlocally.

bydefaultanapplicationA will only receivemessagesaddressedtoitand sentby alocal application B (application on the same vehicle).


At low overload-s there axe not enough high bandwidth requesting calls on the average to make a difference.

at high overloads the non-degradation system has such a rich call mix to select from that it can select the calls providing ~ 9O i i i 85 ~ 75 ~ 7O ~ 65 .=.


Though our greedy routing is improved, sometimes, reaching a concave node cannot be avoided.

an immediate e.ect of the repositioning is that every peninsula in the shape of the network is elevated, and a smooth edge is surrounding the routing void.


If the UE is strongly a.ected by velocity, a low percentage of MCS associated to 64QAM is expected.

figure 5 shows a majority of transmissions with 64QAM.


This improvement is brought by the femtocells that can reuse the frequency resources of the macrocell.

while this frequency reuse does not result in signi.cant throughput loss for low femtocell density, it leads to lower throughput converging to that of the macrocell-throughput under denser femtocell deployments.


(44) yi(t) yj(t))0 ) by subtracting the right-and left-hand sides of the i-th and the j-thODEin(22), wehavethat d (xi(t)-xj(t))= -(xi(t)-xj(t))(s(t)-xi(t)-xj(t)).


They reported an average throughput improvement of 90% for 50 nodes randomly placed in a 1000m x 1000m rectangular area.

the throughput improvement is smaller when the node density increases.


Accommodating Diverse Networks and Devices The original ARPANET was designed to inter-connect heterogeneous networks and hosts.

by today s standards, they were in fact fairly homogeneous.


Because of its simplicity, pure .ooding is used in most traditional implementations in ad-hoc networks.

it leads to serious problems such as redundancies and collisions; hence, it is not recommended for future works [12, 14].


More importantly, when measurements are taken over a period of time, they may include links which are not alive for the entire measurement period.

it is commonly assumed that the number of false positives introduced in this way is small.


The use of servers or caches owned by the content distribution system is ruled out due by the need to decentralize control in peer-to-peer systems (either in an attempt to evade responsibility for redistribution of copyrighted material or because of a desire to build scalable ad-hoc communities without central administration).

if storage can be shared within a community in a scalable, ad-hoc manner, and without assigning responsibility for the stored data to the operator of the resource, then peer-to-peer architectures can use such storage to optimize their performance and efficiency without compromising their goals.


In these protocols, collision-free transmission schedules are generated by disseminating probe messages within at most two hops, and as a result, nodes are able to recognize potential competitors for a simultaneous transmission, and act accordingly.

it is worth noting that, the correctness of the above protocols is based on the assumption that the network topology remains static during the time when the transmission schedules are generated and used.


In order to decode the data transmission, the receiver .rst detects the .ashes, and then instead of reading the erroneous bits from the symbols that were .ashed, the receiver erases them.

instead of causing bit errors due to concurrent control messaging, Flashback exploits the fact that .ashes are easily detectable to convert them to bit erasures.


A similar approach can be applied to the proof for general graph.


they imply that the new architecture may not assume even for the Internet edges that most ISPs will support admission control, tra.c shaping, metering, billing, or any other mechanism added by the architecture.


While the methods we employ are somehow inspired by the large amount of expertise that has been gathered in terrestrial radio networks, there is still a lot of ground to cover to devise methods to implement ef.cient broadcasting, given the peculiar underwater channel features.

we devise a way to leverage the bandwidth distance relationship in order to reduce the number of transmissions required to complete the broadcast, with the further goal of minimizing both the overall energy consumed and the total time it takes to complete the broadcast.


Weexamineseveral dimensionsofdevice contactsin orderto better understand the observed dichotomy, and we study the  time nonstationarity due to human synchrony with the time of day.

we provide evidence that there exist real-world cases in which return time of a mobile device to its frequently visited site follows the same dichotomy as that of the inter-contact time between devices.


3.2.3.2 Resource duty cycling It is important to note that transient resources belong to devices that are inherently non-WSN nodes.

a luminosity sensor or a transceiver on a passing smart-phone, are already engaged in the applications of the home device and might not be available for utilization by the arbitrator at all times.


As an aside, nodes under our control only implement leaf functionality, and cannot be used as a hub.

none of our nodes is a FastTrack supernode, a Gnutella ultrapeer, or an eDonkey server.


REALIZING CLOSEDFLOW The key question is whether we can provide an OpenFlow interface (from the SDN controller s perspective) to control a network of legacy switches.

we are not just proposing a centralized interface to legacy switches, with vendor speci.c con.gurations.


In that case, the corresponding dedicated byte counter is updated.

as in S&H and MF , packets of .ows already captured bypass the chal lenge or .lter.


INTRODUCTION This paper is concerned with network architecture, the fundamental tenets that underpin the actual design of the network.

we are interested in the architecture of 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.


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

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


The diagram shows that PSR losses a.ect the group of weak secondary links underproportionally.

only 5 % of all weak secondary links cause an absolute PSR loss of more than 0.1.


If a user has not acted to capture this information, and it appears that his machine is infested with malware, regulation could permit (or require) that his serving ISP log his traffic.

regulation could define that the penalty for failure to self-protect is loss of privacy, which is a punishment that might fit the crime, as opposed to more draconian alternatives such a total disconnection or quarantine.


It follows from the de.nition of the entropy that H(D1, D2) = 2H(D), but for the uncorrelated network H(D1, D2) = - pe(k, l) log pe(k, l) kl = - pe(k)pe(l) log pe(k) - pe(k)pe(l) log pe(l) kl kl = - pe(k) log pe(k) - pe(l) log pe(l) = 2H(D).

kl the Markov property maximizes the mutual information of joint degree distribution pe(k, l).


The latter is clearly a better choice if one seeks to optimize the throughput of the entire path from Ato E. The .rst contribution of this paper is a new rate-selection algorithm called modrate that seeks to jointly optimize individual link bitrate selections with network-wide overhearing opportunities.

as opposed to selecting bitrates in a link-local fashion based only upon a packet s next hop, modrate selects the bitrate that minimizes a packet s expected number of transmissions along a path to its eventual destination assuming that any overhearing can be pro.tably exploited.


While the 802.11 class and the PIM class are the two classes of multihop wireless networks focused on in this paper, most of ourresultsaregivenforanarbitrary network class.

we have developed a uni.ed framework for both the design and the analysis of polynomial approximation algorithms.


The .rst key component of the algorithm is the notion of checkpoints which are de.ned in relation to each pair of nodes that are connected by a Bluetooth link and which represent predictable points in time when packet transmission can be initiated on the particular link.

checkpoints serve as regular meeting points for neighboring nodes when they can exchange packets.


Thus, the objective value will not change for a EiE(0,Efi], and consequently, the rate for node ican be increased beyond the current )1value.

node idoes not belong to the minimum node set S1.


We .rst show that Safe-Distance is correct, i. e., for an accepted request i the SINR constraint of i never becomes violated.

we will underestimate the distances of accepted senders of other requests to overestimate the interference at receiver ri.


trees or meshes) which are based on pre.x continuity.

when there are multiple subnetworks in an ad hoc network, each multicast delivery structure is formed by nodes which all share an identical pre.x.


4.1 The Case of A Rectangular Area As discussed in Section 2.2.2, indoor layouts are often axis-aligned from a geometric point of view.

the most elementary unit is a rectangle area whose sides are aligned with the axes of the coordination system.


6.7 Secrecy Capacity Based Formulation Although we have adopted a packet loss/interception approachinthispaper,the resultsareeasily extended toguarantee a given secrecy rate for all links that are active in a given time slot.

conditioned on the fading gains, the e.ective transmitter-receiver-eavesdropper channel for each link is a Gaussian wiretap channel.


When a corresponding node wants to communicate with the SIP client, the session is established through the mobile gateway to the SIP client.

the mobile gateway plays the role of a translator between the corresponding node and the SIP client.


INTRODUCTION In the immediate aftermath of 9/11 events in New York City, the Internet was used to facilitate communication between family members and friends, as the phone network was overwhelmed1.It does not require a great leap of faith to imagine using the Internet as a communication medium for crisis and emergency response teams.

the network could be used to carry communications between widely dispersed static sites (e.g., various federal, state, and city agencies) and (semi-) roaming stations and users.


In this paper, we .rst infer and characterize import routing policies.

we infer the route preference setting among routes learned from providers, customers and peers.


Conversely, if v> Vcut, the argument of F(x) is negative and increasing in absolute value with d, meaning that 1 -F(x) will increase in d.When v = Vcut, the argument in F(x)is 0, and the detection probability slightly varies around 0.5.

s3 ideal algorithm as d approaches Vcut = 1 .Lemma 1.


[1,D], then the attacker can trivially determine j with the following algorithm: x = aq without loss of generality; and j =1 if Esj (x)= Es1 (x),otherwise j =2.

if x matches one of the certi.cates it has for V1 and V2, then all the attacker needs to do is match Esj (x) to either Es1 (x) or Es2 (x).


It has become an increasingly challenging task to design and implement a correspondingly scalable network infrastructure.

demands for high bandwidth, 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.


For simplicity and as a way to compare di.erent P2P caching schemes, we focus on a case where contacts between clients and server nodes follow independent and memory less processes.

we neglect the time dependence and correlation between meeting times of di.erent pairs which may arise due to complex properties of mobility.


Then we discuss their signi.cance on the operator network.

we discuss how our results may impact them.


The table is organized based on the destinations.

the statistics for each destination is computed based on an aggregation of the path measurement from the eight sources to the destination.


3.1.2 High-Fidelity Measurement The key insight and capability of how minProbe achieves high-.delity is from its direct access to the /I/ characters in the physical layer.

minProbe can measure (count) and generate (insert or remove) an exact number of /I/ characters between each subsequent probe packet to measure the relative time elapsed between packets or generate a desired interpacket gap.


number of role changes per node is less than 2 for all three speci.cations.

all communication effort is invested into property propagation, and almost no undesired repair iterations occur.


These results are based on a version of the forecaster we have implemented that automatically computes the empirical CDF for each forecast incrementally, based on all previous measurement data.

the forecaster learns 0.16 Univariate Forecaster MAE Percentage 0.15 0.14 0.13 0.12 0.11 0.1 0.09 0.08 0.07 0.06 0.05 HTTP measurements every X minutes Figure 6.


Since then, a number of solutions have been proposed to achieve the upper bounds in various settings.

[6] showed that by an e.cient backboneperipheral routing scheme (analogously called highway sys 1v n tem ) and a two-stage TDMA scheme, O( )is achievable feasible states, and consequently the capacity of CSMA net  works.


In general, this is an NP-complete problem, and we handle it in a conservative way by avoiding self overlaps.

every time we expand from a partial solution state, we check whether the new edges (for all nets) overlap with any segment in the partial solution.


The first one is dubbed here a totalitarian situation where fairness is measured at the master scheduler when calculat- ing the schedules.

in a totalitarian situation, the scheduler allocates bandwidth to terminals according to a predefined fair share, and should the terminals be unable to use their bandwidth due to errors, they are stopped from wasting the bandwidth.


However, they lead to intolerable inaccuracies in network measurement [1].

sampling will typically miss the majority of small .ows (containing only a few packets).


As n increases, the distribution becomes thinner and more bell-shaped.

the variance of the distribution reduces as n increases.


It is notable that most existing works have been originally transferred from MANETs that do not have gateways [5].

these works treat all the WMN nodes equally, including gateways, and do not consider the different roles played by the gateway during the communication phase.


In contrast, our work is focused on understanding the di.erence on video delivery between mobile devices and PCs.

we show how mobile devices control the video download rate while in the case of PC-player, the download rate is controlled by the server[2].


7.2 Individual Attacker/Victim Activity One of the unique aspects of our datasets from these two sites is that they offer us a level of detail that is not present in some of our higher level global datasets.

we are able to examine .ow and packet level details that offer additional insight about the activity of individual attackers and victims as well as validate our global datasets.


Inotherwords,people with the same general application a.liations show highly skewed and biased group behavior towards a single application at the considered hotspots.

social networking is the dominant application among those at noon hotspots; musicamong thoseat nighthotspots; e-mail among thoseat o.cehotspots; anddating among thoseat eveninghotspots.


CONCLUSION In this paper, we have introduced a signaling game approach for power control in wireless networks in which the signal sent by player I to player II may be accurate or misleading.

we have showed that, at the equilibrium, player I always performs better than player II except in situations where player II does not believe in the received signal either the received signal is accurate or misleading.


These approaches are not directly applicable to DTNs as they assume .xed topologies and may incur heavy signaling.

in [8], Eryilmaz and Lun introduced a routingscheduling-coding strategy using back-pressure techniques.


In this case, upon completion of the key exchange, the simulator may determine the key a party obtains.

an uncorrupted Fke guarantees that the key a party receives upon a key exchange request is a freshly generated key that is only known to the parties involved in the key exchange.


At the same time, BLINC s performance dramatically degrades as the sampling rate increases, for the reasons explained above.

at sampling rate 40, the classi.cation rate drops below 5%, and for the rate of 100, it becomes close to zero.


The process of generation is based on the selection of the desired numberof hostsandonthe constructionofa connectivity graph of all the potential contacts of each host.

wemap each hosttoanodeofthe graphandwe linka pairofnodeswithanedgeifthetwohostshavea potentialof becoming in contact.


Whenever a malicious node gets a data packet, depending on the simulation setup, it either forwards the packet correctly according to the protocol rules or it drops the packet.

falsifying the position is the method to intercept packets which then may be examined and forwarded for eavesdropping reasons or even be dropped to disconnect routes.


Initially, we can use the well known ccTLD ( country code -Top Level Domain used in the Internet domain name system) for each country.

uS is assigned to the USA, and UK is assigned to Britain, etc.


li - Bi Once FPS arrives at the ideal allocation, it will remain at the ideal allocation in the absence of any demand changes.


Maximizing lifetime of the network does not necessarily translate to minimizing the average energy consumption in the network, but rather minimizing the energy consumption of the node with the maximal load in the network.

the monitoring should not signi.cantly increase the load towards the sink.


Taking average over the M training data, then as long as M is sufficiently large, we have (11) where the MAI plus noise term vanishes due to zero-mean characteristics.


The basic idea of the algorithm is to distribute information on clock values as fast as possible, while minimizing the number of messages required to do so.

we want nodes to send messages only once in B time, while avoiding that it takes in expectation B·D time until distant nodes affect 2 each other.


This is because of the choice of the control parameters in both mechanisms.

with a different set of the control parameters for FAST TCP and the proposed mechanism, the opposite results may be obtained.


All communication between RF nodes occurs through the signal propagation environment modeled within the emulator.

we achieve via digital signal processing the same physical effects that occur in the real world: attenuation, multipath, interference, etc.


5.1 Security analysis To authenticate a message, the sender needs to disclose p authentication elements.

we assume that in a time interval the sender sends up to r authenticated messages.


EVALUATION The true measure of the HFT runtime s success is its ability to successfully control traf.c in an actual network.

its control should re.ect the integration of the NIB to provide virtual circuits with guaranteed minimum bandwidth, and optimize the placement of access control logic within the network.


With this semi-Markov model, we will be able to capture and analyze both the steadystate and transient behaviors of user mobility.

from the steady-state analysis of the mobility model, we can identify the long-term mobility characteristics, such as the steady-state user distribution over APs.


Our solution relies on the analysis of the history of the movement pattern of the nodes and their colocation with the sinks and on the evaluation of the current available resources of the sensors.

each node evaluates its change rate of connectivity, colocation with sinks, and battery level.


If we use TP and TK to i=1,i train a classi.er Ck, the decision boundary of Ck will be biased towards the negative class in the feature space.

some negative samples from {.1, ..., .U } will be inaccurately classi.ed to the positive class.


If Du has level j, then both Du and Dv is in R. Obviously, not both of Du and Dv can belong to some independent set J.

either Du or Dv or both is selected to Q.


But, AS v can agree to export routes learned from u to w (and routes learned from w to u).

mutes r with first(r.as_path) = u would be exported to w, and routes with first(r.as_path) = w would be exported to u.


3.3 The closed loop control scheme Our goal is to design a bandwidth allocation algorithm to bound service delay of real-time .ows.

our formal objective is to design a control law that would drive the queuing delay ti, experienced by each frame going through the ith queue, to a desired target value tiT ; this value represents the QoS level requested by the DEV associated to the queue.


We derive loss bursts and correlate them with unreachable responses from traceroutes and pings.

we correlate loss bursts with ICMP messages using the time window [-1 sec, 1 sec] since hosts in PlanetLab are time synchronized via NTP.


Localization is a fundamental problem in a sensor network and the focus of this paper.

we ask how to best implement existing localization algorithms in a real world assistive environment by maintaining accuracy, efficiency and reliability.


Updates of the MASERATI database can be performed either by the MASERATI service providers through wardriving or by MASERATI users through crowd-sourcing.

users can contribute to the improvement of the database by reporting their throughput and environmental/contextual information to MASERATI when they download a video.


Moreover, a hidden assumption throughout this work has been that node identities are tamper proof.


Second, errors can be mitigated by collaborative estimation.

each HartFi device considers all its neighboring master HartFi devices, rather than three of them, to localize itself.


We also describe how to design and implement the security architecture for smart spaces.

we show how the information broker element can measure the security level of connections and then use these measurements to control information access.


This leads the best effort stations to increase theirs AIFS and PFactor.

under high network load, AMPA increases the differentiation between the high priority class and best effort, in order to protect the high priority flow.


), and moreprecisely strictisotonicity  These properties are easy to establish, and indeed are already establishedby combining resultsfrom[18,14,19].

they are suf.cient conditionsfor some resultsin[18], related to the notion of lightestpath.Severalnotionsof lightestpatharede.ned(S-lightest pathand L-lightest path)in[18],butdueto strictisotonicityofthe ML-OLSRalgebra,they are equivalent, and arede.ned asfollow: Alightest path P between two nodes u and v, is apathbetweenu, v,withtheminimumcost w(P) withrespecttoorder  ifP is alightestpathbetween u, and v, any otherpath Qbetweenthe same nodes veri.esw(P) .w(Q)   One major result of[18] isthat whentheproperties of monotonicityand strictisotonicity areveri.ed, onelightestpathisfound by a thegeneralization ofDijkstra s algorithm(Fig.


However, the interplay is bidirectional.

traf.c characteristics a.ect caching performance, while caching and merging also have .ltering e.ects on the tra.c characteristics.


The goal of a synchronization protocol is to keep a dataset (or a collection ) up-to-date among distributed participants.

a synchronization protocol must replicate a dataset s content among participating hosts.


Q () bits within a time slot will then be used to form the frame S s 2 .

2 the operation S =S .S in straightforward 21 3 network coding can now be realized through PNC mapping.


3.3.1 Implications Many protocols have properties in a typed model, that do not hold for an untyped model.

some protocols are correct in a typed model, but are vulnerable to so-called type .aw attacks in an untyped model.


The solution of our stabilityconstrained energy minimization problem is the optimal transmission power allocations, which is easy to deploy in wireless nodes.

our optimal transmission power allocations have provided a stable network consuming energy e.ciently.


Inthebest case, ourapproachisfasterthanRE2 andPCRE by one to two orders of magnitude.

we make the following contributions: We propose a new approach to tag capturing groups in a regular expression, and extend Thompson s NFA construction approach to convert a regular expression with capturing groups to a tagged-NFA.


However, the actual amount of this packet drop depends on the tra.c load, bandwidth resources and the transmission conditions, and this amount may become unacceptable if the tra.c load is not regulated.

an e.cient admission control framework is required to ensure that su.cient amount of resources are available to meet the packet drop constraints of the admitted session.


In addition, the addition of these synthetic botnets to the training set had the side effect of actually increasing the overall detection rate.

some of the real botnets that were not detected by Disclosure in our normal experiments were detected after we added the synthetic data.


The generic base layer .rst of all provides basic user management functionality.

the base layer allows clients to connect to and communicate with our proxy server.


Unobservability: Unobservability also protects IOIs from being exposed.

the message transmission is not discernible from random noise.


We modi.ed SSHGuard to use PANE as a .rewall backend to block nefarious traf.c entering the network.

this means such traf.c no longer traverses the targeted host s access link.


Let .. denote the maximum number of nodes within the interference range of a node.

.. is the maximum degree of the .-diskgraph of the networking nodes.


It is worth to notice that Am >l0 and AM >l4.

(a) Received rate r(t), video level l(t), and available bandwidth b(t) (c) Frame rate f(t) Figure 9: QAC adaptive video streaming response to a step change of available bandwidth at t = 50s we are interested in assessing the responsiveness of the adaptation algorithms in matching the available bandwidth choosing the adequate video level l(t).