sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: Opportunistic spectrum access and co-existence of several WPANs in the same physical area may be achieved through the so-called dynamic frequency hopping com­munities in which different groups of users simultaneously hop ac­cording to a number of prede.ned, non-overlapping channel se­quences [11].
Sentence 2: opportunistic spectrum access may also be combined with pseudo-random frequency hopping spread spec­trum (FHSS) [13] similar to Bluetooth [2]; such networks will be referred to as Cognitive Personal Area Networks, or CPANs.
Relationship: contrasting
Domain: Networks
Sentence 1: the ability to decode one transmission when multi­ple transmissions collide.
Sentence 2: when the signal from the trans­mitter T is much stronger than the interference, as shown in Figure 8, the signal from T is always correctly received by R, even when the actual interference level is high, i.e., when there is no attenuation at the receiver R. when the signal from the transmitter T is weaker than the interference, as shown in Figure 6, most of the packets from T are corrupted.
Relationship: contrasting
Domain: Networks
Sentence 1: In multipath load balancing, the traf­.c load between a source node and a destination/gateway is distributed among a set of alternative paths in order to maximize throughputperformance and minimize the impact of route failure.
Sentence 2: [5,6] report that multipath load balancing in single channel wireless networks only provides a negligible improvement in the performance due to route coupling among the alternative paths.
Relationship: contrasting
Domain: Networks
Sentence 1: +46457385876 +46457385833  +46457385804 hussein.aziz@bth.se hakan.grahn@bth.se lars.lundberg@bth.se ABSTRACT The main challenge of real time video streaming over a wireless network is to provide good quality service (QoS) to the mobile viewer.
Sentence 2: wireless networks have a limited bandwidth that may not be able to handle the continues video frame sequence and also with the possibility that video frames could be dropped or corrupted during the transmission.
Relationship: contrasting
Domain: Networks
Sentence 1: Furthermore, a theoretically optimal bu.er management policy, along with an e.cient distributed im­plementation for it have been proposed in [14].
Sentence 2: in the majority of these works, the bu.er man­agement and scheduling problem is formulated and solved in the context of end-to-end tra.c sent by one device to an­other well de.ned device.
Relationship: contrasting
Domain: Networks
Sentence 1: While this performance metric is well de.ned for single-resource systems, extending its de.nition to multiple types of resources leads to a throughput vector, where each component is the throughput of one type of resource (e.g., 10 CPU instruction completions per second and 5 bits transmitted through the output link per second), and different throughput vec­tors may not be comparable.
Sentence 2: another possible ef.ciency measure is resource utilization given non-empty system, or simply resource utilization in the remain­der of this paper.1 in a middlebox, different resources may see different levels of utilization.
Relationship: contrasting
Domain: Networks
Sentence 1: Faults on the wired network include IP link failures, Border Gateway Proto­col (BGP) miscon.guration [23] and network intrusions and DoS attacks [18].
Sentence 2: a wide array of tools [21] and architec­tures [13] have been proposed that help researchers to ex­tract information from the network to detect these faults fault diagnosis for wireless networks has to deal with the inherent spatial and temporal nature of wireless propagation.
Relationship: contrasting
Domain: Networks
Sentence 1: For packet-level FEC, various schemes are possible [17], including a simple XOR scheme [9].
Sentence 2: in this paper we suppose that if a packet has b bits then a codeword is taken from GF(2b) according to RS erasure coding [18][21], assuming 2b is much greater than the number of arriving packets, K. If b y .GF(2 ) is the ith packet data of length b, then FEC i packets are formed from polynomials of the form K -1 F(X ) = y + yX +L + yX (11) 12 K using powers of a, a primitive root of the Galois field GF, as the variable in (11).
Relationship: contrasting
Domain: Networks
Sentence 1: In the absence of any timing relationship between channels in di.erent cells, it is safe to assume that even if one channel on a carrier f is used in cell C1, no other channel on f can be used in a cell C2 E I N (C1).
Sentence 2: if we assume that the TDMA slots in all the base stations are synchronized, then it is possible for two cells C1 and C2, such that C2 E I N (C1), to acquire the same carrier f , but use di.erent slots on f without mutual interference.
Relationship: contrasting
Domain: Networks
Sentence 1: 4.2 LZW for Sensor Nodes (S-LZW) ToadaptLZWtoasensornode,wemustbalancethreemajorinter-relatedpoints:thedictionarysize,thesizeofthedatatobecompressed,andtheprotocoltofollowwhenthedictionary.lls.First,ourmemoryconstraintsrequirethatwekeepourdictionarysizeassmallaspossible.Additionally,asmentioned,wewanttocompressanddecompressrelativelysmall,independentblocksofdata.
Sentence 2: bothoftheseissuesfactorintoourthirddecisionregard­ingwhattodowhenthedictionary.lls.Thetwooptionsaretofreezethedictionaryanduseitas-istocompressthere­mainderofthedataintheblock,ortoresetitandstartfromscratch.Sensordataischangingovertimesoafterthedic­tionaryisfull,theentriesinthedictionarymaynotbeagoodrepresentationofthedatabeingcompressedattheendoftheblock.thatistypicallynotaproblemifthedatablockissmallsincethedictionarywillnot.lluntiltheblockhasalmostbeencompletelycompressed.
Relationship: contrasting
Domain: Networks
Sentence 1: Given node A and B have measurements to all landmark nodes, we can predict the bandwidth from A to B.
Sentence 2: this assumes that: (a) a number of high-bandwidth nodes (landmarks) exist; (b) all measurements have to go through at least one of those nodes; (c) the last-mile bandwidths of A and B are not greater than the bandwidths of the landmarks.
Relationship: contrasting
Domain: Networks
Sentence 1: As P is a static value whereas L changes during run-time, increasing values of L may lead to a prefer­ence of important frames over urgent frames even if urgent frames would not interfere any important frame transmis­sion.
Sentence 2: exchanging P and L would the ant cause to prefer less urgent frame packets even in cases where im­portant packets may run the risk of passing the transmission deadline.
Relationship: contrasting
Domain: Networks
Sentence 1: In our case, each node has a .xed degree 2k, therefore the complexity is equivalent to O(n2 log n), with per-node total complexity being O(n log n).
Sentence 2: for network .ow based optimization [28], [22], the per-node complexity is equivalent to a max-.ow computation, which is typically on the TABLE I THE STATIC MEDIA FL OW AUCTION ALGORITHM  Initialization .... .
Relationship: contrasting
Domain: Networks
Sentence 1: The leftmost router contains IP addresses solely from AS A s address space, and the rightmost router con­tains IP addresses solely from AS B s address space.
Sentence 2: the router in the center of the .gure may have interfaces with IP addresses from both AS s. Complicating matters, the endpoints of the link between AS A and AS B can come from either A or B s address space.
Relationship: contrasting
Domain: Networks
Sentence 1: Considering subfigure 9 (a) after the detection of the abrupt change at 1250 seconds, the underestimation of BART does not generate residuals large enough within 20 filter iterations to build up the required test statistic for indicating the need of additional system-state compensation.
Sentence 2: by increasing the filter bank to M = 80, as in subfigure 9 (d), the gain in performance is evident.
Relationship: contrasting
Domain: Networks
Sentence 1: For vehicular networks, clearly, this is not a concern: one may assume su.cient power and fast processors, largely on par with those on personal comput­ers.
Sentence 2: symmetric key authentication remains more suitable, largely due to the necessary burstiness of commu­nication: the window of time suitable for communication between two rapidly approaching vehicles is very short; this severely restricts the available bandwidth in the peer-to­peer communication mode.
Relationship: contrasting
Domain: Networks
Sentence 1: The format of the digests is very simple: a (0-1) bitmap B indexed by a hash function h. Initially, all entries in the 2Note such a granularity would be an overkill for TM estimation (for which 5 minute interval is good enough), but is necessary for accurate delay estimation.
Sentence 2: there is little storage cost dif­ference (in terms of gigabytes per hour) between different time granularities, as will be clear later.
Relationship: contrasting
Domain: Networks
Sentence 1: On August 31, 2004, after in­terval 208, there are failure scenarios where our robust path-based TE/FRR drives the traf.c demand to be almost 3.5 times the bot­tleneck link capacity.
Sentence 2: the .gure also shows that at these severe failure scenarios, even the optimal routing using intradomain links will drive the traf.c demand to be almost 3 times bottleneck link capacity, leaving it impossible for any fast rerouting algorithm to recover without signi.cantly reduced throughput.
Relationship: contrasting
Domain: Networks
Sentence 1: In a variety of locations, such as in the home or on the road, equipment including sensors, consumer electronics and Kiosk terminals is being installed; these devices can connect directly with networks and have a wide array of functions.
Sentence 2: because existing telecommunication devices use independent system that require specific methods to contact each communication partner, using a Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page.
Relationship: contrasting
Domain: Networks
Sentence 1: Scheduling: When a link belongs to more than one otherwise non-overlapping contention regions6 (also termed bottleneck link), the total number of transmissions in all those contention regions is limited by the amount of resources at the bottleneck link which is active.
Sentence 2: if the bottleneck link is passive, then its resources can be overloaded to increase the number of transmissions in each of those contention regions (if possible), thereby increasing the utilization.
Relationship: contrasting
Domain: Networks
Sentence 1: Proof: When more than one Sink subscribes to the same event, this implies that the same event noti.cation message willhave tobe sent toward theseSinks.
Sentence 2: as wehave already mentioned, due to the DDBMS over the Sinks the event noti.cation message will only have to be sent toward one of the Sinks that subscribed to the event according to the proposed solution.
Relationship: contrasting
Domain: Networks
Sentence 1: NOCS 11, May 01-04 2011, Pittsburgh, PA, USA Copyright 2011 ACM 978-1-4503-0720-8/11/05 ...$10.00.
Sentence 2: newly developed or emerging devices, circuits, and op­tics technology can be used to realize one-hop links through free­space optical links [20]: VCSELs (vertical cavity surface emitting lasers), PDs (Photodetectors), and collimating microlenses can be implemented in GaAs technologies and combined with a silicon chip, in which the transmitter and receive electronics reside, us­ing 3D integration.
Relationship: contrasting
Domain: Networks
Sentence 1: The above analysis leads one to believe that it would be inappropriate to use any routing protocol that uses path-reversal in route discovery, such as AODV, DSR, DD and LAR, in an asymmetric environment, because they would have a very high loss ratio.
Sentence 2: the simulation results we present later show that AODV and DSR work reasonably well despite the asymmetric nature of communication.
Relationship: contrasting
Domain: Networks
Sentence 1: Note that when using symmetric shared keys to authenticate/encrypt infor­mation then deniability is easy to achieve at least as long as the secret key cannot be tied, via third-party veri.able proofs, to the identities of the peers.
Sentence 2: when the symmetric keys are established via a KE protocol, which in turn uses public key techniques for authentication (as it is common in today s communications), then the weak link for deniability becomes this KE protocol.
Relationship: contrasting
Domain: Networks
Sentence 1: 3.2.2 Data Group Membership Our protocol must guarantee that, at all times, there is at least one member in the Data Group of each client, such that the client will be served by at least one mesh node.
Sentence 2: it would be wasteful to allow more than one node in the vicinity of a client (and therefore in the Control Group) to also be in the Data Group most of the time as this creates duplicate packets.
Relationship: contrasting
Domain: Networks
Sentence 1: Examples of these methods are based on discrete Fourier transforms (DFT) and fast Fourier transforms (FFT) [16] and the di.erent types of discrete cosine transforms (DCT) [7].
Sentence 2: such algo­rithms su.er from poor performance when used to compress data spatially or when noise is present in the collected read­ings.
Relationship: contrasting
Domain: Networks
Sentence 1: To support non-cooperative scheduling, it is currently nec­essary to use complex operating system solutions (e.g., real­time operating system (RTOS)), which require considerable processing overhead and reduce throughput performance.
Sentence 2: our novel Fair Multithreading approach is in­tegrated into the processor hardware and can ensure that threads receive exactly their weighted share of the processor while operating at the level of performance and granularity of existing cooperative thread schedulers.
Relationship: contrasting
Domain: Networks
Sentence 1: In this case the obvious solution would be to deploy FACH or HS-DSCH (when the moving UE enters the specific cell), multiple DCHs (while the UE is near the BS) and FACH or HS-DSCH (when the moving UE leaves the specific cell) respectively.
Sentence 2: the efficiency of switching transport channels at very short time periods, as in the case where the moving UE is at the edge and leaves the coverage area of BS5 (Figure 8), should be further examined in order to minimise ping-pong phenomena.
Relationship: contrasting
Domain: Networks
Sentence 1: We performed analysis and simulations for all listed weekly activity periods.
Sentence 2: due to the similarity in results from a given phase s weekly periods, we only present results for one week from each phase: we use week 34-2009 as a representative week for the pre-peak phase, week 50-2009 for the peak phase, and week 26-2010 for the post-peak phase.
Relationship: contrasting
Domain: Networks
Sentence 1: In most existing applications consensus algorithms can be modelled as positive linear sys­tems, which then allows the elegant theory of Nonnegative matrices and Markov chains to be employed to capture the convergence properties of the algorithms.
Sentence 2: little is known about implicit nonlinear consensus problems (see [18]moreau) and one of the main contributions of this paper is the proof of global stability for the implicitly given nonlin­ear systems describing the dynamics of algorithms presented in the next two sections.
Relationship: contrasting
Domain: Networks
Sentence 1: OFDM symbols are constructed in a way that both the symbols and their sub-channels are orthogonal, resulting in a zero Inter-Symbol Interference (ISI) and zero Inter-Carrier Interference (ICI) in an ideal case.
Sentence 2: in reality, the presence of fading environments and Doppler spread/shift destroys the orthogonality between sub-carriers as well as the orthogonality between OFDM symbols on a single sub­carrier.
Relationship: contrasting
Domain: Networks
Sentence 1: The work based on fluid model [9], which takes into account both the random multiplicative decrease and the role of bottleneck buffer, shows that the system can still converges to fairness.
Sentence 2: our simulation results (see section 4) reveal that it takes very long time to converge to the long-term fairness (measured at a timescale of connection time), when evaluated by a new fairness metric proposed in section 4.2.
Relationship: contrasting
Domain: Networks
Sentence 1: Clearly, both processes output a random bit, so they are computationally indistinguishable as the distributions are iden­tical.
Sentence 2: symbolically there is only one trace for the .rst process, while two for the second, and both traces of the second process (one where the output is 1 and one where the output is 0) can be distinguished from the single trace of the .rst one (where the output is 0 or 1 with probability 1/2).
Relationship: contrasting
Domain: Networks
Sentence 1: Let the Market Drive Deployment: A Strategy for Transitioning to BGP Security Phillipa Gill Michael Schapira Sharon Goldberg University of Toronto Princeton University Boston University Abstract With a cryptographic root-of-trust for Internet routing (RPKI [17]) on the horizon, we can .nally start planning the deployment of one of the secure interdomain routing proto­cols proposed over a decade ago (Secure BGP [22], secure origin BGP [37]).
Sentence 2: if experience with IPv6 is any indicator, this will be no easy task.
Relationship: contrasting
Domain: Networks
Sentence 1: This initial work we have completed has highlighted interesting areas of consideration for future work speci.cally related to the improvement of our Han­dover Manager and its functionality.
Sentence 2: in addition it has also highlighted some broader ranging concerns related to the challenges of incorporating Mobile Ad Hoc Networks into the Internet and the shortcomings that need to be tack­led to better support intelligent handover in this domain.
Relationship: contrasting
Domain: Networks
Sentence 1: Typical outer loop power control procedures increase or decrease the target bit­energy-to-noise-density ratio in order to achieve this .xed frame error rate.
Sentence 2: we have seen that in order to achieve e.ciency, the optimal target bit-energy­to-noise-density ratio should depend on the packet success probability as a function of the bit-energy-to-noise-density ratio, and in particular for best-e.ort tra.c should satisfy (11).
Relationship: contrasting
Domain: Networks
Sentence 1: Depending on the policies establishedamongASesand ontechnicaldecisions, somedi­rect connections may not be announced to the route collec­tor.
Sentence 2: for the same economic and technical reasons it is possible that the same direct connections hidden from the route collector are announced to other neighbors, prop­agated on the Internet, and .nally detected by the route collector from another feeder as a side e.ect.
Relationship: contrasting
Domain: Networks
Sentence 1: 3.3 Variable traf.c and large time-scale For large threshold T , the HHHs are mostly among pre.xes with shorter length covering many servers, whose traf.c are often more stable due to statistical multiplexing.
Sentence 2: when we decrease the threshold T , there are more HHHs with longer pre.xes, whose traf.c may change more frequently (e.g., it is more likely that a single VM sends bursty .ows).
Relationship: contrasting
Domain: Networks
Sentence 1: Traceroutes yield path information only at the IP routing layer, i.e., layer 3 of the networking stack.
Sentence 2: path in.a­tion could occur below layer 3, e.g., in MPLS tunnels, and hence may not be explainable by the geographic locations of traceroute hops, as seen in the example presented in Figure 17.
Relationship: contrasting
Domain: Networks
Sentence 1: Initially, the reassignment and aggregation had the positive result of maintaining slower growth in FIBs, while at the same time, new address prefixes were assigned to enterprise networks joining the Internet.
Sentence 2: the growth in FIBs returned to an exponential rate (and later a high linear rate) due to de-aggregation stemming from adding multi-homed and load­balanced address assignments [3].
Relationship: contrasting
Domain: Networks
Sentence 1: When huge traffic injected into the network, the rate of packet reception for both schemes increases significantly until reaching a peak at 1400 Kb for ExtTeGAR and around 900 Kb for SPEED.
Sentence 2: at the highest traffic rate (10ms), ExtTeGAR can maintain the rate more than 1000 Kb while SPEED drops almost half of its throughput.
Relationship: contrasting
Domain: Networks
Sentence 1: Then, FAPs allocate their subchannels to the linked FUEs aiming at maximize their own payment that guarantees the optimal result of the second step.
Sentence 2: the step opti­mum cannot guarantee global optimal result because in the .rst step, each FUE only concerns its own choice and it does­n t know other FUEs choice which means other FUEs linked to the same FAP may compete for the channel resource.
Relationship: contrasting
Domain: Networks
Sentence 1: The trade-o.s should now be clear: by using a more ag­gressive forwarding policy (i.e., higher ui(t)s and for longer durations), the message propagates at a faster rate and hence there is a greater chance of delivering the message to the destination earlier.
Sentence 2: this will lead to lesser over­all remaining energy in the nodes upon delivery of the mes­sage, and it will potentially push the energy reserves of some nodes toward critically low levels, degrading the future per­formance of the network.
Relationship: contrasting
Domain: Networks
Sentence 1: 5, we con.rm: (1) EDGE and RELAY mostly resemble the upstream and middle-stream since they contain many peers with bandwidth declaration of 1000 and 120 Kbps, respectively, (2) RELAY is likely to be the cluster that contains many in.uential peers for index poisoning since the .le keys distributed to the RELAY spread more and faster.
Sentence 2: since the volume of RELAY peers is nearly half of the total peers, we now consider identifying an even smaller set of in.uential peers among RELAY to achieve more effective Key Spread (Normalized) 5 4 3 poisoning.
Relationship: contrasting
Domain: Networks
Sentence 1: Con­sequently, RPSP will a.ect RCP-performance (e.g., goodput) because it is a function of parameters such as round-trip time and actual packet corruption rate, which are a.ected by the transferred packet size distribution [7].
Sentence 2: in previous work on RCP performance analysis over links with bit-errors, such as studies for TCP [2, 9, 13], the e.ect of RPSP was ignored.
Relationship: contrasting
Domain: Networks
Sentence 1: Under the assumptions made in Section 3.1, the optimal value fusion rule is to compare the following weighted sum of sensors measurements to a threshold(the derivation can be found in Appendix A): X si Yopt = · yi.
Sentence 2: s i as sensor measurements contain both noise and signal energy (see (4)), the weight ss i , i.e., the SNR re­ceived by sensor i, is unknown.
Relationship: contrasting
Domain: Networks
Sentence 1: Theydifferin thatFatTree useslarger quantitiesof lower speed (1Gb/s) links between switches, whereas VL2 uses fewerfaster (10Gb/s) links.
Sentence 2: in BCube[6], the hierarchyis abandonedinfavorahypercube-like topol­ogy, using hosts themselves to relay traf.c.
Relationship: contrasting
Domain: Networks
Sentence 1: Without pro­viding the details about the GPS localization technique, a general comment about the localization accuracy is that it is su.cient for the general use in automotive industry and that it can be su.cient for a variety of robot deployment ap­plications.
Sentence 2: it is worth noting that all the GPS lo­calization techniques need a signal from the satellites, which rules out this approach in con.ned and indoor environments.
Relationship: contrasting