Mainly because this allowed faster evaluation compared to the usage of more complex network simulators which might model certain aspects more realistically.

the obtained results for the proposed CEDBBT algorithm provide not only an indication of the validity of the chosen approach, but also indicate an upper bound within which the performance of real world conditions is contained.


Packets were distributed according to their proximity to each AP: in the CY group, Y/T and T/C s packets were generally observed, since they were involved in  Figure 4: Layer-4 TCP/UDP packet ratio compari son -CY group (APs-B, C, D) Figure 5: Layer-4 TCP/UDP packet ratio comparison -Berth group (APs-E, F, G) loading/unloading containers there, meanwhile in the Berth group, Y/T and C/C s packets were generally observed, but we found no more interesting results on layer-4 analysis.

in the analysis of OSI layer-2, we found more in- teresting results, as shown in Figure 6, which illustrates the MAC frame retransmission ratio.


The mules in this simulation only positively affected the results, as they have no energy and memory constraints.

even if all the three simulated approaches have large advantage compared to traditional sensor networking, as they do not rely on the end-to-end connection assumption, the mobility-assisted forwarding require the assistants (the mule in our simulation), while PROSAN comes for free with people mobility.


Note that a minimum number of one colored .fo must be allocated for each colored input port.

allocating more than one colored .fo allows tokens of different colors to be consumed by FUs in parallel, thereby enabling multiple logical EPs to be processed concurrently.


Middlewares that adopt ontology-based context modeling [17, 8] usually adopt an agent-based interaction paradigm allowing resource limited devices to process context-based computations.

this approach can increase the number of interactions over wireless links and limit the use of context when the device is running disconnected from network.


Some content providers have also de.ned their own representation sets, for example Net.ix [6].

to the best of our knowledge, neither the recommendations from system manufacturers nor the choices made by content providers have been supported by any scienti.c study.


4.7.2 Implementing Stateless Of.oad for LWEP Many Ethernet NICs incorporate stateless o.oad features such as large send o.oad (LSO) and checksum o.oad for TCP and UDP.

very few of them provide such support to other protocols.


In both the DHE-based protocols any FNi can request HN to partly sign DH ephemeral keys regardless of any MD requesting to access FNi.

this can be noticed by HN if no Client-Certificate-Verify message follows the Server-Key-Exchange message.


INTRODUCTION The wealth of information that could be obtained from vehicular networks is quite enormous, ranging from location and speed to emergency alerts and requests for roadside assistance.

the very richness of information also threatens to cause deployment to come to a grinding halt if there are adverse consumer reactions to the technology.


Traditionally, a dedicated network of brokers is used for the intermediate routing of events.

recent systems use peer-to-peer (in short P2P) model, where subscribers and publishers arrange themselves in a broker-less overlay network and participate in forwarding events.


Due to WSN s limited and non-renewable energy budget, considerable research has been conducted on sensor energy management.

no direct attention has been given towards proposing a distributed energy e.cient solution for workforce selection.


To avoid such periodic transmissions from synchronizing with one another, which would result in undue collisions of signal packets, the neighbor protocol adds random jitters to the interval value between signal packet #Signals n 10 10 1 transmissions.

because of the randomness of signal packet trans missions, it is still possible for a signal sent by a node to 100 100 0 collide with signals sent by some of its two-hop neighbors.


Equivalent functionality could be obtained if all the cluster resources in the system ran a distributed .le system that supports caching AFS [18], for example.

given that in a wide-area computing environment these cluster resources are typically owned by independent entities and operated in di.erent administrative domains, this approach is not always feasible, and operating system-and .le system-independent approaches must be investigated.


The proposed countermeasures are strongly related to physical limitations of working stations (e.g., inability to broadcast and listen at the same time) which are not valid for all types of devices and communication channel properties which may be di.cult to secure.

the solution proposed in our paper is based only on computational limitations of adversarial devices.


Like traditional routers, the infrastructure nodes in our model maintain links to their neighbors, compute routes, and set up the forwarding state to forward data packets.

instead of running a traditional routing protocol, each infrastructure node runs a general-purpose query processor.


Figure 3 Reactive RO between LMAs 4.5.2 Proactive In the proactive synchronization strategy, a proLMA receives a BU from the MR and sends an ePBU to the priLMA, just as before.

during the final step when the priLMA sends the (positive) ePBA to the proLMA, the priLMA also sends ePBUs to all the other LMAs in the Extended Home Network.


Note that due to contention, a node may not be able to transmit its beacon message in an active slot that overlaps with those of other nodes.

the probability of not being able to hear a neighbor s beacon message in nT slots diminishes geometrically as n gets large.


The residents in the community pay less money and should get less bandwidth individually.

residents in the community share their lives with others all over the world through YouTube, or watch on-line streaming movies.


[33] empirically established the basic probe size as64KBforthe NetworkWeather Service (NWS).Theyusedthe connection pair to predict the throughput of data transfer on NWS and focused on only the connection pair where the probe size was 64 KB and data size was 16 MB.

theyselected the size of the connection pair empirically and generated connection pairs in limited networks, so the probe size might be inappropriate for other networks.


For example, a field size of q=232 yields a probability for decoding failure of 2x10-10 for a 25-packet file.

small fields reduce resource use, but have a lower probability to decode.


This property will be useful when we turn to the synthesis of delay spaces later in this paper.

as shown in Figure 3(b), the in-degree distribution for the Inet topology follows closely the power-law (note the loglog scale).


They aim to obtain a triangular coef.cient matrix using linear operations of rows in I.If I has full rank, the data packet can .nally be recovered.

the GE algorithm is time consuming for low-pro.le sensor Algorithm 1 Accumulative Gaussian Elimination.


The reason is simple: the reference point selected for one monitor may not be on the path from a different monitor to the same pre.x.

multi-homed target pre.xes also present additional challenges.


Their design radically reduces protocol overhead and achieves zero-copy transfers.

our work is related to protocol design for message-passing parallel programs.


The .gures show that degree is a muchbetter predictor of completion ability than centrality.

closeexaminationofFigures9(c)showsthatsomeof the very highest-degree ASes have poor completion ability.Further consideration of the implications of Proposition 3.3suggest an explanation that sharpens our understanding.


Unlike the RAN, NS-3 does not model the EPC in detail other than to provide a basic Serving-and Packet Data Network Gateway.

since our focus in this paper is primarily on the RAN interactions and TCP, we can still leverage NS-3 s capabilities in our study.


We leave open the question if it is decidable whether two (non necessarily standard) intruder constraint systems are equivalent.

the equivalence problems In this section we illustrate how to use the intruder constraint systems of Section 2 for analyzing cryptographic protocols w.r.t.


Concerning the PLT, short buffers of 8 and 28 packets show faster PLT for the short-high, shortoverload, and long scenarios.

improvements in the PLT do not help to generally improve the QoE as the PLTs are already high, causing bad QoE scores.


So we get for all sessions a constant-bit-rate reservation of 320 packets/sec.

the optimal bandwidth computed for queuing system (1, 3) is only around 73 packets/sec, which is a bandwidth decrease of around 77%.


Random topologies usually have high path diversity and high bisection bandwidth.

the worst case network diameter is typically much larger than a similar size tree network, even if the average path length is smaller.


Once again, we sketch an architecture and protocol based on CCN [8].

in this case we propose a di.erent model in an attempt to reduce the space overhead incurred by CCN with its use of the pending-interest tables (PITs).


Current wireless network transition costs are prohibitive for using this technique to disable and enable the network card between transfers for applications like NFS.

wake-on-wireless seems extremely promising for supporting incoming connections for server processes like the X server and sshd.


There is also some expectation of su.cient density so that when a device has data to send, some number of neighbors will be available at the time of discovery.

social networks do not have the same expectation of stability or device density.


The LIP then resets the CGA timer and the sequence number of the LBD, and informs theMAC scheduler via the netlink socket to stop scheduling.

wedo notneedtoidentifythis non-locallink as the link will be discovered either by processing the subsequent incoming LBD or by the lifespan of the corresponding LD.


PRACTICAL CONSIDERATIONS Based on the overall evaluation, the Java applet socket method is recommended if the proper timing function is applied.

our inspection of some Java applet-based tools shows that many of them are still using System.currentTimeMillis() or Date.getTime(), such as [8, 19, 22].


This will result in wastage of buffer space for pipes with smaller BDPs and wastage of capacity for pipes with larger BDPs.

in pTCP the buffer space will be shared by the individual pipes based on their respective BDPs.


In particular, the problem of scheduling transmissions ef.ciently given certain interference constraints have been addressed in several papers and algorithms to solve this problem have been proposed [13, 21, 3, 19, 1, 17, 4].

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.


In contrast to [9], [10] and [12], the information needed for the calculation of the caching value of a video is much more, furthermore, this information is not deleted when a video is entirely removed from the cache.

in reality the total number of videos handled by a proxy server may be too high for the proxy to keep access log information for all of these videos.


6 (a), when the tra.c rate is low, DutyCon con 0.3 0.2 0.2 0.1 0.1 0 10-1 requirement (s) 0 100 200 time(s) 300 400 Figure 7: Average delay and average queue length varying delay requirements trols the average delay very close to the desired requirement.

as the tra.c load becomes heavier, neither Duty-Con nor U-MAC have e.ective control of the average delay.


Stateless algorithms such as Epidemic [28] and Spray-and-Wait [25] are more suitable.

plain epidemic routing obviously faces the issue of an exploding number of messages.


The inaccuracy in the end timestamp may be caused by delays from waiting until a .ow export packet or cache .lls, or by lingering out-of-order packets2 [7].

.ow start timestamps appear to accurately re.ect the .rst packet of a .ow (allowing us to use them in calculating the inter-connection times).


Mobile IP suite of protocols designed to support IP routing to mobile nodes.

support for truly seamless mobility requires more than just routing; every service associated with the mobile user needs to be transferred smoothly to the new access network.


On the one hand, PlanetLab is an infrastructure that supports multiple distributed services running on hundreds of machines throughout the world [3, 4].

conducting controlled and realistic network ing experiments on PlanetLab is quite challenging, especially considering the .rst three goals above.


This is for the simple reason that with many error-prone nodes on any individual route, it is almost a certainty that some node along any particular route will fail.

this is will not be simple to achieve, for two main reasons: One is computational complexity: searching a large space of possible routes (derived from having a large number of nodes with high density) may prove computationally prohibitive for low complexity devices like our micro-routers.


TWO-PHASE ALGORITHM In the previous section, we get the requirements of (5)-(7).

choice of a relay by a mobile node a.ects the decision of the others due to the interference.


As a result, there is a clear disadvantage to using a tier-4 provider for high-speed connectivity.

the tradeoffs between tier-2 and tier-3 networks are much less clear.


work: In this model, the access gateway in each vehicle is already equipped with a cellular radio modem, and the vehicle owner can contract with any one speci.c cellular operator for monthly service; and (ii) Bring Your Own Network: In this approach, the access gateway in the vehicle is con.gured to tether with the owner s personal cellphone as the radio modem, and all Internet tra.c piggybacks on the cellular access plan of that cellphone.

there is an intriguing third option that we propose and explore in our framework that can put the vehicle manufacturer (or a designated third-party provider) in charge of managing cellular services to vehicles.


The Software based .ow performs some of the same operations as the Solaris 10 IPQoS [26].

by being integrated in the stack, Crossbow .ows perform better than a traditional layered IPQoS implementation.


Likewise 3D hybrid, the transceiver and arbiter modules are only integrated in cluster routers of CIT and CMIT.

the total network area used by CIT is significantly lower than the other architectures (37% and 42% less than that of CMIT and 3D hybrid respectively) since the network is formed only by cluster routers.


In [30], the same authors present a method for ferry route design when the nodes are mobile.

they require that the nodes or the ferry move proactively to meet each other and in some cases require the use of long-distance radio to agree on a meeting location.


Mj and msigj are given to the user and he submits them along with the .rst report on sj to each report database.

aP addition is not anonymous, as the user must reveal the AP to A, so Wi.-Reports will initially depend on existing hotspot and war driving databases and altruistic users topopulate S. over time we believe that owners of well-performing APs will be incentivized to add themselvesbecause otherwise they will not receive any reports.


Many MPI applications use non-blocking message passing calls in an attempt to overlap computation and communication [8, 15].

most contemporary MPI implementations are not able to provide true overlap between computation and communication even with nonblocking message passing interface.


Additionally to metrics for the master node, IEEE 1588 provisions for a synchronization slave to measure the variations within its parents clock.

these .elds are optional and don t get transmitted to other nodes.


Hijacking such a VIP node compromises the network system.

in the latter case no single node in the network is able to accomplish the network function (e.g., routing) provided by a polynomially/linearly increasing network.


Thus, compared toper-host fairqueuing,NetFence can signi.cantlyreduce the amount of state keptby abottleneck router.

netFence access routers need toperformper-(sender, bottleneck link) rate limiting.


This permits the system to absorb .uctuations in total resource usage, while ensuring high task satisfaction.

because it is impossible to predict traf.c variability, DR E AM may infrequently drop tasks when headroom is insuf.cient.5 In our current design, operators can specify a drop priority for tasks.


Improvements to the NetSPA engine made calculating client-side attacks and trust relationship exploits possible, which in turn made visualizing them possible.

the main force was a process of internal evaluation that started with the GARNET system itself.


To support the rapidly growing demand in multimedia tra.c, wireless systems must meet the stringent quality of service (QoS) requirements, including the minimum bandwidth and maximum delay constraints.

the time-varying nature of wireless channels and the hard delay constraints give rise to great challenges in scheduling multimedia tra.c .ows.


Statistical multiplexing along delay dimension: DDM is the .rst measurement-based approach which exploits statistical multiplexing along the delay dimension to increase resource utilization in comparison to purely deterministic admission control.

the earlier measurement-based approaches mainly focused on statistical multiplexing along the bandwidth dimension, i.e.


In addition, like the route request steps, the route reply steps also avoid DoS attacks due to also using the pre-hashing and nonce techniques.

there are several crypto-theories for securing routing protocols in MANETs [5-8].


Since federation is based on the matching of personal data between users, it is obvious that this type of information is essential to be exchanged between users.

in order to ensure that this information is not revealed to anyone that has not been previously characterized as a trusted party, this information needs to be safeguarded.


INTRODUCTION The current approach to providing QoS in the Internet is based on the DiffServ protocol [1].

since DiffServ have been designed for fixed hosts and networks, it is not adapted to mobile networks, especially when Mobile IP is used as the mobility management protocol.


4.2 Adaptive Code Generation Theoretically, a color barcode formed by smaller color blocks leads to higher transmission rate.

this does not always increase the communication throughput in reality due to the blur e.ect.


We believe that it is possible to use virtual links/queues and receiver-side-scaling (RSS) to scale the performance signi.cantly.

we leave this as future work, focusing on the core algorithm in this paper.


On the one hand, the traf.c estimation process must track changing demand since routes computed for one demand matrix may be inappropriate for another.

computing new routes to mirror these changes implies both a computational cost and a performance cost if routes are changed dynamically.


In fact, a highly accurate energy estimation is desirable.

this would need to be investigated starting from the transistor level, taking into consideration leakage, etc.


Once all stations receive this instruction, the stations which last two LSB bits of the MAC address (IEEE EUI-48 or EUI-64) are 00 belonging to group 0 will transfer their frame first.

all stations belonging to other groups will set their waiting time, that is, Network Allocation Vector (NAV) much more precisely.


Numerous studies have been carried out on the caching and replication techniques in mobile environments.

previous works were mostly based on the ground that the mobile nodes in the network have the same ability, and the data transmission latency is uniform.


Due to its nature SDS is very robust against message losses which sets SDS apart from many traditional DCSP solvers which fail if one single message gets lost.

sDS cannot guarantee that a solution for solvable problems is found, as it relies on application messages which cannot be in.uenced actively.


They enable hosts to communicate without wires, routers, or access points.

they still rely on servers not only to provide network services, for example DHCP [9] and DNS [16], but also to provide application services, e.g.


It shows that, when there are more secondary users competing for the spectrum usage, strong interferences limit the receive SINR of each secondary user and thus, the average sum rate decreases.

both the average optimal and sub-optimal prices are increasing in the number of secondary users, which can also be observed from (12).


This leads to a reduction of one IP router port at the output, which corresponds to savings in both energy and cost.

since all data goes through the IP router, the increase in payload utilization may also have a consequential impact on packet loss in the network.


FPMIPv6-S results in a lower handover latency than PFMIPv6.

when a MN is aware that the handover is imminent, it sends Report message to the SMAG.


Radio over Fiber link with electrical last mile block diagram; Elec refers to the last mile that could be twisted pair or coaxial cable or air and does not give universal solution.

when the baseband information is digital, adaptive digital predistortion schemes could be deployed to overcome the nonlinearity [20], [21].


This results in a swarm of particles all moving in the same direction with no regard to separation distances.

too small a value results in a behavior that resembles a stationary swarm of insects.


an OC48 (2.48 Gbps) link, for which packet transmission times are 4.8 µs, and the link can carry roughly 200,000 packets per second, we can see that the .rst term in s 2 (p, ., µ) is W very small, and so the asymptotic variance is almost independent of sampling rate.

also note that the measurement interval must be long enough that T = .N, is a reasonable approximation, which would not be the case for N< 10.


Moreover, Figure 8 demonstrates that the performance of CAMRA-RLB scheme are between the CAMRA (no redundancy) and the CAMRA (max redundancy) configuration, which guarantees the highest delivery of video frames.

the load-balancing scheme used in CAMRA (max redundancy) introduces a significant network overhead, because each packet experiences a number of retransmissions equal to the number of available paths between a source-destination pair (Figure 9).


In summary, even in situations where the initial seed is underprovisioned, the global upload utilization can be high.

our experiments only involve compliant clients, who do not try to adapt their upload contributions according to a utility function of the observed download speed.


The model requires only a few samples to train the model parameter.

when the training data are dense, distances between .ngerprints are close.


Looking for the applicability of our solution in a mesh scenario, we can state that our results seems to recommend IP paging for layer 3 mesh networks, where each access node acts as an AR, and then, the size of the RAN is one cell.

as mentioned in Section 5, due to the particularities of this type of networks, e.g.


The management of computer networks is a discipline whose main goal is to keep the IT communication infrastructure working in a proper way.

traditional network management models usually fail to provide adequate tools to manage modern IT networks.


For example, in IEEE 802.15.1, Bluetooth [7], Data Medium packets transmitted at the basic rate (1 Mbps gross air rate) include payload error coding rates of 1/3 and 2/3.

stronger Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page.


The previous fact results in a high pickup distance and also high pickup time.

the results have also shown that the new approach produces better results than current approach.


The system is initially  designed for a low value of N = N, and a particular d. We can now use Theorem 4 to .nd the value of a * that will lead to stability.

theorem 5 assures us that the system will still be stable when the number of users increases beyond N. We can state a similar theorem for the utilization .


In such scenarios, the fact that ABEFD is selected is likely due to inconsistent advertisement by AS B to AS A.AS B itself or part of AS B is using AS path BCD, as it is available in the BGP tables.

aS B must have advertised to AS A path BEFD, leading AS A to choose the longer path.


The netwoork concentrationn effectively affects the size of the clusters.

the standard devviation for the ccluster sizes, in aall evaluated configuratiions, is typicallyy around 0.15.


Upon examining the con.guration .les, wenoticedthatUniv-3 useddataplane mechanisms(i.e.packet .lters) toimplementthespecial casesinthe .rstpart.

to implement the off-by-default access policy in the second part, the network used both packet .lters as well as control plane mechanisms such as route .lters.


Using RTS/CTS handshake, node A secures the transmission of a data packet to node B.

only the nodes that are within the receiving range from node A and B adjust their NAV (Network Allocation Vector) not to interfere with the data transmission from A to B.


Finding high-quality routing paths was an early challenge addressed by the research community [13].

that alone is not suf.cient to ensure good performance in mesh networks, where transport protocols like TCP can perform poorly because of complex interference among neighboring nodes.


More recently, SEATTLE [28] proposes to distribute ARP state among switches using a one-hop DHT and makes dramatic advances toward a plug-and-play Ethernet.

it still cannot well support large data centers since: 1)switch state grows with end-hosts; 2) routing needs all-to-all broadcast;3) forwardingloop stillexists[8].


This state of a.airs would not be terribly disturbing if real networks exhibited stable connectivity characteristics, i.e., a given network always either looked like a DTN or like a mesh.

we .nd signi.cant temporal and spatial diversity in realistic network testbeds, as described next.


These intrusions are based on many types of protocols.

the Transmission Control Protocol (TCP) is the most popular, the authors in [4] showed that 85% of network traffic is TCP.


In [32] three approaches to enhance subscriptions and events semantically were proposed in order to make the existing centralised syntactic matching algorithm semanticaware while keeping the efficiency of current event matching technique.

[32] does not address the scalability issues involved in including ontologybased reasoning into the CBN, and no proposal is made to integrate this with the P2P routing extension for ToPSS.


In the example shown, the callback method itself updates the UI widget.

the callback method could call other methods (perhaps asynchronously!)


As shown, when using TRG and Nakagami RPMs, and when obstacles are not accounted for (as in the majority of VANET simulators), information reaches more vehicles (98.26% and 94.37%, respectively).

the same models only achieved 63.24% and 55.37% of the vehicles being informed when the e.ect of obstacles in signal transmission is considered.


We propose a structural model that leads us to expect transfer times, like file sizes, to be lognormal.

there is some evidence that bursts of file transfers in both ftp and HTTP are long-tailed.


CbCO is based on POoC and omits certi.cates on a periodic schedule.

the certi.cate rate n at which certi.cates are added is .exible and triggered by the number of vehicles in communication range (as measured by the size of our neighbor table).


In the previous experiment all the activities are carried out in their logical order: analysis of the .rst part of the attack, state migration and analysis of the last part of the attack.

in a real scenario it is impossible to guarantee a similar event synchronization and consequent coordination among the cooperative NIDS sensors.


To the best of our knowledge, there is no known method to specify the minimum startup delay without exact knowledge of the receiver curve.

in general, users may still be satis.ed if the playback jitters do not occur too frequently.


Obviously, the mechanism of either type of HARQ schemes makes itself autonomously adapt to the instantaneous channel conditions by different number of retransmission and be insensitive to the errors and delays incurred in channel measurements.

during a long deep fading, a large number of retransmissions will be required for certain packets to be correctly received at the receiver.


The experimental results showed that Stacking performs better over Voting in all the scenarios.

voting degrades its performance when more number of classi.ers are added into the ensemble.


Presently we have manually added these mappings for each Cell2Notify client to the Asterisk con.guration .les.

this task can be easily automated using the supported database functionality.


Due to the cheaper price andlowpower consumption ofSRAM-basedIP-lookuparchitecture, IPStash is competitive with CAM/TCAM-based IP-lookup for a routing system.

iPStash cannot be easily developed to support matching against multipledomains(e.g., matchingTCP source and destination port) due to the complexity of rules.


In general, path failures lead BGP messages by 24 minutes.

for some hosts, failures can follow BGP messages by many minutes.


Geometric greedy routing is distributed with constant storage, communication and computation overhead.

geometric greedy routing itself does not guarantee delivery of data packets, due to the presence of local minima in the network.


We have seen that a rough approximation can be deduced from the receiving transmission energy and its change in time.

for the construction of a reasonable basic network, a direct implementation of previous approaches needs some interaction between location beacons and distance measurements.


These include detecting problems in configurations after the fact, or improving training, or requiring periodic re-certification of network administrators.

the availability of human process data such as we will continue to collect can enable unique amelioration strategies that cannot be applied without such data.


(9) .T Interestingly enough, Equation (9) communicates that as soon there is a delay variation on a constant-rate stream (.D> 0), the consequences are seen in the coe.cient of throughput variation on any larger time scale, no matter how large it is.

the impact of the uniformly ( 1 ) distributed  .Donto the CoTV vanishes with Oso .T that, in practice, it might become unobservable at very large time scales.


This provides a good explanation of the observed outcomes with RIP when using the Quagga 0.98.6 implementation.

given the pervasiveness of the problem, it seems more logical to conclude that the problem isnot entirelydueto implementation errorsbut comesfroma lackofaprecise modelto understand, reasonand supportthe interactions between route selection and route redistribution.


The results illustrate how traffic differs from one application to another.

the results do not show how the traffic of one application fluctuates from one time to another.


In contrast, in ISAR, there is only one receive antenna; hence, at any point in time, the receiver captures a single measurement.

as the target moves, he/she samples the received signal at successive locations in space, as if we had a receive antenna at each of these points.


In other words, the clients cross-talk interference is pre-cancelled by the dAPs.

we found ZFBF to be sub-optimal for netMIMO, especially in an unbalanced network topology.


This is due to the fact that when using the periodic approach, nodes will retransmit frequently as they have no way to learn about their potential neighbors.

the reactive approach will avoid unnecessary retransmissions unless previously disconnected nodes join the current cluster.


The routing path is selected opportunistically based on the current link quality situations.

an opportunistic routing strategy introduces a dif.cult challenge at the same time: multiple nodes may hear a broadcasted packet and unnecessarily forward the same packet.


If the content size was very small and could be transferred within a few seconds, the choice of who to download from, among those having relevant content, would not be critical.

when sharing media content that requires minutes to be transferred (e.g., high quality music .les or video clips), it becomes important to select a source that will remain colocated long enough for the operation to complete.


It goes out of its way to .lter out the likely false positives (identi.ed commonly through several iterations of the deployed tool in daily network operations).

despite all the .ltering, more often than not, a false positive report is generated.


This is continued until locations for all the n points have been generated, or placing further points becomes impossible due to too large network density or too large r. The Poisson and SSI models are useful for gaining intuition on the in.uence of regularity on network performance.

they are not very well suited for working with empirical data.


A change score can then be used to help quantify the magnitude of the changes.

there are two problems with this approach (which we have experienced in practice): (i) Due to overlapping impact scope of network triggers, choosing the right time interval is non-trivial and an incorrect choice often leads to wrong conclusions.


In our simple congestion scenario, the results for TA200 was not unexpected since the short and accurate reaction time of TA200 would perform better than others.

an interesting conclusion for this scenario is that at 1000 ms case, the freshness of data is not a dominating factor, instead the reaction time (shorter time interval) is the dominating factor.


The tradeoff between complexity and performance results of [25] and [26] seems to be good.

they lack of an analysis of issues related to their implementation.


Therefore, it is preferable to rely upon numerical optimization methods.

since in practical systems the switching thresholds ideally should be computed in almost real-time in order to facilitate a fast adaptation to changing channel conditions, searching the global optimum vector Topt is considered to be prohibitively complex.


When considering iBGP, someone getting a new route can cause others to lose routes, not to mention the complicated interactionsbecause of the MED attribute.

the recently proposed centralized routing [2,7] get around the iBGP problems.


5.1 Overview Although the VCG-based double auction is super.cially closest to the auction we aim to design, the imbalance of the budget is unacceptable to the auctioneer.

tASC is inspired by the design of McAfee double auction.


5.2.2 Tie-breaking route decisions The computer simulation in [20] concludes that it is very common to reach the tie-breaking rules in BGP s route decision process (Where a tie-breaking rule is any rule of lower rank than the AS-path rule, and is usually not visible outside the AS in question.)

our active measurement can help identify tie-breaking route decisions.


The results show that when the policy of use of UCP is applied on the scenarios, the average handover latency is decreased; this is due to the time of processing and recovery of information of the current conditions of every cell is avoided.

in the first scenario we can observe a similar behavior when the P1 or P3 are applied.


Figure 3: Digital Samples (without Interference) Figure 4: Digital Samples (with Interference) Our approach is inspired by the soft bit method that was already introduced in Section 2.


This is due to the error in the estimate with packets of different sizes (see section 4.3.4).

the multiplexing of the flows is sufficient to avoid large estimation errors.


Among these approaches, leaf-pushing is the most popular one due to its simplicity.

as mentioned before, these approaches either increase the number of pre.xes, the number of sets of disjoint pre.xes, or both.


Figure 2 shows that low Bmax links tend to be more stationary.

we compute PRR of the links after 14 days and 21 days and plot the percentage of links having stationary PRR within this interval.


This means that ECN can be integrated with the fractional window increment scheme.

the loss rate is so low with a small a value, the performance gain due to ECN is hardly noticeable.


On the one hand, we model the effect of wireless physical layer congestion, which is often omitted in DTN simulations.

the simulations are conducted with synthetic and real life mobility traces that model the proposed usage scenario more closely than than many earlier MANET studies.


Acting independently, neither tool is capable of emulating complex interdomain routing scenarios, such as those of a large ISP.

our testbed will enable the emulation of such an environment, including the glue-logic which exists between di.erent routing domains in a large network, exchange of route advertisements with upstream peers at multiple entry points of presence, and complex internal topologies, as shown within Figure 1.


In this way, devices can return the GTS resources by explicitly requesting that the PAN coordinator provide deallocation.

in most cases, the PAN coordinator has to detect the activities of the devices occupying GTSs and determine when the devices stop using their GTSs.


In fact the di.erence is nearly within the error bounds of the mean for both algorithms.

utilizing BreadCrumbs connectivity forecasts lets the prediction-aware algorithm activate the WiFi radio 30% less often.


Without enabling oursolution, the service delay linearly increases with the processingtime.

our solution does not have delay since MM has twothreads to deal with location update and call service concurrently.


Our numbers match the volume of the traf.c (33.8%), but the video bandwidth savings in Web cache is smaller in our trace (18.7%).

we show that TCP-RE could increase the bandwidth savings further by 9.7% for video.


Obviously, there are many other network synthesis approaches available, and we don t attempt to survey them all here.

the examples above provide a su.cient cross-section to understand the limitations of the vast majority of synthesis techniques.


Our results show that, with an appropriate setting, it is possible to achieve the desired level of network reliability (i.e., a delivery ratio up to 100%), while increasing at the same time the energy efficiency.

in some scenarios, this is possible only by using parameter values which are not compliant with the standard.


Another possibility for the lower degree of performance consistency in WiFi is higher contention forWiFi frequencybands, and differences between WiFi and cellular medium access control.

since we observe the same pattern of lower consistency in WiFi across all metro areas even the most sparsely populated ones where we wouldnotexpecttheeffectof contentiontobe signi.cant webelieve that overbuffering is the more likely cause.


From the above analysis, it emerges that all the intrusion detection approaches rely on some sort of internal state information that re.ects the current state of the network tra.c.

di.erent detection algorithms adopt di.erent logical abstractions for the generation of heterogeneous state information.


For the last case, we consider di.erent numbers of femto base stations.

in this section we show the results only for 300 femto base stations, as they yield similar capacity gain as deployment of class B base stations.


Thus, it allows the device to turn off the Wi-Fi interface and minimize the number of idle state periods and and the number of neighbor discovery scans.

one of the major challenges to be addressed in using Bluetooth with Wi-Fi is the co-existence [7].


In particular, when the user roams to a foreign domain far from his home network, the saving on communication cost with our protocol is much signi.cant since it requires only local communication.

all existing schemes require involvement of the home server and inter-domain communication is required to authenticate the roaming user.


The IEEE EUI-64 value is very probably globally unique.

link-layer communications willfail .rst should more than onenode on the same link try to use the same MACaddress.


However, our problem cannot be mapped to the SMT problem because {ri} are not known.

it is known that MST is a good approximation of SMT in the Euclidean space.


CHALLENGES The Backup Network leverages on a number of well-known and established networking technologies.

most of these technologies have so far been developed and used separately.


Note that this attenuation func that tion has a singularity at the origin, and the received power increases without bound as r decreases.

in real dkc >r ity, the received power is always .nite and bounded from dkc+1 : r above by the transmission power.


So far, IEEE 802.11e EDCF has been prop osed, which is a contention based channel access metho d to achieve the QoS guarantee in wireless LAN.

this cannot realize the desired throughput ratio or deterministic target throughput in principle.


Intuitively, this is because larger magnitudes of q+ & q-, or a larger value of m makes it less likely that Alice s and Bob s channel estimates lie in opposite type of excursions, thereby reducing the error rate.

both types of excursions also become less frequent, thereby decreasing the number of secret bits that can be generated per second.


This indicates that packet processing done by a vSwitch software has larger variance compared to ahardware switch.

given that the overall delay is still very small, well below 1ms, we believe this satis.es the requirement of most applications in the data-center scenario.


Their presence can be considered as a deviation from a regular model of network tra.c, making them susceptible to anomaly detecting IDS.

the tra.c generated by .ooding usually displays no distinctive di.erences from the regular one and exposes no clear patterns or strategies.


5.7 Evasion Resilience The detection approach presented in this paper is predicated on the assumption that existing botnets often exhibit a regular, detectable pattern in their communication with the C&C server.

we have not discussed how strong this requirement is and how difficult it might be for an attacker to perturb this regularity to avoid detection.


The suitable admission scheme can be developed based on the activity management model from [5].

this model is rather complex and requires numerical solution of a large number of non-linear equations.


2.6 Of.ine Access Transparent o.-line access similarly builds around caching and WAN acceleration when external connectivity is lost, the local Web cache can satisfy requests, but by itself, cannot provide the illusion of full connectivity.

when combined with the WAN accelerator, it can be used to store multiple versions of dynamic content, such as keeping track of what page was last served to each user.


Figure 7: verage Bu.er Occupancy in 20-nodes Scenario Figure 8: verage Bu.er Occupancy in 100-nodes Scenario In practical scenario, the selection of routing scheme may bounded under many requirements such as application scenarios.

some of the routing schemes may not already provide message management function.


The maximum weight matching in any graph can be found in O(n 3) computation time, using a centralized algorithm [16].

in wireless networks (unlike a router) implementing a centralized algorithm is not feasible.


This argues for source-specific trees built over shortest paths from the active source to the receivers2.

when built dynamically, there is a time lag from the time the source starts streaming to the moment all receivers have appended themselves to the tree and start receiving the data stream.


Obviously, for S =1 all the M units of memory should be placed at the inputs and for S = N all M units should be placed at the outputs.

it is unclear what should be done for 1 <S<N.


On absolute numbers, EC2 grew more over this period, adding 36,414 responsive IPs by the end of the period, compared to 8,270 for Azure.

the relative growth of Azure is larger, with an increase in 7.3% of responsive and 7.7% of available IPs, compared to 3.3% and 4.9% for EC2.


For rtPS, ADPQ yields the best throughput and DFPQ gives the worst throughput.

for nrtPS and BE, ADPQ has the worst throughput and DFPQ has the best throughput.


Weaknesses: The research focuses only on two university networks, which have many specific properties that cannot be generalised to other more interesting networks such as ISPs, enterprises Comments to Authors: I like the thoroughness of your analyses and the conclusions drawn from these.

i find that the data is a bit limited with only two university networks and it will be hard to generalise these findings.


We observed loss rates as high above 10% under the heaviest load with P2P applications running.

we found that setting the default socket bu.er size larger makes tcpdump reliable with that change, no packet drops are observed, even under the heaviest load.


SAn alternative would be that the central site S determines the information groups a proxy may join and sends to the proxy only related information.

the proxy will lose the opportunity to join other information groups when its profile changes because of lack of information about other available web page clusters and their associated information groups.


Additionally, the .gure shows that acceptance delays for XL-1 frames are greater than the acceptance delays for S-1 frames.

s-11 and XL-11 frames exhibit very similar acceptance delay curves.


The miniature requirement on the node size prevents prior external signal based approaches, e.g., [12 14], from being applied due to the extra hardware requirement.

the node density in such applications could be high.


Now, since a primary network has priortized access on a channel, the average delay of its tra.c is low.

the average delay of a secondary network s traf.c is high.


Thus, we can only say that yi(t1)is some yj (t2), but we do not know which yj .

we have a distance matrix containing the distances between each pair of visual objects in di.erent images.


This query has a rule NR2 that recurse in.nitely to generate path tuples of monotonically increasing costs.

with the addition of the boolean function f inP ath(P2 ,S)= false to prevent path cycles, the number of recursive calls are .nite and hence the query is safe.


While such time synchronization is possible using the Network Time Protocol (NTP) [25], such an operation can be fairly expensive due to high variability on end-to-end network paths, especially involving multiple wireless links.

moB allows the following simple technique for ef.cient time synchronization.


We attribute the good results of this algorithm to the fact that it incorporates the degree of vertices into the ranking.

computing the binomial probability that a vertex has at least k neighbors that are part of the community has a linear runtime complexity of O(n- k).


On the one hand, a manager faces high-level constraints such as performance, ease of manageability, security, and resilience to failures.

to realize a network design, a manager must manually choose from a slew of protocols, low-level mechanisms, and options.


It takes on average 11.14 seconds for the transmission to fail.

the Java API on the smartphones simply throws an exception to notify the experiment driver that a transmission failed.


Hence, FUN-1 potentially has a higher coding gain than FUN-2 due to more coding opportunities.


One promising solution is to introduce a similarity factor to filter malicious cliques.

it is much difficult to employ similarity based mechanism to deal with this problem because: (1) it is hard to define the similarity factors, in which we need to define subtle metrics to identify clique peers from honest evaluators; (2) a similarity based filter must provide an efficient computing scheme such that the tradeoff between latency and accuracy have to be well balanced.


Secondly, by looking at the individual models, it is clear that the sequence follows a precise scheme: models which neglect .ows interaction (CSM, Manhattan, FTM, IDM) come .rst, generating fewer, larger clusters, i.e., a more globally connected network, in which the probability that two nodes over the road topology cannot communicate is low.

motion descriptions which consider intersection management and employ multiple-lane roads (IDM-IM multilane, IDM-LC) determine the highest cluster numbers, fragmenting the network into smaller and more isolated groups of nodes.


We see that if the number of prediction and measurement points is equal, for small number of measurement points the gains spatial prediction yields are very small.

as the number of measurement points is increased, the gains from spatial prediction increase rapidly.


It can be observed that the RSSI mode shows a detection ratio between 95 % to 99.8 % when the channel utilization is high for the case of ATP, UDPB and UDPG, while it drops to 80 % for the case of just beacon transmissions.

the RSSI+CCA mode shows a detection ratio of 96 % except for the case of UDPG where it falls to 82 %.


However, these techniques require changes to the logical con.guration or the routing software, respectively.

vROOM hides the e.ects of physical topology changes in the .rst place, obviating the need for point solutions that increase system complexity while enabling new network-management capabilities, as discussed in the next section.


Hence, for small numbers of diverse instances,votingper-routerhas smaller convergence delay.

virtual-network approaches require substantially more control overhead than the virtualrouter voting schemes.


Larger ß values cause the dye to concentrate around the seed-bot and therefore improve the precision performance as observed in Figure 5(b).

since the algorithm cannot reach far in the mutual-contacts graph for larger ß values, the recall performance drops as ß gets larger as observed in Figure 5(c).


It has been observed that to accurately model path bandwidth, one must account for the compression typically done by modems [3].

most image Content-Types are already compressed, so this correction should only be done for text content-types.


The successor of the key will reply to the requester (SB) with the whole list of names and addresses of SSPs.

peers who are in the transit path may reply to the requester without forwarding the lookup to the destination peer (i.e.


Even when some weights turn out to be negative, we can use the standard edge weight modi.cation procedure to make all weights nonnegative, since it can be shown that all cycles in the graph remain non-negative by our choice for w(v, r).

this would also require changing some edge weights in the original graph.


Failure Modeling: Based on prior work [14, 29], we .rst tried to .t existing heavy-tailed distributions to our failure data.

they did not capture the multi-mode properties of our dataset.


This typically involves making a wired connection (e.g., using USB) or to use WiFi in ad hoc mode or Bluetooth to connect the client to the smartphone gateway.

neither of these approaches are satisfactory.


Several projects leverage full scans of the Internet address space [1, 13] to understand the prevalence of open resolvers.

we are interested not only with discovering the existence of ODNSes, but also with understanding their characteristics and behavior, which entails sending far more requests than discovery would dictate (as detailed in subsequent sections).


For example, total path lengths are around 8 9 hops (adding the heights of the bars in Figures 3(b) and 4(b)), of which only 1 1.5 hops are links between different ISPs.

bottlenecks for these paths seem to be equally split between intra-ISP links and peering links (comparing the overall height of the bars in Figures 3(a) and 4(a)).


CONCLUSIONS In wireless multimedia streaming, power can be saved if data packets are transmitted as bursts, which allows the receiver to switch to energy-saving sleep mode between bursts.

traffic peaks caused by bursty transmission can be harmful for the network performance.


the error behavior of the channel was largely unaltered.


Note that STEAM-Sim must log energy consumption, which imposes a large overhead on the simulator.

as can be derived from Figure 3 the scalability of STEAM-Sim is bounded by f (N )= N · log2 (N )for test cases utilizing a minimum of 32 nodes.


Since the D-Flip-Flop requires an ALUT itself, the total FPGA resource consumption for this version of the StateEntity is a single ALUT.

the typical StateEntity does contain internal logic as well as a D-Flip-Flop, resulting in the StateEntity  State 2 VHDL entity in 2.


Large packets can increase this duration.

large packets are likely to lead to large amounts of data loss since the WNIC will lose the whole packet if it remained in the idle state at the start of the packet reception.


In our second technique, we split the cache into two parts, one for storing cached .les, and one for hierarchical substring caching as previously described.

we now use any block matches that we encounter to identify appropriate reference .les.


CONCLUSION The wireless roaming approach via tunnels preserves the home network s role as the actual service provider and has a number of additional security bene.ts.

it opens new challenges on the authentication and key establishment protocol that precedes the establishment of the tunnel connection.


Finally, emerging technologies aimed at accelerating dynamic content and Web applications should fur without Last-Modified headers accounted for.

this implies that 6% of requests overall still have no Last-Modified header.


We saw that for large buffers C2 has higher weights, therefore producing occupations smaller than C0 and C1.

for small buffers C2 has smaller weights.


Compared to the IP/WDM architecture, this two-level grooming scheme involves less electrical processing at the IP level, but at the expense of requiring an additional SDH cross-connection layer.

data processing in an IP router is much more energy intensive than in a SDH grooming switch [7], hence there can be energy savings from using this scheme relative to IP/WDM.


Formany, cellular services are the best choice.

the ubiquity and low costofWiFi suggestsanattractivealternative, namely, opportunistic useofopenWiFiInternet accesspoints(APs)orplannedmunicipal mesh networks.


Also actual data is transmitted during the measurement phase, therefore we do not waste resources for SNR measurements.

reuse cannot be leveraged, whose overhead (reuse loss) can be amortized as long as the epoch duration is several seconds.


Due to its lower sampling frequency, the sensing-time of pilot detection should be 85 times longer (6MHz/70KHz=85.7) than that of energy detection to acquire the same number of samples as Figure 17: Pilot detection: sensing-overhead and sensing-frequency (left-half: 1 interfering cell; righthalf: 6 interfering cells) Figure 18: Pilot detection (varying inter-CRN interference): optimal sensing-time/frequency, and minimal sensing-overhead energy detection.

the MAC frame size of 10 ms gives an upper-bound of sensing-time.


The left plot shows that the likelihood with which a provider gains a CP link shows positive correlation with the customer degree of that provider, as one would probably expect from the rich get richer principle.

there are several outliers, and the correlation coef.cient is only 64%.


In other words, our proposed SSFD system does not query on the internet frequently in the detection.

if there are no geographic information for some of IP addresses (i.e.


2.1.4 User Preference Some users may prefer the cheaper access network with a moderate QoS level rather than the access network which guarantees high QoS level with high cost.

some users may prefer the access network with a high QoS level regardless of the access cost.


At the .rst glance, converting topology uncertainty into traf.c uncertainty makes the problem more challenging, because the number of failure scenarios is at least .nite, whereas d+ XF contains an in.nite number of traf.c matrices.

the rerouting virtual demand set XF can be represented by a compact set of linear constraints in (2).


To enable mobile users without loss of white space opportunities, the database query interval of a user traveling at 60 miles/hour is suggested to be shorter than 30 seconds.

such a high database query frequency may not always be necessary.


SYSTEMATIC CODING In coding theory, a systematic coding is any error-correcting code in which the input data is embedded in the encoded output.

in a non-systematic coding the output does not contain the input symbols.


between absolute performance requirements and energy conservation.

in EH-WSNs, we want each sensor node to be able to adjust its performance to the availability of ambient energy.


The reconfiguration procedures should also be managed using policy-based approaches.

existing management approaches have nothing to do with reconfigurability, which paves the way towards new paradigm as well as challenges for the reconfiguration management.


A geometric program in the standard form is not a convex optimization problem.

with the change of vari def def ables yi =log xi and bi =log ci, it can be transformed into the following convex form: { ()} def T min p0(y) =log j exp a0j y + b0 { s.t.


Proposals to address this issue fall in two camps: a) tail-optimization approaches [12, 11] that modify the allocation of network resources to more closely match predicted traf.c patterns, or b) traf.c scheduling approaches that accumulate traf.c into highly-ef.cient bursts [13, 4].

we contend that the opportunities for both tail prediction and traf.c shaping are fundamentally limited by one factor: users are unpredictable.


Thus, packet loss rate will bezero, andqueueingdelaywill alsobenull.

when the .ow reaches the second hop it will have to be transmitted by a link that is half the capacity of the .ow bitrate.


In summary, none of .xed time bound settings can achieve the best throughput all the time in time-varying mobile environment.

moFA, which adaptively changes the A-MPDU length according to the degree of the mobility, can approach the optimal throughput over the entire experiments.


We will apply PCA on our link data matrix Y, treating each row of Y as a point in IRm .

before we can do so it is necessary to adjust Y so that that its columns have zero mean.


In [6], two digital algorithms for suppression of ACI in FM receivers are presented.

these approaches increase the complexity of the receiver as well.


One may think that a new AP installation is so simple that there should not be any trouble.

as the NESPOT network size grows, many different kinds of problems have been encountered.


This initial analysis would indicate a rule of thumb to dimension .ow-state-keeping devices to handle on the order of 10,000 -20,000 concurrent .ows per /16 of address space behind the device, assuming comparable utilization, tra.c mix, and timeouts to those in use on the measured network.

as utilization and tra.c mix vary widely, we decided to focus on both client and server tra.c separately, to generate numbers on .ow concurrency per active host.


Figure 7(c) shows the distributionofMACretransmissionsatthe SDM300 case.Weseethat the 802.11 retransmission thresholdof8 packetsis notexceeded, hence TCP does not see packet losses.

even a few retransmissions are enough to spend air time due to the 802.11 binary exponential backoff.


-0.4 Wefound thatYouTubetra.cincursalmost notail(except for one tail in the end) since nearly all packet inter-arrival -0.8 times(IATs) areless than the a timer value.

its drawback is under-utilization of network bandwidth causing its long DCH occupation time.


Data and control channels are truly orthogonal and simultaneous reception on both channels is allowed.

a node transmitting on the data channel may not receive on the control channel and vice versa(i.e.


Due to the differences in the way our system and the other existing traceback techniques are triggered, quantitative analysis and comparison are not practical.

we presented a qualitative analysis comparing our scheme with other traceback techniques.


After the switching, the user device should be able to utilize a better located server (C2), which is close to the new local DNS server for the WiFi network and the user s traf.c can take the direct route R3.

it is possible that the user device keeps using the old server address in its DNS cache and hence experiences sub-optimal performance using route R4.


Also note that this algorithm can easily be implemented in a distributed manner since the node closest to a chosen location can be found distributedly by having the nodes exchange some information with its local neighborhood.

these algorithms clearly require more information and more coordination than the a-RAND algorithm.


These reports used Signal-to-Noise ratio measured in dBm.

the estimation of frame loss from this metric was not very accurate.


As just discussed, the ECMP-related entries (e.g., wildcard entries) will remain static in the .ow and group tables.

the non-ECMP entries (e.g., speci.c entries) are more dynamic since they are directly in.uenced by the transition plan computed by zUpdate.


According to the simulation results in Section 3.3, a reduction of overhead is possible by only forwarding status information of vehicles from the close surrounding.

the introduced overhead is still not negligible.


Bloom .lters have no false negatives  if one of the k positions is set to 0, the element must not belong to the set.

bloom .lters can have false positives an element can absent from the set even if all k positions are set to 1, since each position could be set by the other elements in the set.


Both node 4 and node 2 transmit one packet to the sink (node 18).

the two packet receptions do not overlap, since the packet transmitted by node 4 reaches the sink after 0.17 slots (and its reception ends after 1.17 slots), while the packet transmitted by node 2 reaches the sink after 1.42 slots, after the .rst packet has been fully received.


Typically network operators use maximum link utilization in the network as a measure of network performance.

link uti 0 Link Utilization Threshold Figure 3: Impact on Service Disruption time and Traf.c Disruption when using maximum link utilization and node degree as metrics to estimate network performance.


Multi-in-multi-out (MIMO) .ows may be de.ned similarly.

there is no MIMO .ow for any switch in a fat-tree network.


The initial population of the genetic algorithm is randomly created by the Matlab s toolbox.

we can observe in equations (9), (10) and (11) that an infinite number of values enable to achieve the desired results.


This greatly reduces the receiver duty cycle in low traffic rate applications.

in dense networks, this mode results into excessive collision rates.


In [1], the authors proposed to use phone sensors to detect client mobility and request the phone to scan for better APs more aggressively.

frequent scanning is time consuming and wastes energy and prevents the client from transmitting or receiving data (impacting throughput).


through OSNs (i.e., e-mail, Facebook noti.cations, and invi tation requests).

we expect to see drastically dif ferent response times for other Facebook applications that involve real-time user interactions.


Indeed, the hexagonal grids are optimal in terms of coverage calculations since they increase the maximum area covered by each sensor and therefore increase the number of calculated redundant nodes within each cell.

in this work we choose a square-based grid because it is much more appropriate to the shape of the ROI given by assumption 1 and such a coverage technique will limit the number of exchanged messages which can be transmitted either on rows or on columns [18].


Therefore, the topologies of core network and access network of UMTS are more like mesh.

it is known that the computational complexity of solving the optimal mesh network is very high.


Recipients will relay the message to vehicles further behind.

this forwarding process can be intervened by a large number of malicious Sybil vehicles.


Accident, construction work, bad weather and poor tra.c signal timing are generally considered the factors causing tra.c congestion.

the most important reason given in [1] is that drivers tend to select the same routes to the same destinations.


Simulation results show clearly that gametheory obtains better performance than water .lling and the proposed game converges to the same SINRvaluesobtained fromtheheuristicoptimizationmethod.

unlike these, the proposed game results to be the most energy e.cient, also for a large number of considered users.


The IEEE 802.15.4 standard allows the sensor nodes to reserve transmission time slots via its Guaranteed Time Slot (GTS) mechanism.

this mechanism limits the maximum number of simultaneously allocated GTSs to seven, which makes the allocation and de-allocation of such slots very hard and complex, especially when the number of GTS requests is large.


Note that the total amounts of traf.c are approximately the same for Native and P4P.

p4P reduces bandwidth usage on interdomain peering links.


This relationship is hard to be classi.ed but less infected computers could result in the ine.cient attacks.

attackers would make an additional e.ort to select similar IP addresses for being consumers and providers.


Doing so is essential for the well-being of CDN servers in our approach, yet it could potentially disrupt ongoing downloads in the absence of routing change.

our extensive experiments over the global Internet (Section 4.2) indicate to the contrary: these spurious disruptions are extremely rare.


Of course, over the Internet, one is often forced to use TCP/IP for social reasons, and since many .rewalls block UDP and other transport protocols.

within an ad-hoc network, it is possible to use more e.cient protocols that are highly optimized for our needs, and allow the caching service more control over issues like .ow control and congestion control.


In addition, traditional queueing analysis is based on assumptions about certain implementation mechanisms of the studied system, such as a Cloud data center or a networking system.

resource virtualization and service orientation, which are key features of Cloud computing, decouple Cloud and network services from their implementations.


Time series models applied to the individual traces have shown that the future characteristics of the tra.c (e.g., per-user tra.c) can be predicted accurately.

this analysis has exclusively focused on network tra.c measurements conducted at static locations (i.e.


A node can always receive more encoded blocks from subsequent broadcasts in its neighborhood.

a nave broadcast mechanism has the potential of generating unnecessary data tra.c and the collisions can have a deleterious e.ect on network performance.


Furthermore, the priority of any QoS traffic flow is greater than that of best-effort traffic.

if a new flow requests relay through such a node k , then best-effort traffic may be preempted in order to accommodate the new flow, provided that Equations (1, 2, and 3) are satisfied.


It can also be used for the driven delivery of new subscriptions (for querybased scenarios, for instance, that may require random subscriptions).

because the path is unique, any failure in one of its nodes will cause disruption, preventing the delivery of the event as well as the subscriptions.


we show that the shield effectively protects the con.dentiality of the IMD s messages and defends the IMD against commandsfromunauthorizedparties.Weexperimentwithboththe VirtuosoICDandtheConcertoCRT.sincethetwoIMDs didnotshowanysigni.cantdifference,wecombinetheexperimenjammingsignalby32dB on average.


Since there are fewer such events, less data would need to be sent to the cloud, thus addressing some privacy concerns.

in this approach the CTM provider might have its own privacy concern: it may need to send valuable threat intelligence to the on-premises analytic engines, in which case it may seek to minimize the extent of the information that it reveals.


First, these previous approaches determine paths based on a hash of the destination s identi.er (or the identi.er itself), incurring a stretch penalty (which is unbounded in the worst case).

sEATTLE does not perform identity-based routing.


Considering when the maximum number of RSUs is deployed, for the Zurich dataset, in particular, there is no change from the original scenario presented in the previous section (the maximum number of RSUs deployed does not change).

for the other three datasets, the number of sensor increased considerably.


In contrast to that, we propose a particular mapping from any of the available payload modulation schemes to the highest modulation order that is already supported by the system.

a higher modulation order can be more susceptible to demodulation errors.


However, it can work with the maximum aggregate bandwidth available by such transmission mode, which improves the service o.ered to clients in its coverage area.

gAPSpotentially achieveslower uncovered area,being able to successfully service more disperse clients.


Our work is related to [6, 17, 21], which also considers pre-merging cooperations.

in these approaches the cooperation is limited to a ramp car s nearest front car and/or back car on the main road, whereas our approach enables a group of cars to cooperate with a ramp car.


This recursive search procedure can, in the worst-case,incur overhead comparable to CLDP [13].

notice that our example in Figure 13 shows a very contrivedtopology.


With products designed for mass market applications such as Voice over IP (VoIP) hardware costs are no limiting factor.

capital Expenditure (CAPEX) increases due to needs for backbone connection.


Performance Analysis of the IEEE 802.1 Ethernet Audio/Video Bridging Standard Hyung-Taek Lim, Martin Johannes Waltl Firas Chaari Daniel Herrscher BMW Group Research and Technische Universität Telemotive AG Technology München Munich, Germany Munich, Germany Munich, Germany {Name.Lastname}@bmw.de martin.waltl@mytum.de .ras.chaari@telemotive.de ABSTRACT Switched Ethernet is widely used for all kinds of applications.

for demanding multimedia streaming applications in a fully-loaded network, legacy Ethernet is not the best choice due to its limited Quality-of-Service (QoS) support.


This motivates us to design active documents that are composable and capable for network-aware policy enforcement.

while tools are available to show how some operational tasks (e.g., costing out a link) might impact the network [5], the interaction with such tools is currently largely left to operations personal.


Our use of hash array compression is similar to techniques using hash array counters in the iceberg study [11], the router tra.c measurement study [8] and the spectral bloom .lter study [6].

those studies are interested in .nding out the set of iceberg ob jects, i.e.


In a similar sense the researchers do not expect to observe classical linear behaviour in network incidents.

it is possible to consider y = a as a naive model of normality.


Ultimately, only one con.guration for the WSN needs to be selected.

as long as the relative importance of the various metrics is not known, we are interested in .nding the trade-o.s between the metrics.


There are already several P2P streaming applications deployed on the Internet, such as PPLive [1] and PPStream [3].

p2P streaming systems still suffer from free-riding problems, i.e., similarly to the free-riding problems observed in P2P .le sharing systems.


While changing associations make MIM-aware concurrent transmission opportunity, it causes an association control overhead.

in the centralized network architecture such as NOX/OpenFlow network, the association control overhead does not matter as shown in the next section.


These shortest paths tend to contain links of long distances, which may break very soon.

simply using more hops cannot alleviate the problem.


Note that for positive rules, all elements affected by such a rule can easily be represented by their parent element, i.e., the element that the rule is de.ned for.

deny rules do not have such a compact representation because upward inheritance prevents us from describing all affected elements by means of a single element.


Our measurement campaign in Zurich, Switzerland, shows that radiation emitted by mobile cellular base stations is at par with exposure levels measured in other European cities 4 to 5 years ago.

on the 2.4 GHz WiFi band we reveal a 9-fold exposure increase over the same time period.


[2] uses the same construction as [1] (i.e., singly-extended RS codes) to find an optimum value for the parameters of the code that maximize a lower-bound on the minimum throughput.

this optimality is only valid when using RS codes that are singlyextended.


Some of them (e.g., Access/One) have additional support for load management and e.ective coverage (or coverage hole management ) across multiple APs deployed throughout an enterprise network.

most of these products are tailor-made for speci.c hardware (for example, AirView comes embedded in all Alcatel OmniAcess hardware) and little is known about the (proprietary) designs of these products.


One obvious solution is to reduce the bu.er size in cellular networks so that TCP can function the same way as it does in conventional networks.

there are two potential problems with this simple approach.


We have some preliminary indication that our method is quite robust.

we will only have a clearer picture of these issues once we collect a much larger repository of data.


As shown in our previous work [9], A-MPDU frame aggregation helps de.ating the bu.er which results in significant queueing delay reduction.

this reduction is not always enough to achieve acceptable Quality of Service (QoS).


The simplest replication technique is to replicate a frame and transmit the original and replicated ones through multiple radio interfaces.

the simple replication leads to signi.cant overhead especially when wireless link condition is not quite severe and/or when the application layer tolerates a certain degree of frame losses by means of advanced coding techniques.


If we consider AP skew(using LPM) skew(using LSF) sigcomm-nat-foyer 40.30 ppm 40.39 ppm sigcomm-public-1 48.16 ppm 48.21 ppm average time taken to estimate the skew, using higher precision timestamps in a more predictable WLAN setting takes 4We do not have any control over the amount of wireless tra.c generated in these experiments.

the tra.c variation does not a.ect our results.


The difference in our observations from those in [25] could be due to the fact that Internet paths are better provisioned and less congested today than 3-4 years ago.

they are sometimes circuitous, contributing to in.ation in end-to-end paths [28].


Adding another two schedules reduces the lifetime by more than 25% to 1.5 years.

if the node already maintains many schedules, adding new time slots does not change the lifetime considerably.


GPSR [15], for example, switches from recovery mode back to greedy mode when the current node is closer to the destination than the node who switched to perimeter mode.

there is no guarantee that this node, or the next one, will not be another concave node, a local maximum on the perimeter face.


As shown in fig.1, among those three gratings, TPS-SSFBG has a symmetrical and low loss encoding spectrum, its correlation performances are also higher than other two gratings .

tPS needs the most sophisticated FBG manufacturing technic.


This is because the basestation frame scheduler tries to ensure all the tra.c to the mobile client is delivered, while resulting in a very poor throughput performance for the static client.

we notice that by using our virtual basestation framework, we are able to limit airtime allocated to the UGS client, thus improving overall throughput performance when the client traverses through the region with poor coverage.


As can be seen in the figure, when K=N (=5), the average BER is 0.

bER performance is significantly poor when K<N.


The KL distance between HTTP and Telnet is 0.32 which means that the Markov chain models of these two applications are significantly different and that it is very easy to discriminate between these two applications.

for HTTP and HTTPS applications, a good decision with a weak false alarm is not possible if the number of observed packets is small (of the order of 10 for example), but it becomes possible to take a reliable decision if the number of observed packets is larger (say, larger than 50).


Also, average power consumption increases with the number of nodes in any routing scheme.

network coding diminishes power requirement per node when the number of nodes increases.


We rely on using the address reported by routers in their response to traceroute probes to determine their ownership.

in some peering arrangements, a router owned by an ISP is allocated an address from the peer ISP s address space to make con.guration convenient.


INTRODUCTION Wireless mesh networks are becoming a major paradigm for constructing user access networks that provide community or city-wide Internet connectivity.

recent theoretical analysis (e.g., [3]) and experimental measurements (e.g., [2]) have shown that the current wireless mesh networks are severely limited in throughput and do not scale as they become large and dense.


Further, it is unlikely that LDA will be deployed at all links along many paths in the near future.

lDA probes can proactively discover latency issues, especially at very .ne scales, that a network manager can then address.


We consider only the top 50 sites as we gain diminishing returns from further investigation, so the result is only slightly larger.

the lowest byte hit rate of the content-based caching is 30-40% with 64-KB chunks, and the highest byte hit rate is 43-53% with 128 byte chunks, 1.7-2.2x larger than the object-level caching s.  4.


We also expect it since PowerCompass always tries to minimize the power requirement during routing while following the direction to the destination.

the CostCompass algorithm might follow a slightly longer path than PowerCompass, which mainly considers remaining lifetime of a node to pick the candidate nodes.


(ii) Uniform Sampling For uniform sampling with probability p of weights whose values are unbounded, then clearly the sampling threshold is in.nite t = supx>0 x/p =+8.

if there is an a priori upper bound xmax on x, then t = xmax/p.


First, it randomly selects a node m .N(TS) in proportion to its contribution, just as in the PS lottree scheme.

m is merely a candidate; it only becomes the winner with probability µ.


In most cases, the research proposals and practical implementations degenerate to some form of weighted proportional fairness in the long term.

they do not consider the cause of variations, and hence do not incorporate accountability appropriately.


(Other delivery methods are allowed at operator discretion.)

unlike web certi.cates, RPKI ob jects can a.ect the availability of BGP routes, and therefore also of TCP/IP, the very infrastructure over which they are delivered.


Before optimization begins the probabilities of selecting each neighbourhood moves are equal to allow the process to explore the full range of modi.cations.

as the search proceeds the algorithm evaluates the acceptance ratio of different moves in a set number of iterations and dynamically corrects the corresponding weights according to their performance, so that the most accepted moves are executed more frequently than others.


The .gure indicates that as d increases the accuracy of the estimates drops.

it should be noted that a higher value of d and Nc would imply more con.dence in results.


Then an algorithm for computing the NE will be provided.

due to space limitation, we present the introduction of potential games and the proofs to the following theorems in our online full-version paper [10].


Routing is considered in [8,28] by modeling the expected colocation time between nodes based on past interactions.

service composition fails if participants do not remain directly connected.


The intermediate nodes can not recover any of the k symbols based on k -1 linear equations.

if |GI (u)|=CG, the security is said to be topology dependent, i.e., the network code is considered secure if and only if Rank(MGI (u))< CG .


If we wanted to give the nodes in the example the ability to route packets then the only way to do that would be to allocate three uplink channels from A to SoDAA and associate each uplink channel with the appropriate IP address of B, C, and D s SoDAs.

this is an expensive approach whose cost grows with the degree of a node.


The protocol described above has similar problems to standard carrier sense based MAC protocols.

unlike traditional Wi-Fi protocols, Flashback effectively exports the contention from the data plane to the control plane.


As expected, using a larger value for a re-sults in a smaller node degree and radius.

as we discussed in Section 3.2, there is a tradeoff between using CBTC(27r/3) and CBTC(57r/6).


{u1,...,u7,u9} : {k1-7,9}k123 ,{k1-7,9}k456 , {k1-7,9}k7,9 ,{k7,9}k7 ,{k7,9}k9 Suppose now an adversary compromises user u9.It is of course true that the adversary is always able to obtain the current group key k1-7,9, no matter how the group rekeying scheme works.

the adversary who has recorded the network tra.c is also able to obtain the group key k1-9, because it can decrypt the message incurred by the event that u9 joins the group s.{u9} : {k1-9,k789} k9 .


Unfortunately, there are no crisp rules for deciding here.

clearly sometimes it does indeed matter.


That policy applies to a multihop network with a stochastic packet arrival process and is guaranteed to stabilize the network whenever the arrival rates are within the stability region (i.e., it provides 100% throughput).

algorithms based on [8] require the solution of a global optimization problem.


Additionally, new problems arise due to the high dynamics, maintaining system integrity [11] and security [3] becomes more di.cult.

randomized propagation protocols may prove to be more appropriate in such settings since they require a minimum amount of network knowledge.


The TPA congestion control mechanism is window-based as in TCP.

in TPA the maximum congestion window size (cwndmax) is very small (in the order of 2-3 TPA segments) and, hence, the maximum and minimum values are very close.


2 we show how the convergence time can be linearly reduced in a route withdrawal experiment with di.erent percentages of SDN deployment in a 16-node clique.

route fail-over and announcement experiments did not show this linear improvement, but smaller reductions.


To save implementation effort, we do not include other techniques to reduce range expansion [6].

our comparisons are fair because all TCAM schemes would bene.t similarly from the techniques.


Until recently, the most common deployed scenario in the Internet was end-hosts implementing TCP-Reno loss recovery and FIFO drop-tail bu.er management.In this situation, sel.sh behavior does not result in ine.cient network behavior.7 In fact, the e.ciency of the Nash equilibrium in this case is close to the socially optimal (but the bandwidth allocation can be unfair).However, in our attempts to improve TCP s loss recovery schemes, we have increased our vulnerability to aggressive TCP behavior.

tCP-SACK loss recovery, which is being increasingly employed by the end-hosts of today [12], allows .ows to more gracefully recover from losses.This greatly reduces the penalties for aggressive congestion control and makes the Nash equilibrium of the TCP Game quite ine.cient.In addition, RED active queue management is seen as important improvement over drop-tail.by removing drop-tail s penchant for dropping bursts of packets, RED is more friendly to aggressive .ows.This results in ine.cient equilibria of the TCP Game (regardless of what form of loss recovery the end-points use).


If it is too big, switching is aggressive and nodes may oscillate among channels, moving back and forth excessively and causing overhead.

if it is too small, it will take longer for the network to re-con.gure to new channels upon load changes.


Some of them such as the IP address validity may be dependent on the information inherited from the Access Router.

some others exclusively concern the gateway operation.


This is a valid question that should be answered and appropriate remedies taken prior to system deployment.

it does not require a change to the privacy policy.


4.3 Polymorphic Shape So far, we discussed defences against censors aiming to analyse packet payload or conduct active attacks to reveal ScrambleSuit s presence.

a censor could make use of tra.c analysis, i.e., analyse communication aspects other than the payload.


To make this path available, mutual route redistribution should be enabled between OSPF and RIP at the border routers B and A, respectively.

route redistribution at multiple points can easily result in routing anomalies [8].


It favors high quality links over poor ones by selecting higher random forwarding probability.

it does not account for resource conservation and catering to multiple .ows.


proposed splitting large packets into several smaller portions that are routed independently by the NoC and reassembled at the output [16].

since an Ethernet frame must be sent with no intra-packet gaps, the latency of a packet becomes at least the latency of the portion that takes the longest to reach the output.


(AOB) that aims at similar performance objectives as Idle Sense.

their asymptotic results are inaccurate: (1 - P)N does not converge to 1 - NP when NP .. Moreover,AOB keeps the exponential backo.


For small numbers of su.ciently short-lived .ows, IEEE 802.11a o.ers superior performance; short .ows do indeed su.er from a more pronounced synchronization overhead.

as soon as there are more than 4 simultaneous .ows in the network, the ability of SSCH to spread transmissions across multiple channels leads to a higher total throughput than IEEE 802.11a in both the short and long .ow scenarios.


Consider a unit disk graph G =(V, E) which corresponds to the following set of n points in the plane:   ..k .f S = {r =(0.5, 1)}{ {(i/f, 2j)}} j=1 i=1 where n - 1= fk.The optimal k-clustering of G has exactly one cluster.

consider the BFS spanning tree T for G rooted at r. The order of the optimal k-clustering on T is f +1.


To this direction, Evolved - Multimedia Broadcast/Multicast Service (E-MBMS) that targets at the efficient delivery of multimedia data from a single source entity to multiple destinations, is envisaged to play an instrumental role during LTE standardization process.

both LTE and E-MBMS performance are limited by the base station s transmission power.


The average round-trip delay was consistently high (above 1 second) for three states Alaska, New Mexico, and Hawaii.

the RTT was consistently low (below 600 ms) also for three states Maine, New Hampshire, and Minnesota.


This means that each terminal, associated to a border BS, has to be authenticated and registered on both networks.

if a terminal is attached to a non border BS, then it may release its WA link, as it will probably not be handed over to the WA domain.


Our question then reduces to whether the network operates e.ciently at these Nash equilibria.

our .ndings are twofold.First, in more traditional environments where end-points use TCP Reno-style loss recovery and routers use drop-tail queues the Nash Equilibria are reasonably e.cient.when endpoints use more recent variations of TCP (e.g., SACK) and routers employ either RED or drop-tail queues, the Nash equilibria are very ine.cient.This suggests that the Internet of the past could remain stable in the face of greedy end-user behavior, but the Internet of today is vulnerable to such behavior.Second, we .nd that restoring the e.ciency of the Nash equilibria in these settings does not require heavyweight packet scheduling techniques (e.g., Fair Queuing) but instead can be done with a very simple stateless mechanism based on CHOKe [21].


Some systems, including some of our own, have added messages types to handle such information, and certainly the display of such information can have an impact on the scene graph.

we feel that the handling of such functionality is better-served by existing open protocols, XMPP (Jabber) in particular.


It employs opportunistic listening for each node to learn local state information and encoded packet broadcasting to improve the network throughput.

neither COPE nor its variants consider the space-time trade off in packet delivery and the dynamic availability of network coding opportunities at a network node due to different power values.


Strictly following the TCP specification, if the second SYN's se- quence number is inside the allowable window (which it will be if the SYNs arrive in order) then a RST should be generated, otherwise the remote host should respond with a tmre ACK (indicating the SYNs arrived out of or- der).

in practice, this portion of the TCP spec- ification: is poorly understood and the most common im- plementations always respond to a second SYN with a RST, allowing reordering to be inferred simply as shown in Figure 4.


These pieces of information are generally gathered with beacon packets or speci.c control messages.

due to topology changes or radio related problems, the local information of some nodes may be inconsistent (e.g.


Those two cross-layer mapping approaches utilize the advanced features of H.264 which is the precedence of video frames or data partitions.

they cannot properly handle the delayed video packets because an AC with higher priority can be swamped with more important video frames or partitions in a congested network.


However, if there happens to be no node near the boundary the minimum delay of relays will increase greatly.

discrete (slotted) delay like LDMA [10] gives enough time separation between nodes in different spatial slots, but they do not distinguish nodes in the same slot.


The system architecture of these devices are of signi.cant importance for network performance.

so far there is no comprehensive method for network system evaluation.


This is re.ected in the pre-.ltered version of the skewness which has a considerably better correlation than the un.ltered version.

the median of the ToF is much more robust to this device-related noise and therefore outperforms the skewness.


4.2.2 Data-Plane Cloning The control-plane migration described above could be extended to migrate the data plane, i.e., copy all data-plane states over to the new physical node.


Instead of localizing all non-localized nodes, RLS only localizes source nodes, which makes it absolutely different from other localization schemes.

good performance of RLS also depends on time synchronization between sensor nodes and anchor nodes.


Diffserv aims to achieve scalability by "aggregating traffic classification state" through "IP-layer packet marking" [3], and it can be implemented on a very modest scale, perhaps "at a single bottleneck" [8].

such minimalism is a far cry from the Grand Unified style of QoS exemplified by Integrated Services, and it also presents fewer operational risks.6 it is doubtful that minimalist Diffserv can provide the rich service model envisioned by most QoS advocates and architects.


The prune message tears down the branches that no longer lead to the MN s. 4.3.Smooth Handoff In general, at any point in time, the MN should accept packets from only one location.

during transient movement, the 4 By location, we mean a new point of attachment that leads to change in the first hop router.


Therefore, to avoid the data traffic from exceeding the capacity limit of a cellular base station (BS), cellular operators have been trying to install cellular femto cells (local BSs) or wireless LAN access points (APs) in restaurants, cafes, user s houses, etc., to divert data traffic from the cellular radio access link to the fixedline such as x-DSL and FTTH.

the traffic levels extremely change in a day, even locally, due to the mobility of users.


Scalable Reliable Multicast (SRM) is a protocol [6] implementing the repair by any receiver concept, which is similar in spirit to our PAR protocol.

there are major di.erences between SRM and PAR.


For instance, for the subcarrier set from the experiment in Section 7.2.1, if we put a known data value on subcarrier 10, the resulting constellation diagram under 25% clock rate will degenerate to 8-QAM instead of 16-QAM.

using more subcarriers will reduce the effective data throughput.


However, the additive methods can not properly track the network status in the case of high tra.c load [20].

multiplicative methods, such as Q+-Algorithm [13], are more e.cient and can quickly track the network status.


Actually, it is not dif.cult to show that when the capacity of each link decreases, the difference between r * and r 0 will drop accordingly.

this does not a*T * a* necessarily means that µ ( r - r 0) will also drop, since µ may increase with the decrease of capacities3.


In the design of ETXOP, we define for each Access Class i a TXOPlimit value.

unlike EDCA that defines a static TXOPlimit s value, we provide for each station the mean to compute at runtime the TXOPlimit value.


Many other techniques for ef.cient broadcast communication in wireless sensor networks and in wireless ad hoc networks have been studied (e.g., [7,19,19,21,24,25]).

in contrast to these techniques, a node in DW-MAC wakes up on demand during a Sleep period; scheduling frames during the Data period explicitly coordinate nodes when to wake up during the Sleep period to transmit or receive a packet.


In OFDMA cellular networks, intra-cell interference within a single cell is mostly eliminated due to the orthogonality of subcarriers.

serious inter-cell interference (ICI) occurs when the frequency reuse factor equals to one, resulting in reducing system capacity, and substantially degrading the performance of cell edge users (CEUs).


We noted that energy consumption was high when transmitting data.

if we consider the ratio energy per bit transmitted, then the BTnode exhibits rather good performances.


Ideally, the Di can be chosen by considering the network topology to avoid collisions.

in practice, individual marker lacks the global topology information.


physical-layer propagation [11, 19, 20].

ray-tracing requires highly detailed information about the environment, such as building materials and thickness, to achieve high accuracy in outdoor environments.


SampleRate implementation uses EWMA with a factor of 0.05, which implies that roughly only the recent 50 samples carry major weights in the estimation.

the rate change actions in both algorithms are quite di.erent.


delay background traf.c, saving energy, and of.oading data under the assumption that WiFi is faster than cellular or WiFi is more energy-ef.cient than cellular .

increasing cellular speeds are fast invalidating these assumptions and make the problem of network selection more challenging.


In another example, we installed our second generation doorway sensors into a house and con.rmed that the system was working properly: all sensors responded with accurate height measurements and very little noise.

immediately after the deployment far fewer people were in the house and noise levels skyrocketed due to an increase in ultrasonic multipath echoes.


For any user, a certain number of SCs must be allocated to it in order to meet its minimum sSINR requirement.

since there is no Based on the SC ranking in the sector where it is located, each unqualified PU in turn chooses vacant SCs to achieve its minimum sSINR.


When the reporting timer expires, the first-hand reputation information FRij about node j from node i is updated as follows: FRij = v· FRij_old + (1- v)·FRij_new where v is a weight value.

during inactivity periods, we periodically decay the value as follows: FRij = v· FRij_old + (1- v)·FR_initial.


Forexample,thereismuch interestinuseof wirelessandmobile sensor/actuator networks and such edge networks that may not use IP.

anIdenti.er value could be used in sensor/actuator devices, especiallyone formedintheIEEEEUI-64 syntax,inorder to allow state to be maintained across network realms.


They offer higher data rates and consume lower energy per MB transfer.

they cost extra, usually significant, power to stay connected and incur significant energy and time overheads for connection establishment.


As a result, we can conclude that Preregistration depends on the accuracy of the movement detection mechanism and in this case less packets experience a higher degradation of the R-factor.

post-registration depends on the MN s location and more packets experience a lower degradation.


Using the coupling technique based on the Knuth s algorithm [27], we can easily infer that  2 ' 2 Pr{YR >.2r }= Pr{Y >.2r }.


That is, all tra.c generated by theuserwhen outsidecoverage of aWi-Fi accesspoint(or a femtocell) is sent to the network of the MNO as usual.

tra.c is fully o.oaded when under the coverage of the access point.


The results from the figure show that the advantage of our algorithm is significant as it requires a fixed number of message-passing steps in the all network sizes and it is able to fully utilise the multiple- port facility of the system.

figure 5 confirms the fact that the RD performance is highly dependent on the network size.


When the sending rate is close to the bottleneck link bandwidth, wi will incline to zero.

the host does not know the exact value of the bottleneck link bandwidth, so it must estimate the bandwidth by using the current sending rate and link price.