sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: In this case, it is infeasible to provide strict guarantees on message delivery time.
Sentence 2: opportunistic contacts may greatly enhance the performance of many peer-to-peer (P2P) applications: as proposed for website prefetching in the 7DS architecture [20], and podcast dissemination (series of content items on a channel), in the Podnet project [14].
Relationship: contrasting
Domain: Networks
Sentence 1: Proposed Scheme 4.1 Motivation and Overview Packet Reception Rate (PRR) In a real WSN, it is crucial to forward a packet efficiently using local information due to the limited resources of a sensor node [9].
Sentence 2: 0.6 previous routing schemes are not adequate to be used, as Connected Transitional Disconnected they do not consider the asymmetry of wireless links or they have Region Region Region 0.4 0.2 0.0 0 5 10 1520 253035 Distance between two nodes (m) Figure 1.
Relationship: contrasting
Domain: Networks
Sentence 1: Nonlinear Modeling of the Internet Delay Structure Xiao Wang, Yang Chen, Beixing Deng, Xing Li Tsinghua University, Beijing, China wangxiao.thu@gmail.com ABSTRACT Modeling the Internet delay structure is an important issue in designing large-scale distributed systems.
Sentence 2: lin­ear models fail to characterize Triangle Inequality Violations (TIV), motivating us to research on nonlinear ones.
Relationship: contrasting
Domain: Networks
Sentence 1: 3.3 Aligning VPCS with Network Topology Without Geographic Information The method described so far for assigning the virtual space is su.cient to provide reliable node to node routing, as describedinSection 4.1and Section4.2.
Sentence 2: inorder to take advantage of the extra cross-links in the ringed-tree structure, we need to label the nodes in such a way that a node can know which cross-link it should use, if any.
Relationship: contrasting
Domain: Networks
Sentence 1: Not too many years ago the answer to this question was clearly no ,becausethecostwasprohibitiveand setting up an Emulab required an extremely talented system adminis­trator.
Sentence 2: recent enhancements to the Emulab soft­ware combined with falling hardware prices have changed the playing .eld to the point where one can consider build­ing their own Emulab.
Relationship: contrasting
Domain: Networks
Sentence 1: 3.5 Handling parallel transfers of similar content Thus far, we implicitly assumed that an image being considered for upload is compared with images that were already uploaded previ­ously and stored in the server database.
Sentence 2: it is quite possi­ble that in our scenarios of interest, multiple user devices attempt to upload similar images almost at the same time (close to when the event is occurring).
Relationship: contrasting
Domain: Networks
Sentence 1: To ensure the fairness in the contention process, existing proposals adopt a simple unbiased contention resolution rule based on random number selection [10, 8, 9, 5, 6], such that either a contention source or a contention destination has an equal probability of winning the pairwise contention.
Sentence 2: the existing design of a self-coexistence protocol fails to consider the successive events that may be triggered by the spectrum redistribution during a local spectrum con­tention process.
Relationship: contrasting
Domain: Networks
Sentence 1: 5.2.2 Local Energy Savings  5.2.1 Compression Size and Time Results Figure15showsthatlargeenergysavingscanbeobtained TheprimaryadvantagetousingtheSTasopposedtothebycompressingwiththeST.AlloftheschemesyieldenergyBWTisthattherearenostringcomparisons,soitisex-savingsonalloftheradiosforallthreedatasetsevenwhentremelyfast,andtherefore,muchmorelikelytoconservecomparedtoalready-goodS-LZWcompression.
Sentence 2: cC2420 CC1000 6 Effect of Reliability and Replication on Compression Bene.ts Tothispoint,wehaveassumedthatpackettransmissions  areperfect.inrealnetworks,transmissionarenot perfectandthiscanhaveasigni.cantenergyimpact.Com­ RLE-ST MC16-ST MC8-ST MC4-ST  pressingsensordatacanhaveadditionalbene.tsasthenum­berofretransmissionsrequiredincreases.Inthissectionweexplorethebene.tsofcompressioninbothnetworkswith Algorithm variablereliabilitiesandinopportunistic,mobilesystems MC8-STMC4-STMC2-STS-LZW-STBasic S-LZWRLE-ST  S-LZW-ST MC16-ST Basic S-LZWBasic S-LZW MC16-ST MC8-ST MC4-ST MC2-ST MC2-ST RLE-ST S-LZW-ST thatusepacketreplicationtoincreasetheprobabilityofsuc- XTend cessfullytransmittingpacketstothesink.
Relationship: contrasting
Domain: Networks
Sentence 1: 9.CONCLUSIONS Becauseweworkwithin a model of routing policies, we caution against interpreting our results as hard numbers that measure the impact of an attack launched by a speci.c ma­nipulator in the wild.
Sentence 2: the trends uncovered by our quantitative analysis do allow us to arrive at a number of useful insights; indeed, many of these insights are obtained by averaging over multiple possible (manipulator, victim) pairs, and we suspect that they hold up even if some ASes deviate from the policies in our model.
Relationship: contrasting
Domain: Networks
Sentence 1: In regards to the performance of Figure 8 b), the two algorithms which are compared by sequential assignment also generate the extremely small number of idle cycles compared to the method of Figure 8 a).
Sentence 2: as the suggested algorithm transmits query only for the existing tags on one bit collision and series two bit.s collision, the performance was improved by 67% compared to QTA and by 51% compared to 4-ary when the number of tags is 16,000. a) 32 bit random b) 32 bit sequence Figure 8.
Relationship: contrasting
Domain: Networks
Sentence 1: soBGP: Under soBGP or any other Routing Topology Path Veri.­cation protocol, paths are veri.ed to be consistent against a database of known inter-AS routing information.
Sentence 2: recall from Sec­tion 3 that in our analysis, we only allow soBGP to use authenti­cated topological information from ASes that are soBGP speakers.
Relationship: contrasting
Domain: Networks
Sentence 1: Like current APs, a ZigZag AP decodes every packet from Alice, the high power sender.
Sentence 2: un­ likecurrentAPs however,ZigZag subtractsAlice s packetfromthe collisionsignal andtry to decodeBob s packet.ifAlice s powerisexcessivelyhigh,evenasmallimperfectioninsubtracting her signal would contribute a signi.cant noise to Bob s, prevent­ing correct decoding of his packets.
Relationship: contrasting
Domain: Networks
Sentence 1: For example, applications, such as VoIP and IPTV, can dynamically adjust their service level that can be sustained by varying link-quality in the network.
Sentence 2: link-quality-aware routing protocols [17, 21] can ac­curately locate a path that satis.es the QoS (e.g., throughput and delay) requirements based on the link-quality information.
Relationship: contrasting
Domain: Networks
Sentence 1: We now need to account for the fact that in each epoch a set is not subdi­vided with probability 1 -p. When a set is not subdivided its size will still decrease somewhat in each epoch because the algorithm always removes from the set any silent nodes that are directly transmitting to a node in R and re-routes the remaining nodes in the set.
Sentence 2: to get a rough up­per bound on the running time of the algorithm it su.ces to ignore this subtlety and assume that in each epoch the size of the set stays the same with probability 1 -p. Hence, the probability that the algorithm takes r+iepochs to complete () r+i-1 is at most r (1 -p)i .
Relationship: contrasting
Domain: Networks
Sentence 1: Using these optimal schedules as the the­oretical reference point, we demonstrate that existing neigh­bor discovery algorithms like Quorum [23] and Disco [7] are 2-approximation algorithms of the optimal.
Sentence 2: the U-Connect protocol achieves a 1.5-approximation of the opti­mal, and also solves the asymmetric asynchronous neighbor discovery problem.Wehave used approximation algorithms for performance comparison of different neighbor discov­ery algorithms as it is a well known technique applied to minimization problems in computer science.
Relationship: contrasting
Domain: Networks
Sentence 1: An analysis of the BGP data show that the average number of BGP updates for whitebox testing (instrumented RCS), blackbox testing no queuing (single BGP announcements sent to RCS at a time), blackbox testing over 24 hours is only 6 messages per second.
Sentence 2: real-time (BGP announcements sent to RCS in real-time) averaged over 30 second intervals, the maximum rate is much higher, going well over 100 messages per second Figure 8 shows the amount of memory required by the RCS as a function of group size and for different numbers of pre.xes.
Relationship: contrasting
Domain: Networks
Sentence 1: In reality, we will not have even distribution of .ows into various buckets.
Sentence 2: when the number of .ows is far larger than the number of buckets, which will be the case with our parameter settings and intended workload, we can Algorithm 2: Algorithm to compute Lp norm with bucketing 1: Pre-processing stage 2: Initialize a sketch M[1 ...k][1 ...l]toall zeroes 3: Fix l p-stable hash functions sh1 through shl.
Relationship: contrasting
Domain: Networks
Sentence 1: PROO F. Suppose there is no common bit shared by all of the higher priority rules; that is, all higher priority rules cover all possible bits at each location in the match.
Sentence 2: there exists an optimal general rule, P *, that has only 1 bit un-wildcarded for a packet that does not match any of the higher priority .ows (e.g., a rule matching x1xx or xxx0).
Relationship: contrasting
Domain: Networks
Sentence 1: They range from proprietary ones such as Adaptec s Duralink[2], SUN s SunTrunking[16], 3Com s Dynamic Access[1] or later ones following the new standard such as HP s Auto Port Aggregation[12].
Sentence 2: while all these technologies are able to share multiple links from a stream of packets, none of them provide proportional shar­ing among multiple streams.
Relationship: contrasting
Domain: Networks
Sentence 1: In H.264/SVC, scalability refers to the removal of parts of the video bit stream in order to adapt it to the various preferences of end users as well as to varying terminal capabilities or network conditions [29].
Sentence 2: scalable video coding as H.264/SVC still requires end-to-end QoS for maintaining the priority of which frames packets of which layer are supposed to be dropped .rst in order to control video traf.c congestion and deliver better video quality [30].
Relationship: contrasting
Domain: Networks
Sentence 1: The di.erent lines indicate that larger bu.ers at the client side lead to the more desirable e.ect of increased stall time, but fewer number of stalls.
Sentence 2: (1) con.guring too large a bu.er size would unnecessarily delay the video playout in the beginning, and (2) adapting the bu.er size dynamically based on overload would require a new protocol between the network infrastructure and the client players.
Relationship: contrasting
Domain: Networks
Sentence 1: The critical conditions are asymptotic results that get more and more accurate as one considers a larger and larger deployment area (so that the number of sensors deployed gets larger and larger).
Sentence 2: deployment regions, in prac­tice, will have a .xed dimension and therefore one might ask What kind of con.dence can one get in real deployments when using our critical conditions to determine the minimum number of sensors to deploy?
Relationship: contrasting
Domain: Networks
Sentence 1: To increase service availability in a cost-effective manner, cloud providers are deploying their services across geo-distributed datacenters [23], and building their networks based on a scale-out design using inex­pensive commodity hardware [17, 34, 36].
Sentence 2: as http://dx.doi.org/10.1145/2523616.2523638 the number of devices and links in a datacenter grows, failures become the norm rather than the exception.
Relationship: contrasting
Domain: Networks
Sentence 1: In the centralized mechanism such as LKH [2], a group manager controls the whole group mem­bers and distributes a group key to only authorized mem­bers following the key hierarchy tree.
Sentence 2: the cen­tralized schemes have problems of a single point of failure and 1-a.ects-n , which means that a membership change of a member a.ects the whole group [3].
Relationship: contrasting
Domain: Networks
Sentence 1: Despite their disparate characteristics, in early days these two access net­works were often presented as competing ways to create wireless capacity.
Sentence 2: support of unlicensed and licensed bands on client devices and pressing need to relieve traf.c overload in ca­pacity starved cellular data networks caused by unforeseen growth in smart phone use and mobile video has pushed greater integra­tion of these networks.
Relationship: contrasting
Domain: Networks
Sentence 1: At this point in the protocol, the provider is con.­dent that the consumer has access to the private key associated with the public key received in Step 1.
Sentence 2: the provider does not yet have a high level of con­.dence that the consumer is indeed whom the provider believes they are (e.g., someone other than the consumer could have stolen the consumer s smart phone).
Relationship: contrasting
Domain: Networks
Sentence 1: Phys­ically realizing small-world networks with uniformly distri­buted long-distance connections is thus not realistic and dis­tance, i.e., the wiring cost, needs to be taken into account, a perspective that recently gained increasing attention [20].
Sentence 2: a network s topology also directly a.ects how e.cient the communication is, and thus how e.cient problems can be solved.
Relationship: contrasting
Domain: Networks
Sentence 1: Moreover, the metrics considered in [14, 17] are not suitable for our setting: the type of errors considered there, such as those that correspond to the Hamming or edit distance are more suitable for general error-correction of biometric key extraction, [14].
Sentence 2: here, we need to cor­rect a di.erent class of errors that correspond to the shifts present in the runs within one of the two bitstrings (rela­tive to the other).
Relationship: contrasting
Domain: Networks
Sentence 1: One way to handle multiple pre.xes would be to run a separate in­stance of VPref for each pre.x the elector can reach.
Sentence 2: this would leak some information: If an AS A is invited by its neigh­bor B to participate in a VPref instance for some pre.x p, A can conclude that B has a route to p, even if B never exports such a route to A via BGP.
Relationship: contrasting
Domain: Networks
Sentence 1: To avoid recurring bu.er underruns and frequent quality switches, both of which are harmful to the viewer s quality of experience, several research groups have evaluated the performance of adaption schemes [5, 8, 10] (and proposed changes [11]).
Sentence 2: they all use di.er­ent bandwidth traces due to lack of an available dataset, e.g., Akhshabi et al.
Relationship: contrasting
Domain: Networks
Sentence 1: Brief Announcement: Efficient Flooding in Power-Law Networks* Farnoush Banaei-Kashani Cyrus Shahabi University of Southern California University of Southern California Los Angeles, California 90089 Los Angeles, California 90089 banaeika@usc.edu shahabi@usc.edu ABSTRACT Flooding is an effective mechanism for both broadcast and unicast modes of communication (in unstructured networks), providing broad coverage and guaranteeing minimum delay.
Sentence 2: flooding is not a scalable communication mech- anism, mainly because of the communication overhead it imposes to the network.
Relationship: contrasting
Domain: Networks
Sentence 1: The system is insensitive to the exact value of p. Introducing a small amount of uncertainty/noise allows us to search over many more possible failure explanations, especially those with inaccurate descriptions, that might otherwise have been infeasible.
Sentence 2: the uncertainty is small enough that, in general, a diagnosis that has one or more guess edges would have a lower probability of happening than one that has all edges acknowledged in the description.
Relationship: contrasting
Domain: Networks
Sentence 1: An exception of the indicated message deliv­ery ratio behavior happens when t=0.75, at which the cost is extremely low, indicating that routing has been severely limited to the most popular 25 percent area of the map, ultimately having an obvious e.ect on the delivery ratio.
Sentence 2: as shown in Figures 3(a) and 3(b), the Space Syntax Sliding Scale algorithm considers a larger map area for routing as the threshold value increases.
Relationship: contrasting
Domain: Networks
Sentence 1: at work in the PUSH&#38;PULL proto­col: setting µ -2 1 small means nodes query their neighbors early, thus reducing the latency, but at the cost that most nodes issue unnecessary requests, thus incurring high over­head.
Sentence 2: setting µ -2 1 large means nodes wait a long time to issue query requests, so they don t issue as many unnecessary requests, but necessarily incurring a longer per hop latency.
Relationship: contrasting
Domain: Networks
Sentence 1: This is an advantage since the estimation of local rates is much more dif.cult due to the small number of samples available.
Sentence 2: there are two reasons why their measurement may be worthwhile: (i) they could extend the time intervals over which the difference clock Cd(t) can be used to measure time dif­ ferences, and (ii) to optimize the performance of .
Relationship: contrasting
Domain: Networks
Sentence 1: The promotion delay is not included in either the upstream RTT or the downstream RTT in Figure 7, since the promotion (if any) has already .nished when the monitor observes a SYN packet, as illustrated in Figure 9.
Sentence 2: we are able to infer the promotion delay using the TCP timestamp embedded into a TCP packet when the packet is about to leave the UE.
Relationship: contrasting
Domain: Networks
Sentence 1: Conse­quently,thefaultlocalization properties of NetworkConfes­sional are provided only at the granularity of deployment informally,thesub-graphof the domain topology whosever­tices are participating domains and whose edges link par­ticipating domains only over domain paths that include no participating domain in the topology.
Sentence 2: theloss offault-localization resolution dueto partial deploy­ment can be viewed as an incentive for adoption: a domain hasto reportonits performancein ordertopreventits neigh­bors from blaming their problems onit undetected.
Relationship: contrasting
Domain: Networks
Sentence 1: A naive solution to this problem would be to maintain per-.ow coun­ters that are updated upon every packet arrival.
Sentence 2: as shown in [1], this approach cannot scale to the link speed of OC192+ since fast SRAM modules can only hold a tiny fraction of per-.ow state due to their size limitations, yet large DRAM modules cannot sup­port such speed.
Relationship: contrasting
Domain: Networks
Sentence 1: As the number of candidate .rst hop ASes in­creases to 3, the actual .rst hop AS minimizes the difference be­tween hc(S, D) and hc(S, T )+ hc(T,D) about 75% of the time.
Sentence 2: the number of ties signi.cantly increases and thereby de­grading the accuracy to about 65%.
Relationship: contrasting
Domain: Networks
Sentence 1: In par­ticular, the con.ict detection algorithm in FortNOX only conducts pairwise con.ict analysis between new .ow rule(s) and each single security constraint without considering rule dependencies within .ow tables [11, 13] and among security constraints (represented as a .rewall policy in our approach) [26].
Sentence 2: when FortNOX detects a security violation caused by new rule(s) in­stalled by a non-security application, it simply rejects the rule(s) without offering a .ne-grained violation resolution.
Relationship: contrasting
Domain: Networks
Sentence 1: The interaction between MUSC and MIRA occurs in all Q3MAs and only in Q3MA-H and Q3MA-C the SessAnnounce message is triggered, because they are the ingress point of the session in the clusters C2 and C1 respectively.
Sentence 2: in Q3MA-B, since it is an access-Q3MA, MIRA configures the network and the multicast tree only on the outgoing interface.
Relationship: contrasting
Domain: Networks
Sentence 1: As it is shown from these figures, in the first case the bottleneck of the design is the processing power of the 1 2 3 4 5 g m h c i f p g t m g i  1 2 3 4 5 2 3 4 5 1 6  1 7 1 8  1 9  processor.
Sentence 2: in the second case, the bottleneck of the design is the bandwidth of the common bus.
Relationship: contrasting
Domain: Networks
Sentence 1: When ( continues to increase, the ContactOnly algorithm achieves a little higher network throughput since only the nodes with best topologies are still remaining after extensive delete op­erations.
Sentence 2: if we consider the number of uninterest­ed nodes in the relay sets that the two algorithms, we .nd that the ContactOnly uses more uninterested nodes than that does InterestSpread when ( is increasing, which is not what we expected.
Relationship: contrasting
Domain: Networks
Sentence 1: 1 sec), which means that if the end-user receives the beacon signal in the first overlapping area between VCZ-1 and VCZ-2, he/she will receive all the beacon signals between each consecutive couple VCZ-M and VCZ-N and, in this case, the probability for a successful handoff is increased.
Sentence 2: the packet loss in MEC case is decent, since it is less than 0.5% for velocities up to 180 km/h and increases to 1.3% and 1.8% for 190 km/h and 200 km/h, respectively.
Relationship: contrasting
Domain: Networks
Sentence 1: The delayed reordering procedure cannot completely eliminate timeouts or triple duplicate ACKs when one path is signi.cantly delayed or lossy.
Sentence 2: it signi.cantly reduces the rate of these undesirable events to the point that we can ef.ciently explore mul­tiple paths and outperform single-path TCP in many cases, as dis­cussed in Section 6.
Relationship: contrasting
Domain: Networks
Sentence 1: (B(k)(R)), to emphasize the dependence of the objective function, the SIR, the extended gain matrix and its spectral radius on R. In what follows, we also assume that (A.10) V(R)is irreducible for any choice of R. Thealternating optimizationprinciple mentionedabovewas also applied in [9] to .nd an optimal allocation of transmit powersand receivebeamformers.
Sentence 2: as thealgorithm of [9] is not amenable to distributed implementation, we limit ourselves to pointing out the following: It seems that the algorithm can be extended to include the background noise and the individual power constraints by considering ¯ the principal left and right eigenvectors of B(k)(R),k .
Relationship: contrasting
Domain: Networks
Sentence 1: 6.3 Impact of Step-counting Accuracy From our experiment, we .nd that the pedometer accu­racy is below 97.8% when the smartphone is inside the user s front pocket.
Sentence 2: the step-counting errors can cause poor estimation in the step length and make the underly­ing Dead-reckoning system miscalculate the turning time.
Relationship: contrasting
Domain: Networks
Sentence 1: Such an idea of the cloud as a sort of computing utility has become a reality owing to the recent advances in Data Center (DC) technologies.
Sentence 2: in order to cope with the exponen­tially increasing number of cloud service subscribers es­pecially mobile cloud users more advanced networking in­frastructures and technologies are expected to be deployed for both intra-DC and inter-DC communications [2].
Relationship: contrasting
Domain: Networks
Sentence 1: The concerns in this scenario differ from what we consider in IMP s current long-term budget approach, because of the added goal of saving the user money, the smaller units of data for which money is spent, and the fact that less money spent is always fa­vorable.
Sentence 2: this scenario can still bene.t from IMP s .xed­budget adaptation strategy for each allotted unit of data.
Relationship: contrasting