sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: While its match­ing quality is therefore inferior to that of the wavefront-based implementation, its general behavior is otherwise similar.
Sentence 2: the separable input-.rst switch allocator even­tually becomes limited by the fact that it can only propa­gate a single request per input port to its second arbitration stage; consequently, it s matching quality starts to .atten out once the probability of at least one VC at a given input port having a .it available in any given cycle becomes high, and is generally lower than the one o.ered by the other two allocator implementations.
Relationship: contrasting
Domain: Networks
Sentence 1: Pure probabilistic forwarding is prone to per­colation, leading to either network .ooding by redundant copies of the same packet, or too few nodes receiving it [5].
Sentence 2: centralized deterministic schemes, de­signed for mesh networks with static nodes, incur high over­head and are vulnerable to metric misinformation due to use of forwarding lists, which propagate such errors.
Relationship: contrasting
Domain: Networks
Sentence 1: This approach is closer in spirit to approachesin wired networks that have attempted to detect congestionat the ends [18, 22], but with one important difference: inRCRT, a sink has a more extensive view of network per­formance than, for example, a TCP sender, since the sinkreceives traf.c from many sources.
Sentence 2: it would be incorrect to merely borrow conges­tion detection methods used in wired networks.
Relationship: contrasting
Domain: Networks
Sentence 1: (10) n-o If the right-hand side of the inequality in (10) increased ev­erywhere slower as a function of Rk than Rk itself, we could say that the q-quantile of Rk is the unique .xed point of the square-root expression with each n; this is in general not the case.
Sentence 2: taking the equivalent squared inequality 2 log n + (k - 1) log(nmR2 k ) - log(k - 1)!
Relationship: contrasting
Domain: Networks
Sentence 1: Hybrid ad hoc routing protocols such as zone routing protocol (ZRP) [13] tried to combine local proactive routing and global reactive routing in order to alleviate the large amount of flooding control traffics.
Sentence 2: the properties of frequently route breakage and unpredictable topology changes in MANETS still make most of these traditional routing protocols inherently not scalable with respect to number of nodes, control overhead and degree of mobility.
Relationship: contrasting
Domain: Networks
Sentence 1: DISCUSSION Most work in this area has focused on raising the level of ab­straction of network con.guration by various means of generating routing con.guration .les [1], checking correctness of such con.g­urations [4], or centralising the computation of routes [3].
Sentence 2: we are attempting to integrate the design ofa con.g­uration language with an underlying algebraic semantics.
Relationship: contrasting
Domain: Networks
Sentence 1: In contrast, traceroute measurements provide the ability to infer the data paths that packets take when traversing the Internet.
Sentence 2: because theyare activemeasurements, traceroutes can be designed to potentially cover every corner of the Internet given suf.cient numbers of vantage points (VPs).1 all exist­ing traceroute-based projects are restrictedby their limited number of VPs.
Relationship: contrasting
Domain: Networks
Sentence 1: This is due to the fact that the busy status in an overlapping channel may not be sensible to the WLAN devices, which in turn prevent the 802.11 MAC based on carrier sensing from working properly.
Sentence 2: we observe that when two channels are 20 MHz apart (or channel gap is 4 in terms of the channel number), e.g., channels 1 and 5, the performance loss is rather negligible.
Relationship: contrasting
Domain: Networks
Sentence 1: This phenomenon can be attributed to the limit­ing e.ect of the parity slot prescribed by SSCH when the network is close to saturation: nodes using SSCH can only utilize (N - 1) channels speci.ed by (N - 1) seed values in the parity slot.
Sentence 2: nodes using the other CH protocols can fully utilize all N channels in any time slot.
Relationship: contrasting
Domain: Networks
Sentence 1: Given these features, it is nat­ural to think of forming a backhaul network based on IEEE 802.16 WiMAX nodes (Figure 1).
Sentence 2: the cost of indi­vidual WiMAX base stations is still around $20000 whereas the cost of WiMAX subscriber station is only $300 and is expected to reduce further [3].
Relationship: contrasting
Domain: Networks
Sentence 1: As the RREP is routed back along the reverse path, intermediate nodes along this path set up forward path entries to the destination in its route table and when the RREP reaches the source node, a route from source to the destination established.
Sentence 2: if the destination or some intermediate node moves, the node upstream of the break remove the routing entry and send route error (RERR) message to the affected active upstream neighbors.
Relationship: contrasting
Domain: Networks
Sentence 1: To ensure that the matrix is neither too dense nor too sparse to capture the memory bus behavior, we used 20 columns per million instructions in the x-axis (every 1/20 of the one million instructions is mapped to a column), and the y-axis has 400 rows.
Sentence 2: this dimension parame­ter is not of primary importance because the large matrix is scaled to a smaller matrix before any analysis is performed.
Relationship: contrasting
Domain: Networks
Sentence 1: In the case where the client is a low-power device such as a cellular phone or PDA, this computational savings could result in a signi.cant reduction in latency.
Sentence 2: the Java implementation of our algorithm can process blocks at a rate of 7.25 MB/s on a 1 GHz Pentium III, a rate equivalent to the download bandwidth of over 1,000 modern modems; we thus expect the additional per-client computational load on the server to be small enough to allow it to scale to large numbers of clients.
Relationship: contrasting
Domain: Networks
Sentence 1: Integrating DTN and MANET Routing J ¨org Ott Helsinki University of Technology Networking Laboratory  jo@netlab.tkk.. ABSTRACT Mobile Ad-hoc Network (MANET) routing protocols aim at estab­lishing end-to-end paths between communicating nodes and thus support end-to-end semantics of existing transports and applica­tions.
Sentence 2: dTN-based communication schemes imply asyn­chronous communication (and thus often require new applications) but achieve better reachability, particularly in sparsely populated environments.
Relationship: contrasting
Domain: Networks
Sentence 1: Node k- 1was not able to overhear node k s transmission or receive an explicit ACK from k.  In case 1, k- 1needs to retransmit immediately.
Sentence 2: in case 2, k- 1needs to time its retransmission so that the retransmitted packet does not collide with the overhearing of data packet transmitted by k+1at k. The knowledge of next two for­warding hops, i.e., kand k+1, can be used to accurately time the k,k+1 D retransmission at k- 1to avoid collision at k.If 2Tp - Tt < k-1,k k+1,k D 2Tp <2Tp +Tt ,then k- 1 s retransmission will col­lide with the overhearing of the packet transmitted by k+1at k. Thus, collision can be avoided if k- 1delays its retransmission by k,k+1 k-1,k D 2(Tp - Tp )+Tt to reach node kexactly after it .nishes its overhearing from k+1.
Relationship: contrasting
Domain: Networks
Sentence 1: CONTROL ACTIONS 2.1 Spreading Gain Control The backlogged traffic generated by a packet session (n, s), s 2 is transmitted at rate C =FW where F is the ns ns chip rate of the system and W is the spreading gain.
Sentence 2: ns due to interference, only a fraction of transmitted packets is accepted at the base station as received correctly, i.e.
Relationship: contrasting
Domain: Networks
Sentence 1: With the assumption that the initial bits are set to 0, Claim 9 from [1] demonstrates that for 0 <u =d: .. XWj u pu(Wj)= , (2) 4 Thus, if the victim could determine a su.ciently good estimate on pu(Wj), for any u,0 <u =d,it would have enough information to determine the string Wj.
Sentence 2: the adversary is able to hide the pu(Wj)s by choosing what fraction of the packets are sent on each of the di.erent paths.
Relationship: contrasting
Domain: Networks
Sentence 1: To fully ensure such isolation, one must en­force the access restrictions (and QoS guarantees) on all hops of an end-to-end path.
Sentence 2: in virtu­alized servers, the real end-points are the VMs, and hence the end-to-end path extends through the server, involving the I/O subsystem as the last-hop.
Relationship: contrasting
Domain: Networks
Sentence 1: The k-th packet's virtual finish time, fl k (t), in flow i is computed by ski(t) = max(V(t),fik-l(t)) (2) L (3) fik(t) = ski(t) + ¢'-~ where si k (t) is the virtual start time of packet k in flow i at time t, L is the packet length, V(t) is the virtual system time and ¢i is the weight of flow i at time t. The important property of the WFQ scheduler is that WFQ in itself cannot fall behind GPS with respect to service given to a flow by one maximum packet size.
Sentence 2: in [1], it is shown that WFQ can be far ahead of GPS more than one maximum packet size.
Relationship: contrasting
Domain: Networks
Sentence 1: Indeed, in the case of a left-turn (or in other examples such as a stop sign), the vehicle usually becomes stationary before the driver is allowed to turn, and it is in this stationary state that the vehicle would need the most to announce its pres­ence to the other drivers.
Sentence 2: using frequency adaptive techniques such as those presented above would result in ex­tremely reduced communication opportunities in situations where stationarity is not induced by tra.c conditions but by drivers intentions.
Relationship: contrasting
Domain: Networks
Sentence 1: This means tsd =1 for DOT and tsn = 8 for Optimized Slotted 1-Persistence and Slotted 1-Persistence.
Sentence 2: while .nding the optimal value for tsn in Optimized Slotted 1-Persistence and Slotted 1-Persistence depends on accurately knowing the current network density, DOT with tsd =1 scales independently from other factors.
Relationship: contrasting
Domain: Networks
Sentence 1: Total goodput is increased as compared to the omnidirectional case because (i) TAP and TAP are no longer starved and now contribute to goodput, (ii) there is a second air interface, and (iii) there are reduced collisions.
Sentence 2: notice that the total goodput achieved by the system is 67% of that of the reference model for CSMA (and slightly less for CSMA/CA) and signi.cantly less than twice that achieved with a single omnidirectional antenna.
Relationship: contrasting
Domain: Networks
Sentence 1: The vehicles inside the advertisement zone that re­ceive the request message and are not closer to the gateway than the sending vehicle, ignore the message.
Sentence 2: for fault tolerance purposes, vehicles inside the advertisement zone that receive the request message and are not supposed to forward it, but they do not hear the message forwarded by a neighboring vehicle closer to the gateway, force the for­warding of the request message.
Relationship: contrasting
Domain: Networks
Sentence 1: ExperimentalMetrics:Averageperformanceincludestwo metrics,memoryutilizationandcompaction.First,consider averagememoryutilization.Computingtheaveragemem­oryneededisnottrivialbecause(especiallyforthetrace experiments)thesizegrowsandfallsasprefxesaredeleted andadded.Wewishtofndtheminimumamountofmem­oryMneededtosatisfyarunofanallocatoronthetrace.
Sentence 2: weknowthatMmustbelargerthanthepeaksizeofthe actualdatastructure(sayMl).itcouldbelarger becausetheallocatorsarenotperfect.itcannot belargerthanthatcausedbyworstcasememoryutilization (sayMh).WethendobinarysearchbetweenMlandMh bydoingrepeatedrunsofthesametraceuntilwefndthe smallestvalueMofmemorybetweenMlandMhsuchthat allallocatesaresatisfed.Wecomputetheaveragemem­oryutilizationasMl/M(becausetheallocatorrequiredM wordsofmemorywhenaperfectallocatorwith100%uti­lizationwouldrequireonlyMlwords).
Relationship: contrasting
Domain: Networks
Sentence 1: Another observation is that heterogeneity in terms of both intra­community weight as well as inter-community (cut) weight can in­deed be reproduced by the synthetic models.
Sentence 2: we want to stress that careful tuning of synthetic models is needed, when used to evaluate protocols based on social network structure [13, 15, 16, 34], to ensure that realistic community and inter-community struc­ture is reproduced.
Relationship: contrasting
Domain: Networks
Sentence 1: These paths are ordered in a three-dimensional matrix F: for every SGW k and every WGW i,F con­tains an ordered vector F[k][i]withupto M di.erent elements that represent a route in the mesh between WGW i and SGW k.  Interference matrix I: Based on Section 3.2 and the pre-assigned channels of the NICs we can calculate the interference level for every communication link in the WMN.
Sentence 2: in­terference cannot be expressed per communication link because it can only be expressed per receiver.
Relationship: contrasting
Domain: Networks
Sentence 1: Intuitively, it would be beneficial to set u to a large value for finer-grain resolution of priorities among the nodes with different RC values and, thus, for a better approximation to the greedy oracle scheme.
Sentence 2: large values of u have the disadvantage of increasing the delay, since the TS grows longer (quadratic in u, from Proposition 1) and large number of initial time-slots go by empty, as no nodes are then admissible  5.2 Changing Network Topology For all of the mobility experiments presented here, each data point was obtained after a simulation warm-up time of 1000 [s] in which the mobility model could converge to a stationary node distribution.
Relationship: contrasting
Domain: Networks
Sentence 1: To repeatedly attack the same destination without being caught, Hs must either wait for its .lter to expire, which means it has stopped the attack, or exhaust the router s .lters to make its .lter (Hs,Hd) replaced.
Sentence 2: it can at most trigger Nf StopIt requests in a period Ti to exhaust router .lters.
Relationship: contrasting
Domain: Networks
Sentence 1: We note that LTC performs as well as AE for large error bounds, but is unable to keep up when the error bound is small.
Sentence 2: the truncated LZW does well for small error  (a) Spatial compression: Compression ra-(b) Spatial compression: Compression ra-(c) Temporal compression: Error bound tio vs. relative error Erel .
Relationship: contrasting
Domain: Networks
Sentence 1: When de-aggregation is not required (99.97% of the failures), a link failure in DRAGON produces, at worst, a network-wide effect for the pre.x at the root of the pre.x-tree and only a local effect for each of the other pre.xes.
Sentence 2: in BGP, all pre.xes in the pre.x-tree are prone to network-wide effects.
Relationship: contrasting
Domain: Networks
Sentence 1: Themodelsmentioned aboveareforsinglehop networks and cannot be applied directly to a multihop ad hoc net­work.
Sentence 2: practically, a network may not always be saturated, andinanadhocnetwork, therecanbemultiple hops between a given source and a destination, therefore, there is a need to analyze how IEEE 802.11 DCF performs in case of an ad hoc network under nonsaturation conditions.
Relationship: contrasting
Domain: Networks
Sentence 1: In [17], the authors proposed a new OFDMA-based multi­channel CSMA/CA protocol, which enables the nodes to contend with each other for channel access both in time and frequencydo­mains through a two-dimensional backoffscheme.
Sentence 2: it segments the channel bandwidth into multiple narrow-band random access chan­nels and adjusts the transmission probability according to the multi­channelactivityina.exible manner.theseworks neither consider the effects of the signi.cant guard time in long-delay un­derwater networks nor explore the FDM/OFDM scheme, which is quite practical and ef.cient in the wide-band underwater acoustic communications.
Relationship: contrasting
Domain: Networks
Sentence 1: However, this would be an inaccurate conclu­sion as routers R2,R4,R5 and R8 are sharing a multi-access link and P1 and P3 are not really link disjoint.
Sentence 2: a tracenet collected topology info as shown in Fig­ure 2.c would include the subnet information hence, would help to avoid the incorrect conclusion above.
Relationship: contrasting
Domain: Networks
Sentence 1: Note that the VMs and the controller application cannot, for example, determine the precise location of every packet in the network.
Sentence 2: there are some differences the tenant may detect during a migration: (a) latency or throughput of data traf.c may change, (b) packets may be lost or delivered out of order, and (c) control messages between the controller and the switches may experience variable delays.
Relationship: contrasting
Domain: Networks
Sentence 1: Only uncompressed voice connections with Pulse Code Mod­ulation (PCM) are supported, and 64Kbps bandwidth is assigned to each voice connection.
Sentence 2: with the use of speech coding techniques that produce compressed voice and/or detect silent periods, it is expected that high quality voice data can be transmitted at or below 4Kbps, and that the Bluetooth speci.cation will support voice transmission at two or more distinct rates.
Relationship: contrasting
Domain: Networks
Sentence 1: We thus have d .2.3/2 (u(t)-v(t))=· dtu(t)+v(t) Integrating, this yields .2.3 t dt u(t)+v(t)= u(t)-v(t)= u(t0)-v(t0)+ · 2 t0 u(t)+v(t) (43) Provided u(t0) = v(t0), this implies that u(t)+ v(t) is at v least of order t. Since we also have that u(t)= v(t)+u(t0)-v(t0), v necessarily u(t)must also be at least of order t. However, we can always choose t0 such that u(t0)- v(t0) = 0, for otherwise, it would follow from (41) that u(t) is bounded, and in turn from the previous display that v(t)is bounded.
Sentence 2: thiscannotholdinview of(43).
Relationship: contrasting
Domain: Networks
Sentence 1: Moreover, the independence assumption always leads to a pessimistic prediction, which is a desirable property in the context of network design and management.
Sentence 2: in thepresenceofalargeamountofcross tra.conthe paths of the .ows, one may think that intermingling of pack­ets belonging to di.erent .ows, with the consequent separa­tion of packets belonging to the same batch, would mitigate the strong correlations that we have found in the tra.c pro­duced by the TCP sources.the ack compression phenomenon [22] is expected to exacerbate the burstiness of packet transmissions.Finally, heterogenous link capacities should be taken into account.Whatever hap­pens, it is intuitive to understand that a queue model with instantaneous batch arrivals will always produce a conser­vative analysis, provided that there are enough active .ows to assume uncorrelated batch sizes.
Relationship: contrasting
Domain: Networks
Sentence 1: In [15], the indistinguishability is de.ned on the view of the honest par­ties (on their input, states, and output) in the ideal-world and in the real-world models.
Sentence 2: an adversary can distort the states of the honest parties in unavoidable ways, and hence, the classical de.nition would be too strong and no routing protocol would satisfy it.
Relationship: contrasting
Domain: Networks
Sentence 1: As NU increases, the hybrid protocol operates more like the unscheduled access 20 18 16 14 12  Efficiency (bits/J) Energy (J) 10 8 6 2 4 2 0 0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1 Reception Probability, PR Transmission Probability, PT Figure 2: Protocol Energy Figure 4: Random Protocol E.ciency independent of its operating state, the optimal PT equals T 1 .
Sentence 2: this is not the case in underwater networks.
Relationship: contrasting
Domain: Networks
Sentence 1: When QPSK data modulation is used, the joint iterative Tx/Rx FDE &#38; FDIC can reduce the required Eb/N0 for achieving BER=10-3 by about 1.0dB and 0.8dB compared to the conventional iterative receive FDE &#38; , modulation is used, the joint iterative Tx/Rx FDE &#38; FDIC can (24) reduce the required Eb/N0 by about 0.5dB and 1.0dB for R=1/2 where the second term represents subtraction of the residual ISI and R=3/4, respectively.
Sentence 2: in the uncoded case, the BER replica as in the receiver given by Eq.
Relationship: contrasting
Domain: Networks
Sentence 1: This is mainly attributable to high tra.c levels in these benchmarks where the speculative techniques used by the baseline fail whereas EVCs, being non-speculative, show large gains.
Sentence 2: .t, lu, radix, barnes and ocean represent low to medium tra.c with moderate hop-counts, leading to a latency reduction of 20.8%, 22.9%, 34.6%, 19.4% and 35.8%, respectively, using the dynamic EVC design.
Relationship: contrasting
Domain: Networks
Sentence 1: Fur­thermore, the recent developments in Embedded Computing and Wireless Sensor Networks [5, 6], along with the success­ful IP for Smart Object (IPSO) Alliance, clearly illustrate the need and bene.ts to be gained from making embedded devices part of the Internet.
Sentence 2: these trends illustrate only connectivity at the TCP/IP level without actually con­sidering what goes on top, at the application level, where a standard protocol is lacking.
Relationship: contrasting
Domain: Networks
Sentence 1: It is particularlyevinced that around half of the users use Web applications duringsuch special events, that another relevant part uses messaging ap­plications, and that real time applications are limited to less than10% of the usage.
Sentence 2: real time applications gener­ate most of the traf.c against negligible part for chat and msg apps.Moreover, TCP-based applications largely overcome UDP ones inabsolute volumes (even if there is no apparent correlation betweenTCP and UDP applications and geographical location).
Relationship: contrasting
Domain: Networks
Sentence 1: In wireless sensor networks, since the transmission power is associated with the physical distance between the source and the destination, it is reasonable to assume that the transmission cost associated with each link is identical to the transmission cost with its opposite direction.
Sentence 2: constructing the minimum cost multicast tree is the well known for Steiner tree problem, which is proven to be the NP-completeness [1][8].
Relationship: contrasting
Domain: Networks
Sentence 1: 3.3 MitigatingUnfavorableListeningCosts Reliable broadcast has been extensively studied in the multi­hopgrid model[5 7,19,30],particularly with ajamming adver­sary[2,4,8].Reliablebroadcastispossiblewhen tByzantinenodes can each corrupt at most nc transmissions[8].
Sentence 2: unfortunately, the protocol of[8], and theimprovementby[4], requires that correct nodespossess much more energy than theByzantine nodes.Inpar­ticular,whilethesendingcostsareimprovedin[4],both[4,8]allow theadversarytoforceacorrectnodetolistenforO(t· nc)slots(lis­tening costsin[2] are similar).eachByzantine nodeis activefor nc.
Relationship: contrasting
Domain: Networks
Sentence 1: A limitation of the compu­tational approach is that it requires sweeping the di.erent parameters of the model to completely characterize the dy­namics.
Sentence 2: our task is greatly simpli.ed by the fact that the dynamics of the normalized model is completely determinedbythetwoparameters ¯Weproceedby w, and g. de.ning stability of limit cycles.
Relationship: contrasting
Domain: Networks
Sentence 1: (2) DLP s route-update cost can be made O(1) by using Tree Bitmap [4], if memory man­ agement overhead is ignored.
Sentence 2: tree Bitmap almost doubles the worst-case memory size due to its inability to use leaf-pushing, and requires over 100 memory accesses, in the worst case, for a route-update if memory management overhead is considered.
Relationship: contrasting