sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: Note that when multiple RxRings are used, the smart Rx filtering scheme embedded in the high-speed adapter has to balance the traffic load among all the enabled RxRings with a suitable mechanism.
Sentence 2: to avoid out-of-order packet delivery, it must assign to the same RxRing all packets of a certain flow, while at same time equally distributing the traffic Fig.
Relationship: entailment
Domain: Networks
Sentence 1: In order to run the exper­iments on a network with a larger scale and a more realistic topology, we emulate a fat-tree topology built out of 45 6­port switches by slicing the switches of OCEAN.
Sentence 2: we deploy a simple home-grown virtualization layer, placed between LIME and the switches, that maps the data plane IDs and ports of the physical switches to the virtual switch IDs and ports of the virtual 6-port switches (more details can be found in [29]).
Relationship: entailment
Domain: Networks
Sentence 1: As pre­viously said, in the third set of the experiments the packet delivery ratio of OLSR and AODV decreases up to 66% and 60%, respectively.
Sentence 2: from the log .les we notice that packet losses occur during the relay swap phase (i.e., from 20 to 40sec), in which only half of the number of pack­ets generated by node A reaches the destination successfully.
Relationship: entailment
Domain: Networks
Sentence 1: Finally, we ran ad-hoc active measurements during the outage to some related pre.xes.
Sentence 2: we sent ICMP echo requests on1 February at 09:00:00 GMT from GARR (the Italian Research and Academic Network), the replies to which revealed that at least three IPv4 pre.xes, among those announced by EgStateAS and not withdrawn during the outage, were actually reachable.
Relationship: entailment
Domain: Networks
Sentence 1: 3.3 Integration of OAR with IEEE 802.11 via the Fragmentation Field The fragmentation mechanism de.ned as part of the IEEE 802.11 standard and mandated for implementation provides a simple and practical way for nodes to hold the channel for multiple packets when high data rates are mea­sured.
Sentence 2: as in RBAR, the receiver indicates the available physical-layer rate via the RTS/CTS messages.
Relationship: entailment
Domain: Networks
Sentence 1: for events P00xR01 and P00xR10 and their di.erences dur­ing e3 in Figures 16(a)-16(c).
Sentence 2: figures 16(a)­16(b) show thatgroup(i) exhibits a single mode at around 4 ms for the path queueing delays for both events P00xR01 and P00xR10.
Relationship: entailment
Domain: Networks
Sentence 1: We observe that in some cases (i.e., 10­20m/s, Figure 9) UPN Protocols complete their task even faster than DropTail, which explicitly owes to the UPNLB algorithm.
Sentence 2: dropTail guests get hooked to the .rst AP within range and stay attached to that speci.c one till they complete their task or lose connectivity.
Relationship: entailment
Domain: Networks
Sentence 1: That is, the mean number of arrivals between two consecutive visits to queue i, namely mi , must be smaller pi than the bulk service amount w. Assuming equation (45) to be an analytic function in the disk z : |z|=1+d implies that the numerator is zero when­ever the denominator vanishes in z : |z|=1+d.
Sentence 2: the numerator and the denominator of (45) have exactly the same number of roots in the above disk.
Relationship: entailment
Domain: Networks
Sentence 1: This could save processing power since we avoid to analyze all the packets belonging to the session, while at the same time we decrease the possibility that a random payload matches a signature and brings to a misclassi.cation.
Sentence 2: ta­ble 1 shows the mean and standard deviation of the number of classi.cation attempts executed over unclassi.ed sessions; the number of searches is extremely high especially in case of TCP sessions, which are usually longer than UDP ones.
Relationship: entailment
Domain: Networks
Sentence 1: .p .p Each MLLS contains all the paths u ..v (u ..v .Puv) between an ingress E-ER u and egress E-ER v pair in the domain D. Also, each MLLS includes multiple levels and each level records a .p list of elements.
Sentence 2: each element indicates a path u ..v. MLLSuv(i, j) indicates ith path from E-ER u to E-ER v that locates on the jth level.
Relationship: entailment
Domain: Networks
Sentence 1: At each node, impedance tuning is done to minimize reflection As a result, when the T/R switch is on, the node absorbs 50% of the energy propagated thus far.
Sentence 2: after 6 draining nodes, the signal energy in the transmission line is reduced to about 1%oftheoriginalsignal,nolongerasignifican sourcenoise.
Relationship: entailment
Domain: Networks
Sentence 1: Figure 3: Correlation coe.cient r for di.erent Re­quest Window Size Assuming that a typical application needs 90% data accu­racy (r=.90) the Figure 3 states that almost 81% requests on average can be answered in a compressed fashion.
Sentence 2: they all pass the CORRELATED as described in section 3.2.
Relationship: entailment
Domain: Networks
Sentence 1: When we use the term architecture, we are focusing on the waist of the Internet hourglass (or any future equivalent of the current waist) - that set of fundamental assumptions and agreements that binds all the participants.
Sentence 2: our focus is that of the current Internet Protocol (and future possible replacements) as well as the concept of layering that comes with any choice of waist.
Relationship: entailment
Domain: Networks
Sentence 1: Figure 9 shows the relationship between the sum of each individual RNP in each direction, and the actual RNP cost for all links when sending the acknowledgment immedi­ately.
Sentence 2: we could observe from Figure 9(b) that the sum of one-way RNPs is quite correlated with the actual link cost, with stronger correlation for smaller RNP values.
Relationship: entailment
Domain: Networks
Sentence 1: T [dB] 0 4 8 10 13 15 0.17* 0.11* 0.07* 0.052 0.034 0.026 popt are stationary.
Sentence 2: we depart the somewhat un­realistic assumption of exponentially distributed and hence unbounded transmission powers, and assume instead that all nodes employ some common, constant transmission power: Pk = P .
Relationship: entailment
Domain: Networks
Sentence 1: RELATED WORKS Even though the application of risk evaluation methods has been widely discussed and analysed, see, e.g., [1, 6, 14], among infor­mation security experts there appears to be no agreement regarding the most appropriate method to assess the probability of computer .. ..incidents[20].Inliteraturetherearemanyattemptstofacetherisk assessment problem; some of them de.ne systematic approaches while others provide more ad-hoc methods to evaluate the likeli­ hood of (a class of) violations.
Sentence 2: we have found of interest Baskerville s description [3] of the evolution of various ad­hoc methods that sometimes could be combined to improve the ac­ curacy of the security evaluation.
Relationship: entailment
Domain: Networks
Sentence 1: This is true of .ood predic­tion and, although the evidence [6, 7, 33, 36, 37, 38] here is sparse, we can see mature applications in other areas.
Sentence 2: statistical models have proven among the best in forecasting hurricane intensity (which presents similar chal­lenges to .ood forecasting) [12] and are used for guidance in operational cyclone forecasting [24].
Relationship: entailment
Domain: Networks
Sentence 1: This paper differs from such studies in that we study the impact of CSMA/CA based MAC protocols with consistent and inconsis­tent channel state on the performance of the utility-maximization congestion control schemes.
Sentence 2: we explore the impact of the wireless channel, unknown data transmission capacity, un­known service order and unknown and incorrect system state on the performance of congestion control algorithm in environments with and without collaboration.
Relationship: entailment
Domain: Networks
Sentence 1: Extensive simulation based on the ns-2 has shown MASA to offer as much as 25% higher packet delivery rate and 27% higher throughput than the DCF with the CBR (constant bit rate) and TCP traffic, respectively.
Sentence 2: a significant reduction in packet delay, 86% and 70% lower packet delay with the CBR and TCP traffic, makes MASA suitable for delay-sensitive applications.
Relationship: entailment
Domain: Networks
Sentence 1: Note that, in the case of dishonest majority, adaptively se­cure MPC does not imply adaptively secure broadcast be­cause the usual notions of security for MPC do not guaran­tee output delivery or fairness (see [10] for a more extensive treatment) these properties are, in general, not achiev­able [8] whereas de.nitions of security for broadcast do require guaranteed output delivery.
Sentence 2: the Hirt-Zikas impossibility result for adaptively secure broadcast in the non-atomic communication model says nothing about the feasibility of adaptively secure MPC in that setting.
Relationship: entailment
Domain: Networks
Sentence 1: In our measurement, we focus on the download throughput of web contents replicated by CDN providers.
Sentence 2: we identifyalist of contentproviders usingAkamai andLimelight and randomly select a subset of them to retrieve their web contents.AsdescribedinSectionII, aCDNprovidertypically assigns one of the replicated servers to a web client when responding to a DNS lookup.
Relationship: entailment
Domain: Networks
Sentence 1: The reason for this is that the value of max max ep /ep for TCP is smaller than that of IEEE 802.11 (ep /ep is 1.22 for HTTP over TCP with ed = 2272 bytes).
Sentence 2: we do not .nd any strong e.ect of RPSP for wireless networks with heavily correlated bit-errors and ed=1460 bytes, which is commonly used as MSS (Maximum Segment Size) in TCP [1].
Relationship: entailment
Domain: Networks
Sentence 1: The   scenario mean migration intensity synthetic trace(DFS-500) 1.41± 1.61 synthetic trace(SLF)  2.13± 3.38 DNet range 100 3.20± 3.26 DNet range 500 4.38± 4.14 DNet SLF 2.16± 2.81 DNet range 500 with APs 20.88± 14.24 DNet SLF with APs 13.64± 9.30 CabSpotting 24 nodes 4.33± 4.99 Table 4: Migration intensity for various scenarios key quantity we look at when checking suitability is the mi­gration intensity.
Sentence 2: the rate at which the system will need to migrate virtual machines in order to run the trace.
Relationship: entailment
Domain: Networks
Sentence 1: At the end of superphase .a+f, q is in region Xj+f, that is, q is located in a segment with index at least (j + f)m - 1.
Sentence 2: since q can cross at most 2 segment boundaries during superphase .a+f, it follows that, at the beginning of superphase .a+f (or, equivalently, at the end of superphase .a+f-1) q is located in a segment with index at least (j + f)m - 3 = (j + f-1)m. this means that q is located in region Xj+f-1 at the end of superphase .a+f-1.
Relationship: entailment
Domain: Networks
Sentence 1: The reason we do this instead of obtaining a simple mean of Wmax values is because throughput is related to Wf quadratically (since it is the area under the curve in the 25 25  to the sender.
Sentence 2: this duration can be approx­ imated by the average link delay with a full bu.er, T + 20  20  B/µ =tR.
Relationship: entailment
Domain: Networks
Sentence 1: That is, a flow i agrees to be compensated upto the threshold, beyond which the network does not try to address the errors.
Sentence 2: cS-WFQ is defined as a STFQ based system as described in (9) where the fair shares {¢i}i~ are time varying and defined as of redundancy, while a negative ACK should lead to increas- ing the FEC code rate, provided that the estimated value ¢i if Ci(t) > C th Ci(t) C/(1 + a(t)) remains above the threshold C{~h ¢~(t) =/i(t)¢~ = (10) ¢i otherwise.
Relationship: entailment
Domain: Networks
Sentence 1: For example, in security-critical environments (e.g., in a .­nancial institution), it is required that packets traverse certain checkpoints, for instance, an access control func­tion (implemented by e.g., a middlebox [12], an SDN match-action switch [7], or an NFV function [3]), before entering a protected network domain.
Sentence 2: in order to prevent a bad packet from entering a protected domain, not only the old policy p1 as well as the new policy p2 must ensure WPE, but also any other transient con.guration or policy combination that may arise dur­ing the network update.
Relationship: entailment
Domain: Networks
Sentence 1: Let us note that traditional multimedia applications developed for the fixed Internet assume that only sporadic packet losses occur, i.e., only during network congestion/failure, and do not consider the possibility to change the communication channel during streaming provisioning.
Sentence 2: frequent and potentially long packet losses can cause client side re-buffering, which results in possible playback discontinuities, while connectivity change imposes service re­start.
Relationship: entailment
Domain: Networks
Sentence 1: Within category (2), Collaborative Streaming among Mobiles (COSMOS) [9] is based on the idea that a node will rebroadcast a packet if a large portion of its neighbors have not received that packet.
Sentence 2: a node calculates the ratio of the number of its neighbors that will benefit from its rebroadcast of a packet versus the total number of its neighbors.
Relationship: entailment
Domain: Networks
Sentence 1: The main di.erence between this extended counting algo­rithm and its more basic counterpart is that having disjunc­tions of .lters allows us to use the set of matched interfaces to shortcut the evaluation of the .lters.
Sentence 2: we can eliminate a lookup in the table of counters for all the .lters linked to an interface that has already been matched.
Relationship: entailment
Domain: Networks
Sentence 1: This path P need not be time-out free in itself, because all of its nodes will be suf.ciently far away from x, and hence not time out during the interval [s ' ,t ' ).
Sentence 2: we can sim­ply invoke Theorem 2.1 for the existence of the path once we have ensured that the interval [s ' ,t ' )is long enough.
Relationship: entailment
Domain: Networks
Sentence 1: For example, if the ini­tiator is using a path of two pawns, it will select the .rst pawn group G1 and then select a second pawn group G2 without replacement.
Sentence 2: we are careful not to select G2 = so to ensure that the same key could not be G1 used to open both layers of encryption and see the message.
Relationship: entailment
Domain: Networks
Sentence 1: Each WLAN may be configured as ad hoc or AP-based, but in either case no control is exerted over the stations by any admin­istrative entity.
Sentence 2: no multi-WLAN mechanism relies on, or attempts to trace, the stations' identities--the stations are as good as anonymous (this assumption strengthens the model and makes it insensitive to spoofing or Sybil attacks [4]).
Relationship: entailment
Domain: Networks
Sentence 1: Using these two estimates, we propose a hybrid system that attains the increased stability region of the universal swarm, while also ensuring that the so journ times remain small for a wide range values of L. The hybrid system alter­nates between the autonomous mode, whereby swarms op­erate in isolation while sharing a U/L portion of the seed s capacity, and the universal mode, where swarms are bundled together.
Sentence 2: consider a system with L swarms, each requesting a .le of k = K/L pieces.
Relationship: entailment
Domain: Networks
Sentence 1: CSMA/CA (collision avoidance) mechanism is incorporated in DCF -a similar mechanism is also used in the proposed protocol.
Sentence 2: when a node i wishes to transmit a packet, it chooses a "backoff" interval equal to Bi slots3 Bi is cho- sen uniformly distributed in the interval [0, cw], where cw is size of the so-called contention window, cw at node i is reset to a value CWmi, at the beginning of time, and after each successful transmission of a data packet by node i.
Relationship: entailment
Domain: Networks
Sentence 1: It allows us to characterize (either directly or with suitable bounds) the average throughput in a ro­bust manner, because the throughput characteristics depend on the tra.c only through the average tra.c load on each route.
Sentence 2: no additional information is required about the tra.c to account for the .ow-level QoS require­ments than what is already necessary for basic dimensioning.
Relationship: entailment
Domain: Networks
Sentence 1: Here, we develop a simple, yet illustrative model of TCP through­put under such a scenario.
Sentence 2: we consider a counter-DoS 012345 50 100 150 200 250 300 350 400 450 Peak Rate (Mb/s) Peak Length (ms) Figure 16: Detecting DoS streams strategy in which TCP senders randomize their minRTO parameters according to a uniform distribution in the range [a,b].
Relationship: entailment
Domain: Networks
Sentence 1: Q |gi|2N0pi +(|hi|2pR+ N0) ·|gj |2pj + N0 j=1,j =i (2) In general, the utility function is increasing and concave in the receive SINR [6].
Sentence 2: we adopt in the sequel the 2This assumption is imposed only for the convenience of notation, as in [15], and can be relaxed without a.ecting the analysis in this paper.
Relationship: entailment
Domain: Networks
Sentence 1: Rdenotes the radius of graph Gwith respect to s,which is equivalent to the height of the BFS tree.
Sentence 2: then, an MIS U is formed induced by a non-decreasing order of depth of nodes in TBF S. the nodes are considered for inclusion in U based Layer i - 1 Layer i Layer i +1 Figure 4: Scheduling broadcast in layer i on a non-decreasing order of depth in the BFS tree.
Relationship: entailment
Domain: Networks
Sentence 1: Clearly, obtaining dij for all n nodes requires O(n2) measurements.3 However, we note that these O(n2) measurements do not have to be announced or be con­tinuously monitored.
Sentence 2: each node needs to monitor and send updates only for the k links that it chooses to establish, with O(n) measurements to all nodes in the overlaydone muchless frequently namely once per wiring epoch, which is de.ned as the period T between two successive evaluations by a node of its set of candidate links andpossible adoption of a new wiring(i.e., re-wiring) based on such evaluation.
Relationship: entailment
Domain: Networks
Sentence 1: Hence, it is even more unlikely that the shape of the potential surface changes faster than it takes for a packet (containing queue length information) to traverse a sub-domain (on an average).
Sentence 2: it is very improbable that the traf.c potential .eld computed using (possibly stale) queue length informa­tion at a node would be signi.cantly different from the .eld computed with the latest queue length information.
Relationship: entailment
Domain: Networks
Sentence 1: For di.erent experiments we used a variety of hardware to simultaneously connect multiple interfaces to the same or di.erent operator s networks.
Sentence 2: we used three PCMCIA Sierra Wireless cards with 4+1 slots (4 downlink GSM slots, and 1 uplink), and two Motorola Phones (Motorola T260 Phone, 3+1 handset) that were connected through serial-line interfaces to the router.
Relationship: entailment
Domain: Networks
Sentence 1: (23) d · µ · (µ - 2d · <(r)) 6.1.3 Simpli.ed Aloha approximation For simplicity let us next assume a basic Aloha MAC with .xed size packets and without any collision avoidance mechanisms.
Sentence 2: each station tries to send a packet after an exponen­tially distributed interval and a packet is succesfully transmitted if no other transmission overlaps with the given transmission within the corresponding proximity.
Relationship: entailment
Domain: Networks
Sentence 1: A potential issue with this result is that while we show that the malicious users have to pay enough to signi.cantly o.set the damage they cause, it is nevertheless true that In any such game, Lben Lopt > 34 , and this bound is tight, in their payments go to the network operators, and not directly that for all E su.ciently small, there is always a game to the victims of the attack.
Sentence 2: this distinction might not Lben with Lopt = 34 + E.for all n> 1,there always be signi.cant for instance, in the simple case of is always a game Benignopt with n benign players for n Lben 3n-4 which = .
Relationship: entailment
Domain: Networks
Sentence 1: Therefore, the handoff only involves network prefix BUs to MAP­HMR s HA and all HAs of HMRs in this nested mobile network.
Sentence 2: the moved MAP­HMR will send network prefix BUs to it s HA as well as all HAs in the CN­Table to update the binding of its network prefix to the new LCoA.
Relationship: entailment
Domain: Networks
Sentence 1: Let optG denote the value of an optimal solution over pure strategies assuming that all the injection rates ri are increased by a factor of G. Then, the bicriteria ratio R is de.ned to be the smallest G satisfying C = optG over all Nash equilibria.
Sentence 2: the bicriteria ratio describes how many times the injected rates (the amount of traf.c in the system) must be decreased so that the worst-case cost in Nash equilibrium cannot exceed the optimal cost for the original rates.
Relationship: entailment
Domain: Networks
Sentence 1: INFORMATION SHARING IN IEEE 802.11 In this section, after brie.y reviewing the IEEE 802.11 Distributed Coordination Function (DCF) protocol (see [7] for further details), we study the role of information sharing in the protocol s ability to provide a FIFO-like service.
Sentence 2: we present two topologies in which IEEE 802.11 obtains severe performance degradations, in one case due to asymmetry of information, and in the latter, due to per­ceived collisions .
Relationship: entailment
Domain: Networks
Sentence 1: Session Level Techniques for Improving Web Browsing Performance on Wireless Links Pablo Rodriguez Sarit Mukherjee Sampath Rangarajan Microsoft Research Bell Laboratories Bell Laboratories Cambridge, UK Holmdel, NJ Holmdel, NJ pablo@microsoft.com sarit@bell-labs.com sampath@bell-labs.com ABSTRACT Recent observations through experiments that we have performed in current third generation wireless networks have revealed that the achieved throughput over wireless links varies widely depending on the application.
Sentence 2: the throughput achieved by .le trans­fer application (FTP) and web browsing application (HTTP) are quite different.
Relationship: entailment
Domain: Networks
Sentence 1: Oceanographic parameters were sampled us­inga thermistor chain and an acoustic Doppler current pro.ler, both located close to the VA.
Sentence 2: the thermistor chain was de­signed for .ner sampling in the mixed layer (i.e., at low depth) rather than in the lower layers, in order to better track temperature changes between 10 and 40m of depth.
Relationship: entailment
Domain: Networks
Sentence 1: The aim of the two networks are di.erent in that 7DS has as its primary goal providing data connectivity to mobile hosts while PeopleNet aims to provide a mechanism for infor­mation search and access through a wireless virtual social network.
Sentence 2: 7DS provides access to existing electronic resources while PeopleNet taps into both existing electronic resources and virtual resources residing in peo­ple themselves.
Relationship: entailment
Domain: Networks
Sentence 1: Unlike Wi-Fi, WiMAX shares the channel bandwidth equally among the  GPRS Protocol 1997 Date 0.8 Table 3: 3GPP standards Data rate (Mbps) Frequency (MHz) EDGE 2003 0.15 UMTS 2005 2 850 /900 /1700 /1900 /2100 HDSPA 2007 7.2 LTE 2010 > 100  Figure 2: UMTS simulation framework Throughput (Mbps) 25 20 15 10 5 0  Number of User Equipments Ciclix Prefix Figure 3: Wi-Fi maximum experimental throughput Figure 4: WiMAX maximum experimental through­put varying modulation and cyclix pre.x nodes due to its multiplexing feature.
Sentence 2: we .nd that everyWiMAX node receives the same bandwidth share.
Relationship: entailment
Domain: Networks
Sentence 1: Tolerances in these components give rise to identi.able characteristics in the waveform and modulation errors.
Sentence 2: prior workhas examinedstartup transientsin the waveform, carrier frequency o.set, in-phase and quadrature (I/Q)o.sets, preamble modulation quality, and quadrature phase-shiftkeying(QPSK) modulation errors.
Relationship: entailment