This increased level of heterogeneity emphasizes the need for scalable and adaptive video solutions both for coding and transmission purposes.

in general, there is an inherent tradeoff between the level of scalability and the quality of scalable video streams.


In particular the other traces con.rm that our results are not biased by the day-of-week we choose.

while the HTTP traf.c share in the APR trace is about the same, we .nd slightly more unclassi.ed traf.c.


For hierarchical topologies like Fattrees [2], shortest path routing has been largely suf.cient when there are no failures.

recently proposed direct network topologies like HyperX, BCube, and Flattened Butter.y [1, 17, 20], which employ paths of different lengths, have not seen adoption in data centers due to the limitations imposed by commodity data center switches and shortest path routing.


The scalability of the simulation scheme is highly dependent on the number of nodes but also on the communica 400 300 200 100 0 number of nodes time (s) Figure 8: Scalability of distributed mixte simula tion activity of the simulated nodes.

it is hard to clearly analyze the impact of this last parameter.


4.1.2 21 n -perfect Unicast System In [8], Eidenbenz proposed a unicast system that charge the service request an amount that equals to the weight of the second shortest path, where the second shortest path is the shortest path in graph G -LCP(s, t, d).

the second shortest path could be arbitrary large than the total VCG payment.


The hotspots have made an immediate impact, attracting thousands of users, of which some travel as far as 40 km away.

tHM acknowledges that best practices are not necessarily transferable between regions.


Comparison with Other Networks Liu s NoC [3] uses a dual clock scheme with control and data path frequencies of 570 MHz and 1.8 GHz respectively and requires 292 NAND gates/bit, when synthesized with SMIC 90 nm library [3].

8x8 and 16x16 HAGAR networks have clock frequencies of 200 and 50 MHz respectively, when synthesized using FARADAY s 130nm UMC Library [2] (288 and 72 MHz respectively, when scaled to 90nm technology using general scaling [16]).


When optics are relatively expensive, the cube collective topologyfares well(approachesparity) for even random traf.c; however, with lower cost optics, the dragon.y s superiorperformance onrandomtraf.cgivesit astark advantage despite its higher cost.

the cube collective topologyhas a2x to3x advantage over thedragon.y topology(i.e.


Placing ad-hoc infrastructure along migration .yways is a near impossibility.

cranes use the same region for breeding and wintering for years.


Hence, the system continues to behave in the same fashion as in the case for standard I-BGP, and the route oscillations are not eliminated.

when our solution is used, all the route re.ectors (RR1 through RR4) always announce to each other the routes through C1, C2, C3and C5, respectively.


7.1 more traceroute data in some continents We have compared continent-level AS topologies, and the results reveal the lack of vantage points to cover Africa and Oceania in the current data sets.

it is challenging to obtain reliable measurements from  Figure 8: AS Core Map in U.S.(EST) developing countries because the measurement environment such as computing facilities and networks are limited and less reliable.


In this case, resource sharing across process boundaries is required in order to reduce the design area.

existing high-level synthesis (HLS) tools [8] do not support resource sharing across process boundaries.


10.00  Copyright 2010 ACM 1-4503-0448-1/10/11 ...$ for improving anomaly detectors is to thoroughly inspect results generated by such detectors and precisely identify any drawbacks.

identifying anomaly detectors vulnerabilities is particularly dif.cult due to a lack of ground truth data and of rigorous methodology.


In all cases, the simulations allow a fast performance comparison between di.erent protocols/models with di.erent scenarios and for many times.

in the real world tests (testbeds) and particularly in the wireless communication case, the impact of some parameterssuch as: thetypeof environment(indoor/outdoor), Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for pro.t or commercial advantage and that copies bear this notice and the full citation on the .rst page.


Ifall nodes agreed on an encoding within local preference for indicating backup routes or some information were shared between nodes, backup-route scoping would be possible in BGP (PV µbgp ) without additional attributes.

the additional attribute can separate the awkward encoding and information sharing from attributes meant for local use.


Therefore, instead of wake up in one OFDM frame, a MSS may need to wake up in two OFDM frames.

delay constraints at 200ms, the MMPS-BF has the same sleep ratio as the other two approaches.


This need for direct object veri.cation was the original motivation for using self-certifying names in contentoriented architectures.2 By self-certifying name we mean a name that (together with some signed metadata) allows direct veri.cation of the binding between the name and an associated object, as will be described in more detail in Section 2.

the use of self-certifying names has been recently criticized on two grounds in particular (see [10] for a critique of this approach and [12] for a response).


This approach can be taken to avoid request overload at web sites which are contin- uously popular (e.g., DBLP bibliography web site) or predictably popular during some period (e.g., Olympic game web site).

due to its static nature, this mechanism can not handle unforeseeable bursty requests effectively.


Mobile IPv4/IPv6 (MIPv4/6) can provide a seamless vertical handover between WLAN and cellular system for the applications.

mobile terminals may roam from a wireless network to another hourly.


Erroneous Packet Processing: Hardware MACs will discard packets determined to be in error, even if they are put into monitor mode.

because the RF hardware simply passes a stream of bits into the DSP whenever a packet is received and the CRC is checked in the DSP, the MAC can be modi.ed to process even erroneous packets, or pass them up the network stack.


Although such data collection and dissemination can be performed in a centralized client-server architecture, this new generation of vehicles has the capacity to process all of its own local data, as well as any data coming from nearby vehicles, bypassing the need for centralized solutions, alleviating the load on the backhaul network and reducing the .nancial cost to the user.

current networking paradigms are not ready to support this data explosion, with the consequence that the data is con.ned within the vehicles themselves or only available after the extremely long delays caused by nightly uploads.


The technique allows normal routing operations in failure-free scenarios, and rerouting under failure cases.

unlike other fast reroute mechanisms, PR can guarantee full repair coverage for any number of failures, as long as the network remains connected.


&#169; 2001 ACM 0-1234-5678/01/0011 $5.00 that allows an easy design of scalable and flexible wired systems.

it is precisely that irregularity which makes the packet routing and deadlock avoidance mechanisms more complex than in regular networks.


Previous techniques have assumed that the communication streams are directly mapped to networks-on-chip.

this paper explores the use of communication transformations (TransCom) to achieve higher throughput via better network load balance and more ef.cient network utilization while retaining the communication semantics of the original streaming application.


In VANETs, the limitations in coverage and channel capacity of WiFi technologies, the high mobility of the nodes, and the presence of obstacles provoke frequent packet losses, topology changes, and network fragmentation.

an optimal routing strategy, that makes better use of resources, might o.er the possibility of deploying more e.cient VANETs.


Illegitimate packets will be discovered as outside attackers do not know the keys shared between the hops.

an inside attacker, i.e., an attacker who is a member of the end-to-end path, can still launch an attack.


The equivalence is not exact however because if a carrier c is reassigned from user j to user i, the service that was provided by carrier c to user j could potentially be replaced by a another carrier that remains assigned to user j.

this di.erence can only increase the value of objective (2).


There is recent research showinga tremendous interest in topology control as a means of interference reduction.

the naturalassumption that a sparse topology implies low interference was .rst refuted by Bukhart et al.


If the copy is forwarded, the delivery probability of the copy in node j will be Pj,d,K-1,Tr-1, and that of the copy in node i will become Pi,d,K-1,Tr-1.

if the copy is not forwarded to any node at time-slot Tr, the delivery probability of the same copy in node i will become Pi,d,K,Tr-1.


Similar conclusions apply for 1-minute windows.

with 1-day time windows, a feasible solution requires 2 Gbps links.


While it is possible to decode the beacons from the overlapping channels, these beacons are attenuated by varying factors (depending on channel separation), since the receive .lter of the client overlaps only partially with the adjacent channels.

similar to the results presented in [15], we can determine the attenuation factors for each of the adjacent channels through measurements, and then correct the RSSI values of the beacons received on those channels.


The most common model use a constant threshold (called capture ratio) for each modulation and coding scheme with the ratio of the signal strength and the summation of interference strength.

these are primarily theoretical study and analysis.


Sequential Progress for Different Piece Selection Policies (M = 20) 0 5 10 15 20 Number of Pieces Retrieved So Far Figure 1: Sequential Progress Example for M =20 By de.nition, the strict in-order policy is ideal in terms of sequential progress.

each peer simply retrieves the .le pieces in numerical order from 1 to M. the overall performance of thispolicyin aP2P network canbe sluggish, as will be seen in Section 4.1.


The advantage of applying the per-MN-prefix model in our proposal is used to make the MN believe it is always in its home network, thus no IP-level movement is detected by the MN and TMD has no impact in our proposal.

the graph for Novaczki s scheme increase as TMD does.


Figure 2: The time for encounters on all channels Table 2: Average completion time of .le transmission (s): without primary users Sequence setting completion time random 20.4 proposed 16.1 proposed + follow 7.6 The results show that the completion time increases with the loading of the primary user as expected.

the completion time using the random sequences increases substantially with the loading of the primary user.


In the rest of this paper, we call this approach complete advertisement protocol.

in a reactive approach, nodes do not have any idea about the service information in the network.


this placement takes n time-steps to complete and the cost of the transient placement s at step i for object j is given by 0, ifj < i (because object j would have already been placed at the j'th time-step), and (l-p)/.p-n otherwise.


Assuming the existance of an algorithm B for the optimization version of the problem, our techniques provide truthtelling mechanisms for general combinatorial auctions.

designing optimization algorithms may be di.cult in general because of online or approximation lower bounds.


Their paper introduces the .rst reliable key establishment protocol for SS without a pre-shared secret.

unlike traditional SS systems with pre-shared keys, the proposed mechanism incurs an increase in energy cost by a factor of n due to the implicit redundancy in packet transmissions (retransmissions of message fragments that are not received) required by their scheme.


Services such as video on demand, live conferences and gaming require a large amount of image data to be efficiently transmitted over the limited and dynamic bandwidth available in wireless networks.

compressed images are highly sensitive to channel errors.


IEEE802.15.4 channel 26 25 24 23 22 21 20 19 18 17 16 15 14 13 12 11 Time (days) Channel Hopping performs better than using a single channel.Theseresults areobtained overasetofdatasu.ciently largeinnumberofnodes(44nodes)and time(28days)tobe statistically valid.

connectivity traces were gatheredin aprintingfacilityin which thereis no externalinterference from technologies operating on the same frequency band(WiFi,Bluetooth).


These experiments do not involve database accesses at the application servers, hence .... is negligible (around 4ms).

the results con.rm that indirection via OSNs imposes a signi.cant overhead for user interactions with third-party applications.


Routing loops from which packets do not escape have no effect on the delay performance of the network.

the delay of pack- ets that do escape a routing loop is increased by 25 to 1300 ms, an increase in similar magnitude to the normal end-to-end delay of the Internet.


Recent research has achieved certain success in the application of machine learning techniques into .ow statistical feature based approach.

most of .ow statistical feature based methods classify tra.c based on the assumption that all tra.c .ows are generated by the known applications.


Coomparing the dynamiic governors wwe can observve that the CConservative governoor has better energy efficieency than the Ondemand governoor, an expected result since we know that the CConservative is an immprovement off the Ondemandd.

commparing the governoors with the fixeed frequencies, tthey are efficiennt only when comparred to the higherr frequencies of 1200 and 1000MMHz.


Now, Figures 1(b) and 1(c) both show the network after the two partitions have merged.

the behavior in the two .gures is di.erent.


DISTRIBUTED CONSTRUCTION By de.nition, any pair of nodes in a MIS are separated by at least two hops.

a subset of nodes in a MIS U may be three hops away from its complementary subset in U.


Thus, the threshold to build the graph is 46 for Cabspotting and 13 for SUVnet-trace accordingly.

there are 96 isolated vertices in Cabspotting s social graph and 86 in SUVnet s social graph.


The roundtrip times (RTT) range from 0.5 µs up to a few tens of µs, except under hotspot congestion, when the end-to-end delays can grow by several orders of magnitude, reaching into 10s of ms or more[3].

even if a congested DCN may have RTTs similar in magnitude with a WAN, there is a key difference.


For Figure 13(a), the throughput of both DOMINO and CEN-TAUR are around 3× the throughput of DCF.

the throughput of CENTAUR is lower than DCF for Figure 13(b) while DOMINO provides the same throughput in both scenarios.


SANE and Ethane [8,9] are similar, in that they have many forwarding nodes within the network enforcing a security policy.

the scheme is intended for centralized policy control, rather than source-speci.c policy decisions.


Outages caused by severe events such as .res and undersea cable cuts are often reported upon by operators and studied by researchers.

outages cause by ordinary weather are typically limited in scope, and because of their small scale, there has not been comparable e.ort to understand how weather affects everyday last-mile Internet connectivity.


these network types are guaranteed to present a path upon packet arrival.

a persistent version of S(PR,SC,US)can solve at least ECDN and ERDN, if we assume instantaneous topology/path availability.


When the network is loaded, the performances difference between the two protocols in terms of energy and delay increase.

continuous learning in EDEAR makes highly reactive compared if collisions increase and avoids performance drop.


L2 routing: DIBS cannot work with self-learning L2 routing schemes such as the spanning tree protocol.

most modern DCN topologies such as FatTree rely on pre-computed routing tables.


Depending on the user and traf.c pro.les in a sector, one has to determine the appropriate transmission strategy: DAS or FFR.

picking either DAS or FFR in isolation often results in in-suf.cient or spare spectral resources respectively, in handling the offered traf.c load.


In this case, size-based policies (pFabric, STF) do result in reduction of completion time compared to fairsharing policies like RCP, especially beyond the median up to the 95th percentile.

even in this case, Baraat s FIFO-LM policy results in improved performance of roughly 60% relative to RCP and 36% over size-based policies at the 95th percentile.


For example, a deployment demanding low latency mostly implies the use of delivery reliability mechanisms to bound the data arrival time at the gateway.

a deployment with reliability mechanisms does not necessarily put constraints on the latency.


In CS-WFQ, during [0,100], the scheduler tries to compensate flow 1 im- mediately, by reducing the service rate of the other flows fairly.

since this is the extreme case where the channel of flow 1 is completely balcked out, the bandwidth is wasted.


The method proposed in [5] eliminates backwards transmissions by computing coef.cients in a unidirectional manner (as data .ows towards the sink) along paths of a given routing tree.

this results in an oversampled transform (the number of wavelet coef.cients generated is greater than the number of samples captured) when multiple paths merge, resulting in additional energy consumption for merging paths.


In the above process, the same message M is transmitted to all the nodes in AT s and AT r. This will be very expensive, thus calling for an optimization to reduce the number of message transmissions.

without optimization, the cost of exchanging messages to evaluate the CMAC increases linearly with k. we need not send the same message to all the nodes individually, since those nodes may share the same node as the parent node in AT s and the wireless transmission can be simultaneously received more than one node.


As the HELLO probing rate is increased, the number of data packets lost decreases, since we react to failures more quickly.

probing at a faster rate also causes more short-term failures to be detected and propagated, increasing control overhead.


However, it searches the available bandwidth region by detecting one-way-delay increasing trend within a packet-train, which is different from examining whether the rate response Z(rI ,s,n) is greater than one [7].

since there is a strong statistical correlation between a high rate response Z (rI ,s,n) and the one-way-delay increasing tend within packettrains, our analysis can explain the behavior of pathload to a certain extent.


ident++ attempts to remove the incentives for breaking security protocols by making network security more convenient and accurate.

users might inadvertently create security holes or allow their accounts to be compromised.


The root cause 4.5 of these .uctuations is not clear at present.

by re 4 viewing the throughput trace of a test we may identify any Relative Throughput measurements with unusually high variations.


As a maximum acceptable end-to-end delay we evaluated a value of between 100 ms and 200 ms. Meeting this delay bound in a mobile network without resorting to massive overprovisioning does require some form of resource reservation.

because of the traf.c burstiness, the low bandwidth usage, and the tight delay requirements resource reservation on a per session basis, as speci.ed for UMTS for real-time traf.c, would cause a signi.cant overhead resulting in inef.cient resource utilization and high reservation costs.


206 1 201 0.9 196 0.8 191 0.7 186 M illion B us T ransactions per S econdCPU U tiliz ation 0.6 181 0.5 176 0.4 171 0.3 166 0.2 0.1 161 0 64 128 256 512 1024 2048 4096 8192 16384 32768 65536 131072 262144 524288 1048576 M essage S iz e (b y tes) M essage S iz e (b y te) Figure 17: CPU Utilization for BiBW Tests Figure 16: Chelsio BiBW Results 100.00 this to the ine.ciencies in the current implementations of RDMA for small messages in the blocking mode.

one thing we should note is that for small messages, the 90.00 80.00 70.00 60.00 50.00 40.00 30.00 power increase compared with the idle power is quite small.


(10) u.U Unlike the above sophisticated policies, this policy does not require any o.ine computation and has very short online response time.

it may su.er more performance loss due to greediness.


It is naturally expected that the network system should provide services to satisfy all the users' requests in any situation.

it is financially difficult for the operator to construct and maintain the network capacity that is necessary if temporary, exceptional communication demands are to be met.


By applying the SRS to D2D channel estimation, Rx-DUE can obtain full-band channel frequency response (CFR) of D2D related links and achieve high D2D s SINR.

for these procedures, all SRS configurations of interference UE (IUEs), high SRS detection complexity, and a considerable channel estimation and feedback overhead are required.


This constraint does not applyin our context.

the constraint that a node can not be involved in multiple communications does not applyto their context.


If full preemption was considered, more interference could potentially be accounted for and the worst-case response time estimate would yield more pessimistic.

the model does not explicitly say which is the length of the last packet (Mlast).


This scenario covered the fading e.ect of wireless channels.

wireless transmissions are not only a.ected by fading but also by multiple re.ections of the same signal from obstacles in the surrounding environment (multi-path e.ects).


Layered adaptation has been regarded, in general, as the best mechanism, at least in the multicast case.

in [14] the authors show that there are situations where multiple streams may be a better solution, since layered adaptation not only consumes more bandwidth but also requires more bu.ering and synchronization capabilities.


Figure 1 shows that, as the average data rate per session increases (for a bandwidth of 24 KHz), the energy cost of our protocol remains consistent and much lower than that of the CDMA-based technique.

the cost of the CDMA-based technique drops with the increase of the data rate.


Under S-BGP the attacker could spoof a direct link to AS X as described in Section 7.2.

sPV prevents the attacker from stripping off the cryptographic signatures of AS Y because AS Y will have added the necessary signatures to close the break in the chain (for example, by performing signatures on behalf of AS X) before adding its own signature.


We do not discuss the capability of each node in this paper.

since an SP handles more tra.c than an LP, the capability di.erence can be taken into consideration when promoting an SP of a sector.


As pre.x 0* sends large traf.c, the task decides to drill down under pre.x 0* in the next epoch to .nd heavy hitters hoping that they will remain active then.

to respect the resource constraint (3 TCAM counters), it must free a counter in the other sub-tree by monitoring pre.x 1* instead of 10 and 11.


As such, the extensions prevent routing anomalies in simple scenarios.

more complex topologies can still be vulnerable to routing instability.


Store & forward techniques enable high delivery even in temporarily disconnected networks.

they also result in increased latency because messages spend most of the time co-located with hosts.


cycles is selected such that there is at least one minor event occuring around the same time as a ma jor event.


On one hand, direct-simulation approach evaluates each solution applying a RWA algorithm under a dynamic tra.c pattern [6].

indirect-simulation approach solves problems in two stages: simulation stage and optimization stage [10, 17].


With modern high performance networks it would be necessary to define the SSH receive window to at least 64MiB if not 128MiB.

blindly increasing window size may in fact have the opposite effect and cause performance degradation.


8In fact, the same idea occurs already in [14], but without the formalisation in terms of invariants.

that proof fails to consider some cases that do occur in AODV and might yield routing loops [9].


In this case, it occurs at loads of 45, 70 and 90 fps for traf.c classes 1, 2, and 3, respectively.

29 and 25 fps are the transition points from non-saturation to saturation regime when there are 5 and 8 stations of AC3.


The test modules utilized in the standard receiver tests typically come with a single RF module in a production tester.

recently, low-cost RF tester platforms are under investigation [16] and there is an incentive to limit the complexity of the test requirements to keep the tester cost down.


However, we believe that active research can be done to find good enough solutions.

this weakness can be opportunity for other areas, such as education or social communities, where social interactions and collaborations are emphasized over competitions.


cAPS managed to efficiently protect the observed low bitrate flow.


The weighted sum normalizes against increased update traffic, but admits a small bias towards groups of prefixes that experience frequent updates.

correlation normal- izes against update frequency, but does not incorporate the con- fidence of the correlation.


On the other hand, if no mergeable message arrives before the merge timer for Ma expires, then Ma is forwarded on from the center node to the next node (according to the forwarding table).

note that Ma remains in the buffer of the center node.


In such environments, if using the replication based protocol, when a transmission opportunity arrives, ideally, a node should transmit the packet with the minimal number of replicas in the network to reduce its transmission delay, since it is the packet with the longest expected delivery delay.

a node has no such precise knowledge in opportunity networks.


The above step of computing the minimum number of hops is the same distributed algorithm as described in DVhop.

the main di.erence is that instead of multiplying the number of hops by a .xed radio range r, in DV-hop, the number of hops is multiplied by an average hop distance.


Since the current compilers typically maintain the dependency via priority value, it is feasible to restore the dependency DAG from the .ow table through calculation.

due to the high computation complexity of the restoration, we opt for the alternative approach to track the dependency during compilation (§4).


As shown in Figure (2:A), the prevalence ratio converges to be less than 20% while the network size increases, this means that the proposed protocol utilization (resultant of the network traversing replica) should be .xed (as a function in the network size).

figure (2:B), the prevalence ratio is a.ected dramatically by very high speeds (starting from 70% mobility index).


While commercial small cells typically have an application processor, memory, and storage, those components are provisioned for running network management code and not the demanding cloudlet workloads such as vision.

through the use of LIPA, that additional compute can be provisioned via a separate compute server on the same LAN without requiring hardware or software changes on the small cell (other than con.guring LIPA).


Negotiating such privacy protections, however, is only possible if the subject of a photo can be identi.ed and contacted at the time the photo is shared.

with the popularity of social networks today image and video content from users pro.les have shown to be (mis) used by employers and law enforcement to investigate the behaviors of individuals [16].


The performance of this KBN implementation has also been explored.

to maintain scalability and performance it is important that these extensions do not break Siena s subscription aggregation algorithm.


The Horus system [[33]] is similar to RADAR in that it uses sampled signal strengths from various locations.

instead of using a mean of signal strength values, a signal strength probability function is created i.e., a function that calculates the probability of the signal strength of a access point at location (x,y).


This is because when N is relative small, the postbusy slot is likely to be idle and hence PS is lower.

when N grows, the overall contention intensity is high and the probability of successful transmission decreases.


approximately the same functionality of the rx_dsp and tx_dsp chains of the second-generation architecture.

unlike The VITA-49 framers and de-framers also offer a modest the second-generation architecture, these radio modules will be amount of flexibility for operations such as sample size connected to the RTR instead of to the host-interface truncation.


Service providers can henceforth look to such Wi-Fi systems as a viable way to seamlessly of.oad mobile traf.c and deliver addedvalue services, so that subscribers no longer face the frustration and aggravation of connecting to Wi-Fi hotspots.

the technology being rather recent, we are not aware of public studies at the state of the art documenting the achievable gain in real mobile networks.


However with adaptive bandwidth allocation, when a new or handoff call comes and the network is overloaded, the allocated bandwidth of ongoing calls can be degraded to smaller values, thereby accepting the new or handoff call; this can reduce both call blocking and handoff dropping probabilities.

when an ongoing call is terminated due to its completion or outgoing off, the released bandwidth can be utilized to upgrade other ongoing calls.


Data transfers in ad-hoc networks use a (on-demand) routing protocol, e.g., DSR [13], AODV [28], to construct network layer end-to-end paths on which such transfers will proceed.

multi-hop interactions in MoB do not involve any routing protocols.


Thus, the leftmost bar illustrates that when both channel conditions are low quality denoted by [L,L], both OAR and RBAR provide the same temporal shares as single-rate IEEE 802.11 (20% and 80% respectively) while achieving throughput gains of approximately 60% and 35% respectively.

note that in other scenarios, RBAR deviates signi.cantly from the IEEE 802.11 time shares whereas in OAR does not.


Hence, the phase of the subcarriers at different channels will be constant, and the slope will be zero.

if the coherence bandwidth is very small, then the different OFDM subcarriers will experience uncorrelated channels.


The start time generator provides stochastic input to our simulation system for HTTP traffic.

the stochas- tic input must encompass more.


On one hand, the number of polluted nodes in hour i+,increases by the number of nodes that get infected during the i-th hour, as de.ned in Equation (2).

the number of polluted nodes in hour i+,decreases by the number of peers that are cleansed during the i-th hour.


The aforementioned protocols do not make use of store & forward techniques.

these can be useful in sparse networks where instantaneous connectivity between the sender and the target zone is not guaranteed.


In the EDF algorithm- s, the BS simply calculates a rate using the entire power PBs and grants it to the job with the earliest deadline.

in processor sharing all jobs in queue are as- signed some share of the base station transmit power, thus serving them simultaneously.


Then no .xed round-trip algorithm can be instance optimal in A over D. Hence, the general notion of instance optimality ratio cannot be used to characterize .xed round-trip algorithms.

we can still analyze optimality ratios of these algorithms by incorporating a characterization of the data series themselves.


Accurate location is fundamental for an e.cient management of the resources and for the rapid localisation of the events.

it should not be expected that all participating devices are equipped with GPS receivers.


This can be done regardless of the offered traf.c.

it is also interesting to compare m with the actual number of samples taken by the dynamic control algorithm targeting an expected number of samples m. This is particularly interesting in the face of statistical and systematic variation in rates and composition of the stream of offered .ow records.


Once again, no optimizations were made for the MSP430, so we believe performance could be improved if optimizations targeted to the MSP430 were implemented.

the current performance is generally acceptable even though the implementation is not optimized for TinyOS s run-tocompletion task model: calling the hash function results in 14 ms of unyielding computation, constraining the realizable radio throughput to 76 packets per second.


Speci.cally, a node may be assigned more channels than the number of its radios.

this channel assignment is optimal in terms of ensuring that the interference for each channel is minimum.


The reason is that including spatial network information in Rule-Fit requires one predictive feature per link in the network, which is computationally prohibitive.

we can exploit spatial dependencies to improve path tracking ef.ciency through the probing scheme, as we detail in Sec.


Instead of using active probing, the RTTs can be measured passively by observing TCP packets.

it is not always possible to obtain the RTTs for a destination through both the providers.


On the contrary, our solution cannot be applied to layer two mesh networks, as the proposed by the IEEE802.11 Task Group S (TGs), because the size of RANs could be big and then IP paging will perform badly.

this scenario, large layer two based IEEE802.11 networks without paging support, was identified in the introduction as a possible source of scalability problems motivated by three factors: the increase of the MNs mobility, the need to deliver calls (or other type of sessions ended in the MN) to them and the use of PS mode to decrease battery wastes.


Performance Improvement of Layered Modulation Based Cooperative Relaying Scheme Jee-Hoon Kim, Jung-In Baik, Jin-Hyuk Song and Hyoung-Kyu Song uT Communication Research Institute, Sejong University Gunja-Dong, Gwangjin-Gu, Seoul 143-747, Korea {bid4u,bji0309,song020}@sdc.sejong.ac.kr, songhk@sejong.ac.kr   ABSTRACT Cooperative communication is a novel approach utilizing limited resources to get reliability.

overall transmissionrate is reduced to have decomposable composition at the destination node in time-division multiple access (TDMA) system, which diminishes the advantage of cooperation.


Some of the assumptions we make about mobility are only valid for deep waters.

dNR beacons need to surface to get GPS coordinates and they are subject to more complex currents than considered here.


For higher capacities, we see a larger number of modes in the shaping rate.

at the tail of the capacitydistribution thereis only one shaping ratethat correspondstothehighest servicetierprovidedby Comcast.


Compared to other real-time applications like video, these rates are very low.

the transfer rate is extremely bursty for the client: it varies from 0 to 264 bytes/sec.


The amount of signaling may drastically increase to share a lot of control information between clusters.

if too little information is exchanged, the cooperation may lead to incorrect scheduling and a waste of resources due to collisions.


The duration tstable that a circuit is open is controllable.

having circuits that are open for a long period of time affects the amount of buffering that is required at the host, as we discuss below.


This deployment scenario is similar to Ethane [3] in that it also has the overhead of the ingress switch sending packets to the controller and the controller installing caching rules.

the di.erence is that DIFANE always keeps the packet in the fast path.


It is just necessary for the receiver to get at least two messages from the lower layer sensors of the network.

the approximated geographical location of the Mesh nodes, can be calculated based on the characteristics and shape of the area that WSN uses and the radiorange of the sensors.


On the one hand, it ensures the transmitted coded packet contains information from all packets known to the node, including the most recent arrival.

it avoids inserting a delay before each transmission.


IP is NP-hard no polynomial time algorithm is known for it.

many IP problems can be solved ef.ciently in practice.


This is remarkable, since in the  Figure 4: a) Expected network load and b) expected delivery success ratio with varying number of network nodes Figure 5: a) Expected network load and b) expected delivery success ratio with varying network density Figure 6: a) Expected network load and b) expected delivery success ratio with varying periodic retransmission rate previous paragraph we noted that the server approach has to bridge the distance between server and geocast destination region for each retransmission step, which should decrease successful deliveries.

the most critical path is from the sender to the server, or from the sender to the geocast destination region for the other approaches, respectively.


In the case of directional antennas, [10, 11] jointly optimize routing with link scheduling for WMN.

they also restrict themselves to use the con.icted graph.


An orderpreserving move is unnecessary because re-ordering would only potentially result in the scan detector failing to count some connection attempts, and, in this application, we are willing to tolerate moderate delay in scan detection.

to avoid missing scans completely, we maintain eventual consistency of multi-.ow state by invoking copy in both directions every 60 seconds.


Growth in table size has become a popular topic for mailing lists, and in the trade press [9] because of its alarming implications for router vendors.

the growth in the table also leads to two natural research questions.


If a measurement object can be reused, the delay overhead can be better estimated by .d2 without including the TCP handshaking delay.

some methods, as described in Section 4.1, always open new connections for measurement whether the measurement object can be reused or not.


For example, state-of-theart simulator models of WMNs either attribute link errors to fading or use simpli.ed synthetic loss models.

they do not reproduce the correlation structure of external interference and environmental mobility.


For the weighted matching problem, Preis [12] showed that, like GMS, LGMS returns a matching with a weight of at least 12 of the weight of a maximum weighted matching.

a 1For example, we can color the links so that no two links interfering with each other have the same color, and then the links can send their control messages in a round-robin fashion based on their colors.


The goal of the previous works has thus been to minimize the response time to acquire a single data item.

in many environments, a mobile client may be interested in getting multiple data items that are related to each other semantically.


On one hand, to take advantage of modern multi-core processing platforms IDSs need to support scalability, by distributing traf.c analysis across a large number of processing units.

such scalability must not come at the cost of decreased effectiveness in attack detection.


In [9] the authors have presented an analysis of the factors that affect the switching point (based on power consumption) between multiple DCHs and FACH in micro and macro cell environments.

in [5] and [10] the authors have investigated several techniques in order to reduce the FACH transmission power, thus decreasing the switching thresholds.


Thus, decentralized and hierarchical solutions are adopted as a better choice for MANETs con.guration and management [5, 8].

research on autonomic networking has recently gained a considerable interest with the network community [1, 6].


Clearly, if the failures in the network are nonexistent or very rare, the best solution is to use a routing algorithm that generates the most uniform overall network distribution (Row-First), maximizing in this way the rate per node.

as the failure rate of the network increases and the network becomes more unreliable, we should uniformly distribute the node-to-node tra.c load in order to avoid inoperative nodes and overcome the network unpredictability (Spreading).


INTRODUCTION The popularity of Internet has made it the de facto information infrastructure today.

the use of an IP * The work was supported in part by the National Science Foundation grants CNS-0435444, CNS-0626812, CNS-06268 and CRI 0709048.


In terms of infrastructure, there may always be a concern with cost of establishment.

in our study, modern bus stops have good infrastructural environment already.


A pure opportunistic scheduling scheme does not implement a fairness enforcement mechanism.

a round robin scheduling scheme allocates the equal amount of resources to each SS, irrespective of the channel status of that SS.


2, the proposed method shows the average SINR loss as much as 1.3 dB compared to the conventional method.

it can obtain 1.7 dB of the average SINR gain compared to the random resource allocation method.


They have to manage security in order to protect their networks from unwanted access, potentially configure parental controls to restrict Internet usage for their children, and diagnose and troubleshoot connectivity problems, to name but a few.

many householders have difficulty doing such management jobs due to the inherent complexities of the home network [2, 3].


Furthermore, there are other approaches (e.g., [2] and [1] from 3GPP, or [5]) proposed to support inter-domain mobility for PMIP.

they either depend on lower layers (link layer speci.c) approaches or they use data forwarding optimization for communicating nodes.


At each deadline, the sample threshold is no larger than the right.

within a stretch, the threshold is higher than dr. What would happen if we queried the algorithm in the middle of a stretch?


Over the Emory path, DCA is able to lower the loss rate experienced by the connection by roughly 7%.

a reduction level of 12.5% does not appear to lower the loss rate.


However, these concepts and the associated techniques are not well known by service developers.

procedural languages, client server interactions and callback methods are familiar notions.


When both HO and initial location were known, initially the error increased because the stride length was unknown.

as soon as Zee learned the stride length, the localization error reduced.


Common carrier service providers and industry players contend that it is impossible for undesirable nodes to exist in L3virtualnetworks[7,21].

ithasbeenshownby researchers that it is possible for foreign nodes to impersonatevalid nodesinaprotocolbased L3virtual network[20].


WMNs inherit many advantages from both wired infrastructure and also ad-hoc networks.

in spite of their distinct characteristics, they also face many technical problems that were present in older classes of wireless networks, such as wireless LANs or pure ad-hoc networks.


Numerous propagation models for urban environment have been proposed so far.

most of them are speci.c for cellular networks and model the propagation between base stations and mobile nodes.


This result is confirming the conclusions drawn in [8].

as shown in the previous section, packets forwarded by the previous FA may still get lost at the new FA when they arrive before the registration reply message.


Giving the same key to multiple clients can be considered a .aw in authorization and is clearly insecure.

this is exactly how multicast messages are usually handled in a public network.


RRC connection release with redirect Inter-system handover Inter-system cell reselection  3G RRC 4G RRC 3G RRC 4G RRC (a) Inter-system switch options (b) High-rate data + CSFB Figure 6: RRC states in various inter-system switching options.

this inter-system switching cannot be activated (the property MM_OK is violated).


By doing so, we also expect that the UDP tra.c could play a role of other interferences which prevents APs packet transmission [9], thus we refer this UDP tra.c as Background Tra.c.Most of the experiments we performed are tested for background tra.c in the range 030 Kbps per STA.

even with the di.erent UDP tra.c rate, overall pattern for most of our results remains unchanged and thus until speci.ed otherwise we present results with 25 Kbps only.


4.4 End-to-end security The existing IP Security mechanisms, ESP and AH, continue to work with ILNPv6.

eSP and AH now bind their Security Associations to each node s Identi.er values, I, instead of to each node s IP addresses.


If ß is too small, currently unused paths may not be detected by our algorithm.

ß should not be too large since this can result in excessive growth of a .ow if fP is close to zero.


If unique multicast service identification exists, this authorization mechanism could be modified to operate on individual multicast sessions.

there is no mechanism in IGMP to report a multicast service authorization failure to the UMTS terminal.


Socket programming opens a new realm of development for Computer Science students as they are able to create programs that can communicate via the Internet.

while learning, students frequently misuse the sockets API or have difficulty understanding where run-time and logic errors in their code occur.


In this de.nition, the subcarrier groups are not aligned.

this does not present anydecoding problem.


By the time 40 images have been acquired, the average Quality Factor is near 30.

the dynamic policy that gradually reduces the image Quality Factor values can offer reasonable Quality Factors of 75 for capturing up to 40 images.


The drawback of this approach is that we lose some flexibility.

it is robust and since it is easy to alter the periodic schedule we do not expect the flexibility loss to affect the performance significantly.


This new role is disruptive in what concerns Internet service models, since there is no distinction between what is today known as end-user device and network device: in the future, end-user devices will actively participate as part of the network.

the Internet has been up to now mostly the means for end-users to obtain some form of network service, originally related to connectivity, person-to-person communication, or information retrieval.


In their basic version, both of these LFU variants count the frequency of the requests since their .rst request.

the video popularity is dynamic and changes over time.


Thus, ML-based solutions so far have been limited to coarse-grained classi.cations such as web, P2P vs. VoIP [2].

actualization of L7-aware SDN requires .negrained application detection.


For example, if MD5 is used for hashing and WEP-64 is used for encrypting, asingle hashinground su.ces since the 128 bit output is enough to obtain the 40 bits required for a valid session key.

if WPA-PSK is used, we need two MD5 hashing rounds to generate a session key of 256 bits, as required.


[36] leverage DNS requests to understand the distribution of Web content.

their work is restricted to the study of speci.c CDNs, and does not try to detect different types of hosting infrastructures.


More intuitively, we can think of the nodes on the same side of a bottleneck as trying to send packets across to the other side of the bottleneck.

the nodes on the opposite sides of a bottleneck can be thought of as a source-destination pair.


The new-call dwell time denotes the length of time a mobile subscriber resides in the radio cell where the call has originated before crossing the cell boundary.

the handover-call dwell time describes the time spent by a mobile subscriber in a radio cell to which the call was handed over from a neighboring cell before crossing to another cell.


3.2 Node States Generally speaking, a node accessing the channel during the CAP portion of the superframe can be in one of four states: backo., sensing, transmission, or idle.

if after sensing the channel is free for two subsequent slots, transmission immediately occurs, followed by a sequence of idle states till the end of the superframe.


7CONCLUSIONS It might reasonably be assumed that designing an unreliable alternative to TCP would be a rather simple process; indeed we made this assumption ourselves.

tCP s congestion control is so tightly coupled to its reliable semantics that few TCP mechanisms are directly applicable without substantial change.


Because of the uniform density of nodes, we expect that this (curved) hyperplane will pass between many pairs of nodes -1/d separated by distance T(n ), i.e., the typical distance between a node and its close neighbors.

the hyperplane continues to the boundaries of the hypercube, and so some of these pairs of nodes are likely to be at constant distance from t. since the nodes in the pair are on opposite sides of the hyperplane, the shortest MST path between them must pass through the cut edge, and thus be of constant length.


The gain is not exactly correlated with the number of channels that can be utilized since performance is a complex function of link quality, node density, gateway placement and interference.

as the network size or the number of channels increases, the PD using SWARM is expected to also improve.


Distributed and Collaborative Traf.c Monitoring in Software De.ned Networks Ye Yu, Chen Qian, Xin Li Department of Computer Science, Unversity of Kentucky Lexington, Kentucky, USA ye.yu@uky.edu, qian@cs.uky.edu, xin.li@uky.edu ABSTRACT Network traf.c monitoring supports fundamental network management tasks.

monitoring tasks introduce non-trivial overhead to network devices such as switches.


Because no ICN design is deployed yet, we lack real-world traces of RTTs for real ICN.

designs like CCN suggest operating on top of IP, making IP timings relevant for experiments.


However, the stochastic nature of this upper bound in random networks is not taken into account in such approach.

as will be shown in the paper, we investigate this issue from a di.erent perspective which results in a novel power allocation scheme and interesting insights into the network capacity behavior.


The authors suggested to use random seating and clusters to reduce the number of seats and hide senders from recipients.

it makes the recipient unable to reply, and information may lose due to seating collision.


I-FHMIP has been proposed to minimize the packet loss by using the flush message during the handover [5].

as mentioned before, the FMIPv6 is based on the assumption that MN s next movement can be predicted precisely.


With one observation we cannot separate those contributions.

a week-long survey provides hundreds of observations for most addresses.


As the set of tags that respond to a given frequency is relatively static, the reader is e.ectively reading the same subset of tags repeatedly.

the EPC speci.cation allows hopping on a per cycle basis, which would result in the full set of channels being covered more rapidly.


9, the simulation and the theoretical result are generally perfectly matched.

when the speed of node A is less than 7 (m/s), the simulation and theoretical results exhibit a 3 to 5 second gap.


In the mobile industry, the situation has been very different and open APIs have been rare.

operators have preferred the walled garden approach, where data has been strictly available only for their own purposes.


Observe that the coloring of Aw is nondeterministic, i.e., the output could be different because of the randomization introduced by the different processing time of different nodes.

it is true that the output of Algorithm 7 is one of the possible outputs of Aw.


We can notice that the quantity of false positives in point 50 is smaller when compared to the previous results.

as stated before, this result is independent from the region chosen.


If the duration of the block is enough to estimate the PL i (t), for example through the updating in (25), the already derived controllers continue to work correctly and be optimal blockbyblock.

when we use channel detection and data fusion, from the time window controller side the RSU (t) becomes an equivalent primary source with time-variant statistics PL i (t) given from the a posteriori probability 29-30, that usually presents quite high variability (roughly, the same order of variability of the indicator function of the RSU (i)activity).


For our comparisons, we would like to consider only algorithms with polynomial running time.

in the literature, only a few polynomial time LAP algorithms are presented.


OMA BCAST Service Guide data could be delivered through both broadcast channels and interactive channels.

in the current version of DVBIPDC (phase 1), ESG data could be delivered only through broadcast channels.


In the Long Flow Discrimination experiment, ISP D1 does not discriminate against service S2 ; similarly, ISP D2 does not discriminate the .ows for service S1 : NANO correctly estimates close to neutral performance for these ISPs in these cases.

in the cases where these ISPs discriminate, NANO correctly detects a negative effect on throughput.


This host also provides the outgoing label, the MAC address of the next hop and the packet to the wireless interface card.

by providing the label information in the RTS, we provide the forwarding node additional time to complete the lookup (in parallel with the DATA transfer from the upstream node).


The PI~REP packet is rebroadcasted to its neighboring nodes using its own IP address in the outgoing PFLHEP packet.

if Li(t) is less than Kth, then it stops from rebroadcazting the PRFLEP packet.


To put it another way, opportunistic forwarding takes advantage of events that cannot be predicted with certainty.

if the PEP/SNR relationship is steep, then all outcomes are predictable.


Industry understands that interfaces, or lack thereof, can shape a market.9 There is probably a whole paper on the tussles surrounding open vs. closed systems.

as a starting point, the .rst exercise should be to speculate about whether these various openness tussles can be modularized and disentangled, and what this means for mechanism design.


The selection of transmit power is not addressed.

our work will allow di.erent links to use di.erent CS thresholds and will also address the selection of transmit power.


We note that the BGP specification itself does not specify what a router should do when it runs out of memory.

the stateful design of BGP, in which a BGP speaker is required to remember routing information it learned from its peers, pre- cludes a graceful degradation mode where the router can selec- tively "shed" excess routes.


Table 1: Examples of Social-Proximity Applications on Android Application Description Downloads Rating out of 5 Foursquare1 Find interesting places nearby, check-in for discounts 10,000,000+ 4.2 Badoo2 Chatting, dating, making friends with people nearby 10,000,000+ 4.5 Groupon3 Finding local deals and discounts 10,000,000+ 4.6 Skout4 Discovering and meeting new people around 10,000,000+ 4.1 Circles5 Finding people nearby with mutual interests 1,000,000+ 4.5 Sonar6 Connect with friends and like-minded people nearby 1,000,000+ 4.1 GrabTaxi7 Finding and booking nearby cabs 100,000+ 4.1 While web apps do not have the full freedom of native applications, they are still quite powerful, having access to location, camera, and even the phone s sensors.

they are currently limited to communication over sockets.


4, will also tend to converge more slowly, since the compnet can carry fewer sessions, and thus build up fewer dual mode terminals.

in figures 2-4, these differences are slight, since all three networks at least approach convergence at a 25% dual mode rate.


When the fading parameter m = 5, the improvement is not as signi.cant as that in Rayleigh fading channel, which is due to the system capacity limit (L = 100).

our simulations show that this admission region is achieved by using only 65% of the power as compared to that in Rayleigh channel.


Furthermore, our initial version of the opportunistic test protocol did not make use of SNR measurements from downstream nodes to readjust the bit-rate.

this lack of reactiveness exasperated this sensitivity to mobility, and hence, in order to make a fair comparison, opportunistic forwarding was made more reactive.


Detecting the Beginning of a Packet Transmission: At the beginning of each packet transmission, an ambient backscattering transmitter sends a known preamble that the receiver detects using bitlevel correlation on the digital hardware (in our case, the microcontroller).

unlike RFID communication, where the tags correlate only when they are powered by a nearby reader, an ambient backscatter device does not know when nearby devices will transmit and hence might have to continuously correlate, which is power-consuming and impractical for a low-power device.


A second service channel (SCH2) is dedicated to short distance peer to peer VANET communications, with reduced power level.

this service channel is currently unused.


supports direct or multi-hop communications among vehicles only.

v2I involves some sort of stationary equipment like roadside units (RSUs) etc.


The main reasons for this are that (1) the ability to freely manipulate label stacks gives outsiders direct control over how packets are switched through an operator intranet and (2) if enough label stack information were to be collected, it might be possible for competitors to gain knowledge of an operator s network topology and take a competitive advantage using it.

mPLS can still be usable in interdomain contexts such as path brokering.


Similarly, File Transfer experiences minor increase in the ratio of frame delays over 1ms with µPM since its traffic is also very predictable.

file Transfer sees longer frame delays than Audio and Video Streaming because the frame size in File Transfer is larger and the probability of frame loss is greater.


Also, if we would like to use DRAM to conduct online streaming for very high speed links (e.g., beyond OC-192), it is important to sample only a certain percentage of the packets so that the DRAM speed can keep up with the data stream speed.

we need to bear in mind that sampling comes at the cost of reduced accuracy.


Table 2 contains results using the fpa selection criteria with the variable distribution 2Recent studies [35] have pointed out some limitations in Rocketfuel data, suggesting that the number of actual physical routing elements may be less than inferred by their measurement technique.

this particular inaccuracy in the present data places more stress on our mechanism than the suggested corrected scheme would place.


Since the reuse of the mapping is completely under the client s control, the window of vulnerability does not exist in this case.

this approach introduces a latency of 2×RTT6 to the STUNT server before the mapping can be predicted.


A participant moving from one cell to another joins and leaves the same number of cells.

in the traditional hexagonal zoning, the view of each participant in the virtual world is discrete; the view will not change until it moves from one cell to another cell.


As such, we do not encounter the issues related to long scanning and association times characteristic of WiFi networks.

because we consider users mobile phones as ferries to carry network data, we face new challenges such as privacy and transparency of phone memory usage by two di.erent entities, the user and the network.


PDQ was the .rstto point out that minimizing FCTs requires preemptive .ow scheduling and attempts to approximate the same ideal .ow scheduling algorithm as pFabric to minimize average FCT or missed deadlines (§3).

like D3 ,PDQ s .ow scheduling mechanism is also based on switches assigning rates to individual .ows using explicit rate control.


We observed this is used by some phone models such as the Samsung Galaxy Mini and iPhone 4.

the Samsung and iPhone 4 implementations appear to be di.erent.


During the silence phase the throughput is zero.

the scheduler allocates one slots so that this connection can send the bandwidth request as soon as possible when the active phase starts.


We have included the results for sharing 80%, aHHO =0.8, of the guard bandwidth reserved for VHOs with horizontal handovers in Figure 3.

to achieve the same reduction in capacity-dropping, more bandwidth has to be reserved since it is now shared with HHO calls.


proposed a optimized LIPA-SIPTO solution that perform bearer speci.c o.oading of mobile tra.c [12].

the proposed solutions require signi.cant fundamental changes in the standard protocols (including changes in the UEs and eNodeBs) and/or use of additional expensive o.oading infrastructure like Home-eNodeBs, local GWs etc.


It is fair to assume that routing is stable because route pinning is a separable problem.

one still needs to ask whether the service implemented across a domain truly provides a hard guarantee?


3.1.2 Server-side Functionally, no changes on the server side are required.

our approach leads to a potentially signi.cant performance penalty on the server side.


Even though all three layers start from the same number of nodes, layers-1 and 9 become signi.cantly wider with time, implying a low death probability.

the width of the waist remains relatively low compared to other layers.


In an environment in which there are heterogeneous devices with largely differing buffer sizes, it is unclear how the systems will perform.

in the VoD system described here, the buffer sizes can be equalized by properly configuring the streaming clients during session negotiation.


This is because morenodesare involvedin asynchronous communicationsin sf4async.

sf9-async hasasmallerworsecase data latency as illustratedinFigure 4(b) becausemorenodesusemh-sync communications.


Each of these proposals has it s own merits; stateless schemes are easy to manage while state-full schemes patrol uncooperative .ows more ef.ciently but do not scale.

given the number of AQM proposals it is beyond the scope of this paper to do an exhaustive performance evaluation across all schemes, hence we will only evaluate CHOKe and BLUE as they represent the stateless alternatives to this work.


Each honest node will have at most one request and hence at most one identity at any time.

malicious nodes may attempt to register multiple sybil identities to ful.ll multiple requests simultaneously.


Traffic traces collected from university campuses and research institutions have been made publicly available [6].

few traces from commercial satellite networks have been made available to the research community.


This heterogeneity requires user pre-configurations, namely with respect to the proper autoconfiguration mechanism to be used at each time.

future networks may imply that users own personal networks demanding self-configuration and self-management, and being part of very dynamic scenarios.


The primary bene.t of choosing a large value for ß is, the system can stay very close to the optimal value.

a small value for ß may cause oscillation.


Another way to achieve statistical bandwidth guarantee is to drop users when a P2P system has insu.cient overall bandwidth.

dropping a user is usually considered more annoying to the user than rejecting a user, thus in this paper, we consider only admission control algorithms.


current SS has no data in its queue, a candidate SS will utilize this time slot.

if there is no service available in this slot, this slot will be skipped without utilization.


In an all-optical transparent network, an optical signal travels in the all-optical domain and there is no OEO conversion at intermediate nodes.

since the quality of an optical signal degrades as it travels through optical components along a lightpath, the network transparency is mainly limited by impairments introduced by non-ideal components.


For example, cSamp [21] uses the hash values of the 5-tuples of packets to distribute sampling load among routers.

cSamp requires all packets to carry their ingress-egress pairs, which are not available in practical networks [20].


On the one hand, when s = 5.0dB, the reduction in tracking error for VT-LANDMARC is about 13.4% over the original LANDMARC in the interim area.

when s = 8.0dB, the positioning error of 50% samples for the original LANDMARC below 4.33m, and 90th percentile is about 6.46m.


If B n-1,n<Bn-1,n during [tn-1,tn], the n-1, n TA Server SIP Terminal Local Client Network If accepted INVITE INVITE If declined Decline Decline 180 Ringing 200 OK ACK MPLS Network INVITE Decline 180 Ringing 200 OK ACK Traffic stream TA Server SIP Terminal Local Client Network If accepted INVITE INVITE If declined Decline 180 Ringing 200 OK ACK ... local client network doesn t have enough outgoing bandwidth to accommodate all the SIP calls, and the TA server has to utilize admission control algorithm to decline some of the call requests.

if Bpred n-1,n>Bn-1,n during [tn-1,tn], some outgoing bandwidth resource of the local client network would be wasted.


This implies the surprising result that, under this attacker model, the incremental gain to adoptability for increasingly strong security properties is very small or nonexistent.

under a more realistic weak attacker model, the full-path security property has up to ten times the adoptability of a scheme compared with partial path security (e.g., soBGP) or simple origin authentication.


Consolidating virtual machines dispersed across the servers in the data center into a smaller number of servers by migrating and turning unnecessary servers off, can reduce energy consumption.

turning server on and off causes wear and tear costs and migrating virtual machines impose management overhead to the system.


Similarly, schemes that use RSS range estimates may perform worse than range-free schemes for connectivity above ccr.

if the schemes considered are known to perform close to the CRBs, analysis of the critical connectivity will provide valuable information to help choosing between them.


The potential value of various o.oading strategies to address these concerns have been demonstrated [6, 12].

due in part to the inherent complexity and the resulting di.culty to a.ect change in these networks, these proposals have had very limited impact despite their potential bene.ts [16].


The majority of the communities in the conferences are short-lived with the median total community duration being 6 (SIGCOMM) and 8 (IN-FOCOM) minutes.

approximately 30-40% of the temporal communities meet for 10 minutes or more.


First, mark all links in good paths as good; the rest of the links are unmarked .Then,selectthebadpath pb with thehighest available bandwidth among the remaining paths and assign the available bandwidth of pb to all unmarked links on pb (pb is then labeled as justi.ed and all links in pb are marked).

we repeat the previous step until there is no unjusti.ed path in .. thetwoconditionsof Lemma-1(goodlinksare removable and bad links are detectable) may not be true in practice.


Dividing the monitored fields into virtual grid of cells seems to be suitable for applications with mobile sensors [2] and critical infrastructure monitoring applications [10].

a free model might be suitable for applications such as health monitoring where patients can be located using different methods.


Unfortunately, upon failure, said approaches take down all running slices.

the VA architecture has only one centralized element: the Virtualization Gateway (VGW) as illustrated in Figure 1.


If we would know in advance which keys dkj the adversary requests, this proof would indeed go through.

the selection of the dkj by the adver sary can be done adaptively, even depending on the values of the ei,j.


Trace aggregation: to capture the timing information in a dynamic graph it would be necessary to store a graph for every time instant in the past.

this approach leads to scalability issues, and consequently the data summation becomes required.


Therefore, measurement of plantar pressures is important in diagnosis and foot ulcer evaluation.

current plantar pressure measurement systems are either expensive or have a low resolution.


The closest recent work to ours is [6], where the authors propose a methodology for passive bandwidth estimation between two communicating wireless stations.

their method does not provide an estimate of the potential bandwidth that an end-host is likely to receive on a wireless link with another host (when one of the hosts is not part of the network yet).


Conventionally, a wireless ad hoc network is represented by a graph where two nodes have an edge if and only if the two corresponding nodes can communicate with each other.

in this paper we consider source-initiated, circuitswitched multicast sessions.


Furthermore, these requirements are (roughly) independent of the threshold chosen, and so can be used even to detect very small degradations in path performance.

the secure sketch protocol does not allow us to easily measure round trip time, since packets are aggregated into one sketch.


Thus, thethroughputofMU-MIMOislimitedby the number of antennas onasingleAP[13].

this paper shows that IAC overcomes the antennas-per-AP throughput limit.


DPSP OPTIMIZATION The method presented to this point and the experimental resultsinSection 6showthatinpracticethe method is much less expensive than its worst-case computational complexity, which is still polynomial as shown in Appendix A.

in order to avoid excessive computation while still producing highly reliable path sets,we de.ne the following early stopping criterion: If the improvement in the reliability of the path set drops below a given threshold,the method can conclude.


Invested by government funds, the Lanwan Company had the full ability to construct the networks.

after all, the Lanwan Company is not a Telecom service provider, when urgent repairs or special services are needed by customers and service providers, the company may lack the full capabilities to meet these needs.


HH is a Peer-to-Peer (P2P) mechanism involving the BTS boxes regarding the decision enforcement.

the handover decision is computed at the master OpenSIPS as all the decision logic is embedded there.


Such a casual inspection could overlook important elements of the environment.

the changes he will make are minimal and easily reversible.


By moving one step further, a travel trip can be planned considering network quality [18].

these approaches all require the knowledge of users movement, which is not easy to achieve in many cases.


The graph also shows that the two topologies have the same maximum capacity, but in the good-bad case, it can be achieved only if we limit S to the threshold sending rate.

none of the current routing protocols give rate feedback.


Thus we have tk = tk-1 + V r[k]/c[k] (since this is when the k-th chunk completes downloading).

between tk-1 and tk, the bu.er .lls with V seconds of video.


Therefore, field trials are an important part of product concept design process.

more research is needed on how long trials should last in order to get rid of the "honey-moon effect" of introducing new technology into the users' life.


It has been shown that Y2[G8] and Y3[G8] are not spanners [14], and that Y4[G8] is a spanner [12].

as far as we know, no results exist on Yk[Gd], for any .xed radius d = 1.


FMS mechanism enables stations to avoid receiving unnecessary frames.

fMS is not the optimal strategy because in FMS standard APs should transmit multicast streams which have the same delivery interval at the same time.


At the end of the data reception at node j, if the actual interference perceived by node j is higher than a certain percentage (e.g., 75%) of the planned interference (.max Pthermal), then the AW size need not be changed, since the allocated additional power to combat MAI was e.ciently used.

if less than that threshold was used, then node j checks the number of concurrent transmissions that actually took place in that AW (based on numbers of CTS and DTS packets).


Therefore, there is also a wide range of security mechanisms available for them.

the use of existing mechanism to secure smart spaces is not straightforward.


Duplicating .ows : A high value of F reduces the loss of correlation information because .ows are duplicated up to F times to be sent to the NIDPSs.

the duplication of .ows consumes system resources like bandwidth and CPU load; therefore, it must be used selectively.


On one hand, the testbed provides the ability to validate performance in real wireless channel environments.

relying solely on testbed results complicates the task of examining the network s behavior and diagnosing the root causes of performance degradations.


SDRT is a .rst attempt to propose a transport protocol for UW-ASN and addresses some of the aforementioned design principles.

it is still an evolving work and needs further improvements, as it creates redundant transmissions and is computationintensive.


First, when assigning slots, it can allocate guard bands in each slot to allow for some drift.

guard bands should be kept to a minimum to reduce bandwidth wastage.


These algorithms does not involve any message passing or queueing information.


the mean residuals are always positive, because the equation' s underestimates are more wrong (in absolute terms) than its overestimates.


If the subject is a good guy, his or her utilities are determined by usub(o; good), otherwise, his or her utilities are determined by usub(o; bad).

the set of AIOS inferences are determined by the Nash equilibria of the game model based on the rationality notion of an expected-utility maximizer .


6.1 Micro-benchmark In order to evaluate the accuracy of LoadSense, we need to compare the LoadSense prediction (high/low) with the observed cellular throughput at a given mobile.

since LoadSense works when the radio is in RRC disconnected state, we don t know the exact cellular throughput available when the radio is passively estimating load.


When max K =16, the space needed to store the corresponding WSS is max 64k bytes (each term of WSS occupies one byte).

since the length of the WSS increases exponentially with the order of the WSS, it becomes impractical to store the whole sequence statically when K becomes very large.


Given the above observations, we decided to use 10-fold cross validation in Section 5 where training and testing are performed on the same trace.

when training and testing are performed on di.erence traces Section 6 we use the whole dataset to build the model.


If a transmitter successfully transmits frames for a pre-determined number of times, it increases its data rate to the next higher rate and the current carrier sense threshold is associated with the new transmission rate.

if a transmitter encounters transmission failures for a pre-determined number of times, it decreases the carrier sense threshold to a next lower one (in the case that currently it uses higher carrier sense threshold than the default one associated with current transmission rate) or decreases its transmission rate to a next lower one and uses the carrier sense threshold associated with the transmission rate (in the case that currently it uses the same carrier sense threshold as the default one associated with current transmission rate).


The reason is since the traffic in the network is light, that it is difficult to tell an isolated packet loss due to the temporary network congestion or error in the wireless channel.

as the number of background connections increases, the probability of an isolated packet loss due to the congestion becomes smaller so that our TD module is able to perform as well as other loss differential schemes do.


This evaluation has been done using Ethernet network.

this paper is different from the above mentioned work [2] because in this paper the performance evaluation has been done under different scenarios such as wireless and hybrid networks.


We have a worst case scenario when all the messages (warning and normal) have the same priority.

packet priority does not a.ect the percentage of blind vehicles nor the total number of packets received.


4.2.2 Statistics Cycles are less common than loops: they appear on only 0.84% of the measured routes.

they appear on a broader range of the nodes: we observe cyclic measured routes towards 11% of the destinations, and the cycles concern 3.6% of the IP addresses discovered during our experiment.


A number of tracking techniques estimate a vehicle s position from nonconcurrent distance estimates [8][14].

distance estimation requires round trip message exchange or prior time synchronization with the beacons.


For a network with a high arrival rate of new .ows, the amount of PACKET_IN messages is very high.

even current high-end ToR switches like the IBM G8264 are only capable of creating up to 200 PACKET_INs per second [2], which massively restricts its usage in such networks.


According to the results for this scenario it can be seen that DSR performs better than AODV in terms of losses and throughput, especially in case of higher speeds (higher than 80 km/h).

dSR also performs better than AODV in terms of delay for every car speed.


BR consumes between 2 to 25% more energy than PRR×DIST, only in scenario-2 PRR×DIST performed 4% worse.

in the two scenarios where Greedy has a non-zero r, it consumed 3% and 54% more energy than PRR×DIST.


E.g., the user may be attending a VoIP call over WiFi and a little movement of her head may displace her smartphone.

the client may change its location as its user walks from one location to another.


This can be computed by direct comparison.

it is possible to speed up the comparison by Picking a few random bytes from the same location within the .rst k locations, in both these payloads and checking if they are the same.


Secondly, overhead will be less in the proposed method, as extra message exchange is not required.

size of the PREQ message will be increased in case of active propagation.


Once ni rebroadcasts the message, we say that ni has joined the group and has entered recovery.

if ni is an AP and it does not hear any join message within a certain time (e µs) that satis.es all the requirements, then it exits the wait stage.


One surprise in our findings is that many of the processes are well-modeled as IID, once we identify change-points in the process s median (loss, throughput) and aggregate fine-grained phenomena into episodes (loss runs, delay spikes).

iID models are a mixed blessing; they are very tractable, but IID processes are very hard to predict.


If the average delay is longer than the delay requirement, the sink node marks the delay-noti.cation bit in the ACK packet whenever it receives the data packet from descendant.

when the average delay is shorter than the delay requirement, no packets are marked.


The Election one is the closest to the LINGER framework, as it employs one of the mobile nodes as the information carrier and runs an election process among nodes in the targeted geographic area when the current carrier leaves such region.

the solution in [13] requires a geocast routing protocol to deliver the information to the elected node, with all the associated overhead, while LINGER is self-contained.


Studies about analy sis of p erformance degradat ion of resp ective WBANs in multip le WBANs environment or measures to solve t he p erformance degradation caused by occurrence of coexistence condition are in p rocess [2, 3].

t hese studies do not indicate measures to detect or p redict coexistence condition but measures to imp rove p erformance after t hat int erference is occurred only .


We believed these constraints would make the scenarios used in the study overly arti.cial, and that quali.ed participants would be much harder to come across.

we still wanted to elicit subjective feedback from the participants, especially for their thoughts on how the two tools compare to each other for the given task.


we examined the e.ects of QoE by video quality adaptation.


We then terminate the simu 1 E2 C , |C| = K - 1 TC := lation when either the system size increases to the thresh 2 Function f is a.ne in the range [0, 2d], and thus the Lyapunov function W is quadratic in the state variable n in a corresponding range.

we need to go beyond quadratic functions in order to apply the Foster criterion.


At that time, end hosts had a single interface.

today end hosts often have multiple interfaces to access the world wide web.


One simple way to do this would be to .ood all routers with an invalidation message.

.ooding the entire system on host failure would not be ef.cient.


The reason of this bad MCS selection is caused by the fact that SFER using the current MCS increases, because subframes in the latter part of A-MPDU fail due to mobility.

frame error rate (FER) of probing frames might be lower than that of the currently employed MCS, since probing frames are sent to the air without aggregation, even if the MCS used by probing frames is higher/lower and not suitable.


The system uses event calculus in conjunction with adductive reasoning to derive the sequence of events to achieve the desired goal.

the system is not suitable for autonomic reconfigurable systems since it depends on full system knowledge and lacks approaches to deal with incomplete or conflicting data.


This observation is not new; one of the earliest sensor network deployment studies, Great Duck Island, observed correlated reception [18].

the degree of correlation varies greatly across network setups and link layers.


Te layer 2.5 exploited in the CLARM routing protocol, a new feature called LPI (Logical Path Identifier) is used to forward packets to the next hop node.

the point to note is that there is no intrinsic concept of a physical link between nodes in wireless systems.


The main disadvantage of an execution of the protocol, for each offer, is that it supposes a lot of messages and is slow.

from our point of view, we consider the secure negotiation an important feature since there is not much sense in making the negotiation independently of the contract signing.


1.1 Related Work A similar model that capture the dynamism of a network can be recognized in the so called evolving graphs (see for instance [6, 11]).

the obtained results concerning the broadcast in such networks do not apply directly to the WSNs case, mainly because of their centralized approach.


We believe that realistic propagation scenarios can only be simulated adequately with models that explicitly consider the actual propagation paths of the signal.

explicit modeling of wireless signal propagation is a complex topic with high computational demands.


The 700 0.8600 500 400 300 initialization of the WSMstream begins with a 5 second period where no data is sent and is followed by about a 10 second period where WSMstreams the clip at 500 to Bitrate (Kbps) Loss Ratio 0.6 0.4 200 0.2 600 Kbps to .ll a client-side playout bu.er.

subsequently, 100 0 02 0 10 20 30 40 50 60 0 10 20 30 40 50 60 http://snad.ncsl.nist.gov/itg/nistnet/ Time (Sec) Time (Sec) 3See http://perform.wpi.edu/real-tracer/, used in [6] 4http://www.tcpdump.org/ Figure 6: Bitrate for 1128 Figure 7: Loss Ratio for 5http://dast.nlanr.net/Projects/Iperf/Kbps Clip1128 Kbps Clip if a clip with a bitrate even higher than the avail able capacity (e.g, 1128 Kbps for our testbed) is streamed, WSMchanges its transmission rate to a much lower bitrate, as shown in Figure 6.


Additionally, in [24] Ruponen presents the idea on how to utilize SDN in practice in wireless rural area networking.

the security and dependability of the SDN itself has still open issues.


A member AS has the advantage to gain network connectivity to all other members of the IXP.

interconnection arrangements re.ect bi-lateral agreements2 between a pair of member ASes, and these networks may want to impose certain conditions to ensure that they connect only to certain other networks or connect with them in ways that re.ect their business model and support their market strategies.


The simulation scenario is based on the flash-crowd setting which represents an extraordinary burden on the network because only a small set of peers can upload data to others at the beginning.

in our setup, if a regular peer finishes downloading, it remains in the network to seed the data for an additional 10 percent of its download time, which mimics the way BitTorrent peers behave in real-life.


Hence, enough possibilities exist to circumvent a single high link weight.

due to the relatively high expected hopcount not all high link weights may be circumvented.


We can get the max_link_util and total_lost_pkt by collecting SNMP counters in a DCN.

predicting these two metrics after a mitigation action is nontrivial because the action could change the traf.c distribution in the network.


Algorithm Distri gives slightly better estimations in con.guration using a high number of motes.

its e.ciency lowers whenever less motes are used.


For this class of users, what is relevant is the perceived QoS: as long as the QoS is satisfactory, there is no reason to move to another location.

if the QoS degrades below an acceptable level, a typical user of this class may decide to look for a better location in the park, becoming stationary again when the perceived QoS is restored to an adequate level.


Second, the inferred presence of an L2 network may hide a cascade of L2 networks.

the nature of the router degree distribution (i.e., the actual number of devices directly connected to it) is not impacted by those limitations.


The performance of the HHR scheme increases gradually with increase in the deadline due to its dependence on timeouts.

for short deadlines,the PRM scheme achieves rapid improvements due to its proactive component and further gradual improvements for longer deadlines due to its reactive component.


PMIPv6 does not require the Mobile Node (MN) to be involved in any signaling exchange for the mobility management.

the network-based localized mobility support provided by basic PMIPv6 was only designed for single host.


COUNTERMEASURES In [6], it is shown that adjusting certain parameters such as frame size or modulation is not effective to face a strong interference.

as stated in [12], this kind of adaptations may be useful in front of some types of attack.


In contrast, LA-TinyOS only slightly increases its .ash usage and uses less .ash memory when there are 3 events or more.

rAM stores dynamic data such as runtime variables.


The reason for the poor performance experienced by outdoor nodes is that the mobility of the nodes leads to route failure, which can cause packet loss, excessive delay, or both.

nodes that are inside are more likely to be stationary and hence, route failure occurs less frequently.


The liveness requirements of fair exchange protocols clearly cannot be achieved unless messages are eventually delivered over (at least some) communication channels.

a communication channel that eventually delivers transmitted messages (called a resilient channel [4]) deviates from the de-facto standard model used in analyzing security protocols.


This problem of recovering from BGP peering failures is addressed in [3] by relying on the provisioning of protection tunnels between the primary egress and the secondary egress or the NEXT-HOP.

fIFR does loop-free local rerouting upon any single intra-AS or inter-AS failure without setting up of additional protection tunnels.


In our proposed Hybrid PMIPv6 Indication mechanism, the MAG sends the RA message with PMIPv6 pre.x and Pre.x Type .eld 1 at the .rst time.

because the MN needs on-link IPv6 pre.x, the MN sends the RS message with Pre.x Type .eld 0 .


PERFORMANCE EVALUATION State migration is a complex process that requires several activities.

a framework for NIDS cooperation should be suitable to real-time tra.c analysis, hence it is important to evaluate the impact of the implemented state migration framework on the overall NIDS performance.


Notice that we need to send at least one packet over the path 1-2-4-6 occasionally, as this is the only way to probe the path.

we will not be aware that we are creating additional contention and decreasing performance.


Theorem 2 is somewhat similar to the conclusion drawn by Xie and Kumar[22], and even more similar to Behzad and Rubin s conclusion in [1].

neither [1] nor [22] show whether there is a limit to the maximum capacity as P approaches in.nity; Theorem 3 answers this question.


{0, 1}, this problem can also be solved with binary programming.

in large networks, there are many constraints (8).


Figure 2(c) shows that for smaller epochs (0.5s), where we have 10 times fewer counters, the accuracy of both algorithms decreases.

our conclusions that 1) The accuracy of sketch-based switches is better for restricted switch cost and small thresholds 2) We can save control network bandwidth with Max-Cover algorithm for large threshold and more expensive switches without losing accuracy are still valid.


PN formation with GW node (without ERs) always up and look like normal links to the routing protocol.

in the on demand inter-cluster tunneling this is not possible.


There is one access point located in the home.

there are many additional APs that can be detected.


If Ni is in the active state, it will take appropriate action depending on the state of the sending node.

when Ni has become S P rocessing before it detects the arrivalofanewnode Nj, it continues its processing normally until it becomes S Leader or S F ollower.


In such sit  P(X = x)  0 1 2 3 4 5 0 500 1000 1500 Throughput (Mbps) RTT (ms) (a)Throughput (b)Round Trip Time  Figure 19: Comparison between DRWA and TCP Vegas as the solution to bu.erbloat: although delay-based congestion control keeps RTT low, it su.ers from throughput degradation.

dRWA maintains similar throughput to CUBIC while reducing the RTT by a considerable amount.


This paper studies the downlink tra.c of LTE networks only assuming uplink tra.c is of secondary importance for web browsing and video streaming users.

studying the uplink can be an issue depending on how the spectrum or time is shared between uplink and downlink tra.c.


Intuitively, this causes the spanning trees to be uniformly distributed across the available links.

notalllinksin a spanning tree arethe same links closer to the root are likely to carry more traf.c than links lower in the tree.


In [4], we presumed that the network consisted of k + 1 equispaced nodes in one dimension, with the extremal nodes being s and t. The optimal values of n and k were derived analytically in this idealized setting.

in this paper we report on randomly generated realistic experimental scenarios and provide an algorithm to determine the optimal values of n and k and the associated overlay network implementing the connection.


CONCLUSIONS Previous work in DTN routing protocols has seen only incidental performance improvement from various routing mechanisms and protocol design choices.

we have proposed a routing protocol for DTNs that intentionally maximizes the performance of a speci.c routing metric.


As J increases, the utility values of those links with smaller required transmission rates decrease for the sake of achieving a certain level of fairness.

with di.erent channel gains, some link, say m th link, with a small required transmission rate may be forced to use a small value of am so that only a small value of Qm(a) is achieved, for example, Q4(a) in our numerical analysis.


It is important to note that surrogate users are not the target user and are at risk of projecting their own biases on their ideas of what the target user might do or think.

surrogate users offer an alternative to few or no interviews with a subject matter expert as long as the researcher considers the possible bias in the data.


From 1970, when Burton Bloom .rst described a compact probabilistic data structure that he used to represent words in a dictionary [2], until 1995, there was little interest in using Bloom .lters for networking.

judging from the number of papers that make direct or indirect use them [4], interest in such applications has surged in the last 10 years.


Our results show that the connectivity advantage using unidirectional links is almost non-existent, but shortest path costs show some improvement with unidirectional links.

these improvements too go away when hop-by-hop acknowledgment costs are accounted.


These customers might demand accurate outage reports or strong recourse for service failure (penalties to the provider more severe than honoring a your money back warranty).

this is generally not something that service providers have accepted in other businesses, unless required by law.


We can see that in a 1Km-radius network, a forged report traverses only 4.2 hops on average, and 6 hops at most.

without LBRS, a forged report can traverse as many as 20 hops.


Requests: Nodes prefer sending requests to nodes belonging to the same group.

if no node from the same group advertises a new program/page while a node from the default group does send a new advertisement, then a request is sent to that latter node and data is transferred over the default channel.


The results of our simulations are reported in Figure 7.

as seen from the .gure, the average degree with log-normal shadowing is slightly higher than the degree with free space propagation.in both cases the average degree remains con.ned below 8.5, even for large networks.


nyms at speci.c time instances (e.g., before associating with wireless base stations).

this solution achieves location privacy only with respect to the infrastructure.


Balancing these benefits, though, is the disadvantage of inability to guarantee full network coverage.

deterministic broadcast algorithms innately guarantee full network coverage (assuming ideal MAC layer).


The authors introduce mobile nodes into the network by choosing some random starting and destination points for each node and using Dijkstra s single source shortest path algorithm to calculate the route.

tIGER maps do not provide speed limit information.


As a result, e.ective web acceleration systems that work well within these constraints are still very useful.

many existing systems are built on basic mechanisms that predate the increasingly personal nature of web usage.


In our study we have not explicitly considered bandwidth capacity; we have implicitly assumed that the energy constraints will be more severe than bandwidth constraints in the system.

if energy constraints are not signi.cant (consider as an extreme case if all nodes could be wired for power), bandwidth issues could be the dominant consideration.


Existing approaches for AP-mediated power management perform centralized scheduling based on PSM.

these approaches are not application-agnostic and either make use of application-level proxies to shape traf.c[12, 13, 14], are limited to certain traf.c types[18, 22, 23, 24], or require explicit hints from the applications[11].


Prior works such as trajectory sampling [2] and NetSight [3] directly observe packets from the data plane, diverting all or part of the packet to collectors for after-the-fact analysis.

we allow operators to control how much they want to store for later use, by only collecting tra.c satisfying pre-speci.ed queries, while .exibly supporting the full generality of queries available in earlier approaches.


One possible weakness of this approach is that some messages may get lost in the network and as a result a.ect the overall network connectivity.

as we shall explain later in this section, this problem does not appear to be a signi.cant factor.


Introduction Multicast transmission offers tremendous savings in net- work bandwidth over unicast transmission for applica- tions that deliver the same content to multiple cus-tomers by allowing these customers to "share" the trans- mission on common access links [8].

this shar- --"rU-~versity of Massachusetts, Department of Computer Sci- ence, University of Massachusetts, Amherst, MA 01003-4610.


Hence, the performance of Multifacet is similar to that of Traditional repeater as the co-ordinated transmission throttling ensures that the AP does not stripe packets on shared link.

for C2 and C3, repeater client link is not the bottleneck and hence Multifacet can start utilizing the spare shared channel capacity leading to client throughput improvement over Traditional repeater.


We only replace the entropy encoding/decoding stage with our rateless video code.

our design does affect some of the parameters of the earlier stages, which we describebelow.


[3] proposed an optimized adaptive broadcast scheme in which the average rebroadcast probability of each vehicle varies with local node density, and through the setting of random timers the number of relays is minimized.

the selection of parameters like counter threshold and probability is empirical, and the above schemes result in either surplus relays or over-reduction of retransmissions which decreases packet reception probability in unreliable links.


a registry with a higher number of ob jects often provides more reliable information than the others.


In this case, the network s task is to transport information provided by the source nodes unmodi.ed.

network coding considers information as a mathematical entity that can be operated upon.


Owing to the challenging nature of the wireless environment, all three stacks perform several times worse than their theoretical optimal duty cycles.

aEDP comes within the closest of its optimal duty cycle: 244% higher than optimal, compared to 342% for the default stack and 552% for the reduced-ACK stack.


The technical details of TRIAD s solution and our own are quite different: in TRIAD, the resolution step and the routing step are con.ated, thereby improving latency, and at the shim layer between IP and transport, they use forward and reverse tokens that record the path taken, instead of stacks.

the main difference between our proposals is that identi.ers in TRIAD, both of hosts and data, are derived from domain names, and indeed, the TRIAD approach relies on the semantics and hierarchy of domain names to aggregate routes to content names.


A di.erentially private mechanism was .rst investigated by McSherry and Talwar [22].

spectrum is di.erent from traditional goods, due to its spatial reusability.