On the one hand, this allows vehicles to broadcast safety-relevant messages, like hazardous road condition or emergency break event warnings.

v2X communication enables the provision of services to V2X participants.


In most cases, this input is sufficient because the neural network is able to learn the pattern of a time series by appropriately unfolding the time series in temporal dimension.

in theory, if a dominant affecting factor of the time series can be identified and measured, adding that affecting factor as an extra input can help with catching the dynamics of the time series.


In an open scenario such as Internet, the threat to the security is much larger, therefore protection and careful stewardship of multimedia just like any other user data is required.

video systems are exposed to variable transmission conditions, and heterogeneous networks and devices.


Operations of UGS algorithm  The ertPS algorithm is designed to support real-time services that generate variable size data packets on a periodic basis, such as VoIP services with silence suppression [7][8][11].

when the transmission data is of variable bit rate and without any period basis, the ertPS algorithm will not work well.


Without consideration of cost, each ISP can allocate traf.c up to its link capacity, i.e., a link s pseudo capacity is its raw capacity.

since our goal is to optimize performance under cost constraints, we apply the algorithms described in Section 4, which impose constraints on how much traf.c each link can carry.


9, the nodal degree of the network topology obtained from models neglecting .ows interaction is characterized by a very regular, single-peaked PDF (marked as I).

models which assume traf.c light-managed crossways produce almost overlapping PDFs (III), which are more spread and present two local maxima, instead of one.


Under the hypothesis H0 the transmitter is Alice and Bob accepts the message if a chosen test statistic .

is below a given threshold .. under the hypothesis H1 the transmitter is Eve and Bob refuses the message if .


We consistently .nd that location change does not make distinguishable difference in SINR threshold.

all our experiments have been carried out in an of.ce environment.


In a traditional wireless network, increasing spatial reuse by allowing more concurrent transmissions always helps with the network throughput[1], which means traditional transmission power control schemes always try to find minimal transmission powers (if existing) for them so that receivers SINR(signal to interference and noise ratio) requirements were all satisfied.

in a network coding enabled wireless network, there might be a counter effect to arbitrarily increasing the level of spatial reuse.


We evaluated CHOKe and BLUE on NS-2 on various single and multi bottleneck topologies with different degrees of .ow multiplexing.

we will only present the results for multi-bottleneck scenario.


Thus distinct keys that have common suf.xes will be more likely to collide than keys with distinct suf.xes.

in the particular case of IP addresses, this is not a problem.


It is known that all these tools take a long time to converge to an estimate, which is not an issue for static networks.

in a high mobility scenario such as ours, quick convergence is essential.


As explained earlier, this was necessary to avoid link saturation during the host enumeration.

spanning our measures over several weeks has an impact on the picture of the internet we are seeing.


In operation, preventing devices from leaking personal information requires the consumption of additional resources of the devices, which would be undesirable.

we expect users to relax their privacy concerns in the aftermath of a catastrophe.


In this scenario, previous work [3, 4] has mainly focused on the de.nition of a time-division scheduler to assign the percentage of connection to each AP.

little attention has been given by the literature to solutions with .ne-grained timing.


For each vantage point, we extract a list of pre.xes from the BGP routing table of the (single) border router that connects this site to the Internet.

some pre.xes are never used to route traf.c because of more speci.c subnets in the routing table.


The minimum energy load path may differ from the shortest path.

it does consider not only energy load but also distance.


From the user interactions perspective, our insights are the following: (i) The probability to meet di.erent people with the same cyberinterestsisdominantlyimpactedby the numberof userssharing thesameinterestsin agiven region.

(ii)the frequency with which one meets with others who share the same cyber interests is dominated by the density of hotspots in a given area.


Previous approaches [3, 25] that do not rely on infrastructure for location and identity privacy have proposed to use pseudorandom or disposable identi.ers for all layers of the protocol stack.

in these approaches the identi.er spaces are shared by the applications, and therefore the tra.c can be linked to the host by observing the applications.


Since we do not keep per-.ow state, all of our results are estimates.

we prove analytically and show through experiments on traces that our estimates are close to the actual values.


Replication is a promising means to preserve information that is relatively static, such as news articles.

there are several reasons why replication is not always an ideal solution.


By checking which Bloom .lter theaddressesmatch,weperform the entire address lookup within the fast memory for all the packets.

previous work [6] uses Bloom .lters to assist packet lookup and every address lookup still has to access the slow memory at least once.


We see that SWAN well approximates maxmin fair sharing.

the greedy, local allocation of MPLS TE is signi.cantly unfair.


In fact, DSR achieves very low delivery rates, about 20%, regardless of the motion rate of the users.

zRP delivers more than 50% of the messages for low rates of motion (e.g.


We note here, however, the 3% is an upper bound of our spammer detection false positive rate because the existing spam .lter might miss spam emails.

there is a much smaller fraction of sessions from the likely static IP addresses with a high spam ratio: 31.4% of the sessions sent only spam, and 62.8% of the sessions had spam ratio lower than 90%.


The control and management overhead, indicated by the denser area in the .gure, increases signi.cantly as the number of simultaneous users increases from 1 to 40.

as the number of simultaneous users further increases from 40 to 80, the data throughput decreases, while the control and management overhead does not decrease as signi.cantly.


For larger populations of passive tags, there are more collisions in slots which impacts goodput of burst CRFIDs.

we see that despite a relatively large passive tag population, CRFIDs continue to perform well while bursting.


In [25], an earlier solution for building a security-enhanced .rewall application was introduced.

this solution only focuses on addressing bypass threats in OpenFlow-based networks.


15, we .nd that for tra.c loads of up to 30 web-emulated users per mesh node (approximately 1 Mbps aggregate throughput) the mesh nodes maintain fairness between one another.

as the number of users increases beyond this point, nodes closer to the gateway take an increasingly larger share of the available bandwidth from their downstream neighbors.


3) The approach requires that each data packet carries original sending-rate information.

the extra information in IP header will consume the scarce bandwidth of WMN.


However, the adversary KDV QR LGHD DERXW ZKHUH WKH XVHU¶V exact location is )URP WKLV SRLQW SULYDF RI XVHU¶V ORFDWLRQ LV increased by using spatial cloaking.

in case that there is only one user in that region or area; the local server can easily perform detecting and tracking of that user automatically.


For this reason, energy consideration has dominated most of the research at MAC layer level in wireless sensor networks [6].

the increasing interest in real time applications of sensor networks has posed additional challenges on protocol design.


If they found a missing AS hop (E in X-E-F in .gure 3c) they added E to the traceroute-inferred path.

they do not adjust IP-AS mappings or assign owners to routers.


A similar frequency allocation and scheduling method also works for other types of communication patterns, such as broadcast (disseminating commands from the sink to the network) and aggregation (each relay node may send out less data then it receives).

we focus only on data collection in our paper.


[1]advocatedtheuseofasymmetricTxantennaspacing(insteadofinternalphaseshifter)togeneratetherequiredphase shiftof p betweenthetransmitsignalsowingtoitsabilityto cause less destructive interference in the far .eld.

the simulations used to highlight this observation relied on a free space path loss model for the far .eld which does not holdinreality(seeexperimentsinSection4).


But as the target gets close to G, G will replace B as the most informative sensor in A s neighborhood, and the path will extend to G via ACDG.


As shown in Table 1, for the raw data sending without concatenation, the packet loss ratio reaches 60% and the average time to send a message from the aggregator is 36.16 milliseconds.

with concatenation, the packet loss is reduced to 42% and the average time to send a message from the aggregator is reduced to 27.13 milliseconds.


By setting a low CCA threshold like -95 dBm, the reliability under low channel load can be signi.cantly increased.

when doing so the medium access delay rises and results in a high number of packet drops under high load.


In fact, if too many nanobots di.erentiate it is di.cult to reach and destruct the tumor.

if the number of guideposts is too low, the colony is not able to arrange.


2.3 Path Selection Solutions such as ECMP or multiple VLANs provide the basis for randomized load balancing as the default path selection mechanism.

as others [2] have shown, randomized load balancing cannot achieve the full bisectional bandwidth in most topologies, nor is it especially fair.


Directional communication has been extensively studied and deployed for base stations, access points, moving vehicles, and even sensor nodes.

no one has studied or deployed direc-tional communication to mobile devices such as smartphones that can not only move but can also rotate.


Gossib attack appears severe to PPM traceback, for a diligent attacker can forge as many packet marks as the amount of tra.c it transmits, in comparison to a PPM marker who performs the marking routine at around 1/20 of the time.

routers can co-operate to proactively identify and .lter forged packet marks, using an approach inspired by route-based distributed packet .ltering (DPF) [13].


4.2.3 Optimal Storage Allocation Algorithm We note that obtaining an optimal solution from the de.ned problem of Submodular Function Maximization under multiple linear constraints is hard.

we can obtain a stronger result in the case of homogeneous contact rates, homogeneous item length and bu.er size.


Given su.cient ground clearance (> 30m), the signal can travel upto 20km.

this requires setting up a high rise tower which can increase the overall infrastructure cost.


Most sensor networks must remain connected, i.e., the active nodes should not be partitioned in any configured schedule of node duty cycles.

single connectivity is not sufficient for many sensor networks because a single failure could disconnect the network.


4.4 Revisiting AS Rankings Geographic hot-spots are insightful in that they re.ect where large chunks of the hosting infrastructures are.

theyprovide little insight to understand how content is delivered to Internet users.


Clearly, with more senders, the performance of CoopMAC gradually decreases due to more contention.

cCMAC gives a di.erent trend: with more senders, it may even achieve better performance.


Far more enterprise networks than carrier networks are in operation today and their designs are highly customized to the needs of individual companies, universities, government agencies, or other types of organizations.

despite the complexity, prevalence, and diversity, enterprise networks have received little attention from the research community.


With the right choice of parameters, the perform~n_ces gap between our optimal admission-control policy and NAG decreases.

with the wrong choice, the opposite is true.


Collection of prizes from the network maximizes the data aggregation from those areas in which data delivery is more important.

the nodes located in less important area should wait for an AUV to collect data.


In case where sequence transfers are required such as streaming data due to increase in multimedia system popularization, it selected the highest value of 'Route Effective Time' field in the routing table for stable route.

if it requires small but fast data transfer, it can be done using the lowest value of 'hopcount' field in the routing table.


[20] the backbone is obtained as a connected dominating set of the communication graph, by applying techniques from geometric radio networks.

this result holds only for a restricted family of networks and the analysis requires that stations cannot receive signals from distance larger than 1 - e, i.e., their model assumes weak devices, and it is known that the power of that model is different than considered in our work (c.f., [15]) [7] M. Ghaffari, B. Haeupler, and M. Khabbazian.


For evaluating PLTS, we focus mainly on fat-tree [1] architecture.

the results shown should hold good in many topologies with multiple equal-cost paths between end hosts.


It compares the direct trust value of all next hops in this path and selects the one with the highest trust value.

the network overhead is increased because of the indirect information used in trust calculation, as it uses more control packets for advertising trust, calculating observed trust and issuing certificates in the trust calculation.


Furthermore, bias could be introduced by clients that use ad-blockers, which prevent the execution of ads.

it is unclear what percentage of clients use adblockers and whether their use is correlated with IPv6 capability.


Second, comparing the results for paths computed by the shortest widest routing (Table 1) with those computed by path selection (Table 2), we can see that when the number of machines is small (128 machines with 32 and 64 switches), the paths computed by the shortest widest scheme requires less LIDs to realize than the paths computed by the path selection scheme assuming the same LID assignment heuristic.

when the number of machines is larger (256 and 512), the paths computed from the shortest-widest scheme requires more LIDs.


Indeed, it is possible that interception may be happening undetected, on a regular basis, on the Internet today!

despite all the incidents and subsequent work in the research community, an actual quanti.cation of the impact of pre.x hijacks on the Internet is sorely missing.


Therefore, congestion control algorithms that deviate from these design goals (e.g., cost-or energy-aware congestion controllers) may circumvent this attack.

violations of these goals (e.g., do no harm) may degrade the performance of single-path TCP .ows.


This is because in JANUS, the number of ad-hoc messages is dominated by the periodic beaconing of the parent host in the routing tree.

for dense networks, UCAN needs to contact many hosts in order to update broken paths (up to 200 hosts per broken path for a network of 500 hosts).


Multithreading and SMT are e.ective methods for multiple processing tasks to share a single processing resource.

in the context of packet processing for virtualized networks, there are several signi.cant shortcomings in the current approach to multithreading.


Moreover, they have studied the performance of MPTCP through analysis, by simulations, or by measurement in environments where all the tra.c is well controlled.

we study the performance of MPTCP in the wild, with real wireless settings and background tra.c, and focuses on .nite size data objects that better represent real world tra.c.


IMPROVING COMMUNICATIONS WITH SLEEPING INTERNET OF THINGS DE-VICES Traditional wireless sensor networks are not usually expected to receive tra.c from Internet devices.

the Internet of Things has the expectation of the same bidirectional communication capabilities that also exist on the non constrained Internet.


In the context of WLANs, multiple early e.orts emulated these wired approaches by deploying similar monitoring nodes in the wired part of the network [2].

wired-only observations fail to capture the impact of location-speci.c RF characteristics.


As we describe in more detail in Section 2, previous efforts to analyze routing dynamics have typically con.ated these two tasks by assuming that noise in routing data always implies the existence of a network disruption and applying inference techniques to groups of routing messages to help localize failure causes.

we address these two problems separately.


3.1 Planned Maintenance Planned maintenance is a hidden fact of life in every network.

the state-of-the-art practices are still unsatisfactory.


Severalproposals made adeep study ofP/S architectures for .xed networks[4,15].

theuseof thisparadigm in mobile adhoc networks(MANETs) o.ers many new challenges, manly due to the highly dynamic topology and the scarce resources.


The path is re-computed after execution of each service in the sequence as the network topology can change in that duration to provide alternate paths that are more feasible.

one may choose to follow the same path computed at the service requestor if the network topology does not change very fast.


The topology for TB-20 is more compact than TB-60.

the larger and more variable ambient noise in TB-20 makes it more dif.cult to accurately predict the outcome of a transmission than in the TB-60 testbed.


DISCOVERY OF SECURITY POLICIES So far our discussion has been focused on the discovery of roaming information, which is the most critical information needed by an MT for a decision on network selection.

as the industry continue to mature, there may be other needs to be addressed.


Yi and others [18] quanti.ed the notion of trust and explicitly incorporated the integrated security metric in the routing protocol.

their assumption of the a priori trust hierarchy obtained by mirroring the organizational hierarchy might not hold in a generic ad hoc network.


The idea is that when the probing rate is below the available bandwidth, probe packets should emerge at the receiver with the same probing rate.

once the probing rate exceeds the available bandwidth, the gap between packets will be stretched due to queuing and congestion, resulting in a lower output probing rate.


The ultimate advantage of the millimeter-wave communication is its capability to support multi-Gbps throughput since the abundant bandwidth can be secured in the unlicensed 60GHz band [3].

due to the high propagation loss in 60GHz channel, the beamforming technique is essentially required to increase the transmission range and the system throughput.


Therefore, we say that AS3246 is a direct-responsive AS.

aS13284, AS8262, and AS24796 (Figures 5(b) and (c)) do not change their next-hop ASes; therefore, their switch to the NL (AS16150) is likely the result of a path change of their upstream ASes.


Hence all the false links AD, BD and CD will be veri.ed.

the applicability and e.ectiveness of this attacks are limited.


In particular, the congestion window of NewReno and Cubic are kept open due to the absence of losses.

the latency sensitive Vegas injects background tra.c at a lower rate, thus the completion times are shorter.


Additional losses can be detected subsequently and repaired with SACK-based fast recovery.

in practice sending a single byte of data turned out to be problematic to implement in Linux TCP.


Variable-striding and compression-based schemes can help reduce total memory size by eliminating such redundant replication.

for the worst-case distribution shown in Figure 4, the top half (triangular region) of the trie has no redundant replication whatsoever, and the bottom half (rectangular region) uses up space because of the large number of nodes and not because of in.ated node sizes.


Optimizing the TCP connection to restart after one second ensures that soon after an invalid ARP entry is timed out, another ARP will be generated.

this or the response to it can also be lost, which can yield even longer startup delays.


Figure 5: E.ective Aggregation of Trees deed aggregate.

in order to meaningfully analyze the scalability of the scheme, and also evaluate the feasibility of descriptor-based routing, we must populate the FIBs with plausible sets of descriptors.


As a concrete example, the operating system should automatically remove data such as names and social security numbers, in addition to meta-data and para-data such as the author s username from sensitive Word documents.

in our approach, we are concerned with identifying information on all layers of the protocol stack that could compromise the identity and location privacy of the user.


Another possible solution is to send as large PDU as the size of one slot.

such an approach may be unacceptable due to the increased MAC overhead and very small slot size of robust MCSs.


We also see that the latency scales well with the increase in the number of nodes because of the same reason.

in 13As an approximation of a circle for simplicity.


Since the focus of the paper is on the integration of different energy-efficient techniques, we draw the line for further discussions on them.

a better prediction technique is still complementary to our framework.


4.3 Practical Experiences We argue that VIPE s primary bene.t is to signi.cantly reduce the development e.ort of protocol and network experimentation.

this claim is not as easily quanti.able in numbers as performance results or lines of code.


Predictingbasedonmorehistory can be bene.cial because it will better capture temporal variations.

the more history needed, the longer a handset willhaveto waitto make accuratepredictions after initiating activity.


Several self-healing approaches exist for ad hoc and sensor networks, such as [6] and [5].

these frameworks are not well suited to sensor networks because they generate too much traf.c or require too much memory to gather information from seven protocol layers.


However,since a Huffman hash tree is hard to adjust once being constructed,the checking scheme cannot handle repository update ef.ciently.In contrast, FastAuth, as a one-time signature scheme, inherentlyrequires a new hash tree for every beacon and thus is free fromsuch a limitation Also, invalid signature noti.cation [22], an ideasimilar to the pushback warnings in SelAuth, has been proposedto help identify invalid but unveri.ed messages.

withoutteamingwithSelAuth sforwarderidenti.cationmechanism, theattacker can abuse such noti.cations to cause denial of service.


Similarly, under uniform tra.c, there is no obvious di.erence between LEF Routing and dimension order routings.

figure 11(b) shows that LEF Routing can perform better than any other routings under hotspot tra.c.


The previous zk is deleted from Z and is no longer considered a likely outlier.

if xi is not a likely outlier compared to all outliers in Z, then xi is not considered and Z remains unchanged.


Cooperative sensing [7, 18, 13] is therefore developed to recent good attention in research.

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.To copyotherwise, to republish, to post on servers or to redistribute to lists, requires prior speci.c permission and/or a fee.


Since Kelly controls are unstable unless condition (3) is satis.ed [9], a natural strategy to maintain stability is for each end-user i to adaptively adjusts its gain parameter .i ~ 1/Di such that (3) is not violated.

this method depends on reliable estimation of round-trip delays Di and leads to unfairness between the .ows with di.erent RTTs.


A complementary approach, more operator oriented, for minimizing the transmission power of cellular networks as well as increasing the network capacity, consists in a dramatic densi.cation of micro-cells coverage [27].

increasing the number of micro-cells multiplies the energy consumed by the cells whatever their state, idle, transmitting or receiving, which is a major and growing part of the access network energy consumption [28].


slightly increase with the number of concurrent streams, as the traf- Packets dropped (%) 80 60 40 20 0 Libnids Snort Scap Scap with packets Patterns Matched (%) 0 20 40 60 80 Libnids Snort Scap Scap with packets Streams lost (%) 0 20 40 60 80 Libnids Snort Scap Scap with packets .c rate remains constant.

snort and Libnids cannot handle more than one million concurrent streams, even though they can handle 1 Gbit/s traf.c with less than 60% CPU utiliza tion.


On the one hand, they prove that there are con.gurations requiring O(n) colors when using either uniform or linear power assignments.

they show that O(log4 n) colors are su.cient to ensure strong connectivity when choosing the right power assignment.


For accurate results, the best method to reproduce the target problems might be the latter one.

in many cases, it is dif.cult to create a realistic environment for reproducing trouble situations, and the former method is useful for avoiding these kinds of dif.culties.


There was no concept of enabling a User to access di.erent services over a common Access layer, as is possible with the Internet.

with the advent of VoIP, the di.erence between Internet and Telecom-based services is fast blurring, as the Internet becomes a carrier for all kinds of services; Telecom being just one of them.


We can find that two connections established by using the standard strategy force the MS to listen to channel for 449 time frames.

the proposed PMS only needs 389 time frames.


It is important to remark that in our simulations we have chosen concrete parameter values.

operators and users are free to set these values according to their own needs, based on the characteristics of the targeted network.


If all circuits had similar tra.c patterns, this would be ideal.

in reality, there is a great deal of disparity between the tra.c patterns of di.erent circuits.


Apparent AS loops: BGP has a loop-detection mechanism where a router discards a route when its own AS number appears in the AS path.

apparent AS-level loops can arise if a router is (mis)con.gured to prepend an arbitrary AS number that already appears elsewhere in the AS path.


The lower the period is, the more beacons are transmitted and the higher the energy consumption is.

when the beacon period is high, the energy conservation is increased as less energy is consumed in beacon transmissions.


Thus these policies have the same .rst order behavior as the MaxWeight policies.

for multihop networks some of these generalized polices address a number of critical weakness of the MaxWeight/BackPressure policies.


The scheme requires more memory than Yoking proof and Grouping proof .

the mechanism for reader authentication has not been defined in this protocol.


It has good connectivity to the whitespaces base station with more than 70% of the path in line-of-sight to the base station s antenna.

the segment B represents a worse coverage scenario, with more than 60% of the path blocked by several tall buildings.


A prefix associated with an exchange point is directly reachable from all the ASes at the exchange point and each AS at the exchange point might advertise the prefix as if it comes directly from that AS.

exchange point prefixes make up a small percentage of the MOAS conflicts observed in this study.


layer retransmissions, and a cellular uplink, the achieved downlink TCP throughput can be quite low (about 40 Kbps).

our alternative design is able to provide a performance more than two orders of magnitude better in many cases.


For hijacking the target pre.x s tra.c from a given site, we simply advertised the pre.x through all the four other sites.

for interception, the tra.c ought to be routed back to the owner.


This allows the AP to advertise the presence of buffered packets selectively to one or a small number of PSM clients without increasing latency.

one issue with this simple approach is that all clients will have to wake up for every beacon to see if the beacon has the TIM bit set for it.


This requirement translates into a very large bu.er requirement for Internet cases [4].

we will show that this requirement makes sense for data center networks and most commodity switches have the capacity to support it.


In our data, we observe that only 0.42% of all UDP fragments lacked a UDP checksum.

25.5% of all hosts sending fragmented traffic sent UDP packets without checksums.


Message delivery mechanisms in DTN require node collaboration.

in real deployment some nodes may refuseto cooperate.


In the case of Google we uncover a much smaller number of servers.

by using the de-aggregated pre.x set of the ISP (i.e., ISP24), we are able to expand the coverage from 200 to more than 500 server IPs.


For example, when an MPLS header is inserted into an IP packet, the 20-bit label, 3-bit experimental .eld and 1-bit stack .eld are .ow-speci.c.

the 8-bit TTL may vary packet-by-packet, as it is equal to IPv4 TTL minus one.


4)Routing using link-by-link acknowledgement, opportunistic: This scheme is similar to (3).

all the nodes eavesdrop on the packets of nodes farther downstream.


To increase the coding opportunity, [20] suggests two strategies, both of which in essence spread data packets from a single node out into the network.

these strategies require that the network diameter is relatively large, whereas in our scenarios, the vast majority of nodes are less than three hops away from each other, severely limiting the benefit of either of the proposed strategies.


Sometimes, a SU can pay the permission fees to a PU in some situations.

recent CRN studies suggest the existence of spectrum brokers or secondary AP (SAP) to describe the interface between the traditional spectrum licensees (PUs) and the SUs.


Therefore, at the zone level GMZRP looks like source routing.

at the node granularity, the source or an intermediate forwarding node only keeps the information of its child nodes.


Optimal .ow scheduling: The optimal algorithm for minimizing average FCT when scheduling over a single link is the Shortest Remaining Processing Time (SRPT) policy which always schedules the .ow that has the least work remaining.

we are not scheduling over a single link but rather over an entire fabricwith aset of links connecting the ingress and egress queues.


It should be enough as variance is in the order of 10-9 s 2 .

the random e.ects in timestamping may be a problem.


Simulation of multiple lanes and synchronization at tra.c signals only marginally impact VANET performance.

modeling of multiple lanes might be fundamental to applications such as Forward Collision Warning and Lane Change Assistance systems, which we do not consider.


Note that even if the router determines that it can deliver the Data packet at the Interest time, the Data packet can still be late, because the upstream round-trip time is not known.

this mechanism provides a best-effort way to predictively reduce congestion at the time of receiving the Interest packet.


One of the biggest challenges in WSNs is energy e.ciency in which the network lifetime needs to be as long as possible.

as radio modules have been identi.ed as major energy consumers [4], the largest energy conservation can be achieved in the MAC layer.


The finite-power phase noise effects were analyzed in [9].

if the system is only frequency-locked, the resulting phase noise is slowly varying but not limited, and it is modeled as a zero-mean, non- stationary, infinite-power Wiener process [7].


Extending the Reach of Infrastructure by Utilizing Node Mobility Yu Zhen, Xu Jingdong, Wu Ying Department of Computer Science Nankai University Tianjin 300071, China yuzhen@mail.nankai.edu.cn, {xujd, wuying}@nankai.edu.cn ABSTRACT With the advantage of high bandwidth and low cost, WLAN is widely regarded as an appealing technology for wireless access.

wLAN only provides very limited coverage which is no more than hundreds of meters, making users experience intermittent connectivity when they move near Wi-Fi access points (AP).


For one, the corridors are lined with solid metal lockers perturbing most radio communication.

this Node id Figure 7: Average radio duty cycle of each node including RMS errors.


Smaller remaining battery capacity nodes are avoided and ones with larger battery capacity are favored when choosing a route.

the route is found using the equation P = min[max(1/ Battery _ Capacity )] MMBCR n R.Sn.R more overall energy will be consumed throughout the network since minimum total transmission power routes are no longer favored.


In this case, the above mentioned NS record for the domain is deleted from the zone.


GSLink advertisements will also be processed the same way as a GSTopology advertisement by extracting the GSLinkHeaders.

after all the GSLinkHeaders are updated in the topology table, the protocol will determine if the Dijkstra shortest-path algorithm should be run based on the changed link costs.


In traditional security research, there is a hypothesis that the attackers and the victims are reachable in the same homogeneous network.

for cross platform scenario the attackers can be from all kinds of network.


If the discrepancy d = |SB - SA| + |SA - SB | is known, then peer A can send a data collection of size only O(dlog u) bits, or if hashing is done as pre-processing, of size only O(dlog h) bits.

if d is not known, a reasonable upper bound on d must be determined through multiple rounds of communication.


strategy outperforms GP in terms of revenue.


They differ in that FatTree uses larger quantities of lower speed (1Gb/s) links between switches, whereas VL2 uses fewer faster (10Gb/s) links.

bCube[7] abandons the hierarchy in favor of a hypercube-like topology, using hosts themselves to relay traf.c (Fig.


Disaggregation brings greater modularity to datacenter infrastructure, allowing operators to optimize their deployments for improved ef.ciency and performance.

the key enabling or blocking factor for disaggregation will be the network since communication that was previously contained within a single server now traverses the datacenter fabric.


The basic component of our research goal, an in-network data mashup function, has already been realized since the XML router can also mashup data if needed.

there is another issue that needs to be resolved: namely, integration with a resource finding mechanism through the demand addressing mechanism constructed by Cassandra.


By enlarging the value of K from 2to50 orby reducing the value of a from 1 to 0.02, we can shift the TCP operational region to a lower loss region.

the modi.cation of aappears to be more e.ective.


The original security scheme in 802.11 is called WEP, for Wired Equivalent Privacy [15].

this scheme has been proven to be cryptographically weak [7, 9], so there has been an e.ort to de.ne a new and more secure scheme.


This comprehensive data set covers 16,439 BGP pre.xes, 121,567 /24 address blocks from 1,862 AS numbers.

dataSource1 does not differentiate the carrier for each record.


Indeed, the lingering index should tell apart nodes that are at similar distance from the target and travel in the same direction, but with different speeds.

the contribution of speed v builds on the following considerations: as d grows, the coef.cient in (6) tends to zero making h(v, ., d) less and less sensible to the speed, up to independence from v for d = R (as from the constant behavior of the dashed line in Fig.


The minimum memory size for a is 24 bytes but there is not an upper size, it may include an arbitrary number of actions.

the majority of policies are not expected to exceed about 50 bytes and we typically expect, at most, a few tens of policies in a mote.


For traditional multicores, software-pipelining based orchestration has been suggested for traditional memory-hierarchy based, as well as scratch pad memory based multicores [11, 14].

we remain focused on the hardware-pipelined version because software pipelining can be memory-inef.cient.


Local-policy based: BGP gives each AS signi.cant .exibility in deciding which routes to select and export.

the available routes depend on the composition of the local policies in the downstream ASes, limiting the control each AS has over path selection.


A parallelized loss-free move (LF PL) avoids drops by raising events.

the 410 packets contained in events may each incur up to 185ms of additional latency.


2The algorithm in [28] computes a maximal matching for each layer, and thus requires for each node to know which layer it belongs to, or equivalently to know w * .However, knowing the maximum weight w * may take O(|V |)timeto propagate in the worst case.

distGreedy works with local weight information and the layering structure is only for the purpose of analysis.


Some DCN operators may prefer to invest the price premium into higher bisection bandwidth instead of lower network latency.

for applications that require ultra low latency, our analysis shows that there is no cost-effective alternative that can realistically be deployed in a modern datacenter.


When two links are down, COPE has a higher performance ratio compared to the .rst two scenarios.

even then the performance is mostly within 30% of optimal.


Though there is no need carry the per-PDU CRC-32 .eld, there is the PDU sequence number (SN)extended subheader that occupies 4 bytes.1 It should be noted that the PDU SN is optional.

it is anticipated that it is turned on for most services.


This assumption becomes weaker as losses become heavier or 'becomes larger.

this inaccuracy typically will not affect the path switching decisions if the threshold of quality difference used for path switching is appropriately selected.


Figure 5 shows that in the case of FullMediaEngine the CPU gets overloaded already at 12 concurrent videos.

the other two media engines are able to stream 20 concurrent video sessions with around a 20% CPU utilization.


The current MIH function does not contain the nearby router information.

it may have the access point information around the MH.


Most wireless communication protocols allow the sensors to send at arbitrary times.

this can cause the following collision problems: If two distinct sensors A and B send at the same time and B is within the interference range of A, then frequently hardware limitations prevent B from receiving the message of A correctly.


The Ondemand policy solves the problems associated with the periodic policy by reducing the recon.guration rate in case of low mobility, and vice versa.

it also has the intrinsic overhead of sending requests for initiating recon.guration to all cameras.


We have also conducted experiments with a production (Cisco) access point supporting 802.11e mechanisms and Windows-based stations, equipped with the same Atheros 802.11a/b/g PCMCIA card.

to avoid potential in.uences from the di.erent wireless drivers, in the experiments we present in this paper we consider solely the Linux-based stations.


Therefore, a larger observation window results in better estimation on the time-varying channel and BEM coe.cients.

an underlying assumption made by BEM based algorithms is that the wireless channel s time-varying characteristic within one OFDM block is contributed by Doppler frequency only, while MPC distribution in each OFDM symbol is assumed to be static in the literature [7] [9] [11].


In such scenarios, if the additional level of suppression required is less than 25 dB, digital cancellation would su.ce.

if more cancellation is required, then estimation and compensation of the SI channel becomes necessary.


This result makes sense as the Traditional repeater only utilizes the non-shared channel for uplink, whereas Multifacet is able to utilize an higher capacity shared channel in addition to the non-shared channel for uplink.

multifacet-naive performs worse than Traditional repeater as round-robin scheduling of packets over two interfaces leads to unconstrained transmission by AP repeater on the shared link with repeater-client link.


In fact, broadcast mode has slightly better performance than WireGL when rendering to a 1x1 tiled display because it does not incur the overhead of state tracking and maintaining the bounding box.

as soon as we add a second display WireGL quickly overtakes the broadcast method due to its more ef.cient network usage.


Because routing protocols typically depend only on the current snapshot of the topology or routes, rather than the timing and ordering of previous messages, it is relatively easy to bootstrap the control-plane state by having each peer reannounce its current routing state.

each of these mechanisms only applies to a single routing protocol, leading to a cottage industry of point solutions for control-plane upgrades.


For extreme tails, we can also use an asymptotic model to overcome some of the instabilities of SA (due to a very small derivative, see Lemma 2).

we should be careful in choosing a such interpolation or approximation model since it may lead to biases in estimates.


If an UE requests the content in LTE environment, this requested packet is forwarded to P-GW and sent outside of LTE network.

for multiple requests of the same content by different UEs, the same request packet is repeatedly forwarded to P-GW.


Complex algorithms with non-negligible runtimes must be processed by resource-limited nodes, and therefore require in-depth knowledge of the temporal behavior of the software and hardware components.

state-ofthe-art simulators provide either accuracy or scalability and therefore somehow limit the development of such networks.


These switches may consume tremendous resources (CPU, memory, bandwidth, etc) to perform monitoring tasks.

some .ows may not be covered by these switches [21].


Hence at certain SNRs, the omniscient schemeis limitedby the choicesit has.

note that Strider is close to the omniscient scheme at every SNR, implyingthatevenifthe omniscient schemehad more choices, it could not have done better than Strider.


Objective: Severalworkshavelooked at thepractical realization of reuse[8],diversity[5], and multiplexing[3,6] strategies with afocus on static clients with stable channels.

thisisunderstandableasa .rst step.movingforward,giventheheterogeneity of userpro.lesthat a system must catertoinboth enterprises and outdoor cellular(e.g., small cellLTE,WiMAX) networks,itbecomesimportantto understand which strategies are appropriate for which user pro.les andhowtointelligentlycombinethem.


In sparse networks the shape of the MSTEAM multicast tree is highly in.uenced by the positions of the few nodes which are available.

when the network gets more and more dense the multicast tree constructed by MSTEAM will tend to some structure which only depends on the positions of multicast source and destinations.


lation might remove the requirement of dealing with the mixedinteger programming problem.

such an approach could miss opportunities for energy saving or push links to higher operating rates, asit might notbe able to carefully observe thediscrete powerlevels ofthe rate-adaptation capablehardware.


Ideally, one would store our measurement results in an entirely and automatically distributed fashion, as in a P2P system.

this information is dynamic, and is therefore best stored close to where it was measured.


Seamless Media Adaptation with Simultaneous Processing Some text in this electronic article is rendered in Type 3 or bitmapped fonts, and may display poorly on screen in Adobe Acrobat v. 4.0 and later.

printouts of this file are unaffected by this problem.


As a result, the energy consumed while waiting for slot allocation increases to indicate a consumption of more energy without successful allocation.

since EDGE has demonstrated higher allocation efficiency, as the demand for GTS slots increases, the coordination between the neighboring nodes starts to pay back, energy-wise, and EDGE outperforms the standard.


These families of ODCLs have overcome most of the limitations suffered by the existing distributed controllers, allowing distributed, multi-path, multi-CoS load balancing and/or rate adaptation for TE and FFR and large design space exploitation.

like the existing solutions, they are single-domain solutions.


This ensures that the reconstructed trajectory shape is still accurate.

if we pick the incorrect grating lobe, the entire trajectory might have shifted by tens of centimeters, but the shape .delity is still maintained.


The participants do not lead sedentary lifestyles; their activity patterns are in line with general health guidelines.

the generally recommended 30 minutes of physical activity per day correspond to only 9% of an 11-hour trace.


Thus, compared to the IDM, the distance from preceding vehicle is substituted by the distance to the point the vehicle has to stop at.

the speed difference is set to the current speed of the car vi(t), so that the stop sign is seen as a still obstacle.


One might argue that this should not be a reason to terminate the test immediately, especially for simpler tests like the ICW test, and for tests such as the Timewait test, where the data .ow itself is not of interest.

we decided to do so, because the sender TCP is not supposed to exceed the MSS value set by the receiver [2].


Unlike taxonomies, which over-impose a hierarchical categorisation of content, folksonomies empower users by enabling them to personally and freely create and choose the tags that best describe a piece of information (a picture, a blog entry, a video clip, etc.).

while being extremely easy to use, tags have often been criticized for lowering the e.cacy of matching [5].


This increases the chance that only one node chooses that channel.

when the number of simultaneous messages is small, i.e., the load is low, assigning small probabilities to the higher priority channels could lead to under-utilization of these channels and higher utilization on the lower priority channels resulting in collisions and an increase in the overall latency.


Neighbors with a depth that is smaller than D(x), especially those with large energy levels, are good candidates to be x s parent.

nodes that are members of the set children(x) receiving an O message from x, initiate a timer TO that is intended to allow x some time to .nd a parent.


The certi.cates found by scanning the Alexa Top 1 Million Domains provide one perspective on the CA ecosystem that is weighted towards frequently accessed websites.

many of the questions we address are dependent on a more comprehensive viewpoint.


without arealisticdeployment,itishard toperceive exactly whatkind ofinformation couldbeleaked.


To remedy this, additional mechanisms such as caching are critical.

as shown in [1], common techniques for DHTs, such as caching objects along lookup paths (path caching), fail to make a significant impact on the average performance of these systems.


In our example work.ow, one could design the target network topology using a visual graph editor and store it, along with its link attributes (like latency and bandwidth), in a .le; then, one could write a program to import the topology, iteratively fail selected subsets of nodes and compute paths, and then calculate statistics for those paths, noting any cases when endpoint pairs become disconnected (as a sign of failure susceptibility).

none of these libraries implement IP-routing algorithms.


Whereas, if higher throughput is preferred, higher values of k is chosen.

as explained earlier, as k value increases, the throughput increases without signi.cant decrease in the number of packets transmitted, till an optimal value is reached.


instead of trying to make a theoretical model of registration patterns (e.g., starting with a theoretical user mobility model and deriving a registration model) we start with empirical data and try to develop a realistic model of registrations.


(u,TTL EXCD) then the subnet to be explored is on-the-trace-path.

if perceived direct distance to v is d and probing vip with TTL value d - 1 results in an ICMP TTL EXCEEDED message ip ip with source IP address other than ui.e., (v,d - 1).


The channel assignment tries to minimize interference through avoiding overlapping assignments of channels and flows.

the problem with the proposed channel assignment algorithm is that the link quality is not considered.


Assuming that the current mobility pro.le of a user is known, we model each hub visitation by a user as an independent event.

if the current pro.le is not known, the general probability of a user visiting a hub is dependent on the probability associated with each mobility pro.le.


Even if this theoretical maximum is rarely reached due to over-provisioning of the links, di.erent data reduction methods must be applied to further decrease the load on the measurement nodes.

these methods must not in.uence the real-time nature of the tra.c capture, i.e.


For example, when n = 8 and k = 3, we have 4096 servers in a BCube3.

due to space constraint, we may only be able to pack 2048 servers.


Most samples retrieve reasonable Content-Type values from the server.

a signi.cant number of servers tries to camou.age PE binary downloads as text, HTML, JavaScript or image .les.


Large web-sites often map their domains to multiple IP addresses; this allows load distribution on several server-machines and shorter round-trip time to the client, who connects to a physically close server.

this induces a di.culty on our attack since we wish to learn the port-counter associated with the speci.c server IP address that the client uses.


A specialized site of BonFire o.ers network property con.gurations between VMs and aims to evaluate application behaviour with di.erent connectivity scenarios.

we need to con.gure the network between sites as we aim for changing VM locations to improve application quality.


Since shoppers typically hold their head steady while gazing and are also not walking, this can be detected by measuring the standard deviation in inertial sensor measurements on the smart glass.

just relying on inertial sensors leads to a large number of false positives.


Sorting is usually implemented as an external-merge sort because the entire list of tuples is too large be held in main memory [26].

this task is both memory-and energy-intensive.


In this example, to get the full bene.tsofRON, all i3 nodes should utilizeRON as their underlay.

this is not strictly required: i3 nodes that do not runRON will default to using IP.For both bridging and layering, one can further specify whether some connections replace existing ones.


[12] presented a scheme for secure multicast communications in MANETs based on public key cryptosystems.

we consider only symmetric key cryptosystems based group communication schemes.


Todays, northbound applications are considered as hot topic(e.g.,[16]).

giving examples of useful applications in this area is not a trivial task as there are many limitations in the control plane.


This work is motivated from a novel idea that through taking account of both space-time uncertainty and sleepingwaking frequency simultaneously, it is capable to improve existing TDMA schemes on minimizing sleeping-waking frequency.

this new approach faces many challenges: First, due to space-time uncertainty, in order to minimize sleeping-waking frequency it requires to analyze the complicated con.ict relationship among nodes.


On the one hand, traditional retransmission-upon-failure usually introduces very large end-to-end delay, thus is not proper for timecritical services.

common approaches without retransmission consume lots of energy.


Since the source MAC addresses of network frames forwarded via routers contain the address of an edge router, the HV-module in the destination work server cannot discriminate between the LNIDs of the source VMs running on the other L2 domains.

provided that the routers are equipped with a virtual routing and forwarding (VRF) functionality, the HostVLANbased architecture can cooperate with them in order to segregate networks across L2 domains.


We cannot predict the registration time of the communication call site of the .rst iteration of inner loop 1 from the per iteration time of that loop.

that time is the registration period of all other instances of that call site.


When the large estimated frequency variation is due to multiple OSes instead of iOS, our scheme wrongly identi.es iOS in the tethered traf.c.

because other OS .ngerprinting features (e.g.IP TTL, TCP timestamp option, and TCP window size scale option) can still identify the correct OS, our scheme will identify iOS and non-iOS devices by combining results from all features.


Acceptance of legitimate requests  The .rst requirement is already achieved by limiting the number of accepted authentications as observed at some of the modern APs.

such a conservative protection fully ignores the legitimate clients and it may even serve to extend a resource-depletion attack to a more sophisticated one.


+ share - i share ni -1 colli(xi)1 Vi(xi)= k·log xi-(1-k)·( ·xi+ +) share B Bn i (9) share n -1 Because log xi is a concave function, and i B · xi + colli (xi )1 B + nis a non-decreasing function, Eq.9 is a share i  strictly concave function, according to Lemma 3.2 in [22].

whether it has a unique optimal point depends on two conditions: Vi(xi) .


Packet-based bitrate control schemes simply assume that channel conditions do not change signi.cantly in the course of a packet or two, so the SNR predicted for the next packet is the same as that of the current packet.

this simplistic prediction performs poorly at the block granularity during which the channel condition may vary a lot.


CloudIQ [3] centralizes all data and control plane processing.

we believe that pushing all data plane processing to a central entity imposes huge demands on the bandwidth and latency required on the backhaul.


If k = 10, then, since both the critical threshold and the distribution of switching costs are 10 times lower for B than A, the two schemes have roughly equal likelihoods of adoption.

if k < 10, then the savings in switching costs for B are insuf.cient to compensate for the reduced adoptability of B s weaker properties, and hence B is less likely to be adopted than A.Conversely, if k > 10, then B is more likely to be adopted than A.


The only elements in these automata which may be considered less intuitive are the use of committed locations in the InputHandler and the sending of a no reply signal in situations where no reply packet is sent (this is an artifact of the model since in reality there is no such signal).

we can easily remove these elements from the InputHandler automaton at the price of making the Network automata (somewhat) more complicated.


3Our main application of CoSP in this paper speci.cally, the embedding of the applied p-calculus does not make use of nondeterministic nodes.

we feel that nondeterministic nodes can be very useful for future applications.


The .le sharing and directory lookup-based systems can tolerate high lookup latency due to the fact that the user does not need to actively wait for the .le to download, and the actual .le download time tends to be larger than the lookup latency.

an IP telephony caller actively waits for the phone on the other side to ring.


For short .ow applications such as MPI the performance can be more sensitive to latency than throughput and the existing mechanisms for network con.guration and adaptation may often be adequate.

in data-intensive applications such as MapReduce and its supporting .le systems the workload tends to pass data in very long .ows.


Our approach is not tied, in principle, to a particular language.

for the sake of example, we adopt a modification of the COMMUNITY language [11].


Transition region losses due to suboptimal thresholds would range around 3%-16% instead of 1%-6%.

in the long range limit, thresholds vary quite slowly.


It is preferable that all monitors perform their exploration in parallel.

how would one manage the global stop set if it were being updated by all the monitors at the same time, with the attendant risk of re-exploring paths?


2) Approaches for autoconfiguration Besides developing a completely new protocol, there are at least two options to develop autoconfiguration mechanisms for IPv6-enabled sensor networks based on existing solutions: a) Adaptation of standard IPv6 autoconfiguration mechanisms to work in sensor networks The natural way of performing address configuration for IPv6 networks is to make use of the already standardized mechanisms for any type of IPv6 networks, namely IPv6 neighbor discovery (NDP) [31] and IPv6 stateless address autoconfiguration (SAA) [32].

both mechanisms expect layer 2 multicast capable links, i.e.


NYC areas, South Africa, and South America networks became globally unreachable from 10 selected peers (e.g., AS 513, 559, 1785) in Europe, US, and Japan.

these reachability losses did not create severe routing instability in the global Internet.


This is true as well for the method as described in the previous section.

we show in this section that the notion of virtual landmarks makes it easy to distribute measurement load more evenly throughout the system.


Its use is appropriate when very little information is known about the categorization structure of the underlying data [7].

the type of data used for clustering and the selection of meaningful attributes for the clustering approach play a critical role in the performance of the clustering process.


CONCLUSIONS In this paper, we consider a new method of communication between devices that cannot interpret the individual bits of the packet.

we facilitate their communication by sensing and interpreting energy patterns on the air.


A histogram analysis indicates that the second layer (centered at 57 ms delay) comprises about 50% of all downlink delay singletons while the third layer (centered at 67 ms) aggregates about 40% of the singletons.

what makes emulation really challenging is that for payload sizes between 700 bytes and 1100 bytes the median curve oscillates between the second and the third layer.


RELATEDWORK Asalreadymentionedintheintroduction,accountabilityandveri.ability play a crucial role for many cryptographic tasks and protocols.

in most works, accountability and veri.ability or related notions are merely described informally or are tailored to speci.c protocols and security aspects (see, e.g., [3, 10, 24, 23, 9, 8, 18, 6, 7]).


.guration stanzas can, in theory, be reused across different customersprovisioned on the samedevices.

as we showbelow,we .ndthatcomplexity arisesbecausecustomersoftenrequire signi.cantlydifferent con.gurationdue todifferent waysin which a service is actually used.


Thus, for much of this paper we will concentrate on throughput fair schedulers.

it is worth noting that a recent result shows that a set of DRR-like schedulers can be used to achieve reasonable delay bounds with small added complexity [13].


[11] proposed a modi.ed IEEE 802.11 DCF based opportunistic MAC protocol for SUs which allows SUs to transmit packets with variable length depending on the remaining time of the current slot.

all of these works [10, 7, 11] dealt with cognitive radio network with a single channel.


This problem is similar to a classic two-stage Bertrand problem [10].

the common supplier in the .rst stage and the heterogeneous products in the second stage are unique for our problem.


These DNS functions have yet to be widely deployed.

they are only needed for those hosts that wish to use mobility as proposed by ILNPv6.


In this paper, we mainly focus on research of algorithms to determine the position of a user.

the research methodology and our tools are not limited for this task.


Similarly, in networks with high message generation rate I, since particles will be required to further propagate an increased number of received messages, a larger space Tb will be required, while for networks of low message generation rate a smaller space may su.ce.

in real environments, measuring the density of the smart dust plane may be a highly non-trivial task, especially if we consider cases where the particles are dropped randomly on the area of interest.


Problems like that configure, then, fault points or bottlenecks.

the use of distributed technologies, such as P2P-based model and mobile code model, brings new benefits to the network management that becomes more effective.


Defeating n-gram analysis will require DNS tunnels to pad the exfiltrated data with characters that more closely match typical n-gram distributions.

this will greatly reduce the bandwidth of the tunnel, requiring an increase in the amount of DNS traffic sent out of the malicious system.


Using the algorithm from [22] directly might result in different power assignments for v at different times.

we focus on choosing a single power-level for each node, so that the overall latency is minimized.


This approach is specially focused on the edges of the network, where bandwidth is often an issue.

overprovisioned core nodes will not take part on the overlay network, thus making dif.cult the establishment of endto-end QoS paths.


Extended security services are required that are described below.

the basic security services can be used to construct these extended services that involve security policies.


Indeed, by (6), both types of invader receive 4.36 Mb/s against N - 1 stations playing Mixed Nash.

play SM in each stage is not the best conceivable strategy for an invader station n,.


Compared to the 33M links found in ITDK-201001, this use of informed probing would discover about 5% greater coverage.

care must be taken in making this comparison for several reasons.


The implementation known as Trunked IAX protocol allows the use a single header for the passage of several calls, meaning that it is possible to send several conversations on the same stream, which represents a significant saving bandwidth, since with this avoids the overhead of IP and UDP transport layers too.

so far IAX trunked mode can only be enabled between two Asterisk servers.


For ARR P and TRR P it is su.cient to .lter the measurements (in these cases packet counts) at regular intervals using an exponentially weighted moving average (EWMA) with a .xed averaging fraction.

estimation of the average loss probability LOSSP and of the average MRTT ARTT both require a more general and sophisticated .ltering approach.


Finally, in such an experimental study it is not possible to reproduce an experiment, and thus to gain statistical information because each experiment depends on the behavior of peers, the number of seeds and leechers in the torrent, and the subset of peers randomly returned by the tracker.

studying the dynamics of the protocol is as important as studying its statistical properties.


In addition, more sensors will be charged in the case of a larger L. For example, when L = 200m, 34% of the sensors, with the battery energy lower than or equal to 32, are charged and this results in a tour length of 193.2m.

when L = 300m, 78% of the sensors, with the battery energy lower than or equal to 77, are charged, which leads to a tour length of 295.4m.


This approach is problematic: if an adversary runs as many Tarzan nodes as IP addresses to which it has access, a user is very likely to select malicious nodes.

these addresses are rarely scattered uniformly through the IP address space.


This has led many users to blame the performance problem on either a failing network or the overhead imposed by encryption.

if the performance problems were being caused by processing overhead one would expect transfers to be slow regardless of this distance between hosts.


Each such TCP connection record contains the information found in a typical .ow records such as IP addresses and port numbers.

in addition a TCP connection record combines the .ow records in both directions and maintains additional statistics such as peak throughput and latency for each direction of the TCP connection.


Because Scenario 1 does not use buffering scheme, it shows relatively many dropped packets.

from Scenarios 2 to 4, we cannot notice any packet drops.


If we simply keep the existing IP assignment when migrating those networks to SDN, It is very likely that we will see huge number of .ow rules as a result.

it would be impractical to require operators to re-do the IP assignment for their networks.


Recently, Elkin and Kortsarz [13] showed a logarithmic hardness of approximation for the same problem.

these results do not directly extend to ad hoc networks since ad hoc networks are modeled by a very restricted class of geometric graphs called disk graphs.


Not all of this activity is necessarily verbal; it may also include non-verbal utterances and background noise.

we argue that non-verbal utterances form a significant part of human communication.


4.2 Representation of a Subset of Rules Problem 2 shows how to deal with order-dependent classi.ers.

the number of lookups that can be issued in parallel is a system parameter, and the minimal number of groups found by solving Problem 2 may be unacceptable.


MIRO bears some similarities to overlay networks [6], in terms of establishing tunnels that encapsulate and decapsulate packets.

mIRO selects paths on the underlay with the cooperation of the routers in intermediate ASes, rather than directing packets over virtual links to intermediate hosts.


Effectively, frequent unpredictable placement changes convert application-speci.c communication to resemble dynamic traf.c.

the basic .ssion and fusion techniques may be generalized to be implemented at run-time by using heuristics rather than ILP solvers.


Finally, it might be interesting to explore the use of various peer-to-peer location services, such as Chord [26], Pastry [23], Tapestry [33], Viceroy [20], and CAN [22], for propagating information to proxies, and load balancing between them.

these mechanisms are tailored for the Internet, and may need to be adapted to wireless ad-hoc networks.


In computer vision, SIFT (Scale Invariant Feature Transform) is the most widely used algorithm for determining the key-points in images [22].

sIFT typically imposes a very high processing complexity and is thus, not a viable solution for resource (battery) limited devices like smart-phones.


We also observe that this performance anomaly cannot be mitigated by using a wider channel bandwidth of 40 MHz.

usingframe aggregationconsiderably improvesthethroughput andwhen 1Thesearethe maximumpossibledata rateswhenusingless than 4 spatial streams.


Direct access to the memory and registers of the veri.er process are unlikely to be useful in supplying the initial state s0, because P. will have a different memory and register allocation.

if the necessary state can be inferred from the veri.er s output and from a priori knowledge as described in Section 3.2, and if the program P. implements the same protocol speci.cation as P, an input iv derived from our symbolic formula is likely to result in the same externally observable behavior on the veri.er as io did on the observer.


Similarly, when RSCP is very high and ECIO is low, we can predict with (90+%) accuracy that throughput is going to be high.

we .nd that there is a signi.cant intermediate region where the throughput could be high or low.


They allow for dissemination of a small code size because the virtual machine code is much more compact than the native code.

the execution of virtual machine code is much less ef.cient than native code, which severely degrades the energy ef.ciency of the deployed sensor nodes when the program is expected to be executed for a long time.


BACKGROUND Research community on inter-domain routing has worked out many protocols and technical contributions for BGP operational issues such as scalability, convergence, routing stability, and performance.

the security aspects of BGP have not been practically solved.


In contrast, FPS must determine demand in terms of the number of TCP .ows present, which is independent of arrival rate.

furthermore, since TCP always attempts to increase its rate, a single .ow consuming all of a limiter s rate is nearly indistinguishable from 10 .ows doing the same.2 we would like that a 10-.ow aggregate receive 10 times the weight of a single .ow.


This way, the malicious nodes are rewarded and reinforced in their behavior.

we would like to achieve the opposite with our protocol.


This could be a prominent way to support IP mobility to mobile nodes, because it requires minimal functionality on the mobile node.

there is a limited understanding of security provisioning, security infrastructure, low latency handoff, and deployment scenarios, etc.


Once we infer a HMM from one bot, it can detect other bots tra.c.

for hierarchical botnet tra.c, every intermediate node includes timing patterns from its sub-botnet.


Results for µ = 200 ms are independent of the burst length (i.e., a straight line) for b = 20 ms because the probability of a loss burst lasting more than 200 ms in these cases is close to zero.

when b = 40 ms, the probability of a burst lasting more than 200 ms is higher and the detection-error rate increases.


each node s unique id into its virtual id.

unlike 4.5 DNS which is a separate infrastructure, we design our mapping mechanism as part of the forwarding process.


What is needed, on the one hand, is the ability to abstractly describe operational goals without getting bogged down in the minutiae of how to achieve those goals.

because of the sophistication of modern networking equipment, the ability to .ne tune the details of how an operational task is performed, is in fact critical to achieving the desired effect.


We also ran the experiments with various topology and capacity constraints on links to simulate scenarios where bandwidth was and was not a bottleneck.

the results were similar enough to omit for brevity.


We also formalize the protocols and the attackers in a symbolic way.

instead of specifying explicitly everything that is possible (as the Dolev-Yao approach does) for the attacker and hence considering the least model, we speci.ed what cannot be violated and hence considered the greatest model that the set of rules permit.


Wildcard .ow entries can be used to create default routes in the network.

since switches do not keep track of .ows covered by a wildcard .ow entry, the controller no longer has knowledge about individual .ows.


Packet loss and the access time offered to users are other potentially interesting metrics that can be used to evaluate network performance.

since the traf.c generated by each user in our experiments is known, the measured throughput also indicates packet loss.


A speci.c architecture is unlikely to be optimal for all QoS metrics at all times.

in general in the QoS Map server the architecture of the neural networks will be based on Multi-Layer Perceptron (MLP) models.


The propagation of the JBC packet is similar to what was described in Section 3.

section 3 does not mention how a node decides whether to forward a JBC; this decision depends on whether deterministic or opportunistic forwarding is deployed and is discussed next.


A naive reconstruction of the whole forest introduces computational (in the session management site) and communicational (session manager reassign senders to receivers) overheads.

each view change of a viewer actually only affects its descendants in the dissemination tree she involves.


When a RREQ copy at an intermediate node creates or updates a reverse path, and the intermediate node has no valid path to the destination, the RREQ copy is re-broadcasted provided it is the .rst copy that yields a reverse path; this is somewhat similar to basic AODV where only .rst copies of RREQ are forwarded to prevent looping during the .ood.

if the intermediate node does have a valid path to the destination, it checks whether or not a RREP has already been sent for this route discovery.


While the wavefront allocator represents a reasonable choice for smaller networks, separable variants o.er lower delay and cost for networks with higher radix and more VCs.

the choice of switch allocator directly a.ects the achievable saturation rate, particularly for larger networks.


In summary, the 802.1X speci.cation is centered on an abstraction that easily maps to switched wired networks.

insecure association and the ability to mount rogue access points have made di.cult the mapping of such abstraction to wireless networks.


This double-check can be pushed to several untrusted (but randomly chosen) clients as in the MC system.

with this system there is no synchronization overhead during game-time.


If the new path is too close to the congested area, it may lead to congestion too.

if the path has to make a large curve around the congested router, it may yield poor performance even if congestion is eliminated.


If the prediction is not accurate, bandwidth will be wasted and our solution will have little bene.t.

as we shall see in Section 6.1 below, these important contexts can be predicted with relatively high accuracy.


This is because, in a highly crowded situation when users are colliding very often, RTS/CTS can improve performance, and through this improvement it can also handle more tra.c.

the usage of RTS/CTS is not very frequent, because when there are few stations the performance can be downgraded.


SYN-out SYN-ACK-out testsif aNAT allows a client to send out aSYN-ACKpacket after sending aSYNpacket.

filtering response: Recall that at the beginning of NAT traversal, each client sends out aSYNpacket to create a connection mapping onits ownNAT.when theSYNpacket reaches the other NAT, it could be dropped or trigger a TCP RST or ICMP packet.


Comparing the sequence numbers of the two samples, we see that both BS and RIGHT saw the same packets transmitted by LEFT on its uplink slot, Slot 7.

we observe that the RSSI values of the two samples di.er quite signi.cantly.


While this is potentially useful for many applications, in the medians (CDF = 0.5) of the best and the worst path is only 20 ms. next section, we necessarily focus on one such application.

the corresponding difference is as much as 100 ms in the Amsterdam case.


For an advanced congestion control scheme like DCTCP, the lower bound of the threshold has been shown * to be O( T × C) in [2, 3].

as we will show later in this section, the absolute value of the di.erence between the lower bounds of DCTCP and ECN* is actually very small for data center networks, which allows ECN* to perform similarly to DCTCP.


N2 hears these messages and repeats the process after receiving w of them to estimate o2(0) and d 2.

as the clock at N1 is not as accurate as the master clock, the noisy offset measurements at N2 will now include additional terms: iT c2(i)= o2(i)+ e2(i)+ eo1 + ed1 (11)f0 eo1 = o1(0) - o 1(0) (12) ed1 = d1 - d 1 (13) where, o2(i) is the true offset of the clock at N2 with respect to the clock at N0, e2(i) is the offset measurement error at N2 and eo1 and ed1 are the errors introduced in offset measurement due to imperfect offset and frequency error estimation at N1 respectively for message i.


Early papers on the Globus MDS described a feature called resource images which are similar to our virtual Grid entries.

to our knowledge, these images were never used.


6.4 Interference with TV Receivers Since the backscattered signals are re.ections of existing TV signals, in theory, one could either synchronize ambient backscatter with the TV transmissions or modulate data at a slow enough rate that TV receivers would be immune to interference.

even without these constraints, the backscattered signals are weak enough that they do not affect TV receivers except in less favorable conditions.


2.3 Performance Upper Bound (Lower Boundof Waiting Time) The optimization problem de.ned above (called original problem hereafter) is hard to solve e.ciently.

to analyze the performance of our practical design, it is necessary to .nd a performance upper bound for solutions to the problem.


The latency can be improved by removing the proxy and moving all the processing including parsing the HTTP request into the kernel space [20] [16], as shown in Figure 4(a).

data has to be moved from host DRAM to NIC and from NIC to host DRAM over the PCI bus.


Severe BGP instability for a client or server s IP pre.x often implies signi.cant failures for the client or server s end-to-end communication.

such severe BGP instability is rare and does not account for the vast majority of end-to-end failures.


Similarly, the work in [17] proposes a framework developed for energy consumption monitoring of real WLAN deployments.

this framework is restricted in characterising the consumption at the level of complete device (router).


In DSR, a route between the source and the destination is also established by the exchange of RREQ and RREP.

the route information, a path consists of node ids, is kept by the source itself.


Assuming there are at most n ' corrupted sensor nodes, then the corrupted sensor nodes can cause the aggregation result to deviate at most n ' from the true result.

if the aggregator cheats, the aggregator can cheat arbitrarily about the result.


Clearly, it should try to keep packets in its own queue and occasionally forward them to the MAC.

having no packet in the MAC queue when the MAC is ready to transmit reduces link utilization.


The authors use a single scenario with .ve nodes and report that for low tra.c rates, testbed results match closely with those from simulation.

at higher rates they see very signi.cant di.erences.


Therefore, it becomes easy to obtain a higher eigenvalue ratio.

the eigenvalue ratios of SP are lower in the environment because the correlation is higher.


Such topologies make sense if most of the traf.c .ows into or out of the data center.

if most of the traf.c is intradata center, as is increasingly the trend, then there is a very uneven distribution of bandwidth.


In SEATTLE, this is simply handled by the link-state protocol.

if a switch fails or recovers, the set of switches in the link-state map changes.


For example, if connection A has T A = 24 and reserves slots 0, 24, 48,.... SCO When connection B with T B = 6 arrives at slot time 5, SCO it may reserve slot 6 without con.ict with connection A initially.

as time goes on connection B will con.ict with connection A at time slot 24.


little time or resources to integrate measurement and analysis possibilities into the Internet infrastructure.

the Internet community needs to understand the nature of Internet tra.c in order to support research and further development[2].


This can be observed, for example, as the buffer creation and selection mechanisms for each optimiza 2The Standard Optimized Buffer is a specialized version of the Simple Buffer at a conceptual level and, as such, a subclass relationship between the two could be enforced.

the calling interface needed for the two is signi.cantly different and little opportunity for true polymorphism exists.


A fair scheduling approach, which treats the resource allocation problem on general wire- less networks (with no reference to CDMA) as one of fair packet scheduling, was considered in [24].

no dis- tinction is made between uplink and downlink data flows.


The proposed framework does not pose any limitation on the deployment of the cooperative elements.

performance and security issues suggest to rely on a dedicated network for sensors management, rather than transmitting internal states and other control information through the same link of the monitored tra.c.


The transmission cost for SNAMDV2 scheme is lower than BubbleRap-U but the transmission cost of the SNAMDV1scheme is still higher than BubbleRap-U scheme.

all these 3 schemes cost less than the MCopies-M scheme.


Especially in the heterogeneous environment, the MBST construction will end at an early stage due to some resource limited peers who cannot be included in too many MBSTs.

for some data-intensive streaming applications, peers can accept receiving of partial stream when their download bandwidth is not su.cient.


HEURISTICS Despite the lack of e.cient approximation algorithms with good approximation ratios, it may still be possible to .nd a good solution in many practical problem instances by using a heuristic algorithm.

typical heuristics are of little use in comparing the performance of di.erent kinds of sensor networks: the heuristics provide only a feasible solution (i.e., a lower bound for the optimum); they do not provide an upper bound for the optimum.


The Starting Point is used to prevent generating links intersection, as illustrated in Figure 7, and then guaranteeing progress at each step.

for the initiator node, that has not a CS previous hop (the message comes from a greedy forwarding previous hop), its corresponding Starting Point, noted ISPinit is considered as the intersection point between the circle of range R, centered at this node and the segment between Ninit and the destination (see Figure 7).


Thus path brokering and explicit path speci.cation do not eliminate the need for destination-based hop-by-hop routing and the distributed path computation which enables it.

even in such cases, incentives such as packet-level provider choice, and quick, endhost-based failover still exist for path brokering.


In Table 4, it is clear using fmodel that the exponential MAC model of M/M/1 is less e.cient than the complete Markov based model.

looking at the .nal total delay distribution, both M/M/1 and M/G/1 models give very close analytical PMFs.


The other two components, data-oriented naming and in-network caching, we touched only indirectly.

we hope that our work allows others to build upon it, allowing experimentation with network architectures that are fundamentally di.erent from the currently deployed ones.


This tool allows us to generate realistic vehicular movements by parameterizing settings such as speed limit and vehicle acceleration.

due to the limitations of the IMPOR-TANT framework, traffic scenarios cannot be generated with an average inter-vehicle distance below 6.6 m. we make the observation that for average inter-vehicle distances less than 6.6 m, the vehicles are not very maneuverable in traffic, and therefore their relative positions to one another remains approximately the same.


between IEEE 802.11 and IEEE 802.15.4, but very little work has addressed inter-network interference between co-located WSNs using the same communication technology.

the potentially large number of co-located networks and fairly small number of channels suggests that this will not be an unusual situation.


AS u does not need to coordinate with v in making these changes.

aS v needs to change its import and export policies.


Wecarry out simulations onvarious CSEs withchanging mobility entropy in order that we investigate the e.ect of mobility entropy on message routingperformance.We recognize that theperformanceis a.ected bymany environmental features such as network bandwidth, media-access control (MAC) protocol, message bu.er capacity as well as mobility.

in this work, we assume an ideal environment (e.g., in.nite network bandwidth and huge capacity of storage) to demonstrate the relationshipbetween mobility entropy and routingperformance.


10(b), when d> 0, the average queuing delay becomes stable after B increases from 0 to 1.

under burst traf.c with Pareto distribution (Fig.


Compared to 2K-rescaling, this technique is simpler and can easily be extended to higher-order statistics since we can always compute scalar summaries of a given dK-distribution [18] the mean clustering and correlation of degrees of nodes located at distance 2 from each other are such summaries for the 3K-distribution, for example.

this simplicity comes with a price: no scalar metric can capture all of the information contained in, for instance, a 2K-distribution (that must be encoded as a matrix).


At any other instant, the probability that S&C fails to report one such .ow is higher.

such probability also decreases exponentially in the number of stretches elapsed.


In order to work efficiently in mobile environments, some of the existing works can adjust the frequencies of push and pull operation [1,2,3,4].

they are not really dynamically adaptive because the frequencies of push and pull are determined according to predefined static algorithms.


Although the mean residence time in the OFF state is not the largest, the product of the mean residence time and the transition probability into the OFF state is much higher than that in any other states.

a few states that have a larger mean residence time than the OFF state actually have very low steady-state transition probabilities.


Notice that the uniqueness of the OAN is more conceptual than expressed in a mild way under the term of free roaming access.

the history of twisted pair liberalization (or unbundling) shows that the owner of the physical infrastructure has always a lead on other service providers simply because it can adjust the cost sharing between the physical infrastructure and the service provisioning.


It may not be suitable for some time critical applications like voice over IP (VoIP) or real time media streaming.

if one can predict how the system performs under the basic access scheme, it would be possible to determine accurately when the RTS/CTS becomes necessary to meet some throughput requirements.


So the highest level of security we could possibly achieve is to make sure that the remaining 32 -5 - 1 bits look completely random, i.e., indistinguishable from a (32-k-l)-bit random number.

this only characterizes how an individual address is affected when some anonymized addresses are compromised.


The number of calls dropped at hand-over by M²BARP due to lack of bandwidth is lower.

this hides the fact that M²BARP also dropped calls where the predicted target was unsuitable.


3.3 TLS based Authentication methods There are more than 40 EAP based authentication methods that can be used in conjunction with a AAA protocol, which will encapsulate the data found in EAP frames into appropriate AAA messages and transfer them from the NAS to the AAA server.

eAP authentication methods that are based on a Transport Layer Security Tunnel [4], such as EAP-TLS, EAP-TTLS, PEAP or EAP-FAST and others, appeal more to our research not only because they are more secure, but also because they bring signi.cant advantages to roaming users.


Utilizing the Information Leakage to Recover the Key.

at .rst sight, the information of whether the secret RSA key d is left or right of some value Dp in the [0,..., N ] range seems to provide only information on the few most signi.cant bits of d. recall that over the lifespan of the system, the members update their secret shares by performing the proactive share update procedure.


Rf ) Choosing the right policy in practice: To summarize our .ndings, our analysis demonstrates that using a .xed rate may be attractive on lossless links while it would be better to use rate adaptation on lossy links.

as discussed, determining when to use one over the other in real time during system operations is di.cult; the determination requires the knowledge of x(F, Rs), y(Ri)and estimates of how often the jammer is active/asleep, on average.


NoCArc '10, December 4, 2010, Atlanta, Georgia, USA Copyright &#169; 2010 ACM 978-1-4503-0397-2... $10.00 routing algorithms, besides source and destination addresses, network traffic variation plays an important role for selecting channels to forward packets.

adaptive routing may cause packets to arrive out-of-order since they may be routed along different paths.


For example, botnets with a centralized C&C architecture, where all bots receive commands from a few central control servers, the source of the C&C messages can be used to characterize the corresponding C&C channel and reveal potential dormant bots [23].

characterizing the C&C channel is in general not a trivial task for botnets that utilize a peer-to-peer (P2P) architecture involving no central server.


Finally, the mobile node in searching mode cannot .nd the next region to move, so it returns to the source node D and changes its mode into transmission mode.

when some mobile nodes in sensing mode connect to the source node or .xed nodes that recieved the request from the mobile node in searching mode, these .xed nodes send a route construction request packet to the connected mobile nodes.


Whilst in the transport system, she is unable to connect to the Internet as there is no network coverage (or because the connection cost is too high).

the large number of other passengers travelling with her, o.ers means of procuring media for her enjoyment: during periods of peer-to-peer connectivity, devices may transfer music tracks or video clips between each other.


This might be important in a mobile network environment with an increasing number of context-dependent (e.g., location) and personalized services.

sCN leaves open several research issues.


5.3 Server Overhead The MONARCH and OVL policies provide strong cache consistency and also exhibit similar performance in terms of the generated traf.c.

compared to other policies studied, the MONARCH and OVL policies incur overhead at the servers because they require servers to maintain state and perform additional processing to achieve strong cache consistency.


Many of the scheduling algorithms for IQ switches can be directly applied to CICQ switches at a lower complexity, e.g.,the distributed MWM algorithm DISQUO [39] and the push-in.rst-out (PIFO) policy [14].

a CICQ switchsuffers from the same problem as an IQ switch due to the needfor nearly instantaneous control communications between the input line cards and the switching core.


In general, due to the time-varying nature of these indices, it becomes very di.cult to determine the structure of the optimal strategy.

the similarity in the index properties between the CDT and CAT policies can be used to propose the following two-step lookahead algorithm, sim¯ ilar to Algorithms .


These codes are orthogonal and are used to channelize the available bandwidth.

a system is called time-asynchronous if signals originate from multiple transmitters, as in the case of the uplink of cellular networks and also in MANETs.


As a general classi.cation we can distinguish between face routing strategies which require that the message has to follow a sequence of adjacent faces which are intersected by the straight line st connecting the source node s with the destination node t. These strategies will be denoted as continuative strategies since they keep the line st as a reference during the whole routing process.

a volatile strategy will initialize planar graph routing each time a face change occurs.


In this way, free-riding is no longer attractive.

this approach requires us to tackle two problems, each of which is dif.cult or impossible to solve in the general case: 1.


Most people found the basic WAP scheme easy to learn and simple to interact with (e.g., Question 7: It was easy to learn to use ; 70% agree, 11% disagree, the most positive response).

there was consistent disagreement with the statements that asserted that the WAP system would enable users to complete tasks effectively (e.g., Question 4: I am able to complete my work quickly using these WAP services ; 25% agree, 51% disagree).


In the past years, several of such disciplines were developed.

to maintain a delay little bigger than GPS, with a fair throughput and a good worst-case fairness while reducing computational overhead is a big challenge.


This leads to packets being delivered on the non-shared AP repeater link that cannot be delivered to the client.

multifacet s co-ordinated channel access logic desists the AP from sending traf.c on the shared channel when enough capacity does not exist.


In so doing, they can correctly avoid reacting to the inevitable short-term variations due to small-scale fading that even static wireless networks encounter.

when nodes move, they should not maintain long histories because the rapidly changing channel conditions and network topology quickly render old information invalid.


Second, while increasing balso increases TCP throughput, it does so only in higher aggregation regimes (when nis suf.ciently large) and in scenarios with long-lived TCP .ows.

increasing bis not a good option for low aggregation regimes (when nis small) since the TCP throughput can become too low since nb-a we have p(T=b)=.


Our use of Bloom .lters was inspired by this work [7] as has much of the work on using Bloom .lters in wireless and distributed systems.

broadside addresses a more complex problem by incorporating version numbers for the .le; determining which blocks two devices have in common does not use version numbers.


Optimal path outperforms the shortest path even under the 802.11 MAC when number of .ows in the network is small.

the optimal path routing does not always outperform the shortest path routing under 802.11 MAC when the number of .ows is higher.


In principle, the CSdomain voice and the PS-domain data have distinct requirements.Data prefers high throughput whereas voice values timely delivery.They should be treated differentially.

in both cases, identical operations are performed on traf.c from both domains.


For lookups with one referral, 60% of lookups are resolved in less than 100 ms and only 7.3% of lookups take more than 1 second.

more than 95% of lookups take more than 100 ms, and 50% take more than 1 second, if they involve two or more referrals.


These attributes are obtained from the SNMP traps, business objectives of the company, context of the request, LB info, mobility management scenario and service/user pro.les, depending on the decision computation and its enforcement mode.

for brevity and to avoid the complexity of stringent mathematics, 6 attributes are chosen for the application of MCDM methods on 4 alternative links (decision computation for link selection regarding the dynamic routing of calls is presented .rst as it is most likely and frequently use case).


If the congestion window growth under a routing protocol shows a predominantly slow starting TCP, then the network using the routing protocol is obviously not congested.

congestion avoidance behavior can also indicate low congestion levels if the congestion window grows to the maximum.


and precoding algorithms [5] can be directly employed in either direction to evaluate the relative bene.ts of FD-MIMO over HD-MIMO and select the better strategy.

when the number of streams is large, the scheduler can directly employ MU-MIMO.


CRFIDs, however, passive tags are free to choose any value from 0 to 216 as its RN16, so it is possible that a passive tag could choose an RN16 that con.icts with a burst noti.er.

we choose a small part of the space for burst noti.ers since we expect the number of sensors in the vicinity of a reader to be in the tens (equivalent to the number of objects in the vicinity of a reader) as opposed to thousands.


Across all the mobility models, the delays increase for all other protocols with increasing node density.


stops disseminating data to the control center, about at time t = 400sec.

by delaying the deployment of the 300 nodes for a period of 400sec, we manage to replace the strained nodes with the newly deployed ones.


Imagine if all flows were to demand unreasonably tight deadlines, then their resulting congestion avoidance behavior would be to refuse downsizing their windows, effectively overloading the network.

d2TCP s gamma-correction function guards against such overload at two levels: (1) The effect of tighter deadlines is captured by the value of .. which, in turn, determines the window size (hence sending rate).


We wish to provide an input to Host B, who is also running a process executing program P, such that it reaches a state sb that satis.es the post-condition.

i.e., such that q(sb)= T. the process being run by host B will be in a different initial state sb.


The plot shows that a few top features provide most of the accuracy gain.

the gains in accuracy we achieve from including 5% to 100% of features are not diminishing.


If so, it means the energy of the current charging node and its synchronization target have been already synchronized, and thus the mobile charger simply fully charges the node to maximize the charging ef.ciency.

if the previously charged node is not the synchronization target of the current charging node, this implies the energy synchronization of the current node has not been yet achieved.


To evaluate how appropriated the o.ered protocol for the VN is, we must consider the requested properties that are met by the o.ered protocol, denoted by a, as a good point.

8 9 Positive Matches (a) Negative Mistaches (b) Similarity we must assess as a bad point the properties that are not ful.lled by it, represented by b.


In our fuzzy logic solution, every attribute (the node in a query semantic tree) is viewed as a fuzzy mathematical object.

attributes of the component speci.cations in IP providers database are crisp.


This throughput reduction, when applying APDR, motivates further investigation of these scenarios.

we already have a clue that this might be attributed to the packet reordering induced by route oscillations.


RELATED WORKS There is a number of session mobility literatures [4],[8].

most of them have some limitations, e.g.


If the decision is relatively accurate, it tends to .nd relays that will forward the data to the destinations very quickly.

if the relays selected based on this heuristic do not re.ect future forwarding probabilities, very long delays may be incurred.


The proposed architecture consists of multiple functional areas and can support the handover decision and execution procedures.

they only proposed the functional handover architecture without any handover triggering or network selection algorithm.