Compared with previous studies [13], these results contain many more .ows with zero bytes sent.

upon investigation it does not appear that these results are due to a single NETI@home user or are anomalous.


4.6 Summary The overall tra.c is still dominated by heavy-hitters, mainly using peer-to-peer applications.

their tra.c decreased slightly in both population share and volume share.


In most transport protocols, the multiplicative decreasefactor is constant (0.5 in TCP).

because RCRT hasa comprehensive view of network behavior across differentsources, it can do better than simply halve R(t).


Similar to SU-MIMO, per-Tc achieves a comparable level of throughput with AFC.

for per-packet feedback, since the overhead doubles compared with SU-MIMO, the throughput loss is substantial.


SCHEDULING 3.1 Overview Many scheduling algorithms have been proposed to service data packet queues, whether work-conserving to disallow an interface capacity to go unused or non-work-conserving to allow an interface capacity to go unused.

few of those scheduling algorithms can provide fairness and yet support differentiated QoS, wireless link fluctuating conditions or varying packet size.


Measuring Load-balanced Paths in the Internet Brice Augustin, Timur Friedman, and Renata Teixeira Laboratoire d Informatique de Paris 6 (LIP6) Université Pierre et Marie Curie and CNRS ABSTRACT Tools to measure internet properties usually assume the existence of just one single path from a source to a destination.

load-balancing capabilities, which create multiple active paths between two end-hosts, are available in most contemporary routers.


An Attacker Model for MANET Routing Security Jared Cordasco Department of Computer Science Stevens Institute of Technology Hoboken, New Jersey, USA  jcordasc@cs.stevens.edu ABSTRACT Mobile ad-hoc networks are becoming ever more popular due to their .exibility, low cost, and ease of deployment.

toachievethesebene.tsthenetwork must employ a sophisticated routing protocol.


The evaluation of developed communication protocols usually is carried out with typical network metrics, for example goodput, latency, jitter, and in case of wireless networks the channel load and occurred collisions.

when 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.


The coefficient of correlation between the durations of successive intervals is only 0.23.

using a greater amount of history results in a good predictor.


One of the implications of such rewriting is that in the region of the network where the packet carries only that intermediate address, one cannot determine the actual endpoint without obtaining the address mapping stored in the re-writer, which means that a policy-constrained step (e.g., conforming to legal requirements of a particular jurisdiction) is required to retrieve this information.

if the global IP address is revealed anywhere, then any observer along the path of the packet can capture the endpoint addresses.


Furthermore, the algorithm verifies that the neighbors available bandwidth is at least superior or equal to the minimal bandwidth required by the flow, that the neighboring node possesses a neighborhood quality of at least MIN_NQ (in our case, MIN_NQ equals 1 meaning that there is at least one QRN in the neighborhood of that node.

for networks with higher density, MIN_NQ could be easily set to 2 or 3, or higher), and that the link connecting the current node and its neighbor is a high quality link.


This is due to the priority factor that gives more priority to distant users.

middle users are the only ones who can efficiently exploit this priority.


The advertiser pays -option might be a very interesting alternative, if an international call is made.

it is essential that advertisements can be easily opted out or in.


A key factor in specifying our traf.c demand model concerns the issue of modeling the quantities Pweb(·) and PRA(·).

as seen earlier in Section 4, the empirically derived quantities Uweb(·) and URA(·) are in fact estimates of the population of web content and the population of clients, respectively, and are thus natural drivers of our gravity model.


If the IXP does not provide a LG, we can obtain RS communities from third-party LGs of networks connected to the IXP, i.e., RS members.

these third-party LGs cannot provide the full view of the RS communities for all the RS members, but only for those members that allow their routes to be advertised to the network that operates the LG.


Note that these slashes do not reduce the number of paths connecting source and destination in the absence of link failures!.

as predicted by our theoretical analysis, in the presence of a 10% failure rate a large number of long slashes (corresponding to a large number of holes of high girth) can seriously a.ect the network s connectivity.


For service classes to meet their QoS requirements, some scheduling schemes must be used in IEEE 802.16 networks.

the standard does not recommend any particular schemes in detail.


In addition, all systems are able to use mobile communications by 3G+ modem connections.

connections to cellular-based networks such as mobile communications are heavily unreliable due to poor network coverage in rural environments.


We can thus group rr-pairs by the anonymized IP address and the anonymized session cookie.


During most of the experiments we used Shisa2 , an implementation of Mobile IPv6 for BSD kernels, for the mobile nodes.

in some locations as we were unable to set up real mobile nodes we had to emulate them.


From one side, content based networking promises to solve the current problems of the Internet.

instead, it requires routers to account for a very huge amount of content names.


Thus, reliability and scalability problems of the centralized key management algorithms can be overcome in the decentralized key management.

to coordinate secure data communication between subgroups, a subgroup controller in each subgroup decrypts the messages and reencrypts them so the controllers must be totally trusted and protected to prevent data leakage.


The mobile ad-hoc networking community has focused on techniques for determining endto-end contemporaneous paths in a network of mobile nodes.

using contemporaneous paths is restrictive, and excludes the possibility of data transport using local connectivity and node mobility, which has in the past been referred to as data muling [9], or store-and-haul forwarding [10].


[9], who have explored HTTP requests collected by a large wireless carrier from several million users and over a period of 36 hours.

the authors studied the cacheability of HTTP traf.c in general and not of YouTube content.


For conventional time-driven applications, when idle period expires, all nodes enter active state and thus the number of sensor nodes to report data is 4.

in our distance based scheme, when idle period expires, each node enters active state with a certain probability and the average number of 1 1 1 1 17 sensor nodes to report data is .


Note that these lookups are only performed at the client, which usually has ample CPU power to decode data arriving at dialup speed.

the proxy does not need to maintain and query an ordered data structure on the hash values, but can use a faster hashbased or similar organization.


This is because we have so far assumed that when a device is not probing, it has no way of knowing if new contacts have arrived even if those new contacts are probing.

if devices are cognizant of the fact that they have been probed, this information can clearly be used to better adapt the probing interval and thereby reduce the short term contact missing probability.


Existing adaptive mobile middleware solutions such as ReMMoC and INDISS have investigated this style of dynamic discovery.

these have yet to consider the emerging suite of protocols for discovery in ad-hoc networks.


[3] During the decades following World War II, Northwest was typical of other educational institutions of similar size in introducing computer technology cautiously and primarily to aid administrative needs.

sixteen years ago, Northwest unveiled its innovative Electronic Campus Program that was designed to enrich student learning and enhance faculty research and instruction by placing a terminal in every residence hall room and every office.


For systems with homogeneous clients, this delay optimization problem has been e.ectively addressed [20].

designing an optimal progression for a population of clients with heterogeneous reception bandwidth is a new problem yet to be investigated.


Simulation results of this approach have shown that, under normal loads, CDP approaches zero.

new calls has not been able to take advantage of the adaptive framework and, as a result, CBP has not improved as much.


The buffer should be large enough to avoid frequent overflow.

excessive queuing causes some additional problems [7] like Round Trip Time (RTT) inflation, unfairness between competing flows and viscous web surfing.


Thus, in UIR, some data items are broadcasted with timestamp, others are not.

we do not want to apply this so- lution because of its complexity and extra overhead.


It then becomes clear that the contention time must be properly adjusted according to its selection environment; if the contention time is set too long, the successful selection probability would be very high, but the selection delay would also be too long.

if the contention time is set too short, the selection delay will be very short, but the selection may frequently fail.


Another class of studies in this category [9, 17, 19] is aimed at ana- lyzing the properties of power law graphs.

most of these are based on inferences drawn from measurements of real data.


A broad interface accommodates MB diversity and sophisticated MB control without introducing undue complexity.

narrow, state-speci.c interfaces, e.g., a 6With theexceptionof statelike .owcountersand timers.


Unfortunately, we do not have access to the remaining con.guration .les, if any.

we note that about 10% of the networks have 10 or more routing instances, and some networks can even have more than 400 routing instances.


On the other hand, although [4] shows that interception is easy to accomplish, there have been no reported imposture or interception attacks on the Internet yet.

this does not mean that these attacks never happened nor that there are no ongoing attacks.


While these works investigated the power of RLNC in some sense, they mainly focused on wired networks, which are signi.cantly di.erent from MANETs.

it remains unknown how to e.ciently incorporate RLNC and how RLNC performs in MANETs.


RELATED WORK To the best of our knowledge, there has been no previous research on fault diagnosis in IEEE 802.11 infrastructure networks.

there are a number of commercial products that provide varying degrees of support for network management tasks, e.g., AirWave [4], Network Systems and Management (NSM) [16], Wireless Security Advisor [20], AirDefense [2], SpectraMon/SpectraGuard [37], Air-Magnet [3], and Symbol [35].


These systems consist of a device that collects and stores vibration measurements from a small number of sensors.

power and wiring constraints imposed by these systems can increase the cost of acquiring these data sets, impose signi.cant setup delays, and limit the number and location of sensors.


The algorithm is based on exploiting a repeating preamble by computing the cross correlationofasignalwithadelayedversionofitself,andcomputing the phase offset across the correlation values at different delays to compute the CFO.

the algorithm needs to be modi.ed for collisions, since we wont have a clean copy of the repeating preamble for the packet that starts second.


See Ramanathan [14] for a thorough analysis of the coloring problems.

there is no analog of Shannon s result and therefore, at this point we do not know the su.cient conditions even for schedul ing a link .ow vector.


Each base station will independently decide a transmit power to use based on the quality of service required.

because the base stations and clients are all close to each other, the transmit powers chosen by a base station will determine the interference seen by the client of the neighboring base station.


In contrast, setting the maximum cache allowance for CCN router close to the gateway of an ISP that is connected to clients and the minimum cache allowance for CCN router close to the server provides the highest pro.t to an ISP connected to the server.

adjusting the cache allowance at the CCN routers of the ISP that are connected to the server does not a.ect the pro.ts of the ISP that is connected to clients.


INTRODUCTION Multipath TCP (MPTCP) allows the concurrent use of multiple paths between two end points, and as such holds great promise for improving application performance.

in this paper, we report a newly discovered class of attacks on MPTCP that may jeopardize and hamper its wide-scale adoption.


will be forced to send small fragments, a behavior that can be detected.

using overlapping fragments, the sender can send arbitrarily large packets while still (e.ectively) fragmenting the signature into pieces of size as small as 1 byte.


The mathematical analysis showed that the goal of PEM can be more e.ectively achieved with a FIPA compliant multiagent approach with mobile base stations than with other approaches.

one potential drawback that could reduce the advantage of multiagent approach over other approaches is the size of the agents.


low µ(R)) the en should be small so that enough particles participate in the propagation of messages.


Most existing protocols, such as the 802.11 power-saving mode (PSM), attempt to reduce the time spent in IL by sleep scheduling.

through an extensive analysis of real-world traf.c, we found more than 60% of energy is consumed in IL, even with PSM enabled.


We also prove the upper bound of the energy 2 na complexity in narrowband networks to be ( · 2 ) On , and for UWB networks, this upper bound can be reduced by a processing gain factor.

we show that improving the scheduling complexity through arbitrary power control has its limitations, and that different power assignment strategies have different impacts on the protocol interference models, which was often neglected in the design of wireless scheduling algorithms.


Thus a message will not be propagated further than hopt hops and will not be propagated further by a node that moves with maximum mobility capacity MLmax.

messages that performed few hops are more likely to enter the forward queue.


TARP ignores the ReqPOWER in the route maintenance procedure.

the requested power will be considered in the next scheduled transmission.


= 0 (9) dCW dp0 dCW According to (6), dSt = 0, so dp0 (1 - p0)n - T {np0 - [1 - (1 - p0)n]} = 0 (10) Because CW = n = 1, therefore, n(n - 1) (1 - p0)n 1 - np0 + p 20 (11) 2 v n[n + 2(n - 1)(T - 1)] - n 2 p0 = v (12) n(n - 1)(T - 1) nT From (6), we can get the approximate value of CW is v CW n 2T .

here, we can see that the maximization of the system throughput depends on the number of contending sensor nodes n. the CW in S-MAC is a constant value.


For all clients in the region during Time (days) the week in Figure 16, the median cacheability per hour is 59%.


The QoS-D LSD cost-allocation mechanism considers both these factors, to achieve optimal fairness.

this might not be in the best interest of the users, when it is on the expense of higher costs.


Further, close to 90% of the jobs achieve atleast 75% of their maximum throughput.

for FIFO and HRUF, almost every job has a through- put less than 75% and 65% of their maximum throughput, respectively.


Another open issue is that since there is so much BGP change, the cause and origin of such updates should be understood.

due to the non-link state nature of BGP, it is dif.cult to accurately identify the cause of individual updates.


Having an SMS interface for requesting transfers, rather than something like a .xed schedule of data delivery, allows the users to choose when they want to go to internet kiosks without having to deal with stale data, and gives them the option of comparing multiple service providers before committing to buy a service.

it is also important to make adoption by kiosks and other internet providers as simple as possible.


The area for TCP Reno, Sreno ,isgiven by: 3 Sreno = {(1 - .)

kt + B}2 t¯ 4 the area for the proposed mechanism, denoted as Sproposed , is calculated as follows: T Kt 2 - .


Sensu [9] is an opensource monitoring framework that is implemented with RabbitMQ, Redis, JSON-based REST API.

its design currently supports single-tenant environment, and not ready to provide service for multi-tenant monitoring.


Most losses concern only a few consecutive packets.

shadowing-pattern (.gure 6(b)) o.ers much more periods of consecutive losses (relatively the curves are drawn on a log scale), a few of them being also much longer.


We can see that disabling LSO resulted in a moderate performance decrease for LWEP: a 4% drop for end-to-end performance and a 10% drop for Tx performance.

for Netperf TCP, it was much more signi.cant: Bandwidth dropped from over 834 MB/s to 401 MB/s.


Many studies [2-5] suggest how to save the energy of sensors.

that kind of methods has the limitation: sensors will completely consume their energy sometime.


The i-th .nger table entry points to some nearby node whose ID lies in the interval [n+2i-1 ,n+2i).

the following theorem holds for LPRS-Chord:  Theorem 1.


WLAN systems can easily provide access rates on the order of several Mbps and a much smoother end-user experience than wide-area wireless systems.

their coverage is limited, mostly restricted to hot-spot areas (e.g.


In Zee, we build on the key idea of particle .ltering by augmenting particles to incorporate not only location but also other unknowns such as the stride length of a particular user.

in other respects, Zee differs from the SLAM approach.


Results obtained in November, 1999, showed a relatively small fraction (15%) of 700 popular Web sites using more than one server to serve content for their home pages [14].

in August, 2000, we did a follow-up study of the home pages for 312 popular sites (not a strict subset of the previous set) and found that 63% of these sites used more than one server to serve the objects on the home page.


It also consumes more power, as compression is typically required before transmission.

the influence of image compression is missing in the above algorithms.


At nearer distance, or in the case of DR mode, there appears to be some value in retrying ACKs a single time, though the chance of success is generally below 15% even for DR mode.

when using HS or STD mode, the chance of a successful retry is very low beyond six feet, dropping to below 5%.


These protocols rely exclusively on local one-hop neighbor information and do not employ any kind of .xed infrastructure.

both were designed to perform directional data dissemination and they are used solely for highway environments.


2.2.1 Node elimination Sensors have three localized neighbors are able to localize themselves by triangulation.

this method will generate aggregatedlocalization error.


This is a signi.cant delay for the transmission of PrRtAdv message and can lead to intermittent connectivity or poor performance.

50 packets is a typical value for the bu.er size.


In classical sensors, the placement of the nodes and the network topology need to be predetermined and carefully engineered.

in the case of modern wireless sensor nodes, their compact physical dimensions permit a large number of sensor nodes to be randomly deployed in inaccessible terrains.


However, a common assumption of the aforementioned worksisthatnodes arestatic andhaveat anyinstanceglobal knowledge of the network state.

in the present paper multicostroutingisimplementedin afullydistributed fashion, andmobilityistakeninto accountbothintheimplementation of the algorithm and in the performance results taken.


Of course, virtualisation is nothing new: IBM s CP/CMS[4] provided virtual machine support in the late 1960s.

only recently has PC hardware become powerful enough to make running multiple virtual machines on one inexpensive box a practical proposition.


It shows that mobile phones can be charged remotely, while in the user s pocket by applying the concept of MIMO beamforming.

unlike MIMO beamforming in communication systems which targets the radiated .eld, we transfer power by beamforming the non-radiated magnetic .eld and steering it toward the phone.


This is viable, as state-of-the art UAVs can have an optional lightweight high-resolution camera [4].

this large-size data cannot be delivered in real-time by means of, e.g., the 802.15.4 communication protocol used in modern solutions to control the UAVs.


In [18], the authors proposed a localized version of CGA called DDA.

dDA requires a huge number of messages, which is a major drawback for a real application in ad hoc networks.


Note that the total storage of EBF is too large to possibly fit on chip, necessitating back and forth off-chip communication during lookups.

the total storage space of Chisel is small enough to fit the entirely on-chip (with technologies such as embedded DRAM), and in fact is only twice as large as just the on-chip storage requirement of EBF.


It is aimed to facilitate neighbor discovery, e.g., control signaling, exchange of local measurements, channel sensing etc.

such CCC existence in cognitive radio networks (CRN) may not be always feasible.


Table 3 shows results of a 3-class classi.cation combining own class, and could happily co-exist with bulk data.


it seems that having such threshold is not helping, at least with the random mobility model.


Existing tools, especially tools built into the OS and the router, require users to have the sophisticated technical knowledge of networking.

many non-expert users in our study did not have such sophisticated technical knowledge of networking.


We argue that heterogeneous MAC implementations can adversely impact WLAN operations leading to unfair bandwidth allocation, potential break-down of related MAC functionality and difficulties in provisioning the capacity of a WLAN.

on the positive side, MAC level heterogeneity can be useful in applications such as vendor/model level device fingerprinting.


In Slashdot, r * rises quickly from 50Kbps to 400Kbps when K increases from 1 to 1.5.

there is no visible bene.t to make K larger than 4.


Speci.cally, for two users with available channel sets Vi,Vj , [12] guarantees rendezvous in O(|Vi|2) (suppose |Vi|= |Vj |) time slots when each user has a distinct identi.er and [7] guarantees rendezvous in O(|Vi||Vj | log log n) time slots.

all these works are proposed for singleradio CRN setting, which means each user can only access 1 channel in each time slot.


Information may only be kept when a device switches across different RNCs or even LACs (Figure 1).

it is technically and economically feasible to keep information at the BTS level if it proves useful.


This kind of aggregation is typically accomplished by applying an associative and commutative operator to values supplied by group members.

if the group is large, it is impractical for a single node to collect all the input and perform the computation; if the group members are anonymous, it is di.cult to impose a structure that would allow the result to be computed by the group in a distributed fashion.


Composition Theorems Without Pre-Established Session Identi.ers Ralf Küsters University of Trier Trier, Germany kuesters@uni-trier.de ABSTRACT Canetti s universal composition theorem and the joint state composition theorems by Canetti and Rabin are useful and widely employed tools for the modular design and analysis of cryptographic protocols.

these theorems assume that parties participating in a protocol session have pre-established a unique session ID (SID).


The FAIN approach does not have such objectives.

if the semantics of a FAIN slice is agreed among the ISPs and subscribers, a network optimized for a speci.c purpose can be realized.


One possible solution would be to attach each sensor node to a surface buoy, by means of wires whose length can be regulated to adjust the depth of each sensor node.

although this solution enables easy and quick deployment of the sensor network, multiple .oating buoys may obstruct ships navigating on the surface, or they can be easily detected and deactivated by enemies in military settings.


Third, as we increase M, the numbers of U3 increase for each case.


We hope that as a group, those trained will act together to supervise use and mitigate against use of the voice services by the TA at the exclusion of other community members.

we are very aware that although younger people in the community tend to be critical of the TA, they are also reserved in voicing critique and may be shy when visiting an elder s home.


Dimensioning has not been much investigated in the context of wireless multi-hop networks.

dimensioning is closely related to capacity modeling of wireless multihop systems, where the most important aspect to adequately capture is the impact of interference.


quirements are high or where macrocell performance is low.

it is very di.cult to predict the optimal locations of these nodes [11].


This node continues to check whether the route content field of RD-request includes its address; if so, the node discards this RD-request to avoid the infinite loop.

if the address of this node is not included in the route content field of the RD-request, the node will then check whether the value of n is not smaller than three, or whether the timer, Tc, is timeout; if so, the node will discard this RD-request.


UMA allows a cell phone to use a Wi-Fi connection if available.

the Wi-Fi device always needs to be enabled to receive incoming calls.


In order to achieve better energy-e.ciency, theMACproposesthebeacon-enabled mode in which all nodes have the same active period.

this energy saving facility has an impact on the goodput of the network.


SDN proposals introduce several solutions to separate control and data plane in enterprise networks [5, 16, 21, 31].

much less e.ort has been put into congestion control adaptation for this new environment; most proposals focus on routing and forwarding feature and ignore the advantages that SDNs provide in congestion control domain.


recommend that MinChannelTime and MaxChannelTime can be set to 1ms and 10.24ms separately.

using the same .xed MinChannelTime and MaxChannelTime for all channels is not suitable, because we canpredict the next available channelsaccordingtotheformerscanor receiveneighboringAPs information from the current AP using inter-AP communication.


8(c), kernel executions are overlapped, which helps us to take more advantages of GPU s parallel architecture.

memory copies from the device to the host are blocked, which makes the process ing time even longer than that without concurrent kernel executions (Fig.


So far, formal treatment of scheduling and channel assignment problems in multi-hop wireless networks has typically boileddownto coloring or matching problems, or variants thereof [25].

while the notion of colors may be suitable to model channels of prede.ned bandwidth, modeling variable communication networks with variable channelwidths is more complicated.


Three di.erent approaches are proposed in [11], two synchronous approaches focus either on TTR minimization or even distribution of the rendezvous points in terms of time and channels, and third approach being an asynchronous method.

the last one is designed for systems with only two distinct RDV channels (randomly chosen from a set of channels), i.e., one selected based on minimal cyclic QS, second based on majority cyclic QS, and other/s selected randomly (for remaining slots that do not belong to any quorum set) from the list with other available channels.


In the case of TME nodes, observed opinion prevents the routes from being established through malicious neighbours.

the PDR increases for both TME and AOMDV nodes as they become mobile, which can be confirmed by the reduced packet loss in Figure 2(e).


For low values of BER all protocols performs relatively well close to ideal frame quality.

as BER increases, the performance of IEEE802.11 ARQ and HARQ-Idramatically decays andfalls below HARQ-II.


Each slave has its own FST maintained locally.

the master has in addition to its FST, a copy of each slave s FST.


Now every frequency that is hashed into a bucket that changed gets a vote.

since the .lters are co-prime, frequencies that hash to the same bucket as f in the .rst .lter and get a vote, will hash to a different bucket in the second .lter and will not get a second vote.


After observing Lemma 1, the reduction to Massouli´e s proof is straightforward.

to this author at least, it was surprising that the multi-class  -system can be reduced to a single-class system in this way.


The smaller the cluster size, the more information is lost by the cutting.

a smaller cluster size is bene.cial in practice as it reduces the overhead to narrow down the candidate sectors, i.e., it improves the localization granularity.


After a connection is established, the application can send and receive using OS-bypass and there is no further virtualization overhead.


Exploiting adaptive techniques for the goal of maximizing throughput is considered in [1]-[5].

the use of these techniques for the goal of minimizing BER has not been considered yet.


The priority-based channel access method flexibly helps to guarantee QoS requirements of different applications [1].

if many devices are in a WBAN network and each device generate amount of traffic, contention complexity is increased and it may cause more power consumption.


Such trees can provide greater compression ef.ciency than an SPT.

aggregating along these types of trees may force nodes to transmit data away from the sink, so that gains provided by the increase in de-correlation are offset by increased transmission cost.


The physical size and signal coverage of a small cell can be as small as a home Wi-Fi router.

unlike Wi-Fi, small cells operate in licensed frequencies in conjunction with a pre-existing cellular operator s backend, relying on it for authentication, billing, roaming, and interoperating with the PSTN.


In this con.guration of WMNs, we can achieve high throughput since we can reduce interference among channels.

it is di.cult for mobile nodes to maintain connectivity because they have relatively small cells with di.erent channels and do not have any shared channel like cellular networks.


We de.ne the cost of communicating from u to v using radius R as cR(u, v)= R2 .

(1) For example, the cost of sending a packet from u to v at a .xed transmission range R0 is ( R02 , if ||u - v|| = R0 cR0 (u, v)= (2) 8, o.w if the transmission range can be chosen anywhere in the range [0,Rmax], then the cost of sending the packet is ( ||u - v||2 , if ||u - v|| = Rmax cR(u, v)= (3) 8, o.w The cost function in (1) captures both energy and throughput related e.ciency.


Thus,one can argue that this is the optimal bandwidth allocation.

in Figures 2-(c) and (d),we describe two feasible associations,in which each user get at least 1 unit of bandwidth.


In our proposed algorithm with n =1 and d=1 dB , the received CIR is not always bounded within the convergence region since the requirement for system stability reducing the bound is not always fulfilled.

when n =2, c =1 , and d=1 dB , the received CIR is always bounded within the convergence region .


this benefit can be different to upstream peers.


This enables an automaton Regular[j], to start sending out regular ARP requests packets with the senderIP .eld set to IP[j] and the targetIP .eld set to an arbitrary linklocal address.

even when a host is using an IP address still at any moment a con.ict may arise.


One way to handle such heterogeneous subcarrier quality is to use different modulation andPHY-layerFEC on each subcarrier(e.g., as in [24]).

this may require mapping the symbols within a PHY FEC group onto the same subcarrier, since different subcarriers may simply use different FEC codes.


The individual TCP-v pipes perform congestion control and loss recovery just like regular TCP.

any segment transmission by a TCP-v is preceded by an explicit call to pTCP requesting for application data.


The small triangles/circles/lozenges alongthe curvesindicatethejumps ofthe CDF curves; hence they reveal furthermore that there is a signi.cant number of various non-canonicalkeylengths,i.e.,keylengths that are neither apower of 2(e.g.,2,048) nor the sum of twopowers of2(e.g.,768).

their shareis extremely small, as the CDFlinesdo notexhibit any signi.cant changes attheselocations.


This association induces a load of Y = 1 on all the APs.

from Example 3 we know that a min-max fair LP2 looks for an association X that minimizes the overall load on all the APs subject to the constraint that the load on each AP is no higher than Y .


Various objectives can be met within the same framework.

this .exibility comes at a cost: our solution is not strategyproof or incentive compatible in the game theoretic sense.


On a high level, since the iterative algorithm is formulated as an over-constrained system with a large number of relative proximity constraints, the optimization problem will turn out to be infeasible due to the outliers.

the majority of the relative proximity constraints are correct and will coherently converge.


In the fourth experiment, we find that in the less-frequent-update scenarios (Fig 27, 28 and 30, 31), PCC still outperforms DynTTR considering the traffic overhead, whereas DynTTR is a little better considering the consistency.

in the more-frequent-update scenarios (Fig 26, 6 and 28, 7), DynTTR outperforms PCC in both consistency and traffic overhead.


In summary, they show that, theoretically, a 1 + E approximation ratio for the construction of DS and CDS is feasible.


In Figure 5a, after turning back, if Sm is able to hear from Si, it can proceed the second stage of .nding the direction.

if Sm still could not hear from Si after turning back, Sm is moving on the tangent line of the circle.


For instance, source compression based on Slepian-Wolf coding has been studied in [13] and [14], motivated by the goal of reducing energy consumption in WSN by reducing the number of bits sent.

in contrast, as shown below, the scheme C utilizes a simple trade off between the number of nodes in a CHCN and the amount of bits sent utilizing the division of responsibility across the nodes.


identi.ed that these applications exploit TCP .ow control to generate bursty tra.c [6].

they cannot escape the TCP .ow control packets in between two bursts and hence power consumption is high withcellular networks.


We distinguish attacks due to excessive use, in which the adversary only acts as an ordinary participant, but can deplete the resources of honest principals by repeated execution at lower cost.

there are instances of malicious use where the adversary interferes with the protocol, resulting in at least one message reception di.ering from normal use (more formally, we consider violation of injective agreement [14]).


The CVSS (Common Vulnerability Scoring System) [1] is a tool to quantify the severity and risk of an individual vulnerability to an information asset in a computing environment.

a software product usually contains multiple vulnerabilities, and CVSS could not be used directly to assess the security level or trustworthiness of a software product due to its design goal targeting individual vulnerabilities only.


CELLULAR ASSISTED MOVEMENT DETECTION There is a straightforward way to implement our power-saving scan algorithm which requires location: first obtain the geographical location for mobile phone, and then calculate the distance of the locations.

localization at meters granularity for both indoor and outdoor is not easy: existing GPS (Global Positioning System) only works at outdoor and it costs additional power to obtain location information continuously.


Even if the switching time is not constant, as long as the pattern of the interferenceispersistent(e.g., onedatapacket,followedby one ack), the MIMO node can monitor the medium and immediately switch every time the mediumgoesidle.

if the receiver of the competing technology is not bidirectional, an 802.11n device has no way to compute its channel ratio, and hence cannot cancel its signal at the receiver of the competing technology.Theimpact of suchinterference willdepend on the competing technology.


We do not wish the results here to be due to artifacts in the data, but the above problems make it seemingly impossible to generate a realistic, completely consistent set of test data.

[4] presents an alternative methodology when testing their estimation algorithm, which we adapt here.


We have that DNP = -1 when all nodes are always distant by 2*MAD (i.e., the maximumdistancebetweentwopointsinthescenario).

the smaller the distance between all nodes, the closer DNP is to 1.


In addition, many communication protocols of sensor networks are built on the knowledge of the geographic positions of sensors.

in most cases, sensors are deployed without their position information known.


The SAPSM system is designed to work autonomously without assistance from the Operating System.


Comparing SSCH to IEEE 802.11a, we see that the SSCH discovers routes that are comparable in length.

the average route discovery time for SSCH is much higher than for IEEE 802.11a.


The above argument ignores the channels of the backscatter nodes.

recall that backscatter nodes transmit in a narrow band(= 640 KHz) [14] and hence their channels can be modeled as a single complex number (i.e., a single tap channel) [46].


The villagers used our network for more than a month for real-time voice calls, and our fault-tolerance mechanisms turned out to be quite useful to sustain the network deployment over this period.


As a result, at most 625 bits can be transmitted in a single slot.

to change the Bluetooth device from transmit state to receive state and tune to the next frequency hop, a 259 µs turn around time is kept at the end of the last slot.


On one hand, they represent an interesting scenario for several applications related to marine and oceanic monitoring and surveillance.

being based on acoustic communications, they involve several challenges, foremost the propagation medium, which is both extremely hard to capture from the modeling standpoint and also quite dif.cult to utilize in an ef.cient manner.


In this way, many nodes in NATed LAN connect to the nodes on the Internet shar ing a few global IPv4 address.

it is impossible to access a node inside NATed network from the outside of it s network whereas a node in NATed network can access a node outside it.


When the intermediary-node is on the optimal path between both ends, the path stretch will be 1.0, but, most of the time it may not be the case, if we assume that the intermediary-node is in a fixed location while the end-nodes are free to move in a large scope.

when the locations of intermediaries are not fixed, path stretch may be kept relatively low, with the cost of generating more mapping dynamics.


Hence, the vector Sm cannot contain a 0.

while comparing Sm to a Si, entries of Sm, corresponding to 0 entries in Si, are forced to be 0.


It turns out that these two performance measures are two speci.c instances of a natural family of performance measures (hence the complicated notation) with the most immediate interpretations and relevance.

by themselves, they reveal only a partial picture of DPF performance, and the other metrics serve to complement and provide a more accurate evaluation.


The current OM-NeT++ implementation distinguishes the di.erent bitrate applied at the PHY header and the MPDU, as de.ned in the IEEE 802.11 standard.

only a single minimum SNR value is used, which can lead to di.erent BERs compared to evaluating all phases with di.erent SNRs.


As such, code-base diversity is very e.ective and requires only three instances to be run concurrently.

e.ectively evaluating this is challenging, as bug reports typically do not contain information about whether inputs triggering the bug would cause other code bases to fail.


However, the nature of the wired area of 3G/LTE macrocell networks, which are intended for many users, results in a very limited bandwidth for each mobile user.

microcells, such as IEEE 802.11 wireless LANs or femtocells, are expected to provide larger bandwidths to mobile users.


The graphs show that by adding one or more sources to the single FTP, the transfer time lowers by a good percentage.

it showed less significant improvement after the third and fourth source were added due to competition among the sources and bandwidth limitation despite the presence or absence of the traffic.


Note that the traces are not synchronized because they may not have been taken at the same time.

this does not a.ect the experimental results because the underlying nuclear disintegrations follow a memoryless Poisson process.


are the bids expressed by bidder i and view the access allocation problem as the problem of maximizing the revenue of the auctioneer.

our framework applies without change to the problem of maximizing social welfare.


The best case occurs if the mobile end-user receives the beacon signal of the next RAU in the leftmost point of the overlapping area between the adjacent cells.

vCZ acts better for sure, but the same problem may occur in the overlapping areas between adjacent VCZs as depicted in Figure 5.


We could observe that wireless communications regularly lose packets due to the reliability of the radio channel.

other external events are added to these random losses whose origin comes from moving obstacles (door, window .


When a station holds its position at P1, the SFER remains almost zero in all subframe locations regardless of the employed MCS, because the channel quality between AP and the station is considerably good.

when the station moves at an average speed of 1 m/s, MCS 4 and MCS 7 employing both amplitude and phase modulation (i.e., 16-QAM and 64-QAM, respectively) show higher SFER in the latter part of A-MPDU, while MCS 0 and MCS 2 which use only phase modulation (i.e., BPSK and QPSK, respectively) achieve stable SFER across the entire subframe locations.


b) If the predict_depth is less than one dimensional aggregation level, it will not generate any false negative, but it will generate false positive due to the missed counting of its child node.

when we set the measurement interval to a small period, we think such degradation of detection is tolerable in real network management environment and can be detected in the next measuring round.


= 0.7, the attack detection rate remains high even with four antennas.

the client false alarm rate does increase a little bit with fewer numbers of antennas.


Therefore, special treatmentof the graph is required by a variety of network algorithms and protocols.

in particular, many geometry-oriented algorithms depend on atype of subgraph called Delaunay triangulation.when location information is unavailable, it is nontrivial to achieve Delaunay triangulation by using connectivity information only.


As a result, the time series exhibits spikes during idle periods.

the jammer kills all the channel activity, causing a low variation.


We see that multipath propagation in the indoor AP scenario does degrade the accuracy of direction estimation.

the degradation is nearly negligible for Borealis.


These issues can be mediated by tightening the tolerances which dictate the stopping criterion for the optimization routine.

the approach can quickly reach the relative .oating point accuracy of the numeric solution.


Real-Time Ethernet-based protocols (RTE), such as PROFINET, EtherCAT, Ethernet POW-ERLINK and TTEthernet, are emerging as the de facto communication technologies for NES, taking advantage of the appealing attributes of the underlying Ethernet technology.

currently available RTE protocols do not employ e.cient server-based scheduling policies, e.g., policies as those developed for CPU scheduling.


What smaller collections are that lower number of Event Sources is tracking changes on each one of them.

since XML processing methods are out of scope of this paper, it is left as a future work to .nd out the most scalable solution.


Both apply consistent hashing, referring to other e.cient peer-to-peer-systems like CHORD, CAN, or Tapestry [7, 15, 17].


Hidden links are typically revealed if we build AS maps using continuous data (e.g., BGP updates) collected over an extended period.

a problem of this approach is the introduction of potentially stale links; that is, links that existed some time ago but are no longer present.


Despite the rate control, at 80% load, the high initial .ow rates and aggressive retransmissions cause a ~4.3% packet drop rate in the fabric (excluding drops at the source NICs which do not waste bandwidth), almost all of which occur at the last hop (the destination s access link).

at such high load, a small amount of wasted bandwidth can cause a disproportionate slowdown for the large .ows [4].


Thus, a single choice along the axes of power, cost, or reliability will result in a sensor network that sacri.ces one or more of the key requirements.

by employing different elements to perform tasks with different requirements, multi-tier networks provide a better balance of cost, coverage, functionality, and reliability.


Packet simulations show that in terms of packet delivery ratio, delay, and the number of route failures, these techniques result in performance that is better than AODV and AOMDV, a multipath version of AODV.

the presented technique does result in more overhead.


It is because the throughput changes in the single cell of tier 0 and the six cells of tier 1 offsets each other.

as we have seen, the throughput improvements of the hot-spot cell can be signi.cant, as shown by Fig 10.


MOB reaches 29 MB/s by using piece exchanges instead.

the overhead of this approach increases with the number of nodes per cluster, which is the reason the throughput of MOB decreases a little when 8 or 16 nodes per cluster are used.


Under this circumstance, 5-AoA does not exist, but all 4-AoA cases still allow the middle rule to be applied.

a user cannot break C3 anymore, leaving the ambiguity between Figure 11(f) and (g) unsolvable.


Speci.cally, selfP uses periodic Hello messagestolearntheirimmediate(1-hop)neighborhood, andfrom thatdecide which nodes shouldforward a message.

indominantP,the Hello messagesincludeinformationabout the 2-hop neighborhood (i.e., each node can learn who are the neighbors of its neighbors).


Deploying such a network incurs formidable hardware cost.

note that NEMOx s scalability mainly relies on its intercluster MAC, whose properties can be faithfully captured by the C++-based MAC implementation.


For example, in the powerful RAPID protocol [1], it even need record the history of every forwarding operation to provide a more precise prediction.

it costs excessive storage to track encounter history, which make RAPID su.er from degraded performance in storage-limited conditions.


It uses a download policy where each client chooses a data block that is least replicated among its neighbors, which in no way guarantees that data will arrive in any approximation of the correct order.

all of our results hold for any download policy.


This again is intended to reduce CPU utilization.

when GRO is used to combine multiple acknowledgements of a downlink TCP flow, the server s congestion window increment is very large and causes a burst of packets to be sent.


The algorithm assumes that each base stationknowsthelocations of all thesensor nodes, and the heuristic assumes that each base station only knows the locations of its neighbouring sensor nodes and other base stations.

averageEuclideandistanceis not agood objective function.


This exponential backoff of the RTO enables TCP to handle network congestion gracefully.

in a MANET, the loss of packets (or ACKs) may be caused by temporary route loss as well as network congestion.


In conclusion, the High-Bandwidth topology is more scalable, has higher path diversity and can provide higher bisection bandwidth compared to the No-Stretch topology.

the topology might incur some additional latency in doing so.


This infrastructure is used for short distances, dedicated to an area with access points, and o.ers a limited mobility to the smart device.

cellular air interfaces are providing another entry point to the Internet that is used to access a P2P network.


The IP average delay of the proposal is low, and is stable.

that of the others increase as linear, and become much higher than that of the proposal.


A six-node TWIN MAN: .bre infrastructure (left) is used to create destination rooted trees (right); dashed lines represent the multipoint to point lightpath serving router R1 .

each source receives grants from several destinations and may not be able to ful.ll all because it has only a limited number of transmitters.


This motivates the need for a deeper study of the internal structure of social graphs to design an unbiased technique to sample directed OSNs.

the bias of these techniques towards high degree nodes gives a simple instrument to crawl high degree nodes, which correspond to popular users in the OSN.


In many cases, the conductance of the seed set is so small that random walks are necessary to expand the seedset [12], [13], [17] because expansion is impossible otherwise.

random walks are closely related to conductance: If the conductance of the target community is high, a random walker is less likely to remain inside this community.


The API described in this paper resembles to the CAST interface which is part of the common API effort[11].

the underlying semantics have notable differences: zone-local serializability, and the presence of multiple roles.


Recently, to improve the security and mobility management, Li and Chen [11] proposed a Hierarchical Agent based Secure Multicast (HASM) algorithm to efficiently support secure mobile multicast in WCNs.

this study did not include QoS provisioning within the gateway inclusion.


In this case the value gxy is not even well-de.ned.

since in this case we will have that the value X = g x was chosen by a real (and honest) player then the value Y x is well de.ned and it is this value that we actually refer to as the right gxy (conversely, when X is the value chosen by the attacker and Y = gy is chosen by the honest player then the real value of gxy refers to Xy).


Underwater localization can be achieved by leveraging the low speed of sound in water, which permits accurate timing of signals, and pairwise node distance data can be used to perform 3D localization, similar to the 2D localization demonstrated in [16].

low-complexity acoustic techniques to solve the underwater localization problem with limited energy expenditure in the presence of measurement errors need to be further investigated by the research community.


While ABK and certified addresses could be used for the same purpose, the advantage of CGA is that it requires no trusted entities.

cGA does constraint the choice of the IP address while ABK does not.


The accuracy of the TOA-based and AOA-based localization methods degrade significantly when the node does not have a line-of-sight (LOS) signal from the base station.

the accuracy of localization can be improved by fusing both TOA and AOA measurements from neighboring base stations (hybrid measurements) [1]-[3].


Considering di.erent data packet delivery of the di.erent parts of the stream which may provide di.erent quality level, we introduce an important factor Wp to indicate the importance of data packet p. Our goal of minimizing the overall weighted latency is translated into minimizing the sum of weighted latency for all packets in the system: X Min DpNpWp (1) p.Packets in the system The most intuitive way of scheduling is to queue the data based on their received order, or in the reversed order to push out the latest information.

when the connection bandwidth could not satisfy the data rate temporarily because of congestion or .uctuation, data will be delayed at peers.


When coordination across sectors is allowed, these sub-channels would be further chosen so as to avoid interference between sectors.

in the absence of any coordination (for scalability), the sub-carriers constituting the sub-channels in the carrier can be permuted differently across sectors.


Both NMF and k-means algorithms have higher false negative rate when the noise level pr ishigherthan0.25(whichis unlikely tobe observed in practice).

the false positive ratio of NMF algorithms is almost always less than 0.1, and has smaller standard deviation than the k-means algorithm.


If all sensors have ri = 0, the calculated output map can arbitrarily be translated, rotated, and .ipped without a.ecting its cost S. The purpose of the map is to show the relationships between sensors data, and as such, translation, rotation, and .ipping do not change the meaning of the map.

if the user will view many maps in sequence over time, it would be confusing if each subsequent map was nearly identical but with arbitrary rotation.


In the power breakdown of mobile handsets, wireless communication components, including Wi-Fi and cellular network interfaces, account for a prominent part of the overall power consumption [3].

network throughput of cellular networks has been increasing signi.cantly in the recent years.


Signature-based traf.c classi.ers [2], [3], [4], [5], [6], [7] identify applications from network traf.c by inspecting packet payloads (i.e., application data).

packet inspection creates some privacy concerns, and it is dif.cult to conduct when the data is encrypted.


Without further modi.cation the listed techniques require the underlying network to be modeled as a unit disk graph.

by using the concept of virtual edges [1, 16] these methods can be employed in quasi unit disk graphs as well while the above listed structural properties remain the same.


This is generally the case for packets carrying embedded object data.

when packets arrive later than expected due to network congestion, i.e., after a client poll, they are delayed until the next poll.


Second, .ltering of WRAP packets can be done with conventional wire-speed .lters (similar to TCP/UDP-level .lters).

relaying or .ltering of traditional LSRR packets incurs the overhead of processing the variable-length IP options .eld, which typically requires forwarding the packet to the router s CPU [3].


At any point that CH is not able to detect target or its TFP is more than other nodes with a safe threshold, it broadcasts a Resign Message and sends integrated video data to CC (the data which was not sent previously).

in some cases it is impossible for CH to send Resign Message to members because of not having any connection with the cluster.


Since TCP port ranges are not directly supported by Open.ow, our interpreter checks most TCP port ranges by reading the port value and then performing the test using program logic.

if the range consists of all ports the interpreter omits the check, and if it consists of a single port the interpreter performs an equality assertion.


From this table we can conclude that both properties (price subadditivity and 102 102103 104 105 104 106 the 95th-percentile billing) in.uence the total savings by a non-trivial amount.

the exact breakdown of the impact of these two properties on the total savings depends on the volume of the tra.c and other factors.


VLAN X elec is used for traf.c going through this low speed packet-switched inter-rack network.

we emulate an optical circuit switch connecting the logical racks using the internal switching fabric of the .rst Ethernet switch.


, e7)ensure unlinkability in themselves.


Furthermore, multimedia items are often already available from several locations and in multiple formats and resolutions.

in the restrictive model of URL based references, consumers have no way today to leverage this broader availability of content.


Then C1m is augmented to become a k-m-CDS sequentially.

this algorithm is not easy to implement due to the di.culty in .nding all the k-blocks or k-leaves from a graph.


Afterwards, the configuration of an IP address for intra-PAN communication, so-called PAN scope address, is performed; this approach guarantees stability with respect to IP connectivity within the PAN, since such IP address is maintained independently of potential changes in the PoA of the PAN.

in order to acquire external access through the current PAN gateway, for IPv6 each device dynamically configures a global address; for IPv4, the PAN scope address can still be used as the PAN gateway performs NAT.


The long standing benchmark of reproducing realistic pairwise statistics (e.g., contact and inter-contact time distributions) is today mastered by state-of-theart models.

mobility models should also re.ect the macroscopic community structure of who meets whom.


This is due to the compensation module that refrains transmissions of error-prone packets.

delays remain under the maximum tolerated values.


In a highly mobile environment this load may be very high.

infrequent exchange leads to stale information in the neighbor tables, and as a result to ine.ective routing.


Overall, NAMA-UN performs worse than its counterpart of static scheduling, while PAMA-UN is better than the static link scheduling algorithm in UxDMA.

pAMA-UN cannot endure high contention levels in multihop networks due to conflicts in code assignment.


It aims to provide the best possible estimate of the aggregate even if nodes move or fail during the process.

dynamic CountTorrent is meant for continuous query aggregation in the sense that as nodes move, leave or join, they update the data structures such that the query aggregate should re.ect the current network con.guration at all times.


Most of the sensor network middleware solutions are good at providing high-level features such as querying which deals with internal data structures.

the biggest problem is getting the sensor data from the sensor hardware devices into middleware solutions.


This in fact has spoiled the LB-SO scheme by allowing it to initiate even more handovers from the overutilized high power cells towards the underutilized low power cells, and therefore causing more call drops.

the CAC-SO scheme is no longer blocking as many new calls as it used to do before.


Using Deltas for Literals: Applying gzip to compress the literal data allows us to exploit repeated patterns within the literals.

matched data and unmatched literals also share many repeated patterns since they are part of the same content.


We note that we assume here that a ratee can be globally identified throughout all communities.

the raters only need to be indentified within their community where their credibility is supposed to be known.


Note that the trie-based approaches can also reduce the latency by using multi-bit trie.

this reduction comes at the cost of memory explosion, and thus, results in a very poor memory e.ciency.


The performance of our proposed resource allocation algorithm (with and without optimal power allocation) is close to the optimal solution.

the performance gap between our algorithm with optimal power allocation and that with uniform power allocation becomes obvious with the number of subcarriers.


Looking to the future, it is likely that high-speed 3G cell phone technologies such as EvDO will eventually reach rural areas.

rural areas are usually poor, so it is unlikely that high-speed data services from cellular providers will be o.ered any time soon.


Management in a voice content system is minimized, as provisioning a new endpoint consists only of giving that endpoint a credential.

voIP con.guration requires setting the mapping from callee identity to endpoint IP address at multiple points in the network, each time that IP address changes.


[6] derive the minimum separation distance between simultaneous cochannel transmitters while maintaining a desirable SINR at the receivers.

they only consider the directional transmissions and an ideal MAC protocol is required to maintain the optimal transmitter separation distance while minimizing the interference [7].


If this recommendation was followed, MOAS conflicts would not occur, with the possible exception of a few unique cases discussed further in Section VI-D. Berkowitz[ 131 discussed the potential causes of Huston uses the term multiple-origin prefixes in place of our term MOAS conflicts 31 MOAS conflicts.

the discussion is not complete and no implications of MOAS conflicts are analyzed.


This can lead to somewhat erroneous results when a handover takes place during a measurement interval and the sector bandwidth changes.

this represents less than half a percent of all throughput measurements and is assumed negligible.


Ideally, all range estimates should be acquired at the target localization time Tloc.

because communication occurs over a shared channel, medium access control (MAC) has to ensure that excessive collisions are avoided.


The increased delay can lead to a drop  66 x 10 x 10 3 3 0.025 0.025 2.5 0.02 0.02 2 0.015 0.015 1.5 0.01 0.01 1   Throughput (bits/second) Throughput (bits/second) 0.005 0.5 0.005 0 Figure 2: Slight decrease in throughput due to the rate anomaly problem.

because the low data rate link transmits for a much longer duration, the end-to-end delay is increased signi.cantly for both links.


Using commodity WiFi hardware for non-WiFi RF device detection: Commercial spectrum analyzers or software radio platforms have specialized capability of providing raw signal samples for large chunks of spectrum (e.g., 80-100 MHz) at a .ne-grained sampling resolution in both time domain (O(105) to O(106) samples per second) and frequency domain (as low as 1 kHz bandwidth).

commodity WiFi hardware, can provide similar information albeit at a much coarser granularity.


Note that a doubly extended RS code outperforms the proposed scheme in [2].

the difference becomes negligible for KI max > 10 .


Achieving the throughput .gure for arbitrary networks involves the freedom of placing the nodes and choosing the traf.c patterns.

random network scenarios encompass a uniform distribution of the nodes on the topology area as well as a random destination for each ad hoc node.


In the current setting, both the Internet architecture and IEEE standards are not able to ful.ll the requirements of seamless cognitive radio network environments.

there is something that we can learn from these networks to inspire us to solve the mobility problem in heterogeneous cognitive radio networks.


3.2 Interference Detection A bit rate adaptation algorithm that reduces the transmit bit rate in response to interference losses increases the contention on the channel and exacerbates the interference.

a responsive rate adaptation algorithm that reacts to short-term frame loss rate or BER faces the danger of reacting aggressively to interference.


In broadcast mode, data is delivered to a specified area without knowledge of the receivers and whether there is any receiver at all in this area.

in the multicast mode the receivers have to signal their interest for the data reception to the network and then the network decides whether the user should receive the data or not.


t The traffics in each cell are not necessarily required to be uniform.

from the cell s perspective, we assume that the arrival rate of new NB, new WB, handoff NB, handoff WB follow Poisson processes with mean arrival rate .


On the other hand, the use of sector antennas mitigates this problem yet still results in throughputs as low as 24% of the targeted value of the reference model due to inef.ciencies and signi.cant spatial bias introduced by TCP.

simulations with the Inter-TAP Fairness Algorithm show that a multi-hop layer 2 algorithm can achieve near-perfect fairness and 76% and 71% of the total available capacity for CSMA and CSMA/CA respectively.


Many schemes to parallelize the digital signal processing in BigStation have been previously studied in other contexts [7].

as far as we know, BigStation is the .rst work to parallelize MU-MIMO operations to scale the system to tens or hundreds of antennas.


The retransmission method achieves the best accuracysince all updates are guaranteed to reach the server.

this increase comes at a cost of decreased CR due to the overhead in feature update retransmissions.


Felice et al [6] evaluated various TCP versions such as TCP Reno, New Reno, Vegas and Sack in a cognitive multi-hop ad hoc network under varying PN workload, sensing duration and heterogeneity of channel bandwidth.

they do not consider the impact of channel switching on TCP performance and ignore the impact of channel (re-)assignment on performance.


4.1 Our Proposed Design & Vision Any design would be hard to argue as ideal when addressing the requirements of the system.

we present a 3 phase approach that we believe is a balanced and practical.


If Z is too small, we risk underutilizing the link by not supplying enough packet.

if Z is too large, we may disrupt load-balancing by sending extra packets on low-quality routes.


[47] is based on the premise of e.ciently morphing one class of tra.c into another.

the authors neglected one key element of encrypted channels, namely the inter-packet delay between consecutive packets, from their design scope.


In 1995, the IETF published the first specification of IPv6; the next generation IP designed to address its current limitations and future evolution.

the dearth of significant migration by the Internet community to IPv6 shows an underlying lack of interest (and possibly confidence) in a protocol touted as the definitive successor to IPv4.


S-BGP is considered as a comprehensive routing security solution and has been adopted by the SIDR working group [12].

better solution for BGP security can be adopted in the future because S-BGP is not perfect yet.


Since the session is not present locally nor in cluster C1, MUSC-P is requested to send a SessRequest message, containing the SOBJ (which includes the QSPEC object of the session-flow), towards the source S1 with IP Alert enabled (since C1 is a multi-homed cluster, this message can exit through Q3MA-C or Q3MA-D.

the interior routers forward the message to Q3MA-C.


As in the coarse-grained RTT estimation in standard TCP, fine-grained RTT measurement is taken only for packets that have been sent just once.

there are two interfering factors to be canceled: (i) TCP delayed acknowledgement is widely deployed.


In these cases HotSel performs better than the other two mechanisms.

in all these simulations the performance di.erences between the HotSel and the Random method are not so signi.cant (at most 4%).


If the node does not receive another ECR packet before is up, the node should belong to the backbone td tree, and determines that the node which sent the ECR packet is an upstream link.

if the node receives another ECR packet before is up, the node does not belong to the td backbone tree.


Hence, we focus on supporting reachability queries.

to support other types of queries, it would be straightforward to extend VeriFlow to accept user-provided modules that compute arbitrary properties, given access to the equivalence classes and their forwarding graphs.


In [9], the deafness problem is studied and ToneDMAC is proposed to address this problem.

only one kind of deafness problem is identified in [9].


Thus, algorithms maximizing the lifetime were proposed.

only considering the lifetime must not achieve good delivery rates and a low energy consumption.


As expected, the .xed-delay approach transmits the lowest number of bytes and can be seen as the baseline here.

also the TCP-inspired and the receiver-feedback approach show a similar number of transmitted bytes.


In contrast to the delay-security pairs in [4] that takes no statistical history into account, we adopt a pro.ling scheme based upon the usage history of the end hosts in order to obtain the QoS delay and security levels to be o.ered to U1.

when U1 establishes a connection with U2 for the .rst time, it sends a UDP echo request to U2.As U2 receives this echo request, it sends a response packet back to U1.By computing the Round Trip Time (RTT) for this echo requestresponse operation, the average end-to-end delay between U1 and U2 can be estimated as follows: 1 .avg = · RT T (4) 2 .avg does not provide an accurate information about the individual end-to-end delays along the uplink and downlink directions of U1 and U2.


When Procrastinator does not fetch unnecessary bytes from the network, it should reduce energy consumption by cellular radios since that depends on how much the radio is transferring and how long it is awake for.

when Procrastinator delays the transfer of network objects, it can potentially increase energy consumption  the radio may have gone to sleep due to network inactivity and may need to spend energy waking up, and now the radio may be up for longer than when network objects were batched under prefetching behavior.


Since handoff is performed within a localized Proxy Mobile IPv6 domain, latency of the handoff scenario 1 is lower than that of other scenarios.

since handoff is performed across Proxy Mobile IPv6 domains, latency of handoff scenario 2 is higher than that of other scenarios.


In 1-hop solutions [14, 9, 11, 12] nodes are at a distance of 1 from the clusterhead and the maximum diameter of clusters is 2.

in k-hops solutions [15, 4] nodes can be located at a distance of k from the clusterhead and the maximum diameter of clusters is 2k.


Poster: Reliable TCP for Popular Data in Socially-aware Ad-hoc Networks Hannan Bin Liaqat, Feng Xia, Qiuyuan Yang, Li Liu, Zhikui Chen, Tie Qiu School of Software, Dalian University of Technology, Dalian 116620, China f.xia@acm.org ABSTRACT Reliable social connectivity and transmission of data for popular nodes are vital in multihop Ad-hoc Social Networks (ASNETs).

congestion may occur and hence popular nodes might not achieve required bandwidth when multiple senders share data with a single receiver.


Several technologies, such as I2C, can realize low-power bi-directional communication over single data wire.

they are not applicable to Nemo, which utilizes a single power wire, instead of a dedicated data wire, for bi-directional communication.


In fact, as we will show shortly, a simple XOR operation on the input parameters produces the desired uniform hashing [8].

we found that choice of the input parameters to the hash function is the most critical element in our design.


The communication overhead of the GMAC scheme can be written as the summation of the overhead due to the authenticity tag and the sanitization tags.

according to Algorithm 1, the size of the authenticity tag can be written l nh+s as |t | = l- h. the sanitization ranl tags are vectors in an n-dimensional vector space over Fq.


4.3 Use of the prototype For the tests we chose to use layouts of .ve or seven cubes for the 3D visualization zone.

it can be modi.ed and adapted to the user s needs if necessary.


We have seen earlier that the data quality of the two main IXP repositories di.er, with PCH showing twice as many members as PeeringDB.


It may seem that the OSPF Viewer can perform the SPF calculation over the entire topology, ignoring area boundaries.

oSPF mandates that if two routers belong to the same area, the path between them must stay within the area even if a shorter path exists that traverses multiple areas.


We are confident the corrected speed of light (s) is sufficient since the distance between roaming object and access points would be less than 500 meters at the longest.

now assuming that: tdelay is the delay time in responding to a request; tpropagation is the time required for the signal to arrive to its destination (2 tpropagation will be required for single round-trip); Then; t - t round -trip delay range =× s 2 (22) since there is a small ranging error due to frequency bias in the oscillators used by both access point and roaming vehicle, we can estimate two sources of errors.


Area-based quad-trie is an excellent algorithm in the sense that it constructs a twodimensional trie using source and destination prefix fields for packet classification.

it does not achieve good search performance since search is linearly performed for prefix length.


In OAR, node 1 retains channel access and sends four more packets without any channel contention.

rBAR goes into contention immediately after the transmission of node 1 is completed.


CONCLUSION AND FUTURE WORK This paper showed the feasibility of wireless cut-through transmission.

there are still several other challenges to be solved to make it fully practical: Cut-through transmission, especially the A&F cut-through requires close cooperation among the neighbouring nodes.


In fact, some applications already support download resumption when they change their network attachments.

this necessitates an ad-hoc implementation of download resumption in each application (e.g., HTTP byte-range queries, CGI parameter passing, and so on), which cannot be easily reused by other applications.


Aggressively invoking fast dormancy for target transfers bene.ts Pandora by bringing signi.cant reduction of radio energy by up to 40% with signaling overhead of no more than 5%.

fast dormancy is notapplicable to Dict because the costof achieving a saving of 5% of radio energyis thehigh signaling overhead of35%.


Note that we picked netbooks for this work rather than phones since our current WirelessHART development board has only a serial and a USB interface, none of which can be connected to a phone.

we note that the HartFi system should in future have the WirelessHART interface integrated with either the SIM card or the Wi-Fi card.


In [4], the authors discuss the use of commonly deployed IP multicast protocols in UMTS.

the authors in [3] do not adopt the use of IP multicast protocols for multicast routing in UMTS and present an alternative solution that can be implemented within the existing network nodes with trivial changes to the standard location update and packet forwarding procedures.


CONCLUSION Cognitive wireless ad hoc is focused as a promising future wireless technology.

cognitive wireless ad hoc networks have some di.culties of neighbor discovery and routing.


It is concluded that our approach is adequate for a local area network where the shared keys can be physically distributed.

in larger networks and on the Internet, where most of the m-services applications take place, distribution of secret keys becomes real problem.


We do not restrict the use of this heuristic to DNS.

we apply it to all .ows and pairs where one of the ports is less than 501.


Other e.ects reduce the performance even more.

the gains include being cheaper, easier to install and maintain, more .exible, and valid when the capacity is still enough for actual applications.


the GARP tra.c grows linearly with the number of the correspondent nodes; it is still quite small.


If we assume the following battery drain: transmit-12.96 µJ/byte, receive-16.2 µJ/byte (based on Motorola figures on a 900 MHz transceiver), and 66 mW as the power consumption of M16C chip, the MSRcombined hybrid protocol saves 3.23 mJ on sensor side compared with executing our first hybrid key establishment protocol.

if the message is sent multi-hops, the MSR-combined hybrid protocol consumes more energy at intermediate routers.


Figure 4 presents an example showing destination client A using greedy proxy discovery to discover proxy client D. Greedy proxy discovery protocol relies on the existence of a greedy path to reach a proxy client with high HDR downlink channel rate.

such a greedy path may not always locate the proxy with the best channel rate.


The installation of 204 APs was kicked off in June 2009 and successfully completed by Nov 2009.

the deployment of the regional mobile WiMAX network failed for several reasons.


Techniques from mechanism design [21], are adapted in [35] to make the routing and the forwarding stage incentive compatible.

these techniques are not applicable in opportunistic networks because the complete path from source to destination is not known.


For example, the impact of nodal density is negligible under the sea cave and mine pit models.

the stadium model noticeably bene.ts from higher nodal density, owing to the shape of the area surrounding NSV edges.


A Mobility Management Scheme using SCTPSIP for Realtime Services across Heterogeneous Networks Hyelim Park1 Myungchul Kim1 Sooyong Lee1 Sungwon Kang1 Yongho Kim2 1School of Engineering, Information and Communications University 119, Munjiro, Yuseonggu, Daejeon, Korea {neofaith, mckim, torshong, kangsw}@icu.ac.kr 2InfraLab, Korea Telecom 17, Woomyeondong, Seochogu, Seoul, Korea  yhokim@kt.com ABSTRACT The Session Initiation Protocol (SIP) has been enhanced to support seamless mobility in heterogeneous networks.

it still suffers from significant handoff delays and packet losses unacceptable for realtime multimedia services.


A solution based on graph coloring was first introduced in [4], where a degree of saturation heuristic was used on interference graphs of 10 to 20 nodes.

no actual metrics were used to demonstrate the effectiveness of this approach, which also relied on router communication.


In this case the supernode may act as a back-to-back user agent (B2BUA) and propagate the SIP message to the neighboring peers.

parallel search should be avoided to prevent .ooding the network, except possibly in the case of emergency call routing, such as 911 calls in the United States.


By using fast failover techniques (implemented with the FF tables), the template becomes robust to link failures.

(in the following, we will assume that during the execution of SmartSouth, no more failures will occur.


[5] designs a localized algorithm to divide the network environment into several blocks and prove if each block is with k-barrier coverage, then the whole network is also k-barrier coverage.

the abovementioned previous work didn t find out the specific set of the sensors to achieve the k-barrier coverage purpose.


In particular, there is a crescent interest in using ontologies for modeling context and ontology-based reasoning to implement inference of highlevel context information.

in distributed CAS, ontology-based context models may hinder an e.cient and scalable access to context information [20].


Overall, 430 matches were found (4.8% of all pairs), with 51%, 74%, and 91% of them found respectively for locations within 5, 7, and 10 meters from each other.

there are still many matches found for locations more than 15 meters from each other.


tion angle when directive beams reach their receivers, e.ectively reducing the interference region.


Formal languages are useful tools for specifying parts of protocols.

as of today, there exists no well-known language that is able to capture the full syntax and semantics of reasonably rich IETF protocols.


SenSys 12, November 6 9, 2012, Toronto, Canada.

aCM 978-1-4503-1169-4/11/12 the energy-saving capabilities of traditional Active Database triggers conforming to the ECA (on Event if Condition then Action) paradigm [4] are lacking in the WSN context.


There is also a point beyond which essentially all nodes have poor connectivity.

very distant nodes occasionally do transfer packets successfully.


These postcards, which contain the packet header, the matching .ow entry, and the switch and output port, are sent to servers that store them for later analyses, such as backtrace construction.

in this paper, we illustrate how to develop a tunable Neat Freak for path queries in SDNs.


(dmin = k) holds, but the reverse in not necessarily true.

we can derive a useful relation for the disconnectivity of a network.


With small scale P2P networks, all participating peers are likely to watch live streaming roughly synchronized in time.

as the size of the P2P overlay grows, the viewing point of edge nodes may be delayed signi.cantly compared to those closer to the Encoding Server.


As in CDMA systems, if all spreading codes are truly orthogonal, they will not interfere with each other and act as additional noise.

it is not possible for all the spreading codes to be perfectly orthogonal and some noise will remain.


that leverages mobility properties to facilitate the secure delivery of data in a self organized network [7].

that scheme requires a wire or infra-red wireless link between peers and user participation (to manually authorize the other peer).


The deadline for each frame is determined by adding 33.3 msec to the previous deadline, since the frame rate is 30 frames/sec for MPEG-2 video streams.

if a previous frame missed its deadline, a new deadline is set by adding 33.3 msec to the arrival time of the previous frame.


latency will signi.cantly in.uenced by the distance.

in the SIP environment the increase of the distance between SIP-NMS N and its home server increases will not in.uence the hando.


Thus, a V parameter bigger or equal than 200 means using the shortest path in terms of Euclidean distance.

the lower the V parameter (i.e., from 200 up to 0), the bigger the degree of load balancing o.ered by the backpressure routing protocol.


Once a fault is found, the best explanation for it is obtained by relying on heuristics, some of which are unsubstantiated.

our approach is more systematic, relying on statistical tools; it requires no modeling assumptions, and has been successful validated on data from two modern backbone networks.


Denote the variance of this process by s2 and the average rate by E[N(t -1, t]] = .. X Now, if we were to model the impact of sampling as simply scaling down the original time series {Xt}by a fraction p, it is easily seen that the variance of the new scaled-down process {pXt} should be s2 = p 2 X , i.e., scaling should s2 pX reduce the variance.

in practice, sampling involves removal of discrete points from the process rather than simple scaling.


A complete ns-3 modeling of a practical Wireless Sensor Network architecture with energy harvesting capabilities has been described in [14].

the focus of [14] was to simulate the performance of the particular system under consideration, while our focus is to provide a generic framework to enhance the quality of simulations of energy-aware wireless networks.


2.2 Applying RSD to BGP Analysis Having de.ned RSD, we next seek to apply it to a dataset of publicly available BGP paths so as to compute the RSD between pre.x pairs in the dataset.

computing RSD from BGP data raises some implementation considerations.


Due to the distances between static nodes, there is no link between 4 and the nodes 1 and 2, and also for 3.1, the quality is close to zero most of the time.

the link in the opposite direction, 1.3 changes from a bad to a good quality around the middle of the experiment, and the link 3.2 .uctuates during the whole experiment.


In addition, some novel applications and services, such as local social networking [6], are more naturally supported by opportunistic communication than by a .xed network infrastructure.

to make opportunistic networking feasible in practice, users must accept to contribute, despite their resource constrained phones.


Due to the elimination of co-channel interferences from the neighboring cells, the Reuse 3 scheme leads to an improvement in SINR.

due to the reduction in the available bandwidth, the total cell throughput decreases compared with that of Reuse 1.


This may lead to the false reasoning that increasing T(S)can only decrease the overall aggregate energy.

higher values of T(S) can result in higher energy consumption.


[9], that an important incarnation of an IO is A/V content, Web pages, and email.

to truly revolutionize networking, we argue that the scope should be broadened to include streaming and real-time services, (video-)telephony, and the virtual representation of physical objects.


1 0.8 CDF 0.6 0.4 bit.ipsanIMDacceptsinanadversary spacketheader.Theshield usesthis upperboundtoidentifypacketsthat mustbejammed.

to estimate bthresh, weperform thefollowing experiment.First, a USRP transmits unauthorized commands to the IMD to trigger it to send patientdata.We repeat the experimentfor alllocations inFig.6.The shield staysinits markedlocationinFig.6,butits jammingcapabilityisturnedoff.theshieldlogsallofthe packets transmittedby theIMD as well as the adversarialpackets that triggeredthem.Weprocess theselogs of.ine and,forpackets that successfullytriggered anIMD responsedespite containingbit errors,wecountthenumberofbit .ipsinthepacketheader.Our results show thatitis unlikely that apacket willhavebit errors at the shieldbut stillbe received correctlyby theIMD.Out of5000 packets, onlythreepackets showederrors atthe shieldbutstilltriggered aresponsefromanIMD.Themaximumnumberofbit .ips inthosepackets was2, so we conservativelyset bthresh = 4.


The Automatic Power Save Delivery (APSD) in 802.11e employs data frames, instead of PS-Poll, to retrieve buffered data from the access point thus can power manage very short idle periods [6].

it works well only for traffic with similar data rates in both directions, such as that of VoIP [7].


On the other hand, an area-based quad-trie (AQT) algorithm extends one-dimensional binary trie into two-dimensional quad-trie by considering source and destination prefixes at the same time [8].

aQT algorithm includes empty internal nodes as well as it performs linear search on prefix length as usual trie-based algorithms do, and hence it does not provide good search performance.


Firewall classi.ers exhibit slightly higher overhead than the others due to range expansion.

overall our .ne tree sizes are small, and .t in the control memory of today s routers.


The latter are the annotation functions A has established using possibly different pseudonyms with parties Ii, 1 = i = k. Note that this rule is atomic and cannot be derived from the basic rule and composition of channel rules because in this case it would be only possible to have fI = ki=1 fi.

this would not be in line with privacy-preserving attribute statements.


Second, the increasing core counts on processor chips can easily be utilized by co-locating the servers of such applications on the same physical machine.

this  Figure 1: State-of-the-Art in virtualized I/O subsystems The .rst category.


ii) The PU compensation mechanism is specially designed to turn unqualified PUs to be qualified for that iteration, even with the risk of decreasing the system capacity.

in the simulation it was apparent that when adding the first protection, the number of qualified PUs increased sharply so that only a small number of PUs remained unqualified.


Don t Call Them Middleboxes, Call Them Middlepipes Upendra Sharma Hani Jamjoom Dan Williams IBM T. J. Watson Research Center Yorktown Heights, NY Abstract As interest grows in introducing network functions middleboxes to Platform as a Service (PaaS) clouds, it is tempting to treat them as normal PaaS services.

the PaaS service abstraction lacks su.cient support for middlebox services.


This is fundamentally di.erent from our approach where we synchronize amongst receivers.

we adapt the idea of the probability analysis techniques proposed in the following two papers.


A CFP (as described in 802.11) is also considered a CAP (Figure 2).

with capability to generate CAPs at any time, there is no need for periodic CFPs.


Currently, our routing implementation uses the fact that .nding edge-disjoint spanning trees in fat trees is trivial as each core switch de.nes a unique spanning tree.

this computation is done of.ine, and more complex algorithms for different topologies or applications are possible.


The scheme from the last section is essentially the doing best possible, in the sense that variance of X is minimized for a given threshold Z.

the relative estimation error can be relatively large for colors with small amounts of traffic.


FPGA consumes a little more power but offer the flexibility of software and performance of ASICs along with basic requirement of plasticity in the form of reconfigurability.

the traditional bottom up approach for building large ANN models is no more feasible and wiring along with memory becomes major bottlenecks when considering networks comprised of large number of neurons.


[11] 3.2 Public Internet Marketing Model The evolution of Internet services gives us an excellent opportunity to develop public marketing initiatives by improving the degree of interactivity and individualization between the public organizations and their customers (citizens and organizations).

in order to fully take advantage of this reality, public organizations must start viewing Marketing and most importantly Internet Marketing as a strategic tool for pursuing their mission, and adopt it in a systematic and integrated way from the designing of new products and services to their delivering for the final customers.


For any group in our system, its membership is free to any node which behaves well or is not excluded before because of misbehavior.

the central node will not actively to include all of its one-hop neighbors.


In each of them, the static algorithm is executed with the intention that each injected packet is transmitted via one hop in each time frame.

packets may fail due to too many injected packets or collisions in the algorithm.


X x   2.1.1 Pruned Fast Hash Table (PFHT) In BFHT, we need to maintain up to kcopies of each item which requires ktimes more memory compared to NHT.

it can be observed that in a BFHT only one copy of each item the copy associated with the minimum counter value is accessed when rc the table is probed.


For instance, we can declare the type of a list that contains an unbounded number of tracked regions: variant reglist ['Nill COons(tracked region, tracked reglist)] ; The type reglist allows the program to store an unbounded num- ber of regions.

placing a region on such a list makes it "anonymous"-that is, we lose track of exactly which key guards which region.


It is certainly possible to further improve the method by using more accurate gravity models with additional parameters.

as we show later in Section 4.3, the tomogravity method in its current simple form is already remarkably accurate.


In general, one prefers to have shortest paths between a given source and a destination.

shortest node-disjoint paths may pose another problem in the design of routing protocols.


Many channel error models rely on i.i.d distribution of channel errors.

further research revealed that channel errors are bursty in nature due to inherent attenuation, inter-symbol interference (ISI), doppler shift and multipath fading [1].


E.orts to tackle these challenges led to the design of systems such as Locus [4].

it is still not fully understood how these heavy sensing tasks, the peer to peer communication, and the energy e.ciency will interact.


Not all users are equally concerned about privacy loss with concerns varying with the nature of sites visited.

users should be aware of the nature and extent of private information that is being gathered and measures that could protect their privacy.


we have no closed-form formula for computing (9) due to the di.- P i.F(p) si culty of deriving the CDF of v .


With this popularity, more demands have been recently turned into delivering Real-Time video over wireless networks.

real-Time video streaming over wireless networks has been addressed with delivery and communication challenges.


On the one hand, if the adaptive mechanism is activated later, the fairness and the ability to support absolute throughput could be sacri.ced.

if the adaptive mechanism is activated sooner, the mechanism can react faster and avoid the deterioration of the ability to support absolute throughput.


If a coercer additionally gets hold of the original table of a voter, coercion resistance is clearly broken.

without knowledge of the table the coercer would not obtain any information about how the voter voted.


[19] have designed double auction based spectrum trades in which an auctioneer chooses an allocation taking into account spatial reuse and bids.

in the price competitionmodel weconsider, eachprimary independently sells bandwidth, and hence a central entity such as an auctioneer is not required.


Anytypical decoder tracks the signal phase and corrects for the residual errors in the frequencyoffset.SinceZigZag usesatypicaldecoderasablack box, it need not worry about tracking the phase while decoding.

as it reconstructs an image of a received chunk, ZigZag tracks the phase.


Additionally, with the current growth of mobile communication services and applications, it has become very important for operators to accurately measure and improve the Quality of Service (QoS) and Quality of Experience (QoE).

qoS measurements are generally defined in terms of network delivery capacity and resource availability, but not in terms of the satisfaction to the end-user.


Because of the ever increasing size of the Internet and increasing network speeds, a software based FED could be stressed to handle the load of a moderate server farm.

by implementing the FED in hardware, then the increase in operating speed would result in the ability to handle larger server farms.


From a theoretical point of view, the gain in spectrum e.ciency could be used to decrease the radiation level.

from a practical point of view, all the actors in the telecommunications domain prefer to use this gain to increase the bit rate with a constant power level than to maintain a constant bit rate with a lower power level.


Tno -To Figure 9 clearly shows a non-negligible probability of collision for Z-MAC LCL mode as the packet generation rate rises above zero.

qMAC provides collision-free channel access for all nodes in all data slots through the proper assignment of access quanta to each node in a contention region.


In this way, cloud providers can offer tenants an experience similar to their own enterprise facilities, at a lower cost.

static reservations lead to inef.cient utilization of the network capacity, as the share of a tenant A cannot be used by another tenant B when A is not fully utilizing it, i.e., static reservations are not work-conserving.


Figure 5(b) shows that this solution might produce a signi.cant performance gain both in terms of delivery delay and ratio.

this requires to modify the implementation of vehicular applications, and make them aware of lower layers status which might be a non-feasible solution for large class of vehicular applications suggested so far.


A node halts as soon as it discovers that it is dominated.

a dominating node v cannot halt: it continues transmitting its status to its neighbors every so often, ensuring that each neighbor w that awakes at a later time becomes dominated.


Thus, VN is a secure and reliable solution for IPTV content delivery service, since each IPTV provider is allowed to run its own protocol without interrupting other providers.

there are several challenging issues which have not been addressed in this domain.


Due to the congestion, the cluster-based method drops more packets than the grid-based method does.

the one-level cluster scheme is still able to achieve comparable number of received packets because of its longer lifetime.


Olariu and Stojmenovic [1] discuss the relationship between network lifetime and width of each corona in concentric corona model.

the authors prove that in order to minimize the total amount of energy spent on routing along a path originating from a sensor in a corona and ending at the sink, all the coronas must have the same width the authors assume that all nodes out from corona Ci should forward data in corona Ci, and the transmission range in corona Ci is (ri-ri-1) (here Ci is the sub-area delimited by the circles of radii ri-1 and ri).


Another drawback of BCube is that the hardware cost increases drastically with the number of network hierarchies (or orders), because a BCube network of a large order requires each connected server to have multiple NIC ports.

the majority of commodity servers in current market are equipped with only two NICs [6].


In this case, by routing the high-demand pairs over the high capacity edge, and the remaining commodities directly along the corresponding (si, ti) edge, the optimum congestion is a · O(log k).

an oblivious routing algorithm has to .x the routing paths without knowing the high-demand pairs.


Policy atoms thus exist in the context of a share, and are bound by the shares privileges and .owgroup.


We do not propose that this work in its current form can serve as a drop-in replacement for existing network infrastructures, which have evolved and coagulated over many years under various constraints.

if progress is to be made in deploying new, more .exible infrastructures for network routing, we believe that a cleaner foundation is needed.


InallexeutionswherethegeneralissomeunorruptedpartyPP Pj,  =theforger:playstheroleofPP, followingtheprotoolandusingthesigningkeywhih itassoiatedP withPinitially.


The benefit of sending the differences over sending the entire collection might clear when it comes to the network traffic of large collections [2].

the effect of synchronizing the differences on the synchronization time is unclear.


The token based WiNoC has higher bandwidth and about three times less packet energy compared to mesh of the same system size due to the efficient small-world network topology and energy-efficient wireless links.

in the token-based WiNoC only a single wireless link is active at any given point of time.


2(a)); the resulting control action is to increase .ow rates.

if a .ow obtains less than its allocated rate, then we are likely driving the network beyonditsfair capacity(similar to the representative behavior beyond the fair rate in Fig.


3, we observe that the recommended sets are able to achieve an average satisfaction level not necessarily lower than the one obtained with the optimal set.

with respect to the optimal set, the recommended sets need a much larger number of representations to reach a globally good user satisfaction.