sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: Inthispaper,weconsidertheloadbalancingprobleminawire­lessmulti-hopnetworkinthesettingofaso-calledmassivelydensemulti-hopnetwork.Massivelydensemulti-hopnetworkmeansthat1)therearenodespracticallyeverywhere,and2)thatatypicalpathbetweentwonodesconsistsofalargenumberofhops,i.e.,thetransmissionrangeisseveralordersofmagnitudesmallerthanthediameterofthenetwork.Inthissettingthereisastrongsepara­tionbetweenthemicroscopiclevel,correspondingtotheimmedi­ateneighbourhoodagivennode,andthemacroscopiclevel,corre­spondingtotheend-to-endconnections.Notethatintheconsid­eredtypeofnetworksthetraf.cloadconsistsalmostsolelyoftherelaytraf.c.Atthemicroscopiclevelthenodesaresimplycon­cernedaboutforwardingagivenpackettothedirectionde.nedbythechosenrouting.Inpracticethismeans,roughlyspeaking,thatlocallyapacketisforwardedtothefurthestreachablenodeinthatdirection.Atthemacroscopicleveloneisconcernedabouttheend­to-endpathsandtheassumptionofthestrongseparationbetweenthedifferentscalesjusti.esdescribingthepathsassmoothcontin­uouscurves[2 8].Inthepresentpaperwefocusonstudyingtheoptimalpathsatthemacroscopiclevel.
Sentence 2: inasimilarcontextbothPhametal.,in[9],andGanjalietal.,in[10],haveconsideredthepossiblegainfromusingK shortestpathsinsteadofone.ByusingapproximativemodellingtechniquesPhametal.arguethattheuseofmulti-pathroutingalwaysresultsinimprovementtothroughput.theresultsbyGanjalietal.,basedonmodellingtheK shortestpathsasarectanglebetweenthenodepairs,suggestthatthisisnotalwaysthecase,unlessahugenumberofmultiplepathsareallowedforeachpairofnodes.Thisisduetothefactthatinthelimitofmassivelydensenetworkany.nitenumberofpathsK tendstobe(closeto)alinesegmentbetweenthenodes.Finallyitisconcludedthatinordertoachievebetterloadbalancingoneneedsto.ndsuchrouteswhichpushthetraf.cawayfromthecenterofthenetwork,i.e.,byusingnotonlythe(K)shortestpaths.
Relationship: contrasting
Domain: Networks
Sentence 1: Figure 2: Example of a safety violation DCN operators could conceivably circumvent the problems that stem from running multiple applications by developing a single ap­plication that performs all functions, e.g., combining TE, .rmware upgrade, and failure mitigation.
Sentence 2: this monolithic applica­tion would be highly complex, and worse, it would need to be ex­tended repeatedly as new needs arise.
Relationship: contrasting
Domain: Networks
Sentence 1: Ad­dressing the .rst bene.t, we observe in Figure 9 that, when keeping the same MBL, the lower overhead of DVDE/SPAV allows a higher transmission power to be used by each ve­hicle in the scenarios.
Sentence 2: in Figure 10 we show results when adapting the MBL so that similar transmission powers are obtained.
Relationship: contrasting
Domain: Networks
Sentence 1: Figure 10 confirms that multi-channel multi-path CAMRA-RLB and CAMRA (max redundancy) schemes are able to mitigate the impact of frame losses, caused by interference produced by cross traffic.
Sentence 2: cAMRA-RLB experiences lower system load (Figure 11), because the multi-path redundancy is applied by exploiting explicit feedbacks on the network conditions.
Relationship: contrasting
Domain: Networks
Sentence 1: MASERATI and LoDASH show similar results in terms of the stability of video streaming because both of two algo­rithms re.ect the average condition of the speci.c location.
Sentence 2: mASERATI outperforms (11% and 12% for the 3G and 4G LTE networks, respectively) LoDASH in terms of the playout rate since MASERATI further considers ad­ditional important factors for predicting the available band­width such as time, humidity, and moving speed.
Relationship: contrasting
Domain: Networks
Sentence 1: The process procedure of two-stage packet enqueueing process in this enqueueing module is same as the process procedure of two-stage packet enqueueing process with a DQB allocation.
Sentence 2: there exist differences in queueing buffer allocation between the DQB allocation and the OQB allocation; this causes that the two-stage packet enqueueing process has different process target with the different queueing buffer allocation.
Relationship: contrasting
Domain: Networks
Sentence 1: With the availability of the SVC extension of the H.264 codec [1], [2], it is now possible to add or remove enhancement layers from the video stream so that its transmission rate can be adapted on the fly.
Sentence 2: what is still missing to integrate SVC in mobile networks is a mechanism to detect changing channel conditions and decide on the appropriate transmission rate such that the exact number of layers to be added or removed can be determined.
Relationship: contrasting
Domain: Networks
Sentence 1: BOTNET VALIDATION Ideally, the AutoRE identi.cation results should be validated by comparing them against known URL signatures and botnet host identities.
Sentence 2: in the absence of such information, our vali­dation is based on the following three methods (Figure 8 illustrates the overall evaluation setup): We .rst study the quality of the extracted URL signatures.
Relationship: contrasting
Domain: Networks
Sentence 1: On the other hand, various traditional daily applications (e.g., emails and instant messaging) and recently popular applications in smartphones (e.g., Drop­box, Twitter, Flickr and Facebook) require a large amount of data transmissions.
Sentence 2: a large fraction (nearly 60% [1]) of the energy consumed for data communication in cellular networks, in­cluding GSM and 3G, is wasted in the Tail Time [1, 4], i.e., the high-power state after the completion of a transmission.
Relationship: contrasting
Domain: Networks
Sentence 1: Thus, in the asymmetric path setting, an adversary on the reverse path can arbitrarily increase the source s estimate of the failure rate on the forward path by dropping acks.
Sentence 2: in the secure sketch protocol only a single authenticated re­port packet is sent on the reverse path, and so if it does not arrive Alice can deduce that the problem is in the re­verse rather than the forward path (unless the forward path is completely blocked and Bob is not even aware of Alice s  Secure Sampling Secure Sym Asym Sketching Storage/Communication7 90KB 240 840KB 0.2 0.6KB Peer setting .
Relationship: contrasting
Domain: Networks
Sentence 1: The .gure shows that the JS-test covers signi.­cantly more /24s in many pre.xes assigned by ARIN, and slightly more /24s in some pre.xes assigned by RIPE or several RIRs (the latter mainly in the old class B space).
Sentence 2: the FA­test covers signi.cantly more /24s in pre.xes assigned by APNIC and a few more /24s in some pre.xes assigned by LACNIC.
Relationship: contrasting
Domain: Networks
Sentence 1: As the offered load grows, the gap between COPE and CAPA continues to increase because it is hard to meet the requirement of spatial reuse due to heavy concurrent transmission.
Sentence 2: cAPA provides greater throughput gains across a wide range of offered load, especially when the offered load is high, due to the fact that it can achieve good trade-off between coding opportunities and concurrent transmissions.
Relationship: contrasting
Domain: Networks
Sentence 1: The false positive condition is satis.ed because we have v .
Sentence 2: {0, 1}U and IvI2 =aT , 22aßT so with probability 1 -d, V = IwI< .The false a+ß negative condition is satis.ed because we have the number of drops is r> ßT (and packets dropped are unique so they 6CCF s [9] sketch can attain better success probability by using the median of estimates obtained from M indepen­dent sketches, for some number M. this increases the storage and update time by a factor of M.Also note that [9] can show, using 4-universal hashing and Chebyshev s inequality, that the number of bins relates to the error prob­ ability as N = O( 1 d ).
Relationship: contrasting
Domain: Networks
Sentence 1: We have mentioned that this requires the stream identi.er (label) and offset to be carried in­side the transport header as well as the store-me bits and feedback about resource usage.
Sentence 2: a more fundamental issue regard­ing accessing the stream buffers is that the source-driven logic of the transport protocols such as TCP does not match the receiver driven pattern of accessing a cache or in this case byte stream buffer.
Relationship: contrasting
Domain: Networks
Sentence 1: As mentioned ear­lier, to compare the throughput of DMAC, MMAC and 0 0 500 1000 Sendi 1500 ng Rate (Kbps) 2000 2500 Figure 11: Average aggregate throughput of DMAC/MMAC over multiple simulations using random topologies and routes 802.11, we used identical routes in our previous simulations.
Sentence 2: this is unfair for protocols that use directional antennas because routes suitable for 802.11 may be sub­optimal for DMAC and MMAC.
Relationship: contrasting
Domain: Networks
Sentence 1: From our earlier work [21], under heterogeneous setting, the IMR of the node pairs .12 (and .21 ) for two di.erent classes(r1 and r2)can be computed as follows: 8.min(r1,r2)v .12 = .21 .
Sentence 2: (2) pL2 .11 and .22 (beingthe homogeneous case) can be computed from Eq.
Relationship: contrasting
Domain: Networks
Sentence 1: Today s M2M Communication Networks Today we could use the industry standard (i.e., IEEE 802.1Q Virtual LAN [2]) for virtual networking as a M2M communication solution that can accommodate grid applications.
Sentence 2: consider the following deployment scenario of a million scale communication-enabled measurement and monitoring end devices; a relatively-small number (e.g., 100~1000) of network switches; thus, a physical port (called port) in a switch must be logically (not physically) connected to more than one end device (i.e., multiple meters per port via a data concentrator); also, a device must subscribe to more than one VLAN.
Relationship: contrasting
Domain: Networks
Sentence 1: In this perspective, taking advantage of the fact that cellular operators usually possess an important ADSL or cable infrastructure for wired services, the development of femtocell solutions has become very popular.
Sentence 2: while femtocells can be an excellent solution in zones with poor coverage, their extensive use in areas with a high den­sity of mobile users leads to serious interference problems that are yet to be solved.
Relationship: contrasting
Domain: Networks
Sentence 1: TLS Handshake delay cost: Webpage load time has been an active area of research [8, 5, 6, 15, 11]; understanding the exact cause(s) of the in.ation noted above is quite complex and out of scope for this work.
Sentence 2: it is still interesting to understand whether the overall page latency is primarily a.ected by network latency or by protocol overhead.
Relationship: contrasting
Domain: Networks
Sentence 1: is di.cult to deploy a large number of sensors such as disas­ter sites, planet and pollute areas, sensor nodes are deployed sparsely, and thus, su.cient sensing and data transfer can­not be achieved.
Sentence 2: with the development of robotics tech­nology in recent years, there has been many studies on sen­sors with a moving facility (mobile sensors) [2, 4].
Relationship: contrasting
Domain: Networks
Sentence 1: 15http://www.insidefacebook.com/2009/01/23/  in far-off regions may be attributed to a number of hard-to-measure factors, such as social and technological development.
Sentence 2: one OSN architecture-related reason can be the signi.cant round­trip latencies experienced whilst contacting Facebook from regions far away from the U.S.
Relationship: contrasting
Domain: Networks
Sentence 1: As shown in Table 3,SRep has a relatively constant failure probability of 6% as long as there are at least two fast MULEs, but jumps to 52% when all the MULEs are slow.
Sentence 2: prop is incapable of adapting to the mixture of path probabil­ities,and demonstrates notably worse performance when more than half the MULEs are slow.
Relationship: contrasting
Domain: Networks
Sentence 1: Wi =(i -1)T (1) Wi = Max{T1;T2 ;T3 ;...;T(i-1) } (2) In equation (1), a client i wanting to participate and enjoy modest stream application service in a multi-user scenario, has to wait for time Wi equal to a sum of all the waiting durations of the clients wanting to join before this client i.
Sentence 2: in the newly proposed scheme, the waiting duration is reduced and optimized, as in equation 2, in to just the maximum among the waiting times between the 1st client and the (i-1)th client.
Relationship: contrasting
Domain: Networks
Sentence 1: Generalized sphere decoders [16, 18, 19] are designed for situations where the number of trans­mit antennas exceeds the number of receive antennas, and so the MIMO channel matrix is rank de.cient (as opposed to merely poorly-conditioned).
Sentence 2: these techniques don t increase ca­pacity, since capacity increases with min {na, nc}.
Relationship: contrasting
Domain: Networks
Sentence 1: Now, when sender arrives with the .rst send S1 of the tag, it will .nd a RECEIVER READY message with a matching tag.
Sentence 2: since the local counter is 0 (to send the .rst message), the sender will de­cide that the RECEIVER READY is for a future communi­cation, and will perform the communication using EAGER without matching the RECEIVER READY message.
Relationship: contrasting
Domain: Networks
Sentence 1: We remarkthat previous surveys,onlyprovidequalitative comparison of the protocols; as anexample, seeTable2in[30] andTables1, 2 and 3 in [1].
Sentence 2: our results are based on extensive simulations with theONE simulator[15] whichis considered one ofthe reference simulatorforDTN[19].
Relationship: contrasting
Domain: Networks
Sentence 1: Further, since the jamming sequence is generated pseudo-randomly for each transaction and never reused, it can be viewed as a random string for one-time-pad encryption 4 .
Sentence 2: unlike Shannon s OTP, Dhwani does not apply the OTP encryption at the transmitter itself and may be vulnerable to certain attacks such as those based on shielding and directional antennas, which undermine the Wyner wiretap assumption.
Relationship: contrasting
Domain: Networks
Sentence 1: This simulation con.rms thatHARQneed tobe combined with AMC to cover a large dynamic range.
Sentence 2: the proposed RCM scheme has been using the same set of parameters from 5dB to 30dB, and the overall goodput is higherthanthe Oracle combinedHARQandAMC scheme which knows exactly when to switch the modulations.
Relationship: contrasting
Domain: Networks
Sentence 1: However, even this mobile ad­   (c) (d) Figure 1: (a) AN architecture -predictable well-structured .ight paths, (b) Predictable ill­structured .ight paths, (c)Abstraction of pre­dictable ill-structured .ight paths, (d) Unpre­dictable .ight paths hoc network of ANPs with completely unpredictable .ight path, should remain connected at all times.
Sentence 2: this property can only be achieved if the on board transceivers have su.cient transmission range to ensure that, in spite of completely unpredictable .ight paths of the ANPs, they will maintain a connected network at all times.
Relationship: contrasting
Domain: Networks
Sentence 1: In summary, by ensuring centralized control of software and data, centralized management with diskless clients is a promising solution to address the management challenges associated with dis­tributed, inconsistent system states.
Sentence 2: with centralized management, many issues of manag­ing software at server repositories still need to be addressed, for ex­ample, developing scripts or tools to update OSes and applications across various disk image .les or database entries.
Relationship: contrasting
Domain: Networks
Sentence 1: One possible approach to this problem is to construct a distributed token bucket that limits the aggregate rate of all packets with a given resource principal identi.er.3 7.3 Replay attacks In the context of rate-based accounting, a simple model in which resource principals can use a .xed, aggregate bandwidth will likely suf.ce.
Sentence 2: while (modulo cryptographic hardness assump­tions) packet bindings cannot be forged, they may be replayed by an adversary, who may wish to waste a resource principal s limited bandwidth for a given capability.
Relationship: contrasting
Domain: Networks
Sentence 1: Our pro.ling study shows that for the set of MapReduce jobs, the traf.c demand and hence the TIVC models generated across the VMs are of the same type and with the same number of pulses.
Sentence 2: the rising and falling edges of the pulses can be offset, potentially due to the delay in task dispatching from the task sched­uler.Table1 lists the standarddeviationof the rise andfall timings of the pulses for the four applications.
Relationship: contrasting
Domain: Networks
Sentence 1: After the interested message: FormostComcastandCoxhosts,weobservedthattheconnectionswithBitTorrentmessagesweretorndownaftertheinterested messagewassentbytheleecher.
Sentence 2: later in the transfer: Finally,forComcast,CoxandMedia­com,weobservedthatconnectionswithrandomdataonBit-Torrentportswereoccasionallytorndownlaterinthetrans­fer.wewereunabletodetermineacommonpat­ternfortheexactpointwheretheconnectionwastorndown.
Relationship: contrasting
Domain: Networks
Sentence 1: SCHEDULING 3.1 Overview Many scheduling algorithms have been proposed to service data packet queues, whether work-conserving to disallow an interface capacity to go unused or non-work-conserving to allow an interface capacity to go unused.
Sentence 2: few of those scheduling algorithms can provide fairness and yet support differentiated QoS, wireless link fluctuating conditions or varying packet size.
Relationship: contrasting
Domain: Networks
Sentence 1: Measuring Load-balanced Paths in the Internet Brice Augustin, Timur Friedman, and Renata Teixeira Laboratoire d Informatique de Paris 6 (LIP6) Université Pierre et Marie Curie and CNRS ABSTRACT Tools to measure internet properties usually assume the ex­istence of just one single path from a source to a destination.
Sentence 2: load-balancing capabilities, which create multiple active paths between two end-hosts, are available in most contemporary routers.
Relationship: contrasting
Domain: Networks
Sentence 1: An Attacker Model for MANET Routing Security Jared Cordasco Department of Computer Science Stevens Institute of Technology Hoboken, New Jersey, USA  jcordasc@cs.stevens.edu ABSTRACT Mobile ad-hoc networks are becoming ever more popular due to their .exibility, low cost, and ease of deployment.
Sentence 2: toachievethesebene.tsthenetwork must employ a sophisticated routing protocol.
Relationship: contrasting
Domain: Networks
Sentence 1: The evaluation of developed communication protocols usu­ally is carried out with typical network metrics, for example goodput, latency, jitter, and in case of wireless networks the channel load and occurred collisions.
Sentence 2: when Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for pro.t or commercial advantage and that copies bear this notice and the full citation on the .rst page.
Relationship: contrasting
Domain: Networks
Sentence 1: One of the implications of such rewriting is that in the region of the network where the packet carries only that intermediate address, one cannot determine the actual endpoint without obtaining the address mapping stored in the re-writer, which means that a policy-constrained step (e.g., conforming to legal requirements of a particular jurisdiction) is required to retrieve this information.
Sentence 2: if the global IP address is revealed anywhere, then any observer along the path of the packet can capture the endpoint addresses.
Relationship: contrasting
Domain: Networks
Sentence 1: Furthermore, the algorithm verifies that the neighbors available bandwidth is at least superior or equal to the minimal bandwidth required by the flow, that the neighboring node possesses a neighborhood quality of at least MIN_NQ (in our case, MIN_NQ equals 1 meaning that there is at least one QRN in the neighborhood of that node.
Sentence 2: for networks with higher density, MIN_NQ could be easily set to 2 or 3, or higher), and that the link connecting the current node and its neighbor is a high quality link.
Relationship: contrasting
Domain: Networks
Sentence 1: A key factor in specifying our traf.c demand model concerns the issue of modeling the quantities Pweb(·) and PRA(·).
Sentence 2: as seen earlier in Section 4, the empiri­cally derived quantities Uweb(·) and URA(·) are in fact esti­mates of the population of web content and the population of clients, respectively, and are thus natural drivers of our gravity model.
Relationship: contrasting
Domain: Networks
Sentence 1: If the IXP does not provide a LG, we can obtain RS com­munities from third-party LGs of networks connected to the IXP, i.e., RS members.
Sentence 2: these third-party LGs can­not provide the full view of the RS communities for all the RS members, but only for those members that allow their routes to be advertised to the network that operates the LG.
Relationship: contrasting
Domain: Networks
Sentence 1: The mobile ad-hoc networking community has focused on techniques for determining end­to-end contemporaneous paths in a network of mobile nodes.
Sentence 2: using contemporaneous paths is restrictive, and excludes the possibility of data transport using local connec­tivity and node mobility, which has in the past been referred to as data muling [9], or store-and-haul forwarding [10].
Relationship: contrasting
Domain: Networks
Sentence 1: RELATED WORK To the best of our knowledge, there has been no previous research on fault diagnosis in IEEE 802.11 infrastructure networks.
Sentence 2: there are a number of commercial products that provide varying de­grees of support for network management tasks, e.g., AirWave [4], Network Systems and Management (NSM) [16], Wireless Security Advisor [20], AirDefense [2], SpectraMon/SpectraGuard [37], Air-Magnet [3], and Symbol [35].
Relationship: contrasting
Domain: Networks
Sentence 1: The algo­rithm is based on exploiting a repeating preamble by computing the cross correlationofasignalwithadelayedversionofitself,andcom­puting the phase offset across the correlation values at different de­lays to compute the CFO.
Sentence 2: the algorithm needs to be mod­i.ed for collisions, since we wont have a clean copy of the repeat­ing preamble for the packet that starts second.
Relationship: contrasting
Domain: Networks
Sentence 1: In contrast, setting the maximum cache allowance for CCN router close to the gateway of an ISP that is connected to clients and the min­imum cache allowance for CCN router close to the server provides the highest pro.t to an ISP connected to the server.
Sentence 2: adjusting the cache allowance at the CCN routers of the ISP that are connected to the server does not a.ect the pro.ts of the ISP that is connected to clients.
Relationship: contrasting
Domain: Networks
Sentence 1: We also prove the upper bound of the energy 2 na complexity in narrowband networks to be ( · 2 ) On , and for UWB networks, this upper bound can be reduced by a processing gain factor.
Sentence 2: we show that improving the scheduling complexity through arbitrary power control has its limitations, and that different power assignment strategies have different impacts on the protocol interference models, which was often neglected in the design of wireless scheduling algorithms.
Relationship: contrasting
Domain: Networks
Sentence 1: = 0 (9) dCW dp0 dCW According to (6), dSt = 0, so dp0 (1 - p0)n - T {np0 - [1 - (1 - p0)n]} = 0 (10) Because CW = n = 1, therefore, n(n - 1) (1 - p0)n 1 - np0 + p 20 (11) 2 v n[n + 2(n - 1)(T - 1)] - n 2 p0 = v (12) n(n - 1)(T - 1) nT From (6), we can get the approximate value of CW is v CW n 2T .
Sentence 2: here, we can see that the maximization of the system throughput depends on the number of contending sensor nodes n. the CW in S-MAC is a constant value.
Relationship: contrasting