To study this issue, we .rst de.ne a method for calculating the load on each mesh node under a hypothetical populationbased model.

we consider the o.ered load of alocation i to be a function of the client demand qi (in kilobits) at i and the expected time required to serve a .xed sized packet, di, (measured in seconds per kilobit) at i.Our framework provides the estimate for di based on the predicted modulation rate at location i, which is in turn based on the SNR at the location.


As expected, the NNS algorithm (heuristics) needs less resources than our VCC algorithm with lower density, but with higher one it needs much more than VCC.

in any settings with 0.7 or higher density, NNS needs more resources than VCC and with 1.0 density (which is the severest case where stations are very populated) in Fig.


These features make Nemo ideal for measuring the power consumption of sensor networks under a wide range of applications and operating conditions.

as many sensor networks operate under low duty cycles and stay in sleep state (with just a few uA current consumption) most of the time, the .ne measurement resolution (~0.01uA) of Nemo enables accurate assessment of the system lifetime.


(b) ACK-based feedback Figure 10: Two different ways for the receiver to notify the mobile client of the best antenna for symbol-based an tenna selection With PHY support, all the antennas are examined in a single packet.

a mobile client transmits a series of PHY training periods, each from one of the antennas so that the receiver can estimate the RSSI of all antennas and notify the mobile client of the best.


One aggregate statistic that we can leverage is the total number of handovers between two sectors.

for each pair of sectors (A,B), a counter is kept that indicates the number of handovers from A to B processed per hour.


(3), nodes have equal chances to become clusterheads using TMPO.

the probability of a 1 node winning over k other contenders is .


Similar to Sting [20] and T-BIT [14], the main insight behind King is that it is pos- sible to use existing protocols in unanticipated ways to ob- tain results that were previously intractable.

king makes use of the existing DNS infrastructure in a novel manner.


[13]) to obtain a(1 -e)-approximation to the linear relaxation of Alg5-IP in time polynomial in N, C and 1/e.

maxWeight-Alg5 then rounds the solution to this linear relaxation by choosing a single set Si to assign to user i.we set Si = S with probability XSi .


However, raw energy consumption does not always provide a complete picture.

many protocols trade off characterfor secondary relays and 70%fornon-relays.


In addition to similar estimate values, we also expect good passive estimates to be correlated with the active estimates over time.

when the active estimate goes down (e.g., due to contention) we also generally expect the passive estimate to go down.


Instead, Snooze only decides how many antennas should be used commensurate with the client s traf.c load, leaving it to the rate control algorithm to decide which antennas are used and what rates and channel widths are assigned to each antenna.

snooze limits the NIC s con.guration search space, and thereby directly controls the power consumption of the NIC, which depends upon how many antennas (or, more precisely, RF-chains) are enabled.


We have chosen to present RaWMS with a walk length of n/2 and lpbcast with 4log n rounds, as these give optimal results, respectively.

these are the most ef.cient versions of both protocols, which still guarantee a fairly uniform distribution of views at the lowest possible cost.


The Change ImpactValue CIV(xj,a)= f(Vxj =a·vj) .

f(V ) CIV(xj,a) is the factor change in scalability between using a particular (nominal) value for xj and using atimes that value.


In particular, when the difference vb - va is large, say va =2 and vb =30, the ratio is as large as 2.25.

the fraction of connection time, or the average number of connections of the observer node is more than double when observer node mobility is high.


Since {g1.g4 s-a-1, g6.g7 s-a-1} are in the intersection of both implications, they are testable only if g5 is 0.


In this paper, we will be concerned with customer usage as determined from direct measurements of customer traffic at routers or other network elements.

we take usage to mean the total number packets or bytes in those packets (or possibly some combination of these) that are observed during some billing interval, these totals being differentiated at some accounting granularity, e.g., by customer, service class, source and/or destination IP address, application, or some combination of these.


m=k) and m=2 h , we can show that the prob tlns2o/yn W ability of a counter being -to be 1.4e-6 which is minuscule for our purpose.

one in a million counters can over.ow Fast Hash Table Naive Hash Table Analysis Simulation Analysis Simulation basic pruning balancing 1 19.8  18.8) 2 0 740.32 734.45 2 3 l 3 0 0 28.10 27.66 3 22 l U 0 0 0 0.72h2 0.70 4 0 0 0 32- 32- 5 26 0 0 0 2u 32 6 3 .


We assume that the upload capacity of usersis the onlybottleneck for a P2P live streaming system.

the download capacity of a user is higher than the streaming rate, and bandwidth bottlenecks are located at the edges instead of the core of the Internet, which are reasonable assumptions [19] for the current Internet.


The SINR model for UWB networks was first given in [4], which is different from that for narrowband networks [6].

the achieved signal-to-interferenceplus-noise ratio at the receiver of link i can be represented as: (,i xj ) Pd x a SINR i = i = ß N 0 a Ri[.+ Tfs2 .Pk ( k , x j d x ) ] k =1,k .i where Pi denotes the average transmission power of link i s transmitter, xi ; Ri denotes link i s data rate, and R = 1/( NN T ) ; N denotes the i shcs number of pulses per symbol, Nh the number of timeslots per Pulse Repetition Interval (PRI), and Tc the pulse duration; Tf is the PRI, and Tf = Nh Tc; s2 is a parameter depending on the shape of the monocycle; .


(1), and the superposition principle that holds for linear systems, we will derive the performance of E2DCA by considering a step disturbance: di(n)= d0 ·1(n), where 1(n) is the unitary step function.

e2DCA gives to the ith queue a way to compute ui(n) at the beginning of the successful enhanced contention, (i.e., to determine the amount of bandwidth obtained with the n th successful enhanced contention) in order to drive the queuing delay ti to the desired target ti T .each station evaluates this bandwidth independently from other stations, that is, E2DCA is a distributed bandwidth allocation algorithm.


For each buffered message m, node A will try to forward message m to node B if B is in Ln (m)and not in Ls (m).

node B should be a next hop for this message and node A has not transmitted this message to node B before.


Also, we ignore radio capture capability of tranceivers.

two packet frames are considered as colliding and therefore corrupted if their transmission is overlapped at the receiver side, despite their difference in the signal power.


The core MAC functionality for system access, bandwidth allocation and connection establishment is provided by the CPS (Common Part Sub layer).

sF management is under 935 the responsibility of CPS.


Moreover, we also provide important new insight into the impact of transmission power on contention.

we found that some assumptions underlying the design of PCBL and ATPC do not hold on our testbed.


Next, to effectively characterize a user s interests in the physical world from the identi.ed location geotags, we devise the interest vector concept.

an interest vector for a user consists of statistically signi.cant semantic features (categories and subcategories) associated with PoIs that a user encounters over longer time scales.


Our notion of a TP is based on the APs point of view.

the transport services provided by the TPs are for the APs to reach their customers/users.


We present temporal and spatial demand distributions and analyze some statistical properties of the demands.

we .nd that there is a surprisingly strong relationship between the mean and variance of demands, and that fanout factors tend to be relatively more stable over time compared to the demand themselves.


The second approach focuses on providing hardware virtualization support on the NIC device itself.

single Root I/O Virtualization (SR-IOV) [29] provides a standard mechanism for devices to advertise their ability to be simultaneously shared among multiple virtual machines, and it allows for the partitioning of a PCI function into a set of virtual interfaces.


As NCDNs control both the content distribution and the network infrastructure, the costs and objectives of their interest are di.erent both from a traditional CDN and a traditional ISP.

an NCDN is in a powerful position to place content in a manner that shapes the tra c demand so as to optimize both network cost and user-perceived latency.


A bridging link {k, l} between nodes k 2 Ci and l 2 Cj is a stronger than average link and neither k nor l is a bridging node.

k and l are only connected to few nodes of the respective peer community.


Our goal is to exploit correlations between these signals and identify groups of variables a.ected by the same event.1 2.2 Exploiting Correlations As discussed previously, we expect that if a set of pre.xes that are a.ected by the same event, updates for these pre.xes would reach a given vantage point at approximately the same time.

the updates for pre.xes a.ected by the same event will share a lot of temporal similarity.


To address these issues, inherent to syntactic approaches, we propose an inference algorithm that takes into account the semantic associated with message parts.

our approach does not limit the semantic de.nition of a message part neither to its data type (ASCII or binary) [6] nor to its appearance probability [26] but instead leverages contex tual and environmental information to improve both message clustering and message format inference.


In OF-RHM the end-hosts only act as request generating instances and, hence, requests from hosts with spoofed identity are not harmful.

because OF-RHM is supposed to serve DNS requests and route .ows from any client no matter whether it is malicious or not.


Let us de.ne a sequence of random variables Y0 through YM as follows Ym(C)=E(X(C)|C1,C2,..., Cm-1).

y0(C) is equal to the constant E(X(C)) and YM (C)is identical to X(C).


The algorithm is randomized and runs in polynomial-time.

theorem 1 shows that we can solve the covering and maximization problems (1) and (2) to provide a sensor placement for which the communication cost is at most a small factor (at worst logarithmic) larger, and for which the sensing quality is at most a constant factor worse than the optimal solution.


In an effort to understand the surprising ef.ciency of this simple algorithm, Dimakis and Walrand have identi.ed a suf.cient condition for the algorithm to achieve the entire capacity region of the network for single-hop traf.c [6].

they have shown that if the network topology and interference structure satisfy a condition known as local pooling, then the LQF algorithm achieves the entire capacity region.


The OHPB LP allows the segment size progression to be designed for any range of client bandwidths.

the range of client bandwidths that can be supported by the protocol is independent of the server bandwidth, whereas in BroadCatch and HeRO, the client bandwidth range is directly related to the server bandwidth.


While there is not one commonly accepted de.nition for tra.c burstiness in the literature, burstiness generally refers to the statistical variability of the tra.c.

high variability in tra.c data rates implies very bursty traf.c.


In ten different measurements, the time required in one step varied from 2.7msec to 7.8msec, and the average time was 4.3msec.

the whole mid.x allocation and pre.x distribution can be executed within 25.8 msec on the average.


Second, the mean-square ergodicity implies that, as the observation interval dincreases, the random variable Yi,d (fj) converges to xj in the mean-square sense.

the variance of Yi,d (fj) decays to 0 as d.8, i.e., [ ] ( )2 lim E Yi,d (fj) -xj =0.


It can be seen that the proposed approach uses much fewer hops than the WCDS.

the constructed routing tree in the WCDS is thinner but deeper than ours.


In contrast to the existing DHT-based ICN designs [3, 4, 6, 7], SMVDHT integrates name resolution into the routing and forwarding process.

aggregation is used in higher level virtual DHTs to reduce control overhead and state requirements for better scalability.


The values of all remaining nodes of the tree are hashes of the values of all of their children.

the values of all nodes (but the left-most level-5 values) are functions of at least one left-most level-5 value.


As shown by Figure 4 and Table 1,the selection of the most reliable path set by DPSP dramatically improves over the simple shortest and two-shortest paths.

the average life time is four and three times longer,respectively,with a much lower number of route discoveries.


ESTIMATION OF HOST INFECTIONS As a concrete example we wish to estimate the number of hosts that have been compromised in a network attack, and are themselves sending out attack traf.c.

we wish to estimate the number of such hosts that send traf.c past a given collector or set of collectors of sampled .ow statistics.


In 2009, Chowdhury and Akyildiz studied the problem of interferer detection and formulated a general methodology [4].

the authors used sensor nodes to collect spectral data which was used for o.ine interferer identi.cation.


HT (F ) =0if F = () and is i1 otherwise.

this is the height of the tallest tree in F .


At this point however, we should consider backward backward utilities .

assume that also user i + 1 can not be admitted into the system and we want to represent the degradation of the service for a user j who has already experienced a degra (0) (1) dation from rj to rj during admission of user i.


It is dif.cult to tell which reference tag is closer to the desired tag based on (a).

due to the power scaling problem, the nearest neighbor (green) has a much smaller bump around 80. than the desired tag (blue).


The extended scheme could implement such an electronic transaction between two parties fairly.

it is guaranteed that the customer gets the digital goods from the merchant if and only if the merchant gets the money from the customer.


This frequency value is updated after every 200 requests using the exponential backoff algorithm with the parameter ß =0.8.

.rst, each time slot of our exponential backoff algorithm contains 200 requests.


As a consequence, there is a strong need for enhanced mechanisms for robust and reliable exchange of information under realistic conditions.

repetition and multi-hop retransmission strategies have to be incorporated to increase the probability of reception of a high-priority broadcast message.


A nice property of the forwarder interference is that the forwarders (Cathy) are sending the symbols that the previous nodes (Bob) along the path have already seen.


g is homotopic to the identity map of Y .

the maps f and g de.ne a one-to-one correspondence of the topological features such as connected components, cycles, holes, tunnels, etc., and how these features are related.


Intra-network attacks on low-latency networks can also be useful.

paths in Tor and the (no longer deployed) Freedom protocol are generally 3 hops short enough to maintain usability, but not so short that two nodes can be certain of linking Alice to Bob if they decide to collude [4, 18].


In our analysis, we consider only the additional risks posed by QoS-Guided Route Discovery, and not those caused by the underlying ad hoc network routing protocol.

because QoS-Guided Route Discovery can be implemented with only one additional packet type (E STAB L I SH FLOW), and because the authentication of that packet can generally be performed in the same way as for ROUT E REQUE STs, we ignore general routing attacks such as corrupted node lists, wormhole attacks, routing message replay, spoofed signaling, fabricated routing messages, routing loop formation, and the participation of unauthorized nodes.


The s values of each cell are increased by the delay of thepacket(i.e., the currenttime at receiver minus the timestamp embedded in the packet at sender), while n values are increased by one (i.e., maintains a count of the packets that hashed to that cell).

s values contain the sum of all packet delays that hit that cell, while n values represent packet counts.


The techniques proposed include reducing the slot time and SIFS based on the actual maximum air propagation time within a WLAN, in addition to exploiting advances in PHY technologies and thus facilitating faster MAC processing and carrier sensing.

it was found that a reduction in the time allocated for air propagation delay, MAC processing, and channel sensing can provide non-trivial throughput performance increases of up to 26.8 % and 30 % at PHY bit-rates of 54 Mb/s and 216 Mb/s respectively for the best case scenario.


In general, the waiting time decreases as the charging rate increases.

the waiting time of our proposed D- ECS is very close to that of O-ECS.


When enough copies have been spread to guarantee that at least one of them will .nd the destination quickly (with high probability), it stops and lets each node carrying a copy perform direct transmission.

spray and Wait could be viewed as a tradeo.


Hence, after the transmission, each receiver can extrapolate how the performance on a certain subchannel would have been if all subcarriers had been allocated to any of the m transmitters, since it knows how the performance was for one (or more) subcarrier of that transmitter in the subchannel.

we use a static allocation of subcarriers which allows us to infer after the transmission how any possible allocation of subchannels would have been.


First of all, consider that the server responds with R1 and R2 upon receiving M1 and M2 in order.

if there is no forward-path reordering, R1 will be generated .rst Table 1: Variables used in the TCP sliding window mechanism.


The multicast addressing and routing mechanisms we present scale to much larger numbers of multicast groups than in previous designs, while providing greater robustness to switch and link failures.

we address IP multicast within datacenter networks that are multi-rooted trees [6, 15, 29, 26].


In the next step, we plan to improve the RGOPC scheme and study how to adjust GOPC dynamically.

the GOPC is generated not only in the setup stage, but also during the communication stage according to the situation of remaining energy in each node and the network topology.


Our concern therefore is whether there are middleboxes that are not proxies that resegment packets.

any middlebox that passes new options and also re-segments data might be problematic.


is the longest time it takes for both nodes to .nish two legs.

during the time interval of ., both nodes must have jumped at least twice.


The main idea behind a back-propagation network is, that it starts out with a random pattern encoded in it and as it is trained modi.es this random pattern based on how well the pattern performs on the training data.

the neural network starts with guess ing what the output should be given a certain input and then com pares its guess with the desired output.


We de.ne network performance as the maximum throughput on the network under heavy traf.c conditions based on a gravity model [38].

we consider .ows on all sourcedestination pairs of edge routers, such that the amount of .ow Xij between source i and destination j is proportional to the product of the traf.c demand xi, xj at end points i, j, Xij = axixj , where a is some constant.


Such an extension induces a biased selection of nodes to receive the forwarded information at each step, thereby accelerating di.usion and thus reducing the network cover time.

at each forwarding step, the neighbor node with the highest degree, betweenness,or closeness value is chosen to receive the forwarded message.


Rather, we consider the EBGP update message as a consequence of some instability.

in response to a BGP instability, a BGP speaking router initiates a BGP update that propagates an attribute change from one BGP peer to another.


interval follows the uniform distribution.


This de.nition is empirical, but has been validated through a number of experiments.


Different from the experiment on synthetic data in which energy consumption is approximated by the number of transmissions, here we measure the real energy consumption of not only communication but also computation on the testbed.

the computation energy include the energy consumed by the classi.cation (or clustering) algorithms as well as the HAC (or cHAC) protocol.


Without cooperation, an opportunistic system must increase the sensitivity of its detection algorithm by an amount equal to that of the deepest shadow/fade under which it must detect.

while an unshadowed system might only need to detect a 0dB signal to avoid interfering, it would need to detect a -56dB signal to account for the possibility of a 56 dB shadow/fade.


Due to 1-spanner in LDTC, communications between any two nodes consume the least power.

gG is known to have a power stretch factor of 1 in a 2-D plane and free space environment (a = 2) [17].


From the attackers point of view, all the nodes in .at l are equally likely to be IPd with prob 11 ability = , all the nodes in C-1 IPai are un |IPal | Li=0 likely to be IPd, and the rest nodes are equally likely to al 1-|.

|/L 1-./L be IPd with probability X t = X , where X = al N - LC-1 |IPai |-|.| = (2ß - l)L - .. attackers i=0 t assign the following probabilities: swarms to satisfy diverse address-privacy requirements is an ... .. open problem worthy of further study.


The MME in our scenario initially  Figure 4.

information Server Discovery & Message Exchange uses DHCP [8] to acquire the location of IS, the IS server s IP address, the IS server s FDQN (Fully Qualified Domain Name) and URI (Uniform Resource Identifier).


The key question we aim to answer here is how representative are these results.

can they be used to predict the popularity of a given application in a given world region?


high µ(R)) a larger number of devices can be set to sleep in order to save more energy.

en canbeadjustedina way such that a target µa(R) is achieved given the expected µ(R).


We observe that for 20% of the replication intervals the following properties hold: (i) the interval includes only a single packet (and its phantoms), (ii) the number of replicas in the interval is less than in the adjacent intervals, and (iii) the replication levels in the adjacent intervals are equal.

these intervals represent a slight depression in an otherwise steady replication level, which likely re.ects measurement loss.


Additionally, the values C1 and C2 are selected in a way that considers the expected additional coverage EAC.

c2 (sparse network threshold) should be in a way larger than C1 (dense network threshold) in order for the node to have a higher chance to rebroadcast in a sparse area given that the EAC of a sparse network is higher than that of a dense network.


The passive distribution of the extra time in the contention neighborhood of a link can cause congestion for the .ows that start in that contention neighborhood and end out of it.

the congestion can travel with the .ows that traverse outward from the neighborhood of the congestion-controlled links.


Furthermore they hold shares of the input lines of the circuit.

for each input line l,party A holds a value al and party B holds a value bl, such that both al and bl are random under the restriction that al + bl equals the value of this line.


The traditional wisdom for wireless network design is to separate link losses caused by fading from those caused by interference.

the PHY layer addresses the issues of fading, and the MAC layer addresses the issue of contention.


Our results motivate a scalable and low cost bootstrapping mechanism that does not require a central bootstrapping node.

we showed that 20% 30% of peers at any moment have an uptime longer than one day.


Objects in the Fresnel zone cause diffraction and, hence, reduce the signal energy.

most of the radio-wave energy is within the First Fresnel Zone, i.e., the inner 60% of the Fresnel zone.


The main issue is that our underlying execution model (PTS) by means of which the semantics of IML is de.ned uses external attackers and CryptoVerif uses internal attackers.

in IML the attacker is part of the semantics, whereas in CryptoVerif it is part of the process, running in parallel with the process representing the protocol.


[9] provides a theoretical framework to explain the height impact on channel quality.

the channel power loss depends on the contact between the Fresnel zone and the ground.


On the other side, the wireless router will use IP address(es) from the RLOC address space on the interface(s) used to communicate with the other routers.

in this context, an EID-to-RLOCmapping allows toidentify a mobile node(the EID) andlocateitinthewireless network(theRLOC).mappings say which mobile node is associated to which router.


This information can be easily obtained through a simple extension of the SPDD.

we mark each node v in the SPDD with an additional .eld color.


Our work complements and extends the large body of work on measuring and characterizing the Internet.

several recent efforts have focused on end-to-end Internet path properties, as these can have a signi.cant impact on application performance and transport protocol ef.ciency.


No application-level support is required for the correct operation of persistent dropping.

when connectionlevel classi.cation (H2) is performed, persistent dropping does not violate any end-to-end semantics and, at the same time, achieve the same control targets as the traditional rate-based control.


For example, we avoid requiring that clients enter new contractual agreements beyond their current ones with access providers for basic Internet connectivity.

we do not require that clients sign up with speci.c (possibly in addition to their current ISP) providers in order to obtain IPvN service.


(3)Nodes(whether honestorlying)donotapplyanytransformation to the observed packet stream other than packet loss, delay, or reordering.

they do not inject new packets or modify observed packets.


RVIP seeks to implement the same behavior on RVIP-Real and RVIP-Virtual.

when RVIP-Real sends out a live packet, the RVIP-Virtual sends out an equivalent packetin theSVN.Likewise, whenRVIP-Virtualreceives a virtual packetfrom other virtualnodesintheSVN,theRVIP-Real receives an equivalent packet.


We show that in a network with interference degree ß, the R-LPF is at least 1/(ß + 1).

the R-LPF is at least 1/3 in a network with one-hop interference model.


ISPs do this under the expectation that few enough users will wish to consume the advertised bandwidth at the same time.

iSPs provision for average demands, and offer no assurance to customers when demand far exceeds the average.


CONCLUSIONS In this paper we have studied how non-cooperative network members can threat the secure routing protocols by various means.

they can deplete network resource and reduce the routing performance to minimum.


This implies that ImGlobal is at least as good as a strategy with optimal backward message propagation, and whose starting time of the geometric process at node i is delayed such that the leftmost 1-node in the network is at least c positions away from i.

denoting with StartIG(d,¯t¯) the same event as Start(d,¯t¯) when strategy ImGlobal is used for message dissemination, we can write P rob(StartIG(d,¯t¯)) = P rob(Start(d¯+ c, t¯)).


Concluding Remarks In this paper, we have designed new multicast delivery schemes that make use of the social network related information for human contact-based networks.

our schemes forward a copy of the message to connectors (nodes that can meet different communities) and let each node make use of either the delivery predictability or the estimated node contact rate in its forwarding decision.


Conclusion -Our results show that the opportunities for o.-channel reception are limited.

o.-channel reception is only e.ective at the lowest transmission rate of 1 Mbps or when the received signal is extremely strong.


An important aspect of this control architecture is that it de.nes the relationships that govern the interaction between the players, without prescribing their internal organization, structure and policies.

every entity manages its resources as it sees .t.


First, similar to the result of the CE model, the ratio of fC : fT : fB is .xed when the ratio |C| : |T | : |B| is .xed.

we have the scaling effect of the normalized Shapley value function as: .B(b, t, c)= k.B(kb, kt, kc) .


3.4 Problem formulation and high-level view of stepsfollowed to solveit The goal of this paper is to evaluate the potential bene.ts that o.oading techniques could bring to operators.

theirinterestis to compare whatis the resource consumption in their network without applying o.oading and when applying o.oading on a large scale (see Section 7).


The majority of false positives originate from the limited number of samples for the speci.c {IP,port} pair.

the sizes of both IPSet and PortSet in PTP Algorithm are su.ciently small to allow specious inference of connection patterns.


In particular, +P does not have to be commutative it is always used with the parent s action on the 22M×A is the set of all subsets of pairs drawn from M and A.

3we require a + 0 = 0 + a = a. left and the child s action on the right.


The branch-andbound procedure is based on the divide-and-conquer idea.

although the original problem is hard to solve, it may be easier to solve a problem with a smaller solution space, e.g., if we can further limit Al005.


Hence there is a risk that a regular packet may be confused for an Esense alphabet by the Esense receiver.


In order to support self-organization, we restrict our construction of the network topology for a localized algorithm.

each node Figure 6: Variance in the energy reserves of the nodes after 100 time steps.


The presentation needs quite a bit of improvement.

it is often difficult to follow which of the variety of data sets is being used.


We observe from Table 2 that the primary issue is the change in the most preferred route, from D30 to C20, with the reception of BE30.

the cause of D30 being demoted in rank is brought about by BE30.


Grouping these pre.xes the router switched between two comparable routes (e.g., because of a change in the IGP path costs).

we group events for different destination pre.xes that (i) belong to the same category (using the taxonomy from Section 5.2), (ii) undergo the same kind of transition (from better to worse, or worse to better), and (iii) start no more than threshP seconds after the .rst event.


The results also con.rm the importance and effectiveness of our model in assisting operators to reason about network-wide CoS operations.

we have demonstrated the potential of the tool in extracting all possible .ow treatments across a given set of devices, identifying non-standard and potentially anomalous .ow treatments and shadowed con.guration policies, and deriving network-wide views of CoS designs.


An (N)-IPC process may have access to more than one (N-1)-DIF (interface), and more than one (N-1)-DIF may be directly connected to the same adjacent (N)-IPC process.

there may be more than one path to the next hop.


As shown in Figure 1, NDN replaces IP with named data as the thin waist in the Internet hourglass architecture.

instead of sending data packets to a given destination IP address, hosts communicate in an NDN network by requesting desired data.


As explained in section 3.1, one of the key aspects characterizing the implementation of the routing protocol is its capacity to do load balancing with the V parameter.

we carry out two experiments in which we evaluate the impact of the V parameter on the next-hop selection algorithm proposed by the routing protocol.


Thus, we demand that A is polynomial in the overall size of all inputs from H and outputs A gave to H. However, it should be stressed that neither H nor A actually halts.

a cannot delay message delivery up to a point in time where H would not see the consequences of this delivery.


The proposed protocol resolves the mobile sink node problem of the SODD approach as well as the multiple interest event occurrence issue of the TTDD approach, and unlike TTDD, it uses a single grid structure.

there is no relation between the number of interest events that occur and the number of grids.


the wireless channel, although the latter introduces variability.

the experiments point to a scenario where the basestation possesses a large per-user buffer that absorbs and mitigates the impact of channel .uctuations, allowing high channel utilization with little congestion losses.


The selected offered load is 200 pps, and saturates the whole network.

the total offered load on each link exceeds its capacity.


Finally, an optimised solution combining the RRM results and the Trading Module output is obtained, enabling Spectrum Broker to sell/assign TVWS frequencies to the corresponding secondary systems under the RTSSM regime/policy.

spectrum Broker is responsible for obtaining the best-matching solution, through an optimisation-based process, which constitutes a NP-hard problem, thus an approximation algorithm is required in order to solve the auction process.


Our work bene.ted greatly from the seminal paper on this sub ject by Fagin, Lotem and Noar [10].

the concept of instance optimality is from that study.


As we want to explore and .nd what are the more pro.table actions to take for each state, we choose a probabilistic action selection method.

we used the Gibbs Softmax method [9], a well known approach in RL for action selection.


Instead, the computational load of data aggregation is equally shared among nodes in the network.

extracted feature values are aggregated with other values directly at the location of their extraction to achieve a low communication load.


A convenient way to use the TIV alert mechanism in Vivaldi is to use the prediction ratio to identify those edges with high TIV severities, and re.ne the neighbor set for each node.

the enhanced system we call dynamic neighbor Vivaldi can be explained as follows: Vivaldi is started normally, with each node having 32 random neighbors.


We present simulation results to demonstrate of the scheme in distinguishing between malicious vs. nonmalicious nodes in a variety of scenarios involving nodes that are malicious with respect to both packet forwarding and trust propagation.

we provide some numerical comparisons of the extended Hermes scheme versus the original Hermes scheme.


While the conventional QoS vision puts this kind of traffic in the second highest priority class, that is, AC 2 (corresponding to AC_VI class in the vision of 802.11e/WMM), we allocate this traffic typology to the best effort class (AC 1).

while the conventional QoS definition focuses solely on delay sensitivity of an application, we have further considered bandwidth requirement of an application, in addition to its delay sensitivity, in our traffic class definition.


In the modi.ed algorithm, when joining the session m, each node independently joins each tree of the session the same way as in the original algorithm.

from the algorithm s viewpoint, a session with T (m) trees is no different to T (m) single-tree sessions with identical member set and traf.c demand.


In their study of .le popularity in P2P downloads, they suggest the cause of distortion arises from fetch-at-most-once behavior of users.

unlike the WWW tra.c where a single user fetches a popular page (e.g.


If more e.cient fusion models are employed, the coverage performance will be further improved.

more e.cient fusion model can reduce the network density for achieving a certain level of coverage.


Thus, the utility of link ek under pro.le d by payment scheme p becomes p k(d ) - ck = p k(d) - ck = p k(d) - (pk(d) - d 2 ) = - d 2 < 0.

under pro.le d , when link ek reports its true cost, it gets a negative utility under payment scheme p .


n = 2m+1, it fol = 2m+1 lows that the event {Xm+1 > 2m .

xm+2 } occurs with probability at least e -2e -c , whichgoesto oneforlarge positive c. the algorithm is terminated by the end of the m +2-th phase w.h.p.


Yet, the possibility to conduct experimental research in this .eld is extremely limited.

we d like to mention the custom radio prototypes [9], which are usually based on Field-Programmable Gate Arrays (FPGAs), i.e., rather complex and in.exible.


Figure 4: The rectangles and policy subunits after the subnetlevel reachability setshavebeendecomposed.

we refer to theprojections of the rectangles unto the x-axis(i.e., thesourcesubnets) as policy subunits ,alsoshowninFigure4.eachpolicy subunit is a maximal contiguous sequence of addressesinthesourcesubnet all of which canreach the same portions of the destination subnets.


Given that equation 1 seems to systematically underestimate higher latencies, exactly the error that we want to avoid, we realized that we could modify the equation to reduce these errors.

we experimented with several modi.cations, including a linear multiplier, but one simple approach is: function Modi.edEqnOne(RTT, MSS, Length,w4m, p, CompWeight) temp = EquationOne(RTT, MSS, Length, wm, p); return(temp + (temp*temp*CompWeight)); we overpredict by a term proportional to the square of the original prediction.


30 0.75 ..... ..... 0.5 0.25 1000 2000 3000 4000 5000 Assured Rate (Kb/sec) Figure 12: Service differentiation with over-subscribed case 4.2 Effect of assured rate A In this section, we study the effect of assured rate A on the achieved rate of a TCP session.

we examine whether it is pos- sible to achieve service differentiation across a set of TCP sessions by choosing different assured rates.


In this paper we describe the data collection procedure and the challenges we have faced with dealing with high-speed data collection and give examples of how data have been used in di.erent projects.

we describe a current project, the Antispam project, aiming for spam detection mechanisms on the network level where characteristics of SMTP tra.c are collected and analyzed.


Another possibility is to have n trees, each with di.erent roots, that each span the entire network.


In 1993, Syverson and Van Oorschot [21] developed SVO logic in order to unify the previous BAN family of authentication logics.

sVO combined three of these extensions (GNY, AT, VO) and BAN.


However, besides the di.culty of acquiring local host/server/access information, our main goal is to identify to what extent the IPv6 Internet may itself be responsible for a slow IPv6 adoption.

given the lack of meaningful incentives to entice existing IPv4 content providers to become IPv6 accessible5 , avoiding disincentives is vital; and poor connectivity quality would certainly qualify as a disincentive (see [5] for a related discussion).


Therefore, in order to understand the phenomenon of non-cooperative systems Koutsoupias and Papadimitriou [14] initiated investigations of the coordination ratio, which is the ratio between the worst possible Nash equilibrium and the social (i.e., overall) optimum.

this analysis seeks the price of uncoordinated sel.sh decisions ( the price of anarchy ).


However, Figure 7(c) con.rms the superiority of cluster-based schemes also in terms of energy e.ciency.

poor users experience the best e.ciency improvement, while good users experience similar performance as for the case of ideal PF scheduling with one user scheduled per frame.


Epidemic protocol Similarly, the upper bound in terms of delivery ratio for store and forward approaches can be obtained by using the epidemic routing protocol.

for our experiments, we used the pure epidemic routing protocol proposed by Vahdat and Becker in [20].


PMIPv6 does not require the network-layer movement detection or MN's IP address change after handover.

the MN always maintains the HoA and does not need to perform Duplicate Address Detection (DAD) procedure.


We show a memory allocation for the CIOQ switch, and a feasible memory partition between the input and output ports, which is su.cient for this setting.

the set of packets transmitted from the CIOQ switch will be identical to the set of packets transmitted from the OQ switch.


The .gure shows that the number of graph components .uctuates and evolves over time.

compared to business hours, the number of components during the wee hours of the morning tends to .uctuate more widely and are thus less stable.


zm = f(.m) - P h£.£ m,m =1,...,M, £=0 s 2( PL £=2 h£e(e- 1).£-2)= y ' Vy (11) V : 0 zm = 0,m =1,...,M, with decision variables z1,...,zM , the elements of V,and h0,...,hL.

(11) minimizes the following L1 norm ||(f(.1),...,f(.M ))-(u(.1),...,u(.M ))|| and ensures that u(·) is convex and underestimates f(·)at .1,...,.M .


Vision Daniele Tarchi Romano Fantacci Dania Marabissi Department of Electronics and Department of Electronics and Department of Electronics and Telecommunications Telecommunications Telecommunications University of Florence University of Florence University of Florence Firenze, Italy Firenze, Italy Firenze, Italy daniele.tarchi@uni..it romano.fantacci@uni..it dania.marabissi@uni..it ABSTRACT Wireless communications have achieved a great attention during the last decades due to the easy implementation, possibility of delivering multimedia services to rural communities, suitability for public safety and emergency communications.

a wireless network designed for an emergency scenario has to be capable of managing all the phases of an emergency situation, from the prevention to the post-emergency management.


To estimate the traf.c load of the block, suppose we i=i randomly sample n packets out of the m packets.

each packet has an equal probability p =n/m to be sampled.


Streaming Quality Qk, the streaming quality received at Hk, measuredasnumberofreceivedlayers.

qm is used to denote the number k of layers received from the supplying peer Hm.Consequently, Q0 k is thenumberoflayersreceivedfrom server H0.


(Pcell_i 0.5)4 gives more weight to towers that have 0 a Pcell_i close to 0 or 1.

the more certain an Data size (KB) estimation is, the more we trust it.


This goal seems realistic and we believe that it is the goal every voting system should aim for.

in case of veri.ability, if this goal is achieved, one can be sure that the votes of the honest voters are counted correctly and that every dishonest voter votes atmostonce.


However, since a virtual device only affects egress traffic, one single virtual device is attached to the network interface card for egress traffic to impose predefined network effects, as shown in Figure 4.

each VMN has a list of mobility events, which describes the movement of the corresponding mobile host in the target network.


It is dynamically constructed for a varying set of active .ows, by applying hash functions to .ow IDs.

no memory space is needed to describe the mapping explicitly.


That is, the MN receives 4 TCP messages through MAG 1 whereas remaining TCP messages are received through MAG 2.


Typically, BGP is used for exchanging reachability information of external destination pre.xes.

routers at the periphery of the ISP speak external BGP (eBGP) with routers outside (from customers or other ISPs) to learn about destination pre.xes reachable via these outside routers.


A Multi-Channel VANET Providing Concurrent Safety and Commercial Services Tony K. Mak Kenneth P. Laberteaux Raja Sengupta Department of Civil and Toyota Technical Center Department of Civil and Environmental Engineering Ann Arbor, MI 48105 Environmental Engineering University of California Berkeley, CA 94720-1740 klaberte@acm.org University of California Berkeley, CA 94720-1740 tonykm@path.berkeley.edu raja@path.berkeley.edu ABSTRACT In this paper, we propose a medium access control (MAC) protocol to support the multi-channel operation for dedicated short range communication (DSRC).

we focus on the challenge of providing potentially highbandwidth for non-safety applications provided by roadside infrastructure, without compromising safety communication occurring in a separate channel.


Our results show that even though the theoretical models make simplifying assumptions, this technique still works well and robustly in the face of realistic radio e.ects and hardware limitations.

we modi.ed the algorithm to deal with communication latencies, but it still achieved synchronicity reliably and showed predictable behavior in relation to parameter choice.


A hallmark of SDN is having an open interface for controller software running on a commodity computer to install packet-processing rules in the underlying switches.

the OpenFlow protocol (see www.openflow.org) has signi.cant momentum.


Flooding Every LSA is .ooded throughout the AS.

this means that a false LSA advertised by the attacker will eventually be received by the router on whose behalf the false LSA has been advertised.


Game players are immersed in their voice communication experience as they exchange live voice streams which are rendered in real-time with directional and distance cues corresponding to the users positions in the virtual game world.

we propose a Mobile Immersive Communication Environment (MICE) which targets mobile game players using platforms such as Sony PSP and Nintendo DS.


Also, we are exploring the use of the public traceroute servers despite the many challenges they introduce.

we are investigating ways to reduce the amount of measurement data needed from each vantage point to lower the load we would impose on the public servers.


In other words, it can be much more elaborate than just the simple switching ASIC that is often postulated in SDN discussions, and so is deserving of more sophisticated abstractions.

the use of FPGA (programmable logic) technology in switching hardware offers scope for soft hardware , with the potential to blur the distinctions between traditional capabilities and roles of hardware and software, and hence open the door to Softly Defined Networking that involves a less restrictive view of hardware-software partitioning.


To better understand the Manhattan grid scenario, Figure 2 shows the estimated cluster coef.cient and the node degree for the considered vehicle densities.

figure 2-(a), we show the estimated cluster coef.cient and its evolution.


The novelty here is that we use the reordering of M1 and M2 to serve as the erroneous event.

if there is forward-path reordering, the receiver will be compelled to send R3 and another normal response (R1 or R2).


These decomposition results provide a meaningful and quanti.able way to understand, analyze and distinguish the structures of large traf.c graphs that are otherwise hard to visualize and comprehend.

it also sheds light on how the giant connected components (GCCs) of these graphs may be formed.


The delay.. specifies the maximum delay that tolerates.


Since the data they deal with is not in large amounts and flow in low rates to the sink, the concepts of latency, throughput, delay and jitter were not primary concerns in sensor networks.

no particular attention was given to information and time criticality of target applications.


The evaluation objective of our Markov routing algorithm is to investigate where our algorithm is located in this performance spectrum.


While these methods are successful in .nding hierarchies, the hierarchies they .nd have a simple tree-like structure.

if an entity in the network shares multiple types in the hierarchy (in other words, the hierarchy is not a simple tree), then these methods cannot capture this shared structure in their models.


Here, complexity refers to measures like time and message count, but also performance measures like approximability.

these measures have nearly always been functions of the metric parameters, such as the pathloss term a, but this dependence is often hidden in big-oh notation.


In single-machine scenarios, ns-3 takes care of the taps, which seems a high load for the process.

it is more efficient when the traffic has to be eventually sent to a real network.


Network coding achieves the same goal, but with fewer time slots.

alice and Bob send their packets to the router, one after the other; the router then XORs the two packets and broadcasts the XOR-ed version.


These resources can compose synergistically or competitively.

choosing a power efficient communication speed (respectively, processor speed) in one part of the network may either increase or decrease additional power-efficient opportunities for other re- sources on the network.


CONCLUSIONS In this paper, we provided a case study of OSPF be- havior in a large operational network.

we in- troduced a methodology for OSPF traffic analysis, treat- ing LSA traffic generated by soft-state refresh, topology change, and redundancies in reliable flooding, in turn.


It thus pro of frame size improves RSE of |C |.

when the vides us scalable authentication scheme for large-scale RFID number of tags is 1,000,000, the RSE is 0.73 with f=32 and  1  Relative Standard Error 0 Reciprocal Counterfeit Ratio Reciprocal Counterfeit Ratio (a) Fixed total transmission cost at 20KB.


R.S According to [34], this implies that, in the actual binomial case,  -3 -2 PrIR = ß|S |/2= (|n-U(t-1)|)·O(n )= O(n ).

r.S with probability 1 - O(n -2), there are at least a 2ß f fraction of all the r-cells in which nodes belonging to U(t - 1) can not receive m in time slot t. Meanwhile, by some standard Cherno.


This motivated the following fairly simple analysis of pTO, which assumes that every loss identi.ed by duplicate ACKs is identi.ed by the .rst duplicate ACK received.

let A(w, k) denote the probability that k out of w packets are acknowledged, given that there is a loss episode in a round with window size w. Let C(w, k) denote the probability that exactly k packets are received from a round of w. k {k (1- p)p (1- p)p , k<w A(w, k)= C(w, k)=w 1- (1- p)w (1- p),k =w Given a round of w packets that has a loss episode, the scenarios that lead to no duplicate ACKs, and thus a TO in the round, are: 1) the entire window is lost, or 2) i out of w packets reach the receiver, the receiver sends i ACKs, the sender sends i new packets and all i packets are lost.


In the content-oriented security model described earlier, the following must hold: The consumer must know the name of the content they want.

they must be able to map between the real-world description of what they want (e.g., CNN headlines) and its corresponding ICN name.


We choose to implement an SNRtriggered rate adaptation with equal air time to benefit more from higher data rates.

the data size of the packet is bigger for higher rates in order to have equal transmission periods over the air for all rates.


This process ensures that Pathi Pathj = and Payloadi Payloadj if i j.

the source = = only encrypts the payload with the symmetric keys for the relay groups R1,...,Rd-1.


As can be seen, PCIQ (with RECN) is the only one that .lters out the HOL blocking completely, thus achieving maximum switch e.ciency.

by correctly handling HOL blocking, it achieves 90% of switch e.ciency while CIOQ and HC organizations obtain results about 50% or even less.


With 10 neighbors or more, the RCM cost is higher with TRP than flooding.

with high density, multiple floods to achieve 99% percent reliabiliity is cheaper than a single TRP flood.


The .gure shows the standard deviation logically varies depending on the fraction of clusters used.

increasing the number of points used to compute the .t decreases the number of clusters left for value estimation, making estimation errors more noticeable for smaller clusters.


K Pt If k=1 R,k = minl Ql,max, the normalization factor .k can be calculated directly based on (PtR,k) obtained from solving problem (21)-(25) by normalizing the beamforming vectors given in (11).

when Ql,max = Ptotal, which might be the case of .xed relays with a high power budget (or no individual power constraint applied on each relay), only the .rst sub-problem is needed.


Withthese considerationsin mind,if welook at(1),(2), (3) and(4) itis evidentthattheperformance of each single user depends not only on the PHY mode it chooses, but also on the PHY mode selected by every other user.

the choice of the rate performed by any user a.ects the performance of all remaining users.


PC provides further improvements after intelligent frequency selection: The application of PC after FS can successfully yield smaller cells and, thus, eliminate or reduce overlaps between cells.

since the FS algorithm may not completely isolate cells, overlaps do exist.


A few code dissemination protocols (e.g., [7, 13, 16, 22, 27, 28]) have been developed recently to propagate new code images using the ad-hoc wireless network formed by the sensor nodes.

deluge [13] uses an epidemic protocol [18] for ef.cient advertisement of meta data and spatial multiplexing for ef.cient propagation of code images.


For example, we wish to use the knowledge of the domain names by which clients refer to Internet hosts for the measurement and analysis of IP tra.c in general.

we want to classify tra.c by familiar domain name identi.ers.


Each plot indicates three different scenarios.

each plot includes the normalized throughput values for all the considered traf.c rates of all the access categories given .xed numbers of stations of access categories AC0, AC1 and AC2, .xed TXOP value but different number of stations of AC3 (2, 5, and 8).


Multimedia Messaging Methods In this case the streaming service is initiated by sending multimedia messages to the IMS.

sOAP attachments containing appropriate XML documents are sent to the Parlay X gateway in order to enable the stream initialization between the mediaserver and the stream consumers.


For surveys of routing in wireless networks see Andrews [4], Rajaraman [30], and Urrutia [32].

paper [4] discusses methods of assigning wireless resources under scenarios when the rates at which users can receive data are time-varying and user depending, due to channel fading and user mobility.


N of a given network topology is the maximum hop distance over all node pairs in this topology.

it is the number of links of the longest shortest path between any two nodes in the topology.


We will assume a conservative perspective and consider worst-case changes of the available bandwidth.

we apply concepts of network calculus [23] and allow for bursty dynamics.


Therefore, one common practice in developing WSN applications is composing multiple network protocols to form the application logic.

these protocols co-locate on the same node and result in a heterogeneous application.


We now formally define the (distance, weight)-based quantitative estimate of the SDT for a routing protocol R as 2 2 R RR W (7) SDTdist = WStability (Sdist ) + Delay (Ddist ) The efficiency of a routing protocol is inversely related to its SDT.

smaller the SDT value, larger the efficiency of the routing protocol and vice-versa.


An antenna at each MS transmits the data that is aligned along a vector, beamed to a speci.c antenna at the BS.

alignment vectors speci.c to each antenna of the MS are transmitted by the BS for each frame.


Therefore, we aim to achieve joint routing and compression optimization by combining the bene.ts of the various trees employed in existing work.

we borrow insight from [14] by designing trees that exhibit properties bene.cial to both routing and compression.


The sink sends to sources a request containing the maximum delay between an event detection and the noti.cation of the sink.

after a source detects an event, the sink must receive a noti.cation within the maximum delay time.


Video consumption, according to key members of the industry, is by far the most appealing service since it involves several players in the value chain where mobile operators play a renewed role.

designing the way content is cached, distributed across network components and delivered to the .nal user is a role traditionally played by Akamai, Facebook, Google, Yahoo, etc...


First, we assumed that after time 0, there are no more E-BGP updates that are injected into AS0.


It is worth mentioning that Lemma 4 provides a necessary condition for the optimal order.

a nonoptimal order (such as (14)) can also have this structure.


In order to determine the relevance of the wireless network simulators, we have to answer both following questions: 1) Does the implementation of the lower layers (particularly the physical layer) in the network simulators re.ect the reality?

does it give results close to the reality?


Furthermore, there is a simple optimization to address the overhead from undeliverable packets, which is for the root to send a packet to the source and the intermediate nodes to inform them that a given destination is undeliverable so that the undeliverable packets are dropped.

this should not be an important concern in practice.


Our work informs the design of such wide-spread redundancy elimination services.

our work shows where middleboxes are bene.cial, how to design those caches and how much cache to provision to obtain reasonable redundancy elimination.


That is, if the contract signing protocol is executed unsuccessfully, each of the two parties cannot show the validity of intermediate results generated by the other party to outsiders.

each party cannot convince an outsider to accept the partial commitments coming from the other party.


As a result, its performance is highly dependent on the CPU speed.

we can summarize our .ndings as the following: Observation 7: RDMA lends itself much better to the DFVS technique than TCP, because RDMA communication performance is a.ected 1600 1400 1200 1000 800 600 400 200 0 much less by the CPU speed.


Total node strength grows super-linearly (power-law) by increasing degree.

the more number of contacts users have indicates that super-linearly more amount of time they will spend on the phone.


Our Chaos implementation has an 8-byte header.

if the payload is, say, 10 bytes, it supports up to 856 nodes since at most l856/8l = 107 bytes are available for .ags, one bit per node.


But the e.ort to achieve results equivalent to those possible with a Geocast based on .ooding is much higher.

an e.cient Geocast protocol necessitates a much higher injection frequency or destination region in order to achieve a successful attack.


A consequence of running a routing algorithm for data deliv- ery is that there could be packet loss during transient condi- tions when member routing tables have not yet converged.

there could be packet loss when a member leaves the group or when a link is dropped for performance reasons.


Users share the content updates they have downloaded from the service provider with other users they meet.

whenever two users i and j meet, they may or may not share their content updates.


However, it is proven that the MCS problem is NP-complete [22] and APXhard [23].

there is no ef.cient algorithm, especially for large graphs such as those of data center network topologies.


sn determines the action ank to be taken in stage k given the play path up to stage k - 1.


Based on our analysisinSection3, weknowthattheprobabilitythat thereis an undiscoverednode after the .log2 n.-th phaseis1-e -e -c .

all n nodes arediscovered within .log2 n. phases w.h.p.


However, there are other potential goals for the measurement subsystem to be considered.

it may be desirable to limit the rate at which samples are produced, in order to control the resulting load on the router generating the samples, the measurement collector, and the communications network that is use to transmit samples between the generator and the collector.


The playback rate of the video is 40 or 50 packets per second and each packet consists of 1448 bytes.

the bandwidth of the video is approximately 480 or 600 Kbps.


So .1 does not affect the value of x0 and y0.

the linearization accuracy has no impact on estimation process.


In order to be useful, the definition of domination between seri- alization orders must imply domination between protocols, as follows: Serialization order S dominates serialization or- der S ~ if, for a given workload and faultload, the dominating algorithm using S can commit a write W whenever the dom- inating algorithm using S' can commit that write.

s dominates S' if S allows the commitment of any write that could be committed using S'.


However, in recent years these clean slate efforts moved beyond adding functionality and have begun addressing the reason we had to turn to clean slate design in the .rst place: architectural rigidity.

the research community is now devoting signi.cant attention to the design of architectures that can support architectural evolution, so that future architectural changes could be made incrementally rather than through a series of clean-slate designs.


A matching M in G is a set of pairwise nonadjacent edges.


Smax is bounded to the di.erence from message deadline and transmission time for each node, while Smin is at least 0.0, as the message will be discarded at some intermediate node if the slack is less than 0.0, namely, its deadline expires.

the chop partition dispatches to Sink 1 themessage whoseslack belongs tothe rangeof 0.0 through c. each node sends the message along the fast path, if the message has a tight deadline.


It is typically modeled on layer 3 of Internet protocols because economic relationships can be inferred from BGP (Border Gateway Protocol) [55] and IP (Internet Protocol) [53] measurements.

bGP identi.es ASes (Autonomous Systems) on announced paths, enabling inference of layer-3 structures where ASes act as economic entities interconnected by transit or peering relationships [30].


We see that ZipTx s throughput gain follows a similar pattern to the ideal throughputgain in indoor channels, shown in Figure 5, though is a bit lower due to practical overheads.

the throughputgain is typically around 10-20%, with some cases being as high as 50%.


We recall here that we consider data tra.c, which is not power-controlled, as is voice tra.c, but instead is rate-controlled.

we assume that the BSs operate at full power as long as there are any active .ows to serve, and use zero power otherwise.


In all cases, any infected peer in the alternative system is also in the comparison system.

any of the following events occurring in the alternative system also occurs in the comparison system: (a) the seed creates an infected peer, (b) an infected peer creates an infected peer, and (c) an infected peer replicates piece one to a one-club peer.


However, this may not be possible for Jing s approach because the number of bit-sequences (i.e., log(k)) is completely determined by the number of updates, k, during the window period (assumed fixed), and the number of updates, and thus, the update rates have nothing to do with FIR, as shown in the tables.

even though there is still bandwidth left for use, Jing s approach simply cannot use it to reduce the false invalidation rates.


Research e.ort is also required in realization of delaytolerant routing across the network.

integration of communication predictions and coexisting of protocols need to be resolved.


The loss detection time is then given by the di.erence between the predicted and the hypothetical delays.

w[n]= s2[n]+t -s[n * ], .n : s[n]= 8, (18) where n * is the last successfully-received packet.


Our prototype library uses heuristics that are inexpensive in terms of probes, robust in the face of incomplete information provided by the primitives, and produce good results.

the topology probing layer provides the small set of facts that the underlay has learned about the Internet s topology, while the routing services library represents the higher-level conclusions one might derive based up on those facts.


Forsuchrandomwalks(formally called continuized random walks [1]) it is possible to show that if G is connected, the steady state probabilities that the walk is at a vertex i always exist and are equal to di pi = Pn .

(1) i=1 di if the query packet is forwarded for su.ciently long time, the probability it will be on vertex i will be proportional to the degree di of i.


As shown, AA ratio increases from 3.1 to 3.5 simply by adding R2.

duplicate transmission does occur in the case when relays cannot hear one another.


Hence, in this use case, we .ll three quarters of the packets with nearby and accurate information to conduct aggregation, and we add one fourth of remote information to propagate already aggregated data.

we have two rating functions R1 and R2 with .


measured patterns or statistics, but ignoring the feedback that en-In this paper we present a preliminary investigation of the posergy saving schemes may have on the traf.c itself.

without sible intertwining between capacity scaling approaches and TCP taking into account the possibility that changes in the instantaneous congestion control, and we show how this interaction can affect offered traf.c rate may be caused by the effect that energy-saving performance in terms of both energy saving and QoS.


life-critical safety messages can be unreliably delivered due to such interference, which deteriorates QoS of safety applications such as cooperative collision warning.


In the system, the Cloud OS is responsible for VM management like VM creation and migration, and the network controller directly connects to all OpenFlow enabled switches and makes routing decision on their delegation.

we note that OpenFlow switch support modifying packets header and thus use it to implement the programmable gateway.


Recall that SUs are allowed to use any licensed band only if the band is vacant, and that discovery of opportunities is done through spectrum sensing.

sUs periodically, or proactively, switch to and sense certain bands to .nd out whether any of them are vacant.


We provide the .rst lower bounds on the number of beacons required for a triangulation in some speci.c simple networks.

these bounds (i) answer Slivkins question positively, even for one-dimensional metrics, and (ii) prove that, up to constants, Slivkins triangulation achieves an optimal number of beacons (as a function of the approximation guarantee and the doubling dimension).


The average number of links traversed across all topologies in our architecture is 6,208 links (for 1,000 samples), while the average for triangle routing is 11,157.

on average, triangle routing for MIP consumes almost twice as much network resources as does a shortest path approach (such as MIP with route optimization or our proposed protocol) for the same scenarios.


There is a signi.cant disconnect between the original ADMR protocol as published and the conditions encountered in a real sensor network.

aDMR assumes symmetric links, uses hop count as its path selection metric, and ignores memory space issues when maintaining routing tables.


Our simulation-based evaluations of a large-scale vehicular DTN demonstrated the e.cacy of our schemes.

under pragmatic assumptions, our schemes were shown to achieve 20% higher delivery ratio and less than half of the delivery costs of comparable strategies.


Our motivation of performing encoding across packets comes from the empirical analysis of loss characteristics in the vehicular testbed.

we .nd that most of packet losses (>80%) result from the failure of detecting packets at the receiver, rather than bits corruption.


5.1 Topology lay-out strategy and required area In this subsection we apply our lay-out approach for a single topology and we examine the benefits on the required lay-out area, varying a single technological parameter at a time.

we examine the impact of smaller chip footprints (sh = sr = 26 mm, and sh = sr = 10 mm), smaller bending radiuses (ro = ri = 10 mm and 1mm - for both intra- and inter-node connections), and smaller crossing angles (.


Continuing to increment the metric of link A B from 2 to 4 further path changes are introduced in the routing table of some nodes, as shown in Table 3.

nodes A and B completely stop using the link A-B for any destination.


let X~ be a indicator variable for the event that node r is a receiver for the next request, given that the source node for the request is s. 1 if r is a receiver for next request Xr = given that source is s 0 otherwise Clearly, the number of receivers for the next request given that the source node is s is ~reR Xi, where R is the set of all possible receivers (egress nodes).


It is important for scalability that solutions to the two problems be independent.

we cannot accept solutions that require an update for every rider when a bus moves, nor can we accept solutions that require an update for the bus when a rider with a laptop gets on or o..


The intuition behind our defense strategy is that nobody can craft one key to open two di.erent doors.

if a receiver cannot tell whether there is an attack or not, maybe a second receiver can.


The multiset representation and the aggregation process di.er for the computations of the scope and the severity of an outage.

they are used as follows:  Scope computation: each domain prepares a multiset, where the elements represent the unreachable destinations, and each unreachable destination only occurs once.


In this direction, we envision a particularly promising type of nanomachines based on key synthetic biology techniques [21], which allow to genetically engineer cells, such as bacteria, and program functionalities in the biological environment.

a synthetic biological circuit [19], or simply biological circuit, allows to program logical functions from simple controlled production of speci.c types of protein molecules, to complete engineered cell-to-cell interactions [18], such as a di.usion-based molecular communication system, in a similar way as it is done with electrical circuits.


Indeed, the .gure shows high spatial correlation between the two sets.

enhanced Googlebased trace now has 12,375 IPs, while enhanced network trace has 10,627 IPs.


Since DistGreedy approximates the optimal solution to the MWIS problem at each time slot, we focus on the behavior of DistGreedy under static interference models, where the interference relationship does not change across time.

we use one-hop (or primary) interference model, under which two links that share a node cannot transmit at the same time.


Note that though we use cumulative acks, we do not guarantee reliability at link layer.

each node retransmits a lost packet a few times (default is 2), and then gives up.


This improves for each heuristic, leading to an 82 percent rating for heuristic 5.

if we use heuristic 5, we have that for 82 percent of the claims in the test set, the algorithm is able to either .nd an attack, or verify correctness for an unbounded number of threads.


In this work, we assume that a fair scheduling strategy is used in the sense that on the average the network resources are distributed equally among all users (see [2]).

all users have an equal chance to send their information.


3.4.12 Remote NAT probe One of the main issues we had to face is the detection of remote NAT elements.

we wanted to learn if the remote party is in a private network environment.


In this talk we review the introduction of peer-to-peer (p2p) technology and examine the implications that it may have on the Internet over the next ten years.

we examine the e.ects of p2p on economics for Internet service providers (ISPs), and the impact on how they manage and engineer their networks.


Therefore, the bandwidth consumption of our replication method, L, is, at most, two times the ideal L * (we omit the full proof due to space limitations): L = 2 · L * (2)  5.2 Concurrent provisioning of many servers In our next experiment, we consider a typical application of multicast tra.c.

we source multicast traf.c from 6 user ports in 3 leaf switches (2 sources per leaf ).


n)n.N for which there does not exist a coalition S and (rn)n.N .

* V (S) such that (rn)n.N >n (rn)n.N for all n .S.no coalition of nodes can deviate and improve their relay selection by cooperation in the coalition.


3), in TDGs we have no clustering of highest degree nodes.

top ranked nodes (e.g., large DNS servers) are not observed to exchange packets with each other.


Although joining these two functions is challenging, doing so may result in a more stable global network (fewer control loops).

doing so may allow some alternative custodians to be identi.ed that have better routes to the destination of messages.


4.3 Impact of Application Traf.c Next, we study whether minProbe is impacted by characteristics of application tra.c.

we focus on two characteristics that matter the most for available bandwidth estimation: the length of a probe train and the distribution of probe packet sizes.


However, this simple method can lead to a violation of the monotone property of the quantile estimates.

if p(1) <p(2), there is no guarantee that the estimated quantile for p(1) is strictly less than p(2).


The .rst category takes a centralized approach.

a centralized entity in a DSA network controls the spectrum allocation and access rules for the network.


All normal nodes simply join and listen to the coordinator s schedule.

formation of the WirelessHART mesh network consists of three main phases: network initialization, device joining and normal operation.


However, since it sits on top of the standard network interface card drivers, it is a.ected by the same problems identi.ed in the previous section.

for each incoming packet a temporary memory area, called socketbu.er[8,21],is allocatedby the network driver, and then copied to the PF RING ring bu.er which is memory mapped to user space.


The .nal selection is a local optimum, with limited guarantees in comparison with the global optimum.

the initial selection can have a signi.cant impact on the performance of the .nal solution [9].


Now, to implement such a service over individual ISP networks, we contend that one needs a similar ISP-wide IPC service over each ISP network.

we need to repeat such an IPC service over di.erent regions/scopes.


Comparison with multi-radio mesh routing: Traditional multi hop, multi-radio mesh routing and channel assignment algorithms operate at .ow level.

they do not stripe packets from individual .ows across multiple interfaces.


The basic idea is to extend conventional contention-based floor acquisition (using RTS-CTS) to be path-oriented.

that is, floor acquisition control messages travel multiple hops along the path, switched at the physical layer, and as shown in Figure 2, PAC acquires the floor in units of variable-length segments.


We consider clustering the routers into groups which could be represented by a single Platypus waypoint.

we study the impact on end-to-end one-way path latency of routing indirectly through a waypoint of varying granularity.


However, .nd # of links remaining in G' ' r# of bad paths remaining in G' ing MILSes di.ers from the usual problem of .nding a sparse k' =s' rank of G' basis for the following reasons: The sparse basis problem is an NP-hard problem, and nearly all the heuristic algorithms for this problem are based on a nondegeneracy assumption.

these heuristics require that every submatrix of G with G reduced ¯G after removing good paths & links ¯G a basis of G'' , also a basis of G' Q' ,R' QR decomposition of ¯G' T .


The P-P and MIS vs. FIS shows how mobility a.ects data dissemination.

the MIS vs. FIS comparison focus exactly on the e.ect of server mobility on data dissemination.


For the triggered events, one domain should not beconstrained by another domain.

when CSFB is triggeredin the CS domain, it should perform 3G.4G switch when the call ends.


We should keep in mind, however, that large institutions often  IP: a IP: A Port: p =   IP: B IP: b = Port: q Figure 4: Network Con.guration block most applications at the .rewall anyway.

the connectivity problem is often not with NAT per se, but rather is a feature desired by the enterprise s IT organization.


Once the video streaming session has been closed, there are still a considerable number of packets in the AP buffer that must be flushed from the queue which results in the gradual decrease in the BWLOAD over time.

it can be seen that the packet size of the background traffic load plays an important role in determining the background traffic load that can be supported before the video stream is severely corrupted and ultimately terminated.


The .gure shows, for a process with .xed standard deviation (stdev=0.3), and Hurst parameter (H =0.8, which is a fairly typical value for traf.c data), the impact of varying .. We can see in this case, that the insight from the M/M/1 queue applies, only more strongly.

for .nite length data we have fundamental limits on the accuracy with which we can know the average queueing delay, and these limits decrease more slowly for LRD dependent data.


Furthermore, this input can be constructed even ff we axe subject to the requirement that edge costs are proportional to the rate of the flow crossing that edge.

if for any edge e, there is a constant c(e), such that the cost for any group g to use e is B(g)c(e), where B(g) is the rate of 9.


Mathematically, the problem and goals of this work is formulated as follows.

i0 i0 i0 Let Pi0={ v ,v ,...,v } denotes the routing path from vi to 12 k i0 1 vktree T and a request set D, a working set WT,D denotes the set of all SSs that participate in the data transmission for satisfying all request in D. v0(BS), where vi0 and are vi and v0, respectively.


In this paper, we address the model used for the work in this area.

the previous work on pricing mechanisms for multicasting [10, 15, 17, 21] uses a transmission model with a number of simplifying as- sumptions.


The question may be set, aren t we filling a desperately needed hole with this system?

couldn t those things be done with existing techniques?


Considering that CC2420 treats all bits in the payload reception mode as payload bits, it is theoretically possible for the colliding packet to be embedded in the cor rupted packet.

the .rst half of the corrupted packet would contain the original data, and the second half would be overwritten by the stronger packet.


we will show that DFRAC = c(a, d) · CCUT, completing the proof of Theorem 1.


TDMA, on the other hand, can be used to address a spectrum of potentially complimentary issues.

end hosts might still choose to employ a modi.ed TCP during their assigned time slots.


To this end we introduce the so-called line segment traversing process which de.nes the movement of points in a given region.

the points move along the line segments with a spatial velocity which depends on the current location of the point.


For each subset .. of ..,we use ....,.. to denote the set of all replications of the links in ...

....,.. is the set of all replicated links of the links in ... A subset .. of ....,.. can transmit at the same time if and only if (1) all replication links in .. are radio-disjoint, in other words, no pair share a common radio, and (2) for each channel .., all the replication links in .. transmitting over channel .. are con.ict-free.


In this paper, we focus on analyzing the channel popularity in the context of Internet Protocol Television (IPTV).

we aim at capturing two important aspects of channel popularity the distribution and temporal dynamics of the channel popularity.


These methods can therefore be extended in order to allow the terminal to keep the same IP address on different interfaces.

the inter technology handover becomes transparent to the GMD.


Introduction In general, network protocols in implemented in hardware can be faster than those implemented in software because it avoids sequential processing of individual functions and perform multiple computation activities at the same time through parallel processing.

the major reasons for building hardware component are the satisfaction of performance constraints.


While the problem sounds simple, there are four main challenges to available bandwidth estimation timeliness, accuracy, non-intrusiveness, and consistency.

an available bandwidth estimation methodology and tool would ideally add as little overhead as possible and return timely and accurate estimation on the available bandwidth consistently across a wide range of Internet tra.c conditions.


Note that the inference of failure location is based on router location, but the actual failure could be at the link or router attached to the last responding router.

the availability estimate is computed as follows: If Tcis the ' total time failures attributed to routers of class Cwere observed, c and Nis the total number of routers of class Cwe observed on d each path on day d,6 then we estimate the availability of a router (or attached link) of class Cas: Tc Availabilityc 100x1-' dNdcx  day the fraction of time unavailable is the aggregate failure time attributed to a router of class Cdivided by the total time we expect to observe a router of class Cin any path.


The channel capacity is however limited and may not support the high overhead incurred.

under these conditions the maximum achievable PDR may become less than the PDR requirement of the application.


We use colors to highlight the 103 number of domains in SWITCH that were unable to connect > 0 hosts > 2 hosts to certain BGP pre.xes.

darker colors denote more domains are a.ected.


1, where the sender (base station) distributes independent messages to N mobile users through wireless broadcast channels.

the sender manages a separate queue for each sender-user link.


Next, we show that .pDpt ` 1qq d .pDptqq ` 1.

.pDp¨qq can at most increase by 1 in each time slot.


A signi.cant advantage of the receiver over the attacker is that the receiver just needs to .nd contradiction to detect the attack; while the attacker has to know all channel information for signal manipulation to make sure no contradiction is found.

when the receiver adds one more passive helper, it actually reduces the attack situation to the normal case.


In order to introduce priority, we propose cache management with regenerations and degradations.

the client activity is monitored locally at each serving broker.


We observe that as ß is decreased, many of the high-performance 4+ hop paths are replaced by sub-optimal 3 hop paths.

the average 3-hop path throughput is 3.8, 3.98 and 4.29 Mbps for ß=0.7, 0.8 and 0.9 respectively.


Minimizing Server Throughput for Low-Delay Live Streaming in Content Delivery Networks Fen Zhou Shakeel Ahmad Eliya BuyukkayaTelecom Bretagne De Montfort University Telecom Bretagne Brest, FranceLeicester, United Kingdom Brest, Francefen.zhou@telecom-sahmad@dmu.ac.uk eliya.buyukka@telecombretagne.eu bretagne.eu Raouf Hamzaoui De Montfort University Leicester, United Kingdom rhamzaoui@dmu.ac.uk ABSTRACT Large-scale live streaming systems can experience bottlenecks within the infrastructure of the underlying Content Delivery Network.

the equipment bottleneck occurs when the fan-out of a machine does not enable the concurrent transmission of a stream to multiple other equipments.


Our contribution here is to design a basic architecture for high-performance IP lookup engine with GPU, and to develop e.cient algorithms for routing pre.x operations such as lookup, deletion, insertion, and modi.cation.

the IP lookup scheme can achieve O(1) time complexity.


Computing Separable Functions via Gossip Damon Mosk-Aoyama Department of Computer Science Stanford University Stanford, CA 94305, USA damonma@cs.stanford.edu ABSTRACT Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed manner.

we consider separable functions, which can be written as linear combinations of functions of individual variables.


Indeed, existing protocols either do not satisfactorily address the problem of coercion and vote-buying [2, 3, 10], or they are too impractical and involved to be understood by the vast majority of users [5, 11].

a notable problem is to achieve the property of individual veri.ability (a voter can verify that their vote was counted as intended) without violating coercion resistance (a voter cannot prove to a coercer how they voted).


Several WBAN protocol proposals can be found in the literature, as well as studies of applicability of existing Wireless Sensor Network protocols in WBAN scenarios, see for example [3, 4, 5].

[3, 5] consider the IEEE 802.15.4 standard as reference [6].


These have already chosen their roles and included all relevant information (including the selected role) in previous update messages.

a has received update messages from all nodes behind the wave (on the left).


A quick glance at publicly available maps of some of the major backbones2 show that most cycles in NSP networks contain at least one peering point, provided we treat multiple direct links between two points as a single bundle.

the Internet is mostly a tree, except for public peering points and very short redundant paths such as FDDI rings and n × m fabric at PoPs or between core routers and border routers3.


Usually, the volume of valid web pages cached at each proxy remains the same roughly if the system is stable.

the web page expiration rate is commensurate with the fetch-in rate.


We now evaluate the impact of different levels of noise in Net-Flow and SNMP measurements on the traf.c matrix inference.

we tune the noise level according to the model presented in Section 3.


By intensively experimenting (to be reported later) on our MicaZ Motes and their CC2420 radios, we have discovered that it would be more e.cient to use the spectrum resource in a continuous manner.

we should allocate channels to nodes or links in terms of their center frequencies (rather than a .nite set of channel IDs).


The BitTorrent implementation is modular.

the 1The source code of our BitTorrent implementation is available from the website of the corresponding author (http://www.tuhh.de/et6/research/bittorrentsim/) peer and the piece selection algorithms can be replaced by alternatives.


Our synthetic graphs also consist of connected components of size distributions similar to our UAGs.

more than 90% of users belong to one connected component, and the second largest component is of negligible size.


Finally, we showed that our approach can result in much more accurate estimation comparing to traditional rate-control mechanisms such as ESRT [19] and RCRT [17].

our protocol can transfer sensor data with 3 to 100 times less estimation error.


The solution of the steady-state equations will provide us with the probabilities .Fj in equation (3).

the probability of each cycle Fj is given by the limiting probabilities of states ss(x,1) and ss(x,x+1), which correspond to a cycle starting in the state ss(x,1) or ss(x,x+1) respectively.


In SC and MRC cut-through schemes, each forwarding node combines all of the incoming signals, i.e., K in equation (3) is equal to N. Because diversity combining is not possible at the first hop receivers, the three schemes share the same BER results.

due to zero MAI, the average BER at the first hop receivers is 10-3, 4·10-5, and 0 for 0, 1 and larger decibels of Eb/N0, respectively.


However, a user node may deviate from the speci.ed protocols.

user nodes may not report loss probabilities {(i,j,Ei,j )|(i,j) .


5.2 Overhearing-oblivious rate selection To begin, we consider the performance of ExOR as originally described by Biswas and Morris [6].

we assume that all nodes in the network use a single, .xed speed.


of two independent one-way tunnels depending on the reverse mapping computed by PCES during Step 1.

an ITR is capable of forwarding traf.c to ED, using as source address in the encapsulation an RLOC that might be different from its own RLOC address.


This approach is network-aware and hence di.erent from controlled .ooding, directed di.usion, probabilistic .ooding or broadcast-storm techniques.

the routing algorithm ensures that packets on the network are forwarded by only those nodes that are likely to increase the chances of the packets reaching their destination.


A case study where a UWB monostatic WSR network is deployed to infer the position of moving target objects is considered.

bayesian navigation based on particle .lters implementation is analyzed and the role of mobility model for inferring target position is shown.


While most of these papers assume that players update their actions following the best response dynamics, some papers argue that if players do not know the exact form of the game then it will be more reasonable to consider an imitative dynamics.

in populations with limited information about the game, players try to learn the best action by imitating those neighbors who are currently more successful [2, 5, 6, 13].


CONCLUSION In this paper, we have presented a new IPTV delivery platform that provides mobile users with customized IPTV service via WLAN 802.11 access network.

we have presented mechanisms used by our IPTV architecture to provide the tight management of QoS and security for IPTV services over two different segments of the IPTV transmission path.


Similar to transmission, there is considerably concurrency in the reception process.

packet dispatch can occur in parallel with the reception of the next packet.


The meta-information will be used by the nodes to make better decisions as to which queries to swap in order to increase the probability of matching queries.

the nodes will jointly decide which queries to swap so that the interaction results in the maximum number of matches.


Reverse path forwarding is useful for routing bundles on shortcuts.

if the destination s GUID is known to a DTN router along the default path, then a reverse path exists to that destination, and bundles can be sent there directly.


Besides causing revenue generation, pricing the system usage also allows a better coordination and a more e.cient utilization.

price tuning can be seen as an implicit Admission Control (AC) mechanism which improves the system performance.


Since most of the false positives and false negatives are located in the gray area, we focused on improving the classi.cation of those messages by using a graph-based technique.

we built a graph in which nodes represent campaigns and edges model the fact that two campaigns share a combination of sender IP address and email domain name.


Figure 1 gives the timing structure of a .uid chuck.

figure 1 (a) and (b) show, respectively, how IEEE 802.11 DCF operates with and without the RTS/CTS mechanism.


Apart from the use of advanced receivers [12], the consideration of heavy vehicles as relays could enable the reliable deployment of this application in the proposed scenario.

a controlled multi-hop beaconing mechanism could be used so that heavy vehicles dynamically detect the presence of potentially colliding vehicles and forward their broadcast messages to enable their communication at high distances with reduced transmission power levels.


Figure 19 implies the downlink utilization is considerably improved with PAQ.

pAQ prevents the idleness of downlink, which is about 20% of the whole simulation without PS.


Many of these projects are concentrating on events analysis providing statistical data, such as rapid increase of accesses on certain port numbers, by using network events monitoring.

it is getting popular and easier to monitor a dark address space, which is a set of globally an Figure 1.


For the switched model, heavy tra.c analysis has revealed some intriguing relations between the policy parameter a and the performance of the system through a phenomenon known as state space collapse.

in the heavy tra.c limit and for an appropriately scaled version of the system, the state evolves in a much lower-dimensional space (the state space collapses ).


Although we are most concerned with through- put, in our application some clients may also be concerned about latency.

it would be a shame if time-critical data were delayed from reaching the client.


As it turned out, the analysis picked up differences in the refresh algorithms, associated with different releases of the router operating system.

the first class of routers ran IOS 11 (11.1 and 11.2) whereas the second class of routers ran IOS 12 (12.0, 12.1 and 12.2).


If all connections transmit at a constant rate, and if all routers use Fair Queueing, then the network converges to an outcome that is max-min fair.

the outcome reached is such that the minimum throughput of a connection (taken over all connections) is maximized.


On the other hand, this is action cannot be taken at the source or destination.

following the de.nition of the relay-set above, thesourceisthe only member of the 0th relay-set.


For the other algorithms, the best performers also tended to place nodes mostly on channels 1, 6, and 11, but some of the algorithms were unaware of adjacent channel interference, and thus were less likely to avoid the intermediate channels.

as would be expected, Hrandom scattered access points evenly across the 11 channels, with around 9% assigned to each.


3.1 Analytical approach We adopt a model in which the topology changes and packet injections are under adversarial control.

in each time step the adversary can specify a new topology with edge costs that may di.er from previous edge costs, and it can inject an unbounded number of packets.


At its core, PCA produces a set of principal components, which are orthonormal eigenvalue/eigenvector pairs.

it projects a new set of axes which best suit the data.


Let d < n. A ]amily 3= of subsets of [n] is (n,d)-strongly-selective /] for every non empty subset Z of [n] such that IZl < d and for every element z E Z there is a set F in 3= such that Z n F = {z}.

we will use the following upper bounds [13, 1@ THEOREM 3.1.


For one, we .nd that the stable pool of server IPs is consistently contributing more than 60% of the server : : : : : : : : :  New  Rec ent  Stab e  (a) Churn of server IPs N be  e w t e e N be e e  :  server-related traf.c attributed to the stable and recurrent pools of J server IPs, respectively, Figure 5 shows for each week n three bars, : each with .ve segments corresponding to the .ve regions consid- W related traf.c.

of the server IPs that this IXP sees on : J : a weekly basis, more than 30% of them are not only seen week after week, but they are also responsible for most of the server related traf.c that traverses the IXP each week.


In the context of home automation, research relevant to the WoT paradigm was advanced in [8] and [9].

[8] proposes a structure for the implementation of physical mash ups in homes, and [9] introduces a new framework for the use of the WoT in home automation.


E.g., exponential back-o., polynomial back-on, etc.


Three experimental mapping service runs were performed: (1) The mapping service does not have any domain model knowledge.

the presence of the obstacle and its characteristics.


In the case that C runs as responder, the peer independence property can be formally proven provided that C also runs as initiator in other instances of the protocol.

the authentication information created by C as responder is simulatable from the information created by C as initiator.


If there is a possibility that the destination is not trustworthy in computation, we can apply a sampling technique to validate the computation of the destination.

for a randomly chosen session, a node may initiate a validation session to check if the computation is valid.


Figures 1 and 2 represent the different tool families for assessing network protocols, architectures and mechanisms.

they represent the cost of the experiment tools according to the level of realism expected.


Consequently, mobility occurs natively eliminating the network layer indirection introduced by other proposals [16, 25, 24, 18].

the indirection from a persistent name to a forwarding address (e.g.


It is also possible to de.ne a stronger variant of FRBC, called F+ , that more closely corresponds to what is ac- RBC tually accomplished by the Hirt-Zikas attack.

the di.erence between FRBC and F+ is that the latter only al- RBC lows the adversary to have m' =.. the adversary is allowed to adaptively corrupt the sender (based on the sender s original message) and thereby cause agreement on Functionality FRBC The functionality interacts with an adversary S and a set P = {P1,...,Pn} of parties.


consists of the current timestamp Ti and a list of tuples (d=, t~) such that t= > (T~ - w * L), where d= is the data item id, t= is the most recent update timestamp of d=, and w is the invali- dation broadcast window size.

iR contains the update history of the past w broadcast intervals.


However, as the relationship with the originating AS is more distant, the direct benefits of storing and propagating the more specific prefix routes are heavily reduced.

if we consider an ISP that has not direct nor indirect commercial relationship with the originating AS (i.e.


An orphan NIC is useless since no neighboring nodes can receive its data, but it enables us to simulate the condition in which nodes have different numbers of effective radios (i.e., non-orphan radios).

if an assignment leads to a node with x orphan NICs, it means this node is equipped with only 4-x effective data NICs and one control NIC, where 0 = x < 4.


We do not consider the case where users cannot choose consistently, either by having different users choosing differently (e.g., "edit wars") or by users changing their choice over time.

we assume that the con.ict is solved by taking the larger of the con.icting change-sets, or in the case of same sized sets picking arbitrarily but consistently.


The RCourse library is complete (goal (iii)) in the sense that a simulative study can be directly performed using Peersim and RCourse.

no further speci.cations such as scenario de.nitions are needed: pre-de.ned scenarios are provided.


However, our simulator only uses these capabilities of the model in the standard way.

the adversary SimA obtained by our construction is a natural and realistic adversary.


The second scheme, DFIM2, is designed to work well when packets are distributed according to a multinomial distribution on the di.erent paths.

for each packet there is a constant probability for the packet to be sent on a speci.c path.