The substitution of the ATM transport in the UTRAN by IP (IP-RAN) has already been proposed and speci.ed by 3GPP for Release 5 [1], Figure 1 depicts the IP-RAN architecture.

this substitution raises several issues in order to make an ef.cient use of the network that have not been fully addressed yet by 3GPP: The protocol overhead increases signi.cantly when IP transport is considered as compared to ATM.


However, waiting this long may are going to generate.

the system can be con.gured to sometimes affect the subscribers ability to react properly to the work without advertisements, in which case it is assumed that ev ery publisher can publish all types of events.


For the LRTO there are no evident di.erences in the behavior before and after day 21.

similarly to the RTT, most of the spikes seen for FRTX, LRTO and AMB after the bottleneck removal are placed at o.-peak hours, which again suggests the possibility of bias from a few top-outliers terminals.


As we can see, the above objective function is the di.erence between two concave functions of S, such that the above problem is a non-convex problem and di.cult to solve e.ciently.

we notice that Problem (2) is equivalent to the The above problem seems much simpler and is convenient for further research.


The advantages of experimental implementations (i.e., testbeds) over the above-mentioned approaches are the gain of hands-on experience in close-to-real or real performance and behavioral issues, as well as favoring intuition shape practice.

because of their associated cost, there are not many experimental studies of vehicular networks and services.


Their walking speeds are drawn uniformly from [0.5, 2] m/s as in the previous scenarios.

they are stationary most of the time (sitting in offices).


Much work has been done on virtualization technology.

this has been focused on the user application experience or on a .xed networking stack.


µ<0.1) and the messages are delivered with small delays.

as the  Figure 8: Average Message Delay (T) in grid graphs (n= 121, .=0.02, u=50).


It was concluded that beyond the critical threshold, no crossing path will exist because a giant cluster of overlapping sensing disks exists.

as pointed out earlier, deployments for barrier coverage are expected to be in thin belt regions as opposed to square regions and the percolation theory results developed for square regions are not directly applicable to thin belt regions.


Most importantly, symbolic execution runs to completionin all cases when testing with the reference OpenFlow implementation.2 Achieving good coverage requires just two symbolic messages.

the question remains abouthow many symboliccontrol messagesweshouldinjectinpractice.


If we make the noise inconsequential by letting ß .8, the amount of spatial reuse approaches some (unquanti.ed) limit.

energy consumption continues v to increase as O( ß).


In the mean time, D generates MACKDCA on the identity of the reader IDR,the challenge, the element of the chain that was sent to the reader ci, and the value of i.

once computed, this is also sent to the reader R. MACKDCA is not expected to be veri.ed by the reader R but to be forwarded to CA for veri.cation and auditing.


Tenant machinesarearrangedingroupsof size S, resultingin N S groups.VMsin agroup are connectedby bidirectionallinks of capacity Bto a(virtual)group switch.Thegroup switches are further connected using a link of capacity B ' = S*B to O a(virtual) root switch.

the resulting topology has no oversubscriptionforintra-group communication.intergroup communication has an oversubscription factor O, i.e., the aggregate bandwidth at theVMsis O timesgreater than the bandwidth at the root switch.


One possible way to incorporate the impact of contending tra.c is to measure the available bandwidth [40] of the link instead of measuring the total capacity.

current techniques to measure available bandwidth assume a point-to-point, FIFO queuing model for the link.


Including the receiver address suffices for this purpose.

a sweeping CTS frame is to inform the neighbors of the upcoming transmission; both the transmitter and the receiver addresses of the upcoming transmission are useful and thus should be included in the sweeping CTS frames, as shown in Figure 3.


The fastest residential Internet access offered in the US is approximately 50 Mbps downstream and 20 Mbps upstream (from Verizon).

iSPs plan to provide faster broadband access to homes worldwide.


Itwillbring to C2 (C3) only data objects originated in C1 for channel 2 (3).

future is expected to provide 100% hit rate to all communities.


Data can be broadcasted easily between nodes belonging to the same clique.

to communicate with nodes at a different clique, a car needs to tune its DSRC radio to the frequency of the target clique.


This can cause video artifacts, depending on the codec used.

this problem can easily be reduced by adding a limited bu.er per stream su.cient for one retransmission on the proxy.


The second method allows users to freely choose switch architectures and traffic models as they want.

there are a lot of things to care about: simulation architecture, statistics collecting framework, switch architectures, scheduling algorithms, traffic generating, and so on.


The path explorer treats them just as vulnerable statements and generates input constraints for them.

the adversarial module solves for the negation of those constraints.


increase di for each object, such that its access cost is PN low.


We note that in the protocol model solution, the .ow rate from node 8 to node 11 is 117.84, i.e., the computed capacity is 100% utilized.

theinterference from node 13 at node 11 is g13,11 · p132 ,9 =0.2403· .W, which is not zero.


Since in the adhoc mode the beacon generation process is distributed and follows a random algorithm, and since the inter-beacon time can be changed by the user, the actual time required to detect the beacons may vary.

even in the worst case, the autocon.guration process is not expected to last more than a couple of seconds, which is quite acceptable for our purpose.


In the improbable case when the full path has been populated with malicious nodes, it is trivial to compromise the anonymity of the path.

in the more likely case, if only the entry and exit nodes are malicious, we have developed a technique that allows paths to be compromised with a high probability of success (see Figure 1).


One would intuitively suspect that the setting of a signalized junction, characterized by high variations of traffic density, will lead to poor packet delivery performance due to increased overlapping of transmitters.

our results show that this impact is less significant than the hidden node problem, which is dominant in the urban non-uniform scenario as well.


Maintaining accurate estimates avoids packet losses and enables the best bit rate to be used.

frequent probe packets use large amounts of the bandwidth and increase network contention.


To achieve stationary target coverage maximization, centralized, distributed, and semi-centralized camera con.guration policies are proposed in the literature [2,25].

answering the latter question is non-trivial: in addition to the target mobility and/or velocity, it also needs to consider the wireless communication overhead that can potentially restrict the coverage policy to realize its full potential.


However, it relies on proper operation of a large number of wireless devices, which can be di.cult to manage.

our approach only requiresasingle monitoringpoint,andiseasy to manageand maintain.


In this new shape, J is in the transmission range of A, and E is in the transmission range of J.

similarly H is in the transmission range of F. because of the usage of route caches and the validity of the existing routing information, the routing table entries are not updated.


We further assume evaluation will shed light on the overall gain.

we that the files are requested according to a Zipf power law foresee that even partial support in a few nodes could lead to distribution with parameter a.


If single copy routing were use, thelowdeliveryprobability wouldbe compounded by Locus s roundtrip communication style.

multi-copy approaches can exponentially increase the message load since for each copy of a query message that matches data, multiple response copies might be generated.


[10] use simulation to show unfair CSMA/CA parking lot scenarios and validate a multihop wireless backhaul fairness model.

we explore the unfairness of 802.11 by performing outdoor experiments on a parking lot tra.c matrix.


Hence, the QoS provisioning is rather a kind of fairness between competing flows.

in DFS each wireless terminal has to monitor all transmission packets scrutinizing the finish tag of each packet.


The whole processes could be done easily if the parcel is small and easy to put in the respective pigeon hole.

there is possibility the parcel is missing along the transfer process.


With the above simple modi.cation, PCM overcomes the problem of the BASIC scheme and can achieve throughput comparable to 802.11, but uses less energy.

note that PCM, just like 802.11, does not prevent collisions completely.


We note that not all areas have 3G coverage (some only have 2.5G coverage).

since our focus is on 3G performance, we do not consider data from 2.5G sectors.


The both protocols, IEEE 802.11i and MIS protocol, achieve enough confidentiality, integrity, authentication and key exchange in practical use.

the both protocols are under threats of forged control messages by using of management/control frame of IEEE 802.11 and control messages of MIS protocol.


Half of the links are symmetric at the lowest power level 1, 65% at 3, and 88% at 9.

the ratio of asymmetric links increases when the power level decreases.


Fourth, when di.erent schedules within the network can be implemented independently here we imagine separate non-interfering network components , for Back-Pressure, messages must be shared between the separate components in order to determine the di.erences in queue sizes.

for the Proportional Scheduler, the optimization relevant to the policy will decompose into an independent optimization for each component which can then be solved separately.


plex trade-o.. On one side, switching among APs introduces overhead, so selecting long wireless periods is more e.cient.

long periods a.ect TCP performance because they arti.cially increase the end-to-end delay.


Their goal is to convey certain information over the original video with changes imperceptible to users.

iNFR A M E not only embeds data bits onto the video frames, but also ensures that the extra bits can be captured by the camera for data delivery.


In many applications, such as disaster response, the network has to perform proactive routing to ensure application tolerable delay for information delivery [11].

limitations of energy availability in the battery-powered mobile nodes compound the problem.


Additionally, all the individual NHs associated with this pre.x should be written into the associated SRAM.

changing one non-leaf pre.x triggers the update of at most N virtual pre.xes (where N is the number of FIBs) in the TCAM of thenon-sharedlookuppath(e.g., see pre.x 100* in Figure 11(d)), as well as N NHs in the associated SRAM.


By this method, a node can count its neighborhood queue size precisely.

in a mobile ad hoc wireless network the topology and tra.c pattern may continually change.


slip into the hands of their competitors.

they do wish D¯out D¯in to know i , and i , the average delay of packets going out of, and coming into their network, as well as the average delay across all networks.


The dash dotted lines indicate the error bound.

according to our analysis in Section 7.2, a large a with a small b can easily result in long calibration intervals which are more energy e.cient in comparison with a small a with a large b.the calibration error grows with the length of calibration intervals.


Figure 14 shows that the delivery rate of Original Greedy increases by using more retransmissions and since the lowest reception rate of a neighbor is 1%, in.nite retransmissions do not cause delivery failures due to losses, but delivery failures could still happen due to greedy disconnections.

the energy e.ciency of Original Greedy degrades with more retransmissions, due to the extra overhead of retransmitting on bad links.


In fact, being in reach of a large number of di.erent nodes increases the probability of meeting sensors with higher delivery probability or sinks.

it may be possible to have a node that moves around but always together with the same nodes; in this case, the node is always co-located with the same devices.


For example, in Hedera-like traf.c engineering [5], the traf.c congestion at one link can trigger routing changes at another switch, thus it cannot be speci.ed as a local task.

the switch can still detect heavy hitters, and the switch agent can con.gure the switch to send those events to it.


especially in such DTWSNs, application data is often rather small, such as measured sensor data [11, 3], while the available upper limit for the payload imposed by lower layers is also often limited, e. g. 127 bytes over IEEE 802.15.4 links [10].


This is why management of network latency in the supporting infrastructure of games is crucial.

this management involves much more than providing network connectivity and bandwidth.


In addition, with MDC, less bandwidth requirements are imposed to the routes.

since the multiple paths start at the same source and end at the same destination, they will interfere, even though they are node-disjoint.


is received after the decryption, so the output of AOO and AOO differ 21 22 overwhelmingly.


The DLS scheme provides a more moderate energy saving as compared to DVS (in Figure 5 (c)) as only a small percentage of links can be shutdown completely.

when combined with DVS it can provide an additional 50% savings.


Also, a broad VS scope advertisement increases the chance of localized congestion around a VS (where each VS potentially creates a mini-funneling effect similar to the original problem).

a smaller value of l implies shorter redirect paths, improving delivery latency and energy consumption, but con.nes the bene.t to fewer nodes.


These properties of the .at pricing strategy make it not suitable in general.

it might be a good choice in a class-based scenario for business customers, i.e., for a limited number of users with top requirements and therefore willing to pay more.


HAJDP will provide the optimal solution if |MIS|=|V|-k.

if the size of the MIS is less than |V|-k, HAJDP simply keep adding nodes which provide the best objective value to the set until it reaches the desired size.


(e, t) (6) sw(u, v) := (7) e.P .2 · .v,w else u,w  Following this de.nition, we then de.ne the aged simi-In the .rst case the decision can easily be reached using larity s(u, v) as the sum of the similarities of all common the betweenness value, while in the third case the higher neighbors i between node u and v. similarity will be the best choice.

the second case X s(u, v) := sw(u, v) (8) might be critical as the similarity might not be meaningful enough and a high betweenness could possibly lead in the wrong direction when reaching the proximity of the desti w.N1(u)nN1(v) nation.


We hypothesize that these two sites correspond to voice call centers and only involve voice traf.c.

the other sites may include both voice and data traf.c.


We can see, that the .rst node dies .rst in the case of the .xed BS, and last in the case of the minrel strategy.

with the minrel strategy the total energy of the network Figure 1: The number of alive sensors.


It is useful for protocols, such as TPSN, because they rely directly on the clock rates.

when we consider protocols that use relative ' clock rate, which is r in a clock relation, it is not so im s portant because the deviation of the two clock rates can be compensated.


From Toys to Products: A Step Towards Supporting the Robust Reuse and Integration on the Web Peng Gao Tokyo Institute of Technology, Japan gao@tt.cs.titech.ac.jp ABSTRACT UI component based mashup at client side is a new trend of information/knowledge integration method on the We b.

without a systematic and robust composition mechanism, the widespread of such mashups is still a beautiful wish.


The type information can be used to enable more sophisticated load balancing policy (e.g., [12]).

the load-balancing capability provided in many commercial server switches is limited because they do not consider the service type of each request, In addition, such information also can be used to perform request differentiation.


Furthermore, movement is also pretty often detected.

the correct detection rates are Table 7: Movement detection accuracy for di.erent con.gurations in the Shannon building.


We observe that congested links are more likely to be inter-AS than intra-AS, especially for small tl.

compared to the study in [36], the percentage of intra-AS lossy links in our study is larger.


DSR is a best-e.ort, reactive, single-path routing protocol.

it discovers and caches multiple paths to a destination node as part of its Route Discovery process.


The set of weights can be created with the LOCAL-PREF attribute.

if a weight corresponds to exactly one value of LOCAL-PREF, no margin is left for the ASes to individually apply routing policies that they do not wish to disclose to their neighboring ASes.


Frequent path reconstruction also makes the layer more vulnerable to the degradation attack [32] discussed in Section 2.

in Cashmere a relay is usable as long as at least one single node in the network has the relay group s groupID as a pre.x.


4 CHARACTERIZING PERSISTENT FORWARDING LOOPS A trace of traceroute normally contains a sequence of router interface addresses.


In fact, numerous proposals have been developed that use asynchronous hop-by-hop communications to avoid the need for an end-to-end path (1) and thereby (implicitly) also address the issue of (2).

these usually force the applications into the DTN-inherent asynchronous communication paradigm and often require speci.c application protocols designed for this purpose.


Communication is possible only when a device is within the transmission range of another device and they become neighbors.

no device has any knowledge about the geographical positions of other devices.


Reconaissance and Vulnerability Reports: Analyzing network based data provides us with rich information regarding the behavioral patterns exhibited by a monitored host.

we do not get any information about the running services, the patching level of critical components, and the existence or absence of vulnerabilities.


A small value can cause many false positives in channel assessment, causing the node to turn on a radio more frequently.

a larger value might miss packets, resulting in higher loss rates.


Recall that DLP does not, therefore we expect its power dissipation to be small.

for the same reasons, DLP cannot achieve high line-rates such as 160 Gbps.


Therefore, the receiver will successfully decode the original message using this estimation Theoretically, the attacker can set an arbitrarily small delay (e.g, 1 nanosecond) to create a much richer virtual multipath e.ect at the receiver.

modern channel estimation algorithms estimate only resolvable paths whose inter-arrival durations are no less than one symbol duration, and it has been shown that using the estimation of resolvable paths is su.cient to compensate the channel e.ect for signal demodulation.


Less replicas are enough to guarantee big MDAHN, which means less tra.c around the network.

we want to make MDAHN smaller in order to guarantee a bounded data retrieval time.


Such an approach can take advantage of the .exibility of software (i.e., augmented host driver) to support complex WiFi management functions.

it has the potential of removing extra virtualization overhead from the critical path of data TX/RX.


The average cell throughput is calculated by multiplication of the probabilities and the data rate of the di.erent modulation and coding schemes.

the impact of scheduling is not taken into account.


This is enabled by the treelike structure of the 3G network, and relies on the fact that most of the tra.c is TCP-controlled.

the analysis at lower levels of granularity (e.g.


Overall, the download time for the Flickr page is smaller than for the New York Times one although the total size is about equal.

the median object size of Flickr is signi.cantly larger.


We formally i express these relationship in the next section.

also Cif corresponds 3.2 Simpli.ed Model to the queue size qif from Section 2 on all nodes i used by .ow f. We next consider the simpli.ed, suboptimal version of (4): in this case we do not queue Cif packets per node and per .ow, but only P f , which is signi.cantly smaller, as we will maximize Uf (yf ) subject to (1), (2), (7).


Itachieves fairness regardless of whether the transmission rates of the links are the same or di.erent.

under non-uniform transmission rates, it is well known that ensuring each .ow a fair share of bandwidth may cause signi.cant reduction in a WLAN s overallthroughput[10].


Our analysis reveals that, 3G traf.c load exhibits wide-range .uctuations both in time and over space.

energy consumption of current networks is not load adaptive.


Monetary Incentive with Reputation for Virtual Market-place based P2P Krit Wongrujira School of Electrical and Telecommunication University of New South Wales Sydney, Australia krit@student.unsw.edu.au ABSTRACT One of the underlying assumptions on the design of peer-topeer (P2P) network is that each peer trusts each other for forwarding transit messages.

with the growth of P2P application, especially in business model, some peers may behave as sel.sh, irrational nodes due to con.ict of interest or for conservation bandwidth.


Figure 4 shows distributions of the delay contribution of the di.erent factors contributing to Tlong .It shows that failure detection contributes the most, closely followed by route invisibility (both contribute around 10 seconds in 90% of events).

path exploration contributes least in MPLS VPNs, as opposed to the Internet environment where it is the dominant factor.


Common approaches that also explore the message routing within a DSE tend to express and determine the routing hop-based with the help of one two-dimensional routing matrix of all resources and communication hops for each of the included messages.

the disadvantage of those approaches is that the number of decisions for the routing of every message scales with the number of resources 1The network topology as well as the message routing are also explored and optimized during the DSE and the number of hops that are allowed to be taken for a routing.


Our results indicate that truncation e.ectively prevents host identi.cation but degrades the utility of data for anomaly detection.

the degree of degradation depends on the metric used and whether network-internal or external addresses are considered.


Finally, BGP does not support domain backup in the event of network partitions.

rR can be as hard to con.gure correctly as BGP, as will be explained in Section 2.


However, allocating larger resources (for example, multiple VC to a single .ow) may result in a larger bandwidth change in the saturation region (Blue lines) from 0.4 .its/cycle to 0.5 .its/cycle.

this only gives a meager improvement in users satisfaction from 0.95 to 0.97.


Unfortunately, the path followed by messages from the common source to [gigj ] is likely to be different; hence the order in which messages were sent by the source is likely to be lost.

if the source sends a sequence of messages to gi, waits until it is received by [gigj ], and then sends a sequence of messages to gj , the order in which the sequences of messages have been sent will not be lost.


Since the transmit pattern is oblivious to channel state information, directional beams are affected by multipath propagation and have been shown to be less effective in indoor environments [11, 16].

beamforming is a closed-loop technique that uses the channel information at the Tx to modify the transmitted signal such that the signals received through the multiple paths are reinforced at the Rx thereby improving the link Signal to Noise Ratio (SNR).


Looking at the effect across network densities, it can be evidently seen that the average packet delivery ratio of protocols like VELOR and GOSR, which consider road topology, increases with increasing density.

vELOR outperforms GOSR across all densities as it also considers mobility, to predict the future node location, apart from road topology.


[3] characterize uncertainty based on the context, such as environmental geometry, sensor placement, orientation, and time.

they have not looked at the stochastic occurrence of events.


that access style does not have a significant impact on data writing for the local DB.

in the case of load-balancing configuration, multiple-access took a longer time than singleaccess.


Thus, transmission queue length increases.

when Tspare > 0, partof thisfurther traf.c canbedispatched using this added capacity.


It a.ects little to a single VM or non-network-applications .

for a network application running in a VM, the in.uence cannot be omitted.


The /25 was not propagated to many observation points, and those which saw the speci.c pre.x were in the center.

our data-plane measurements showed that a much larger proportion of the Internet could reach the address space of the pre.x.


Note that in our simulation study, the channel assignment matrix X has a constant column weight, which means that terference free communications are possible.

if the chan 7 nel codewords form an s-disjunct code, Algorithms 1 and 2 can compute a channel for better interference mitigation.


The classical approach to this problem on DHTs isto replicatekey-valuepairs on nodes neighboring the nodethat ownsthem.

suchan approachwould violatethe .rstdomain srequirementformappings: the domain, who can t choose its neighbors on the ring, would loose control of who is managing its mappings.


By exploiting the inherent defects or characteristics of sensing devices or wireless channels, an attacker at a different location will display a distinct profile from a genuine user's, hence detectable.

it is difficult to obtain stable profiles for mobile nodes in WBAN.


More recently, Iyer [8] studied re-routings that are equivalent to Rule 1 and similar to Rule 2.

that work places restrictions on the intra-versus inter-POP weights to avoid loops while we do not.


These links are identi.ed based on the long-term success rate of a link collected over a time frame in the order of minutes.


This operation is possible because losses due to congestion occur in bursts and hence the loss rates of congested links have high variances.

most links on the Internet are un-congested, and hence the averages and variances of their loss rates are virtually zero.


Time-based periodic updates Performance-based triggered updates are important to boost the packet matching performance when it signi.cantly drops below the deviation threshold.

these updates are not su.cient to detect average performance deviation that is just below the threshold even if it lasts for a prolonged time interval.


Decentralized Group Key Management for Dynamic Networks Using Proxy Cryptography Junbeom Hur Korea Advanced Institute of Science and Technology(KAIST) 383-1, Guseong-dong, Youseong-gu Daejeon, Rep. of Korea jbhur@nslab.kaist.ac.kr  Youngjoo Shin Korea Advanced Institute of Science and Technology(KAIST) 383-1, Guseong-dong, Youseong-gu Daejeon, Rep. of Korea yjshin@nslab.kaist.ac.kr Hyunsoo Yoon Korea Advanced Institute of Science and Technology(KAIST) 383-1, Guseong-dong, Youseong-gu Daejeon, Rep. of Korea hyoon@nslab.kaist.ac.kr ABSTRACT Decentralized group key management mechanisms o.er bene.cial solutions to enhance the scalability and reliability of a secure multicast framework by con.ning the impact of a membership change in a local area.

many of the previous decentralized solutions reveal the plaintext to the intermediate relaying proxies, or require the key distribution center to coordinate secure group communications between subgroups.


Table 1 also shows that SProbe is the only tool that exploits the(v,k)-TWP(withv =0 and k =1) to measure reverse capacity.

sProbe dispatches an HTTP GET request to induce a pair of Sr-byte TCP data packets from a web server for the measurement, where Sr depends on the negotiated TCP maximum segment size (MSS).our empiricalevaluation ofSProbe(to bepresentedin§5)shows that its reverse-path measurement is often inaccurate, because the response packets are not dispatched consecutively.


However, in the real world the Sprint and AT&T ASes are connected to each other in a large number of places around the world.

not much is known about the degree of such connectivity in the Internet today.


we recommend using simple machine learning principle to find the most suitable threshold set.


Thus, depending on the choice of top, the FP rates vary.

keeping top value 50% or less, the FP rate will be reasonably lower (below 4%, which accounts for only 4 out of 104 websites).


The only effective way is to choose the hash function randomly in a way that is independent of the keys that are actually going to be stored.

these methods do not take into account the partition of traffic according to unequal weights.


All of these can be easily expressed, albeit maybe approximately, as (perhaps modulationdependent) shifts in the effective SNR thresholds.

changing these parameters in the simulation approach involves changing the internals of the calculation.


In Panama, if an IP packet does not require additional processing, its forwarding path is an interrupt-free pipeline coordinated by network processors lying on the packet s forwarding path.

when a packet needs high-level processing, it is asynchronously posted to the computation path, which in turn asynchronously returns the packet to the forwarding pipeline after processing it.


Furthermore, the improvement in the connection-establishment latency does not interfere with higher-level admission control mechanisms.

client-level classi.cation (H1) does violate the endto-end argument, and it is presented here to show the full potential of an intelligent dropping mechanism in routers.


1cycles during the visit duration plus 1.

the event captured at the beginning of the event may be the same as the event captured by the robot while leaving the PoI during the last visit.


6.1.2 Accuracy gain The only parameter of the adaptive method is the picture size,andby settingittothreedi.erent values,namely1024, 2048, and 4096, the same high accuracy score is observed, 0.99, 0.98, and 0.99, respectively.

the number of reported alarms decreases as the picture size increases, which is 373, 173, and 117 events respectively.


Utility transfer In the above formulation, we have implicitly assumed that players may not transfer utilities.

often players are able to do so, in particular via monetary transfers.


3.1 Available Components Layer 2 switches lack many of the packet handling features of layer 3 routers.

monsoon shows how devices having a layer 2 forwarding plane implemented in hardware, but programmable control plane software, are more than suf.cient to implement an elegant and performant design.


In[12], non-linearcolumn generation is used to obtain an approach that converges to the global optimum solution.

the column generation subproblemis alsotypicallyNP-Complete.


Without buffer limitation, nodes diffuse data to as many contacts as possible and never remove data from their buffers.

due to the limitation of the contact time, not all data can be diffused during each contact.


In addition, let h(u, v) be the minimum hold cost between nodes u and v. Note that the hold cost of the shortest path,/5,,u, may be more than h(u, v).

in most practical networks, there is a correlation between the setup cost and the hold cost of all the graph edges and constants c~ and c2 are close.


with growing popularity of the system, it is possible that load on a single centralized reputation management system maybe too high and the task of reputation management may need to be divided across multiple such repositories.


Similarly, w2 having only color 1 available forces e5 to be assigned color 1.

assigning e4 and e~ to both have color 1 means that v3 has two edges adjacent to it that use the same color.


The aspect of mobility has not been explicitly measured in the evaluation.

it can be derived from the measurement results: For N = 2 both network topologies show that one authentication between two stations requires t =0.52s on average.


Energy-Ef.cient Low Power Listening for Wireless Sensor Networks in Noisy Environments Mo Sha, Gregory Hackmann, Chenyang Lu Department of Computer Science and Engineering Washington University in St. Louis One Brookings Drive, Box 1045 St. Louis, Missouri 63130, USA {msha, ghackmann, lu}@wustl.edu ABSTRACT Low Power Listening (LPL) is a common MAC-layer technique for reducing energy consumption in wireless sensor networks, where nodes periodically wakeup to sample the wireless channel to detect activity.

lPL is highly susceptible to false wakeups caused by environmental noise being detected as activity on the channel, causing nodes to spuriously wakeup in order to receive nonexistent transmissions.


The Internet is a relatively homogenous technical artifact defined by IETF standards.

these standards allow some flexibility for different actors to exploit them in different ways in different contexts.


1) Open problems Our conclusion is that a PIFO DSM router is less complex than a PIFO CIOQ router (has lower memory bandwidth, fewer memories, a simpler scheduling algorithm, but slightly higher crossbar bandwidth).

it seems that the PIFO DSM router has two main problems: (1) The departure times of each packet must be determined centrally with global knowledge of the state of the queues in the system, and (2) A sequential scheduler must find an available memory for each packet in turn.


This is so when the attacker relays US signals over short relay links.

long relay links(above300m)introducea non-negligibledelay(afew microseconds)to relayed messages.


The local mobility anchor maintains proxy binding caches for the mobile node s addresses.

this con.guration introduces multi-link subnet issues.


In Speed, each AP picks the data rate to be used at the beginning of the timeslot by comparing the current SINR level to the minimum required SINR thresholds for the di.erent rates.

during thetimeslotthe selected rate may not be supported due to an inaccurate SINR model, uncalibrated RSSI levels, short-term fading, or mobility in the environment.


Several multi-channel MAC protocols [1,2,3] for WSNs have recently been proposed to improve the performance.

the practicality of the proposed mechanisms is unknown because the protocols are only evaluated through simulations.


Current systems overwhelm operators with meaningless alerts (the current management system in our organization generates 15,000 alerts a day, and they are almost universally ignored as so few prove signi.cant).

sherlock does not report problems that do not directly affect users.


Admittedly, introducing a centralized database that is shared across all PMIP-domains violates the distributed character we set as a design objective.

we argue that it is only a relatively small concession because of the lightweight character of the VMA.


2.1.2 Locator/Identi.er separation Decoupling locators from identi.ers provides inherent support for (end-host) mobility and avoids issues such as provider lock-in.

a new architectural component a mapping service is needed: Given a certain identi.er it returns the current locator(s), see Section 2.3.


Hence, we allow for the possibility of management applications accessing low-level details and provide the relevant hooks.

we necessitate that any direct changes to the low-level details be appropriately re.ected in the protocol s CONMan abstraction.


All protocols show a reduced report number with increased distance, which proves the contribution of aggregation operations.

after the point at about 3km, our aggregation protocol shows apparent better performance, reducing as much as 50% reports than Randomized Waiting.


A Toolkit for Automating and Visualizing VLAN Con.guration Sunil D. Krothapalli, Xin Sun, Yu-Wei E. Sung, Suan Aik Yeo and Sanjay G. Rao School of Electrical and Computer Engineering, Purdue University West Lafayette, Indiana, USA {skrothap, sun19, sungy, yeo, sanjay}@purdue.edu ABSTRACT Virtual Local Area Networks (VLANs) are extensively used in enterprise networks.

their con.guration remains an ad-hoc, complex and error-prone process today.


One natural explanation is that these money is collected from the service requestor who initiate or bene.t from the routing, e.g., source node or destination node or both.

it is not likely that the service requestor is always willing to pay the money to relay terminals when it is arbitrarily large.


Traffic should now flow to other networks via R2, as shown in Figure l(d).

until R2 learns of the failure of R1, it continues to direct traffic for other nodes in the network to R1.


Some pioneer 3HUPLVVLRQ WR PDNH GLJLWDO RU KDUG FRSLHV RI DOO RU SDUW RI WKLV ZRUN IRU SHUVRQDO RU FODVVURRP XVH LV JUDQWHG ZLWKRXW IHH SURYLGHG WKDW FRSLHV DUH QRW PDGH RU GLVWULEXWHG IRU SURILW RU FRPPHUFLDO DGYDQWDJH DQG WKDW FRSLHV EHDU WKLV QRWLFH DQG WKH IXOO FLWDWLRQ RQ WKH ILUVW SDJH 7R FRS RWKHUZLVH WR UHSXEOLVK WR SRVW RQ VHUYHUV RU WR UHGLVWULEXWH WR OLVWV UHTXLUHV SULRU VSHFLILF SHUPLVVLRQ DQG RU D IHH %2'<1(76  6HSWHPEHU 2FWREHU  %RVWRQ 8QLWHG 6WDWHV &RSULJKW k  ,&67     '2,   LFVW ERGQHWV medical projects promise grant opportunities to Cloud.

security concerns of Cloud escalate due to the life-threatening situations related to healthcare applications.


Applications and services must rely on policies internal to S-MAC to adjust operation as node and network conditions change; such changes are opaque to the application.

the B-MAC protocol contains a small core of media access functionality.


A video frame is a matrix of pixels, with each pixel typically represented by a 8-bit value.

since natural images do not show large variations, there is a lot of redundancy in the pixel representation.


Typically, energy efficiency is considered the major requirement in the design of WSN-based sensing systems.

in many application scenarios, additional requirements need to be considered, such as reliability and timeliness [3].


Moreover, dense hash map is not thread-safe, and so in practice, making use of it would likely require doubling its memory use to store a writable copy of the table.

optimized cuckoo hashing supports in-place, concurrent updates that eliminate the necessity of such techniques.


A naive reservation scheme, such as R0, unnecessarily denies connections without improving the performance of the admitted connections.

the reservation schemes that take into account of Internet congestion information, such as R1 and R2, yield similar performance as the best-effort scheme, all out-performing R0.


Without any additional information, the privacy entropy H is equal to log2(N), where N is the total number of users in the network.

when an attacker accumulates the location information for all packets sent in the network, the attacker can attempt to correlate different pseudonyms with the same user.


It is true that, in some cases, this may lead to non optimal scenarios.

we believe it is not realistic to ask a firefighter, while in the middle of a rescue operation, to move the truck to improve the network connectivity.


At last, the compression ratio of the 10M Name Set and 8M Name Set is 63.66%and12.56%, respectively.

pleasekeepin mind that, ENPTisa logical data structure and we donot implementit directly.itis implementedbyS2TA.


In the nosaturation case, the number offrames transmitted(with success orfailure) at theMAC sublayer with slottedCSMA/CA is the same as with adaptive slotted CSMA/CA.

thechannel accessfailure rateof adaptiveslottedCSMA/CA is lower than with the original slotted CSMA/CA.


The fair index policy again corresponds to the PF scheduler.

in the asymmetric settings the RB policy displays a quite di.erent behavior than PF and hence it is indicated separately.


(This is particularly true if the main reason that nodes die is due to loss of battery power.)


In our analysis, we concentrate on frame rates of 3, 15 and 25 frames per second.

even a high frame rate can appear choppy if the frames are not played out at even intervals.


Unlike [11], [15] exploits the unique structure of data center topologies in their proposed solution.

both these works assume that the topology is provided as an input to the problem.


The capacity of wireless networks could be substantially increased by equipping each network node with multiple radio interfaces that can operate on non overlapping multiple channels.

new scheduling, channel-assignment, and routing algorithms are required to fully utilize the increased bandwidth in multi-channel wireless local networks.


From a high-level architectural perspective, the differences between layer 2 (Ethernet) and layer 3 (IP) are shrinking, especially for a network contained inside a single building, like a data center.

there are a number of practical factors that drove Monsoon to connect all the servers via a single large domain at layer 2.


An e.cient heuristic approach is adopted to divide the sensors into a maximal number of disjoint sets [8], in which only one set can monitor all the targets and transmit the collected packet during a period of time, and the others are all in the sleep mode.

it has to be noted that if one of the sensors fails, the solution might not be optimal anymore and more likely the sensors remaining in that set might not cover all the targets.


The averagedistance inthe transmissionfrom theithto (i +1)st relay node xi and xi+1 is N -.|Ci+1| ZZ di,i+1pri,i+1  E(svc) (1-e ) dxidxi+1 (5) |Ci||Ci+1| Ci+1 Ci The .rsttermisduetotheprobabilitythatatleastone node existsin the cell Cj.If nonode existsinthecell Cj,direct communication with the destination node is needed.

the probability of successful transmissionsin this caseis very small andyield on average close to zeroprogress.


One use case describes a model for Authentication-as-a-Service, where a two factor authentication is implemented using the SIM card of a mobile phone.

these approaches do not include the possibility to store additional information on the card, for example the a.liation of an employee to a company.


To do this Talukdar [15] proposed the concept of advance reservations.

making advance reservations is extremely wasteful of bandwidth.


The end host can also detect routing situation change if it is receiving routing information from a router.

the failed path may recover if the failed router recovers or the correct forwarding table entry for the path is installed on the router.


The simplest way to do that is to rejoin as a new participant host.

it is considered that this takes a lot of recovery time and overhead.


Obviously, it is more complicated in the wireless ad hoc environment than in the wired network, and only the last situation, i.e., packet dropping caused by a full buffer queue is resulted from network congestion.

tCP relies on the packet loss to detect the congestion and thus TCP may probably take a wrong reaction to packet loss, which is caused not only by network congestion.


The decoupled DC signal is afterwards processed as a normal activation line signal.

for a controller, it is only possible to wake its direct neighbours and, hence, the advantages over the already known energy detect mechanisms are minor.


In the second case, seconds earlier than in PAR-AODV, and 1182 seconds earlier than in the node sends a route error RERR back to the source even when the LPR-AODV.

as the velocity of the node movement increases, rate of energy consumption in the network goes up.


This shows that if rate variation is not large enough, TCP Sack is able to handle the variability.


We can see that the interference between channels 1 and 6, and channels 6 and 11 is minimum hence they are considered non-overlapping.

there exist other channel pairs (eg:-(2, 6) and (6, 10)) where the interference is fairly low.


Meanwhile, security research has shown that communities of related entities, such as companies within an industry, can be used effectively for network intrusion detection and resilience by applying anomaly detection [4], [5], outlier detection in evolving communities [6], [7], classi.cation of malicious network traf.c [8], [9], or behavioral analysis [10].

the precondition for these methods is knowing the members of the community to be protected.


TCP behaves normally when k is less than or equal to one.

for k < 1, TCP ACK flow is allo 1 Assume one ACK is sent for every d data packet received.


Instead, they are often shared through personal interactions (e.g., between an advisor and an advisee), if at all.

a more systematic communication channel is necessary to share failures for the purpose of generalizing them.


Betterperformances canbe achieved relaxing thishypothesis.

we will show thatitis possible to achieve extremelygood results evenin this case.


In most cases, Ef.Cuts multiple trees require more memory accesses than HyperCuts single (albeit much larger) tree.

ef.Cuts requires on average 50% and at worst 3 times more accesses than HyperCuts.


In this context, they observe similar pathologies: poor bandwidth estimation, leading to instability.

they explain their observations entirely in terms of the application-layer ON-OFF behavior of video clients; even if one video client perfectly obtained its fair share when ON, it can fail to correctly estimate available bandwidth (depending on the amount of overlap with the ON periods of the other client).


9 shows that the message delivery ratios of both SHIM-OS and SHIM-OS-Custodian benefits from the increase of local storage within each DTN nodes.

their efficiencies decrease because more retransmissions are incurred when more bundles can be stored.


This information is stored according to the OLSR specifications.

to store the QoS-related state associated with a node, a new field was added to the neighborhood information base and to the topology information base maintained by the protocol.


We can conclude that LDC algorithm is an e.cient interference mitigation technique for low data rate UWB communication since the FER of wideband OFDM systems is improved with decreasing of the duty-cycle of LDC-UWB.

lDC cannot suppress interference to wideband OFDM systems completely.


As the number of MANET stations increases, so do interference and collision among them; accordingly, this in turn degrades the network capacity, .exibility and scalability.

if MANET stations are equipped with multiple interfaces operated on multiple channels (MIMC), it can enhance the network capacity and .exibility signi.cantly [1].


We believe that the most e.cient way to ensure energy e.cient online presence is through the design of a platform API that will allow application developers transparent continuous connectivity without detailed understanding of the fundamentals behind cellular operation.

we .nd the platform-native push mechanisms that already exist to be limited.


The HSDPA system uses the .xed interval to retransmit the lost MACframes,notimeris employed.

the variance of channel quality can have an impact on video transmission quality.


Speci.cally, if expanding a rule r along a dimension (with possibly adding rules) will not reduce the number of TCAM entries needed to represent r, we will not perform the expansion.

such locally useless expansions may potentially make some other rules or TCAM entries become redundant and hence we can reduce the total number of TCAM entries needed to represent the rule set after removing those redundant rules or TCAM entries.


this sum becomes di.cult because of the interplay between what the Network and the Victim do.

we decouple them by not forcing the Network to run a .xed protocol when it has the message W, but instead for each distribution of packets X allow it to use the protocol that will maximize its probability of sending X.This can increase the probability of success.


For the sector pattern generations, wider beams are generated by fewer antenna elements.

narrower beams are used by more antenna ele 1The detailed procedure to obtain Hu,s[m] is omitted here for brevity.


3.3.2 A Messages A node y upon receiving an O message from an orphan, checks the D(x) .eld in the message, compares it to its own D(y), and replies with an A message to the orphan only if D(y) = D(x).

since many potential parents may reply, contention over the shared medium may result.


Therefore, it is best to ensure such o.oad happened over WiFi networks (available in the bus depot) [2].

if some emergency situation occurs, then public safety agencies may want immediate access to these feeds requiring an immediate change in this policy.


Some may view it as the physical layer transmission rate which is a .xed value given the transmission power, coding and modulation schemes.

in a CSMA/CA based WLAN, the throughput achieved by each node usually falls short of the physical transmission rate due to the protocol overhead and the contention to the shared transmission medium.


With this extension, tit-for-tat fairness will verify our two fairness criteria.

in the context of peers with asymmetric capacity, .nding a threshold that maximizes the capacity of the system is a hard task that is not yet solved in the context of a distributed system.


Understanding the long-term distribution of server to client packet lengths is important.

a complete simulation model must also account for the way in which packet lengths change from one packet to the next.


If beacon nodes are well distributed or selected with respect to certain clustering criterion, the performance is expected to be better, as was done in [2].

as beacon nodes may not be practically placed at any desirable location on the Internet, we believe it is more reasonable to include all the beacon nodes available on the Internet, but provide a method to enable a host to only measure its distances to a subset of beacon nodes.


The scheduling algorithm also tries to probe the network, so that an equilibrium state of fair sharing can be achieved.

this is done at long timescales (order of seconds) so that the per-path load does not oscillate.


The lowest 1We are aware that more realistic mobility models such as, for instance, the obstacle model of [14], could have been used in QoS-RWP.

this would have increased a lot the complexity of the simulator and the simulation running time.


The number of bytes put an upper limit on the achievable error correction using this technique.

with only 6 time stamps, the time-stamping precision can be improved from tens of microseconds to 1.4µs on the Mica2 platform as measured by the following experiment.


In such a network, packets sent by a given sensor are routed along the direct line that links that sensor to the closest sink.


Basically, TCAMs can compare a given search key (i.e., a packet) with all entries (i.e., stored rules) in parallel and returns the .rst matching entry in one single clock cycle.

as a more complex technology, TCAM is more expensive and more power consuming than conventional DRAM/SRAM-based systems.


Equivalently, it experiences congestion whenever the sending rate exceeds the maximum channel rate.

often the receiver advertises a win dow size Wmax that is smaller than the peak bandwidth delay product.


MOTIVATION BWA systems have been developed to transmit data and multimedia services with distinct quality-of-service (QoS) requirements.

as can be seen in Figure 1 [4], the IEEE 802.16 Standard does not de.ne a complete QoS architecture.


At the .ow level this implies that the achievable transmission rates vary randomly from time slot to another.

if the scheduler does not utilize the instantaneous channel state information, at the time scale of .ows these rate variations average out, and in the limit when the time slot length goes to zero the system can be modeled as an M/G/1 queue, see [5, 1].


Workstation processorsprovide an environment where code development is easy due to signi.cant support by the operating system and established development tools (e.g., Click[11]).

the raw processingperformance of network processors and programmable logic devices is higher.


This information is obtained by broadcast messages.

table 1: Simulation Performance Parameters Parameters Delay-insensitive Delay-sensitive Sensors/average sources 100/100 100/17 Volume 100x100x100 m3 500x500x50 m3 Packet size 500 Byte 100 Byte Packet inter-arrival time 600 s 7.5s to limit the overhead caused by these messages, each node advertises its access delay only when it exceeds a pre-de.ned threshold.


2.THE REGISTING POLLING AP explicitly allocates transmission opportunities to wireless clients by a polling mechanism with a polling list during a CFP.

even after the opportunitiesare allocated and the traffic streamsare admitted, the frame loss and delay requirements of such traffic are still required to be met by intelligent polling mechanisms.


277  (a) Midnight -9h30 (b) 9h30 -Noon Switching to a different master is more desirable since increasing the synchronization interval increases the communication overhead of the synchronization process.

there are situations where increasing the synchronization interval is the only solution to increased stability.


The simulation consists of 20 or 25 wireless WIMAX Subscriber Stations (SS).

sS s are divided in smaller groups so that it is easier to change the Quality of Service (QoS) parameters and the simulated applications of the Subscriber Stations and so to observe the differences between them.


If the mobile phone has a built-in GPS receiver, it is possible for it to obtain zone information quite easily.

alternate techniques to obtain zone information include triangulation and .ngerprinting based techniques, using the cellular, WiFi, or Bluetooth interfaces [23, 24, 25].


It shows that the 1-RTP measurement for forward capacity (case (3)) is very accurate: 99% ofthe estimates(denotedby C f )fall within [0.87,1.10] Mbits/s.

the1-RTPmeasurement signi.cantly underestimatesthe reversecapacity(case(II)) with99% ofthe estimates(denotedby C )fallingwithin [3.63,14.18] r Mbits/s.


Avoidance of paging processing at a single point: The LMA can be a single point to track the precise location of the MH.

to reduce the scalability and reliability concerns, we consider that the paging processing would be distributed among the MAGs [1, 3].


We also observe that LACNIC and AFRINIC are responsible for 12% and 2% of the allocations, respectively.

although the wellconnected regions dominate the absolute number of pre.xes, the ratio of IPv6 to IPv4 pre.x allocation per region tells a slightly different story.


On the other hand, if we tolerate x.f irstF rame > n.lastF rame , then the reconnecting peer (n) can have newer frames available from the parent peer immediately without waiting.

it would experience some frame loss since the oldest frame the parent peer can provide (that is the frame x..rstFrame) is somewhat ahead of the frame the reconnecting peer needs (that is the frame n.lastFrame +1).


In AODV, the destination node creates a RREP for the .rst RREQ received, and discards other RREQs from the source that arrive later on.

from the above discussion, we know that packets that arrive via longer paths tend to be more reliable.


Mobile IP (MIP) [19] provides separation between a locator in the fixed Internet by introducing a Home Address, corresponding to the MSISDN, and the Care-of Address, a dynamically changing locator corresponding to the MSRN.

mobile IP does not clearly separate identifiers from locators, but allows transport protocols to continue using the locators as identifiers.


Client performance suffers from this lack of coordination: operators of service replicas currently have no visibility into the performance or cost of alternate network paths between a service replica and its clients, so they optimize replica mapping based upon the current network paths that have been exposed as a result of network operators traf.c engineering optimizations.

network operators, who do have access to alternate wide-area paths, have little insight into the application-level performance these alternate paths might provide.


Since both the police and .re.ghter roles are similar, we have chosen to omit .re.ghters and simply add more police to simulate .re.ghters.

it is quite simple to include .re.ghters, or other responders, and give them appropriate behaviors.


Many homes with a broadband Internet link are equipped with a WiFi-enabled router, and most mobile devices now integrate wireless WiFi chipsets, allowing users easy network connectivity.

from a security perspective, wireless aps present a number of problems.


Sampling a suf.ciently large number of .ows to ensure (with high probability) that at least one .ow is sampled per path is possible.

besides theextra multiplicativefactorin memory(to cover the number of paths and the extra factor to ensure high probability coverage), the sampling scheme hasafatal .aw.


The contents are not limited by the access medium but become more extensible to offer more valueadded services to user.

iMS Emergency Services was not discussed until 3GPP Release 6.


Social network studies showed how people interact based on social ties and how this can be used in networking when they form groups at given times [1, 10].

existing DTN protocols still maintain a contactonly vision for their decisions; in other words, they overlook the perspective of nearby nodes.


Generally, as in FRED, active flows are defined as ones whose packets are in the outbound queue [10].

we took slightly different approach in detecting active flows, in that an active flow is one whose packet has entered the outbound queue unit during a certain predefined interval since the last time checked.


This means that PF scheme cannot utilize better channel condition e.ectively because scheduling based on channel quality measured at previous timeslot cannot precisely re.ect actual channel condition.

throughput of proposed scheme shows an increasing tendency as the number of crossed timeslot cells increases.


Because of such localized operation, simultaneous grants of multiple output ports are not guaranteed.

the locking mechanism guarantees forward progress even under such nonsimultaneous grant.


The sensed data must be made available to a sink node through single or multi-hops communication for further processing by user application.

communication is energy consuming and must be minimized in order to save unreplenish power supply.


In the VM, the sampling of a neighbor is uniform and the updating node is more likely to imitate the strategy that the majority of its neighbors play, regardless of their payo.s.

when E =1, the sampling is based on the payo.


We marked points (small rectangles containing number) from one to nine, which represent reconnection areas to other APs, therefore an interval generated by two rectangles indicates which AP is connected to the Y/T with a dotted line.

we cannot guarantee the quality of the link such that the link is continuously alive during the period (interval) between Y/T and AP, because a line is drawn along the points, which are generated whenever any AP s wireless frame is discovered.


It is easy to check that if players choose their initial action in the order 1,,,nthen in the resulting assignment after each player makes one decision the only provided market is market 1.

in the optimum assignment all markets are provided.


The two interfaces involved in the handover could be of the same or different access technology types[2].

in order to support MIF in PMIPv6 domain, not only address and interface information management but also address filtering function is required in LMA.


System of Quality monitoring for IP Telephony Services Murilo Vetter, Roberto Willrich Programa de Pós-Graduação em Ciência da Computação (PPGCC) Departamento de Informática e Estatística (INE) Universidade Federal de Santa Catarina (UFSC) 88040-900 Florianópolis SC Brasil murilo@pop-sc.rnp.br, roberto.willrich@ufsc.br  ABSTRACT IP telephony is a consolidated service that has been growing steadily, driven by its various advantages.

maintaining the quality of this service is still a challenge.


When the retransmission interval estimate is large, a large number of the packets will be discarded when the buffers are occupied by packets that are not lost downstream and are not required to be retransmitted.

when the retransmission interval estimate is small, the packets (including those that are lost downstream and are required to be retransmitted) occupying the buffers will get replaced prematurely.


We show only a subset of applications due to space constraints.

the results for each of the remaining applications resemble closely to one of these four and our conclusions remain valid.


They employ the vector model to represent a periodic pattern, which we also use in this paper.

it is quite different from our approach in the sense that we provide an algorithm that deals with arbitrary interference, stations, and geography, while only grid alignment of nodes is considered in [2].


The number of correct answer replies increased in the daytime and decreased at night, correlating to activities at Japanese universities.

the number of DNS errors did not vary substantially compared to that of correct answer.


We require a self-con.guring system which is capable of dealing with a very large set of hosts (millions), many of them potentially quite .aky.

because the targeted application is web caching, the Plaxton algorithm does not provide a solution whereby nodes can independently discover their neighbors in a decentralized manner.


The di.erence between the OWD of the last packet and the .rst packet of the same probe train can be used to compute the increasing OWD in the probe train.

if a probe train does not induce congestion, then there will be no change in the OWD between the .rst and last packet.


Therefore, their respective time-frequency grids won t align perfectly.

the receiver will synchronize to the data transmitter s grid since its primary goal is to decode the data packet.


In this subtrie, pre.xes 00* and 01* are kept although they can be collapsed to a single pre.x 0*.

the next-hops of the pre.x 00* is changed from (N1|N1) to (N2|N1).


The actual network selection decision is made so that the network with the least value of U is chosen.

handovers from access networks with large coverage areas (like UMTS and CDMA2000) to access networks with smaller coverage areas (like WLAN and WiMAX) are delayed until the condition: Unew < Uold a is true where a is a hysteresis avoidance constant used in order to avoid ping-pong effects.


For each relay group path, Cashmere incurs computational cost that includes encryption cost of L· Ce at the source, decryption cost of 2Cd at relay group root, decryption cost of Cd at each relay group member, and additional operations to refresh caches after relay group root failures.

these cost are amortized over a much longer path duration than node-based systems and dwarfed by the cost of rebuilding paths in node-based systems.


It keeps the look-ahead behaviour ofMLN,becauseitdoes not consider the current community.

as in MLN, it considers all the other communities the user is in touch with, and not only the most likely one for the next visit.


From (2) and (3) we get N Kij hi XX Dout 1 1 (k) (k) ¯= r - t i ij ij N - 1 Kij j=1 k=1 j =i 23 N N XX 1 67 ¯¯N - 1 = 4Rij - Tij5(6) j=1 j=1 jj=i =i The second summation involves only terms such as tij (k) and so is known to ISP i.

iSP i does not know the receive times r (k), so the problem (for ISP i) becomes that of calculating ij N X out 1 ¯ ¯ Ri = Rij, (7) N - 1 j=1,j# =i ¯ the average receive time over the probes.


Just as in the first main alternative described above, name resolution needs to know about the top-level routing topology.

because that topology is very constrained, the top-level routing problem can be handled by three simple steps: (1) a default path can always be used to reach a top-level structure, (2) name resolution needs to know which top-level structure a node is attached to and (3) the top levels need to know how they are interconnected to each other.


Note that only one-time sending of the ADV packets would su.ce if the sensor nodes are immobile, reducing the periodic route maintenance overhead signi.cantly.

in highly dynamic network conditions, where the sensor nodes are mobile and fail frequently, the overhead involved in the above route maintenance scheme can be substantial.


For a= -0.4, sense interval adjustments occur too soon (when 90% of memory is available), which may change more quickly the value defined by the user for the Sense interval clause.

for a= -1.2, sense interval adjustments occur too late (just when one has about 30% of available memory), which may represent a significant amount of memory usage.


Current software-based packet classi.cation techniqueshavelowperformance,prompting many researchers to move their focus to new architectures encompassing both software and hardware components.

some of the newer hardware architectures exclusively utilizeTernaryContentAddressableMemory(TCAM) toimprovetheperformance of rulematching.thisresults insystems withhighpower consumption.


Figure 4(b) shows that the CPU utilization of the Scap user-level application is considerably lower than the utilization of Libnids and Snort, which at 3 Gbit/s exceeds 90%, saturating the processor.

the CPU utilization for the Scap application is less then 60% even for speeds up to 6 Gbit/s, as the user application does very little work: all the stream reassembly is performed in the kernel module, which increases the software interrupt load, as can be seen in Figure 4(c).


In both protocols, users contend on a control channel to request network resources .

the interpretation of resources is di.erent in the two protocols; in the Qualcomm protocol, it refers to connection availability, while in the CA-CDMA protocol it refers to a transmission .oor.


COMBI employs GREEDY and Log-time without considering the dependency between them.

as we observed from the theoretical analysis in Section 3.2, the inter-channel and intra-channel data allocations are mutually dependent and must be considered together in order to achieve the optimal performance in terms of average wait time.


Since every node potentially interferes with every other node in the network, GP hy is also a complete graph.

transmissions along links e1 = (u1, u2) and e7 = (u5, u6) can occur simultaneously (in either direction) in the physical interference model.


2.2 Camera Receiver Model Smartphones provide a convenient camera and computation platform for VLC reception.

smartphone imaging pipelines are optimized to produce perceptually pleasing images which entails purposefully altering color values, introducing non-linearity, and quantizing pixel intensities to 8 bits.


Spectrum sensing and white space database are two typical ways to determine which channels are locally available for reuse by the SUs.


DATA ACCESS MODEL The Web, almost from its beginning, has supported not just access to static documents, but also interactive information retrieval (e.g., search engines, street maps), information modi.cation (e.g., discussion forums, Web logs), and active operations with real-world side effects (e.g., ordering pet food, or buying stock in pets.com).

we seem unable to shake the habit of using the term document to apply generically to the object of Web requests.


FAIR focuses on price (or credit) determination.

price determination is not the focus of our work.


Due to this hardware limitation, we are unable to demonstrate throughput gains for higher-order blind IA systems.

our physical layer design including the frame format can be easily extended to a higher-order blind IA set up.


For simplicity of exposition, we consider a network in which all routers and hosts run our protocol.

our design only requires upgrades at network locations that are trust boundaries or that experience congestion.


Note that ideally the SINR thresholds for di.erent cards should also be calibrated by recording and comparing the SINR vs. loss rate curve for each client.

our algorithms do not require the SINR model to predict the link throughput with high accuracy (we validate this claim experimentally in Section 5).


Thus, traditional management of spectrum resources involves giving the authorized users priority use of the frequency bands.

measurements conducted by the FCC have revealed that large portions of the spectrum are only sparsely occupied.


In this solution, the probing range and wakeup rate can be adjusted to a.ect the degree of coverage indirectly.

this solution does not guard against blind points since there is no guarantee of sensing coverage [15].


µTESLA [36] relies on symmetric cryptography, and thus does not su.er from the above problems.

µTESLA requires loose time synchronization between the broadcast sender and the receivers.


Further, we were unable to determine the bit rate on the LTE links and could not accurately characterize the network load; thus, it was dif.cult to objectively quantify the bene.ts from our framework.

in the scenarios of interest (e.g., disasters), we expect that there will be suf.ciently large user activity that will strain the capacity of the network [7, 17].


Signature detection, or misuse detection, searches for well-known patterns of attacks and intrusions by scanning for pre-classi.ed signatures in TCP/IP packets.

anomaly detection is used to capture behavior that deviates from the norm.


We only collected the first 68 bytes of each packet and, hence, we were unable to distinguish between web browsing and peer-to-peer (P2P) applications.

p2P traffic was not as prevalent in 2003, especially in networks where the uplink is limited by a dial-up connection.


Consequently, everyone will be able to make use of all kinds of information without stress, anywhere and at any time.

we need to bring the idea of contextawareness as an essential element into reality to construct ubiquitous-network systems.


Fits to the upper tails of these curves yield values around I for o~, the power in a power-law distribution.

not all dis- tributions seem strongly heavy-tailed; see the lines for A1, for example.


This allows us to correctly infer direct links between the ASes that connect to each other at an IXP.

we cannot rely on the publicly available information to completely eliminate such kind offalse links because they are known to be incomplete.


Speci.cally, for each event message in its buffer, the event gatherer evaluates the respective subscription predicates every Tm time units and sends out the merged message to a subscriber if its predicate is satis.ed.

subscription predicates might depend upon .elds of the message that are currently empty.


Thus, UEs as attackers are out of scope for our work.

since OEMs participate in our scheme (see Section 7), we also regard OEMs as potential attackers with superior capabilities compared to third party attackers.


So, sensor node can make whole new binary code from partially transferred new binary code.

rMTD algorithm has O(n2) space complexity and it results in memory limitation problem due to its full scan manner.


When the medium is sensed to be idle for a speci.ed period of TDIFS , STAs are permitted to transmit.

to avoid collisions due to simultaneous transmissions from multiple STAs, an exponential backo.


Therefore, group activities can be shown in the centralized botnet more often than decentralized (P2P) botnets.

group activities can be observed in P2P botnets during upgrading/synchronizing [10].


Usually, general channel scanning mechanism scans all channels to detect a BS.

proposed mechanism scans only one channel designated by serving BS.


Nor do we suggest that they apply directly to networks constructed from fundamentally different technologies (e.g., sensor networks).

even for these cases, we believe that methodologies that explicitly account for relevant technological, economic, or other key aspects can provide similar insight into what matters when designing, understanding, or evaluating the corresponding topologies.


Equations (12) (13) also indicate that the performance of the BE RRM depends on how the (0) to r (1) rates are translated from r .

our investigations on this matter have shown that this choice only marginally affects the performance, provided that the degradation of the rate is fair and relatively small for every user.


These sources of inaccuracies may affect the absolute energy consumed.

since the same pro.le is used in each of the different schemes, these inaccuracies will not affect the relative energy consumption.


For our example network, there are at least 6 different designs (three different VLAN grouping schemes coupled with two different address allocation schemes.)

different designs have different levels of con.guration complexity.


Selective acknowledgements were also introduced as an extension to TCP.

measurements show that deploying a new TCP option can take up to a decade [4].


Since the number of packets contained in a frame increases as we use higher transmission mode, the speed of the increment in average packet delay decreases as we use higher transmission mode.

we can observe that average packet delay for transmission mode 5 is larger then that of the other transmission modes for small values of .. Thisisduetothefactthatpacket error rate of transmission  Pr{Q(t +1) = j, E(t + 1) = m |Q(t)= i, E(t)= l} .


THE NEW IMPROVEMENT We also use time limit information to resolve the timeliness problem of ZG.

unlike K. Kim et al's improvement, our approach needs no clock synchronization mechanism.


We will provide .ve Google Nexus S smartphones which are equipped with ten types of sensors: accelerometer, gravity meter, gyroscope, lightmeter, magnetic .eld sensor, screen orientation sensor, proximity sensor, location (GPS), soundmeter and vibration sensor.

compiled installation package will be made available for download, so that participants can use their own smartphones to carry out similar experiments.


In reputation-based schemes[12, 13, 5,3, 10, 11, 14, 17], a node s behavior is measured by its neighbors, and sel.shnessisdeterredby thethreatofpartial ortotaldisconnectionfromthe network.

duetopacket collisions andinterferenceitisnot alwayspossibletodetectif agiven node actually forwarded apacket asexpected,sosometimes cooperative nodes will be perceived as being sel.sh, which will trigger a retaliation situation that can potentially decrease the throughput of cooperative nodes.


Based on the priority, one of the PANs will continue to remain in the same channel which means that it goes back to the Normal state.

the other PAN will need to move from that channel, so it goes to the Explore Channels state to identify its subsequent channel of operation.


One can extend the approach with recording for example Quality of Service (QoS) data or making reliability measurements, calculating costs of using each MAP (costs might be di.erent if the IP mobility uses di.erent service providers).

in the present work we disregard these factors.


Now, if the interferer T 1 starts .rst, and the transmission from T starts later, R may need to abort T (Figure 4).

r must .rst ensure that the later-arriving signal is actually meant for itself.


We note here that the use of a time window between the reservation and the data packet channels has also been used in the Medium Access via Collision Avoidance with Enhanced Parallelism (MACA-P) protocol [4].

in that work the ob jective was not to address TPC, but rather to prevent collisions between control and data packets.


For example, it is assumed that the interference range is .xed and there are no hidden terminals in [6, 22, 23, 4, 26].

as studied by Xu and Gerla in [25], the interference range can be modeled as a function of the distances between the source and destination nodes, and the physical layer techniques.


(9) Table 2 gives the parameters for deriving the transmit power from the SNR /dB.

the safety to human body is evaluated in terms of the SAR as averaged over any ten gram of tissue.


We prove that our algorithm can achieve better level of security by detouring traffic via paths without or with less vulnerable areas at the same amount of redundancy.

we also prove, using simulation results and mathematical derivation, our algorithm can provide much more redundancy for better multimedia quality purpose while at the same time guaranteeing the same level of security.


This shows that ReversePathSearch can effectively overcome unidirectional links by exploring multiple reverse paths.

the delay performance of the Hello technique is counter-intuitive.


In case of LAS-MAC, the number of multi-hop reservations is reduced with interference and the latency is increased.

lAS-MAC has good latency except that concurrent data is forwarded.


Some works include as main energy buffering rechargeable batteries [10], [12].

batteries have a finite number of chargedischarge cycles, being recommendable the use of another solution based on supercapacitors [11], [13].


Given the large increases in computing power available now, it is rare for this to be the limiting factor in a simulation.

in our case, there is a practical limit on T imposed by the nature of stationarity in the real system under observation.


The plot at the top is the original trace that is obtained by capturing the times when write() is called.

we inserted a shim layer where these writes are trapped so as to enforce tra.c shaping.


Recent work [6] has started taking steps along this approach.

we believe our work is more focused on directly developing a user registration model, and is, to our knowledge, the only comprehensive attempt to develop a model using very extensive experimental data from campus WLAN traces.


Both principles discuss the placement of functionality within a network, and in both cases the rationale for the principle lies in the tradeoff between the performance advantages obtained by embedding application-speci.c functionality and the cost and complexity of doing so.

the Tenet principle is not subsumed by, nor a corollary of, the end-to-end principle, since it is based on a speci.c technological trend (tiered networks).


These limitations will be addressed in a future version of this work.

current results already permits to intuit the advantages brought by our solution, as they can be seen as a lower bound of the actual performance benefits.


In a more recent work, Shah and Wischik [27] established the optimality of MW-0 ` with respect to overloaded .uid models as well.

this collection of works stops short of establishing optimality for di.usion scaled queue-size processes.


In particular, the sensitivity of detectors in the context of network anomaly detection is misunderstood and prevents us from applying such techniques.

output fusion makes no assumption on the detectors as it inspects the results of all the detectors.


Pratyaastha: An Ef.cient Elastic Distributed SDN Control Plane Anand Krishnamurthy, Shoban P. Chandrabose, Aaron Gember-Jacobson University of Wisconsin Madison {anand,shoban,agember}@cs.wisc.edu ABSTRACT Several distributed SDN controller architectures have been proposed to mitigate the risks of overload and failure.

since they statically assign switches to controller instances and store state in distributed data stores (which doubles .ow setup latency), they hinder operators ability to minimize both .ow setup latency and controller resource consumption.


In fact, if such information is available (e.g., by reading queue statistics from a broadband modem or a wireless NIC), it could be plugged in directly in the calculation and the algorithm would work with no modi.cations.

devices rarely support this capability and henceforth we will assume this functionality is not offered.


The usual intrusion detection methods based on the ongoing traf.c volume or access patterns may not be sensitive enough to detect the presence of such spoofed traf.c.

hCF speci.cally looks for IP spoo.ng, so it will be able to detect attempts to fool servers into acting as re.ectors.


Symmetric and multicast hash-routing schemes have the potential of providing the best performance in terms of cache hits even in presence of low tra.c because every time a content object enters the domain it is delivered to the responsible cache.

this comes at a cost of potentially increasing the load of intradomain network links as a consequence of the detouring of content packets to be delivered to the cache.


For example, cost of (s12,a) -(s24,b) is 18 which is sum of temporal distance from a to b (10) and load on b (8).

the cost of an edge in case (iii) is simply the temporal distance between devices of corresponding vertices as it is the cost of routing .nal results back to the service requester.


TESLA-based broadcastauthentication schemes build one-way hash chains to authenticatesymmetrickeys[13,31,37].

tESLA-basedschemesrequire a timestamping server to achieve the non-repudiation property.


We consider the former model and focus entirely on the downlink operation of small cells for ease of exposition.

our solutions are equally applicable to the latter model and to uplink as well.


RECONCILING SAMPLING VARIANCE AND VOLUMEGOALS  This paper has dealt primarily with the control of sampling variance in order to facilitate accurate charging.

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


In the latter, an intruder could simply compromise any functional receiver and extract con.dential key information.

the keying material has to match the con.dential key information held at the transmitter.


For these reasons, MIMO techniques endow an ad hoc network to be designed and deployed with a higher degree of .exibility, improved communication reliability and globally higher performance.

these advantages are conditioned on the implementation of a careful medium access control (MAC) mechanism, that avoids receiver overwhelming.


We think that our tool did not identify all of the physical links in the network due to the small amount of data used for the experiment, so not all of the links logged enough related events to produce a statistically significant relationship.

the tool did identify the link between R5 and R7, which was the only nonphysical relationship identified within our test network, showing that our method can discover more than just physical relationships.


As an example, one of the end points of channel l3 intersects with channel l7 at point j6.

if an end point does not intersect with any other channel, it represents a dead end.


In other words, if a packet contains plausible evidence (i.e., packet is small or contains a piece), then a copy of the packet is sent to the slow path for examination.

if the anomaly count is too high or a piece is detected, the entire .ow is diverted to the slow path.


For instance, when a user move from a location with small RTTmin to a location with large RTTmin, the .ow may still memorize the previous smaller RTTmin and incorrectly adjust the receive window, leading to potential throughput loss.

we believe that the session time is typically shorter than the time scale of movement.


Basically, node joins and leaves informed by the mesh sub-layer are handled automatically, only variable initialization or reset is involved.

a current set of optimal .ows for a peer u may become sub-optimal after a competing peer leaves.


Thin .lm batteries are particularly attractive for EnHANTs since they are environmentally friendly and can be made .exible.

a battery needs to be supplied with a voltage exceeding the internal chemical potential (typically 1.5-3.7V) in order to start storing provided energy.


The traditional Matrix Pencil scheme is applied to the raw channel response data.

we notice that with Matrix Pencil applied to the noiseless signal-space eigenvectors, we are able to achieve even better performance than either MUSIC or traditional Matrix Pencil although the computational load is a little bit higher.


FST enables transition of communication of stations from any band/channel to any other band/channel in which 802.11 is allowed to operate.

in order to provide a seamless transfer between bands, 802.11ad introduces what is known as transparent FST.


Passive measurements carried over different locations in the U.S. Sprint IP backbone allow us to study the transmission delay of voice packets and to evaluate the degree of congestion.

this kind of measurement cannot provide any information related to link failures or routing instabilities.


In this case, the cache hit ratio for popular items will be high, and a small number of selected items can be fetched from a close router.

a large number of non-cached items (which correspond to the tail part of the Zipf distribution) may have to be downloaded from a distant place, and its delivery cost is not marginal.


It was observed that PSO converges in to a result more quickly since computational time required for PSO is less than CLPSO.

cLPSO gives more accurate result since it localization error is much less compared to PSO.


So the sender can retransmit only the missing segments avoiding the retransmission of the duplicated segments that has been transmitted successfully, while the conventional TCP might retransmit from the first segment of the last cumulative ACK.

we believe whole segment retransmission by a single bit error is too inefficient in the satellite communication which occurs in high probability according to a communication path with narrow band.


This MMPS-BF increases the bandwidth utilization compared with the other two approaches.

a MSS may pay more wakeup time if its data is smaller than the capacity of one OFDM frame but is allocated to cross over the boundary of two OFDM frames.


The objective of the Illinois Wireless Wind Tunnel project is to facilitate the evaluation of protocols for wireless networks (for instance, the testbed will be used to evaluate power control protocols, and protocols for recon.gurable antennas).

designing the iWWT in itself is a challenging endeavor, since the wind tunnel calls for scaling of the wireless environment that provides realistic measurements.


ti.able links [9] with properties that cannot be uniquely determined.

we are not concerned about the characteristics of individual links, and we do not restrict the paths we measure.


This makes our protocol deterministic, so that the claims of high probability no longer make sense.

producing a set of keys that collide under SHA-1 can be seen, in some sense, as inverting, or decrypting the SHA-1 function.


This shows the feasibility of such studies, and also the benefit of automating admin workflows.

the project stopped short of automating the triggering of the actual workflows and only replaced long sequences of human actions by a single human invocation of an automated workflow.


The addition of extra clients discourages the network operators from enabling UCAN relay.

a malicious client may intentionally remove a legitimate client from a relay path in order to gain a larger share of the credits with some credit assignment strategy.


over omni-directional antenna in terms of energy ef.ciency?

note in some situations it is desirable that the node density that the energy consumption in the transmissions is proportional to and consequently number of neighbors of nodes is large enough.


However, if packets are sent infrequently, then the route may break before the weakening link can be detected.

the relay-sets and CDMA can be used for opportunistic route repair as follows.


For a very small number of the periodic assessments, connections were deemed transport limited.

a connection that does not experience any loss over some interval will be in congestion avoidance mode and will be appropriately deemed transport limited.


It requires an extensive search to construct up-to-date blocks whenever a SACK block is delivered, and hence, may require more memory space.

tCP-PRISM uses a simpli.ed version of scoreboard, which only maintains a list of lost packets from the negative loss information.


This simple change is a good .rst step for use in the .eld today.

application throughput is reduced by 35% or more with just 16 concurrent senders.


If the AP is not over-loaded, it should propagate ADVERTISE in all available channels so that MHs in other trees can learn about this alternate path.

if AP .nds it is overloaded, such propagation to other channels is unnecessary and the ADVERTISE will only be sent down in the local tree.


In dense networks, for instance, several vehicles might decide to drop a packet since it was already forwarded by several vehicles, decreasing the broadcast storm problem.

the AID protocol does not address the temporal network fragmentation and network partition problems.


Stations use request-to-send (RTS) and clear-to-send (CTS) packets to reserve channel and evaluate the signal to interference and noise ratio (SINR) during contention slots.

long contention periods are not suitable for underwater networks because of the high propagation delay.


Because the nodes do not move, and since the network is not partitioned, one would have expected that this percentage would be zero.

oLSR incorporates timeouts, for renewing its topology entries.


Intuitively the child node should prefer to join these parent nodes that can help it achieve higher SOpt values.

sometimes judgment only based on SOpt can be misleading.


TCP s semantics deter many of these attacks, since missing data violates the expectation of reliability and must therefore be handled by the application.

dCCP applications generally tolerate loss to some degree, making deliberate receiver misbehavior more likely.


Thus, it generally corresponds to the network layer of the current architecture.

the FARA model allows a wide range of forwarding mechanisms, and a FARA instantiation might allow multiple forwarding mechanisms to coexist in di.erent parts of the network, or even in the same nodes.


Therefore, designing high-performance blocks in the PHY, like the BCJR decoder, is still a challenge in Airblue.

we believe that our architecture is considerably easier to modify than other experimental wireless systems.


ROUTING PROTOCOLS There are different routing protocols available in the literature [13].

not all protocols offer the best performance under different conditions.


On the positive side, we do not know any non-trivial bound on the approximation quality of Maximum Acyclic ToR.

if we restrict path lengths, then we obtain a constant approximation ratio.


The actual assigned rates in this simulation run for .ows f1 , f2 and f3 are 1.15 Mb/sec,  0.63 Mb/sec and 1.15 Mb/sec, respectively.

due to the unfair MAC, almost none of the packets from .ow f2 are being transmitted, while both of the outer .ows achieve throughput exactly as assigned rates.


As we have seen earlier in this section, larger R value tends to choose shorter knowledge ranges.

the distributed protocol starts from the maximum knowledge range.


Logically centralized world views, as presented by controller frameworks such as Onix [7] enable simpli.ed programming models.

as the logically centralized world view is mapped to a physically distributed system, fundamental trade-offs emerge that affect application performance, liveness, robustness, and correctness.


A detailed analytical examination of the properties of this heuristic is beyond the scope of this paper.

qualitatively speaking, the queue length based approach has the following disadvantages: Bottlenecks.


Typically, such discriminating criteria refer to the packet size distribution per .ow, the inter-arrival times between packets etc.

for the most part, these methods do not exploit network-related properties and characteristics, that we believe contain a lot of valuable information.


Rare cases of large scale attacks (containing up to 30% of tra.c) were also observed.

most anomalies have much lower volume, and we tracked all anomalies with volumes down to 0.1% of the total tra.c volume.


issue multiple pipelined moves that each cover a smaller portion of the .ow space.

this requires more forwarding rules in sw and requires the application to know how .ows are divided among the .ow space.


It allows .le copy from one FTP-server to another using an FXPclient withoutgoingthroughthelocal machine.

to usetheFXP operation,both servers must support and enableFXP.many serversdo nothaveitenabledbydefaultduetoitspotential security risks and the overhead of allowing passive mode transfers, which typically requireablock ofportstobeopeninthesystem .rewall.


In the case of mobile sensors, nodes may only need to communicate when they have data to upload.

it is still useful to be able to wake up a mobile node to issue it a command or query.


enables the mobile terminal to 1 2 n 1  n 2 nj nM = = · ·· = C·= C maintain connectivity without any perceivable interruption.

c C (7) ·· the call may be dropped if there is not enough capacity in the new cell.


In the case of line-of-sight (LOS) propagation of the signal, this circle implies a set of possible locations for X, and three circles can uniquely determine [9] the location by having a common intersection point X.

the linear propagation path of the signal is blocked in the NLOS propagation, such as the one between B1 and A shown in Figure 1(a) and (b), and r1 (solid line) would be di.erent from the true distance (dash line) between A and B1.


2.1.3 Shared-node Fast Hash Table (SFHT) In the previous section, we saw that in order to perform incremental updates, we need an off-line BFHT.

with the assumption that the updates are relatively infrequent compared to the query procedure, we can afford to maintain such a data structure in control software which will perform updates on the internal data structure (which is slow) and later update the pruned data structure accordingly.


Ideally, C1-S1 and C1-S2 should be high-level identi.ers that get mapped to the IP pre.xes for the two sites through communication between the NM of the ISP and the NM of customer C1.

this paper is restricted to management in a single domain and hence, we provide the NM with this information.


The notion of data lifetimes has also been applied in Delay-Tolerant Networks [7].

while Delay-Tolerant Networks are designed to operate on relatively long time scales, we assume lifetimes that are on the order of few round-trip times, i.e., no more than a few seconds in typical networks.


As expected, the centralized solution presents the best results for all con.gurations.

the centralized solution incurs too much overhead during the topology dissemination process, what makes it un.t for WSNs.


Therehavebeen measurement studies[21,22] to characterizetypical networktraf.c and energy consumption on smartphones.

our focus is on developing a scalable platform for gathering measurements from the phonesinCWC.Severalprior studies[23,24] have observed that phones are idle and are being charged for signi.cant periods of time every day.


Then the adoption of IPHC protocol increases the CPU usage by the same percentage of 4%.

the IPHC latency is negligible comparing to the reduction that provides to the queuing latency Lqueue due to the decreasing of voice packet size to 34.5% as depicted in Table 1.


Then, the permutation with the minimum total cost is selected as the best one.

basic Besper has an obvious problem, which is the time spent for all the calculations.


Instead, with our scheme this almost never happens thanks to the presence of backup servers that can become active servers in case a group of nodes disconnects from the MANET.

since disconnected nodes stop transmitting and receiving packets, they also stop consuming energy; therefore, a side effect of these disconnections is that they significantly lower the total amount of energy consumed by the traditional scheme.


Tunnel-based: In this case, switches in the middle of a tunnel segment do not need rules speci.c to PhysSeq c,q ; they use the TunnelTable independent of PhysSeq c,q .

switches attached to a middlebox need two non-tunnel rules to forward traf.c to and from that middlebox.5 Consider the physical sequence S1-S2-FW1-S2-S4-S5-IDS1-S5-S6.


Even though a node failed, the influence on overall system would almost be neglected.

a lot of overhead is incurred for exchanging state information between nodes.


This procedure is repeated until the delay requirement is met.

due to the error of the link delay estimation model and the dynamic nature of network tra.c, the end to end delay may exceed the threshold during the operation.


Second, TeXCP is fully distributed whereas MATE s simulations assume that ingress nodes have instantaneous knowledge of the whole network state.

mATE does not need the core routers to report link utilization to ingresses.


When there is only one sink, the celebratedMax Flow-MinCuttheorem[7] shows that the maximum throughput achievable matches the minimum capacity cut.

once we allow even two sinks, it is easy to construct examples where the maximum throughput is strictly smaller than minimum capacity cut that separates the source from one of the sinks.


A good deal of research has studied how to infer performance characteristics from end-to-end measurements (the .eld of network tomography, e.g., [8, 10]), and how to use network measurements to diagnose traf.c anomalies (e.g., [9]).

research that studies the design and impact of the measurement technique itself is more sparse and generally considers a small set of optimization goals at a time.


For example, a soft-slicer block that could do any of BPSK, QPSK, 16-QAM or 64-QAM, will run for different amounts of time in each mode.

a branch is precisely a decision plane rule.


For example, the routing table of an upper pod switch contains all the subnet pre.xes assigned to that pod like before.

in addition, we add a /0 pre.x to match all remaining inter-pod traf.c that needs to be evenly spread upwards to the core layer.