sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: CONTENT-BASED INCENTIVE SYSTEM We expect there are at least three kinds of .nancial incen­tives to DACON participants: (1) isolated marketing, (2) lo­cal networked marketing, and (3) distribution commission.
Sentence 2: three kinds of pro.table contents can be delivered to DACON users from the standpoint of the DA-CON AP (or its owner).
Relationship: entailment
Domain: Networks
Sentence 1: The achievable rate of O(1/ log2 n) in worst-case sensor networks shows that in the physical model, the price of worst-case node placement is small, at most a logarithmic factor, whereas in the protocol model, it is signi.cantly higher.
Sentence 2: by making use of speci.c physical SINR characteristics, the physical model allows for rates that exceed the rates achievable in the protocol model by an exponential factor.
Relationship: entailment
Domain: Networks
Sentence 1: By squarely focusing on the analysis of the Web server-related portion of the traf.c seen by our IXP and applying an original methodology for identifying server-based in­frastructures, classifying them by ownership (e. g., company, orga­nization), and associating traf.c with them, we show that many of the major commercial Internet players are actively contributing to a clearly discernible trend towards network heterogenization.
Sentence 2: many of these players networks are undergoing major changes as a result of business decisions that either favor the hosting of servers from third-party networks within their own network infrastructures or the deployment of their own servers, often in massive numbers, in purposefully-selected third-party networks.
Relationship: entailment
Domain: Networks
Sentence 1: Indeed, one can choose one of the H rows at a time, order the columns in O(N log N ) time according to the just chosen row, consider all the H - 1 pairs of rows consisting of the just chosen row and every other row, and .nd in O(N) time the best border B1, for a total of O(H(N log N + NH)) time.
Sentence 2: consider now the particular case when there is a way of indexing the columns of D that simultaneously sorts all the rows of D. arranged the columns of D in such a way that a given row is sorted in non-increasing or­der, all the rows of D are sorted in non-increasing order of their bandwidths.
Relationship: entailment
Domain: Networks
Sentence 1: Pre.x Length Memory Required Initialization (kB) Time (sec) 16 1024 0.029 12 16384 0.455 8 262144 7.285 4 4194304 (not feasible) 0 67108864 (not feasible)  4.5 Discussion Our results above show that our trie-based method for network address generation is a good .t for network simulation and emula­tion environments.
Sentence 2: our approach produces addresses  Average time to generate one address (sec) 2e-06 4e-06 6e-06 8e-06 .
Relationship: entailment
Domain: Networks
Sentence 1: Then, we have the following fact: Observation I : For a link (i, j), if tij =-0.2272, Then Uij ( tij ) is a convex function.
Sentence 2: if for a link (i, j), the success probability tij in a single time slot satis.es: t ij tij = e = 0.7968, then Uij ( tij ) is a convex function.
Relationship: entailment
Domain: Networks
Sentence 1: The detailed investi­gation highlights the advantages and disadvantages of each approach and its suitability for a certain network and user pro.le.
Sentence 2: we demonstrate that DSR and ZRP behave very well in networks of low mobility, as shown by the high message delivery rate and the small message de­livery delays they achieve in this case, while the RUNNERS performance is less dependent on the mobility rate (actually, it seems to bene.t from high mobility rates).
Relationship: entailment
Domain: Networks
Sentence 1: We question the environments where EQSs are com­monly assumed to be more appropriate than classical quorums, and vice-versa.
Sentence 2: we argue that EQSs may not always be advantageous over CQSs in mobile networks, while EQSs can outperform CQSs in high-throughput agreement in strongly-connected en­vironments.
Relationship: entailment
Domain: Networks
Sentence 1: A.1 Detecting Replicas We detect replicas of the same packet crossing a link by de- termining whether two packets are replicas of a looping packet.
Sentence 2: two packets a and b where b is observed after a are considered to be replicas of a single looped packet if their headers are identical except for the TrL and IP header checksum fields; their'YI'L values differ by at least two; and their payloads are identical.
Relationship: entailment
Domain: Networks
Sentence 1: We process the complete temporal graph during peak and o.-peak hours with directed links, using windows of .ve minutes.
Sentence 2: we measure the average temporal correlation coe.cient C of the neighbour set of a station i between two successive graphs of Zt w by deriving the temporal correlation coe.cient of each bus station Ci: i Ci C =(1) N T -1 1 j aij (t) aij (t + 1)Ci =  (2) T - 1 t=1j aij (t)j aij (t + 1) C = 1 if all graphs in the sequence are equal.
Relationship: entailment
Domain: Networks
Sentence 1: if (flight sizen == rcv bytesn) (5) targetn+1 = snd cwnd max if (targetn == snd cwnd max ||targetn  tmp targetn) (7) targetn+1 =(tmp targetn + targetn)/2 (5): flight sizen means FS and rcv bytesn means rcv bytes during the nth period.
Sentence 2: all the pack­ ets in transit during the nth period5 are received and 5Each period is equal to rtt min.
Relationship: entailment
Domain: Networks
Sentence 1: As depicted in Figure 3, a graph representation suitable for path brokering is obtained by having each edge represent one transit service instance offered by a given operator and each vertex represent a point of interconnection between op­erators.
Sentence 2: by having vertices represent operator data exchange points (where data is handed from one operator to another), and edges represent transit services offered from one exchange point to another by a given operator.
Relationship: entailment
Domain: Networks
Sentence 1: This paper .rst presents an em­pirical study that demonstrates the potential bene.ts and design guidelines for robust topology control in indoor en­vironments.
Sentence 2: we found that RSSI and LQI are not always robust indicators of link quality in indoor en­vironments and that pro.ling links even for several hours is not su.cient for identifying links whose PRR is con­sistently high.
Relationship: entailment
Domain: Networks
Sentence 1: One of the main motivation of this interest is that the energy consumed by such huge number of ac­cess networks is largely wasted in the periods of time when the number of users served by the wireless access network is low.
Sentence 2: these access networks are dimensioned based on the peak hour tra.c, so that when tra.c load decreases (e.g., during the night) they are over-dimensioned.
Relationship: entailment
Domain: Networks
Sentence 1: Due to their unique characteristics, QoS in MANETs is possible only if supported by the underlying medium access technology [1].
Sentence 2: the network-level QoS mechanisms cannot work in MANETs, unless the MAC ensures orderly access to the shared wireless medium, playing a 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: entailment
Domain: Networks
Sentence 1: Indeed, as the number of interfaces of a switch increases beyond some value, we need to replace it with a di.erent chassis that can support more interfaces.
Sentence 2: the true energy savings may be written as, E[overall energy savings] = C(c,m)+I(a(m+c)+(1-a)(K1+K2)) (4) C(c,m)+I(m+c) where C(c, m) is the cost of the switch chassis supporting c end-hosts and m inter-switch links and I is the per-interface energy cost.
Relationship: entailment
Domain: Networks
Sentence 1: Li and Li in [20] have shown theoretically what can be the maximum throughput improvement with intra-session NC in undi­rected networks, compared with what can be obtained with integral, half-integer and fractional routing.
Sentence 2: for the multicast problem, the throughput increase ratio is upper-bounded by two between NC and half-integer routing, or even less with fractional routing [20, 24].
Relationship: entailment
Domain: Networks
Sentence 1: Then the de.cit counters for all the chosen clients in MU-MIMO transmission are decremented by T, while those that had outstanding packets but did not get selected are incremented by nT each, where n m is the number of antennas participating in MU-MIMO transmission and m is the number of active clients not chosen for the transmis­sion.
Sentence 2: the current service (nT) is distributed equally among the non-scheduled clients to guide the schedule towards a fair allocation.
Relationship: entailment
Domain: Networks
Sentence 1: Given the inherent hardness of general packet classi.ca­tion as a theory problem, some researchers have proposed to reduce the number of rules in a given rule set in order to improve the e.ciency of packet classi.cation.
Sentence 2: in his Ph.D. thesis [6], Gupta identi.es backward redundancy and forward redundancy.a rule ri in a rule set R = {r1,r2,··· ,rn} is backward redundant if and only if Rcontains some other rule rj such that (1) j<iand (2) the de.nition region of rj contains the de.nition region of ri.A rule ri is considered forward redundant if and only if Rcontains some other rule rj such that (1) j>i,(2) the de.nition region of rj contains the de.nition region of ri, (3) ri and rj have the same decision, and (4) for any ksuch that i<k<j, either the de.nition regions of ri and rk do not overlap or ri and rk have the same decision.
Relationship: entailment
Domain: Networks
Sentence 1: if the long-term average throughput of each client n is at least qn jobs per interval with probability 1.
Sentence 2: k 1 lim inf K 1(a job for client n is accomplished in the K.8 K k=1 kth interval) = qn, with probability 1, for every client n, where 1(·) is the indicator function.
Relationship: entailment
Domain: Networks
Sentence 1: Using the available bandwidth as cost metric re­quires us to modify also the local objective function for computing BR wirings.
Sentence 2: thebest response for vi may be based on a wiring si that maximizes the aggregate bandwidth out of a node given by max min(AvailBW (e(vi,w)),AvailBW(w,vj)) w.s vj .V-i The above objective calls for the maximization of the average of the bottleneck bandwidths to all destina­tions.
Relationship: entailment
Domain: Networks
Sentence 1: To avoid additional messages, all the management data needed by the adaptive distribution process are piggybacked into mobility beacons.
Sentence 2: when a node sends its own beacon message, it piggybacks three parameters: i) a Local Query Load Factor (LQLF); ii) a Data Keys List (DKL); and iii) a Data Repositories Diversity Factor (DRDF).
Relationship: entailment
Domain: Networks
Sentence 1: In this paper, however, we present what we believe to be the first ever set of experimental results that highlight the fact that WLAN devices from different vendors in the market can have heterogeneous MAC level behavior.
Sentence 2: we demonstrate with examples and data that in certain cases, devices may not be conformant with the 802.11 standard while in other cases, they may differ in significant details that are not a part of mandatory specifications of the standard.
Relationship: entailment
Domain: Networks
Sentence 1: m For a given client in the last cell, if an AP in the previous T -1 cells uses one spare antenna to cancel the interference to the client, the client can be considered to equivalently have Nt -Kt additional antennas for canceling this AP s interference.
Sentence 2: one can transfer the interference cancellation capability from an AP to a client it interferes with by providing the client such equivalent antennas.
Relationship: entailment
Domain: Networks
Sentence 1: NODE Expected LOAD The above formula is used to decide whether a load change can be tolerated by a node, without requiring load redistribution in order to preserve the load balancing property of the K-D tree.
Sentence 2: when the load change Dload is relatively small against the expected load of the node, new data points are added to the node without violating the requirement for an overall load-balanced tree.
Relationship: entailment
Domain: Networks
Sentence 1: Then we studied the impact of restoration using the concatenation of these basic paths, by randomly sampling failure cases.
Sentence 2: for example, to study the impact of single link failures, we randomly chose source-destination pairs, SR and DR. Then we simulated a link failure for each link, L, in the basic LSP connecting SR and DR. we calculated a new shortest path from SR to DR, (the backup path) and determined the smallest number of basic LSP's whose concatenation is the backup path.
Relationship: entailment
Domain: Networks
Sentence 1: Keynote I: Ad Hoc Networks, IETF, and Convergence in Solution Space Charles Perkins Nokia Research Center Abstract Within the IETF, the working group for Mobile Ad Hoc Networking (MANET) has recently made new steps towards standardizing new routing protocols.
Sentence 2: there is now a document specifying a new protocol called DYMO (for Dynamic Mobile Networks).
Relationship: entailment
Domain: Networks
Sentence 1: 5.5 Summary of Evaluation Our experiments have shown that our forwarding algo­rithm has good absolute performance and good cost amorti­zation over a variety of loads.
Sentence 2: we found that: the basic short-circuit evaluation of .lters greatly re­duces processing time in the case where a single mes­sage may match a large number of .lters;  the use of the selectivity table improves the ability to short circuit the forwarding function, reducing the matching time up to 40% in the critical cases of routers with numerous interfaces and especially in the extreme case of centralized routers; and  the use of the selectivity table has no measurable costs over the basic algorithm.
Relationship: entailment
Domain: Networks
Sentence 1: Therefore, the cost of EC(DT ' ) is at least opt c(MST (KG)) since MST (KG) is the minimum cost tree span­ning all dominators and the edge uiuj in MST (KG) corresponds to the path with the least cost between ui and uj .
Sentence 2: ' c(EC(DTopt)) =c(MST (KUDG )).
Relationship: entailment
Domain: Networks
Sentence 1: Then, checking whether the runs of A are such that the conditions of The­orem 1 are satis.ed will allow us to determine already at an early stage (i.e., before developing a detailed correctness analysis) whether it is worthwhile to explore A further.
Sentence 2: if (dec-D) can be satis.ed in some runs, i.e., (A) holds, the algorithms is very likely .awed, as the remain­ing conditions are typically easy to construct in su.ciently asynchronous systems.
Relationship: entailment
Domain: Networks
Sentence 1: If we use p ' to denote the uniform detection probability, then Eq.
Sentence 2: (9) is further simpli­.ed as follows: p =1 - (1 - p ' )m (10) tw the value of m is equal to tc ,here tw is the duration in the e.ective scanning window, and tc is the av­erage duration of a query cycle.
Relationship: entailment
Domain: Networks
Sentence 1: .rst avoidance method is to divide the entire simulation area into two disjunct zones (as in [18]): a border zone Ab with a width of at least r0 and an inner zone Aeff .Only nodes that are located in the inner zone are considered for the statistics of the simulations.
Sentence 2: links connecting an inner node with a border node are only counted for the inner node.
Relationship: entailment
Domain: Networks
Sentence 1: In (1), Sj is the length of each segment in the propagation path, and D(·)is a function to model the dual-slope path loss behavior.
Sentence 2: { x x>xbr D(x)= xbr , (4) 1 x = xbr where xbr is de.ned as the breaking point for changing the slope in path loss model.
Relationship: entailment
Domain: Networks
Sentence 1: Consider the collection of all connections with initiator node i and a responder node j.We use fij to denote the portion of the total bidirectional tra.c due to these connections that is in the forward direction.
Sentence 2: fij denotes bytes contained in forward tra.c divided by bytes in forward plus reverse tra.c, so 0 = fij = 1, .i, j Next we consider the total tra.c due to connections ini­tiated at node i, i =1, ..., n, which we denote Ai (for activ­ity ).
Relationship: entailment
Domain: Networks
Sentence 1: STEP-2: Compare the distance dij with the Lmax,j of the corresponding RN sj .
Sentence 2: sTEP-3: Vertices are prioritized based on the number of reachable RN s which satis.es dij = Lmax,j .the vertex that has less number of RN s will be considered in a higher order.
Relationship: entailment
Domain: Networks
Sentence 1: number of VIPs for ob ject k arriving to node n during slot After being forwarded through the network (in the virtu­ t may be less than P a2N µan al plane), the VIPs for object k are removed at the content k (t) if the neighboring nodes have little or no VIPs of object k to transmit.
Sentence 2: source src(k), and at nodes that have cached ob ject k. the content source and the caching nodes are the sinks for the VIPs.
Relationship: entailment
Domain: Networks
Sentence 1: However, under IFR mobility patterns such as RWP model or MC3 in Section 3.3, we have Age(A,D) =Age(B,D) .
Sentence 2: res(A,D) =st Res(B,D), (17) which implies that a mobile node that is closer to D in dis­tance will now spend stochastically longer time to meet the destination.6 while indeed successively .nd­ing better nodes (in terms of smaller residual lifetime with D) under DFR type mobility patterns, the same algorithm based on age information as above may choose worse set of nodes for IFR type mobility patterns.
Relationship: entailment
Domain: Networks
Sentence 1: The cost for correlating L o-1 with an operator graph is therefore l=0 .e(l) .c(l).
Sentence 2: the following inequation must hold for our ap­proach to be better in terms of bandwidth: L L o-1 o-1 n (l) .c(l) >q ((l) .c(l)+ .m )(1) l=0 .el=0 .eCv L .
Relationship: entailment
Domain: Networks
Sentence 1: The operators validated that the network indeed implements two such units.
Sentence 2: the network controls the 0.8 reachability to a speci.c collection of subnets(all of which were attached to a given router) by preventing route announcements to 0.6 the subnetsfrom reaching other routers(thisis achieved using the Fraction of subnets that arereachable from policy unit Fraction of hosts appropriateroute .lters).Thissmall collectionof subnets,however, were reachablefrom the rest of the subnets attached to the router.
Relationship: entailment
Domain: Networks
Sentence 1: A message sent over a link (vi,vj ) is possible if there is no simultaneous transmitter vz such that vj is in vz s in­terference range Rzint .
Sentence 2: two time-spectrum blocks Bk gh(te,.te,fe,.fe) are mutually ij (tk,.tk,fk,.fk)and Benon-interfering if one of the following conditions is satis­.ed.
Relationship: entailment
Domain: Networks
Sentence 1: PL = (1 -- pB)(1 --pv) + (1 --PB)PuPw +PBPw" (8) Proof: A direct transmission from host X to host Y succeeds in WAR if Y receives the packet either from X or from a wit- ness of X and then X is informed about the success.
Sentence 2: the transmission succeeds if: 1. the link is not broken and it is bidirectional, or 2. the link is not broken, it is unidirectional and a witness delivers the packet, or 3. the link is broken but a witness delivers the packet.
Relationship: entailment
Domain: Networks
Sentence 1: Table 2 reports the main .elds of such dictionaries along with their description.
Sentence 2: the .eld end_index has di.erent meanings de­pending on the type of video stream: 1) in the case of live streaming (is_live is true) it is the index of the last chunk of the current playlist; in this case end_index increases when a new chunk is made available by the the HTTP server; 2) in the case of video on demand (is_live is false) it represents the index of the last chunk of the video.
Relationship: entailment
Domain: Networks
Sentence 1: Re­cent theoretical results suggest that in the worst case sel.sh routing can result in serious performance degradation due to lack of cooper­ation.
Sentence 2: roughgarden and Tardos prove that the price of anarchy (i.e., the worst-case ratio between the total latency of self­ish routing and that of the global optimal) for sel.sh routing can be unbounded for general latency functions [31].
Relationship: entailment
Domain: Networks
Sentence 1: In this work, we take the stance that rather than eliminate middleboxes or completely rearchitect them, we should attempt to integrate them into the SDN fold in a minimally intrusive way.
Sentence 2: to this end, we identify .ow tracking as a key capability for policy enforcement in the presence of dynamic traf.c transforma­tions.1 we need to associate additional contextual infor­mation with a traf.c .ow (e.g., which user initiated it or whether the response was cached) as it traverses the network, even if packet headers and contents are modi.ed.
Relationship: entailment
Domain: Networks
Sentence 1: It can be shown that the FPL strategy has provably low regret.
Sentence 2: if we de.ne constants D, R, and A such that, .O, O ' .O,D =|O - O ' |1 (i.e., maximumL1distance between anytwodecision vectors)  .O .O,S .S,R =|O.S| (i.e., maximum possible value ofthe costfunction)  .S .S,A =|S|1 (i.e., maximumpossibleL1-normof the state vector),  J D then,FPL withparameter o = gives, RA.
Relationship: entailment
Domain: Networks
Sentence 1: Transfer Layer: Zooming in on session ON times, we charac- terize the bottom layer of our hierarchy, which focuses on indi- vidual unicast data transfers, each of which is the result of spe- cific actions performed by a client.
Sentence 2: for live objects, a transfer is the result of a pair of requests to "start" and eventu- ally "stop" viewing a live object.
Relationship: entailment
Domain: Networks
Sentence 1: These techniques strive to (a) minimize the number of DNS requests made across the wire­less links and (b) minimize the number of distinct TCP connections opened across the wireless links when web pages are downloaded.
Sentence 2: most of the DNS lookups and short-lived TCP con­nections are pushed to the wireline part of the network, making the wireless part behave like an FTP session.
Relationship: entailment
Domain: Networks
Sentence 1: The results show again that OLIA balances congestion in the network and reduces the loss probability in bottlenecks much better than LIA.
Sentence 2: we observe that by increasing N1 from 0 to 3N2, p2 increases by a factor of 2 using OLIA, whereas the increase is in the order of 4 to 6 times when using LIA.
Relationship: entailment
Domain: Networks
Sentence 1: 3.4.2 Event Filtering The content routing optimization uses the covering (or contain­ment) relation between the spatial representations of newly arrived and the existing advertisements/subscriptions to set up .ows be­tween publishers and subscribers.
Sentence 2: each .ow is asso­ciated with a sub-space and is identi.ed by the corresponding dz.
Relationship: entailment
Domain: Networks
Sentence 1: As a step toward addressing this issue, we describe a cheap and dirty approach to extracting the requisite measurement data from lowest common denominator data sources commonly found in production networks today.
Sentence 2: we demonstrate a methodology for reconstructing historical network failure events inside of an autonomous system using three near-universal, yet under-appreciated, data sources: router con.guration .les, syslog archives, and operational mailing list announcements.
Relationship: entailment