sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: 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.
Sentence 2: such locally useless ex­pansions 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.
Relationship: contrasting
Domain: Networks
Sentence 1: this sum becomes di.cult because of the interplay between what the Network and the Victim do.
Sentence 2: we decou­ple them by not forcing the Network to run a .xed protocol when it has the message W, but instead for each distribu­tion of packets X allow it to use the protocol that will max­imize its probability of sending X.This can increase the probability of success.
Relationship: contrasting
Domain: Networks
Sentence 1: 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).
Sentence 2: since many potential parents may reply, contention over the shared medium may result.
Relationship: contrasting
Domain: Networks
Sentence 1: If beacon nodes are well distributed or se­lected with respect to certain clustering criterion, the perfor­mance is expected to be better, as was done in [2].
Sentence 2: as beacon nodes may not be practically placed at any desir­able 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 dis­tances to a subset of beacon nodes.
Relationship: contrasting
Domain: Networks
Sentence 1: At the .ow level this implies that the achievable transmission rates vary randomly from time slot to another.
Sentence 2: 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].
Relationship: contrasting
Domain: Networks
Sentence 1: This information is obtained by broadcast messages.
Sentence 2: 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 adver­tises its access delay only when it exceeds a pre-de.ned threshold.
Relationship: contrasting
Domain: Networks
Sentence 1: 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.
Sentence 2: the1-RTPmeasurement signi.cantly underestimatesthe reversecapacity(case(II)) with99% ofthe estimates(denotedby C )fallingwithin [3.63,14.18] r Mbits/s.
Relationship: contrasting
Domain: Networks
Sentence 1: 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.
Sentence 2: 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).
Relationship: contrasting
Domain: Networks
Sentence 1: 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.
Sentence 2: mobile IP does not clearly separate identifiers from locators, but allows transport pro­tocols to continue using the locators as identifiers.
Relationship: contrasting
Domain: Networks
Sentence 1: Client performance suffers from this lack of coor­dination: 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.
Sentence 2: network operators, who do have access to alternate wide-area paths, have little insight into the application-level perfor­mance these alternate paths might provide.
Relationship: contrasting
Domain: Networks
Sentence 1: 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.
Sentence 2: 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.
Relationship: contrasting
Domain: Networks
Sentence 1: 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.
Sentence 2: maintaining the quality of this service is still a challenge.
Relationship: contrasting
Domain: Networks
Sentence 1: 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.
Sentence 2: 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.
Relationship: contrasting
Domain: Networks
Sentence 1: The actual network selection decision is made so that the network with the least value of U is chosen.
Sentence 2: 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.
Relationship: contrasting
Domain: Networks
Sentence 1: For each relay group path, Cashmere incurs computational cost that in­cludes 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.
Sentence 2: these cost are amortized over a much longer path dura­tion than node-based systems and dwarfed by the cost of rebuilding paths in node-based systems.
Relationship: contrasting
Domain: Networks
Sentence 1: 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.
Sentence 2: 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.
Relationship: contrasting
Domain: Networks
Sentence 1: Just as in the first main alternative described above, name resolution needs to know about the top-level routing topology.
Sentence 2: be­cause that topology is very constrained, the top-level routing prob­lem 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.
Relationship: contrasting
Domain: Networks
Sentence 1: 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.
Sentence 2: 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.
Relationship: contrasting
Domain: Networks
Sentence 1: Current software-based packet classi.cation tech­niqueshavelowperformance,prompting many researchers to move their focus to new architectures encompassing both software and hardware components.
Sentence 2: some of the newer hardware architectures exclusively utilizeTernaryContentAddressableMemory(TCAM) toimprovetheperformance of rulematching.thisresults insystems withhighpower consumption.
Relationship: contrasting
Domain: Networks
Sentence 1: 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.
Sentence 2: the CPU utiliza­tion 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).
Relationship: contrasting
Domain: Networks
Sentence 1: Server­drivenonsistenyappearspartiularlyattrative forlarge­saleworkloadsontainingsignifantquantitiesof dynamiallygeneratedandfrequentlyhangingdata.There aretworeasonsforthis.First,intheseworkloads,data hangesoftenouratunpreditabletimes.Therefore,lient pollingislikelytoresultinobsoletedataunlesspollingis donequitefrequently-inwhihasetheoverheadbeomes prohibitive.Seond,theabilitytoahedynamiallygener­ateddataisritialforimprovingserverperformane.Re­questsfordynamidataanrequireordersofmagnitude moretimethanrequestsforstatidata[11]andanon­sumemostoftheCPUylesatawebsite,evenifthey onlymakeupasmallperentageofthetotalrequests.
Sentence 2: todeployserver­drivenonsistenyprotoolsfor large­saledynamiwebservies,severaldesignissuesthat areritialtosalabilityandperformanemustbeexam­ined.Thispaperprovidesthefrststudyofserver­driven onsistenyforwebsitesservinglargeamountsofdynami­allygenerateddata.Ourstudyisbasedontheworkload generatedbyamajorSportingandEventwebsitehostedby IBM.,whihin1998served56.8millionrequestsonthepeak day,12%ofwhihweretodynamiallygenerateddata[12].
Relationship: contrasting
Domain: Networks
Sentence 1: DATA ACCESS MODEL The Web, almost from its beginning, has supported not just access to static documents, but also interactive information re­trieval (e.g., search engines, street maps), information modi.ca­tion (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).
Sentence 2: we seem unable to shake the habit of using the term document to apply generically to the object of Web re­quests.
Relationship: contrasting
Domain: Networks
Sentence 1: 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.
Sentence 2: 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].
Relationship: contrasting
Domain: Networks
Sentence 1: 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.
Sentence 2: 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} .
Relationship: contrasting
Domain: Networks
Sentence 1: 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.
Sentence 2: com­piled installation package will be made available for down­load, so that participants can use their own smartphones to carry out similar experiments.
Relationship: contrasting
Domain: Networks
Sentence 1: 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 ortotaldiscon­nectionfromthe network.
Sentence 2: 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 de­crease the throughput of cooperative nodes.
Relationship: contrasting
Domain: Networks
Sentence 1: For example, it is as­sumed that the interference range is .xed and there are no hidden terminals in [6, 22, 23, 4, 26].
Sentence 2: as studied by Xu and Gerla in [25], the interference range can be mod­eled as a function of the distances between the source and destination nodes, and the physical layer techniques.
Relationship: contrasting
Domain: Networks
Sentence 1: Both principles discuss the placement of functionality within a network, and in both cases the rationale for the principle lies in the tradeoff be­tween the performance advantages obtained by embedding application-speci.c functionality and the cost and complex­ity of doing so.
Sentence 2: 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).
Relationship: contrasting
Domain: Networks
Sentence 1: 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 pro­posed to mitigate the risks of overload and failure.
Sentence 2: 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.
Relationship: contrasting
Domain: Networks
Sentence 1: 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 con­tent object enters the domain it is delivered to the respon­sible cache.
Sentence 2: this comes at a cost of potentially increasing the load of intradomain network links as a conse­quence of the detouring of content packets to be delivered to the cache.
Relationship: contrasting
Domain: Networks
Sentence 1: 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).
Sentence 2: 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.
Relationship: contrasting
Domain: Networks
Sentence 1: 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.
Sentence 2: the tool did identify the link between R5 and R7, which was the only non­physical relationship identified within our test network, showing that our method can discover more than just physical relationships.
Relationship: contrasting
Domain: Networks
Sentence 1: 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.
Sentence 2: 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.
Relationship: contrasting
Domain: Networks
Sentence 1: The objective of the Illinois Wireless Wind Tunnel project is to facilitate the evaluation of protocols for wireless net­works (for instance, the testbed will be used to evaluate power control protocols, and protocols for recon.gurable an­tennas).
Sentence 2: designing the iWWT in itself is a challeng­ing endeavor, since the wind tunnel calls for scaling of the wireless environment that provides realistic measurements.
Relationship: contrasting
Domain: Networks
Sentence 1: 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.
Sentence 2: 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.
Relationship: contrasting
Domain: Networks
Sentence 1: Inpartiular,alloftheseprogramsunder­estimatethelast linkonthispath.Thisisbeausethedestinationhostre­spondstoprobeswithanICMPportunreahablemessage whihisupto584bytes.ThisiswithintheRFCstandard beauseitsometimesallowsthesendertomakeamorea­urateorrelationbetweentheICMPpaketandtheUDP paketthatausedit.However,pathhar,link,andphar apparentlydonottakeintoaounthowmuhlongerthe largeICMPpakettakestotravelbaktothesoure,aus­inganunderestimationofthebandwidth.
Sentence 2: thelongpathresultsaresummarizedinTable5andTa­ble4.Theseresultsshowthatthereisnotsignifantau­mulationoferrorinthetailgatingimplementationompared totheothers.theresultsofalltheprogramsdevi­atebyasmuhas68%fromthenominalvalues,eventhough therewasrelativelylittletraÆduringthistime.
Relationship: contrasting
Domain: Networks
Sentence 1: It allows .le copy from one FTP-server to another using an FXP­client withoutgoingthroughthelocal machine.
Sentence 2: to usetheFXP op­eration,both servers must support and enableFXP.many serversdo nothaveitenabledbydefaultduetoitspotential security risks and the overhead of allowing passive mode transfers, which typically requireablock ofportstobeopeninthesystem .rewall.
Relationship: contrasting
Domain: Networks
Sentence 1: 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 com­mon intersection point X.
Sentence 2: the linear propagation path of the signal is blocked in the NLOS prop­agation, 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.
Relationship: contrasting
Domain: Networks
Sentence 1: 2.1.3 Shared-node Fast Hash Table (SFHT) In the previous section, we saw that in order to perform incre­mental updates, we need an off-line BFHT.
Sentence 2: with the as­sumption 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 struc­ture accordingly.
Relationship: contrasting
Domain: Networks
Sentence 1: 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.
Sentence 2: this paper is restricted to manage­ment in a single domain and hence, we provide the NM with this information.
Relationship: contrasting
Domain: Networks
Sentence 1: Therehavebeen measurement studies[21,22] to characterizetypical networktraf.c and energy consumption on smartphones.
Sentence 2: our focus is on devel­oping 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.
Relationship: contrasting
Domain: Networks
Sentence 1: 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 .
Sentence 2: 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.
Relationship: contrasting
Domain: Networks
Sentence 1: When there is only one sink, the cele­bratedMax Flow-MinCuttheorem[7] shows that the max­imum throughput achievable matches the minimum capac­ity cut.
Sentence 2: 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.
Relationship: contrasting
Domain: Networks
Sentence 1: A good deal of research has studied how to infer performance characteristics from end-to-end measure­ments (the .eld of network tomography, e.g., [8, 10]), and how to use network measurements to diagnose traf.c anomalies (e.g., [9]).
Sentence 2: research that studies the design and impact of the mea­surement technique itself is more sparse and generally considers a small set of optimization goals at a time.
Relationship: contrasting
Domain: Networks
Sentence 1: From Figure 13, we can easily observe that when fs is greater than 7.06KHz, the error increases dramatically.
Sentence 2: due to the extra computation burden from the period delimiter searching and the interruptions of the MCP to other tasks, the 7.06KHz sam­  1000 800 600 400 200 Light Intensity (mV) CDF -600 200 -800 0 -1000 Calibration Interval (min) Figure 15: Logic time error v.s.
Relationship: contrasting
Domain: Networks
Sentence 1: Several bu.er management strategies can be used: (a) (b)   Wireless Transmission Figure 3: In-road Geographic Forwarding (1) FIFO (First In First Out), where the packets that stay the longest in the bu.er are eliminated .rst.
Sentence 2: this is not a good strategy because these packets may have more chance of being forwarded along the optimal path after wait­ing for quite a long time in the static node.
Relationship: contrasting
Domain: Networks
Sentence 1: Because of sensor noise and the need to limit the com­munication costs, we will only be able to generate approxi­mate coe.cients {d l} at each actuator, which will generate the approximate actuation .eld y.
Sentence 2: in [24] we showed that the MSE in the actuated .eld is upper bounded by a term proportional to the total MSE in the actuation coe.cients, f 2 ||y - y||2 = Ba dl - d l. l.L it is intuitive to think that relative to an individ­ual actuator s behavior, some sensor measurements will be more important than others.
Relationship: contrasting
Domain: Networks
Sentence 1: Similar to the INIC [1], we redesign a NIC and integrate it onto a multi­core CPU.
Sentence 2: our paper makes the following contributions compared to [1]: 1) Receive Side Scaling (RSS) [4], a technique for multi­core systems to map each TCP session to a specific core and balance workload across multiple cores, is deployed in the integrated NIC to leverage multiple execution cores; 2) we examine the behaviors of the integrated NIC with network receiving optimizations; 3) by leveraging the integration, we design an I/O­aware last level shared cache (LLC).
Relationship: contrasting
Domain: Networks
Sentence 1: Because the perturbation polynomi­als added to nodes u and v are di.erent, this addition changes the original match key at both nodes into new values that do not match anymore.
Sentence 2: we can throw away the least signi.cant r bits of the results after the addition, and thus, we only have to deal with the most signi.cant l -r bits of the results.
Relationship: contrasting