sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: Scheduled access methods [7, 16, 19, 25, 27, 29, 31] can operate under transceiver and channel constraints and can address starva­tion by coordinating transmissions across multiple channels (be it time slots, frequency bands, or spread spectrum codes) in an op­timal manner.
Sentence 2: such techniques typically require global knowledge of topology and traf.c requirements as well as some form of infrastructure support: either global time slot synchroniza­tion (TDMA) or pre-distribution of codes (CDMA).
Relationship: contrasting
Domain: Networks
Sentence 1: Balancing Authentication and Location Privacy in Cooperative Authentication Liu Licai1, 2, Guo Yunchuan2, Yin Lihua2 and Sun Yan1, 2 1Beijing University of Posts and Telecommunications, Beijing, China 2Institute of Information Engineering, Chinese Academy of Sciences, Beijing, China { liulicai, guoyunchuan, yinlihua, sunyan }@nelmail.iie.ac.cn ABSTRACT In MANET, the cooperative authentication mechanism requires the cooperation of the neighbor nodes and significantly enhances the authentication probability.
Sentence 2: it exposes location privacy of neighbor nodes and is costly.
Relationship: contrasting
Domain: Networks
Sentence 1: Thus, intelligent path .nding algorithms [12, 13, 24] are required to manage aspects such as e.ciency, isolation, load balancing, QoS, etc.
Sentence 2: for the purposes of this paper, our implementation Figure 2: Topology graph generation  Figure 3: Hybrid-controller working .ow on adopts a simple shortest path algorithm.
Relationship: contrasting
Domain: Networks
Sentence 1: Since in the infrastructure mode of the 802.11 protocol all traf.c goes through the AP, one may think that placing all sniffers near the AP should maximize the capture performance.
Sentence 2: our experiments showed that the capture performance of To-AP traf.c 6We use the MAC time of the received frame, which is available in Prism2 header in the captured frame, as the local timestamp at each machine.
Relationship: contrasting
Domain: Networks
Sentence 1: OpenFlow MPLS and the Open Source Label Switched Router James Kempf, Scott Whyte, Jonathan Ellithorpe, Peyman Kazemian, Mart Haitjema, Neda Beheshti, Stephen Stuart, Howard Green james.kempf@ericsson.com, swhyte@google.com, jdellit@stanford.edu, peyman.kazemian@stanford.edu, mah5@cec.wustl.edu, neda.beheshti@ericsson.com, sstuart@google.com, howard.green@ericsson.com ABSTRACT Multiprotocol Label Switching (MPLS) [3] is a protocol widely used in commercial operator networks to forward packets by matching link-specific labels in the packet header to outgoing links rather than through standard IP longest prefix matching.
Sentence 2: in existing networks, MPLS is implemented by full IP routers, since the MPLS control plane protocols such as LDP [8] utilize IP routing to set up the label switched paths, even though the MPLS data plane does not require IP routing.
Relationship: contrasting
Domain: Networks
Sentence 1: Although Angle Based has a more intelligent delay function than Counter Based, its forwarding condition causes most of the nodes near the edge of a transmission range to rebroadcast because the condition is difficult to be invalidated for these nodes.
Sentence 2: our Cell Broadcast takes advantage of the fact that additional rebroadcasts besides the 4 corner rebroadcasts do not provide much additional coverage (as described in Section 2.4).
Relationship: contrasting
Domain: Networks
Sentence 1: In this case, the node where the dead­end was reached performs an expanding ring search until a closer node is found (or a maximum TTL has been ex­ceeded).7  3.2 Distributed Hash Table Above we described how packets are routed over (real or vir­tual) coordinates.
Sentence 2: routing by itself is not suf.cient to use the system.
Relationship: contrasting
Domain: Networks
Sentence 1: Using a mo­bile connection such as 3G or WiMax, information can be uploaded to a central storage and retrieved from the same storage.
Sentence 2: with the increasing number of devices generating data and the rates at which data is generated, the bandwidth requirements will quickly overwhelm the in­frastructure, especially considering that those networks are alreadypushed tothelimitto serve existing mobileInternet access.
Relationship: contrasting
Domain: Networks
Sentence 1: DEPLOYMENT SCENARIOS In Section 4.4 we presented upper bounds on the improve­ments in security from S*BGP deployment for choice of se­cure ASes S. We found that while only meagre improve­ments over origin authentication are possible in the security 3rd model, better results are possible in the security 2nd and 1st models.
Sentence 2: achieving the bounds in Section 4.4 could require full S*BGP deployment at every AS.
Relationship: contrasting
Domain: Networks
Sentence 1: When examining scenarios where the client or the AP are the bottlenecks, such inaccuracies may be acceptable.
Sentence 2: when 8 6 4 2 0 0 2 4 6 8 10 12 4 3 2 Error in Estimated Delay (%) Channel on which beaconsare decoded correctly Detected in 1 and 5 sec runs Detected only in 5 sec run 1 0 30 60 90 120 150 180 210 240 270 300 Delay Introduced at client (m sec) Figure 10: EDEN s accuracy of estimating the delay at a client these entities are not bottlenecks or when EDEN is examining a sce­nario with low delays or when contention is even worse (e.g., the contention delay can even be more than 20 msec in 802.11b), a bet­ter estimation is needed; we are currently exploring mechanisms to reduce such inaccuracies.
Relationship: contrasting
Domain: Networks
Sentence 1: It is worthy to note that secure device pairing methods are recent alternatives that do not assume pre-shared secrets, while enjoying higher usability (e.g., GDP [21, 20]).
Sentence 2: they assumed the existence of some additional out-of-band (OOB) secure channel that facilitates human-aided veri.cation, which may not be in­tuitive to use.
Relationship: contrasting
Domain: Networks
Sentence 1: The metric used in BubbleRap to decide if node a needs to forward a copy to node b is (a) the global rank if the two nodes come from different clusters and (b) local rank if the two nodes are from the same cluster.
Sentence 2: in our SNAMD schemes, we use (a) the delivery predictability [18] as the metric when the two nodes belong to the same cluster or (b) a node s estimated contact rate to a destination if the two nodes are from different clusters.
Relationship: contrasting
Domain: Networks
Sentence 1: If we are attempting to determine the minimum d such that all dK-graphs are similar to G, we can start with a small value of d, generate dK-graphs, and measure their dis­tance from G. If the distance is too great, we can increase d and repeat the process.
Sentence 2: to explore struc­tural diversity among all dK-graphs, we must generate dK­graphs that are not random.
Relationship: contrasting
Domain: Networks
Sentence 1: A more recent .ow cache scheme [4] uses a 4KB size cache that can be con­.gured to store 611 concurrent .ows, and reports a cache miss ratio of 4.85% on a sample trace containing up to 567 concurrent .ows.
Sentence 2: we will show in this paper that our rule caching ap­proach can achieve superior performance than .ow caching ones, with orders of magnitude lower cache requirements.
Relationship: contrasting
Domain: Networks
Sentence 1: A : dec(M, key(B)) The inference rule fails to predict what happens when M = enc(X, key(B)).Inthis case, A would wind up sending a cleart­ext message X,butthisis becauseofthe actionof A s decryption operation,not becauseoftheapplicationofaninferencerulebythe intruder.Thus,theinferencerules are not complete.
Sentence 2: althoughthereare subclassesofprotocolsforwhichgivensets ofinferencerules aresound(seeforexample[33,37]),this must be carefully worked out for each case.ifsuccessful, aug­mented inference rules have the advantage that they can be used with tools that do not support the equational theory that the in­ferencerules represent.
Relationship: contrasting
Domain: Networks
Sentence 1: MOTIVATION AND ATTACK METHOD 2.1 Motivation In a SDN environment, the control plane can dynami­cally enforce .ow rules when the data plane requires, and it enables us to control the network e.ciently.
Sentence 2: this kind of reactive-mode control can cause serious prob­lem when there are too many requests from the data plane to the control plane.
Relationship: contrasting
Domain: Networks
Sentence 1: With recent ad­vances of network coding theory, many multirate multicast techniques using network coding have been proposed and they hold promises of improving information multicast e.­ciency over the traditional application-layer multicast pro­tocols.
Sentence 2: all these network coding based multirate multicast solutions adopted a layered coding technique and involves computationally expensive optimization to decide the amount of information transmitted in each multicast layer.
Relationship: contrasting
Domain: Networks
Sentence 1: 3.3 Packet Spoo.ng After AMR meters have been installed, most customers and utilities trust the integrity of the collected meter read­ings, since AMR meters reduce human errors associated with the traditional analog meter collecting process.
Sentence 2: such a trust relationship must be questioned, should a mali­cious attacker be able to forge packets containing arbitrary data and successfully deliver them into the provider s data collectors.
Relationship: contrasting
Domain: Networks
Sentence 1: When the maximum node degree is bounded, polynomial algorithm with n O(d2) time complexity is known [18], where n is the number of nodes and d is the maximal node degree.
Sentence 2: n O(d2) is too slowfor our problem since data centers can havemillions of devices [6] and the maximal node degree can be more than100[9].To thisend,wedeviseO2,afast one-to-one mapping engine.
Relationship: contrasting
Domain: Networks
Sentence 1: An important di.er­ence between the observed and GT-ITM latencies is that a 11We acknowledge that this approximation su.ers if the latency distribution varies substantially and qualitatively from point-to-point.
Sentence 2: the approximation need only be good enough to capture the relative merits of di.erent approaches, and is not intended to provide quantitatively accurate descriptions of a method s performance.
Relationship: contrasting
Domain: Networks
Sentence 1: The interference power of cell B s BS9 to the sensor is then given as Pcell B s BS · (3Rcell)-a = 1023.5 · (3 · 33 × 103)-3 W = -96.5 dBm, which is comparable to the noise power of -95.2 dBm in the 6 MHz band [19].
Sentence 2: in (b), two cells that are three hops apart result in the interference power of -103 dBm, which is negligible.
Relationship: contrasting
Domain: Networks
Sentence 1: For instance, two of these alarms occur after Time [s] Time [s] approximately 200 and 300 seconds, respectively; both can be interpreted as false alarms, since there is no obvious need for adjusting the system-state estimate.
Sentence 2: the compensation (26) due to these events is not even noticeable for the first alarm, but causes a minor available-bandwidth overestimation for the second case.
Relationship: contrasting
Domain: Networks
Sentence 1: Using a =2for radio rate(W) and a =0.5 for source packets-per-second(.d)and routing over­head pps(.l)), we have the CIVs as: 4 CIV(W)= 2.965; CIV(.d)= 2.811; CIV(.l)= 1.020 Thus, radio rate W and source rate .dare about equally domi­nant, providing approximately a 3x increase in scalability.
Sentence 2: source rate is more easily changed by using a better codec for very little tradeoff in clarity.
Relationship: contrasting
Domain: Networks
Sentence 1: The anchors are assumed to be distributed uni­formly at randomin[0,1]d aswell.
Sentence 2: itis reasonable to assume that we have some control over the positions of these special sensors, or the anchors, and in the following we show that we get similar performance bound with the minimum number of anchors(m = d+1) if the positions of the anchors are chosen properly.
Relationship: contrasting
Domain: Networks
Sentence 1: The number of alive nodes ( Nodealive ) in the networks decrease and the number of dead nodes ( Nodedead ) increase and then the accuracy of density is weakened.
Sentence 2: like the traditional clustering method, the number of alive nodes decreases rapidly from the point of time when that number pass over a certain threshold after dead node's occurrence over time, and then the network lifetime terminates.
Relationship: contrasting
Domain: Networks
Sentence 1: The goal is for senders (e.g., S) to select the less resource constrained paths (e.g., S-X-Y-Z-D).
Sentence 2: because redistributed routes are assigned a static metric values (e.g., at B, Y, A and X), the initial weight information is lost and senders may still select the congested paths (e.g., S-A-B-C-D).
Relationship: contrasting
Domain: Networks
Sentence 1: Thereby,beacons from farther distances maybe received.
Sentence 2: it ispossible to achieve similar Low density High density D-FPAV full overhead 22.8% 41.4% D-FPAV reduced over­head 16.2% 18.6% DVDE/SPAV 0.42 % 0.42 %  Table 2: Overhead related to abeaconing of 10beacon messages per second, each with a size of 500 bytes.
Relationship: contrasting
Domain: Networks
Sentence 1: 7.2 Pathological Traf.c Pattern Replacing a core switch with a Quartz ring signi.cantly reduces latency and, for smaller networks with plans for growth, avoids the upfront cost of purchasing a large, expensive, and mostly empty core switch chassis.
Sentence 2: a Quartz ring does not provide full bisection bandwidth, which can impact performance for certain workloads.
Relationship: contrasting
Domain: Networks
Sentence 1: The trans­mitter can do so because it knows the channel to these receivers and hence it knows the attenuation its signal would experience.
Sentence 2: if the resulting signalpower after channel attenuationisbelow L dB, thetransmitter contendsfortransmitting concurrently.if the signal power after channel attenuation is still higher than L, the transmitter reduces its own transmission power so that after attenuationitisless than L dB.The transmitter contends(and if it wins the contention transmits) at this lower power, which can be canceled usingpracticalinterference nulling and/or alignment.
Relationship: contrasting
Domain: Networks
Sentence 1: In addition, the results in [20] and [32] are spe­ci.c to the interactions between BGP and an IGP.
Sentence 2: recent empirical studies [28], [25] show that operational net­works frequently deploymultiple instances of IGP and join them through route redistributions rather than with BGP to achieveimportant design objectives such as ef.cient routing.
Relationship: contrasting
Domain: Networks
Sentence 1: As our experiments presented in Section 7.5, AEDP is more energy e.cient at low data rates than the state­of-the-art receiver-initiated MAC protocol A-MAC [12], as AEDP avoids the overhead of the probe packets.
Sentence 2: a-MAC is more energy e.cient than AEDP for high data rate applications, where the cost of sending these probe packets are o.set by reduced overhead for transmis­sions.
Relationship: contrasting
Domain: Networks
Sentence 1: 5.4 Evaluating avoidance of false positives In §5.3, we show that our base algorithm has good ac­curacy on emulated blockages.
Sentence 2: application of our basic algorithm to readings of our second sensor-pair (T 2 d and T 3 around the choke in Figure 2(a); downstream of the d sensor-pair Tu and T 1 around the valve) shows a number of d false alarms, even though there were no blockages at that lo­cation.
Relationship: contrasting
Domain: Networks
Sentence 1: The small Fixed FEC adds a low over­head to the MPEG stream and works well with a low packet loss rate, but at higher loss rates, the playable frame rate decreases dramatically since the small Fixed FEC cannot provide enough protection.
Sentence 2: the large Fixed FEC gives adequate protection in the presence of high loss rates, but also introduces a large amount of unnecessary overhead when the loss rates are low.
Relationship: contrasting
Domain: Networks
Sentence 1: Given the almost universal use of TCP as the transport layer protocol in the current Internet, such works are clearly warranted.
Sentence 2: several applications of ad-hoc networking, including more promising ones such as mil­itary battle.elds, disaster relief operations, etc., are environments where a completely revamped protocol stack tailored to the operat­ing conditions is not merely feasible, but also justi.able.
Relationship: contrasting
Domain: Networks
Sentence 1: Meanwhile, ISPs formed a hierarchical structure and were classi.ed by tiers, with higher tier ISPs cover larger geographic regions and provide transit service for smaller/lower tier ISPs.
Sentence 2: recent study [17] has reported that large content providers, e.g., Google and Microsoft, are deploying their own wide-area networks so as to bring content closer to users and bypassing Tier-1 ISPs on many paths.
Relationship: contrasting
Domain: Networks
Sentence 1: Thesecorrespondtoaccessingastoredprefxandfollowing apointerinthecorrespondingexpandednode.
Sentence 2: theseextraoperationsarenotaprobleminahard­wareimplementationthatcanreadtheentirecompressed nodewithinasingle(wide)memoryaccess.Theneededop­erationscanbeperformedusingsimplecombinationallogic.
Relationship: contrasting
Domain: Networks
Sentence 1: Learning from the previous literatures, the fixed-width clustering, KNN score and one-class SVM are proposed by authors in [7] were demonstrated that they are superior to those the above traditional anomaly detection techniques, especially the performance of one-class SVM algorithm both in detection true positive rate (TP) and false positive rate (FP).
Sentence 2: their TP and FP are not as good as we expected (98% for TP and 10% for FP [7]).
Relationship: contrasting
Domain: Networks
Sentence 1: Instead, we estimate the shuf.e completion time under the worst-case assumption: the background traf.c (i.e., the traf.c of .ow, regardless of the number of mice .ows generated by X.For 20 or more new VMs contacted by X, there is an impact on the throughput of X s long .ow.
Sentence 2: we note that even if a VM were to contact so many new VMs per second with short .ows, it cannot sustain this rate for too long, since it would end up com­ municating with thousands of VMs in a short time.
Relationship: contrasting
Domain: Networks
Sentence 1: Asillustratedinfgure4thedelaywithbeamforminganten­nasisafairbitlower,espeiallyathighdensities.Thisis beause,duetodiretionaltransmissions,nodesbakofless andareableaessthehannelsooner.Althoughmanyof Tput% thesepaketsollide,nodesnonethelessgettheirpaketsout quiker.Thedelaydifereneisafatorofabout17inaseof density112,betweenomni­diretionalandthe20dBibeam.
Sentence 2: 100 80 60 40 20 0 10 20 30 40 50 60 70 80 90 100110120 Density Tput% vs Density for various Gain; 40 nodes; NumAnt=1 Figure3:Throughput:Steeredbeams,CSMA,nopower ontrol Thus,evenwithoneofthesimplestMACprotoolanda typialadhonetworkingalgorithm,therearesomegains inperformane.theyareprobablynotenoughto justifydeployingbeamformingantennas,andhenemotivate theenhanementsonsideredbelow.
Relationship: contrasting
Domain: Networks
Sentence 1: TWSS is an o.ering from IBM that enables Telecom operators to provide devel­opers with controlled, reliable access to network capabilities such as Location, SMS and Call Control through standards­based Parlay-X Web Services.
Sentence 2: wPS is an application that collects, manages, and distributes real­time presence information to applications and users based on the SIP protocol.
Relationship: contrasting
Domain: Networks
Sentence 1: INTRODUCTION Wireless sensor networks (WSN) have fostered new mod­els of collecting and broadcasting information with great po­tential use in the areas of environmental monitoring and in­telligent buildings, to name a few.
Sentence 2: a major hurdle in deploying a WSN is the limited battery life of a sensor node, requiring every node of a WSN to control its trans­mission power in such a way to maximize connectivity with lower power consumption.
Relationship: contrasting
Domain: Networks
Sentence 1: Theminimum and maximumtransmitpower values can be di.erent on di.erent 802.11 cards, vary with the frequencies used (such as in the 5GHz band) and also vary based on the gains of the external antennas connected to the cards.
Sentence 2: we assume that the levels are dis­creteatagranularity of3dB.In ourprototypewithAtheros cards, we vary the power levels between 0 and 18 dBm.
Relationship: contrasting
Domain: Networks
Sentence 1: Sometimes, the error is only incidental and the experiment completes successfully on the next attempt.
Sentence 2: it could be due to a design  Figure 5: AES Error Reporting error in the experiment, a con.guration error in the virtual machine, something speci.c about the object of the exper­iment (a particular malware sample or exploit), an error in the host (con.guration error in VMware), etc.
Relationship: contrasting
Domain: Networks
Sentence 1: Recent studies show that, in mobile ad hoc networks (MANETs and VANETs), the proactive routing protocols, generally, outperform the reactive ones in terms of network goodput and end-to-end delay [10, 26].
Sentence 2: proactive protocols su.er from a higher routing overhead, limiting their performance in terms of energy-e.ciency [3].
Relationship: contrasting
Domain: Networks
Sentence 1: Even with one more metric, the second combination can achieve the true positive rate of 94.44% for the controlled en­vironment trace and only 59.43% for the normal-tra.c trace.
Sentence 2: in terms of transferred bytes, these identi.ed hosts still constitute a signi.cant share of the total bittorrent tra.c, especially in the controlled trace (98.76% oftracetotal tra.c).
Relationship: contrasting
Domain: Networks
Sentence 1: Theo­retically, using a 40 MHz band should double the amount of throughput achieved using a 20 MHz band.
Sentence 2: as shown in Figure 1, all the 40 MHz channels are partially overlapping in the 2.4 GHz band, as opposed to the 20 MHz channels 1, 6 and 11 which are non-overlapping.
Relationship: contrasting
Domain: Networks
Sentence 1: It is seeking to estimate the next pulse ci c1 receive time in terms of ci Thus, E( ym+1)= t = ai(s ll - n,i n,1 c1 c1 c1 .¯i)+mai.
Sentence 2: in terms of c1, E( y )=t=s ll + m+1n,i n,1 c1 m. Also, since the variance s2 is de.ned in terms of ci,Var( ym+1) will also have a different value since we do a linear transformation to get from y c1 we will not go through the ym+1 to m+1.
Relationship: contrasting
Domain: Networks
Sentence 1: Theresulting softwarecanbeused asavalidationplat­formforseveralsharingpolicies,possiblyderived withinagame theoreticanalysis.Inthefollowing,we willshowsampleresultsfor orthogonal competitive sharing.
Sentence 2: given the modular na­tureofthesimulator,morecomplex gametheoretic approaches can be framed, even resorting to dynamic games, Stackelberg games andso on[17,21].
Relationship: contrasting
Domain: Networks
Sentence 1: 1, as one can de.ne the coe.cients using (j) * ai = hi(s ,f,j),i =1,...,m -1, where j corresponds to the jthpolynomial, and hi is a suit­able pseudorandom function.
Sentence 2: the communication cost is a linear function of W , and thus the scheme becomes too tedious when W is large.
Relationship: contrasting