Copyright &#169; 2009 ACM 978-1-60558-5697/09/06...$5.00  1.INTRODUCTION Research and standardization activity has been accomplished at international level in order to define modern, interoperable communications and networking standards for emergency response and public safety.

in Europe, the ETSI Recommendation TS 102 181 recognizes the importance of the "Location Services" in the EMTEL framework (Emergency Telecommunications ), which must "provide real-time information regarding the position of personnel or vehicles to a command point" .


That is, r consecutive time instants (sweeps) are considered.

the 2-D LAD method combines r consecutive LAD (or LAD ACC) results in the time domain.


The information arriving at any user is stored locally, along with tags indicating the simple path it came from.

the simple path contains the users through which the recommendation has traveled.


In the second trail of experiment, three persons take turns to roam in the academic building.

during periods 1, 2, and 3 in Figure 20, they roam in the of.ce area, the class room area, and the laboratory, respectively.


As shown in the example, the proposed area partition gives tight lower and upper bounds for each subarea.

for a subarea Au with DiB (p) = Du[Mu] where p .Au,we have U[hu i (Au i (Au) - 1] ,p .Au , (13) )] = UiB (p) = U[hu where hu i (Au) denotes the index of the outer circle (centered at , hu node i), and hu i (Au) = Mu.


Without loss of generality, we assume that, the task C originates at its source s E V at slot 0.

since we consider the case where there is only one task, we have Ws 0 = W , and Vi E V  {s}, W 0 = 0. i The completion time T , also called the makespan, is de.ned as the time di.erence between the origin time, i.e., slot 0, and the .nish time, i.e., the time point when all nodes .nish their respective workload that belongs to C. T = min t, subject to Wi t = 0, Vi E V .


it consists of four phases: initialization, authentication elements generation, packets validation and temporal keys renewal.


3.3.2 Fetching video packets from multi-layer encoder Since stream media prefers a smooth flow of packets to bursts of packets in the transmission, the multi-path distributor periodically fetches and sends packets from the application buffer.

the video stream is transmitted at the maximum rate among all paths with evenly spaced interval between adjacent packets.


The kth moment of a packet t stream is de.ned as: = v k where vi is the value Mk ii , (e.g., RTT) of the ith packet in a stream.

tt t the moments M0 = vi 0 = 1 and M1(v) = vi give ii i the number of packets and the sum of such values in all the packets in the stream, respectively.


Therefore, we will call such networks asymmetric networks.In this work we determine the e.ects of the relation of nand m,asexpressedin(3), onthe performance ofasymmetric networks.

we de.ne the capacity C(n) of the network as the supremum of all rates .


Leguay et al.point out that users mobility pattern is not uniformly random but canbe often characterizedbypower-law distributions [19].

a user visits few places frequently with long stay while visiting other places rarely with short stay.


As we collect more data from the live network, we will explore these similarities and differences in more detail.

the ongoing collection of data will allow is to project long-term growth trends.


To infer the structure of a VPN and to achieve e.ciencies through adaptive provisioning, we need to examine the way customer endpoints communicate with each other.

we need good estimates of the VPN tra.c matrix.


Singh and Liu [25] present a secure and anonymous protocol (TrustMe) for trust management in decentralized peer-to-peer networks, which provides anonymity protection for trusted hosts.

it allows a user to issue a query message for a trust value, and at the same time, the user can obtain the true trust value in the presence of malicious users.


In our model, the level of granularity of the time window to learn usersS.behavior is days of a week.

our model produces users movement model for each day of a week.


Another way to understand these results is to consider that many queueing systems are regenerative when the system is empty.

the ends of busy periods form renewal points.


For example, the following HTTP headers cache the spoofed response for a day, and impede the browsers from refreshing the page: Last-Modified: today Cache-Control: public Expires: tomorrow Mallory can poison the web-cache with spoofed pages that users will receive when they access the (poisoned) websites.

this allows Mallory to cache spoofed login pages, i.e., a persistent phishing exploit.


Inother words, we assign an inside host i to the inside host group p associated with the largest (nonzero) Rip value.

if all Rip s are zero, then host i is not assigned to any inside host group.


A tree of cliques can be viewed as a tree, whose nodes can also be replaced by cliques.


Flooding Attacks by Exploiting Persistent Forwarding Loops Jianhong Xia, Lixin Gao, Teng Fei University of Massachusetts at Amherst {jxia, lgao, tfei}@ecs.umass.edu ABSTRACT In this paper, we present .ooding attacks that exploit routing anomalies in the Internet.

we focus on routing anomalies introduced by persistent forwarding loops.


Our results show that Nemo has satisfactory measurement .delity under a range of operating conditions.

nemo yields a dynamic measurement range from 0.8 uA to 200 mA, a sampling rate of 8 KHz, and a minimum resolution of 0.013 uA, while only incurring an average measurement error of 1.34%.


2.3.2 Batching Far greater throughput gains can be achieved if the network is designed from the ground up to leverage overhearing.

both ExOR [6] and the more recent MORE [8] de.ne new, bulktransfer transport protocols that leverage overhearing to dramatically increase goodput.


The method also enjoys from the bene.ts of step-wise deployment.

a subset of the ASes that deploys the method enjoys the bene.ts and is able to provide its member ASes spoof-less tra.c between their customers, even if other ASes have not yet joined SPM.


If both, then can you quantify the fraction of pipe vs. uniform tunnels?

the fraction of paths that according to the classifier appear to be going through an MPLS tunnel, but don't have the ICMP MPLS information?


The di.culty of course for making any statement about the potential of SPTs is that the quality of the outcome of all proposed approximations is a function of both the aggregation tree as well as of the second stage, i.e., of the schedule construction heuristic (given an aggregation tree).

it has been unclear whether the SPT alone or the subsequent scheduling phase is to be blamed when ine.cient schedules are produced.


In order to avoid the interference from hidden nodes, nodes hidden from each other should access the channel at di.erent times.

the safety interval should be shared by nodes within the same contention domain as well as nodes hidden from them, because hidden nodes may also transmit their beacons in the safety interval.


Of all these messages, the Link State Update (LSU) packet is used to carry the routing information.

four kinds of Link State Advertisements (LSAs) used in the calculation of intra-domain routes are de.ned in the LSU packet.


However, this does not mean that all .ow setups should be mediated by a central controller.

we argue that micro.ows (a micro.ow is equivalent to a speci.c end-toend connection) can be divided into three broad categories: security-sensitive .ows, which must be handled centrally to maintain security properties; signi.cant .ows, which should be handled centrally to maintain global QoS and congestion properties; and normal .ows, whose setup can be devolved to individual switches.


A weight of 0 indicates that no packets shouldbe marked,while thevalues 1 through 15 represent a uniformly decreasing value of the threshold.

a value of 1 indicates a high threshold with highpossibilityof congestion spreading, causedbyPort VLs moving into the congestion state too late.


Because this key renewal process mainly relies on the non-compromised keys, the decrease of the non-compromised keys (that is, the increase of the compromised sensors) threatens the security of the renewal mechanism.

if the number of compromised sensors increases, neighboring compromised sensors can reveal the renewal process by colluding with each other.


In a .owcontentiongraph,avertexindicatesaMAC .owand two vertices are linked with an edge when the two corresponding MAC .ows mutually interfere with each other.

these two MAC .ows cannot be active transmitting simultaneously.


Messages do not need to be sent to calculate weights and so scheduling decisions can be completely decomposed between independently functioning components.

if S and J can be split into independent compo .


If, however, both nodes are mobile, there is a danger that both could move at the same time, and the signaling updating the address to HIT mappings could be lost.

if both move within the round trip time for the signaling, the signaling is sent to the old subnets for the two mobile nodes rather than to the new.


3.1.3 Integrating the Request Router into the Web In order to remain backwards compatible with existing web entities, the RLS is a loosely coupled system.

the system provides a mechanism for resource owners to ensure that links to their resource persist, rather than automatically maintaining link integrity for all existing links on the web [7].


For example, because of the similarities between cluster and hybrid networks, the wireless nodes can use for their communication the scheme that was developed in Section 4, for proving the lower bound of (7).

wireless nodes do not transmit to each other, but rather transmit directly to an access point near by.


We wish to point out that RADION is modular.

depending on the context and the objectives, different resource allocation solutions can be easily incorporated within the RADION framework.


Subnet centric probing is used for stub networks that have a limited number of ingress points whereas vantage point spreading is designed for exploring path diversity of transit networks that have many peering points but not many internal subnets.

we do not need to perform subnet centric probing per vantage point; we can use the same set of probes to accomplish both objectives, by independently choosing their source and destination addresses.


Finally, we have added a paragraph to the conclusion section, discussing some of the interesting avenues for future work.

besides the analysis of 3G/4G cellular networks, we have left the assessment of the impact on our results if we consider measurements of different devices, time-of-day effects and the comparison with other streaming services as future analysis.


Basically the fail of a local peer will be handled by the sector s SP.

on detecting a failed LP, the discoverer (either an LP or an SP) will send a message to the SP of the failed node.


In order to study the delivery rates of proposed communication protocol, an addition .eld experiment was run.

we wished to quantitatively evaluate how a full mobile network would perform when nodes were mounted on moving objects.


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

for any point x E R dp (x) denotes the minimum Euclidean length of an open curve 1 C R with one endpoint being p, the other x.


between the statistical orthogonality between RONS channels and the number of RONS channels that the system can a.ord, since more RONS channels will make the channel-guessing attacker more di.cult to make a correct guess.

we allow that the inter-RONS-channel correlation to be as great as t when selecting RONS channels.


However, the question which immediately arises is whether the stationarypoints of the Lagrangian correspond to global minima of the function Ge(u, s) for some .xed u > 0.

the question is whether the stationary points of the Lagrangian (which are Karush-Kuhn points of (18)) are necessary and su.cient for the sought optimum.


Closer examination however, reveals that the system of LDPL equations is scale, translation, rotation and re.ection invariant (we do not include the proof due to space constraints).

a solution to LDPL equations will yield locations that are a scaled, translated, rotated and/or re.ected version of the true locations.


A passive adversary only eavesdrops conversations on the network, while an active adversary (or Byzantine adversary) is an adversary with unlimited computational power who can control internal nodes.

an active adversary will not only listen to the traffics through the controlled nodes, but also can mount a physical attack on nodes after they are deployed and retrieve secret information from their memory.


Thus, SC-FDMA is regarded as an alternative to OFDMA which suffers from high PAPR.

sC-FDMA has a merit in terms of transmit power efficiency in uplink system.


(N, K) <, (14) 2.2 c 4 for any positive .nite number c4.

per node throughput cannot reach to T(1) as N .8.


Congestion Quota: If we assume legitimate users have limited traf.cdemand while attackers aim topersistently congest abottlenecklink,wecanfurtherweaken aDoS .ooding attackbyimposing a congestionquota, anideaborrowedfrom re-ECN[9].

an access router only allows a host to send a limited amount of congestiontraf.c through abottlenecklink withinaperiod of time.


Alternatively, it has the length of a collided transmission Tc or, when the node is in backo., it has the length s. In [7] the saturation throughput is calculated using renewal theory arguments.

because in a singlehop network all the nodes view the same channel state, the instants of time right after the end of a transmission are renewal points, so it is su.cient to analyze a single renewal interval (which is the variable slot) for the derivation of the saturation throughput.


As we are looking into economic e.ects of Twitter Account Markets, we only consider markets advertised by at least 1,000 tweets.

we assume that the impact of smaller markets on the overall Twitter Account Markets is negligible.


This flexibility, however, comes even with the PFGS codec with some compression inefficiencies.

for transmission at a low bit rate (say around 1 Mbps) the video could be coded (with the PFGS codec) much more efficiently by employing an enhancement layer encoding bit rate in the vicinity of the transmission bit rate.


Similarly, Ei is the expected number of nodes (calculated based on our analytical model), which are infected within the ith time interval.

we choose the k-1 integers t1, t2 , , tk .1 to partition the time interval [0, .


Hence, we are interested in developing ways for Platypus routers to cache forwarding directives for traf.c .ows.

we are optimistic that we can harness the existing MPLS [29] label swapping support in deployed routers to implement a great deal of the Platypus forwarding functionality.


Statistical analysis shows that client-server connections and tra.c .ows exhibit heavy-tailed probability distributions lacking any typical scale.

the absence of an intrinsic average in some of the distributions implies the absence of a prototypical scale appropriate for server design, Web-centric network design, or tra.c modeling.


What nodes must be connected to each controller?

we want to explore solutions to the FTCP problem.


A possible solution for this problem is to vote when in doubt.

a broadcasts an ASK message to request for votes or viewpoints of other neighbors on Y s behaviors.


The transition probability matrix for Rx state is given that the battery, on entering Rx state with a nominal caby Rx = Recnk .

pacity of i leaves Rx state, after spending nk basic time T  units with a nominal capacity of j.


The cryptosystem is implemented as an individual class and it provides algorithms for key management and exchange, encryption/decryption, as well as homomorphic operations.

the Paillier cryptosystem was implemented following the original description in [28].


It therefore enables sensors to locally predict their current readings knowing both their own past readings and the current readings of their neighbors.

sensors are aware of their context (the neighborhood and history).


RECOVERY EVENTS In this section, we investigate the end-to-end path performance during recovery events.

we focus on those events which result in end-to-end path changes, i.e., the probe host chooses the restored provider when routes through both providers are available.


Reliability measures whether the routing information that is disseminated between routers re.ects the connectivity in the underlying topology.

it measures whether the paths that each router knows create a connected graph in the underlying topology, even when links or nodes in the underlying topology fail.


In particu- lar, we show that each new shortest path after k edge failure can be represented as a concatenation of k q- 1 original short- est paths if the network is unweighted, and an interleaving of k + 1 original shortest paths and k edges in the weighted case.

if a base set of LSP's are provisioned in the network that includes all-pairs shortest paths, then ev- ery path can be restored after a single edge failure with the concatenation of at most two or three basic LSP's.


While simple, the Mod comes with a big drawback: in the worst-case, a packet may have to travel far before reaching its destination d.  3.2 The Depth-First Algorithm There exist algorithms that ensure connectivity with shorter paths.

forwarding a packet pkt to its destination d in the unknown graph G ' can be seen as a graph search problem.


Since it seems inevitable to drop packets in real-world networks, approximation analysis framework, which avoids any assumptions on the input sequence and compares the performance of algorithms to the optimal solution, has been adopted recently for studying throughput maximization problems.

competitive analysis has been applied lately to investigate online routing algorithms.


Some prior work exists that gives insight into bit error distributions within frames for 802.11 networks.

[15] analyzes an industrial 802.11b setup.


simple subset dynamic sector pooling pooling programming Example 1 0.001851 0.002894 0.005480 Example 2 0.005964 0.005964 0.006177 We make the observation that the dynamic programming bound is determined assuming that the traffic vector for each call class is known.

the optimal policy assumes knowledge of the traffic vector.


The majority of the cases are due to the tra.c engineering practice for controlling incoming tra.c.

an AS may announce its pre.xes only to a subset of its direct providers, or to its direct providers with a community tag indicating that the pre.xes should not be announced further.


At a very high level, our .ndings can be summarized as follows: Component-based analysis: When comparing DHT algorithms we advocate analyzing the component design decisions separately rather than comparing DHTs as black-boxes or turn-key systems.

this requires separating systems-level design decisions, which usually are independent of the routing, from routinglevel design decisions.


During each time window p of video stream s, at each receiver of stream s, one buffer is being .lled while the other one is being drained.

the mobile receivers use one buffer for receiving data and the other one for decoding data and the uses of the buffers are exchanged when the next time window p +1 starts.


Therefore, if the bot-edge probability of a P2P bot = ln m net is pem , then the dye-pumping algorithm potentially identi.es all other P2P bots from a given seed bot with high probability as long as there are more than m bots in the network.

it gets easier for the proposed method to reveal P2P bots as the botmaster infects more hosts in the network.


If we assume, however, that our edge-detection algorithm is rep- resentative of one sort of filtering operation, we do know the time it took to execute that operation.

on our client laptop we measured # -236msec (30) o~cS c If this computation represents the time needed for filtering data that arrived over t = 10 seconds, for example, Equa- tion 19 tells us that m/n < ~cs~t (31)# = 10/0.236 (32) = 40 (33) about 40 tasks per client, for an arbitrary number of clients n. Of course, the client machine should reserve some power for consuming the data after filtering, so it should not run anywhere close to 40 such tasks.


1(a), but in this case node X is a stealth node and all other nodes depicted are service nodes.

the reader should note that the node used as bootstrap node should be a service node.


In the agent case, data filtering happens on the server.

the server's time is a combination of the filtering costs plus the time spent initializing newly arrived agents: ~_.~m, co(D,F~j,Fij ) rtCi,~,t (3) TSA----E otsS s + ~sS----[- i=1 j=l If we know that the expected value of the computing complexity cij is p, then we can simplify and obtain a bound on the number of client tasks (agents), m. we assume that EO cij (D, F[j, F O) mp --(4) otsS s otSS s Now TSA < t, m# + rtC, n,t < t (5) ozs S s m <_ (asSS-rCinit) i (6) # Wireless network, Tw.


Note that we do not require these comparisons to appear in consecutive instructions, only in consecutive positions of the bu.er.

we do not require the program to perform a sequentialscan of thebu.erlookingfor the separator.


Instead of focusing on or defining one particular technology, it is more important to achieve agreement on usage and interpretation of interfaces and messages that can seamlessly bridge different standards or technologies.

one of the main aims of communication standardization for smart grids is ensuring interoperability between different system components rather than defining these components (meters, devices or protocols) [3].


We would like to move the nodes (i.e., change the position vectors r) in such a way that the second largest eigenvalue of the resulting matrix M(r)is reduced.

we want to move each node in the direction that produces the maximum decrease in the second largest eigenvalue of the matrix M(r).


In VA-TCP, when receiving a notification message from the mobile host, the corresponding host records the sequence number, say seq_num, of the last segment that has been sent before.

segments with sequence number lower than seq_num are sent from the old access network to the mobile host.


i<0} Hence the sum of the squared absolute values of the negative eigenvalues is bounded by the squared Frobenius norm of the (doubly-centered) error matrix ||BE||2 F , which is the sum of the (doubly-centered) squared errors.

the absolute value of any negative eigenvalue |.


Our study, performed over several weeks in networks on University of Wisconsin-Madison campus, provides a .rst benchmark of its kind for DHCP-enabled networks.

we present results of this performance study for two networks with contrasting administrative styles a small, tightly controlled network where each host is authenticated before being admitted into the network, and a larger loosely administered network where such tight central administration is di.cult for a variety of technical and non-technical reasons.


The right-hand side of (6), as the original ., could be regarded as a .xed value; therefore, the left-side of (6) should be as small as possible.

some schemes should be designed to make sure that less decrease on TBM and more increment on TA would be achieved.


In this work, we advocate that clients should not wait until they lose connectivity or experience poor performance to seek alternative APs.

the clients should be proactive, and not reactive to poor performance.


Note that the amplitude of the power decreases as d-2 , so, to have a difference of 6dB corresponds to be at double distance.

if the receiver node is at a distance d1 of the sender and d2 of the interferer, it will be able to successfully receive the packet of the .rst one only if d1 .


Overview The Clint interconnect uses physically separate networks to implement the bulk channel and the quick channel.

the channels use separate links as well as separate switches.


We also use the judgement e : T to mean that the declared type of e is T .

f(...): T when the return type of f is T .


5.3 Random Topologies Here, we consider random topologies which combine the previous e.ects.

we consider a scenario in which nodes are uniformly distributed in a circular arena with diameter of 1250 meters.


between the block size and the risk of decoding.

we cannot greedily increase K to maximize the system throughput under the hard deadline constraints, since the risk that some receivers cannot decode the packets, i.e., 1 - P (K, T ), also increases with K according to Lemma 2.1.


Another way to get at this would be if you can tell us how much better it makes the latency when the new mechanisms make a difference.

in the cases where they fire can you estimate how much lower the latency is?


ODMAC o.ers to the administrator a tool to control if the adjustment of the duty cycle will occur to the sensing or the relaying tasks of the node.

one of the parameters of ODMAC, named SP rob, de.nes the probability that if there is a need for an adjustment to the duty cycle, this will favor the sensing duty cycle.


Our evaluations using a preliminary prototype show that full-duplexing gives a median aggregate throughput gain of 84% without signi.cant loss in packet reception reliability.

the full-duplex prototype s performance is within 8% of an ideal full-duplex system.


PROOF OF THEOREM 2 Let us .rst show that a schedulable usage vector lies in the independent set polytope of the con.ict graph.

we want to show that the usage vector is a convex combination of independence vectors.


Therefore, more frames are transmitted in CFP; the CFP setup overhead effect is less obvious.

a longer CFP (longer superframe) amortizes the setup cost over more data frames, provided that the network traffic configuration is unchanged.


Let .pDpt qq be the optimal objective value in the optimization problem PRIMALpDptqq de.ned in (7).

there exists a non-negative combination of schedules in S such that ÿ ÿ a ss e Dptq, and a s .pDpt qq.


By using DNS to distribute keys, Platypus realizes caching, distributed authority, and failure resistance without having to build a separate key distribution infrastructure.

platypus key lookups are cacheable since requests are plain text and replies are encrypted under the capability master key for the requested capability.


We propose that the eNodeB assigns the PRBs only to those users (say, N<bth of them) who have bu.ered data less than a certain threshold, bth = µbmax (µ typically set to 0.75), and also admits N ' new users so long as the existing users are satis.ed.

additional PRBs are not assigned to a user if it has enough bu.ered data to playout.


In a comprehensive simulation study using ns-2 [8], we showed that TCP-AP achieves up to 84% more goodput than TCP NewReno and provides excellent fairness in almost all scenarios.

tCP-AP provides fair sharing of the available bandwidth, even when competing flows are not within each other s transmission range, but within each other s interference range, since the proposed algorithm relies on the end-to-end measurement of the interference experienced by a TCP connection.


This protocol would also be responsible for maintaining the current topology map that is then sent to all routers.

this protocol (1) collects tra.c data from the entire network to make powering-o.


Figure4 showshigh correlation(and anti-correlation) betweenthe mobility spanand applicationsthatpeopleaccess.

for the stationary users (number of basestations seen equals 1), music dominates.


We present our experience deploying Google s WAN, B4, using Software Defined Networking (SDN) principles and OpenFlow [31] to manage individual switches.

we discuss how we simultaneously support standard routing protocols and centralized Traffic Engineering (TE) as our first SDN application.


s paper but also removes the problems of the fixed parameters in the authentication message.

our improved scheme can achieve the property of a full anonymity.


The reason is that E2DCA allows a cautious usage of network resources, which enables low packet delays to be obtained also when the network load gets high.

e2DCA dynamically allocates the bandwidth to each virtual station by taking into account the actual needs of that station, as a consequence a bounded delay service can be provided to a large number of .ows simultaneously.


At no point during our tests did a user make an error in transferring the result indicated by ATD onto the devices being paired.

users were able to reliably transfer the one bit result ( accept or reject ) from the ATD to the devices being paired.


These results, however, were derived under the assumption that each node sends data as fast as it can.

thedesired sending rate of thenodeisassumed tobe1.


This argues for intelligent management of the infrastructure by the network protocol: a form of congestion avoidance is needed that is significantly different from congestion avoidance in traditional data networks.

the network protocol must balance the offered load to the network against the required accuracy at the observer.


This model can takeinto account thefact that thedelay ofpackets arrivingthroughdifferent Un may exhibit adistribution with,for instance, mean values chosen randomly.

we model the fact that the delays corresponding to differentpaths can have a givendistribution,possibly,forinstance, withadifferent mean.


In the other three cases, its application cannot provide any improvement.

the optimal strategy is to apply the default8 power/CCA settings.


These two metrics are critical in determining the delay and capacity of the network, as well as choosing various scheduling/forwarding algorithms.

the inter-meeting time of two nodes is a major component of the end-to-end delay in MANET [15, 13, 14, 31, 32, 33], as it denotes how long it takes to encounter the other mobile node to have any chance to relay/forward the data for communications.


If we apply the Proposition to a neighborhood of 100 nodes with a period tw = 1000 ms, the estimation error introduced by a measurement delay E = 1 ms is 0.101 T(- = -0.09).

1 + 0.101 with a measurement error of just 1 ms, the estimation error is 9%.


6.2.7 Understanding the Effects of Connection SetupDelay Although it appears from our results (particularly Figure 14) that some sources of delay are more signi.cant than others, we argue that they are highly dependent on one another.

had one source of delay not been present, the one following it would likely have taken its place.


This heuristic can be useful for wireless service providers to reclaim IP addresses.

we find that the session-inactivity period is between 30 to 45 seconds, which suggests that we may reclaim IP addresses more quickly than 90 seconds used in WAP.


From Figure 7(a) we observe that most of the points are well-below the diagonal.

the number of concurrent Web .ows far exceed the number of Web hosts concurrently contacted.


Energy Saving and Network Performance: a Trade-off Approach Carla Panarello Al.o Lombardo Giovanni Schembra Dipartimento di Ingegneria Dipartimento di Ingegneria Dipartimento di Ingegneria Informatica e delle Informatica e delle Informatica e delle Telecomunicazioni Telecomunicazioni Telecomunicazioni Università di Catania -Italy Università di Catania -Italy Università di Catania -Italy cpana@diit.unict.it alombard@diit.unict.it schembra@diit.unict.it Luca Chiaraviglio Marco Mellia Dipartimento di Elettronica Dipartimento di Elettronica Politecnico di Torino -Italy Politecnico di Torino -Italy luca.chiaraviglio@polito.it mellia@tlc.polito.it ABSTRACT Power consumption of the Information and Communication Technology sector (ICT) has recently become a key challenge.

actions to improve energy-e.ciency of Internet Service Providers (ISPs) are becoming imperative.


5 SIMULATION RESULTS We performed a number of simulations to assess the effectiveness of proposed solutions.

we compared the lifetime of a 2-level WSN with that of a flat network.


The worst-case for MIP is when the latency d(CN, HA) and d(HA, MN) in (5) are maximized.

both the CN and the MN are far away from the HA.


2 Not all tests were able to work with all hosts.

the dual connection test was ruled out due to non-monotonic IPID behavior from 8 hosts (fikely due to transparent load balancers) and a constant IPID value of 0 from another 9 hosts (likely running Linux 2.4).


8 7 A major difference between our approach and CRC HOLSRis thatwe use onlyHNA messages for both inter-clusterand intra cluster topology dissemination, while hierarchical TC messages are used for inter-cluster topology dissemination in CRC HOLSR.

no modificationsto HELLO and TC messages, or MPR selection, are foreseen with our approach.


Similarly, when there are topology changes that result in the additions of edges and/or vertices from the graph G in our model (e.g., due to the establishment of a new AS or a new BGP peering relationship), we note that our proof of Theorem 3.3 still holds for the new routing instance after the topology changes, as long as they do not violate the topology and export conditions.

the new vertices and/or edges do not create customer-provider cycles and they follow the export only customer routes to peer or provider export policy.


Weakest-link security game: Theoverall protectionlevel depends on the minimum contribution offered over all entities.

we have H(ei,e-i) = min(ei,e-i), and Eqn.


Therefore, Wi.-Reports cate gorizes reports based on these three channel conditions.

clients measure the median SNR of beacons sent by their AP.


This occurs when the additional experiments reveal no new surprises, in the sense that the probabilities of the various outcomes of an experiment converge to a fixed point.

the formulation of marginal utility given in equation 6 assumes that the evaluation of marginal utility is done in an online fashion, we evaluate the marginal utility of experiment S before conducting any additional experiments Sk, Ic > n. An alternative formulation of marginal utility evaluates each experiment on an ex post facto basis, measuring each experiment s usefulness offline after all experiments have been conducted.


That is, the utility can be divided in any manner among the coalition members.

the value (or utility) can be represented by monetary value that the members of the coalition can distributed among themselves by using an appropriate (fairness) rule.


However, we use e-mail as a basis of messaging and our approach enables users to establish a seamless integration of wearable computing environment and telecommunication systems with traditional computing environment.

we can include billions of cellular phone users.


However, we examined the data to .lter out hosts that might be biased by the measurement setup.

we noticed that as a source sendsalong sequenceofpingsto varioushosts, asuf.x of this sequence sometimes receives no responses.


For allocations prior to that date, we assume they were completely recorded in the allocation history statistical .le 20010501.

no IPv4 addresses were returned to APNIC before May 2001.


To address the problems, new botnet variations emerged that follow a distributed communication approach [3].

because legitimate peer-to-peer systems are already wide-spread, it is straightforward to abuse these existing applications.


4.1.3 Affected area The affected area of a transmission in wireless multihop network is not a new concept.

for each packet transmission, there is a ceased area, in which all nodes but the transmitter should keep silent, in order to render the transmission successful.


The multicast members are independent of the source address.

any node, whether a member of the multicast group or not, can send a multicast message to the group.


Moreover, we note that, for both scenarios, there is no di.erence in the solutions of local search for B ' = 15% and B ' = 100%.

local search is not able to improve its solution further even if more budget is made available, because the algorithm reaches already a local optimum for B ' = 15%.


It also becomes an acting supplier when data is received.

from the view of the original requesting node, the relaying node is the supplier, and from the view of the In addition, each relay node contains a buffer that stores each relaying segment with a timeout (see next subsection).


According to the aforementioned two properties, the number of reconstructed subtrees does not exceed three in each round and a proxy node with lower tree level has the higher priority to execute tree reconstruction.

only a proxy node with lowest tree level will select a share point to connect a source in its sub-tree and the other two sources in different sub-trees or the same sub-tree in each round.


Second, we seek to optimize our implementation of network coding.

we test two implementation approaches: pure Java and native code.


In this regard, the SDPP module at the local host can coordinate communications with remote DAs by controlling SLPv2 through the use of APIs.

sDPP can instruct SLPv2 to issue the corresponding signals for service (de-)registration (SRV_REG/DEREG) as needed, in addition to those required to discover the presence of other DAs, as explained shortly.


By the de.nition of D(s, r), all disks in the second subset cannot intersect any lines, with level 1, of the (r, s)-shifting subdivision.

each disk in the second subset is contained inside some 1square.


Summary of measurements We exhibited a correlation between network topology and content availability.

more centralized topologies such as eDonkey result in faster query response times, and higher temporal stability of the content available to a client.


where E¯H (n)[ .u(n) 2] " lim supn EH (n)[ .u(n) 2].

it then follows from the conditions on sn in (12) and the boundedness of .u(n) that m {} lim Pr sup sn .u(n) = E=0, .E> 0. m.8 n=n0+1 the accumulated distance deviating from u (n0 + 1) is almost surely less than E. It then follows that the trajectory resides in B3E with probability one.


CONCLUSION As cloud-based services transition from marketing vaporware to real, deployed systems, the demands on traditional Web-hosting and Internet service providers are likely to shift dramatically.

current models of resource provisioning and accounting lack the .exibility to effectively support the dynamic composition and rapidly shifting load enabled by the software as a service paradigm.


These results show the bene.ts of the Bi-MCMAC protocol for both intra-.ow and inter-.ow contention.

the Bi-MCMAC protocol better exploits a high degree of TCP connection multiplexing on the network.


Our TCP injection technique is independent of the victim s operating system, and allows the attacker to bypass the browser s same origin policy (SOP) defense [5, 28, 36].

this allows injection of web-pages and scripts in the context of a thirdparty web-server, and can be exploited for cross-site scripting (XSS), cross-site request forgery (CSRF) and phishing attacks without relying on a vulnerability in the web-server.


Senders can be closer to ri creating more interference.

there can be senders in sectors of layers 1 and 2.


It will put its own neighbors information into RREQ (RREQ_I) to displace the neighbors information of S besides of the operation described in above paragraph and then rebroadcast this RREQ (RREQ_I) message to other MNs.

else if M doesn t find its information in the message, it will conclude that S can arrive at it but it can t reach S. the link between them is a unidirectional link.


1(b), is basically similar to that of the mesh topology, except that for every layer the number of vertical channels has been reduced by sharing a vertical bus among routers of each cluster.

even preserving the advantage of the mesh on each layer, CMIT diminishes the number of inter-layer interconnections to meet constraints on the number of TSVs.


Though information is not strictly additive, the  sum of individual informationI(vk) can often be considered as a reasonable approximation of I(v1, ··· ,vT )in cases where the belief state varies slowly.

one can show that, with mutual information as the information metric (2), the former is an upper bound of the latter.


We caution that the bene.ts of our scheme depend on several practical factors.

it depends on the agreement between neighboring networks to participate in the scheme and share more information than they currently do.


Methods for e.cient detection of lines in images are available in the image processing literature, and these are reused in our work to compute wavefront detection metrics.

the Radon transform e.ciently integrates a 2D function (image) along straight lines, producing Figure 2b from the delay-depth image shown in Figure 2a.


Now, a linear regression minimizes the least squares error (i.e., the variance of the data set compared to the computed line), yielding the maximum likelihood estimation.

it is at least as good as any scheme, in particular the following one.


To this end, we would like to "stage" the re-profiling task in two steps: (i) to understand what observations could trigger the re-profiling so no unnecessary re-profiling is performed and (ii) to determine a possible small subset of loca-tions that, upon being re-profiled, result in improved localization.

we imply a semi-automatic process whereby the task (i) is performed automatically and then a set of points to-be-re-profiled is prepared (again automatically) and provided to either human operators to conduct the task (ii) or, even, with an operator in the loop, choices for points to re-profile are given and acted upon.


However, while the antenna hardware itself will soon be ready for the deployment at mobile stations, existing higher layer protocols may not be able to fully exploit the potentials of directional antennas.

recent studies on the use of directional antennas in mobile ad hoc networks, or MANETs, have shown significant increase in network capacity by improving the spatial reuse, but effective extension of communication range has not been successfully demonstrated, which is another benefit of directional antennas in the cellular networks.


The publisher owns the content and can choose the means in which peers participate in the system (via proprietary software).

the publisher can freely design a game and enforce the rules of the game.


The .rst case indicates good tra.c conditions and the latter one signals serious congestion.

it is di.cult to quantify a level of congestion or infer congestion solely based on bu.er occupancy.


While performing such mirroring is one option, the proposed super-aggregation technique relies on a simple connection set-up replay for mirroring the TCP connection.

the sequence of messages exchanged since the set-up of the original connection is replayed in order to mirror the original TCP connection.


This approach is computationally e.cient as it only involves applications of a shortest-path algorithm.

moreover, it is also energy e.cient as we observed in Section V. the LD-ESP algorithm, which .nds energy e.cient link-disjoint paths sequentially, performed very close to the optimal algorithm.


We assume that network links are bidirectional.

if node A is able to transmit to node B, then B is also able to transmit to A.


We believe, then, that the Internet latency expansion more closely resembles a power-law.

the router-level graph looks more mesh -like when the distances of links are considered.


Since network tra.c might have dependencies and/or correlation from time to time, and from size to size, in each round of measurements, we randomize the sequence of con.gurations.

we randomize the order of .le sizes, carriers, the choices of congestion controllers, single-path and multi-path TCP.


Figure 6 (a) also implies that the number of routing groups is not a signi.cant factor of the routing overhead.

the variation of stretch due to the increase of routing group number is very insigni.cant.


Qualnet simulation allows us to fur-ther examine the power saving contribution from these two bene-fits.

we first keep the transmit power reduction capability of BeamAdapt only by assuming an omni directional pattern, and then the interference reduction capability only by assuming a beamforming gain of zero.


Therefore, we say that the super node SN (u) is self-connected.

we know from line 7 of Algorithm 4 that s is connected to SN (s).


= 12 cm and we set RSe to be -116 dBm, we calculate dmin = 2.5 cm.

in order for the eavesdropper to overhear shielded messages, he must be within 2.5 cm of the keying device.


In this case, the middleware can directly manage context information monitoring, adaptation, and handoffs, offering simpler ready-to-use abstractions.

the paper considers and discusses the case of a multimedia streaming domain-specific facility.


Our research and observations have shown that functionality and control only increase in granularity with each new evolution.

we later examine Cisco s Embedded Event Manager and Tool Command Line scripting features, .rst introduced to the Catalyst family of switches, with the Cisco 3560 MLS using IOS version 12.2-(55)SE.


2.1.4 Application-level Proxies The network could include application-level proxies, whether for performance reasons (e.g., caching) or for security reasons (e.g., URL blocking).

hTTP caching proxies are often employed for web accesses.


As a result, we had to identify the necessary requests triggering the information we were interested on by adding hooks on RILJ.

we are interested in logging RNC states, which are obtained through the code *#*#0011#*#*.


In this paper we step back from the mechanistic details and focus only on the area where the these approaches have a fundamental difference: naming.

some designs adopt a hierarchical, humanreadable names, whereas others use self-certifying names.


We repeated the above procedure (initial measurements for calibration) on a different day and we observed that FS did not completely isolate cells as before.

we observed that: (i) After the convergence of the FS algorithm, the access points AP31 and AP48, (which are in close proximity) selected the same channel (5.32 GHz); (ii) AP50 had 2 more clients than AP31; (iii) AP48 had 4 clients and the RSSI from its farthest client, 40-48, was at 69 dBm, while the RSSI for the AP-AP link 48-31 was at -70 dBm.


more bandwidth allocation should not lead to degraded application performance.


We present the results of a real MAR implementation and quantify the performance of MAR for di.erent protocols and applications in a variety of scenarios.

we show how MAR is able to signi.cantly improve end-user experience for Web browsing and streaming applications in highly mobile environments.


The reference locality refers to the fact that a request to an object is likely to trigger subsequent requests from the same geographical neighborhood (i.e., spatial locality) in the near future (i.e., temporal locality).

object references are localized in both space and time.


PROBLEM FORMULATION AND IMPLEMENTATION 2.1 Nonlinear functions selection For this study nonlinear functions were selected of nd rd 2and 3order with saddle points, which offers sufficient challenge for achieving approximation via 3-in-1-out MLP geometry.

the first function was the standard saddle surface or hyperbolic paraboloid z=x 2-y 2, shown in Fig.


We therefore introduce a more effective coloring heuristic.

if we color sub-tries sequentially, at each coloring step we want to exploit the information about the current status of the color distribution.


We design a novel hierarchical authentication structure to signi.cantly reduce authentication and communication overheads.

wIC wisely utilize all minimum order statistics of this data structure to obtain much more accurate counterfeits estimate, compared with previous metho ds.


As a result, the input ia seen by host A may not cause the post-condition to be satis.ed.

it may be that q(P(sb,ia)) = F. In Example 1, the original input ia will have incorrect values for the cookie and hostname protocol .elds, assuming that state sb speci.es a different cookie and hostname.


We also assume that the unit time frame is 5ms and 1000 time frames are observed in each simulation run.

the total time period of each simulation run is 5 seconds and the simulation results are derived by averaging the results from 1000 simulation runs.


Names provide routers with information about the forwarded content, which enables functionalities, such as caching or multicasting, as network-layer primitives.

the use of hierarchical names [4] also allows ef.cient route aggregation and makes mechanisms to translate content names into IP addresses unnecessary.


For example, the top 4% use 75% of the total inbound tra.c, and 60% of the outbound.

a small group of heavy-hitters represent a signi.cant part of the total tra.c.


Instead, the edge costs are calculated on-demand, by A j--At precalculating the partial sums, Ai.

c~,j = ~,+~ 116 B(Mbits/sec) 6 I l I I 5.5-% , FUSS (peak:4.68Mbitslsec,avg:O.68Mbits/sec) 5- 4.5 ' TV_I (peak:5.73Mbits/sec,avg:O.61Mbits/sec) 4 3.5 I ± ~'-.


We also note that not all events require scheduling decisions.

timed events such as state expirations are implicitly associated with the thread that generated the timer.


3.2 Analyzing the Loss Conditioned Delay We are interested in learning if the tcpRTT sample prior to loss (or perhaps the average of some small number of tcpRTT samples prior to loss) is greater than a smoothed average of preceding tcpRTT samples.

we want to know how frequently loss events in a connection might have been predicted by monitoring R'VI'.


Strategies tested: Twelve encryption policies are tested; they consist of all possible combinations of three different encryption algorithms and four modes of packet encryption.

the three symmetric key encryption algorithms that are considered are the AES128, AES256 [31] and 3DES [12].


Although a number of Stat4 targets involved in Th1 cell development and T cell receptor signaling was characterized by Good et al, this study pointed to a large proportion of genes that showed lack of consistency between Stat4 binding and induction of target gene expression [5].

a strongly binding target gene regulatory sequence did not necessarily induce high levels of target gene expression and conversely a weak binder did not always show poor expression.


EM-MAC achieves high energy ef.ciency by enabling senders to accurately predict the wake-up channel and wake-up time of a receiver.

each time a node using EM-MAC wakes up, it independently selects its own wake-up time and channel according to a pseudorandom function, while avoiding undesirable channels on which it has detected high traf.c loads or excessive wireless interference, including channels being actively jammed.


Now each row has an associated sampling stage, which is also implemented using pseudo-random hashing to coordinate measurement nodes, while the estimation procedure only needs to be modi.ed to be aware of the sampling rate that each cell has applied.

packet counts need to be inverted before deciding which LDS cell will be selected to produce a .nal estimate.


The maximum packet rate of a network can be determined starting from the maximum packet rate sustainable by its nodes and edges.

the maximum packet rate across an edge (say, e) is called its channel capacity (denoted by Ce) and is usually limited by the channel bandwidth.


Hence, while we contend that it may well be possible to evolve the data-oriented architectures so that they can be bootstrapped off from the current policy structure, we also note that the present policy-constrained inter-domain paths of the Internet are often not the shortest ones [22], or the ones with the best performance [20].

we surmise that the richer network service model, provided by the dataoriented network architectures, opens up the possibility of using more ef.cient policies, leading to better network utilization and lower costs; see Section 5.


When two signals interfere, their energies add up.

the energy is: E[|y[n]|2 ]= E[A2 + B2 + 2AB cos(.


This requirement is not impractical because SPIE hash functions do not require any cryptographic hardness properties.

it does not have to be dif.cult to generate a valid input packet given a particular hash value.


2.2 Attack Models In the design of unfair rating detectors, we focus on collaborative unfair ratings.

a group of raters provide unfairly high or low ratings to boost or downgrade the overall ratings of an object.


Given the matrices of the known initial positions of the G =1m/s) and current velocities are considered.

we consider 33 3 .s = 2000 kg/m , .g = 2500 kg/m , Vs =0.5 · 10-3 m , and Vg =10-3 m 3 to account for the common physical characteristics of underwater sensor nodes and uw-gateways, which re.ect into different sinking properties, as formalized in (11).


Notice that the tree metric T ' again dominates the original metric as we are only relaxing the edge weights.

the edge connecting a node on level i in T ' to 1 +1 -2j its parent has weight ai, with 2j1 -2j = ai < 2jby construction, where j is level i s corresponding level in T and j' is level (i +1) s corresponding level in T .


To reduce communication cost, one may use restricted .ooding to discover the closest available resource from each event.

the TTL of the .ooding messages from an event doubles until a resource is found.


In support of this effort, the Internet Engineering Task Force (IETF) recently speci.ed a number of protocols and adaptation layers that allow IPv6 to run over IEEE 802.15.4 link layers.

the 6LoW-PAN working group speci.ed header compression and fragmentation for IPv6 over IEEE 802.15.4 [16] and the IETF RoLL working group designed the RPL protocol as a proposed standard for IPv6 routing in low-power and lossy networks (LLNs) [21, 22].


once during a particular route discovery.

a router that was responsible router for one round of the expanding ring search, will not become one for all subsequent rounds (which it indicates by setting the T bit in its entry to 0).


In our model, content is generated in realtime in the form of blocks, with one block corresponding to a playout time called a frame.

each device must receive one block of data within one frame of time for smooth playout.


Just as source routing often needs to identify way-points that result in the most appropriate path to the destination, i3 also bene.ts from a topology discovery service.

i3 is designed mainly for the forwarding aspect of overlay routing, while our underlay architecture is designed to enable cost-effective topology discovery.


These attacks enable a party monitoring one (or more) paths used by  Figure 1: A scenario illustrating competing single-path TCP (SPTCP) and MPTCP connections MPTCP sub.ow(s) to infer properties of other paths.

such attacks can allow ISPs to infer sensitive and proprietary information (e.g., level of congestion, throughput, packet loss, round trip time) about their competitors [4].


We establish and experimentally verify an optical channel model for localization purpose.

we relate the distance to the received signal strength (RSS), explicitly considering the possibility that a light lamp might be dimmed in actual use (§2).


We use the term cost of anarchy to refer to an upper bound on the inef.ciency cost over all possible Nash networks.

the cost of anarchy is the worst possible inef.ciency cost experienced at Nash equilibrium taken over all the possible assignments of (g0, d, P B, P T ), as long as g0 .


In our setting, the two antennas do not operate simultaneously at any given time.

the USRP is con.gured as a half-duplex transceiver even though it has the capability of being a full-duplex device.


In the pipelined-lookup approach, a d-dimensional packet search is separated into d searches, which are further pipelined.

the d TCAM chips are chained together into a pipeline such that the search result of the i-th chip is part of the searchkey forthe(i +1)-st chip, and the result of the last chip isthedecisionforthepacket.


It does not need to go through switch allocation as EVCs are prioritized over NVCs and are thus able to gain automatic passage through the switch without any contention.

a packet traveling on a k-hop EVC traverses the next k - 1 nodes without having to go through the router pipeline.


The energy consumption of our scheme is low since it requires only cheap operations and the exchange of few, short messages.

the message for the sink is short compared to other schemes.


As more and more applications migrate to the Web and interact with the cloud, the latency of network protocol transactions is an increasingly important component of overall user response time.

this trend implies a growing importance of HTTP transaction latency, as HTTP is the dominant protocol for the mobile Web, RESTful APIs, and video streaming [3].


Unlike the case of mobile targets, if an arbitrary function h changes with time, local updates may not suf.ce.

the local update scheme works only when the function has certain local conservation properties, such as when a change of d in a face always causes a change -d in an adjacent face.


Thus, it cannot increase maxqi.Q pk i (c) by lying its cost.


However, CAPSAFE can also operate with other less direct optimization variables.

an improvement in link quality can also be converted to an improvement in node lifetime, assuming that the target network employs a minimum transmit power (MTP) protocol.


Flat names: The protocol should route on arbitrary node names which may have no relationship with a node s location.

this service should operate while preserving the stretch guarantee.


THE IMPACT OF ECN+ ON AQM PER-FORMANCE 4.1 AQM Algorithms While ECN+ is a generic extension to ECN that should improve the performance of all ECN-enabled AQM schemes, we necessarily limit our performance evaluation to a subset of AQM schemes.

we evaluate the impact of ECN+ on Random Early Detection (RED) [15], Random Exponential Marking (REM) [8], and Proportional Integrator (PI) [19].


In other words, i,j i,j Ei,j ' =1, if vi cannot send a message directly to vj ,otherwise E ' =0.

i,j We will show that ABEM is not secure in our model for security objective function FABEM .we present a con.guration conf andanadversary A,for which there doesn t exist any ideal-world adversary A ' ,such real,FABEM that Out is statistically indistinguishable from conf ,A ideal,FABEM Out .


when K< 1-1 1-log n where c =( m)mbm yy -log( ) cc and n ... 8 If we compare the results of Theorem 4 with Theorem 1, we notice that if K = D(log n) and n is su.ciently large, the performance of the greedy coloring algorithm is within a constant factor (roughly 2) away from the best possible value.

the maximum possible loss due to the use of the greedy coloring algorithm is bounded by a constant.


In this paper, we have addressed the problem of protecting the privacy of user preferences during the setup of multimedia communication sessions.

we have shown that the user s privacy can be breached if there is no restriction on what is exchanged during session initiation.


The traf.c load from ACi on each maximal clique is: zi =F yi =[zi1,zi2, ···,ziM ]T ,i =1, 2 (5) A new .ow can be accepted only when the total traf.c load on each maximal clique does not exceed the available capacity ci in that clique.

zi = .i ci, i =1, 2 (6) where 0<.i < 1and is a tunable parameter.


Optically routing a tra.c component will dedicate a wavelength on the two links it traverses to it, so this decision a.ects the decisions for other tra.c components.

after dedicating the wavelengths required for the tra.c components which must be routed optically for any source node, the remaining wavelengths must be su.cient to carry all other tra.c sourced by that node to the hub node.


Network performance analysis indicates that the critical impact due to the outdoor environment and node physical failures significantly reduced the network yield when longterm periods were considered.

it is found that an over-used routing path across the network was responsible for most of the packet retransmitted and dropped in ASWP.


geographical locations and spectrum bands) by various parties [2, 7, 3] have shown that spectrum utilization is quite low, and even in a crowded region more than half of the spectrum is unoccupied [17].

due to the static spectrum assignment, spectrum scarcity is experienced even if resources are available for use.


Video seconds with (a) 12 nodes at 10 m/s and (b) 18 nodes at 18 m/s Figure 7(a) shows the amount of received video in a scenario with 12 nodes moving with an average speed of 10 m/s.

it represents the accumulated seconds of video received by the client at every second of the experiment duration.


2.1 Wireless Transport Optimization We note that proxy-based transport optimization for lasthop wireless networks has a long history, with the majority of the research [4, 15] focusing on optimization of TCP over last-hop wireless networks.

[15] showed that while 3G network packet losses can indeed be successfully overcome by using ample link layer retransmissions, the resulting large RTT mean and variance may severely a.ect the performance of a TCP-like congestion avoidance rate control that is based on end-to-end observable statistics of RTT and PLR.


Intra-rack VM Migration and VDP Messages D. Topology for AMPP Extension In the AMPP extension, we forward VDP messages to an upper-level switch.

aMPP extension works in a topology like a tree structure where we can decide an uplink to which we forward VDP messages.


In all the experiments we consider three cache sizes K=0, 8, 16.

we do not consider greater cache sizes since we assume that sizes greater than some quite small percentage of the total number of items are not realistic this should be true for small portable devices.


Therefore, BlTl >BhTh is always true because the IVD of Ml is also lower than Mh.

the 3G module should always operates at Bl to achieve the MSD.


For l2, we repeat the same process we went through for l1.

either l2 prefers the two-edge su.x of l1 over any other feasible path (in which case we set e2 to be l1, and are done), or we move on to l3 (which is the .rst edge of l2 s most preferred path s two-edge su.x).


A number of approaches have been proposed to handle this problem by predicting the distance rather than measuring it directly.

the Global Network Positioning (GNP) approach has proved in.uential due its ability to produce high quality distance estimation [3].


In future work, we will study how to adapt our scheme to a mobile environment, that is, an environment in which every node moves around.

we will study the important issue of how to check the satisfaction of the retransmission rule under these conditions.


The tag is moved above one or multiple readers so that a motion label is assigned to every tag.

pattern recognition means classi.cation, which attempts to assign each input value to one of a given set of classes (i.e., line or circle).


Inparticular, for a binomial random variable X with mean µ = tp, it can be shown[14,pp.70] that: -µd2/2 P(X< (1- d)µ)<e ,0  ne.

substituting into(5) yields: -t ne ' [1-]2 P(W >t)= P(Xt =2ne)<e 4 P nNoting that W = i=1 Wi, where each Wi is geometrically distributed withparameter atleast1/e, itis easy to see that 4 P(W>t)= P(W ' >t)<e -n It is easy to see that the bound on the right hand side goes to 0 for large values of n. W = 2ne w.h.p.


All chunks that are created and published are known to all parties.

both users and adversaries are aware of the names of the target .les, the names of the cover text cover .les, and the size of the tuples used to create chunks (publishers create tuples up to a certain size).


Following the same principle, we can see how all of this applies for L3 handoffs as well.

in such environments, we will always deal with the same subnets and more importantly the number of L3 handoffs required is very much lower than the number of L2 handoffs.


4.3 Validation of Clique Assumption We now validate the clique assumption used in our analysis so far against results obtained using simulation of the Aloha-like algorithm in a wireless multi-hop network.

we demonstrate that the clique assumption yields a very good approximation when using the expected time to discover neighbors as the metric of interest.


Although a single load balancing enabled router may potentially damage the authenticity of all trace paths passing on it, the e.ect is not thesamefor tracenet because tracenet is based on the stable ingress router concept rather than stable path trace concept.

as long as two packets destined to two di.erent IP addresses on the same subnet enter into the subnet through the same ingress router we are not interested if they took the same path or not.


However, communication bandwidth in large clusters may become oversubscribed by a signi.cant factor depending on the communication patterns.

two nodes connected to the same physical switch may be able to communicate at full bandwidth (e.g., 1Gbps) but moving between switches, potentially across multiple levels in a hierarchy, may limit available bandwidth severely.


We can, however, a.ord to place corner turns between the wire segments whose switch connection are associated with the same endpoint node.

we have already guaranteed that we can distribute the switches in each row and column such that there are a constant number of switches associated with each leaf node.


This is the most ef.cient implementation of the client.

there is no redundant RTP code (unlike in the alternative approach described next).


A complaint regarding presentation: Imo, the paper overclaims.

the title talks about *practical* containment; I don t think that manual trial and error qualifies as practical.


However, there is currently no formal analysisthatquanti.esprecisely howthe servertraf.c behaves.

there are currently no answers to very basic questions such as: (1) How fast does the bandwidth available at the server has to grow as the number of usersincreases,(2) howdoesthetra.cloadimposed onindividual usersgrowasa functionof theuserpopulation,and (3)to what extend can we establish a tradeo.


In addition, 4.1 Network Model for Multi-Dimensional Re- X N Although the original network model introduced in Sec n=1 X Nn=1 sources (p,a) pnfa(v¯)= pnfa(vn), (14) tion 2.1 is de.ned using a one-dimensional resource measure, the remainder of the present paper uses a network model and equivalently that is de.ned using a multi-dimensional resource measure.

x Nn=1 pn the resource is de.ned as an I-dimensional vector (p,a) fa(v¯)= fa(vn), (15) PN m=1 as follows: Let N be a set of users who have to compete for pm the resources, where N denotes the cardinality of N .


If a polygon P intersects with its sponsors and is not ful ly sponsored, there must exist an intersection polygon inside P whose vertices are composed of the intersection points of P and its sponsors.

if we can identify an intersection point in polygon P adjoined to any area that belongs only to P, we can say that P is not fully sponsored.


It is worthwhile to point out that the wireless network model described above can be extended to include impatient time.

the calls in the waiting bu.er of cell j are not patient and each reneges after an exponentially distributed amount of time with mean 1/dj .


In this paper, we question whether this divide is suitable in every context.

we show that, for wireless networks, by poking a hole in this digital abstraction, i.e., by combining physical-layer and network-layer information we can substantially increase network capacity.


EMWIN can be applied to a broad area of mobile wireless network researches, such as protocol performance evaluation, and exploration of the dynamics and impact of specific network behaviors.

eMWIN provides a flexible and scalable environment for the emulation of multi-hop mobile ad hoc networks, which is difficult and even impossible with other emulators.


Therefore, the HCDD can avoid the increasing route-discovering overhead as the number of source nodes increases.

the HCDD is inherently scalable for the large-scale sensor networks.


Under the out-home condition in De.nition 7, before returning back to site 0, the conditional distribution of {1,..., N}(given that the node has not visited site 0) always remains the same.

in fact, when the graph G{0} (after removal of site 0 and all its edges from G)is non-bipartite [35], it out can be shown that tp0 is the stationary distribution of random walk on this resulting graph G{0}.if pi(t) is the probability that the node is at site i at time t,[p1(t),...,pN (t)] converges to tp out 0 under a conditioning event that the node never visits site 0.


Somewhat more distantly related to OFf are e.orts to verify that certain invariants hold.


An ultra metric embeds network hosts into a hierarchically separated tree, where distance between a pair of nodes depends on the closest common ancestor of the nodes.

all pairs of hosts with the same closest common ancestor have the same distance.


CONCLUSION In this paper, we proposed a new model of random temporal graphs that, for the .rst time, captures the correlation between successive connectivity graph, and provides insights on the interaction between node mobility, maximum delay and message size.

we have shown that, given a certain maximum delay and node mobility, message size has a major impact on the delivery ratio.


These anomalies might indicate malicious activity or massive scanning strategies.

for outgoing client data, points corresponding to a very large number of clientto-server connections (kout,c ) and a very low volume of outgoing tra.c (sout,c ) would imply some sort of scanning activity, for example, a project trying to estimate the density of Web servers in assigned IP space.


However, depending on the distance to the cluster head, joining may not always be possible.

a level-i cluster head must not join its cluster to a higher-level cluster if the head of the higher-level cluster is more than ri+1 hops away.


To guarantee the stability of the diamond relay network, the corresponding condition given in Qing, Pingyi and Khaled s work [4] has to be satis.ed.

u>u and D>d (15) Actually, this condition is a simpli.ed form under the condition that the average SNR of the four links are almost the same.


In addition, RSDA prioritized the importance of the monitored areas/cells over the sensors lifetime.

the algorithm does not take into consideration the number of messages that need to be sent from the sink to the nodes in the network.


Backward compatibility: the entire system should be backward compatible with hosts running Ethernet and IP.

existing data centers, which almost universally leverage commodity Ethernet and run IP, should be able to take advantage of the new interconnect architecture with no modi.cations.


During satellite signals that originate in the atmosphere and travel to the surface of Earth, global errors consisting of satellite clock errors, ephemeris errors, ionospheric delays, and tropospheric delays are generated.

the e.ect of global errors on receiver measurements varies from one geographical area to another.


Following once again our analogy with IP networks, we must be able to implement the equivalent of policies of the Border Gateway Protocol (BGP).

an autonomous system in a content-based network must be able to determine which messages are transmitted to other systems, and which messages are accepted from other systems for local delivery and/or for transit.


We claim this queue management scheme as interactive because of its parameter participation in proposed rate control algorithm.

knowledge of average queue length of each node has an enormous impact on controlling scheduling rate in the proposed scheme.


The second stage is in charge of the .nal analysis and storing the relevant information.

the privacy sensitive information is encrypted on per .ow basis by the .rst stage, so that the second stage cannot access any .ow without an appropriate key, which is given only when there is a strong reason to do so.


Figure 3 illustrates this conceptually by showing the expected performance and oracle requirements for each proposed routing algorithm: Contacts Summary Oracle This oracle can answer questions about aggregate statistics of the contacts.

the contacts summary oracle provides the average waiting time until the next contact for an edge.


Assuch,techniquessuch asWeb caching[6,13] are commonly used to reduce the tra.c demands of these environments, but it may be di.cult to gauge the e.cacy of these approaches as the Web evolves and tra.c characteristics change.

web proxies cache entire objects(HTMLtext,images, etc.)


Instead, since K3 itself is not required by the base station, the sensor node keeps it and uses it in the fifth nest.

using both the steps of our approach reduces communication beyond what could be possible had we used only the first step of the algorithm.


Secondly, and more importantly, performance metrics depending on the processing power cannot be evaluated realistically.

this includes the latencies of switches and the controller (if messages are also forwarded via the controller).


For such networks, the rate region is a (convex) polytope formed by the intersection of a .nite number of linear capacity constraints, and it has been shown that all a-fair allocations with a>0 provide .ow-level stability if and only if the vector representing the average tra.c intensities of .ow classes lies in the rate region.

the rate region in the utility maximization problem is also the stability region under .ow-level stochastic dynamics.


XF by adding a virtual demand for the failed link e to x.


Each pulse (we call it a train ) contains multiple probe packets sent at a particular rate, as depicted by the height.

the parameter N represents the number of packets in each train and parameter R represents the (instantaneous) probe rate of the train (i.e.


Using an IDL, agents can invoke the ACTP methods without knowing where the objects of the ACTP that they access reside, or in what language the requested objects are implemented.

any agents written in a language that supports method invocation of an IDL will be able to use the ACTP.


While this study is not exhaustive, it clearly indicates that the correlation between the RTT and losses observed at the queue is signi.cantly higher than that observed by a single .ow.

delay-based indicators may be a lot more e.ective in predicting congestion than what is reported in [21, 26].


Overall, these results indicate that better mechanisms must be designed to handle stale P2P membership, and hosts behind NATs for a P2P system to exhibit more friendly behavior to network operators.

it is important for membership management algorithms to avoid propagating hosts behind NATs, and to ensure stale information is eliminated in a timely fashion.


a point in a d ' -dimensional space may not reside in a d dimensional space.


PROOFS OF PROPOSITIONS 2 AND 3 It is straightforward to verify that the transformation f (·) preserves surface convexity.

if part of the surface is described by a convex function, this convexity is preserved in the image of f(·).


To cope with the situation that temporal correlation becomes weak when the time interval increases, we can refresh the ordering of di periodically.

for every one or two hours, the sink requests M(M = N) random measurements in one data gathering process.


8(a) shows that all protocols but CTP+LPL deliver more than 99 % of the packets from all sources.

lWB and Dozer exhibit a very high and almost identical average data yield of 99.98 %.


Since the resemblance of the experimental distribution with the uniform distribution in the random waypoint model is not always guaranteed, we focused our attention on this mobility model.

we simulated two mobile scenarios for a network with n=100 nodes: one which is critical from the uniformity s point of view (tpause=0, vmin=0.001, vmax=0.01 and pstat=0), and the other for which all the uniformity tests are passed (tpause=200, vmin=0.001, vmax=0.01, pstat=0.3).


2.2 Threat Model The goal of the adversary is to break network-address privacy, i.e., obtaining the one-on-one address-ID mappings.

the adversary attempts to ascertain the corresponding address (or principal) of any given principal (or address).


It considers that file transfer from cloudlets waiting happens before cloudlet execution.

even though cloudlets must wait for CPU, data transfer happens as soon as cloudlets are submitted [15].


If .< 1/K,thatis,there areparameterpointsinthe alternative hypothesis for which the observed sample is much more likely than for any parameter points in the null hypothesis, the likelihood ratio test concludes that H0 should be rejected.

if .< 1/K, the likelihood ratio test concludes that the host uses WLAN.


Given that the human body is a signi.cant attenuator of WiFi signals (in the 2.4 and 5GHz frequencies), the signals arriving at the phone differ signi.cantly between these two con.gurations.

when the phone is between the AP and the user (Figure 1(a)), the direct path from the AP to the phone is strong.


From a large collection of routing tables, we .nd that in most cases, route preference conforms to AS relationships.

routes learned from customers are typically preferred over those from providers or peers, and routes learned from peers are typically preferred over those from providers.


Neighborhood Awareness  The neighborhood awareness describes the probability that a node u is aware of its neighboring nodes and is calculated with respect to the distance between node u and its neighbors.

the awareness is expressed as the probability of having received at least one beacon message within the past second.


The key point is that the ideal-model simulator receives all values sent by corrupted parties to the Fzk functionalities.

this means that the simulator easily obtains the committed value from a corrupted A,because A sends w and r to F2 zk in order to commit.


A zone is a set of several global states gathered by a set of keys or some speci.c feature (Fig.3).

zone is the minimum unit on distributing global states into DHT.


We are interested in how the entropy of the posterior distribution over connections given an adversary s observations changes when using dynamic hops.

we consider how H(CT ,ST ,DT |OS ), H(CT ,ST ,DT |Od1 ), and H(CT ,ST ,DT |Od2 ) compare.


We measure the distribution of the number of representations over the di.erent videos when K = 48.

figure 6 shows, out of the 48 representations, how many are for dedicated to each type of video.


This paper presents Delay Distribution Measurement (DDM) based admission control algorithm, the .rst measurement-based approach that e.ectively exploits statistical multiplexing along the delay dimension.

dDM exploits the well known fact that the actual delay experienced by most packets of a QVPN is usually far smaller than its worst-case delay bound requirement since multiple QVPNs rarely send traf.c bursts at the same time.


However, we have shown that OpenFlow s current design does not meet the demands of highperformance networks.

openFlow involves the controller in the handling of too many micro.ows, which creates excessive load on the controller and switches.


Mobile Fog also provides detailed information about the underlying physical devices in order to allow application code to perform its task with respect to the geophysical location, available system resources, device capabilities, and network hierarchy level.

application code can  Handler Description void on_create (node self) Called when a new node is created.


Interior and exterior points of a network can be distinguished based on the thematic properties.

this approach enables us to consider attributes of single points (space based view) but also provides access to collections of points having equal attributes (object based view).


However, due to the inter-dependence, it is still challenging to determine the order in which a set of variables are to be solved for.

the order in which the dependencies are resolved is non-trivial.


The jammer in Jam-Secure should ensure the following, before SIC, the SNR is low enough to guarantee several bit errors, and  after SIC, the SNR is suf.cient to decode the packet.

the jammer should guarantee that the SNR of the eavesdropper is below S N Rmin, while the same for the receiver is greater than the SN Rmin.


Our measurement results con.rm abundant white spaces available for exploration in a wide range of areas in metropolises.

more than 50% and 70% of the TV spectrum are white spaces in outdoor and indoor scenarios, respectively.


Our identi.cation technique is based on correlating the Wi-Fi access points and cell-towers, both of which are essentially stationary, with the bluetooth devices.

we intend to capture the variation in the di.erence locations at which a bluetooth device was sighted.


If pi is on the convex hull of PI .P and Ni .PI, then pi is on the boundary of PI with respect to a certain transformation f(·).

if a point is on a (internal or external) surface of the hypothetical volume represented by P and is visible (due to locally convexity) from some viewpoint, it will be recognized as a boundary node.


We give the .rst rigorous analysis proving that, de.ned properly, locality of interactions increases the likelihood of the emergence of cooperation.

if the underlying network does not have any short cycles, the expected number of cooperators eventually exceeds its initial value.


Second, it allows us to trade delay for cost.

we can reduce costs by tolerating message delays of up to a few days.


In this context and consider ¯ ing an average power constraint P per UT antenna, the optimal transmission strategy is non-orthogonal transmission with power P followed by optimal multicell joint decoding ¯[2].

the UTs transmit simultaneously on the available bandwidth and SIC is employed at the central multicell-decoding processor.


Designs like MulBuff provide new opportunities for performance improvements that complement transport layer optimizations [1, 4, 5].

using MulBuff in conjunction with existing transports like DCTCP can provide signi.cant performance bene.ts due to isolation of .ows and by explicitly accounting for scenarios like Permission to make digital or hard copies of part or all 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.


Di.erent from those experiments we used AROMA [3, 4], a state-of-the art accurate system for the automatic generation of WiFi-based radio-maps, to analyze di.erent what-if scenarios for device-free WiFi-based localization that is hard to evaluate in real environments.

we study the e.ect of upgrading the hardware, APs mounting locations, and outsider e.ect on device-free localization.


Still, this analysis gives very encouraging results, since it essentially shows that, even with many trees, routers must store only a handful of trees per interface.

this analysis shows that trees aggregate well.


All routers except the victim build their routing tables according to the false LSA advertised by the attacker.

the route to R2 in R1 s routing table is gone.


In addition to traditional system optimization mechanisms, we utilize users bio-features to further improve  Figure 3: Typical Features the system performance.

when a user logs into the system using a speci.c screen, the companion camera will take a snapshot of his face.


Instead of waiting for it to visit an AP by chance, we also allow other clients that it encounters to help in this process.

the mobile client selects some encountered clients as relay nodes, and replicates a copy of the data on each of them.


This would enable us to characterize the gain that could potentially be achieved using multicast.

since the unicast regime consists of n source destination pairs, we take nsnd = n. we take nd = n 1-E and n s = n E,where 0 = E = 1.


In this context, this work investigates the use of opportunistic store-carry and forward schemes in MCN-MR networks to increase energy efficiency in the provision of delay tolerant services.

the paper identifies for a two-hop MCN-MR scenario the optimum mobile relay location and the location from which the relay should start forwarding the information to the cellular base station in order to minimize the overall energy consumption.


An extension on the coupon collector s result is the case in which coupons are drawn with differing probabilities.

every day a coupon is drawn with replacement (as above), however, each coupon i has probability pi of being drawn (instead of equal probabilities 1/n as in the original version).


Second, we have thresholded the channel capacities instead of varying them continuously according to equation (1).

in our simulations, we assume that a pair of nodes are connected with a wireless channel of unit capacity when the distance between them goes below a certain threshold, and are disconnected otherwise.


So we adopt the visualization method to solve the problem, displaying the long textual sequences through simple color coding schemes.

in this section we conduct following analyses: 1.


The performance of (N1) and (N2) is much better than (A1)'s performance.

if packet loss probability is low, only few NAK messages are returned to the sender which improves the performance.


Now, the CIVs are CIV(W)= 2.588; CIV(.d)= 2.382; CIV(.l)= 1.000 Notice that depending upon the values of other nominal parameters, the impact of changing a parameter is different.

the impact of changing W is now non-trivially higher.


Wireless sensor networks also show some similarities with our work.

a three tiers architecture called MULE is proposed in [12]: it is composed of limited resources sensors worn by people, animals, and vehicles to carry and forward data that is gathered by access points.


(39) .pDptqq k 1 Therefore, there exists some k° Pt1, 2,...,N `1u, such that ak° e 1{pN ` 1q.Since .pDpt qq e N ` 1, .pDptqqak° e 1.

dpt q can be written as a convex combination of elements from S with one of them, sk° , having an associated coe.cient that satis.es .pDpt qqak° e 1, as required.


First, all our range-based localization schemes signi.cantly out-perform the other schemes.

tSL and TSLRL reduce the MAE by a factor of 2.8-4.1 over Centroid, 1.6-2.3 over MDS, 2.4-3.9 over Sextant, 3.1-4.4 over MCL, and 2.3-3.2 over MSL*.


Second, as the birth rate at the waist increases, it becomes more likely that a new node at that layer will acquire enough new products so that its value becomes comparable, or even higher, than the value of the kernel.

the death of kernels is largely due to the birth of several new nodes at the next higher layer: if the kernel fails to quickly acquire most of those new potential products at the next higher layer it will experience a decrease in its normalized value, becoming more vulnerable to new or existing competitors atits ownlayer.


The guiding principle of MPLS routing is that the labels should be small; this is to ensure that the routing tables, which can be exponential in the label size, are kept small for fast routing.

they are usually much smaller than IP addresses (at a time when 32 bit IP addresses seem to be too small); this implies that an effort has to be made to reduce the number of labels used for routing protocols to make the protocols scalable.


Relative to the stochastic approach, it reproduces a given degree distribution exactly, but does not necessarily construct simple graphs.

it may (a) 0K-graph (b) 1K-graph (c) 2K-graph (d) 3K-graph (e) original HOT graph Figure 3: Picturizations of dK-graphs and the original HOT graph illustrating the convergence of dK-series.


The framework is based on the premise that botnet spam emails are often sent in an aggregate fashion, resulting in content prevalence similar to the worm propagation case.

we focus primarily on URLs embedded in email content because they form the most critical part of spam emails URLs play an important role in directing users to phishing Web pages or targeted product Web sites [2] 1.


Best Intersection Face Changes : As proven in [14], bestintersection face changes must make progress toward the destination in a planar graph.

the best intersection rule for face change always .nds a route to a connected destination, even if the network s topology violates the unit-disk assumption, so long as the topology is planar.


Figure 1(a) plots the network throughput over the execution with 4 GB input data per VM.We observe that most of the network traf.c were produced in the .rst half of the job execution.

the traf.c pattern exhibits a single peak, de.ned as a continuous period of throughput above some base amount.


Relying on a DTN substrate also means further assessing its ability to ef.ciently deal with user mobility and its reliability of message delivery which may in.uence design choices for application protocols.

the behavior of DTNs under stress ( congestion ) is also yet to be investigated as are suitable feedback loops for applications.


Theresults areof practical relevancefor the design and simulation of wireless multihop networks.

they are useful for the planning of sensor networks which may consist of thousands of low power microsensors that are randomly distributed over a particular area that needs to be monitored.


4.2 Comparison with edge-caching We perform an exhaustive comparison of ICN vs Content Distribution Network (CDN) strategies.

we consider some of the edge-caching techniques that [16] offers as good enough replacement for ICN.


We have con.gured Mail Avenger to (1) accept all mail, regardless of the username for which the mail was destined and (2) gather network-level properties about the mail relay from which spam is received.

the mail server collects the following information about the mail relay when the spam is received: the IP address of the relay that established the SMTP connection to the sinkhole  a traceroute to that IP address, to help us estimate the network location of the mail relay  a passive p0f TCP .ngerprint, based on properties of the TCP stack, to allow us to determine the operating system of the mail relay  the result of DNS blacklist (DNSBL) lookups for that mail relay at eight different DNSBLs.


This restriction is due to their fragility.

they may contain state which is necessary for connection operation (thereby violating the Internet fate sharing principles [7] which suggest connection state should reside only in end stations), they confound end-toend diagnostics and reliability by (partially) changing the communicating endpoint, they significantly increase system complexity if mobility is frequent (due to the need to migrate state when end-nodes move), and many require both directions of data to flow through the PEP (a problem if asymmetric routing is used).


5.3 CPU Usage Given that virtual WiFi achieves close to native WiFi throughput and latency, we are interested to see how much system resource is consumed by virtual WiFi.

mobile devices such as smartphones and tablets typically have limited processing power, which may lead to CPU being a bottleneck.


From a combinatorial point of view, it is a highly connected graph that connects the cluster inside the boundary to the rest of the graph.

a larger number of edges need to be removed to disconnect G and G. 3.2 Network Model We base the model of information .ow at the chunk level rather than the IP packet level [1].


of Computer Science and Engineering, Seoul National University Gwanak-599, Gwanak-gu, Seoul, Gyeonggi-do, Korea dobby@mmlab.snu.ac.kr, tkkwon@snu.ac.kr, yhchoi@snu.ac.kr ABSTRACT Cognitive Radio (CR) techniques to dynamically utilize the frequency spectrum is under hot discussion recently.

wireless mesh networks along with CR techniques may play a vital role in spectrum-scarce situations, which are the target environments of this paper.


In this paper, for cases where d> 2, we use the solution corresponding to d = 2 as an approximation.

if the service set of a relay node Ri is given by Fi = {fi =(Si,Di,.i)|i =1,...,k}, then the position of Ri R in our work is de.ned as: .i .i i · xSi i · ySi xRi = .yRi = .


{0, 1}l0 satis.es that the random variable (µ, H(µ, w)) has .1 statistical distance from (µ, u) that is uniformly distributed over R×{0, 1}l0 and w distributed according to RA conditioned on RC .

h is an .n, l0,.2.-extractor for the source RA conditioned on RC .


We would like to emphasize that the two phases are asynchronous.

secure single-hop pairwise synchronization (Phase I) is executed by nodes individually and independently, while secure and resilient global synchronization (Phase II) is controlled by the source node and propagated throughout the network.


The second technique is applicable to data transfer from the callee-to-caller when relevant information are available to the monitoring point.

during the slow-start phase, the monitoring point can measure the time spacing between the .rst and second bursts of sent data packets to provide a rough estimation of the connection RTT.


We derive closed-form solutions for structured topologies and a dynamic programming procedure to evaluation solutions under general topologies.

we prove that a complex system with multiple revenue sources from different contents and regions can be decomposed by their inelastic components of content-side and eyeball-side revenues.


Take as a modeling assumption: P(.n = m|Zn = i,Zk,.k,k <n)= P(.n = m|Zn = i).

given that, at the n-th loss event, the HMC is in the state i, .n is independent of anything, but Zn.


Notice that here we do not count the messages used in building LDel(2)(V ), since in [21] it was proved that the communication cost of building LDel(2)(V ) is O(n).

we only consider the messages used in the second and third steps of Algorithm 3.


)and Tj * already determined at each intermediate input linecard, each intermediate input linecard sends at most Tj * = T grant tokens back to each input linecard, totalling at most NTj * grant tokens to all N inputs.


Our architecture gives transit providers an advantage because the set of paths available to a given access network is relatively stable.

transit only needs to connect an access network to the set of data centers that are relatively close.


We model this using the following procedure similar to [7].

when encoding, a sensor node choose a degree d and then randomly draw d symbols from a central pool of original symbols from all available snapshots and X OR them together.


Late-exit requires cooperation among ISPs, because the upstream ISP cannot by itself know where the packet is destined inside the downstream ISP.

the downstream ISP must publish information (most likely via MED attributes in BGP) about the cost to reach destinations from each peering point, while the upstream cooperates by carrying traf.c accordingly.


From (7), higher local false alarm rate always results in higher decision threshold and local detection probability at each node.

the nodes are more sensitive to a target.


However, we note that the maximum (in the 100th percentile) extends to much higher values for large sets of trees.


QoS assurance and quality control techniques for high-speed wireless networks are still insufficient, though.

as opposed to wired environments, in wireless environments that use air interfaces to offer mobility, there are various performance degrading elements, such as frequency interference and fading or high error ratios.


4 The multiple tree case In this section, we examine the effect of removing the assumption that there is a single multicast tree that defines the routing for all groups or layers.

we consider the case where for every layer or group, there is a single fixed tree that must be used, but the trees for the different layers or groups do not have the same tree, either because they originate from different sources, or because they use a different routing scheme.


However, our study reveals that no solution provides a comprehensive and easily realizable approach to simultaneously address the challenges discussed in the previous section.

our survey across the .elds of WLANs, Adhoc,Cellular and Sensor networks research, reveals that (i) there are no existing per-link solutions to address the asymmetric channel access problem in WLANs, and (ii) although approaches exist that address a subset of the challenges, Symphony is the .rst system to simultaneously address the complete set and prowith any other node in range; whereas in WLANs, clients can only communicate with the associated AP, and vice versa.


According to the .gure, around 60 % of the frame transmissions are unsuccessful and require at least one retransmission.

when retransmissions occur, the resulting delivery delay increases towards delays that might be unacceptable: very long delivery delays can be seen in the case of the long payload, 100 Byte.


In this paper, we focus on protecting the source s location by introducing suitable modi.cations to sensor routing protocols to make it di.cult for an adversary to backtrack to the origin of the sensor communication.

we focus on the class of .ooding protocols.


A proof sketch: A proof of this lemma can be easily constructed based on contradiction.

if there exists an optimal solution that involves the WCV traveling outside of the SED, we can always .nd a better solution (in terms of objective value) by bringing the WCV inside the SED, which leads to a contradiction.


Note that the Octahedral symmetry of these grids introduces a key property missing from the Tetrahedral and Icosahedral families of spherical interconnects: due to the square defect regions of the Octahedral graphs, a red/black ordering of points is maintained over the entire graph.

half of the points may be labeled as red and the other half labeled as black, with red points having only black neighbors and black points having only red neighbors.


The random phase shift due to lack of synchronization a.ects the entire duration of the link signature.

in a completely static channel, if the .rst measured complex temporal link signature was h, then the next complex temporal link signature would be measured as ej¢h.