sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: Whentheforeignagentreeivestheregistrationreply fromahomeagent,itsetsthemobilenode'soperational modetoativeandthenrelaystheregistrationreplyto themobilenode.Ifthemobilenodedoesnotreeivethe registrationreply,itsmoderemainsidleinitsownreord.
Sentence 2: lossoftheregistrationreplymessageanresultinstate inonsistenybetweentheforeignagentandmobilenode reords.thisstateinonsistenyisshortlived.
Relationship: contrasting
Domain: Networks
Sentence 1: Table 2 contains results using the fpa selection criteria with the variable distribution 2Recent studies [35] have pointed out some limitations in Rocketfuel data, suggesting that the number of actual phys­ical routing elements may be less than inferred by their mea­surement technique.
Sentence 2: this particular inaccuracy in the present data places more stress on our mechanism than the suggested corrected scheme would place.
Relationship: contrasting
Domain: Networks
Sentence 1: PDQ was the .rstto point out that minimizing FCTs requires preemptive .ow schedul­ing and attempts to approximate the same ideal .ow scheduling algorithm as pFabric to minimize average FCT or missed deadlines (§3).
Sentence 2: like D3 ,PDQ s .ow scheduling mechanism is also based on switches assigning rates to individual .ows using explicit rate control.
Relationship: contrasting
Domain: Networks
Sentence 1: proposed a op­timized LIPA-SIPTO solution that perform bearer speci.c o.oading of mobile tra.c [12].
Sentence 2: the proposed so­lutions require signi.cant fundamental changes in the stan­dard protocols (including changes in the UEs and eNodeBs) and/or use of additional expensive o.oading infrastructure like Home-eNodeBs, local GWs etc.
Relationship: contrasting
Domain: Networks
Sentence 1: Each of these proposals has it s own merits; stateless schemes are easy to manage while state-full schemes patrol uncooper­ative .ows more ef.ciently but do not scale.
Sentence 2: given the number of AQM proposals it is beyond the scope of this paper to do an exhaustive performance evaluation across all schemes, hence we will only evaluate CHOKe and BLUE as they represent the stateless alternatives to this work.
Relationship: contrasting
Domain: Networks
Sentence 1: On the one hand, when s = 5.0dB, the reduction in tracking error for VT-LANDMARC is about 13.4% over the original LANDMARC in the interim area.
Sentence 2: when s = 8.0dB, the positioning error of 50% samples for the original LANDMARC below 4.33m, and 90th percentile is about 6.46m.
Relationship: contrasting
Domain: Networks
Sentence 1: If B n-1,n<Bn-1,n during [tn-1,tn], the n-1, n TA Server SIP Terminal Local Client Network If accepted INVITE INVITE If declined Decline Decline 180 Ringing 200 OK ACK MPLS Network INVITE Decline 180 Ringing 200 OK ACK Traffic stream TA Server SIP Terminal Local Client Network If accepted INVITE INVITE If declined Decline 180 Ringing 200 OK ACK ... local client network doesn t have enough outgoing bandwidth to accommodate all the SIP calls, and the TA server has to utilize admission control algorithm to decline some of the call requests.
Sentence 2: if Bpred n-1,n>Bn-1,n during [tn-1,tn], some outgoing bandwidth resource of the local client network would be wasted.
Relationship: contrasting
Domain: Networks
Sentence 1: This implies the surprising result that, under this attacker model, the incremental gain to adoptability for increasingly strong secu­rity properties is very small or nonexistent.
Sentence 2: under a more realistic weak attacker model, the full-path security property has up to ten times the adoptability of a scheme compared with partial path security (e.g., soBGP) or simple origin authentication.
Relationship: contrasting
Domain: Networks
Sentence 1: First, mark all links in good paths as good; the rest of the links are unmarked .Then,selectthebadpath pb with thehigh­est available bandwidth among the remaining paths and as­sign the available bandwidth of pb to all unmarked links on pb (pb is then labeled as justi.ed and all links in pb are marked).
Sentence 2: we repeat the previous step until there is no un­justi.ed path in .. thetwoconditionsof Lemma-1(goodlinksare removable and bad links are detectable) may not be true in practice.
Relationship: contrasting
Domain: Networks
Sentence 1: DPSP OPTIMIZATION The method presented to this point and the experimental resultsinSection 6showthatinpracticethe method is much less expensive than its worst-case computational complexity, which is still polynomial as shown in Appendix A.
Sentence 2: in order to avoid excessive computation while still produc­ing highly reliable path sets,we de.ne the following early stopping criterion: If the improvement in the reliability of the path set drops below a given threshold,the method can conclude.
Relationship: contrasting
Domain: Networks
Sentence 1: At the end of the data reception at node j, if the actual interference perceived by node j is higher than a certain percentage (e.g., 75%) of the planned interference (.max Pthermal), then the AW size need not be changed, since the allocated additional power to combat MAI was e.ciently used.
Sentence 2: if less than that threshold was used, then node j checks the number of concurrent transmissions that actually took place in that AW (based on numbers of CTS and DTS packets).
Relationship: contrasting
Domain: Networks
Sentence 1: Trace Samples Correlation Median Mean name included w/latency residual residual C2 261931 (45.4%) 0.581 -0.017 0.164 C2p 238948 (44.8%) 0.584 -0.015 0.176 R2 20546 (51.4%) 0.416 -0.058 0.261 R2p 15407 (49.0%) 0.421 -0.078 0.272 U2 312090 (53.7%) 0.502 -0.022 0.110 U2p 258049 (53.8%) 0.519 -0.024 0.124 U3 336443 (52.8%) 0.334 -0.018 0.152 U3p 259028 (52.7%) 0.353 -0.016 0.156 U4 414209 (54.2%) 0.354 -0.013 0.141 U4p 320613 (54.4%) 0.425 -0.010 0.136 Residual values are measured in seconds; 1 MSS length 32KB Table 4: Quality of predictions based on equation 1 In Table 4, the median residuals are always negative, im­plying that equation 1 overestimates the transfer latency more often than it underestimates it.
Sentence 2: the mean residuals are always positive, because the equation' s un­derestimates are more wrong (in absolute terms) than its overestimates.
Relationship: contrasting
Domain: Networks
Sentence 1: 6.1 Micro-benchmark In order to evaluate the accuracy of LoadSense, we need to com­pare the LoadSense prediction (high/low) with the observed cellu­lar throughput at a given mobile.
Sentence 2: since LoadSense works when the radio is in RRC disconnected state, we don t know the exact cellular throughput available when the radio is passively esti­mating load.
Relationship: contrasting
Domain: Networks
Sentence 1: If a transmitter successfully transmits frames for a pre-determined number of times, it increases its data rate to the next higher rate and the current carrier sense threshold is associated with the new transmission rate.
Sentence 2: if a trans­mitter encounters transmission failures for a pre-determined number of times, it decreases the carrier sense threshold to a next lower one (in the case that currently it uses higher carrier sense threshold than the default one associated with current transmission rate) or decreases its transmission rate to a next lower one and uses the carrier sense threshold asso­ciated with the transmission rate (in the case that currently it uses the same carrier sense threshold as the default one associated with current transmission rate).
Relationship: contrasting
Domain: Networks
Sentence 1: 4.2.2 Statistics Cycles are less common than loops: they appear on only 0.84% of the measured routes.
Sentence 2: they ap­pear on a broader range of the nodes: we observe cyclic mea­sured routes towards 11% of the destinations, and the cycles concern 3.6% of the IP addresses discovered during our ex­periment.
Relationship: contrasting
Domain: Networks
Sentence 1: One surprise in our findings is that many of the processes are well-modeled as IID, once we identify change-points in the process s median (loss, throughput) and aggregate fine-grained phenomena into episodes (loss runs, delay spikes).
Sentence 2: iID models are a mixed blessing; they are very tractable, but IID pro­cesses are very hard to predict.
Relationship: contrasting
Domain: Networks
Sentence 1: The Election one is the closest to the LINGER framework, as it employs one of the mobile nodes as the information carrier and runs an election process among nodes in the targeted geographic area when the current carrier leaves such region.
Sentence 2: the solution in [13] requires a geocast routing protocol to deliver the information to the elected node, with all the associated overhead, while LINGER is self-contained.
Relationship: contrasting
Domain: Networks
Sentence 1: Studies about analy sis of p erformance degradat ion of resp ective WBANs in multip le WBANs environment or measures to solve t he p erformance degradation caused by occurrence of coexistence condition are in p rocess [2, 3].
Sentence 2: t hese studies do not indicate measures to detect or p redict coexistence condition but measures to imp rove p erformance after t hat int erference is occurred only .
Relationship: contrasting
Domain: Networks
Sentence 1: R0 R1,1 R1,2 R1,3 R1,4 R1,5 R3,2 R3,3 R3,5 R3,6 R3,7 R3,10 R8,1 R8,2 ­1.03 ­0.70 ­1.03* ­1.25* ­1* ­0.88 ­1.23** ­0.93* ­1.67** ­0.97* ­1.25** ­1.03* ­1.21* ­0.98* ­0.92 ­0.9 ­1.33* ­0.92 ­0.92 ­0.9* ­1.33** ­0.92* 1.12 ­1.23 ­0.82 0.88 ­1.03* ­1 ­1.12* ­1.33** ­1.10* ­0.96* ­1.32** ­1.02* ­1.75*** ­1.05** ­1.33** ­1.12* ­1.29** ­1.06* ­0.72 ­1.52* ­1.27* ­1.15 ­1.5* ­1.2* ­1.93* ­1.23* ­1.52** ­1.3* ­1.48* ­1.24  R3,1 R3,3 R3,4 R3,7 R3,8 R3,9 R3,10 R8,2 R8,3 R8,4 R8,5 Note: p<0.1, *p<0.05, ** p<0.01, ***p<0.001 the change in available bandwidth and provides accurate decisions on which the video quality levels are supported by current network conditions.
Sentence 2: we exam­ined the e.ects of QoE by video quality adaptation.
Relationship: contrasting
Domain: Networks
Sentence 1: We then terminate the simu­ 1 E2 C , |C| = K - 1 TC := lation when either the system size increases to the thresh­ 2 Function f is a.ne in the range [0, 2d], and thus the Lya­punov function W is quadratic in the state variable n in a corresponding range.
Sentence 2: we need to go beyond quadratic functions in order to apply the Foster criterion.
Relationship: contrasting
Domain: Networks
Sentence 1: The reason of this bad MCS selection is caused by the fact that SFER using the cur­rent MCS increases, because subframes in the latter part of A-MPDU fail due to mobility.
Sentence 2: frame error rate (FER) of probing frames might be lower than that of the currently employed MCS, since probing frames are sent to the air without aggregation, even if the MCS used by prob­ing frames is higher/lower and not suitable.
Relationship: contrasting
Domain: Networks
Sentence 1: The 700 0.8600 500 400 300 initialization of the WSMstream begins with a 5 second period where no data is sent and is followed by about a 10 second period where WSMstreams the clip at 500 to Bitrate (Kbps) Loss Ratio 0.6 0.4 200 0.2 600 Kbps to .ll a client-side playout bu.er.
Sentence 2: subsequently, 100 0 02 0 10 20 30 40 50 60 0 10 20 30 40 50 60 http://snad.ncsl.nist.gov/itg/nistnet/ Time (Sec) Time (Sec) 3See http://perform.wpi.edu/real-tracer/, used in [6] 4http://www.tcpdump.org/ Figure 6: Bitrate for 1128 Figure 7: Loss Ratio for 5http://dast.nlanr.net/Projects/Iperf/Kbps Clip1128 Kbps Clip if a clip with a bitrate even higher than the avail­ able capacity (e.g, 1128 Kbps for our testbed) is streamed, WSMchanges its transmission rate to a much lower bitrate, as shown in Figure 6.
Relationship: contrasting
Domain: Networks
Sentence 1: A member AS has the advantage to gain network connectivity to all other members of the IXP.
Sentence 2: interconnection arrangements re.ect bi-lateral agreements2 between a pair of member ASes, and these networks may want to impose certain conditions to ensure that they connect only to certain other networks or connect with them in ways that re.ect their business model and support their market strategies.
Relationship: contrasting
Domain: Networks
Sentence 1: The simulation scenario is based on the flash-crowd setting which represents an extraordinary burden on the network because only a small set of peers can upload data to others at the beginning.
Sentence 2: in our setup, if a regular peer finishes downloading, it remains in the network to seed the data for an additional 10 percent of its download time, which mimics the way BitTorrent peers behave in real-life.
Relationship: contrasting
Domain: Networks
Sentence 1: For this class of users, what is rele­vant is the perceived QoS: as long as the QoS is satisfactory, there is no reason to move to another location.
Sentence 2: if the QoS degrades below an acceptable level, a typical user of this class may decide to look for a better location in the park, becoming stationary again when the perceived QoS is restored to an adequate level.
Relationship: contrasting
Domain: Networks
Sentence 1: This problem of recovering from BGP peering failures is addressed in [3] by relying on the provisioning of protec­tion tunnels between the primary egress and the secondary egress or the NEXT-HOP.
Sentence 2: fIFR does loop-free local rerouting upon any single intra-AS or inter-AS failure without setting up of additional protection tunnels.
Relationship: contrasting
Domain: Networks
Sentence 1: In our proposed Hybrid PMIPv6 Indication mechanism, the MAG sends the RA message with PMIPv6 pre.x and Pre.x Type .eld 1 at the .rst time.
Sentence 2: because the MN needs on-link IPv6 pre.x, the MN sends the RS message with Pre.x Type .eld 0 .
Relationship: contrasting
Domain: Networks
Sentence 1: Figure 2(c) shows that for smaller epochs (0.5s), where we have 10 times fewer counters, the accuracy of both algorithms decreases.
Sentence 2: our conclusions that 1) The accuracy of sketch-based switches is better for restricted switch cost and small thresholds 2) We can save control network bandwidth with Max-Cover algorithm for large threshold and more expensive switches without losing ac­curacy are still valid.
Relationship: contrasting
Domain: Networks
Sentence 1: In such sit­  P(X = x)  0 1 2 3 4 5 0 500 1000 1500 Throughput (Mbps) RTT (ms) (a)Throughput (b)Round Trip Time  Figure 19: Comparison between DRWA and TCP Vegas as the solution to bu.erbloat: although delay-based congestion control keeps RTT low, it su.ers from throughput degradation.
Sentence 2: dRWA maintains similar throughput to CUBIC while reducing the RTT by a considerable amount.
Relationship: contrasting
Domain: Networks
Sentence 1: In [4], we pre­sumed that the network consisted of k + 1 equispaced nodes in one dimension, with the extremal nodes being s and t. The optimal values of n and k were derived analytically in this idealized setting.
Sentence 2: in this paper we report on randomly generated realistic experimental scenarios and provide an algorithm to determine the optimal values of n and k and the associated overlay network implementing the connection.
Relationship: contrasting
Domain: Networks
Sentence 1: As J increases, the utility values of those links with smaller re­quired transmission rates decrease for the sake of achieving a certain level of fairness.
Sentence 2: with di.erent channel gains, some link, say m th link, with a small required trans­mission rate may be forced to use a small value of am so that only a small value of Qm(a) is achieved, for example, Q4(a) in our numerical analysis.
Relationship: contrasting
Domain: Networks
Sentence 1: From 1970, when Burton Bloom .rst described a compact probabilistic data structure that he used to represent words in a dictio­nary [2], until 1995, there was little interest in using Bloom .lters for networking.
Sentence 2: judging from the number of papers that make direct or indirect use them [4], interest in such applications has surged in the last 10 years.
Relationship: contrasting
Domain: Networks
Sentence 1: Existing approaches for AP-mediated power management perform centralized scheduling based on PSM.
Sentence 2: these approaches are not application-agnostic and either make use of application-level proxies to shape traf­.c[12, 13, 14], are limited to certain traf.c types[18, 22, 23, 24], or require explicit hints from the applications[11].
Relationship: contrasting
Domain: Networks
Sentence 1: Prior works such as trajectory sampling [2] and NetSight [3] directly observe packets from the data plane, diverting all or part of the packet to col­lectors for after-the-fact analysis.
Sentence 2: we allow operators to control how much they want to store for later use, by only collecting tra.c satisfying pre-speci.ed queries, while .exibly supporting the full generality of queries avail­able in earlier approaches.
Relationship: contrasting
Domain: Networks
Sentence 1: Introduction Multicast transmission offers tremendous savings in net- work bandwidth over unicast transmission for applica- tions that deliver the same content to multiple cus-tomers by allowing these customers to "share" the trans- mission on common access links [8].
Sentence 2: this shar- --"rU-~versity of Massachusetts, Department of Computer Sci- ence, University of Massachusetts, Amherst, MA 01003-4610.
Relationship: contrasting
Domain: Networks
Sentence 1: Hence, the performance of Multi­facet is similar to that of Traditional repeater as the co-ordinated transmission throttling ensures that the AP does not stripe packets on shared link.
Sentence 2: for C2 and C3, repeater client link is not the bottleneck and hence Multifacet can start utilizing the spare shared channel capacity leading to client throughput improvement over Traditional repeater.
Relationship: contrasting
Domain: Networks
Sentence 1: [3] proposed an optimized adaptive broadcast scheme in which the average rebroadcast prob­ability of each vehicle varies with local node density, and through the setting of random timers the number of relays is minimized.
Sentence 2: the selection of parameters like counter threshold and probability is empirical, and the above schemes result in either sur­plus relays or over-reduction of retransmissions which decreases packet reception probability in unreliable links.
Relationship: contrasting
Domain: Networks
Sentence 1: The technical details of TRIAD s solution and our own are quite different: in TRIAD, the resolu­tion step and the routing step are con.ated, thereby improving la­tency, and at the shim layer between IP and transport, they use forward and reverse tokens that record the path taken, instead of stacks.
Sentence 2: the main difference between our proposals is that identi.ers in TRIAD, both of hosts and data, are derived from do­main names, and indeed, the TRIAD approach relies on the seman­tics and hierarchy of domain names to aggregate routes to content names.
Relationship: contrasting
Domain: Networks
Sentence 1: For example, anAGR of0.5 representsa50%decreaseintra.c, 1.0 represents nochange,2.0 represents a100%increase,3.0 represents a 200% increase, and so on.
Sentence 2: as discussed in Section 2, changes in the com­mercialprobeinfrastructure can complicate ourgrowth esti­mation.
Relationship: contrasting
Domain: Networks
Sentence 1: 3.4 CorrectingMulti-Con.ictsforSINR Protocol Model The protocol models may result in poor actual perfor­mance because they neglect interference from several sources and/or fail to fully exploit spatial multiplexing.
Sentence 2: due to the relationship between the protocol model and the MWIS problem, we seek to extend the protocol model to im­prove the actual performance.
Relationship: contrasting
Domain: Networks
Sentence 1: (a) Sample Topology (b) Sample Level and Label Assignment Figure 1: ALIAS Applied to a Sample Topology: Level and Label Assignments clusters by automatically locating pockets of strong connec­tivity in the topology groups of switches separated by one level in the hierarchy with full bipartite connectivity between them.
Sentence 2: even assigning a common pre.x to all hosts connected to the same leaf switch can reduce the number of required forwarding table entries by a large factor (e.g., the number of host-facing switch ports multiplied by the typical number of virtual machines on each host).
Relationship: contrasting
Domain: Networks
Sentence 1: IEEE 802.11 0 1000 2000 3000 4000 achieves a cumulative throughput of 188.2kb/s and a fairness in­ 10 00 1000 2000 3000 4000  Time [s] Time [s] dexof 0.64.
Sentence 2: eZ-.owincreases the cumulativethrough- Delay F without EZ-flow Delay F with EZ-flow 3 3put to 304.6kb/s (a 62%throughputgainover the standard IEEE 30 25 20 15 10 30 802.11), increases thefairness index to 0.8, and drastically reduces  1000 2000 3000 4000 25 the end-to-end delay by an order of magnitude at least.
Relationship: contrasting
Domain: Networks
Sentence 1: KEYWORDS: Inter-domain policy, Peering, Data-oriented Networking, Internetworking, Network Architecture 1 INTRODUCTION The Internet architecture was originally developed for the needs of distributed computing, such as telnet, FTP, and RJE [4].
Sentence 2: the majority of the present Internet traf.c, es­pecially between network domains, is of content delivery na­ture, such as .le sharing, static web content, Internet radio, or other recorded voice or video, or control traf.c needed to locate or deliver any wanted pieces of content.
Relationship: contrasting
Domain: Networks
Sentence 1: In a unicast environment(when thegroup sizeis1),quota-basedprotocols(e.g.,Spray and Focus-A) perform only slightly better than smart .ooding­basedprotocols(e.g.,Prophet).
Sentence 2: thegapbetween quota-basedprotocolsand.ooding-basedprotocolsbecomes much larger as the group size increases (as shown in Fig­ure 2 (a)).
Relationship: contrasting
Domain: Networks
Sentence 1: In a fire situation, for instance, it is very important to have a reliable, fine-grain monitoring of the physical environment so that it is possible for the rescue teams to understand what is happening and take the best emergency actions on the environment, avoiding lives and patrimony losses.
Sentence 2: in order to understand what is going on in the environment and take the right actions, it is necessary to interpret the collected events accurately.
Relationship: contrasting
Domain: Networks
Sentence 1: The crash occurrence per­centages are not negligible.
Sentence 2: we make the following observations: (i) we consider only vehicles coming to a full stop but in many cases a simple slowdown would be su.­cient to avoid the danger, (ii) we do not consider the actual road conditions that correspond to the given, adverse chan­nel model; when the road is congested, drivers tend to adjust their speed to their neighbors, thus avoiding or signi.cantly reducing the exagerated here danger, (iii) the application model we employ could be improved, for example, by bu.er­ing emergency messages originating from not yet validated vehicles, in order to speed up the provision of the alert to the driver once the message is validated.
Relationship: contrasting
Domain: Networks
Sentence 1: IP-layerREhas recentlybeenleveragedinthecontext of cellu­lar wireless networks, providing up to 60% bandwidth savings on lasthop cellularlinks[22].
Sentence 2: rEfactortakesREastep furtherby adding thebene.ts of content overhearing, afeature not currently available in commercial cellular networks.
Relationship: contrasting
Domain: Networks
Sentence 1: DA-ARC successfully adapts its behavior to DA-RR to avoid limiting network capacity for dense network cases while still following the performance of DA-WR for sparse network cases.
Sentence 2: the last chart for NL = 320 pps holds the same trends seen at NL = 240 pps, with DA-WR degrading its performance further and yielding only less than 0.1 PDR at TS = 2000 m. DA-ARC does not degrade its performance much even at this network load for both dense and sparse networks, yielding 0.82 PDR at TS = 2000 m and 0.5 PDR at TS = 5500m.
Relationship: contrasting