sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: The main idea used in [6] is to use some intermediate node to serve as ferry node: this node will carry the data from the source node and move around and it will dump the data to the tar­get node when it is within its communication range.
Sentence 2: essentially, the result presented in [6] still obey the capacity bound proposed in [7]: the capacity is improved because the average dis­tance L a packet has to be transmitted is reduced from T(1) in [7] to T(r(n)) in [6].
Relationship: entailment
Domain: Networks
Sentence 1: Ourgoal wasto utilizethe already ex­isting body of monitoring software(i.e., existing linuxpack­ages) to the fullest extent possible so as not to reinvent the wheel and to be able to easily keep up with changes.
Sentence 2: we used existing SNMP software to collect infor­mation about nodes in the network and the activity on their links.
Relationship: entailment
Domain: Networks
Sentence 1: EXPERIMENTAL METHODOLODY  4.1 Polymorphism via Encryption Schemes For polymorphic worms that scan expeditiously, we will initially assume in our experiments that each infective will either cycle through a fixed and relatively small number of completely different malware cipher images pre-computed with a different kind of encryption for each, or a different malware cipher per scan (e.g., using a key dependent on the destination address); but for this latter case, common decryption code in plain text will be present (and prevalent ) in all payloads (in addition to the explicit code, of course [2]).
Sentence 2: we assume that in one of these two ways content will be prevalent in the worm s packet­payloads.
Relationship: entailment
Domain: Networks
Sentence 1: No matter which sources they come from, packets routed through i are randomly divided among the downstream links with probabilities proportional to the link rates ri,j , j .
Sentence 2: di.When i forwards a packet, it sends the packet to a downstream node j with a probability of ri,j .For any .ow s that ri passes i, the fraction of packets sent to j is the same, ri,j .ri ri,j (s) ri,j = ri(s) ri (9) ri,j ri,j (s)=ri(s)× ri Fi,j can be calculated as follows.
Relationship: entailment
Domain: Networks
Sentence 1: We observe that for h < 4 where no hidden terminals are present, TCP NewReno achieves slightly higher goodput than TCP-GAP.
Sentence 2: the bursty transmission of TCP NewReno gains a slight advantage over the adaptive pacing of TCP-GAP, since the IEEE 802.11 MAC scheduling prevents packet losses caused by hidden terminals for less than four hops.
Relationship: entailment
Domain: Networks
Sentence 1: Waskiewicz [10] was included in the 2.6.24 kernel), the general SR SW configuration requires a deeper discussion.
Sentence 2: the main objectives of a SR architecture optimized for a multi-CPU/core environment can be summarized by the following : to entirely bind all operations carried out in forwarding a packet to a single CPU (minimizing cache invalidations),  to reduce LLTX lock contention as much as possible,  to equally distribute the computational load among all the processors/cores in the system.
Relationship: entailment
Domain: Networks
Sentence 1: In the BikeNet implementation, we have experimented with han­dling queries to the SAP, originating both from the back end and from a BAN in radio range, for ground truth data.
Sentence 2: using a cellular phone as a mobile SAP, we have 1While related in principle, this notion of ground truth sensing should not be confused with sensing for experimental validation and debug (e.g., using the quad capture video helmet in Figure 4(e)).
Relationship: entailment
Domain: Networks
Sentence 1: In Monte Carlo algorithms, algorithm execution is accomplished ef.ciently but with probabilistic deviations.
Sentence 2: the proposed al­gorithm/protocol class is a special class of Monte Carlo algorithm ending in polynomial-time (polynomial-step or polynomial-stop in this paper) and with negligible deviation E(x) from the ideal case (as de.ned by a Las Vegas algorithm).
Relationship: entailment
Domain: Networks
Sentence 1: Note that there should be only one player choosing to secure for a Nash equilibrium to be reached as soon as at least two players decide to protect, each will defect in the next round hoping to free-ride on the other protecting play­ers.
Sentence 2: if there exists a unique i for which the initial constellation of protection levels satis.es max{e-i(0)} < 1 - bi/piLi , (14) then a Nash equilibrium where all players free-ride on player i is reached as long as bi <ci.This situation could happen when only one playerfaces disproportionate losses comparedto other players, or her security costs are very small.
Relationship: entailment
Domain: Networks
Sentence 1: ARCHITECTURE OF THE SOFTWARE PLATFORM (EVOM) In this section we describe the main blocs of the proposed experimental evaluation platform (EVOM) of packetized voice over multi-hop wireless networks.
Sentence 2: the generated bitstream by end application is processed by the RTP sender agent which frames encoded data with respect to RFC specification and adds the necessary header content such as payload type, source synchronisation, packet length, sequence number, timestamp, etc.
Relationship: entailment
Domain: Networks
Sentence 1: SBA=NPA TTRT=min(Di) for BuST and FDDI-M TTRT=min(Di)/2 for FDDI 100% 90%  FF DDI DDI-M B uST     MAXIMUM DEADLINE MISS RATIO TTRT .
Sentence 2: the WCAU can get close to 1 (0.5 for FDDI) when a is negligible.
Relationship: entailment
Domain: Networks
Sentence 1: Since most current collision detector implementations can occasionally miss a collision, we also consider two ways of weakening the assumption of completeness.
Sentence 2: we consider: (1) a majority complete collision detector that only detects a collision if a majority of messages in a round is lost, and (2) a 0-complete collision detector that only detects a collision if every message in a round is lost.
Relationship: entailment
Domain: Networks
Sentence 1: Ahn, Bortz and Hopper [5] de­.ned it as the property that an adversary was able to learn something about the sender or the recipient of a particular message, but could not narrow down its search to a set of less than k participants.
Sentence 2: k-anonymity guar­antees that the adversary is not able to guess the sender or the recipient of a particular message with a probability non­negligibly greater than 1/k.
Relationship: entailment
Domain: Networks
Sentence 1: Now, the probability that a transmission by one of the n - i yet to be discovered nodes is successful is given by: -2(n-i)..i ps(i)= e =1/e Now, the successful transmission events from the n - i yet to be discovered nodes follow a Poisson process with a rate givenby(n-i).ips(i)=1/2.e.
Sentence 2: the random variables Wi areiid and exponentiallydistributed with mean 2.e.
Relationship: entailment
Domain: Networks
Sentence 1: As a matter of fact, making transmissions a function of vehicular mobility presents new challenges to the simulation granularity of traffic simulators.
Sentence 2: since vehicular dynamics affect STE, which has an impact on the transmission rate of BSMs, we need a traffic simulator that can model the movement of vehicles in a X j Mean 0.125 0.25 0.5 1 Variance 0.25 0.5 1 2 Simulat ion ]E[rj 5.46 5.35 5.12 4.65 Var[rj ] 2.7e-3 5.5e-3 1.1e-2 2.1e-2 ]Var[rC 1.1e+2 2.2e+2 4.3e+2 8.5e+2 Theory E[rj ] 5.47 5.35 5.12 4.65 Var[rj ] 2.7e-3 5.5e-3 1.1e-2 2.2e-2 ]Var[rC 1.1e+2 2.2e+2 4.4e+2 8.8e+2 Table.1.
Relationship: entailment
Domain: Networks
Sentence 1: Our initial operational experience shows that the tool is effective in both automating VLAN operations, and identify­ing con.guration errors.
Sentence 2: we found that (i) more than 40% of the VLANs in the network have redundant links that leads to security and performance problems; (ii) more than 30% of the VLANs have missing links which result in connectivity issues; and (iii) the root-bridge placements of more than 30% of the VLANs  H1H2 H3H4 H5H6 H7H8 VLAN 1 VLAN 2 VLAN 1 VLAN 2 VLAN 1 VLAN 1 VLAN 2 VLAN 2 Figure 1: A sample enterprise VLAN setup are not optimum, which again results in performance problems.
Relationship: entailment
Domain: Networks
Sentence 1: Consider a periodic DoS at­tack with period T. If the outage duration l ' ?RTTiand minRTO > SRTTi+4*RTTVARifor i=,,kwhereas l 'RTTTor minRTO :SRTTT+4*RTTVARTfor j=k+,,n, then Equation (2) holds for .ows ,,k. This result, shown similarly to that above, states that Equation (2) holds for any TCP sub-aggregate for which conditions (C1) and (C2) hold.
Sentence 2: if a shrew DoS attack is launched on a group of .ows such that only a subset satis.es the two conditions, that subset will obtain degraded throughput according to Equation (2), whereas the remaining .ows will not.
Relationship: entailment
Domain: Networks
Sentence 1: The maximum value of S(xl) occurs when these exists a value l0 such that for each l = l0, xl is the maximum allowed under constraint 2, and for each l> l0, xl =0.
Sentence 2: x1 = C(ß) * S(bi), x2 =(C(2 * ß)) - C(ß)) * S(bi), x3 =(C(3 * ß) - C(2 * ß)) * S(bi), andingeneral xi = (C(i * ß) - C((i - 1) * ß)) * S(bi).
Relationship: entailment
Domain: Networks
Sentence 1: After connecting to A, N can perform the tasks described by the IEEE 802.11iprotocol to complete a mutual authentication with the net­work and establish a security association withthe entityto whichit isphysicallyconnected(phase1).
Sentence 2: duringthisphase N performs allthe activities as ageneric wireless clientto establish a secure channel with a mesh router(node A in our example) that canforwardits traf.c securely over the wirelessbackbone.
Relationship: entailment
Domain: Networks
Sentence 1: Let N and M denote the number of correctly received data and protection packets, respectively, where N = N and M = M. To be able to decode the entire block of informa­tion (N), the destination needs to correctly receive at least N data and/or protection packets, where N = N + M; oth­ erwise only N information packets can be recovered.
Sentence 2: the useful information is given by:  N N = N + M I =(3) N o.w.
Relationship: entailment
Domain: Networks
Sentence 1: More speci.cally, for a real-time .ow i, Te = Tc = Limax.
Sentence 2: be is con.gured in such a way that the maximum burst size does not exceed Ri ×Te.= Ri ×Te max Bc +Be max which implies that Be = EIR × Te =(Ri - Rmini ) × max Te.
Relationship: entailment
Domain: Networks
Sentence 1: Let B(s, d) be the number of common available wave­lengths along all predetermined routing paths between source node s and destination node d. When a light­path is released, let M denote the number of common available wavelengths in the network.
Sentence 2: common available wavelength between the source-destination pair can be found after the rerouting procedure and no com­mon available wavelength exists before the algorithm.
Relationship: entailment
Domain: Networks
Sentence 1: (45) zw -M i(z)(1 -pi)zw + piNow, Q i(1) = 1implies w-1 L (j) mi vi = w - , (46) pi j=0 which is meaningful if and only if mi <w (or equivalently pi ti <pi).
Sentence 2: 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.
Relationship: entailment
Domain: Networks
Sentence 1: Path classification is performed by the Path Quality Estimation Block, as a function of (i) the average delay and of (ii) the average packet loss rate (PLR) experimented on each path.
Sentence 2: we assume each node i, continuously monitors:  Average queuing delay (qJ): it measures the mean time elapsed between the instant a data packet is enqueued at the MAC Layer and the instant the packet is dequeued because it is ready to be transmitted;  Average MAC access delay (dJ): it measures the mean time that elapses between the first attempt of a data packet transmission at the MAC Layer and the reception at the MAC Layer of the corresponding ACK packet.
Relationship: entailment
Domain: Networks
Sentence 1: The key technique that allows us to break the capacity barrier imposed by the protocol model is to employ an in­volved, non-intuitive power level assignment at the nodes.
Sentence 2: we make use of the fact that the wireless medium can be overloaded (see Figure 1 in Section 2) in the sense that links of di.erent order of length can be scheduled in parallel by scaling up the transmission power of short links [22].
Relationship: entailment
Domain: Networks
Sentence 1: Let C1, C2, C3, and C4 be four cells which lie within the interference region of each other.
Sentence 2: {C1, C2, C3} E I N (C4), {C2, C3, C4} E I N (C1), {C3, C4, C1} E I N (C2), and {C4, C1, C2} E I N (C3).
Relationship: entailment
Domain: Networks
Sentence 1: Choosinga particular optionimpacts bothfairness andthe total rate.Infact,inanywireless network, thereisalwaysatension between maximizing transferrate and ensuringfairnessbecause the best option in terms of rate would always transmit to the client with the best channel and starve the others.Thus,wewant tolook atthe performance in terms of bothfairness and rate maximization.
Sentence 2: we compare 802.11-MIMO against three algorithms for picking concurrent clients.
Relationship: entailment
Domain: Networks
Sentence 1: However, the limitation of this method is that C-PNSS only considers situation in which the sensing range r is equal to communi­cation range R. As shown in .gure 2, node A, which is in the center, is fully covered by nodes B, C, D and E. Unfor­tunately, such a case is ignored by the central angle method mentioned in the C-PNSS because nodes C, D and E will not be considered neighbors.
Sentence 2: because node Awill not be o.-duty but will instead be considered an edge node, holes can emerge in the intersections among A, C, D and E when C, D and E are out of energy.
Relationship: entailment
Domain: Networks
Sentence 1: SWIFT instead uses a technique we call adaptive sensing, which closes the loop by taking advantage of the observation that many narrowband devices react in some perceivable way if wideband transmissions disrupt their transmissions.
Sentence 2: a large class of narrowband tech­nologies in the unlicensed spectrum reacts to interference, either at lower layers (e.g., carrier-sense and autorate) or higher layers (e.g., TCP or end-user backoff).
Relationship: entailment
Domain: Networks
Sentence 1: SPEEDING UP A DIFFUSION PROCESS In this section, we analyze the impact of the network dynamics and the adoption of centrality walks on the di.usion process in dynamic complex networks.
Sentence 2: in order to compare the performance of the di.usion algorithms, we de.ne .t as the ratio of reachable nodes at snapshot Gt: P rt(u) .u.Vt .t = , (4) |Vt| where rt(u)is the total number of nodes reachable from node u over snapshot Gt.to avoid a bias on only considering the result for the best positioned node for di.usion, we take the conservative approach of considering the average case scenario for all nodes in the network.
Relationship: entailment
Domain: Networks
Sentence 1: Inorder to covera wide range of failure scenarios, we expand the distribution space of all pa­rameters (the 6s tolerance windows) beyond their tolerable variation margins given by the process.
Sentence 2: in Nominal Parameter Figure 4: The distribution of circuit level and block level parameters used in Monte Carlo simulations order to inject faults, we generate a wider distribution space for all parameters and randomly sample from this space.
Relationship: entailment
Domain: Networks
Sentence 1: 5 /m2 energy model a 4 ß1 45×10-9 J/bit ß2 10-15 J/bit/m4 ß3 135×10-9 J/bit  5.2 Comparison with Other Algorithms We compare the proposed algorithms with two other algorithms: (i) Optimal lists: the transmission range lists are obtained by enumerating all available lists and selecting the lists with maximal lifetime; (ii) Maximal range: the algorithm is presented by [1], in which all nodes in each corona have the same transmission range of the maximal transmission radius and all sensors whose distance to the sink is less than the maximal transmission radius should transmit data directly to the sink.
Sentence 2: parameters related to CETT are as follows: MAXCOUNT = 200, TIMERANGE = 0.5.
Relationship: entailment
Domain: Networks
Sentence 1: In retro­spect, one might have predicted that .ghts over trademarks would be a tussle space, and made sure that the names that expressed trademarks were used for as little else as possible.
Sentence 2: one might imagine separate strategies to deal with the issues of trademark, naming mailbox services, and providing names for machines that are independent of loca­tion (the original and minimal purpose of the DNS).
Relationship: entailment
Domain: Networks
Sentence 1: We model this as an assignment problem that is tailored for the typical star­topology TDMA transmission of WBSNs, but it can be also (n) adapted to a contention access protocol (in fact, the .tx s can be statistically determined as the average amount of time a node can successfully transmit per second, as shown in [19] for the CSMA/CA).
Sentence 2: the MAC protocol has to .nd a number k(n) for each node n such that:  (n)(n)(n)(n) .tx = k· d = Ttx fout +O f,.mac , (1) out where Ttx(·) denotes the transmission time required to send the speci.ed amount of data, and depends on the physical radio.
Relationship: entailment
Domain: Networks
Sentence 1: MV-MAX deviates from traditional opportunistic scheduling because scheduling media access for cellular users is di.erent from scheduling media access for ve­hicles that occasionally pass roadside access points.
Sentence 2: cellular users expect to be connected all the time, thus the scheduler does not have the .exibility to temporarily restrict access to a user, even if the user is currently experiencing poor signal quality and servicing the user would signi.cantly degrade the performance of the entire system.
Relationship: entailment
Domain: Networks
Sentence 1: Thus, because Equation (2) assumes that RTO = minRTO for T>minRTO, while this is not the case in the period (minRTO,minRTO +2RTT), Equation (2) behaves as an upper bound in practice.
Sentence 2: periodic DoS streams are not ' 3The relationship between land lis explored in Section 4.
Relationship: entailment
Domain: Networks
Sentence 1: In other words, the improvement of the packet reception prob­ability is achieved at a huge cost of the number of packet transmissions and it is not clear if such an improvement in worthy at the application level.
Sentence 2: for position­ing tracking algorithm, which is one of the key elements to support safety applications, the accuracy relies very much on the number of GPS coordinate updates one can receive from neighboring vehicles.
Relationship: entailment
Domain: Networks
Sentence 1: That is, once the authoritative node for a partic­ular global state is found by DHT, a client node keeps the connec­tion to the authoritative node in order to receive latest updates di­rectly and to request modi.cation of the data.
Sentence 2: zon­ing layer con.nes the update request and noti.cation within single zone, and zoning layer depends on DHT layer for data storage and rendezvous.
Relationship: entailment
Domain: Networks
Sentence 1: The impact of each single parameter on performance of the sensor network, has been analyzed in several previous papers [5][6][7][9][11].
Sentence 2: the authors of [11] have shown, through analysis and simulations, that in a star topology the pack­et delivery probability provided by the 802.15.4 CSMA/CA algo­rithm increases monotonically with the values of macMinBE, macMaxCSMABackoffs, and macMaxFrameRetries.
Relationship: entailment
Domain: Networks
Sentence 1: Session Initiation Protocol Improvement Using Inter-Asterisk eXchange Octavio J. Salcedo Parra Neil Orlando Diaz Martinez Gustavo López Rubio Intelligent Internet Research Group Intelligent Internet Research Group Intelligent Internet Research Group Universidad Distrital Francisco José Universidad Distrital Francisco José Universidad Pontificia de Salamanca de Caldas de Caldas Campus de Madrid Facultad de Ingeniería Facultad de Ingeniería Facultad de Ingeniería Bogotá DC, Colombia Bogotá DC, Colombia Madrid, España 05713239300 05713239300 05713239300 osalcedo@udistrital.edu.co neil_or@yahoo.com gustavo.lopez@upsam.net ABSTRACT Within the VolP networks environment, there are three protocols that solve the problem of voice packet signaling, known as "highlight protocols": H323, SIP and IAX.
Sentence 2: this document focuses on a specific difference between SIP and IAX: the bandwidth, which is an essential parameter in order to design and optimize a VoIP network for an organization.
Relationship: entailment
Domain: Networks
Sentence 1: To account for the varying degrees of certainty when using these data sets, we distinguish between three different classes when quantifying back-of.ce traf.c.
Sentence 2: we consider back­of.ce traf.c caused by servers in our CDN data set (IPs-CDN), caused by servers we identi.ed using DPI and manual inspection (IPs-DPI+Manual) and the back-of.ce traf.c caused by servers identi.ed using the ZMap data set (IPs-ZMap).
Relationship: entailment
Domain: Networks
Sentence 1: Fair Sharing of Bandwidth in VANETs Marc Torrent-Moreno Institute of Telematics University of Karlsruhe Germany  torrent @tm.uni-karlsruhe.de Paolo Santi Istituto di Informatica e Telematica del CNR Pisa, Italy  paolo.santi @iit.cnr.it Hannes Hartenstein Institute of Telematics University of Karlsruhe Germany   hartenstein @rz.uni-karlsruhe.de ABSTRACT We address the challenge of how to share the limited wireless channel capacity for the exchange of safety-related informa­tion in a fully deployed vehicular ad hoc network (VANET).
Sentence 2: we study the situation that arises when the number of nodes sending periodic safety messages is too high in a speci.c area.
Relationship: entailment
Domain: Networks
Sentence 1: USENIX Association WitMeMo 05: International Workshop on Wireless Traffic Measurements and Modeling 2 Mobility Metric De.nitions While fading links are the norm in wireless communica­tion networks [11], the existing literature on mobility in MANETs concentrates on binary links.
Sentence 2: links are understood to be on or off at any point in time.
Relationship: entailment
Domain: Networks
Sentence 1: 4.3 Finding the distance-constrained tour Recall that the MS starts from the depot in the roadmap, moves along roads with high quality gains, and returns to the depot, subject to the length constraint L. To .nd such a closed tour, we adopt the similar idea in [13].
Sentence 2: we convert this optimization problem into the distance­constrained shortest path problem, which has been exten­sively studied [14, 15].
Relationship: entailment
Domain: Networks
Sentence 1: In fact, even in extreme cases where a partition forms weird shapes, for any .>k such that we have W.(t.id, t) n S .Ø, far nodes in = S that have lookup spirals intersecting these location points are also able to locate t. As for node failures, our scheme provides immediate fall­back due to the multiplicity of location points that store information about any node.
Sentence 2: when a node s searching for t.id encounters a faulty location point, it sim­ply skips it and moves on to the next higher level.
Relationship: entailment