sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: On a last note, we remark that the rubberband representa­tion used in NoGeo algorithm [28] is essentially the discrete version of .nding a harmonic map between the simply con­nected domain de.ned by the sensor .eld outer boundary and a convex planar domain.
Sentence 2: harmonic maps for multi-holed annulus can not be guaranteed to be a diffeo­morphism.
Relationship: contrasting
Domain: Networks
Sentence 1: Resource reservation uses packet or link scheduling on multiple logical or physical queues to explicitly reserve and allocate output bandwidth to each class of traffic, where a class can be a single flow or a group of similar flows [8].
Sentence 2: explicit resource reservation changes the current, effective "best effort" nature of the Internet, and the al-gorithmic complexity and state requirements of scheduling make its deployment difficult [11].
Relationship: contrasting
Domain: Networks
Sentence 1: Several recent e.orts by researchers and vendors have re­duced the energy-related costs of individual base stations, such as using more energy-e.cient components (especially power ampli.ers),better cooling, turningdownresource us­age at idle times, or applying alternative energy sources [4, 5, 9, 18, 31].
Sentence 2: limited attention has been given to designing or optimizing the overall network architecture to make it more energy-e.cient, either statically or dynami­cally.
Relationship: contrasting
Domain: Networks
Sentence 1: Regarding the energy consumption of the streaming links, observe that among the four partitioned schemes of Figures 5(a), 5(b), 5(c) and 5(d), the 7:1 has lower energy consump­tion as a result of the high spreading gain.
Sentence 2: in the 1:3 the energy consumption is much higher than in any of the other schemes.
Relationship: contrasting
Domain: Networks
Sentence 1: INTRODUCTION Modeling the performance of routing in heterogeneous de­lay tolerant networks (DTNs) is challenging since it must handle amount of di.erent nodes with wide characteristics coexisting together.
Sentence 2: with the rapid growth of dif­ferent types of users (in the terms of coverage range, trans­mission power, bu.er space and bandwidth), heterogeneous DTN is a trend in the further.
Relationship: contrasting
Domain: Networks
Sentence 1: R2CP: RADIAL RCP We have shown in Section 3 that a receiver-centric transport pro­tocol like RCP has performance gains over a sender-centric one, in terms of intelligent loss recovery, scalable congestion control, and ef.cient power management.
Sentence 2: the recent trends where mobile hosts are increasingly equipped with heterogeneous wire­less interfaces, have severely exposed the limitations of the func­tionalities provided by existing transport protocols.
Relationship: contrasting
Domain: Networks
Sentence 1: The concept of clusteringisinnoway newandithasbeen used asameansfor providing optimized communication inbothDTNprotocols toim­proveforwarding decisions[8] andinlast-hop stylevehicularnet­worksto support extended connectivity totwo or morehops around an access point.
Sentence 2: if one looks at clustering not as an op­timization possibility, but as an intrinsic characteristic of vehicu­lar networks, clustering not only shapes the network topology, but also resultsin a set of applications with requirements and commu­nication patterns that are so different that clearly they cannot be supported ef.cientlyby a single communicationparadigm.
Relationship: contrasting
Domain: Networks
Sentence 1: aRi(t - 1) + (1 - a)di(t), where a< 1 is a constant typically close to one.
Sentence 2: thus, we have a recipe for achieving PF allocation of rates [2]: m For all timest,assign dataratesdi(t) suchthat i di(t)/Ri(t-1) is maximized among all feasible di s. this maximization problem can be challenging for two reasons.
Relationship: contrasting
Domain: Networks
Sentence 1: We conclude three major distinctions: 1) The data structure to implement the ENPT in Original NCE in­volves complicated memory management, such as data movement, fragment management; 2) Original NCE allocates consistent codes to components and does not allow identical components be encoded to different, dynamic codes, which fundamentally contradicts with the code allocation function .. in this paper; 3) Original NCE only achieves lookup speedup,but does notexhibit good support for in­sert and delete operations.
Sentence 2: in this paper,NCE not only sig­ni.cantly accelerates lookup,but also insert and delete operations.
Relationship: contrasting
Domain: Networks
Sentence 1: From the perspective of an agent at source s, the routing decision made at intermediate node r in.uences only the performance of the path section from r to t whereas the performance of the section from s to r is .xed.
Sentence 2: in order to make the routing decision, r must gather traf.c information about the set of paths between r and t. r cannot control which one of the possible paths a packet will take once it has been forwarded to one of the vi s. Thus, r cannot exploit exhaustive information about all possi­ble paths.
Relationship: contrasting
Domain: Networks
Sentence 1: In partic­ular, network management stations within the domain require access to local network statistics in order to de­tect failures, diagnose and isolate con.guration errors, track link and server loads over time, identify intrusions and attacks, monitor service levels, etc.Although local network managers stand to gain the most by exposing information within a domain, we note that distributed services/applications within the domain may also uti­lize this information to optimizeperformance(e.g., load balancing requests across a server farm).
Sentence 2: one might conclude that it is best to hide all manage­ment statistics from nodes outside the domain perimeter, while permitting all access from inside.wear­gue that this policy is more restrictive than necessary.
Relationship: contrasting
Domain: Networks
Sentence 1: If dth = d, the probability of detecting the node as connected is 0.5, and Fconn is approximately 37% lower than Frss.In fact, Ir(d, dth)=2/p ~= d. =0.63 for dth  2.4.3 Discussion Comparison between Frss and Fconn shows that RSS mea­surements always carry greater information content than connectivity ones.
Sentence 2: this is only true as long as the nodes are within the radio range of each other.
Relationship: contrasting
Domain: Networks
Sentence 1: It is noted that end intuitively we attempt to deploy a routing node at the ver-Record the observations; tices v1, anticipating that the deployed routing node would end e.ciently connect all the nodes (for .exible vertices, were n = n - 1 nodes to be deployed there) in its neighbor collection S1.
Sentence 2: end as discussed in Section 4.1, it is not clear that de­ploying a node at the vertices v1 will produce a maximal Algorithm 2: Algorithm for dynamic deployment probability of connectivity between v1 and all its neighbor nodes.
Relationship: contrasting
Domain: Networks
Sentence 1: alineforwhichthisnodeisthehomenode)withnosharers,inthatorderofpreference.Ifnosuchlinesexistthentheattemptisabandoned,andanevictionmessageissentbacktothehomenode,asinL2S.
Sentence 2: vR smainadvantageoverL2SisthatmanyoftheL1evictionsareretainedbythelocalL2,andthereforemanyfutureaccesseswillhitinthelocalL2ratherthaninaremoteL2.itsmaindrawbackisthattherearemanyredundantL2copiesinthenetwork.Evenifalineofdataisnotsharedbymorethanonenode,itwillexistintwonodes(unlessthesharernodeisthesameasthehomenode).Thus,theeffectivetotalL2capacityisalmosthalved,whichleadstomorecon.ictsandhencemoreoff-chipmemoryaccesses.InSection4,weseethatwithamodestlysizedL2cachepernode,VRactuallysuffersa32%memoryaccesslatencypenaltyascomparedtoL2P.
Relationship: contrasting
Domain: Networks
Sentence 1: 3.2.1 Effect of extraneous traf.c 8 R and G (a)= dt is the gamma function.
Sentence 2: te 0 for workloads with a limited number of objects, the deviation of the average number of references to objects (denoted as (y)) from Equation 4 can be non-trivial, especially when (y)is small (since the minimum number of references is 1, not zero).
Relationship: contrasting
Domain: Networks
Sentence 1: We used a low-end laptop with 1.66 GHz CPU and 2GB DRAM to measure the decoding throughput.
Sentence 2: the measured decoding throughput is 160Mbps(for chunk size =32B).thedecoder through­putfor aSHAhashbasedschemeis only50Mbps, even with128B chunks, because clients have to compute SHA1 hashes for each cached chunk.
Relationship: contrasting
Domain: Networks
Sentence 1: The works [12, 17, 18] study the joint problem of allocating data rates and .nding a stabilizing scheduling policy in a multi-hop wireless network.
Sentence 2: our problem is different than the ones considered in [4, 5, 12, 17, 18]; we consider the prob­lem of minimizing end-to-end delay by jointly optimizing routing, scheduling and power control.
Relationship: contrasting
Domain: Networks
Sentence 1: Inthe absence of anIMD sessionthe shieldperiodically(ev­ery200 msin ourprototype) estimatesthis channelby sending a probe.Sincetheshield stwoantennas areclosetoeachother,the probe canbesentatalowpowertoallowothernodestoleverage spatialreuseto concurrently accessthe medium.
Sentence 2: widebandchannels: Ourdiscussionhasbeenfocusedonnarrow­band channels.the samedescription canbe extended toworkwithwidebandchannels whichexhibitmultipatheffects.
Relationship: contrasting
Domain: Networks
Sentence 1: One major differ­ence between a traditional application and a content distribution application is that the content distribution application often needs a large number of connections, requires frequent resource adjust­ment (e.g., connect or disconnect peers, reallocate bandwidth share among peers), and must be sensitive to control overhead due to the real-time nature of content distribution.
Sentence 2: with an in-network storage infrastructure like SAILOR, resources are con­sumed at a remote location and cannot be directly observed.
Relationship: contrasting
Domain: Networks
Sentence 1: becomes: .. ..... .. .... (5) [1].
Sentence 2: even legitimate domains (e.g., www.microsoft.com) In this case s was approximated with Sh(q)·Nq, where Nq is the can be queried by these hosts and could receive a high value for total number of times a query qj has been made during the traffic P(qj | Ihi=1).
Relationship: contrasting
Domain: Networks
Sentence 1: For example, only 65% of all AS records contain OrgID information, with AP-NIC and LACNIC providing none whatsoever; other ASes provide OrgIDs for the majority of records (59% for RIPE, 82% and 95% for AfriNIC and ARIN).
Sentence 2: even when coverage is good, many organizations use a number of di.er­ent OrgIDs making OrgID clustering di.cult.
Relationship: contrasting
Domain: Networks
Sentence 1: As a result of this, a BGP router administrator needs to keep replacing their existing router with a brand-new router whenever new solution is adopted as the best solution because the existing approaches to BGP security require that a BGP router administrator must purchase a brand-new router to have a capability for the new solution.
Sentence 2: the proposed solution can give a new capability to the used BGP router by updating the RRVT, so a BGP router administrator doesn t need to replace the existing router.
Relationship: contrasting
Domain: Networks
Sentence 1: Packet traces recording real-world Internet traf­.c are especially useful for research on traf.c dynamics, protocol analysis, workload characterization, and network intrusion detec­tion.
Sentence 2: sharing of Internet packet traces is very limited because real-world traces contain many kinds of sensitive infor­mation, such as host addresses, emails, personal web-pages, and even authentication keys.
Relationship: contrasting
Domain: Networks
Sentence 1: Mobility impacts the slow variations in the .rst order statistics of the wireless channel.
Sentence 2: rapid .uctuations in the channel, which determine the statistics used to approximate coherence time, are a result of Doppler cross correlation ratio 1 0.9 0.8 0.7 0.6 0.5 0.4 0.3 0 0.05 0.1 0.15 0.2 0.25 0.3 0.35 0.4 time (seconds) Figure 4: Cross-correlation statistics in an indoor o.ce setting at 2.5 GHz, collected using Hydra.
Relationship: contrasting
Domain: Networks
Sentence 1: In interpreting results taken from this network, it is impor­tant to note that it is an access and interconnection network for research institutes and universities without a signi.cant residential population, and is therefore somewhat biased to­ward weekday, working-hour tra.c.
Sentence 2: we focused on several subsets of the tra.c collected, in order to attempt to derive general number for .ow concurrency on the wider Internet from this tra.c set: All tra.c crossing the border of the network at large; we use this as a proxy for a large interconnect point.
Relationship: contrasting
Domain: Networks
Sentence 1: It is interesting to note that if the PEP/SNR relationship is nominal or steeper, then opportunism pro­vides a bit-rate that is approximately the same as deter­ministic forwarding.
Sentence 2: if the PEP/SNR relationship is shallower than nominal, opportunism provides a bit-rate that may exceed the bit-rate provided by deterministic for­warding by approximately 50%.
Relationship: contrasting
Domain: Networks
Sentence 1: In contrast, SpeckMAC-B determines whether the receiver is to be turned on for reception of the data frame, based on information contained in the wakeup packet.
Sentence 2: figure 6 show that when sending broadcast packets, SpeckMAC-B consumed more energy than SpeckMAC- D. when unicast packets were transmitted, SpeckMAC-B turned on its receiver for a shorter duration as a node was able to distinguish whether it was the intended destination using the wakeup frame and the receiver was turned on or off accordingly.
Relationship: contrasting
Domain: Networks
Sentence 1: Paris-Sud, CNRS Bat 490, 91405 Orsay, France awal@lri.fr ABSTRACT In wireless communication systems, adaptive modulation and coding (AMC) is used to improve the downlink (DL) spectral e.ciency by exploiting the underlying channel con­dition.
Sentence 2: aMC also reduces the uplink (UL) through­put because of feedback (FB) overhead which is used to carry channel information.
Relationship: contrasting
Domain: Networks
Sentence 1: Speci.cally, for each com­putational task the protocol requires node i to complete, ai may replace the task with an arbitrary polynomial-time algorithm; for each message the protocol requires node i to send, ai may either withhold the message or replace it with an arbitrary message and send the new message at an arbitrary power level.
Sentence 2: to sim­plify our model, we do not allow ai to send more messages than it is supposed in the protocol.
Relationship: contrasting
Domain: Networks
Sentence 1: This idea has been suggestedasafoundationforactivemeasurementof end-to-endde­layandloss[3].However,the asymptotic natureofPASTA means that when it is applied in practice, the higher moments of measure­ments must be considered to determine the validity of the reported results.Aclosely relatedissueisthefactthatlossis typicallyarare event in the Internet [39].
Sentence 2: this reality implies either that measure­ments mustbetakenoveralong timeperiod,or thataverage rates of Poisson-modulated probes may have to be quite high in order to report accurate estimatesina timelyfashion.increasing the mean probe rate may lead to the situation that the probes them­selves skew the results.
Relationship: contrasting
Domain: Networks
Sentence 1: Nine player game PMF and Q-Q plot (HL2DM) 5.1.6 Half-Life 2 Counterstrike Half-Life 2 Counterstrike also shows good agreement between the empirical and predicted distributions in Figure 23, Figure 24, and Figure 25.
Sentence 2: as with the other team games, there are some peaks among the smaller packet lengths that are difficult to capture in the synthetic model.
Relationship: contrasting
Domain: Networks
Sentence 1: Understanding DET and designing CENTAUR: The above results made clear that even a simple centralized scheduling tech­nique can provide signi.cant performance gains when downlink hidden terminals occur.
Sentence 2: theperformancepenaltiesinthe normalinterferencecase,andthelackofgainsinexposedterminals needfurtherinvestigation.Itturnsoutthatmuchofthisinef.ciency 2Note that the con.ictgraph canbe computedin stages with each instance taking 2.5ms.
Relationship: contrasting
Domain: Networks
Sentence 1: The focus in the nse [9] emulation framework of the ns simulator has been on net­work emulation.
Sentence 2: our goal is to use the ns-3 emulation framework [1], which has been completely re-designed with respect to previous versions of the ns sim­ulator.The ns-3 emulation framework allows executing ns-3 IP stacks over real physical devices implementing layer 2 (L2) functionalities.
Relationship: contrasting
Domain: Networks
Sentence 1: 4.4 Fairness of TCP Vegas The two main .ndings from previous investigations of TCP Ve­gas fairness, reviewed in 2.2, are: (1) Vegas removes Reno s bias against .ows with large propagation delays [4, 18, 21] , and (2) Vegas creates persistent congestion which causes unfair distribu­tion of the throughput due to inaccurate measures of baseRT T [5, 18].
Sentence 2: these issues have primarily been analyzed in envi­ronments where the Vegas sources experience no loss.
Relationship: contrasting
Domain: Networks
Sentence 1: For example, a node at level 1 (a direct child of the root) is de.ned by a pair composed of a random seed and a group index as in the previous scheme.
Sentence 2: to select a group represented by a level 2 node, we need .rst select the tags belonging to its parent node, and then divide them into W sub-groups by another random seed.
Relationship: contrasting
Domain: Networks
Sentence 1: In con­strained streaming, under relatively short RTT, i.e., R = 50 ms (corresponding roughly to same coast in US) or 100 ms (roughly between two coasts in US), for various settings, the performance is generally good when the achievable TCP throughput is twice the video bitrate.
Sentence 2: for large RTT (R = 300 ms), high loss rate (p =0.04) and timeout value (TO =4), a startup delay of 60 seconds is required in order for the fraction of late packets to be be­low 10-4 for T/µ =2.
Relationship: contrasting
Domain: Networks
Sentence 1: of Posts and Telecomm., China Department of Computing, Hong Kong Polytechnic University, Hong Kong §Nokia Research Center, Beijing, China .Institute of Industrial Science, The University of Tokyo, Tokyo, Japan {cslcheng, csjcao, csjsiebert}@comp.polyu.edu.hk, {canfeng-david.chen, jian.j.ma}@nokia.com, hongyang@mcl.iis.u-tokyo.ac.jp ABSTRACT Cooperative forwarding has been considered as an e.ec­tive strategy for improving the geographic routing perfor­mance in wireless sensor networks (WSNs).
Sentence 2: we ob­serve that existing works do not fully utilize the forwarding opportunities provided by available neighboring nodes.
Relationship: contrasting
Domain: Networks
Sentence 1: A signi.cant number of the states can be discarded probabilistically due to the low-likelihood state metric, de­rived from the likelihood computation procedure.
Sentence 2: xc(n - 2) X (2) Figure 1: Bayesin Data Likelihood Tree (DLT) direct computation of the likelihood metric at every state re­sults in a drastic increase in the computational complexity, due to the large cardinality of the state subspace.
Relationship: contrasting
Domain: Networks
Sentence 1: Since membershiptypically changes rapidly due to the nodes independent mobility patterns in mobile networkslikeVANETs,multi-hop clusters aretypicallydismissed due to the amount of overhead required for electing a cluster head and maintaining cluster membershipinformation.
Sentence 2: the use of multi-hop links has been proposed in VANETs without explicit clustering.
Relationship: contrasting
Domain: Networks
Sentence 1: On one hand, they are means to prescribe non-geometric components to signal reception, which is useful for simulation studies (which M B -S I N R cannot pro­vide), but which could be captured more accurately by actual mea­surements.
Sentence 2: these can also model aspects that are necessarily random, in which case they could complement the deterministic M B-S INR.
Relationship: contrasting
Domain: Networks
Sentence 1: Intuitively, if more than one Hotmail user is observed to use the same IP address, it is likely that this IP has been assigned to more than one host and hence is a candidate dynamic IP address.
Sentence 2: counting the number of users for each individual IP in a straightforward way is not robust due to two reasons: (1) it is likely that not all the addresses in a block will appear in the input dataset; (2) a small number of individual IPs in a dynamic IP block may still appear static by having a single user (e.g., a dynamic IP as­signed to a home router that rarely reboots).
Relationship: contrasting
Domain: Networks
Sentence 1: R1 and R2 send ResvCTS in the 4th mini-slot only if they have sent CTS in the 2nd mini-slot and received a ResvRTS in the 3rd mini-slot.
Sentence 2: r1 and R2 cannot receive ResvRTS in the 3rd control mini-slot (and consequently they cannot send ResvCTS in the 4th mini-slot) because as they send CTS in the 2nd mini-slot simultaneously, collision occurs at their common neighbor E3 which sends a CR in the 3rd mini-slot preventing R1 and R2 from receiving the ResvRTS.
Relationship: contrasting
Domain: Networks
Sentence 1: Protocol BS-Pkts BS-Attacks BSAll-Pkts BSAll-Attacks TCP 98.99 95.76 98.68 25.45 UDP 0.25 0.78 0.40 59.50 ICMP 0.03 0.90 0.03 0.26 Table 2: Pctg contribution of protocols to at­tack tra.c in backscatter data (BS: backscatter us­ing 60 sec 100 packet .lter, BSAll: all backscat­ter data without .ltering, Pkts: Number of packets, Attacks: Number of attacks ) A recent work in progress presented by Nazario [10] also based on backscatter data from a mostly unused /8 net­work suggested that attacks are shifting from TCP to the UDP protocol.
Sentence 2: our analysis did not con.rm this.
Relationship: contrasting
Domain: Networks
Sentence 1: Likewise, even a simple post-condition such as execution reaches the same .nal ei p as speci.ed in so could be thwarted by a pro­gram that, for example, checks whether a cryptographic pseudo­random function computed on the input iv is equal to the state sv.
Sentence 2: for most programs, one would not expect the problem of .nding an input to cause that program to reach a desired .nal state to intentionally be made into a hard problem.
Relationship: contrasting
Domain: Networks
Sentence 1: For example, a router that uses the lenient depref invalid policy can lose connectivity to an invalid route if all its neighboring routers use the 2The idea that the RPKI is a default-deny architecture is un­intuitive, given the unknown route validity state.
Sentence 2: a BGP route without a matching valid ROA is unknown only when there is no covering ROA; see Section 2.2.
Relationship: contrasting