sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: Clearly, di.erent mobility models lead to di.erent times needed for 75% infection coverage, suggesting that the impact of device mobility patterns on the propagation of the Bluetooth worm does not disappear even when the worm varies its parameters.
Sentence 2: no matter which mobility model is con­sidered, the worm propagation speed is also a.ected by how the worm sets its parameters.
Relationship: contrasting
Domain: Networks
Sentence 1: Pr2-P2PSIP: Privacy Preserving P2P Signaling for VoIP and IM Ali Fessi, Nathan Evans, Heiko Niedermayer, Ralph Holz Technische Universität München Boltzmannstrasse 3 Munich, Germany {fessi|evans|niedermayer|holz}@net.in.tum.de ABSTRACT In the last few years, there has been a good deal of ef­fortput into the research and standardization of P2P-based VoIP signaling, commonly called P2PSIP.
Sentence 2: there has been one important issue which has not been dealt with adequately, privacy.
Relationship: contrasting
Domain: Networks
Sentence 1: For about 66% of the MAPs in the network the maximum coding gain achievable was only 2 i.e., even though the number of neighboring MAPs for each of these MAPs were more than 1, the structure of the net­work did not permit coding more than 2 packets.
Sentence 2: there are around 24% of the MAPs where coding gains of more than 2 were possible with the maximum coding gain reaching 6 for some of the MAPs.
Relationship: contrasting
Domain: Networks
Sentence 1: In a centralized heterogenous multiuser network, the multiuser diversity will cause the serious fair­ness problem the users with good channels may occupy most of the resources, while the users with poor channels may hardly have opportunity for information transmission, which will result in large queueing delay and thus the user s delay-bound QoS cannot be guaranteed.
Sentence 2: the advantages of multiuser diversity only contribute to a small portion of mobile users whose channel quality is good, which may not lead to a signi.cant QoS performance im­provement from the entire network perspectives.
Relationship: contrasting
Domain: Networks
Sentence 1: The presence of highly connected central nodes in a network having a power law degree distribution is the essence of the so-called scale-free net­work models, which have been a popular theme in the study of complex networks, particularly among researchers inspired by sta­tistical physics [34].
Sentence 2: this emphasis on power laws and the resulting efforts to generate and explain them with the help of these degree-based methods have not gone without criticism.
Relationship: contrasting
Domain: Networks
Sentence 1: Second, comparing synchronous games, one with resource-pricing and the other with threshold-pricing with sample frequency 10 Kbps, the two achieve approxi­mately same sum of rates for f = 0.2.
Sentence 2: like in Fig­ure 2 the time share allocation (not depicted) with resource­pricing is unfair (lowest time share less than 1 % of user 1 with weakest channel, highest time share more than 60 % of user 10 with strongest channel) whereas threshold-based scheduling implies a relatively fair time allocation (lowest time share 35 % and highest 46 %).
Relationship: contrasting
Domain: Networks
Sentence 1: Ternary Content Addressable Memories 10 100 1000 10000 10 100 1000 10000 Block size Block size (TCAMs) has become the de facto industrial standard for packet classi.cation in high performance routers.
Sentence 2: tCAMs suf­ (a) R1 (b) R9fer from several primary de.ciencies: high power consumption, high cost per bit relative to other memory technologies, and stor­ 10000 1 1 1 age inef.ciency.
Relationship: contrasting
Domain: Networks
Sentence 1: Revisiting Caching in Content Delivery Networks M. Zubair Sha.q , Alex X. Liu , Amir R. Khakpour Department of Computer Science and Engineering, Michigan State University, East Lansing, MI, USA Verizon/EdgeCast, Santa Monica, CA, USA {sha.qmu,alexliu}@cse.msu.edu, amir@edgecast.com ABSTRACT Content Delivery Networks (CDNs) di.er from other caching systems in terms of both workload characteristics and per­formance metrics.
Sentence 2: there has been little prior work on large-scale measurement and characterization of content requests and caching performance in CDNs.
Relationship: contrasting
Domain: Networks
Sentence 1: In the space of beamforming, [4, 5] propose to increase the ca­pacity of WLANs through spatial reuse by considering directional antennas only at the APs or at both APs and clients.
Sentence 2: client association is assumed and con.icts and reuse schedule are com­puted w.r.t a single client at each AP.
Relationship: contrasting
Domain: Networks
Sentence 1: Robust Topology Control for Indoor Wireless Sensor Networks Gregory Hackmann, Octav Chipara, Chenyang Lu Department of Computer Science and Engineering Washington University in St. Louis, USA {gwh2, ochipara, lu}@cse.wustl.edu ABSTRACT Topology control can reduce power consumption and chan­nel contention in wireless sensor networks by adjusting the transmission power.
Sentence 2: topology control for wire­less sensor networks faces signi.cant challenges, especially in indoor environments where wireless characteristics are extremely complex and dynamic.
Relationship: contrasting
Domain: Networks
Sentence 1: Potential Solutions Content editors The threa.t of obsolete information overtaking the inttanet could be overcome by employing ='content editors" or "inumnet police(we)men", who are tasked to monitor the validity of information across the intranet They can indeed look after the consistency and quality of the inttanet very much in the same way as content editors successfully do for cozporare web- 131 sites.
Sentence 2: i befieve a skilled content editox will not be paxtioalarly motivated to clean up other peo- ple's mess and often would not be any better in identi- fying obsolete information than the creator him/hers elf.
Relationship: contrasting
Domain: Networks
Sentence 1: One solution to this problem is to use an RTS/CTS (re­quest to send / clear to send) protocol, where before a packet is transmitted the transmitter sends and RTS packet and waits for a CTS reply, at which time the receiver knows to hold all of its own transmissions until the packet arrives.
Sentence 2: this solution is not feasible for broadcast tra.c, nor in networks with large propagation delays.
Relationship: contrasting
Domain: Networks
Sentence 1: The conventional approach taken by the net­work stack and web server application has been tuned to perform well when delivering large content by utilizing OS primitives and NIC hardware features.
Sentence 2: mul­tiple simultaneous short-lived HTTP connections are consid­ered a heavy workload that stresses the kernel-userspace in­terface and reveals performance bottlenecks: the size of the transmitted data is not enough to compensate for the system cost.
Relationship: contrasting
Domain: Networks
Sentence 1: The only di.erence is that since .2 is less than 2 Mbps the corresponding RTTs are similar to those resulted from .0 and .1.  resulted from .2 to .4 are still larger than that of .0 and .1 because .2 to .4 are larger than the available bandwidth.
Sentence 2: compared to Figure 5(a), the average RTT and the std for .2 to .4 decrease.
Relationship: contrasting
Domain: Networks
Sentence 1: The lower bound on T follows immediately from the fact that bv can increase by at most one each time step and the distance between a block and a vertex can decrease by at most one each time step.
Sentence 2: we know from Lemma 3.1 that bv,x(b-k+d-1) = l J x(b-k+d-1) + k +1 - d = b.
Relationship: contrasting
Domain: Networks
Sentence 1: Given an MPI-based HPC application wherein individual processes of the application may be imagined to be vertices in a graph, and the communication among the processes may be imagined to be edges between these vertices, its corresponding application graph (using the vertices and edges described above) de.nes the structure of the application.
Sentence 2: to understand communication performance, the application s communication graph alone is inadequate.
Relationship: contrasting
Domain: Networks
Sentence 1: [3, 4] present a secure routing protocol by combining techniques such as source routing, hop-by-hop authentication and ack-based probing.
Sentence 2: for a forwarding path of length d, their scheme in­duces a key storage overhead of O(d2) and a high communi­cation overhead equivalent to that of the strawman approach described later (§4,§7,§8).
Relationship: contrasting
Domain: Networks
Sentence 1: Deploy­ments operating over the public Internet have to rely on end-users, and a popular strategy is to use P2P approaches where users collaboratively download from each other to de­crease server load.
Sentence 2: supporting the delivery con­straints of streaming in P2P architectures typically intro­duces complexity such as elaborate mesh/tree topology con­struction [16, 7], or careful chunk-scheduling strategies [3, 22, 10, 15].
Relationship: contrasting
Domain: Networks
Sentence 1: Multipath propagation severely affects ToA-based and DoA-based localization systems, since in both cases multipath components may be mistakenly interpreted as direct path signals.
Sentence 2: lOS existence will generally improve the performance of such systems since the LOS component arrives earlier (for ToA systems) and is of greater power (for DoA systems) with respect to multipath components; thus the probability of false ToA or DoA calculation is lower [1].
Relationship: contrasting
Domain: Networks
Sentence 1: ThefrstalarmisaDestRepatdestination5,whichmeans thattheimplementationisnotsettingtheinitialhop-count T¢ Table6:TypicalMeta-trace Time:0.003449342s,AlarmDestRepraisedat5fordest5 bestrouteat5for5: observedrouteat5for5: Time:0.004823314s,AlarmDestRepraisedat5fordest5 bestrouteat5for5: observedrouteat5for5: Time:2.567054284s,AlarmDetectRErrraisedat4fordest5 bestrouteat4for5: observedrouteat4for5: Time:2.567054284s,AlarmDetectRErrraisedat4fordest5 bestrouteat4for5: observedrouteat4for5: valueinanRREPcorrectly.Allfourinstancesofthealarm inindicatethattheinitialvaluehasbeensetto1.So T¢ wegointothecodeandcorrectthissimpleof-by-oneerror, changingtheinitialhop-countfrom1to0.Thisproduces anewimplementationP1,whichweusetoproduceanew traceT1,byrunningthesimulationagain.
Sentence 2: step II WerunVerisimonT1andctoproducethesecondmeta­traceT1¢ .T1¢has216alarms,andisthesameasT¢except thattheDestRepalarmshavebeeneliminated.Thefrst alarminthetraceisaDetectRErratnode4,wherethe node4issendinganunsolicitedRREP,sayingthatthedes­tination5isunreachable.thesequencenumber intheRREPisnot1morethanthebestsequencenumber at4.Thisleadsustosuspectthattheimplementationfails toincrementthesequencenumberat4beforesendingthe unsolicitedRREP.LookingatotherDetectRErralarmsin thetraceconfrmsthisbug.WerepairP1,toeliminatethis bugandproducethethirdversionofourcode,P2.
Relationship: contrasting
Domain: Networks
Sentence 1: A suitable heuristic to remove these con.icting pairs is to move them around until they hit the boundary of the system, where they are more likely to disappear alltogether due to the smaller number of nodes that the boundary nodes have.
Sentence 2: if these con.ict-moving changes are done at random, the resulting motion of the defects resembles ran­dom walk, and while in a .nite system such walks eventually reach the boundary [12] it does not happen fast.
Relationship: contrasting
Domain: Networks
Sentence 1: Processing packets arriving from the transport layer  4.2.3 Processing transport layer packets In our framework the processing scheme of packets arriving from the network does not bring considerable changes to the existing HIP RFCs: signaling messages are processed in the normal way with the extensions introduced above, while incoming data packets are treated completely according to the standards (SPI values are used to identify the appropriate SA).
Sentence 2: in case of packets arriving from the transport layer (originated by the applications) the standard way of operation changes because the fitting SA has to be selected for the outbound communication (Figure 8).
Relationship: contrasting
Domain: Networks
Sentence 1: 5.2 Installation 5.2.1 J-Sim Once J-Sim is downloaded, it can be easily imported into EclipseusingEclipse s JavaProjectfromExistingAntBuild­.le .
Sentence 2: some additionaljava archivesforXMLhan­dling (jaxp, xalan and crimson) must be installed before J-Sim can be executed.
Relationship: contrasting
Domain: Networks
Sentence 1: Recall that the MD-FEC coding can ensure a minimum video quality if at least 3m1M N error-free packets Qkg1  are received for a frame.
Sentence 2: if most of the packets are transmitted within a bad period, it is possible that less 3m1M N than Qkg1 packets can be received and the video frame cannot be decoded.
Relationship: contrasting
Domain: Networks
Sentence 1: tl inter-AS intra-AS 0.04 53.6% 46.4% 0.02 56.9% 43.1% 0.01 57.8% 42.2% more than 95% of the paths in the validation set are consis­tent withtheinferredloss rates.
Sentence 2: predictably,theaccuracyof the LIA algorithm increases as we increase m. the accuracy.attens out when m is signi.cantlylarge(m> 80).
Relationship: contrasting
Domain: Networks
Sentence 1: If all o.ered choices in a negoti­ation were secure, an adversary who successfully launched a downgrading attack would still not succeed in breaking the system.
Sentence 2: the prohibition of all weak EAP methods, protocol versions, and ciphersuites is not practical, because the negotiations serve to accommodate .exibility for vendor implementations, backward compatibility with older proto­col versions or algorithms, export restrictions, e.g.
Relationship: contrasting
Domain: Networks
Sentence 1: For example, if A s intended receiver can capture B s transmissions, carrier sense should be used to defer B s transmission to prevent it from inter­fering with A s transmission.
Sentence 2: if A s in­tended receiver can tolerate a parallel transmission from B without signi.cantly a.ecting A s delivery rate, carrier sense (right ), senders record .and s, but do not wait for .to fall below sbefore transmitting.
Relationship: contrasting
Domain: Networks
Sentence 1: The ring-walk [8] and Jump-Stay (JS) based channel-hopping algorithms [19] are analyzed in symmet­ric and asymmetric channel models (S/ACHm).
Sentence 2: in [8] it is assumed that nodes know the largest possible ID, i.e., the network size n, which also in.uences the pe­riod size composed of n time slots.
Relationship: contrasting
Domain: Networks
Sentence 1: VariousschedulingalgorithmssuchasiSLIP [30], DRRM [28], and maximum weight matching (MWM) [36] have been proposed to achieve high throughput.
Sentence 2: many of these algorithms are complex, or require nearly instanta­neous communications among input and output schedulers thatareusually placed far apart on different line-cards.
Relationship: contrasting
Domain: Networks
Sentence 1: Note the low A-reception rates ob­tained in case of CR=200m due to the high incoordination caused by the load offered to the medium (CBT=93.3%).
Sentence 2: higher CR values, which cause higher PLI and channel load, do not expe­rience a sensible decrease of the successful reception of messages 4Note that the .gures do not include the curves corresponding to sensed due to better readability.
Relationship: contrasting
Domain: Networks
Sentence 1: Links are then assigned by randomly picking two node copies and assigning a link between them, until no more copies remain.4 For most of the rest of the paper, we focus almost exclusively on PLRG as the sole degree-based generator.
Sentence 2: the results for other degree-based generators, presented in Section 4.4, are qualitatively similar to those of PLRG.
Relationship: contrasting
Domain: Networks
Sentence 1: The control algorithm op­erates as follows: if too many idle intervals are observed compared to the target, Pa is needed to be increased addi­tively, which in turn will decrease the expected number of consecutive idle slots ni.
Sentence 2: if too few idle intervals are observed compared to the target, Pa is needed to be decreased multiplicatively, which in turn will increase the expected number of consecutive idle slots ni.The fol­lowing algorithm implements the theory: target If ni >ni ,Pa .
Relationship: contrasting
Domain: Networks
Sentence 1: When the bursty multi­media traf.c .ow is delivered over a WLAN, the required effective bandwidth for QoS guarantee at the IP layer should be provisioned by the MAC layer under the connection or call admission control (CAC).
Sentence 2: it is very dif.cult, if not impossible, to derive an ef.cient analytical tool from the saturated modeling for effective bandwidth provisioning and admission region calculation.
Relationship: contrasting
Domain: Networks
Sentence 1: In other word, FEAT al­lows for the presence of unaware receivers (those who do not know about FEAT) in the network, e.g., Charlie.
Sentence 2: if the network environment does not require the condition of absolute transparency (i.e., the network does not have 0.2 an unaware receiver), we could embed a frequency o.set in 0 any number (as low as 1) of OFDM symbols.
Relationship: contrasting
Domain: Networks
Sentence 1: The main property that fueled this attractive performance is the improved tit-for-tat incentive mechanismthat reducesfree-riding andincreases user coop­eration.
Sentence 2: this performance-awareness , which al­tersthepeerselectionbased on measurementsoftheachieved download or upload rate, canhave seriousimpact on thedy­namics of the underlying native layer.
Relationship: contrasting
Domain: Networks
Sentence 1: Therefore, Harvesting method Figure 2: Ratio of tra.c volume per email address for various harvesting methodologies our technique is fully automated as it expands, and no fur­ther manual intervention is needed for collecting more names that will be used as seeds.
Sentence 2: document crawling, generic dictionary attacks, and attacks based on surnames present very low scalability as the search terms are static, unlikely to change and have a limited dictio­nary size.
Relationship: contrasting
Domain: Networks
Sentence 1: The values kept in this .eld must be strictly increasing along a route from destination to source in order to prevent loop formation during the route discovery processes [2].
Sentence 2: when a bridge node is inserted into an active route as in the pro­posed expand process, this monotonicity may be disturbed because the .eld s values in upstream nodes from the bridge node are no longer correct; they need to be increased by 1.
Relationship: contrasting
Domain: Networks
Sentence 1: Tables which provide the attenuation of di.erent wall types [18] can alleviate this burden some­what, though this still requires knowledge of the building s construction materials and may not capture the e.ect of objects like metal bookshelves that can alter a wall s atten­uation.
Sentence 2: our approach automatically estimates the attenuation of walls from training data.
Relationship: contrasting
Domain: Networks
Sentence 1: Since it obviously has higher coverage percentage than STree_Flat routing, MTree_Flat routing has better space and time complexity than STree_Flat routing, and also better trade-off.
Sentence 2: as the size and complexity of the topology increase, the number of routing states which cannot be covered by the spanning trees will still be extremely large, and so will the space and time requirement.
Relationship: contrasting
Domain: Networks
Sentence 1: Such a problem has been analyzed in the literature for the case of macro Base Stations (BSs) [15,16]; however, due to the high power consumption of this type of BS, the big size and high cost of the required solar panel and batteries caused a scarce success of this solution in the market.
Sentence 2: small cells have more limited transmission power and com­putational capabilities than macro BSs; as a consequence, their power ampli.ers are smaller, and cooling systems are not needed, thus reducing their total power consumption.
Relationship: contrasting
Domain: Networks
Sentence 1: Thus, in the worst case, if every instruction is a CSTORE, a TPP can add a maximum of 50ns latency to the pipeline; to avoid losing throughput due to pipeline stalls, we can add 50ns worth of buffer­ing (at 1Tb/s, this is 6.25kB for the entire switch).
Sentence 2: the real cost is likely to be smaller because the ASIC already accesses memory locations that are likely to be accessed by the TPP that is being executed: For instance, the ASIC always looks up the .ow entry, and updates queue sizes for memory accounting, so those values needn t be read twice.
Relationship: contrasting
Domain: Networks
Sentence 1: In this case (k) vk = c· c =(ckc0 + ck+1c1 + ... + cn-1cn-k-1) +(c0cn-k + ... + ck-1cn-1) = Sk + S ' k The terms in the sum Sk + S ' k are in general not independent.
Sentence 2: in particular, if k = n/2, then Sk = S ' k. we observe the following.
Relationship: contrasting
Domain: Networks
Sentence 1: Additionally, even traditional baseband processing for wideband systems, such as OFDM, can cause substantial delay.
Sentence 2: since these overheads are common to both zero-forcing and conjugate, we omit them from our analysis as they do not provide additional insight in the performance tradeo.s; they essentially have the e.ect of further shorten­ing the coherence time.
Relationship: contrasting
Domain: Networks
Sentence 1: In this case, iProxy does not re­place any entry and all of U RL1, U RL2, and U RL3 stay in the table.
Sentence 2: a conventional proxy replaces potentially valuable U RL3 content by U RL2; it also wastes storage in caching the content for both U RL1 and U RL2, although they both refer to the same underlying information.
Relationship: contrasting
Domain: Networks
Sentence 1: A key problem is that no direct measurements are availa­ble for source-to-destination flows (i.e., T(e) is not known), because that would require complex source and destination MAC address processing which our architec­ture obviates.
Sentence 2: a pseudo inverse of the mea­surement projection matrices can be used to indirectly estimate input traffic from measurements.
Relationship: contrasting
Domain: Networks
Sentence 1: Therefore, the total credits assigned to both v1 and v2 can not exceed 0.75m because both v1 and v2 can reach both d1 and d2.
Sentence 2: in Fig.3,the totalcredits assigned for both v1 and v2 can be m because there is no destination that is reachable by both v1 and v2, which nulli.es the e.ect of the commonly received packets by both v1 and v2.
Relationship: contrasting
Domain: Networks
Sentence 1: ASYNCHRONOUS RENDEZVOUS PRO-TOCOLS The energy saving of proposed rendezvous protocols can be evaluated based on the number of active slots in the whole sleep-wake pattern interval.
Sentence 2: it is di.cult to com­pare the energy e.ciency of di.erent methods because each rendezvous protocol de.nes its pattern interval (i.e., duty cycle), parameters, and metric di.erently.
Relationship: contrasting
Domain: Networks
Sentence 1: Theoptimizedpathselectionprobabilitiesweresuchthatfortheresultingscalarpacket.uxwehave Fmp1(r)=0.61 · Fsp(r)+0.39 · Fout(r), and(subscriptmp denotes multi-path ) Fmp2(r)=0.5027 · Fsp(r)+0.3763 · Fout(r)+0.121 · Fin(r), wheretheformeryieldsamaximum.uxof0.397 ·.,andthelatteramaximum.uxof0.3763 · .,i.e.,the.uxcorrespondingtotheouterradial-ringpathsattheboundary.ThenumericalresultsaregiveninTable1,whererowsindicatedwith1)and2)correspondtotheoptimalweightsforrandomizedpathselectionwiththegiventwoandthreepathsets,respectively,andcolumn multi-path con­tainsthecorrespondingmaximumscalar.uxes.
Sentence 2: accordingtoProposition1,multi-pathroutesmp1 andmp2 cannotbeanoptimalsolutiontotheloadbalancingproblem,and,inparticular,thecorrespondingsingle-pathroutes,denotedbysp1 andsp2,obtainedusing(14)yieldalowermaximumscalarpacket.ux.Thismaximumscalar.uxcanbecomputednumer­icallyandthecorrespondingresultsaregivenincolumn single­path inTable1.Wenotethatinbothcasescombiningthemulti­pathtraf.c.owstosingle-pathimprovesthesituationconsiderably,asexpected.
Relationship: contrasting