sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: Thus if the IPS received P1,P2,P3,P4,P5 in order where packets P1,P4, and P5are small and P2and P3 are large, then P1and P4 are consecutive small packets, and so are P4and P5.
Sentence 2: p1and P5 are not consecutive small packets because of the presence of P4 in between.
Relationship: contrasting
Domain: Networks
Sentence 1: As canbeobserved from Figure16, thedi.erence in weights w(P2) - w(P1) decreases with N. However, the di.erence in weights w(Pl) - w(P1) increases, which makes the di.erence in weights between the link-disjoint paths a less suitable up­per bound in sparse networks that have a large expected hopcount.
Sentence 2: since w(P2) - w(P1) gives us a con­servative estimate, this is the more important measure to predict the stability of a path in worst case.
Relationship: contrasting
Domain: Networks
Sentence 1: We observe that most of the screen-off traf.c (in terms of the energy impact) is less delay-sensitive, e.g., push noti.cation, since user interaction is not involved.
Sentence 2: there are also some exceptions for screen-off applications which requires real-time data transfer, e.g., when the user is making a VoIP call with the screen off.
Relationship: contrasting
Domain: Networks
Sentence 1: 7.2 EpochbasedScheduling The notion of epochs itself is not new, and has been used in other schedulingproblems,includingfor wireless networks[18].
Sentence 2: such prior work used epochs to aggregate knowledge about traf.c demands in a distributed environment, while we use epochs tohideinaccuraciesin schedulingdue to variablelatencies onthepathfordownlink schedulinginenterpriseWLANs.
Relationship: contrasting
Domain: Networks
Sentence 1: When applications request a service or data, they care only about the identity (for service) or content (for data) of the object they requested; the particular end-host servicing a re­quest is immaterial.
Sentence 2: today s DNS-based names for ser­vices and data (e.g., URLs like http ://abc.org/dog.jpg) force applications to resolve service and data names down to an IP ad­dress (e.g., to fetch the data named by the URL above, the Web browser itself, rather than a lower level software module, has to learn the IP address represented by abc.org), thereby binding the application request to a particular network location, as expressed by an IP address.
Relationship: contrasting
Domain: Networks
Sentence 1: Furthermore, the ability to provide end-to-end QoS control as well as to allow ubiquitous services to mobile users are the keys to the success of the next generation IP wireless systems [3].
Sentence 2: to allow the distribution of published multi-user sessions throughout heterogeneous wireless networks with end-to-end QoS control, it seems to be mandatory the control of session quality level mapping in receiver-driven and source-initiation approach, taking into consideration the QoS characteristics and network conditions of the path from the publisher to subscribers, allowing the control of QoS in environments with inter-domain/cluster asymmetric routing.
Relationship: contrasting
Domain: Networks
Sentence 1: We demonstrate that: From the set of hammers, data-caches generally not sup­ported in today s NPs outperform such mechanisms as wide­word accesses, special-purpose result-caches, and exposed multi-level memory hierarchy.
Sentence 2: because packet pro­cessing applications are memory-access-intensive, data-cache misses can cause signi.cant processor stalls.
Relationship: contrasting
Domain: Networks
Sentence 1: Using the Pollaczek-Khinchin mean formula to estimate the average backlog of an M/G/1 queue at a random observation point, .2 E[S2]/R2 we would have .i E [Sp] /R + i p as initial backlog.
Sentence 2: 2(1-.i) we are interested in the conditional initial backlog Z(i) , given that the observed queue is not empty (otherwise there is no busy period), which happens with probability .i.
Relationship: contrasting
Domain: Networks
Sentence 1: Due to congestion in network, PDR decreases as shown in Figure 6 and EED increases as shown 0.2 0.15 0.1 0.05 in Figure 5.
Sentence 2: in RA-AODV, the EED is 50 100 150 200 250 300 low due to the controlled transmission rate at source nodes.
Relationship: contrasting
Domain: Networks
Sentence 1: Due to the upper triangular structure of R,the k-th element of a is given by ak1,l = Q(z2,l/r22,l) (18) ak2,l = Q((z1,l -(r12,l ·ak1,l))/r22,l).
Sentence 2: if the .rst detected SM symbols are in errors in the process of DFE, the errors will be propagated into the next layers , which is shown as the increasing of the interfer­ence of the next layers.
Relationship: contrasting
Domain: Networks
Sentence 1: As we discussed in the last subsection of section 3.3, the attack can be probably slowed down in practice if some modi.cations are employed in the process of choosing the update group O, to make it harder for the adversary to corrupt this group, or, equivalently, to make it harder for the adversary to have whatever players he does corrupt be chosen as the O group.
Sentence 2: summing up the discussion from that section, it is not clear how to modify the protocol in order to make the adversary s success signi.cantly harder, and at the same time not to severely limit the applicability of the URSA scheme.
Relationship: contrasting
Domain: Networks
Sentence 1: They form the routing structure F. Note that Tk rooted at gk may include nodes not in Dk, and in that case, the number of descendants of gk, |VDk |, will exceed c(gk).
Sentence 2: gk is still able to ful.ll the data relay task since it is only supposed to store data generated from sensors in Dk and upload them to the MS when the MS moves within its transmission range.
Relationship: contrasting
Domain: Networks
Sentence 1: INTRODUCTION In rural areas, mainly in developing countries, it is often not feasible to deploy the interactive and high capacity con­nectivity that the Internet allows specialists.
Sentence 2: it is easy to achieve a lower quality connectivity, often intermit­tent, for example, using solar powered energy hungry VHF orHF radios or wireless routers, or traditional and expensive modemphonecalls.
Relationship: contrasting
Domain: Networks
Sentence 1: Rule 1 extends the basic failure recovery protocol as follows: When a node, x, locates a quali.ed substitute for a hole in x.table using step (a), (b), (c), or (d) of the failure recovery protocol, if the quali.ed substitute is an S-node, then x .lls the hole with it and ter­minates the recovery process.
Sentence 2: if the quali.ed substitute is a T-node, x saves the T-node in a waiting list for the entry and continues the recovery process.
Relationship: contrasting
Domain: Networks
Sentence 1: As shown in Fig.5, the latency is increasing as the fluctuation ratio increases for all three scheduling Figure 5: Average Data Latency under Di.erent Fluctuation Condition Figure 6: On-Time Data Arrival Ratio under Di.er­ent Fluctuation Conditions algorithm.
Sentence 2: by scheduling in our algorithm, peers send the data which is needed by most number of descen­dant peers .rst.
Relationship: contrasting
Domain: Networks
Sentence 1: Adaptive Streaming On Heterogeneous Networks Massimo Bernaschi National Research Council Filippo Cacace, Raffaele Clementelli Luca Vollero Consorzio Nazionale CINI massimo@iac.cnr.it Universit `a Campus Bio-Medico vollero@ieee.org f.cacace@unicampus.it raffaele@raffasoft.it ABSTRACT Speci.c network protocols, like MobileIP, o.er seamless con­nectivity to mobile systems.
Sentence 2: the QoS requirements of streaming applications and video conferencing systems re­quire an approach that spans across di.erent layers of the network stack.
Relationship: contrasting
Domain: Networks
Sentence 1: 3.2 Queues with lifetimes Even though some of the ICN research appears to assume that network queues are not needed with ICN because of the network­based content storage model [12], we believe that for scheduling purposes queues are inevitable in any network, including information­ 1In the text we use the terms lifetime and deadline interchange­ably.
Sentence 2: our implementation assumes deadlines as absolutetimestamps.
Relationship: contrasting
Domain: Networks
Sentence 1: Let us assume that the number of nodes and their locations in a given area are .xed.
Sentence 2: consider the following two cases of transmission range; In case 1, all nodes have the same transmission range R. in case 2, 50% of nodes has a transmission range of R1 = 32 · R and 50% of nodes have a transmission range of R2 =2R1.
Relationship: contrasting
Domain: Networks
Sentence 1: A Message Ferrying Approach to Low-Cost Backhaul in Cellular Networks Sayed Amir Hoseini1,2 , Azade Fotouhi1,2 , Mahbub Hassan1,2 , Chun Tung Chou1, *  Mostafa H. Ammar3 1University of New South Wales (UNSW), Sydney 2052, NSW, Australia 2National ICT Australia (NICTA) 3Georgia Institute of Technology, Atlanta, GA, USA {amirhoseini, azadef, mahbub, ctchou}@cse.unsw.edu.au, ammar@cc.gatech.edu ABSTRACT Cellular operators are considering large-scale small cell de­ployment in urban tra.c hot spots to combat the loom­ing capacity crisis in their networks.
Sentence 2: connecting a large number of small cells to the network core using cur­rent backhaul technology is costly.
Relationship: contrasting
Domain: Networks
Sentence 1: Thus, we consider a given d and compute E[z]for all nodes within daswellas thefractionofthesenodes which reliablyreceive the message.
Sentence 2: as expected, the reliability is very close to one when­ever dissmall.aswekeepincreasing d, E[z].attens out withaconsequent(and substantial)decreaseofthereliability.This operating regionshouldbeavoided asthebroadcastprotocol isno longer effectivehere.
Relationship: contrasting
Domain: Networks
Sentence 1: Compared to a DFQ scheduler whose quantum size is the same as the packet size in the input traf.c, the FIFO scheduler actually shows a lower byte throughput be­cause at the receiver end of a network link, DFQ only needs to perform a single DMA transaction for a batch of quanta whereas FIFO requires one DMA transaction for each in­dependent packet.
Sentence 2: fIFO can continue to exploit the increasing packet size to improve the DMA transactions ef.ciency at the sender end and eventually out-perform all DFQ instances with a .xed quantum size, in terms of byte throughput.
Relationship: contrasting
Domain: Networks
Sentence 1: Our algorithm converges to a function that is approximated well by the following polynomial: u(r) = 1.8*r3 3.1*r2 + 2.3 3.4 Routing on Optimal Paths Unfortunately, we cannot compute a closed form formula for the optimal trajectories because the path integral can be symbolically computed only for a few particular cost functions.
Sentence 2: we can still route along approximately optimal paths by computing numerical approximations at nodes in the network.
Relationship: contrasting
Domain: Networks
Sentence 1: Akeychallengethatwehadto overcometorealizethis architec­tureis todesign a small wearable radio that simultaneouslyjams the IMD s signal and receives it.
Sentence 2: we build on prior work in the area of full-duplex radio design, which enables a single node to transmitandreceivesimultaneously[3,7].priorworkre­quireslarge antenna separation andhenceyieldslargedevices un­suitableforourapplication.Inparticular,thestate-of-the-artdesign forfull-duplexradios[3]exploitsthepropertythatasignalreverses itsphase everyhalfa wavelength;ittransmitsthe same signalfrom two antennas andputs a receive antenna exactly halfa wavelength closer to one of the transmit antennas than the other.An antenna separation ofhalfa wavelength,however,isunsuitableforour con-text:theIMDs we consider operateinthe400MHzband[13]with a wavelength ofabout75 cm.Ashieldthatrequiresthe antennasto be rigidly separatedby exactlyhalf a wavelength(37.5 cm) chal­lengesthe notion ofwearability andthereforepatient acceptability.
Relationship: contrasting
Domain: Networks
Sentence 1: Regarding the e.ect of di.erent reliability values of the wireless channel on the value of tmin, we observe the follow­ing: a considerable increase in the channel reliability (from p =0.5 to p =0.9), results in a percentage reduction of tmin which decreases with distance, and varies from 37.8% (d¯= 12) to32.3% ( d¯= 55) with ImGlobal dissemina­tion, and from 29.9% ( d¯= 12)to25.1% ( d¯= 55) with Global dissemination.
Sentence 2: given the same channel reliability, the message dissemination strategy has a considerable in.uence on tmin: at distance d¯= 55, using ImGlobal dissemination reduces tmin of 50.39% with re­spect to the case of Global dissemination with low channel reliability, while the percentage reduction becomes 54.9% in case of high channel reliability.
Relationship: contrasting
Domain: Networks
Sentence 1: For large captures this not only takes a signi.cant amount of processing time but also consumes vast amounts of system memory neg­atively impacting other running applications and slowing overall system performance.
Sentence 2: captureFoundry does not rely on system memory but instead stores all performed index processing in persistent .les which have a strict and predictable structure that supports rapid ac­cess to packet data.
Relationship: contrasting
Domain: Networks
Sentence 1: (Furthermore,suhapartyouldjust beusedtodiretlyimplementbroadast.
Sentence 2: )wedo noteoneimportantsenariowhereTheorem5anbeap­plied.Aswehavementioned,seureprotoolsoftenuse manyinvoationsofabroadastprimitive.Furthermore,in ordertoimproveroundeÆieny,inanygivenround,many broadastsmaybesimultaneouslyexeuted.Thekeypoint hereisthatwithintheseureprotool,uniqueidentifersan bealloatedtoeahbroadast(bytheprotooldesigner).
Relationship: contrasting
Domain: Networks
Sentence 1: ARAM clearly matches the depth ratio of each instance of the routing table, but this is not surprising since ARAM is implic­itly engineered (given its split and spawn parameters) to generate a number of pre.xes at depth zero and depth one that is comparable to those in a real routing table.
Sentence 2: it is important to note that scatter gets the depth dis­tribution completely wrong, and it is not hard to see why.
Relationship: contrasting
Domain: Networks
Sentence 1: Hence for most messages vehi­cles can forward them without veri.cation to preserve their lim­ited computational resources.
Sentence 2: such a verify-on-demandapproach is vulnerable to communication-based denial of serviceattacks where the attacker sends a large number of bogus signa­tures to exhaust the available bandwidth, because a single invalidsignature is likely to be relayed and duplicated many times beforebeing detected at the destination(s).
Relationship: contrasting
Domain: Networks
Sentence 1: This gate­shrink modality improves circuit speed and reduces power budgets, and is relatively straightforward from the layout perspective since the application of phase shifters is sparse .
Sentence 2: for true sub-130nm processes the full poly layer (and possibly local interconnect (salicide) layers as well) will need to be phase-shifted in order to maintain the transistor densities prescribed by the Roadmap [24].2 In other words, AltPSM will become a lever for die area and die cost, in addition to speed and power.
Relationship: contrasting
Domain: Networks
Sentence 1: By the right-hand rule, node 2 initially chooses node 4 as its next hop.
Sentence 2: as link (2,4) is intersected by line (1,7) and |A7| < |17|, node 2 performs a face change, records location(A) in the packet s Lf .eld (which records the point at which the packet .rst encountered a local min­imum), and then forwards the packet to node 3.
Relationship: contrasting
Domain: Networks
Sentence 1: Also, the GC is indicated as primarily responsible for pro­viding the GSA to group members.
Sentence 2: the actual establish­ment of a GSA is not addressed in [17], and will be part of a future IETF activity dedicated to the design of a generic key management scheme, preferably based on requirements and recommendations de.ned in [9][13][19].
Relationship: contrasting
Domain: Networks
Sentence 1: For instance, Sun recently announced a 3,456-port In.niBand switch built from 720 24-port In.niBand switches arranged in a 5-stage fat-tree [4].
Sentence 2: in.niBand imposes its own layer 1-4 protocols, making Ethernet/IP/TCP more attractive in certain settings especially as the price of 10Gbps Eth­ernet continues to drop.
Relationship: contrasting
Domain: Networks
Sentence 1: [2] shows that the myopic sensing policy has a sim­ple robust structure that reduces the channel selection to a round-robin procedure and obviate the need for knowing the accurate channel transition probabilities, which makes the myopic sensing policy more applicable.
Sentence 2: in the design of myopic sensing strategy, the in­teraction among secondary users is not taken into account when there are multiple SUs in the same network.
Relationship: contrasting
Domain: Networks
Sentence 1: Using these wireless interfaces, users enjoy a variety of real-time Internet protocol (IP)-based mobile multimedia services such as mobile voice over Internet protocol (VoIP) and mobile Internet protocol television (IPTV).
Sentence 2: as users are moving across heterogeneous wireless networks, such as between Wi-Fi and 3G, and between various Internet service provider (ISP) mobile networks, the real-time communication sessions usually 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 profit or commercial advantage and that copies bear this notice and the full citation on the first page.
Relationship: contrasting
Domain: Networks
Sentence 1: This is because longer EVCs can only be used by packets with larger hop-counts and will remain unutilized if the tra.c pattern has shorter distances to travel.
Sentence 2: by allocating more VCs to shorter paths, BW VA SA ST LT Body /tail flit BW SA ST LT Head Head Head flit flit  flit  Body /tail /tail flit flit  (a) Non-express pipeline (b) Express pipeline (c) Aggressive express pipeline Figure 5: EVC router pipelines (b) VCs acquired from nodes 01 to 56 Figure 6: Dynamic EVC network long-distance tra.c always has the option to switch to a combination of shorter EVCs if contention for longer EVCs is high.
Relationship: contrasting
Domain: Networks
Sentence 1: The Con.gu­ration Manager decides to load the con.guration based on FIR and AES during the experiment and save 7.77% and 22.07% of current consumption compared with the default con.guration and the one without acceleration, respectively.
Sentence 2: since the PIR event rarely occurs on node 1, the Con.guration Manager chooses AES and RS based con.gu­ration and has 10.22% and 11.42% savings compared to the default con.guration and software implementation, respec­tively.
Relationship: contrasting
Domain: Networks
Sentence 1: Thismeansthattheclientin ourpro­ TFRC 0.0% packet lossTCP 0.0% packet loss TFRC 0.50% packet lossTCP 0.50% packet loss TFRC 1.00% packet lossTCP 1.00% packet loss 50 50 40 40 30 30 20 20   Average interarrival delay (ms) Average interarrival delay (ms) Average interarrival delay (ms) 10 10 10  0 0 0 0 40 80 120 160 200 0 40 80 120 160 200 0 40 80 120 160 200 Round-trip time (ms) Round-trip time (ms) Round-trip time (ms) (a) 0% drop rate(b)0.5% drop rate(c)1.0% drop rate Figure 5: Average interarrival delay and variation with proxy-client loss totype does not receive all data, and some artifacts may be displayed.
Sentence 2: in case of live and interactive streaming scenarios,delaysdue to retransmission mayintro­duce dropped frames and delayed play out.
Relationship: contrasting
Domain: Networks
Sentence 1: CONCLUSIONS The delay in upgrading domestic telecommunications net­works and the shortage of skilled server maintenance person­nel are the likely background to the need to install even gov­ernment servers o.shore.
Sentence 2: o.shore servers not only reduce the speed of access to these servers from the pop­ulation within the country but also heighten the risk that domestic laws and regulations cannot be applied to network management for these servers.
Relationship: contrasting
Domain: Networks
Sentence 1: Randommigration( Rnd ).Ateachnode,amigrantran­domlypicksadirectionandtravelsonehop.With50%prob­ability,themigrantwilleitherejectintothelocalnodeandattempt tomigratetothecurrentnodeornot,atwhichpointitwillagainpickarandomdirectionandcontinueonitsway,althoughroutingislimitedtoone-turnpaths,toavoiddead­lock.
Sentence 2: theprimaryeffectofmigrationistoreducethenumberofmemoryaccesseswhichneedtoretrievedatafromoff-chip..rst 97Conversely,streamingapplicationswhichplacelittledemandoncachescouldturnoffL2cacheswhileusingallcores.
Relationship: contrasting
Domain: Networks
Sentence 1: RE w/ size detected RE detected RE hash shipping 32 0.31 0.27 0.41 0.22 0.03 64 0.28 0.26 0.38 0.29 0.19 128 0.23 0.22 0.31 0.27 0.22 Table3: Comparison ofeffective redundancy removalforREfactor and aSHAhash scheme each at the rate of 18Mbps.
Sentence 2: sHA hash based encod­ing is 8× slower(118Mbps);SHA1hash computationis a major performance bottleneck in this scheme.
Relationship: contrasting
Domain: Networks
Sentence 1: Integrating Secure Route Discovery with AODV In AODV [33], as well as other secure protocols based on AODV [6, 39, 45], Route Request (RREQ) packets do not carry a node list.
Sentence 2: in order to .lter excessive malicious RREQs, we require each RREQ to carry a node list.
Relationship: contrasting
Domain: Networks
Sentence 1: We show that a protocol designed to overcome the misinterpretation of collision-based losses and fading-based losses with out-of-range senders (the hidden terminal scenario) [18] is e.ective (i.e., high aggregate through­put and equal sharing) when the competing links are statis­tically equal in quality.
Sentence 2: we .nd that the protocol has a severe throughput sharing imbalance whenever even slight di.erences in average link quality exist between com­peting transmitters.1 We show that this is due to the slight di.erence in channel quality driving the system to a state in which only one transmitter uses the four-way handshake sig­ni.cantly more often, thereby giving it increased protection from hidden terminal collisions.
Relationship: contrasting
Domain: Networks
Sentence 1: Inwhatfollows,weshowtherelationshipbetweenthesig­nalingostandthenumberofellsinapagingarea.Most parametersusedinthisevaluationaresettotypialvalues foundintheliteratureforanalyzingellularsystems[14]: Rw 8 Rore 0.5 Rzoaz 0.5 dHA,FA 16(hops) dFA,FA i(hops) v 65(mph)i.e.28.9(m/s) p 200(useTs/km2)i.e.0.0002(useTs/m2) a 5%[6] Aa 3(1/hr)i.e.0.0008(1/se) Ad 3(1/hr)i.e.0.0008(1/se) Theaveragenumberofhopsbetweenforeignagents,dFA,FA, isdependentonthenetworktopologyofthepagingarea.
Sentence 2: forsimpliityweassumetheaveragenumberofhopstobe i.Thenumberandratioofhops,dHA,FA,Rore,Rzoaz, andRwweredeterminedexperimentallyusingtheInter­nettraeroutetooltoobtainanapproximatepitureofhop numbersandore/loalhopdistributionbetweenColumbia UniversityandotherUSuniversities.Typially,woreis greaterthanwzoaz,resultinginahopweightratio(Rw) greaterthan1.toauratelydeterminethehop weightratioisdiÆult.Here,wesetRwto8.Theim­patofdiferenthopweightratioRwonthesignalingost isdisussedlaterinthissetion.
Relationship: contrasting
Domain: Networks
Sentence 1: 7.2.1 Probing delay It is obvious that the higher the probability parameter p used to determine whether a path is probed or not in a given timestep, the more frequently network links will be probed and the shorter the amount of time between probes of that link (i.e., the link s probing delay).
Sentence 2: because a given link may appear on any number of the potential probing paths, depending on the underlying routing system, the exact relationship between probability and link probing delay is less clear.
Relationship: contrasting