Spurious RTT teristics of SmoothTCP-q when compared to TCP, we should take into consideration the bursts of packets that follow the retransmitions of discarded packets.

we have to keep the difference Sdrop - t enough to support that burst.


It consists of two major components: the design of measurement experiments, and as traf.c matrix estimation.

we may use Bayesian 0.7 experimental design to identify strategic locations to place addi 0.6 0.5 tional measurement capabilities to enhance the accuracy of traf.c matrix estimation.


Offset errors can be well in excess of RTT s in practice, and more importantly, are susceptible to occasional larger reset adjustments which can in extreme cases be of the order of seconds.

the SW-NTP clock is not reliable enough and lacks robustness.


We show the NP-hardness of all these sub-problems and provide approximation algorithms with guaranteed approximation ratios for them.

we show that, for a WSN with node set V to monitor a set D of targets:  Omni-directional Antenna and Omni-directional Sensor (OAOS) has a (4 + E)-approximation.


These shortcomings areexacerbatedasthelevelof heterogeneity and high-bandwidth requirements of emerging applications increase dramatically.

popular wireless link-layer protocols, such as the retransmission ARQ-based approach (employed by the IEEE 802.11 standard suite) are designed to achieve some levelof reliabilityby dropping corruptedpacketsatthe receiverand by performing one or more retransmission attempts.


However, we have accounted for the overhead caused by control message exchange and channel access time by using an actual data rate for sending packets which is signi.cantly lower than the nominal data rate.

we have used the actual data rates reported in Table 1, which are obtained from the measurements reported in [10].


There are no three consecutive non-regular duty cycles.

if d is non-regular, at least one from d ± 1 is regular.


Several similar cases for each user type are listed in Table 5, where we .nd that the conditional probability .j,Ht (obtained based on mobility pro.les) is closer to the actual event y(D) than the general probabil- Ht ity P (Ht) (obtained from the common statistical approach).

as seen in the cases for the users from groups G2,G3,G4 and G6 our predictions would be completely accurate, whereas those from the statistical method are far from correct.


Q is true, where Q is the set of all postconditions de.ned as Q = {B|B : S .

{T,F}}.q(sa)= T. Intuitively, the post-condition will be a function that is true if and only if the input has a similar effect on host B as it did on host A.


Finally, we show that reliable communication is not symmetric for t > 2.

there is a communication graph and an authen-tication graph for which reliable communication is possible from a to b, but is not possible from b to a.


COOPERATIVE BEAMFORMING In a multiuser MIMO system, .. transmitting antennas and ..+1 receiving antennas can generate up to min(..,..+1) independent channels.

by beamforming, if we expect to eliminate signals to the K users and transmit signals only to the target user, we should have ..=..+1.


This is an astonishing result, because it matches exactly the optimal rate that can be achieved even in randomly deployed networks.

when using block coding in combination with our algorithm, the price of worst-case node placement becomes a constant.


While we do not want to create a two-mode representations whose projection is exactly the original network, we also do not want to lose any information in the form of edges in our one-mode projection.

for any network G and its two-mode network A that is produced using some type of generalization of the clique concept, we want the assurance that E(G) .


However, individual IROBs may be reordered with respect to one another.

an IROB sent after a previously sent IROB may be seen .rst by the application reading data from the receiving multi-socket.


It is not a surprise that emerging services built on live mobile user feedback are rapidly meeting a large success [15, 16, 17].

improving everyone s mobility is probably one of the main services that a smart city shall o.er to its inhabitants and visitors.


Still,in oursetting it remains worth being addressed even when strategies are time-sequences of singletons.

the focus is on simplerulesoftheform: certainpeers i .


implies that x(+, j1) = min{ST, B(+, j1)}.

a .-OLA scheduler allows the output queue differences at the end of a transfer phase to exceed ., only if there is no way to transfer more cells to the outputs with the smaller queues.


The entire data series was subdivided into smaller samples where each data sample s length was bounded by the value W .

each sample contained consecutive W data points.


The goal of this simulation is to assess the e.ectiveness of the application level monitors in detecting infections and rejuvenating the infected hosts under certain reasonable conditions.

we will evaluate the ability of the performance signature and software rejuvenation algorithms to purge a worm infection from the MANET environment without access to (unknown) software patches.


Is it accurate to consider all failures to characterize reliability?

some down events are expected due to routine and scheduled maintenance e.g., code update.


We note that the numerical results are consistent with the intuition.

the packet drop probability reduces as the value of V increases and increases as the length of busy period increases.


The relevant events are the switches between di.erent data routes due to topology changes.


Performance evaluation of subsystems and protocols within the testbed that relies on real implementations.

specific results can be obtained for CRRM strategies in the wireless part in conjunction with the MPLS/DiffServ approach in the core network part.


Next, we will show that hl(p) is a quasi-concave function of pl.

for any .xed p-l, the set Sa := {pl |hl(p) = a} is a convex set.


The location-specific nature of contention, coupled with the multi-hop nature of the network, allows for spatial channel reuse.

any two flows that are not interfering with each other can potentially transmit data packets over the physical channel simultaneously.


For n points placed uniformly at random on the unit square, let M 1 denote the longest edge-length of the nearest neighbor graph on these points.

then 2 -a lim P[nm M 1 - log n : a ] = exp(-e ), a = R. (1) n-o asymptotically nm M 1 2 - log n is Gumbeldistributed.


For scenario (i), the TZ cluster construction performed on (V, E) at the exclusion of the mobile nodes, applies to the mobile network as well.

|A| and |CA(w)| are O(.n log(n)) for all w .


Note, that the open trust model allows the above principle to be implemented quite flexibly.

the layer that initiates a message can delegate the actual implementation of security processing on this message to a lower layer.


When service times are highly variable, however, there may be a substantial impact on the "downstream" centers.

as noted in [6], if the server utilization is at least moderate, a FCFS center with high service time vari- ability generates bursty departures, leading to bursty ar-rivals and increased queueing at downstream centers.


One of the drawbacks of EvalVid is that it only supports single layer video codec like H.264/AVC.

a scalable video codec like H.264/SVC is not supported.


This is a good compromise between service traffic and query routing performance especially for a large-scale ad hoc network.

our scheme scales to large size networks without incurring excessive service advertisement traffic.


The JF periodic dropping attack utilizes the same principles but realizes the attack via periodic dropping at relay nodes.

suppose that congestion losses force a node to drop x% of packets.


As a result, we can explain the reason for this unusual routing behavior with respect to Hurricane Electric: HE is a large ISP, but it has an open peering policy.

any ISP that has a presence in an exchange point in common with HE will be allowed to peer with HE at that exchange point [12].


Since then, researchers have proposed various tra.c shaping techniques to leverage EEE in order to boost power saving.

packet coalescing is a promising mechanism which can be used on top of EEE to tradeo.


The resource-route relation is determined precisely by the matrix R;and the J resources have capacities given by C. Both networks, SN and BN are fed identical arrivals.

whenever a packet arrives to queue i in SN,a packet is added to route i in BN at thesametime.


This work presents our efforts to build ConnectionWatch, a passive measurement tool that reports intolerable delays as perceived by users.

we start by developing a basic tool that monitors TCP connections at end-users; and logs them for further processing and analysis.


For the general sense fairness study, we tested fairness using the same experiments as in Section 5.

random TCP .ows were created on a grid topology and on a random topology of two di.erent sizes.


Measurement Window [sec] (a) Total Throughput vs. Ef.ciency Index (b) Short-Term Fairness Index Figure 6: Symmetric Incomplete Information Topology: Simulation Results provides the highest throughput and satisfactory short-term fairness properties is always less than 1.

for the price of a moderate throughput loss, short-term fairness properties can be substantially improved.


The quantity o(N)can be used to characterize how close X(t) is to an optimizer of F .

it is shown in Section 5.5 that it is of the following order: v  o(N)= u u tO s Na(N) ß(N) !


For comparison, the corresponding results assuming omnidirectional antennas have also been included: as anticipated, the approximation is signi.cantly more accurate in the case of randomized beamforming.

one may observe the remarkable accuracy with k>1.


In the context of software architecture, AntiPatterns can clarify the necessity of problem-solving skills revealed in software engineering reference models, such as, the Software Design Level Model (SDLM) and the Reference Model for Open Distributed Processing (RM-ODP).

this presentation will discuss how traditional software engineering assumptions become serious AntiPatterns, when applied to distributed software architectures.


In addition, the approximate i=1 i=1 solution, which is the linear mapping point of r *, is also located at the boundary of .. Now, we are interested in how far our approximate solution is from the optimal solution.

we want to know the difference between our approximate objective value and the optimal objective value.


INTRODUCTION Partial dynamic recon.guration is one of the key features that make FPGAs unique devices, o.ering degrees of freedom not available in other akin technologies.

two important bene.ts can be achieved by exploiting partial dynamic recon.guration on recon.gurable hardware: the recon.gurable area can be exploited more e.ciently with respect to a static design and some portion of the application can change over time and react to changes in its environ- 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.


With a credit management and a compensation mechanism, our algorithms provide rate guarantee and fair access to the channel.

we propose to allow a user to simultaneously use multiple OVSF codes in a time-sharing manner.


Though it is attractive due to its ubiquity, NetFlow data imposes several challenges for performing accurate botnet detection.

packet payloads are not included, and the collected data might be sampled.


To untangle the mutual interference of simultaneous transmissions and to achieve analytically tractable yet asymptotically tight approximations we move from the natural graph-based methodology to a space-based approach.

rather than studying mutual restrictions and interference on the graph of nodes, we focus on restrictions regarding the proximity of ongoing transmissions as seen at any location X of the space occupied by the network.


As a further particular case, consider the CMBBM problem where each interface can be reused in more than one transmission.

we allow that two or more groups of the multi-interface segmentation can be associated with the same row.


The schedule is broadcast back to the nodes in the cluster.

in the proposed CCARP, the schedule message contains a field indicating the required received signal power so that the non-cluster-head node can adjust its transmission power using the adaptive power adjustment strategy introduced in Section 4.


PYTHIA In this section, we describe Pythia, a novel active probing technique for alias resolution.

we .rst provide a brief overview of the categories of routers managing the TS option.


A naive idea of improvement is to replace Voronoi digram with square mesh.

service providers propagate their location information horizontally and vertically; the propagation paths form a mesh structure as service directory.


The WPAN devices collocated with the WLAN nodes must be the WPAN master device.

if the WPAN device conforms to IEEE 802.15.1 all Asynchronous Connectionless (ACL) data transmissions are controlled by the WPAN master.


2 and 11, we see that while LIMERIC adapts according to a target load rg, the LIMERIC component of EMBARC adapts according to a new effective target (rg µw).

it adapts to a fair share of the portion of desired channel load that remains after all extra transmissions.


However, the shifts are present in the residuals, and could be picked out with other means.

we could possibly catch more anomalies by developing the detection component of the processing chain (Fig.


As each pixel can be independently rendered, we take the approach of the pixel selection which provides a .ne-granularity content adaptation.

we evenly select pixels according to the ratio of Ai/fs as we scan through the array of pixels.


All these algorithms do not only differ in the features that their topology wants to achieve, but also have a different set of requirements.

for LMST and FLSS,it is necessary that each node knows its own position.


The transmissions from these n - i nodes constitute a Poisson process with rate (n - i)., each having a probability ps of being successful.

wi is exponential with mean 1/((n- i).ps).


Therefore, s1 is released at time instant tr =+- lav =+- + lav 1 t0 bh *(D +tx ) and s2 at tr2 t0 b (D tx ) .

s1 is released tr tr (h 1)( D +tx lav ) -= - time units sooner than 21 s2.


Thus, to decode this header information, TurboRate forces all the clients to stop transmitting when a client broadcasts its direction.

turboRate forces clients with ongoing transmissions to pause their streams and send null samples for a period of time that is long enough for the new client to broadcast its direction information.


Finally, we note that our results represent an empirical snapshot of non-access Internet bottlenecks.

we focus on collecting observations from a large number of paths, rather than taking repeated measurements of a few paths over an extended period.


In this case, distance-sensitive service lookup becomes localized.

a service consumer queries along a path in an arbitrary direction, and it will .nd its closest service provider once it hits the perimeter of its home Voronoi polygon.


However, our validation of ARAM (Section 2.3.2) gives us some con.dence in our use of ARAM to generate larger table sizes and explore variations in routing and allocation practice.

we use ARAM to shed some light on the somewhat acrimonious debate between TCAMs and algorithmic IP lookup schemes.


Therefore, how certain are tags as evidence?


We then prove the more tricky if direction.

we show that the scheme described in the proof of the only if direction is the only scheme that can successfully deliver the packet at an expected energy consumption of (1).


2, and observe considerable differences between the different networks.

eDonkey and eDonkey/Overnet have very high temporal stability.


We provide a mathematical approach to analyze a queueing system with deterministic reneging and heavy-tailed service interruption.

our approach incorporates discrete-time Markov chain theory and a version of the Renewal Reward Theorem.


On a per-pre.x basis, long transient periods are not the common case: although BGP update traf.c is fairly continuous, the update traf.c for a single destination as seen by a single AS is relatively bursty, with prolonged periods of silence.

a group of updates may arrive at several routers in an AS during a relatively short time interval (i.e., seconds to minutes), but, on longer timescales (i.e., hours), the BGP routes for external destinations are relatively stable [22].


Third, this list of metrics is incomplete.

it cannot include any future metrics that may be of interest.


As can be seen from line 24 to line 29 in algorithm VFK , algorithm VFK makes sure that each partition will satisfy the feature of hierarchy.

the number of leaf nodes (i.e., data items) in the upper level is always smaller than that in the lower level.


We augment service key equivalence groups by making a real-world assumption about the protocol persistence between an initiating host and a responding port.

we assume that within a short time period, if an initiating host contacts multiple responders at the same responder port, then the cells corresponding to those service keys are using the same protocol.


When the .rst relay group root on the chain is non-malicious and known by the attacker, the attacker infers that the source 1 is the .rst root with probability and the source L-n+1 is among all other non-malicious nodes with probability 1 1- .

for each non-malicious node u,the L-n+1 attacker assigns probability of u being the source as: 1 the .rst relay group root on the chain (L-n+1 ) pu = 1 1 1- · otherwise L-n+1 (1-f)N-1 When the .rst root on the chain is not known by the attacker or is malicious itself, all non-malicious nodes look 1 equally to be the source, each with probability .


To realize the concepts of "application as task" and "phys- ical surroundings as computing environment", the system must be dynamic at load-time.

the tasks that a user wishes to perform may depend on the physical surroundings.


TraceNET: An Internet Topology Data Collector M. Engin Tozal Department of Computer Science The University of Texas at Dallas Richardson, TX 75080 U.S.A. engintozal@utdallas.edu Kamil Sarac Department of Computer Science The University of Texas at Dallas Richardson, TX 75080 U.S.A. ksarac@utdallas.edu ABSTRACT This paper presents a network layer Internet topology collection tool called tracenet.Compared to traceroute, tracenet can collect a more complete topology information on an end-to-end path.

while traceroute returns a list of IP addresses each representing a router on a path, tracenet attempts to return all the IP addresses assigned to the interfaces on each visited subnetwork on the path.


For example, when k = 20, the probability to generate valid cash in this way is only about 10-6 .

one needs to send about 106 Interests to get a valid Interest.


The unique characteristic of AMOs is the fact that the target memory is updated atomically with respect to other AMOs.

at any given moment, only a single PE may access (read or write) the target memory through the AMOs.


Each frame lasts for slots, where , and consists of pulse (Fig.5).

for sender which has a frame intended to receiver , slot 1 of the frame is a pulse indicating the start of the frame.


The implication of ¯ (6) is that, once E is available, factorizing -JEJ yields X up to a product by a unitary matrix.

factorizing -JEJ provides all node coordinates up to a common translation, rotation, and re.ection ambiguity2 .


By harnessing the power of modern GPUs to perform packet classi.cation, we hope to make real-time packet composition analysis viable in the domains of network research, security and fault diagnosis.

we aim to apply GPU based .ltering to real-time giga-bit network visualisation and fast network telescope data analysis, applications which we believe to be both highly desirable and within reach.


The images can be preprocessed by standard techniques such as removal of moving averages, whitening according to an estimated power spectrum, and matched filtering.

worm propagation looks like a line at the source address, while distributed attacks look like a line at the destination address (Figure 2).


One way to construct such a set is described next for transmit AWV training.

2Anyfeedbackfrom thereceiver canbe communicated using the TX AWV chosen to be the best so far in the reverse direction (e.g.


After computing the overall redundancy effectiveness r, we can leverage it to determine the minimum number nmin of independent network stamps needed to meet a desired SLA uptime of a service.

we solve for the minimum integer n that satis.es the following equation: 1-(1-r)n =SLAdesired .log(1-SLAdesired) =nlog(1-r) As log(1-r) < 0.r .


It should be noted here that the pseudocode is intended as a rough outline rather than a concrete protocol.

the way Tx rate is increased and decreased could be realized in different ways, with the option of addressing di.erent fairness notions (cf.


The value of the function is interpreted as the probability of having a link between two nodes.

nodes i,j will be connected by a random link that exists with probability f(.i,.j).


CONCLUSION We have presented an ef.cient algorithm to check privacy policy re.nement.

we have addressed the privacy-inherent dif.culties of upward inheritance of deny rules, accumulation of obligations via obligate rules, and conditional rules.


transform G1 satis.es (s1 -s2)G1(s1)= J1(s1) -H(s1,s2) (9) for all (s1,s2) .O such that K2(s1,s2)=0; similarly, transform G2 satis.es (s2 -s1)G2(s2)= J2(s2)+ H(s1,s2) (10) for all (s1,s2) .O such that K1(s1,s2)=0.


Looking more closely at the RFCs in this area, ssuch as [7, 18, 19, 21, 27], the following branch-case can be obserrved as mentioned in RFC 3264 [27]: An Offer/Answer Model Seession Description Protocol : If multiple formats are listed, itt means that the offerer is capable of making use of any of those fformats during the session.

the answerer MAY channge formats in the middle of the session, making use of any of thhe formats listed, without sending a new offer .


For the remainder of our discussion of Tarzan s peer-to-peer design, we assume that a tunnel s duration is shorter that the period needed by an adaptive adversary to sequentially compromise the tunnel s relays.

we only consider a static adversary that compromises machines prior to tunnel construction, although it can actively attempt to bias an initiator during relay selection.


We also give a general theorem that covers stronger adversaries.

if the adversary can fail all but one processor then the time is O(log2 n) and communication is O(n 1.77), which is subquadratic in n. II.


Most of the research advocates that the objective should be to design intrusion-tolerant routing protocols, rather than detect intrusions.

a single compromised node should be able to affect on a small part of the network, and cannot cause the failure of the entire network.


Thus, theprobabilityof a successful relay selection is a constant bounded away from 0.

a relay j is chosen in a .nite expected time(equal to 34)such that |hij|2 > ln(f(n)/4).


From each individual traceroute in the source data, we extract all the internal network IP addresses and links.

after processing each traceroute, there is a corresponding interface list (e.g., IP1, IP2, IP3, IP4, etc.)


In all cases, the topologies should maintain important characteristics of measured Internet topologies.

users should be able to feed the tool measured topologies of a range of sizes, and the tool should produce random graphs of a target (rescaled) size that still reproduce characteristics of the input graph to the extent possible.


The measurements reported in this work assess WiMAX capability to support VoIP .ows.

the voice quality was evaluated through the E-Model [2].


Mates are acquired opportunistically by static nodes when they happen to meet mobile nodes.

if a static node x that has less than m mates happens to meet a free mobile node y,(i.e., a mobile node that is the mate of no static node), then y becomes the mate of x.


The condition p0N = 1 sets a primary direction for the mobility patterns in MC3.

de.ne a directed route R starting at site 0.


Noticehowever that this solution results in more lossy links that the solution provided by Sum-Tomo.


In this model, assuming that the network contains only a single bottleneck resource (a link or server) and that all the benign users have homogeneous utility functions, we show that the benign users utility is at least B/(B + M).

attackers cannot arrange their bids to cause damage disproportionate to their funds.


Wireless environments exhibit the following properties which make them quite different from their wired counterparts: due to fading, multipath and interference, the channel capacity is time varying;  in addition, to this, the burstiness of the errors and the landscape make channel errors in wireless environ- ments location dependent.


The gap between the high demand and the limited memory size will create a scalability issue on the virtual router platform.

the small amount of high-speed memory severely limits the number of virtual router instances supported.


The algorithm in this theorem is a dynamic programming algorithm, which can either be generalized from the dynamic programming in [1] for computing MIS on k-outerplanar graphs, or specialized from the dynamic programming in [31] for counting CSPs on graphs of bounded treewidth O(k) (which cover k-outerplanar graphs).

for q-MWIS and q-MWC, this exact algorithm can be combined into a PTAS on planar graphs using the same routine designed in [1] for maximum independent sets.


Note the high responsiveness of the system.

when Flow 1 .nishes its transfer freeing half of the link capacity, the other .ows sending rates adapt in a few RTTs.


Observations reveal that the new algorithm performs better by dipping Average Blocking Time of the Network (ABTN).

it outperforms at higher traffic rates with limited number of channels per link.


We can see from the .gure that the majority of the .ags involve ASes from the European countries.

168 out of 289, or about 60% of BGP .ags involve originating ASes and pre.xes both from European countries.


No Positive Transfer (NPT): The charge for service requestor t should not be negative.

we don t pay the service requestor to receive the data.


A covered unsafe pair (CUP) is an UP in which both peers are within the radio range of an altruist.

they are covered by at least one common altruist.


It is worth cautioning that our anonymization of some of the domains in the Traf.c data set could bias some of these results.

if many homes in our data set for some reason sent a signi.cant amount of traf.c to domains that were not in our whitelist (e.g., domains for pornographic content, which we explicitly removed from the whitelist), our results would not re.ect this phenomenon.


Further security goals address the pro.ling of the mobile users.

it might be desirable to hide the user s identity from the guest network and achieve unlinkability of its roaming sessions as it is currently the case in GSM/UMTS through the use of TMSI.


The IMSKAAP cannot adapt to such a scenario since it performs a four-way handshake.


The null-hypothesis is valid since this p-value is lower than alpha level 0.05.

we conclude that the corresponding pairs of samples do follow the same distribution.


predictions by using a little extra bu.ering but may not be able to tolerate missed hando.s because unexpected disruptions may cause a stall in the stream.

the application may want to reduce the false negative rate possibly at the cost of a higher false positive rate.


Both systems work in the same band and exploit a context of coexistence in which the secondary network is allowed taking resources from the other system without interfering in its normal operations.

the secondary system can select resources among the frequencies unused by the primary system in a given time interval and in a given location but also exploiting the gray spaces taking under control its interference toward the licensed system.


The coordination objective of each collector actor is to .nd the optimal actors to timely act on the portion of the event area under its own responsibility.

if multiple actors can act on a certain area we refer to the area as an overlapping area (region areas numbered from 1to 8in Fig.


Replication ratio,the ratio of the nodes that obtain the searched content replica to the whole population n,represents the cost of the search.

the replication ratio is the expected fraction of nodes being tagged seekers.


Let x =(x1,x2,...) denote the approximation of a .nite energy signal x(t) at a given resolution; the wavelet coef.cients {xm,n} at lower resolutions can be obtained considering the .lter bank shown in .gure 2, where the coef.cients hn and gn depend on the chosen mother wavelet.

the outputs of the high-pass .lter hn give the detail coef.cients (at the given resolution), while the outputs of the low-pass .lter give an approximation at a lower resolution, which is further decomposed in a similar way.


We note that the message and latency overhead due to backtracking is incurred throughout the routing phase.

backtracking can lead to severe power consumption in smartphones.


Before add the destination square, the OPEN_list is already empty.


As a result, our approach can be extended to find different types of botnets and has the potential to find the new botnets when exploring specifically the traffic on the "unknown" community.

we evaluate our framework on IRC and WEB community and evaluation results show that our approach obtains a very high detection rate (approaching 100% for IRC bot) with a low false alarm rate when detecting IRC botnet traffic.


The source node needs not to receive the RREQ message.

rE = 100% means that except the source, all other nodes in the networks receive the RREQ message.


CONCLUSION AND FUTURE WORK In a generalized case, there are not only processors may be crash, omission or malicious, but also communication media.

our protocol will be extend to solve when dormant or malicious communication media processors are existed simultaneously underlying virtual subnor et network of MANET in future work.


These nodes have limited power supply, storage space, and computational capability.

each MICA2 mote [25] has an 8-bit 7.37-MHz processor, 4 KB primary memory (SRAM), and 128KB program memory (ROM).


To the best of our knowledge, this work is the .rst to present a class of relaying strategies for multicast content delivery in mobile ad-hoc networks that optimize a global system objective and allow for general user mobility.

compared to previous work, our framework alleviates making any speci.c assumptions on user mobility that may not hold in practice, such as statistical independence of inter-contact times between mobile devices, homogeneity of distributions of inter-contact times between distinct pairs of mobile devices, and assuming speci.c parametric families for the distributions of inter-contact times.


Answering these questions plays a signi.cant role in multipath maintenance and reconstruction in sensor networks.

it can help to save network resource by not launching new route discovery if the data source realizes that no more route might exist; it can guide a mobile data source to reposition itself to recover from 1We use node-disjoint and vertex-disjoint interchangeably.


Nodes that carry the packet are referred to as infected, while nodes that are yet to receive a copy of the packet are called susceptible.

the packet will be received by the destination node when the destination node encounters an infected node.


i=1 tx Finally, thanks to the nature of data compression that leads to a uniform output rate, a simple delay model (based on the one in [17]) can be formulated.

the worst-case delay for a node n occurs when the remaining nodes use all their slots (and the control overhead for all the corresponding frames) before node n is enabled to transmit: 23 NN XX (i) 1 (i) (n)67 d(.mac) = .tx +.tx .control .


6.2 Not Being Incentive-Compatible Does Not Affect Stability We argue that BGP and NS-BGP not being incentive compatible in general does not necessarily mean that the respective routing systems will become unstable in the presence of unorthodox protocol manipulations.

while ASes might improve certain kinds of individual gains by manipulating these protocols, such actions are unlikely to a.ect the global routing stability.


before the registration reply message from the GFA has arrived).

in the case of long delay on the nFA-GFA path, if a packet is not dropped at the previous FA, it will most likely be lost at the new FA.


ACE also leverages knowledge of typical web browsing behavior.

it aligns embedded connections with the main (top-level) web connection.


First, sampling is performed with replacement whereas our approach samples without replacement.

using their approach one would expect to make many duplicate samples of an item with a dominant large weight.


SoNavNet is unique compared to existing LBSNs in that it considers not only the current location of a user shared within the network, but also navigation experiences provided by the user that can benefit the future navigation of friends within the network or other users.

navigation information within SoNavNet is largely user-generated, unlike other networks that provide navigation information, such as generic routes (fastest, shortest, least highways) computed by services like Google Maps or MapQuest or all nearby restaurants stored in the service providers databases.


11 = x1 = 1+ nsm 1+ sm Since x1 cannot exceed 1+1 sm without violating constraint (8), we only need to consider the following two cases: 1. x1 < 1 1+nsm Let obj denote the objective function.

we must have () 1 obj = (1 - x1) +1 - nx1(by (6)) sm ()( ) 11 n > 1 - +1 - 1+ nsm sm 1+ nsm 2s2 n + nsm + n m = 1+2nsm + n2s2 m This last value is minimized by n =1, at which point LowerBound mal (sm) = LowerBound mal (1) = 34 .


For each experiment of metric, traf.c load and user-server placement in mesh con.guration A, we plot the byte averaged route length.

we multiply the number of hops for each transaction by the number of bytes transferred in it, and divide the sum by the total number of bytes transferred in each load scenario.


4.1 Aggregation Phase In the aggregation phase, the goal is to agree on the contents of the aggregate.

the aggregation area must be determined, and the average speed must be measured.


The .rst study [14], performed during Fall 2001, showed that users were generally stationary and over 90% of the traf.c was TCP.


We consider the expected service time as the metric of quality of service, where a base station accepts a user only if it can serve the user in a bounded time.

we consider that a base-station sector i accepts a service request from a user if its tra.c load (.i given by equation (2)) would not grow greater than 0.8.


The second approachisintended to merge routing and data aggregation techniques and is primarily aimed at reducing the number of transmissions.

in order to improve robustness, multipath routing algorithms are usually employed.


However, the tra.c demand on the EBS may be non-uniform within the macrocell.

the shaded area in Figure 1 depicts a hotspot region: an irregularly-shaped geographic area within the macrocell that generates higher tra.c load than other areas of the macrocell.


exponential random variables is far from its expected value.

we make use of the following lemma, which also plays a role in the analysis of the accuracy of our algorithm for computing separable functions.


RELATED WORK Recently, ubiquitous technologies and especially mobile smart phones have been widely used to monitor user behavior [16, 24].

emotionSense [31] is a platform that is able to detect user emotional states using standard o.-the-shelf phones.


Encryption Length The encryption algorithms used in DBRP are block algorithms.

they take a block of data and generate the cyphered text.


INTRODUCTION In recent years wireless mesh networks (WMNs) have attracted increasing attention due to their advantages over traditional wireless networking technologies.

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.


DATA COLLECTION METHODOLOGY According to the 802.11 standard [37], a WiFi access point can announce its presence by broadcasting Beacons frames containing network con.guration parameters such as the service set identi.er (SSID) and supported data rates.

the SSID is a string that identi.es the WiFi AP in a human readable format (e.g., Home network , Free WiFi ).


All the videos available on the demo website are encoded at .ve di.erent bitrates as shown in Table 1.

the video level bitrate l(t) can assume values in the discrete set of available video levels L = {l0,...,l4}.


We de.ne a .ow as a sequence of packets with the same entries for a subset of .elds of the packet headers (typically source and destination IP addresses, destination transport port).


We show, surprisingly, that a guessable message needs NOT to be veri.able.

even though some message is not veri.able, it can still be guessed correctly by the intruder.


We show, however, that by and large, these deficiencies can be compensated through local gateway diversity at the source combined with intelfigent gateway selection.

we first learn that a large fraction of end- to-end service degradations are path degradations which can be bypassed if a request is routed through a differ- ent AS; we then show that small (but carefully selected) gateway diversity combined with simple prediction al- gorithms can reduce the degradation-rate to half of that of the best single gateway.


Furthermore, the energy required for transmission from node ito the BS is denoted by Ei.We consider the report cost that is proportional to the energy consumption from node ito the BS, Ei, and is inversely proportional to the current remaining energy of node i, ei.

the report cost of node iin a cluster, denoted by ci, is given by: Ei ci = .


Then, the long range contact v of a node u that has chosen integer k is selected uniformly at random in Bk(u) = B(u, 2k).

if the rank r(v) of a node v is the smallest k such that v .Bk(u), then [logXnl 1 1 .u(v) = .


The initial set of .ndings from our longitudinal analysis paints an intriguingly stable picture of the commercial Internet as seen from our vantage point.

analyzing in detail each of the 17 weekly snapshots shows that during every week, we see server-related traf.c at this IXP from about 20K (i. e., about half of all) actively routed ASes, some 75K or approximately 15% of all actively routed pre.xes, and from a pool of server IPs whose absolute size changes only so slightly but tends to increase in the long term.


N(Si) and Tj = LG, D DD (1 - cij ) - cij = (1 - 2cij ) must be greater or equal to I|N(Si)|/2l to claim Si is good.

a good Si will be diagnosed as GD in the .rst round if it has less than k/4 bad neighbors.


Keeping in mind that multiple connections between peers is rare in our data sets, we consider what happens when twenty peers all connect to peer A.

each peer will select a temporary source port and connect to the advertised listening port of peer A.The advertised {IP, port} pair of host A would thus be a.liated with 20 distinct IPs and 20 distinct ports 5.for the advertised destination {IP, port} pair of host A,the number of distinct IPs connected to it will be equal to the number of distinct ports used to connect to it.Figure 1 illustrates the procedure whereby a new host connects to the P2P network and advertises its {IP, port} pair.


In the absence of any holes/cavities an isolevel looks like the surface of a sphere; if there are holes, though, this surface of a sphere exhibits holes.

for each isolevel in the R3 setting, we are essentially faced with a hole detection problem in R2 for whichwehavealready pre sented a solution.


In this scenario, both the AP and the user s wireless NIC are likely to be operating at full power.

the user is not making any attempts to hide from the monitoring system.


3.1 Design principles The route veri.cation protocol must be secure in the presence of malicious intermediate ASes, even if the latter are aware that route veri.cation is taking place, know the veri.er s and prover s algorithms, and are actively trying to evade detection.

probe packets must be indistinguishable from regular data packets.


Similar results appear in [11, 20, 18, 19, 16, 17].


Indeed, a malicious responder could choose his DH value dependent on Alice s DH value, and this is never the case when Alice acts as responder.

the signatures of initiators and responders can be made distinguishable by a dishonest peer in SIGMA-I, something that is not possible in SIGMA-R.


(9), which completes the can be further simpli.ed.

the session initiated from node .... is denoted by .....  5.1 Distribution of Anchor Points proof.


The stability region of the system is  .= .µ.

µ.M the stability region is the set of de.cit arrival vectors that can be supported by some causal scheduling policy.


In this preliminary study, the intervals are upper-bounded by 24 hours.

daily BGP updates are examined at di.erent time scales.


Then an LSA is generated when jb(u);b(c)j*100.t b(u) where tis the threshold percentage.

the change in bandwidth relative to the previously available bandwidth has to be higher than the threshold.


As shown in the B|A column, event(B2|A2)can be degenerated toahorizontal segmentplusatriangle(i.e.,(1,1) and (2,1) mergetoa singlepoint),giventhesegmentsin A2 are already connected.

p(B2|A2)= p*(p+p 2 -p 3 ), since the two paths (from (1,0) to(2,1)) in the degenerated triangle are independent (illustrated in the second sub-row of the second row).


Finally, we repeated the above experiments using different sub-carriers obtaining similar results.

the .tting polynomial coef.cients for different sub-carriers for the same modulation are very similar.


To support this range of functionality, most mobile phones used and still do a hierarchical menu based approach.

a user can view a series of options on the small screen of the phone, select one of the options.


Although DFE has demonstrated very high spectral e.ciency, it has not reached the available capacity.

there is a gap between the performance obtained by original DFE detection algorithm and optimum performance algorithms due to imperfect nulling and cancellation.


This paper is aimed to show that a large system of interacting MAs can be analytically solved to generate a pheromone gradient around the sink(s) that can be successively used to create the routing table along the steepest gradient in order to minimize the number of hops from each node to the sink(s).

we provide a stochastic model to analyze a swarm-based routing protocol that gets inspirationfrom theone presentedin[12].


If the difference in the instants at which nodes iand j transmit is greater than the transmission time of data packet TtD, collision can be avoided.

if the probability of difference in the hold-off timers being less than TtD is kept very low, collisions can be reduced to a great extent at the receiver.


As the number of hops increases, packet delay and packet loss increase due to the carrier-sense and hidden node interferences [2].

the packet delay severely degrades the video quality because a video frame cannot be played outat the receiver in time after the specified playout time even if it is successfully transmitted.


One of the most serious problems in WMNs is the broadcast storm problem [16].

broadcasting messages within a network might seriously degrade the network performance in terms of throughput and delay.


1.2 Our Contributions Our main goal is to minimize the number of negative interactions between the OSPF and BGP protocols in a multi-AS environment.

the number of OSPF updates causedby BGP protocol dynamics, and the number of BGP updatescaused by OSPF protocol characteristics should be minimized.


Third, wide-band communication is always subject to multi-path fading [15] (see Figure 3 for an illustration).

the wireless channel instead should be represented by a vector h = {h-L, ..., h0, ..., hL}, where each component represents a path that the signal traverses.


We must note that the work described in this paper is a work in progress, and it should be considered as such.

the reader will not .nd security proofs in this paper.


In the present paper, we show that taking a = 51r/6 is necessary and sufficient to preserve connectivity.

we show that if a _< 51r/6, then there is a path from u to v in GR iff there is such a path in G~ (for all possible node locations) and that if ct > 51r/6, then there exists a graph GR that is connected while G~ is not.


In the context of this straightforward approach, we seek to achieve the following two operational goals: Non-interference: Since we advocate a proactive approach to DDoS mitigation it is absolutely essential that there be no interference between customers.

if one customer desires to constrain communication with a particular network entity, that decision should not have any impact whatsoever on the ability of other customers to communicate with said entity.


3.1.9 Programming Paradigms for Cache-Aware Components An interesting challenge is to devise programming paradigms that will facilitate the design of cache-aware components.

currently Web services are fairly large entities.


However, scienti.c computing presents challenges not typically found in commercial applications.

the components encapsulate parallel programs sending large, complex, and rapidly changing data objects.


Each individual .ow forwarded on the physical path requires a red rule, while all .ows on the overlay path share the same green rule.

.ows without individual rule entries are forwarded on the overlay path by default.


The queues 4j -2, 4j do not o.er any service (hence have zero serive times) and are only meant to represent delay of service to the next cycle, while the queues 4j - 3 and 4j - 1 carry out the actual services.

the users whose request will be served in the current cycle are viewed as if waiting in the queues 4j -3 for downlink service and 4j - 1 for uplink service.


As we delved deeper into the possible reason, the answer surprised us: the packet losses were happening at the receiver s radio buffer!

lack of .ow-control was a signi.cant issue.


The e.ect of not initiating any announcement phase is that no service node ever learns to route through a stealth node.

a stealth node never appears in any routing table, yet a stealth node is able to route messages into the DHT using the routing information it acquired during the state gathering phase.


Suppose further that the network has path or loop veri.cation.

then there exists a BGP-compliant strategy for m with rm(·) = vm(·) and a consistent export rule obeying GR2 that obtains the best possible stable outcome in terms of the utility function of m. exporting all paths to customers and no paths to providers and peers is one such optimal strategy.


If the busy label at v is 0 then the agent of S hasn t reached v yet.

the agent hasn t returned to u, and therefore the light labels at both u and v haven t been modi.ed by S yet.


We assume that the set of reachable paths, P(v0), is bounded in size, in order to place an upper bound on the size of a multi-path solution.

we assume that |P(v0)|<h(|V|) for some a priori function h. We argue that this is reasonable because practical routing systems often have an implicit memory bound in enumerating the paths in a network.


Furthermore, the new implementation introduces very small and consistent delay overhead.

the variation of delay overhead in the socket-based measurement can approximate to 0 ms, meaning that it can estimate the RTTs accurately as what WinDump can do.


In particular, we .rst de.ne the model of security for stateful IBE scheme and then present a concrete stateful IBE scheme whose security meets the (strongest) de.nition in the model, while its encryption and decryption algorithms are also extremely e.cient.

we show how to encrypt securely with just one pairing in identity-based setting.


1.5 Our Contributions In this paper, we mainly focus on designing an integrity protection protocol for In-.ight web pages.

we make the following contributions: We propose an integrity enforcement protocol which uses an embedded fragile watermarking chain scheme to link the segments of divided HTML code.


Properly identifying Internet one-way tra.c from measurement data imposes speci.c requirements on monitoring.

tra.c sampling and poor spatial network coverage, i.e., missing one direction of a communication that may take a di.erent path due to asymmetric routing, may result in arti.cial one-way .ows.


on the performance of any deterministic online algorithm.

our algorithm achieves a competitive ratio of approximately 11.123 for .


On the other hand, sensor applications in soil media and tunnels have unique communication problems.

the wireless channel pecularities in the underground make communication problems interesting which will be discussed in this talk.


The difficulty in keeping each of the multi-hop schemes secure is in preventing corrupted nodes from increasing the synchronization error between the node with the reference clock and distant nodes.

the difficulty is in enabling distant nodes to verify the time-synchronization updates they receive despite relying on nodes between the node with the reference clock and themselves to actively maintain not simply route those updates.


In this paper we have introduced a new class of scheduling and routing schemes that signi.cantly outperform the schemes in [22] for .> 2.

the schemes introduced in this paper jointly achieve optimal throughput and delay scaling exponents for 2 <.


More precisely, we assume that the monotonicity property holds.

if transmissions from a set U of nodes within the rsi(T, P )range cause v to sense a transmission, then any superset of U will also do so.


We use d2 as 7 in order the detections to be related with the candidate tracks with approximately 99.2% con.dence.


In our experiments, we varied the rs value in the range 0.33 × ravgs to 3 × ravgs,where ravgs is the average bitrate for video stream s. We conducted our experiments with all considered rs values, and we report the best performance among them.

we exhaustively searched for the absolutely optimal MBS con.guration, and we compare the OSVM algorithm to it.


CONCLUSIONS In this paper, we have introduced the .rst synthetic mobility and user behavior model which explicitly takes the degree of user satisfaction into account.

in Figure 6: Fraction of QoS-driven and mobile satis.ed users, as a function of the simulated time.


Although [9] adopts di.erent method from that in [5], the above assumptions hold for the random process of Ztcp in (2).

by leveraging Kac s recurrence theorem, the average connectivity period in [9] can be similarly written as 1 -P{Zcp =1} t Zcp Zcp .


The regions of small and large SNR values respectively correspond to regions of large and small constant standard deviation st .A transition region is veri.ed for moderate SNR values.

the upper and lower values of st depend on the observation time Tg and the integration time Tint of the energy detector, respectively, as follows .. Tg .


Starting from current trends discussed in standardization organizations, the Daidalos architecture is a major breakpoint from traditional approaches in IP networks.

daidalos is developing a novel mobility architecture, called MobiSplit.


Ni: RR(i, j, mj ) - si = R(i, j, mj ) = RR(i, j, mj )+ si .

(1) based on the learning samples, poller i can predict the response RSSI with bounded error si from any given neighbor at any power.


If t is clear from the context, we use the notational short-cut Pi = ft(xi).

a schedule S =(f1,..., f|S |)is a sequence of |S|power assignments, where fk denotes the power assignment in time slot k. a schedule Sdetermines the power level Pi for every node xi .


3.1 DTN Nodes for Distributed Storage We have de.ned extensions to the per-node bundle processing: routing, forwarding, and queuing behavior may be adapted upon the identi.ed protocol operations and the enclosed resources (if any).

this allows us to leverage the DTN store-carry-and-forward paradigm and make DTN nodes keep a copy of a message for a longer period of time than required by the forwarding algorithm, i.e., cache the ADU.


The Q-Q plot de- Flow Duration (sec) Figure 3: Complementary distribution of .ow duration problematic.

rate is not well-de.ned for single packet .ows whose duration by de.nition is zero.


An interference alignment network (IAN) is a subset of the original interference network that captures interference only due to transmit streams that need IA at the receivers.

iAN discounts those interfering streams that can be suppressed by allocating an equivalent number of DoF at the receivers (i.e.


The recent work [9] provides a more re.ned theoretical analysis of the performance and system optimization of a massive MIMO systems in the regime of large but .nite number of antennas per user.

it shows that in this realistic regime the choice of the multiuser MIMO precoding scheme is very important, and that the gain of regularized zero-forcing beamforming over conjugate beamforming is very signi.cant, unless the number of base station antennas per user grows to impractically large values.


In fact, TCP NewReno achieves a suboptimal fairness of about 0.64 for zero pause times.

increasing the mean for the pause times increases the chance for a starved flow to gain the entire bandwidth at the cost of the other flow.


Theorem 11 If the average route length in the network is EL, the probability that a packet is successfully routed by WAR to its final destination in one attempt is: Ps = [PL + (1 -PL)PR] EL (12) resent by the original host.

it either passes each link without error, or, if an error occurs, the recovery mechanism corrects it.


This property is de.ned as follows:  DE FI N IT I O N 1.

a network is symmetric if for all sourcedestination pairs (s, d), all switches on the shortest paths between s and d that are the same distance from s have identical outgoing capacity to d. any of these switches are equally good intermediate candidates for routing a .ow between s and d. Using the example of Figure 2, switches Y and Z are both on a shortest path between (A,E), and both have one link of outgoing capacity to E. Real deployments and most proposed datacenter architectures satisfy the symmetry property.


3.4 Network-wide Transactional Updates We present a complete design that pulls together the mechanisms presented in the earlier iterations.

we use a network-wide topology snapshot operation (heavily based on the consistent snapshot algorithm [4]) along with the mechanisms of reliable .ooding, replicated controllers, and whole quorum consensus.


A uniform probability distribution of handoff scenarios is assumed in all the analyses.

all handoff scenarios in the wireless access network are equally likely to happen.


Clearly, there are challenges in realizing such self-healing communities in mobile networks.

community creation and con.guration: A self-healing com munity can be created and con.gured anywhere and anytime in a manner compatible with state-of-art ad hoc routing protocols, but the related process should only incur reasonably low overhead.


tkL denotes the respective lifetime of a CAM for a1 vehicle in area Ak.

the age of the previously received CAM must be lower than its distance-dependent lifetime, being valid for the safety area where the vehicle is currently located in.1 Unawareness.


However, after BGP converges, all the nodes should have consistent route selection information, i.e., all nodes will pick the same AS-level path for each destination pre.x.

at all nodes, the AS-level source route in the packet header will be identical to its most preferred route to the destination (Case (1) above).


In order to gauge the impact of these approximations, the physical throughput of the schedules found from the protocol model were computed.

suppose that the optimal schedule based on the protocol model resulted in assignment v. In the protocol model, the data rates over link x for this assignment is RØ (x),where the Ø denotes that the data rate is based on the assumption that no other node is transmitting.


Prior work in DS-CDMA networks on adaptive power and rate allocation have mostly focused on throughput maximization [11,14,15].

instead of QoS differentiation, they strive to maximize the total number of bits reliably sent by all the MHs to the BS.


For any given PE, the total bytes transmitted toward CEs attached to it should be less than or equal to the bytes it received from the network.

whatever number of bytes the CEs attached to a PE receive that should match the bytes sent to this PE from other PEs.


Sandboxing individual HTML elements is discussed in [2] and shares ideas with our approach.

the idea of downgrading the privileges of individual content components.


The effective coverage rate depicts the effectiveness of the fume notification.

during the same period, the higher rate implies more nodes that would be involved into the diffusion range are notified.


This is achieved by exploiting the fact that sensor networks are low tra.c networks; typically, orders of magnitude lower than WLANs.

oDMAC moves the idle listening time from the receivers to the transmitters.


However, WMN technology changes this equation by breaking up long distances into several short hops.

the result is that by using hopping and WMN we can send that same data rate over the same distance, but perhaps only a linear increase in power.


We evaluate the sensitivity of these parameter setting on learning associations between syslog message.

we vary W from5 to 300 seconds and Confmin from 0.5 to 0.9.


The quality degradation represents the ratio of the reduction in the reconstructed quality (due to the rate reduction) to the quality of the enhancement layer with encoding rate a.

we define quality degradation = (original quality with enhancement layer coded with rate a - reconstructed quality after rate regulation)/ original quality with enhancement layer coded with A V R_TCP=1Mbps A VR_TCP=1.5Mbps 33 alpha Mbps (a) Reconstructed quality Q with non-adaptive transmission as a function of enhancement layer encoding rate a (b) Reconstructed quality Q with proposed adaptive transmission  rate a, i.e., the quality degradation at rate r is given as (Q(a,a,.


We thus conclude that our CPUs are ef.ciently used; moreover, in the case of minimal forwarding, the small number of instructions per packet shows that Click s software architecture is ef.cient.

a poor software architecture is not the problem; performance truly is limited by a lack of CPU cycles.


EVALUATION In this section, we perform a comprehensive set of experimental and simulation evaluations to validate our model.

we intend to demonstrate that (i) our model can accurately predict the .ow throughputs with asymmetric conditions, and (ii) our CW tun ing mechanism can be used to achieve the performance objective.


Constraint di.erentiation is independent of the technical and conceptual details of the various lazy intruder approaches and underlying protocol models, and can thus be adopted in other approaches.

even though for concreteness we refer to our own variant of the lazy intruder technique [5], it is not di.cult to carry over constraint differentiation to other approaches, as the di.erent formalisms for constraint reduction in the .rst layer of search are all similar.


log |Pi| = F.(r)= argmin {|..(u) - r|} (12) u.dom(..) where .. is a discrete function that maps the number of responders in log scale to the expected strength of their superposed signal given a target RSSI of ..

according to Proposition 1, we have ..(u) = .+3u, u =0, 1, 2,... (13) node i uses the value u that makes ..(u) closest to r as the estimate of log |Pi|.


In order to take this random channel choice into account, we therefore calculate the performance that can be achieved by using each channel individually, and then use the average of those as the single channel performance.

in Sections 5.2 and 5.3 we compare diversity to the single-channel case by averaging the ER obtained from using only channel 1 or only channel 2.


We experimentally chose the value of 5 seconds by successively lowering the timeout value until we started to notice false negatives.

dHCP attempts and port scans were failing simply because there was not enough time for the process to complete.


The route u .v1 .b .t falls in between them.

it has an expected energy consumption of 8 and the expected number of end-to-end retransmissions needed to deliver a packet along the route is 4.


CK should be transparent to all the entities that it serves.

entities making HTTP requests should be able to perform normally without any modi.cations.


This is due to the fact that TECA needs little more time until a stable topology is reached.

some nodes stay passive for a longer time compared to ASCENT and GAF.


Since the underlying technologies and the packaging constraints of the various levels of the packaging hierarchy determine the feasible system level topologies/architectures, we chose a bottom-up approach and focused on the packaging of optical modules on boards.

we propose lay-out strategies for on-optical printed circuit board (OPCB) topologies, translating existing lay-out strategies for electrical PCBs into a form suitable for OPCBs.


We call such a scenario for future wireless networks as cognitive radio networks (CRN), which is pretty much consistent of Haykin s definition of cognitive radio [10]: Cognitive radio is an intelligent wireless communication system that is aware of its surrounding environment (i.e., outside world), and uses the methodology of understandingby-building to learn from the environment and adapt its internal states to statistical variations in the incoming RF stimuli by making corresponding changes in certain operating parameters (e.g., transmit-power, carrier-frequency, and modulation strategy) in real-time, with two primary objectives in mind: highly reliable communication whenever and wherever needed; efficient utilization of the radio spectrum.

once cognitive radios can find the opportunities using the spectrum holes for communications, cognitive radio networking to transport packets on top of cognitive radio links is a must to successfully facilitate useful applications and services.


A request was part of a sequential network scan.

a request was part of a series with the same source address and a sequentially increasing target address.


Instead, we must collect a trace of switch output results that enables comparisonusingdetailed information from both the OpenFlow and the data plane interfaces.

we must for example capture packets and OpenFlow messages emitted by the switch, and maintain a non-ambiguous representation of these events.


By comparing the two .gures, we can see that with increasing vehicle density, the region providing near-optimal reception performance becomes smaller and is moved closer to the sender.

the reception performance at a vehicle s dt depends heavily on how many others are in its neighborhood.


For the other public keys that can be reached via authentication chains, we consider how well these authentication chains are maintained.

a secure delegation (DS) record stored at the parent zone must match a DNSKEY stored at the child zone.


We start by noting that existing SDNs do not have a suf.ciently clean separation of concerns among their internal modules.

three key modules of SDNs distributed consensus protocols, mechanisms for supporting switch-controller or controller to controller communication, and transport protocols for reliable message exchange can have cyclical dependencies on each other.


One is admission control and call control on the line.

there exist constant competitive algorithms for the problem where the goal is to maximize the number of accepted requests [1] as well as constant competitive algorithms for same problem where the measure is the number of the rejected requests [8].


For .< 1, the variance of t0 decreases while the variance of tc increases.

if we .x the number of tags t and increase the number of slots, the ZE estimator gets more accurate while the collision based CE estimator gets less accurate.


The de.ning characteristic of SMORE is that this of.oading is accomplished without requiring modi.cations to the functionality of the core network proper.

without modi.cations to the functionality of network elements in the core mobile network.


4.9 Completely mobile networks Consider a network where all nodes are mobile.

beyond the targets, the sensors themselves are mobile.


t2 The routes from Y and Z get propagated into routing instance 3 (BGP 65000).


One requirement for the mapping process is that preferences compose over addition.

an ISP should be happy to use two alternatives each with preference -1 if that enables it to use an alternative with preference +3.


Further, to ensure distinct network graphs per OF, the cross-correlation between OFs must be minimized.

this applies to OFs based on similar estimation characteristics.


Given a forest F =(i1,...,ik), we de.ne the following functions on F (which are used to build our structure): HEAD(F ) = () if F = ()andis(i1) otherwise.

hEAD(F ) is the largest binary tree in F .


Also, G{E} gives the number of distinct array elements accessed by array reference E (which is either K[f1][f2]...[ft]} or L[g1][g2]... [g.]} for the assignment statement above).

this constraint checks whether the size of the output data generated (K) is sufficiently smaller than the input data (L).


We define the delay as the time from the time when the event occurs until the time at which the corresponding data packet reaches the sink.

the delay is the sum of the time needed to forward the data packet to the sink and the time interval from the occurrence of the event to the time at which the network starts forwarding packet to the sink.


For the local subnet of our institute we were able to use very reliable information sources to validate a small number of detected infections.

for a set of nodes we physically visited their owners and veri.ed an infection eitherbyperforming an on thespot assessment of a system or by receiving a con.rmation from an owner aware that her system was indeed infected.


However this fact means that Y(t) can be at arbitrary distance from X(t) only if it lies on the positive direction of the normal vector n(s) (away from the direction of the turn of X).

our constraint on the curvature says that the distance between the two curves must always be lower than the largest of the two rays of curvature.


For a brick to be represented in a single rule, the pre.x-based wildcard rules like those in OpenFlow restrict the .exibility when selecting brick size and alignment.

bricks must conform to a binary tree structure.


Hence, the threshold is a measure of the SNR of the spike and is not dependent on the data.

if the GPS data is noisy as in an urban area, the algorithm will continue processing more data until the threshold is crossed (as discussed in section §6(b)).


We refer to the sum of the energy consumed by the parts of the data centerfabric as the totalpower consumption, measured in Watts.

the total power consumption incorporates the energy requirement of the switches and the extra energy consumed at the servers thathave multipleports.


A one-way chain (V0, ..., Vn) is a collection of values such that each value Vi (except the last value Vn) is a one-way function of the next value Vi+1.

we have that Vi = H(Vi+1) for 0 = i < N .


Second, maximal spatial reuse must be ensured subject to the .rst constraint.

network resources can be reclaimed by TAP-aggregated .ows when they are unused either due to lack of demand or in cases of suf.cient demand in which .ows are bottlenecked elsewhere.


There are many avenues for further study.

we are conducting more experiments on interdomain traf.c control.


In our model we assume that transient resources have a direct communication link with their local Arbitrators.

they are within communication range in a single hop.


For the same MCS and similar loss rates, larger frame sizes are more energy ef.cient.

as we observe in Figure 6(c), using small packets results in a multi-fold increase of the per bit energy cost compared to using large packets under high loss rates.


We now turn our attention to the honest nodes.

we want to show no honest nodes will be incorrectly removed.


Let k * be the channel allocation that maximizes the revenue of the auctioneer, given the bids zi(.)

for bidders 1,...,N.k * satis.es: NN zi(k * ) = zi(k) .k .


when the offered load is less than one (offered loads < 1), inter-ONU scheduling will be dominant in allocating the bandwidth for each user traffic; however, when the offered load is greater than one (offered loads > 1), intra-ONU scheduling will play the more key function in bandwidth allocation.

when the offered loads less than one the prompt reaction to the varying EF traffic is important; however, in case the offered is beyond the limit, intra scheduling is primarily more important in providing dynamic bandwidth during allocated time slot.


In this context, the objective of the topology control is to devise network topologies where communication void regions can be minimized or even eliminated.

the topology control through movement assisted (depth adjustment) of some nodes can organize the topology in a favorable way to use the greedy geographic routing protocol.


54 25 18 12.8 48 24 12 9.6 36 19.5 9 7.2 24 16 6 5.4 The current implementation of the 802.11 a/b/g MAC layer is known to have major ine.ciencies.

both DCF and PCF access methods su.er when registered users have di.erent data rates, because the slowest user reduces the throughput of the other users down to the value of the slowest user2 .


The motivation of this design comes from the asymmetric transmission power limit in TV whitespaces.

the mobile client is allowed to transmit at much lower power 100mW compared to the static base station allowed to 4W.


3.2 Bene.ts of Overhearing A key novelty of MicroPlay is that it exploits the nature broadcast of WiFi to enable direct-input rendering for all players.

microPlay allows a client to overhear command packets sent by all other clients to the server and use them to perform direct-input rendering.


To enable the compressive sensing based path reconstruction, packets need carry encoded information for all non-zero elements of the path vectors representing their traveling paths.

when one packet is relayed by an intermediate node, the node needs to annotate its hop number along the path into the packet header.


The main improvement of the new protocol is the assumptions made on the underlying network.

the protocol from [1] assumes that the adversary always sets the initial bits to 0.


3.2.1 Conventional Resource Allocation Problem A conventional resource allocation problem is often de.ned as a problem of minimizing the number of resources allocated to the stations.

for given sets of S and R with IS(s)and reqS(s)for each s .


This feature makes it possible to apply tra.c engineering to a speci.c device or application or piece of content.

fLARE provides control and packet processing according to application context.


5.3 Discussion The performance of the proposed method depends on the hit rate of the content requested by pipelining, i.e., the hit rate of the inline objects on a web page.

the proposed method works well only when a part of all inline objects on a web page is cached.


We also consider a second, closely related question: Is there a direct correlation be- tween l~:affic volumes and BGP routing stability.

are prefixes receiving a higher volume of traffic more (or less) stable than prefixes receiving a lower volume of traf- tic?


We show that di.erent bandwidth allocation algorithms have signi.cantly di.erent performance in terms of the fragmentation occurring in the system.

an algorithm (referred to as LFS) that allocates gaps in decreasing order of their sizes reduces the fragmentation by almost an order of magnitude compared to other algorithms.


The results presented here are based on monitoring data collected from June 24th, 2006 to July 23rd, 2006.

we measured the hop count length of each path (from a monitor to a target pre.x) every 12 minutes.


In what follows, we use the experience gained by these previous studies to develop metrics that are consistent with our .rst principles perspective.

we consider several novel measures for comparing topologies that we show provide a minimal, yet striking comparison between degreebased probabilistic networks and networks inspired by engineering design.


Detection and tracking applications often use an event-oriented reporting model rather than sending a periodic stream of readings.

this workload models the e.ects of a single, synchronized impulse of tra.c on network performance.


We consider the problem of designing ef.cient multicast transmission mechanisms with switched beamforming antennas.

we note that there is an inherent tradeoff between multicasting and beamforming.


2.2.1 Forecasting techniques for probabilistic routing Each node predicts, using time series forecasting techniques, the evolution of its context described by a set of attributes.

we consider three indicators describing its colocation with the sinks, its change degree of connectivity and its battery level.


Cognitive radios are aware of the electromagnetic spectrum environment around them and make adjustments to their transmission characteristics accordingly, in a manner consistent with the tiered access rights model.

we define cognitive radios as having the following capabilities: (a) Dynamic Spectrum Access (DSA): CRs must quickly and robustly detect the presence of incumbent users, who have preemptive rights to access the spectrum, to avoid causing interference to these users, (b) Dynamic Spectrum Sharing (DSS): CRs must be aware of other cognitive radio networks of likely similar access rights and coexist with these networks, and, (c) Dynamic Spectrum Multi-channel operation (DSM): CRs must be spectrum-agile and provide seamless operation over multiple channels, potentially simultaneously.


For our purposes, the important characteristics of such sites are that: .They have a high occurrence of images that are hyperlinked rather than embedded in HTML pages.

the browser does not download these images automatically a user must click on a link to download an image.


It essentially involved copying and pasting the data processing code into multiple C++ blocks, and re-defining some control functions, requiring about 150 additional lines out of about 2500 lines of untimed C++ behavioral code.

we separate the control from the data processing functions because they require different models of computation (CFSM and dataflow respectively) at their interface.


Within the provider backbone, unique multicast addresses are used to encapsulate tra.c for each MVPN.This assures that tra.c from di.erent customers is segregated in the backbone.

each customer is assigned a default multicast group, referred to as a Default MDT (for Multicast Distribution Tree).All PE routers that participate in a given MVPN knowthis group address (e.g.,by con.guration.)


Therefore, their total vote will drop later on.

with an over-constrained system, we can detect incohesive rotations of  Figure 9 Commercial UHF RFID Used in Experiments: Alien Squiggle General Purpose UHF RFID these grating lobes.


An important aspect of the radios is that in the steepest case, if the channels are known (as they are in the case of deterministic forwarding), then no opportunism is possible.

if the channels are known, then the transmitter knows exactly which nodes will receive the packet.


This demonstrator focuses on the 2.4 GHz frequency band and aims at showcasing how a small-scale Wireless Personal Area network (WPAN) made of IEEE 802.15.4 [2] compliant devices can achieve e.ective coexistence with other wireless technologies.

the demo shows a distributed spectrum sensing service that provides spectrum awareness to the WPAN.


As a result,someend-users may not receivethestreamstheyhave subscribed.

the resulting multicast tree may cover a subset of mesh routers where end-users can receive video streams successfully.


We .rst break the symmetry by introducing a slight random link cost variation into our complete graphs.

instead of a uniform cost model we turn to a model where link costs are chosen randomly from a known distribution.


The penalty Xi of PE pi is de.ned to be the sum of the volume and additional distance products of all conversations in C, assuming pi is a sole hub in the VPN.


If the performance of the air-link is considerably poor, the service provider should install a new AP additionally or replacing the old one or change the allocated channels of other neighboring APs.

the process to measure the performance over the air link can be an initial step for satisfying the customer and provisioning the network.


As a result the graph is in reality a (unit disk) hypergraph.

we consider the following networks: unit disk [hyper]graphs where nodes are either distributed randomly (Fig.


Further, we dynamically elect, within each RG, an RG leader which corresponds to the best suitable user.

we assign a weight to each mobile device.


This can be explained with similar arguments used in [7].

assume that in an FD based system, the nth user occupies a constant bandwidth, denoted by .nB, n =1, 2,...,N, where 0 <.n < 1 and LN .n = 1. n=1 The instantaneous transmission rates are then determined by Rn = .nB log2(1 + .n.n/.n), n =1, 2,...,N, where .n is the nth user s instantaneous power normalized by P .


Simulation .delity is particularly important to get realistic results.

propagation and mobility .delity are key to evaluate the performance of vehicular network protocols and applications in urban scenarios.


In other words, we investi gate whether the semantic neighbours of my seman 1347tic neighbours are my semantic neighbours, and there1000 710 10000 fore can help when searching for .les.

a peer .rst queries its semantic neighbours, and upon failure, 100 queries in turn its two hop-distant semantic neighbours.


To provide a degree of plausible deniability, the user can select a set of chunks that enable re-creation of more than a single piece of content.

the user can select chunks where the entire set recreates one or more cover .les, while the composition of a particular subset recreates a target .le.


Another important area for future work is optimization.

it would be nice to get rid of the StratoSIP hairpin mentioned in Section 9.


The copy is made eventually consistent when these key packets are processed, rather than recopying state for every packet.

events are raised by normInst for these packets and the controller invokes the updateStandby function.


This experiment suggests an important conclusion: that a single linear.t captures most of the deviation induced by slow timescale phenomena.

the signal intensity shifts due to slow time-varying effects seem to be homogeneous on average across various locations.


In [14, 8, 7], variants of the problem outlined above were studied.

[14, 8] analyzed a problem where channels can only be used immediately after probing (i.e.


Let FM (t)and FK (t) be the Cumulative Distribution Function (CDF) of TM and TK , respectively.

we derive FK (t) with ODEs by computing the derivative of FK (t)over t. to derive FK (t), i.e.


Then, we compute the capacity gain that one can get by of.oading users traf.c while taking into account different of.oading policies and hotspot placement schemes.

we show that of.oading using Passpoint control-plane information can grant up to 15% gain with respect to Passpoint-agnostic ones based on signal quality information.


5.1 Cellular Resource Management Policy To ef.ciently utilize the limited radio resources, cellular networks employ a radio resource management policy distinguishing them from wired and Wi-Fi networks.

there exists a radio resource control (RRC) state machine [31] that determines the radio resource usage based on application traf.c patterns, affecting the handset energy consumption and the user experience.


Instead of using Max Min fairness in allocating the explicit feedback (§3.4), we use Weighted Max Min fairness, where longer paths have smaller weights.

a TeXCP agent s assigns to each path p a weight vsp = d)1 , where dsp is the sp propagation delay on path p, and .> 1 is a parameter that controls the bias against longer paths.


Recently, several papers have introduced techniques which approach the above properties.

citing the lack of a distributed compact routing protocol, VRR [9] introduced a novel DHT-inspired approach to route on .at names, but as we will see, VRR does not guarantee scalability and low stretch.


It shows that in a NLOS indoor environment, 53% and 40% of the replay time is spent in the superiority intervals over 1s for the 5dBi and 8dBi antenna, respectively.

should the directional antenna be selected, it can provide a better performance over than one second for close to half of the time.


CDNs provided many of the bene.ts of Web caching, and also gave content providers more control over their content.

cDNs enabled a provider to improve the overall browsing experience for their users.


Delay-Throughput Performance in Mobile Ad-Hoc Networks with Heterogeneous Nodes Valentina Martina Michele Garetto Emilio Leonardi Politecnico di Torino, ItalyUniversità di Torino, ItalyPolitecnico di Torino, Italy valentina.martina@polito.it michele.garetto@unito.it emilio.leonardi@polito.it ABSTRACT In this paper, we analyze asymptotic delay-throughput performance of mobile ad-hoc networks comprising heterogeneous nodes with restricted mobility.

we consider a scenario in which each node moves around one or more home-points (in a .nite number) randomly placed over the area.


Here, we evaluate the ef.cacy of various con.gurations of multi-bank LDAs over a range of loss rates.

each bank within the LDA is tuned (p = am/(L +1),a =0.5 as before) to a different target loss rate.


Packets are then sent along the same column (row) until they reach the destination node.

in order to route packets between any pair of nodes { i , j }, only the most external paths of the shortest path region are allowed.


For our jammer, we used the same device as legitimate nodes, thus the jammer can only jam one channel at a time.

we used the constant jammer of [2], which is a mote that bypasses the MAC-layer to continually transmit random bits into the network.


However, tracing sensor nodes di.ers from both group testing and DTT because there are more possible outcomes from the tests .

from re-routing a set of nodes the base station may learn that all the nodes are alive, at least one is dead or that there is a dead node in a proper subset of the original set.


The fraction of honest actors in the aggregate data remains constant throughout the 10 snapshots, indicating that we quickly discover a representative sample in this study.

these results indicate that the Scan on First Hit method of discovery used in this study and which has a bias potential, does not bias this particular metric.


Our model for representing network distances by matrix factorization overcomes certain limitations of models based on low dimensional embeddings.

it does not require that network distances are symmetric because in iiii general Dij = Xi · Yj =Xj · Yi = Dj i .


We see that in both Simple and Complex LOS environments, the adaptive design not only reduces the navigation overhead but also the measurement frequency.

even in Complex LOS, it reduces the navigation overhead by half, and only invokes user rotation every 30+ meters.


The end result is that all the players will form a link with x.

the type-A clique is extended to include the type-B player x.


This last argument constitutes the main philosophy in the present work.

we are seeking technically feasible approaches that could be used to design network tools that allow for BE- and LE-traffic to coexist harmonically.


Consider the following FT, which we refer as FTO : [ (1, tcp_dst_port=22 , drop), (0, eth_dst==4 && eth_src==6, port 30), (0, eth_dst==2 , drop)] One can verify that the two FTs produce the same result.

the example shows that BU IL DFT has two problems: (1) it may generate more .ow table rules than necessary, since the barrier rule in FTB is unnecessary; and (2) it may use more priority levels than necessary, since FTB has 4 priorities, while FTO has only 2.


Anomalies by the subspace method are detected by inspecting the size of residual vector (Ix I2) across time for unusually large values.

an anomaly is triggered when Ix I2 >da where da denotes the Q-statistic at the 1-acon.dence level, as given in [10] and used for traf.c analysis in [16].


In this section, we attempt to .x these two issues and demonstrate that signi.cant performance gain can be obtained, even with power control itself alone.

to focus on the performance of the state machine, we limit ourselves to only controlling the transmit power (TPC -transmit power control) while keeping the broadcast periodicity, carrier sense threshold and modulation schemes constant.


Let us denote by S (s, t) = S (t) -S (s)the amount of service that the server would have delivered in interval [s, t) if there had been no service impairment in the interval, and I(s, t) the amount of service, called impaired service, that cannot be delivered in the interval due to some impairment to the server.

the actually delivered service S(t) to the input satis.es, for all t =0, S(t)= S (t) -I(t), (31)  with S(0) = 0, I(0) = 0 by convention.


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

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


2.2.1 Antenna Pattern and AoA Estimation As the physical component of iLocScan, the antenna array is crucial to the performance of our system.

we are concerned with what antenna pattern to be used for detecting AoAs.


These additional steps require that reference points for a target pre.x be established not only on a permonitor basis but also on a per-access router basis.

a monitor has to know all of its reference points for the target pre.x, with each reference point corresponds to an access router of the target pre.x.


To ensure that our evaluation is as true to reality as possible, we use a more general radio model in our evaluation.

we assume a model with an upper and lower bound on signal propagation (Figure 13).


For example, the ongoing traf.c .ows from all source nodes should not exceed the capacity bound of the wireless networks.

all source nodes need to have the ability to adjust their network .ows according to the current network situation such that the ongoing .ows in the wireless network are stable.


With a lower type distributions B(2, 5), the probability of cooperation at equilibrium is smaller than other distribution types.

sel.sh nodes cooperate less because whenever they must change pseudonym, they know that the majority of their neighbors also needs to change pseudonym.


We argue that insu.cient time has been spent evaluating the suitability of symmetric designs, which have several notable advantages over asymmetric designs most notably a lesser reliance on availability of bandwidth.

we suggest that asymmetric cryptographic models may not provide functional bene.ts to match their deployment costs, especially so in networks where the constant availability of certi.cation authorities and certi.cation revocation lists can not be taken for granted.


Given the plethora of alternative access technologies, the longterm economic feasibility of metropolitan mesh networks appears uncertain.

it is unclear what role city-wide WiFi deployments play from a user s perspective, independent of any particular network agreement or charging policy.


A processing unit is an abstract concept that generalizes any concrete messagehandling entity.

it is sub-classed by the concepts channel, rule and .lter.


Many challenges remain to make MAC coding a practical technique.

it remains a challenge to guarantee an I upper bound and ensure the unique distribution of code max words among the nodes of a wireless Ad Hoc network.


By summing over many rounds, we can obtain the resulting distribution.

the number of downloads in the .rst round is described by the random variable N0 .


To evaluate Friend Relay, we have investigated the benefits of monitoring and control functionality.

our goals are to confirm that fine-grained control can be implemented, and to quantify its overall effectiveness.


This was expected since in this simple scenario problems related to link-layer contention are managed efficiently by the IEEE 802.11 MAC protocol.

in this simple scenario all nodes are within the transmission range of each other and can thus coordinate efficiently their transmissions.


In AP, however, diurnal pattern are mainly driven by the local diurnal patterns.

losses from SIN to EU or NA destinations do not climb up during expected business/home usage hours in those areas.


Thus, while our trace does not provide GPS-level .ne-grained location information, we will show later that location information at the level of base-stations is still invaluable from the perspective of the serendipitous location-based services.

we will show how we caninfergenericuser mobilityproperties(Sections2.2,3.1), as well as correlate locations with application usage (Section 3.2).


An independent set (IS) of a graph is a set of vertices, no two of which are adjacent.

it is a set I of vertices such that for any two vertices in I, there is no edge connecting them.


(5) m m i=1 i=1 The above inequality is derived by the Cauchy-Schwarz in (1-p)T equality.

the equality holds if and only if di = m , for i = 1,2,· · · , m. when the distribution of link .


Therefore, E[Wi]=2tne/(n - i), and n-1 X E[W]= E[Wi]=2tneHn =2tne(lnn + .

(1)) i=0 the loss of synchronization results only in a factor of two slowdown, as expected.


R, then y is p s only closest point on .R.

1The Voronoi diagram of a set of points S in the Euclidean plane is a planar graph that partitions the plane into convex cells such that all the points inside a cell have the same closest neighbor in S. a point on the Voronoi cell boundary has equal distance to at least two points in S. Further information about Voronoi diagrams can be found in [11].


To achieve this, the nodes dynamically change the size of the header and the MAC sent in the packet.

instead of using a .xed large overhead, the nodes use a small packet overhead that expands dynamically if the node detects the presence of an adversary who is trying to forge a packet.


We show by an example that the above payment scheme is not strategyproof.

if we simply apply VCG scheme on LCPT, a link may have incentives to lie about its cost.


We present a number of strategies drawn from experiences for avoiding or overcoming some of the pitfalls.

we discuss dealing with errors and inaccuracies; the importance of associating meta-data with measurements; the technique of calibrating measurements by examining outliers and testing for consistencies; dif.culties that arise with large-scale measurements; the utility of developing a discipline for reliably reproducing analysis results; and issues with making datasets publicly available.


Besides, we .nd that, in p =0.0, PER algorithms perform much better than other routing schemes, while in p =0.5, the advantage is reduced and all routing schemes work very similar.

the more deterministic the nodes mobility behavior is, the better the three PER algorithms will perform.


A modi.ed hierarchical dynamic source routing (DSR) protocol [9] is studied.

they observed, when using the same amount of sensor nodes in a given coverage area for .at and hierarchical topologies, that the system throughput capacity increases, while system delay decreases.


Since it is dif.cult to obtain such coordinated data, we use observations of speci.c behavior from several different data sets to collectively infer DNS responsiveness.

we focus on client and LDNS behavior in terms of adherence to DNS TTLs.


The realization of EnHANTs is based on recent advances in the areas of solar and piezoelectric energy harvesting [24] as well as ultra-low-power wireless communications [26, 42].

recent novel circuit designs that employ ultra-wideband (UWB) communications provide new levels of ultra-low-power operation (at the orders of nJ/bit) at short ranges.


This happens when an AS uses detailed routing policies (such as hot-potato routing) that are not strictly per-neighbor.

tra.c destined for the same pre.x may take di.erent next hops depending on where it enters the network.


For each incoming packet to input i destined for output k, a request token r(i, k) is immediately generated and sent to the intermediate input linecard that is currently connected to the input.

the input linecard load-balances request tokens among intermediate linecards in a cyclical way that is in.uenced by the arrival time of each packet.


Capturing similarities between di.erent versions of the same page visited several days or weeks apart would either require a very large cache on disk, or would possibly be better handled using hierarchical substring caching or .le synchronization techniques.

if a page is revisited after all the block hashes from the previous visit have already been evicted from the proxy, but the client still has the old page in his disk cache, then there is a very simple and elegant way to utilize .le synchronization techniques similar to rsync in this context.


to realize these applications are now on the market, and it is reasonable to assume that their deployment will grow rapidly.

while there are many types of RFID, theEPCClass-1Generation-2 standard[3] de.nes readers and passive tags that operate at UHF frequencies and use backscatter communication to support read ranges measured in meters.


The crux of our routing mechanism is the fact that we use stable links.

unlike in [16], we do not have a situation where we have to distinguish between links of error rates in-between 0% and 100%.


whose decision is opposite to that of Rj ).

f ' - Rj satis.es property Rj -a .rewall veri.cation problem.


Individual conclusions are not possible;  if we take a closer look at the graph, we can remark that each category exhibits di.erent RSSI spreadings.

we could derive a probability of link occurrence ratio for di.erent RSSI values.


For example, approximately half of RFC3056 (6to4) [2] is devoted to interoperability between 6to4 and native IPv6.

half of the complexity of RFC3056 comes from interactions between the second and third phases of IPv6 deployment.


The main idea used in [6] is to use some intermediate node to serve as ferry node: this node will carry the data from the source node and move around and it will dump the data to the target node when it is within its communication range.

essentially, the result presented in [6] still obey the capacity bound proposed in [7]: the capacity is improved because the average distance L a packet has to be transmitted is reduced from T(1) in [7] to T(r(n)) in [6].


Moreover, the goal of reducing power consumption is not merely to save energy , but rather to reduce the load on the user s attention.

if a user should happen to forget to recharge their device one day, they should not lose the ability to communicate with their PDA-phone.


Identity based cryptosystems allow any publicly known identifier, such as an E-mail address or the IP address of a node, to function as the public key part of a public/private key pair.

basically any bit string may act as a public key.


The current IP datagrams do not carry any information about the corresponding applications, and hence our implementation uses the port number as well as UDP packet type to classify a RT frame.

the device driver is provided the specific port number information of the real-time application in consideration.


In both of these problems, only atomic jobs are considered.

thegoalisto assign eachjobto exactly one ofthe machines such that the makespanis minimized.


If the proposed procedure is used to build the radiomap, 12,000 measurements per minute can be obtained (one measurement per each 5 msec preamble).

one measurement can be obtained while driving 2.2 cm if the wardriving is done at 16 km/hour.


Our second result, (in Section 5.3), shows that TCP converges quickly to the allocations produced by EQUI.

it bounds the total time that a job is not getting its fair share to being at most a few adjustment periods at the beginning and the end of each job.


Ourgoal wasto utilizethe already existing body of monitoring software(i.e., existing linuxpackages) to the fullest extent possible so as not to reinvent the wheel and to be able to easily keep up with changes.

we used existing SNMP software to collect information about nodes in the network and the activity on their links.


EXPERIMENTAL METHODOLODY  4.1 Polymorphism via Encryption Schemes For polymorphic worms that scan expeditiously, we will initially assume in our experiments that each infective will either cycle through a fixed and relatively small number of completely different malware cipher images pre-computed with a different kind of encryption for each, or a different malware cipher per scan (e.g., using a key dependent on the destination address); but for this latter case, common decryption code in plain text will be present (and prevalent ) in all payloads (in addition to the explicit code, of course [2]).

we assume that in one of these two ways content will be prevalent in the worm s packetpayloads.