sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: Keeping in mind that multiple connections between peers is rare in our data sets, we consider what happens when twenty peers all connect to peer A.
Sentence 2: each peer will select a temporary source port and connect to the advertised listening port of peer A.The advertised {IP, port} pair of host A would thus be a.liated with 20 distinct IPs and 20 distinct ports 5.for the advertised destination {IP, port} pair of host A,the number of distinct IPs connected to it will be equal to the number of distinct ports used to connect to it.Figure 1 illustrates the procedure whereby a new host connects to the P2P network and advertises its {IP, port} pair.
Relationship: entailment
Domain: Networks
Sentence 1: 3.1 Design principles The route veri.cation protocol must be secure in the pres­ence of malicious intermediate ASes, even if the latter are aware that route veri.cation is taking place, know the ver­i.er s and prover s algorithms, and are actively trying to evade detection.
Sentence 2: probe packets must be indis­tinguishable from regular data packets.
Relationship: entailment
Domain: Networks
Sentence 1: As shown in the B|A column, event(B2|A2)can be de­generated toahorizontal segmentplusatriangle(i.e.,(1,1) and (2,1) mergetoa singlepoint),giventhesegmentsin A2 are already connected.
Sentence 2: p(B2|A2)= p*(p+p 2 -p 3 ), since the two paths (from (1,0) to(2,1)) in the degenerated triangle are independent (illustrated in the second sub-row of the second row).
Relationship: entailment
Domain: Networks
Sentence 1: This paper is aimed to show that a large system of inter­acting MAs can be analytically solved to generate a phero­mone gradient around the sink(s) that can be successively used to create the routing table along the steepest gradient in order to minimize the number of hops from each node to the sink(s).
Sentence 2: we provide a stochastic model to analyze a swarm-based routing protocol that gets inspira­tionfrom theone presentedin[12].
Relationship: entailment
Domain: Networks
Sentence 1: In the present paper, we show that taking a = 51r/6 is necessary and sufficient to preserve connectivity.
Sentence 2: we show that if a _< 51r/6, then there is a path from u to v in GR iff there is such a path in G~ (for all possible node locations) and that if ct > 51r/6, then there exists a graph GR that is connected while G~ is not.
Relationship: entailment
Domain: Networks
Sentence 1: In the context of this straightforward approach, we seek to achieve the following two operational goals: Non-interference: Since we advocate a proactive approach to DDoS mitigation it is absolutely essential that there be no interfer­ence between customers.
Sentence 2: if one customer desires to constrain communication with a particular network entity, that de­cision should not have any impact whatsoever on the ability of other customers to communicate with said entity.
Relationship: entailment
Domain: Networks
Sentence 1: The queues 4j -2, 4j do not o.er any service (hence have zero serive times) and are only meant to represent delay of service to the next cycle, while the queues 4j - 3 and 4j - 1 carry out the actual ser­vices.
Sentence 2: the users whose request will be served in the current cycle are viewed as if waiting in the queues 4j -3 for downlink service and 4j - 1 for uplink service.
Relationship: entailment
Domain: Networks
Sentence 1: Suppose further that the network has path or loop veri.cation.
Sentence 2: then there exists a BGP-compliant strategy for m with rm(·) = vm(·) and a consistent export rule obeying GR2 that obtains the best possible stable outcome in terms of the utility function of m. exporting all paths to customers and no paths to providers and peers is one such optimal strategy.
Relationship: entailment
Domain: Networks
Sentence 1: We assume that the set of reachable paths, P(v0), is bounded in size, in order to place an upper bound on the size of a multi-path solution.
Sentence 2: we assume that |P(v0)|<h(|V|) for some a priori function h. We argue that this is reasonable because prac­tical routing systems often have an implicit memory bound in enumerating the paths in a network.
Relationship: entailment
Domain: Networks
Sentence 1: In particular, we .rst de.ne the model of security for stateful IBE scheme and then present a concrete stateful IBE scheme whose se­curity meets the (strongest) de.nition in the model, while its encryption and decryption algorithms are also extremely e.cient.
Sentence 2: we show how to encrypt securely with just one pairing in identity-based setting.
Relationship: entailment
Domain: Networks
Sentence 1: Properly identifying Internet one-way tra.c from mea­surement data imposes speci.c requirements on monitoring.
Sentence 2: tra.c sampling and poor spatial network cov­erage, i.e., missing one direction of a communication that may take a di.erent path due to asymmetric routing, may result in arti.cial one-way .ows.
Relationship: entailment
Domain: Networks
Sentence 1: In our experiments, we varied the rs value in the range 0.33 × ravgs to 3 × ravgs,where ravgs is the average bitrate for video stream s. We conducted our experiments with all considered rs values, and we report the best performance among them.
Sentence 2: we exhaustively searched for the absolutely optimal MBS con.guration, and we compare the OSVM algorithm to it.
Relationship: entailment
Domain: Networks
Sentence 1: Although [9] adopts di.erent method from that in [5], the above assump­tions hold for the random process of Ztcp in (2).
Sentence 2: by leveraging Kac s recurrence theorem, the average connectivity period in [9] can be similarly written as 1 -P{Zcp =1} t Zcp Zcp .
Relationship: entailment
Domain: Networks
Sentence 1: The regions of small and large SNR values respectively cor­respond to regions of large and small constant standard de­viation st .A transition region is veri.ed for moderate SNR values.
Sentence 2: the upper and lower values of st de­pend on the observation time Tg and the integration time Tint of the energy detector, respectively, as follows .. Tg .
Relationship: entailment
Domain: Networks
Sentence 1: 3.1 DTN Nodes for Distributed Storage We have de.ned extensions to the per-node bundle processing: routing, forwarding, and queuing behavior may be adapted upon the identi.ed protocol operations and the enclosed resources (if any).
Sentence 2: this allows us to leverage the DTN store-carry-and-forward paradigm and make DTN nodes keep a copy of a message for a longer period of time than required by the forwarding algorithm, i.e., cache the ADU.
Relationship: entailment
Domain: Networks
Sentence 1: The recent work [9] provides a more re.ned theoretical analysis of the perfor­mance and system optimization of a massive MIMO systems in the regime of large but .nite number of antennas per user.
Sentence 2: it shows that in this realistic regime the choice of the multiuser MIMO precoding scheme is very important, and that the gain of regularized zero-forcing beamforming over conjugate beamforming is very signi.cant, unless the number of base station antennas per user grows to imprac­tically large values.
Relationship: entailment
Domain: Networks
Sentence 1: Theorem 11 If the average route length in the network is EL, the probability that a packet is successfully routed by WAR to its final destination in one attempt is: Ps = [PL + (1 -PL)PR] EL (12) resent by the original host.
Sentence 2: it either passes each link without error, or, if an error occurs, the recovery mechanism corrects it.
Relationship: entailment
Domain: Networks
Sentence 1: This property is de.ned as follows:  DE FI N IT I O N 1.
Sentence 2: a network is symmetric if for all source­destination pairs (s, d), all switches on the shortest paths between s and d that are the same distance from s have identical outgoing capacity to d. any of these switches are equally good interme­diate candidates for routing a .ow between s and d. Using the example of Figure 2, switches Y and Z are both on a shortest path between (A,E), and both have one link of outgoing capacity to E. Real deployments and most proposed datacenter architectures satisfy the symmetry property.
Relationship: entailment
Domain: Networks
Sentence 1: Clearly, there are challenges in realizing such self-healing com­munities in mobile networks.
Sentence 2: community creation and con.guration: A self-healing com­ munity can be created and con.gured anywhere and anytime in a manner compatible with state-of-art ad hoc routing pro­tocols, but the related process should only incur reasonably low overhead.
Relationship: entailment
Domain: Networks
Sentence 1: In order to gauge the impact of these approxima­tions, the physical throughput of the schedules found from the protocol model were computed.
Sentence 2: suppose that the optimal schedule based on the protocol model resulted in assignment v. In the protocol model, the data rates over link x for this assignment is RØ (x),where the Ø denotes that the data rate is based on the assumption that no other node is transmitting.
Relationship: entailment
Domain: Networks
Sentence 1: The quality degradation represents the ratio of the reduction in the reconstructed quality (due to the rate reduction) to the quality of the enhancement layer with encoding rate a.
Sentence 2: we define quality degradation = (original quality with enhancement layer coded with rate a - reconstructed quality after rate regulation)/ original quality with enhancement layer coded with A V R_TCP=1Mbps A VR_TCP=1.5Mbps 33 alpha Mbps (a) Reconstructed quality Q with non-adaptive transmission as a function of enhancement layer encoding rate a (b) Reconstructed quality Q with proposed adaptive transmission  rate a, i.e., the quality degradation at rate r is given as (Q(a,a,.
Relationship: entailment
Domain: Networks
Sentence 1: Constraint di.erentiation is independent of the techni­cal and conceptual details of the various lazy intruder ap­proaches and underlying protocol models, and can thus be adopted in other approaches.
Sentence 2: even though for concreteness we refer to our own variant of the lazy intruder technique [5], it is not di.cult to carry over constraint dif­ferentiation to other approaches, as the di.erent formalisms for constraint reduction in the .rst layer of search are all similar.
Relationship: entailment
Domain: Networks
Sentence 1: log |Pi| = F.(r)= argmin {|..(u) - r|} (12) u.dom(..) where .. is a discrete function that maps the number of responders in log scale to the expected strength of their su­perposed signal given a target RSSI of ..
Sentence 2: according to Proposition 1, we have ..(u) = .+3u, u =0, 1, 2,... (13) node i uses the value u that makes ..(u) closest to r as the estimate of log |Pi|.
Relationship: entailment
Domain: Networks
Sentence 1: In order to take this random channel choice into account, we therefore calculate the performance that can be achieved by using each channel individually, and then use the average of those as the single channel perfor­mance.
Sentence 2: in Sections 5.2 and 5.3 we compare diversity to the single-channel case by averaging the ER ob­tained from using only channel 1 or only channel 2.
Relationship: entailment
Domain: Networks
Sentence 1: Since the underlying technologies and the packaging constraints of the various levels of the packaging hierarchy determine the feasible system level topologies/architectures, we chose a bottom-up approach and focused on the packaging of optical modules on boards.
Sentence 2: we propose lay-out strategies for on-optical printed circuit board (OPCB) topologies, translating existing lay-out strategies for electrical PCBs into a form suitable for OPCBs.
Relationship: entailment
Domain: Networks
Sentence 1: We call such a scenario for future wireless networks as cognitive radio networks (CRN), which is pretty much consistent of Haykin s definition of cognitive radio [10]: Cognitive radio is an intelligent wireless communication system that is aware of its surrounding environment (i.e., outside world), and uses the methodology of understanding­by-building to learn from the environment and adapt its internal states to statistical variations in the incoming RF stimuli by making corresponding changes in certain operating parameters (e.g., transmit-power, carrier-frequency, and modulation strategy) in real-time, with two primary objectives in mind: highly reliable communication whenever and wherever needed; efficient utilization of the radio spectrum.
Sentence 2: once cognitive radios can find the opportunities using the spectrum holes for communications, cognitive radio networking to transport packets on top of cognitive radio links is a must to successfully facilitate useful applications and services.
Relationship: entailment
Domain: Networks
Sentence 1: Also, G{E} gives the number of distinct array elements accessed by array reference E (which is either K[f1][f2]...[ft]} or L[g1][g2]... [g.]} for the assignment statement above).
Sentence 2: this constraint checks whether the size of the output data generated (K) is sufficiently smaller than the input data (L).
Relationship: entailment
Domain: Networks
Sentence 1: when the offered load is less than one (offered loads < 1), inter-ONU scheduling will be dominant in allocating the bandwidth for each user traffic; however, when the offered load is greater than one (offered loads > 1), intra-ONU scheduling will play the more key function in bandwidth allocation.
Sentence 2: when the offered loads less than one the prompt reaction to the varying EF traffic is important; however, in case the offered is beyond the limit, intra scheduling is primarily more important in providing dynamic bandwidth during allocated time slot.
Relationship: entailment
Domain: Networks
Sentence 1: 54 25 18 12.8 48 24 12 9.6 36 19.5 9 7.2 24 16 6 5.4 The current implementation of the 802.11 a/b/g MAC layer is known to have major ine.ciencies.
Sentence 2: both DCF and PCF access methods su.er when registered users have di.erent data rates, because the slowest user re­duces the throughput of the other users down to the value of the slowest user2 .
Relationship: entailment
Domain: Networks
Sentence 1: Cognitive radios are aware of the electromagnetic spectrum environment around them and make adjustments to their transmission characteristics accordingly, in a manner consistent with the tiered access rights model.
Sentence 2: we define cognitive radios as having the following capabilities: (a) Dynamic Spectrum Access (DSA): CRs must quickly and robustly detect the presence of incumbent users, who have preemptive rights to access the spectrum, to avoid causing interference to these users, (b) Dynamic Spectrum Sharing (DSS): CRs must be aware of other cognitive radio networks of likely similar access rights and coexist with these networks, and, (c) Dynamic Spectrum Multi-channel operation (DSM): CRs must be spectrum-agile and provide seamless operation over multiple channels, potentially simultaneously.
Relationship: entailment
Domain: Networks
Sentence 1: Within the provider backbone, unique multicast addresses are used to encapsulate tra.c for each MVPN.This as­sures that tra.c from di.erent customers is segregated in the backbone.
Sentence 2: each customer is assigned a default multicast group, referred to as a Default MDT (for Multicast Distribution Tree).All PE routers that partic­ipate in a given MVPN knowthis group address (e.g.,by con.guration.)
Relationship: entailment
Domain: Networks
Sentence 1: This demonstrator focuses on the 2.4 GHz frequency band and aims at showcasing how a small-scale Wireless Personal Area network (WPAN) made of IEEE 802.15.4 [2] compliant devices can achieve e.ective coexistence with other wireless technologies.
Sentence 2: the demo shows a distributed spectrum sensing service that provides spectrum awareness to the WPAN.
Relationship: entailment
Domain: Networks
Sentence 1: This can be explained with similar arguments used in [7].
Sentence 2: assume that in an FD based system, the nth user occupies a constant bandwidth, denoted by .nB, n =1, 2,...,N, where 0 <.n < 1 and LN .n = 1. n=1 The instantaneous transmission rates are then determined by Rn = .nB log2(1 + .n.n/.n), n =1, 2,...,N, where .n is the nth user s instantaneous power normalized by P .
Relationship: entailment
Domain: Networks
Sentence 1: Then, we com­pute the capacity gain that one can get by of.oading users traf.c while taking into account different of.oading policies and hotspot placement schemes.
Sentence 2: we show that of.oading using Passpoint control-plane information can grant up to 15% gain with respect to Passpoint-agnostic ones based on signal quality informa­tion.
Relationship: entailment
Domain: Networks
Sentence 1: 5.1 Cellular Resource Management Policy To ef.ciently utilize the limited radio resources, cellular net­works employ a radio resource management policy distinguishing them from wired and Wi-Fi networks.
Sentence 2: there exists a radio resource control (RRC) state machine [31] that determines the radio resource usage based on application traf.c patterns, affecting the handset energy consumption and the user experience.
Relationship: entailment
Domain: Networks
Sentence 1: Instead of using Max Min fairness in allocating the explicit feedback (§3.4), we use Weighted Max Min fairness, where longer paths have smaller weights.
Sentence 2: a TeXCP agent s assigns to each path p a weight vsp = d)1 , where dsp is the sp propagation delay on path p, and .> 1 is a parameter that controls the bias against longer paths.
Relationship: entailment
Domain: Networks
Sentence 1: Delay-Throughput Performance in Mobile Ad-Hoc Networks with Heterogeneous Nodes Valentina Martina Michele Garetto Emilio Leonardi Politecnico di Torino, ItalyUniversità di Torino, ItalyPolitecnico di Torino, Italy valentina.martina@polito.it michele.garetto@unito.it emilio.leonardi@polito.it ABSTRACT In this paper, we analyze asymptotic delay-throughput performance of mobile ad-hoc networks comprising heterogeneous nodes with restricted mobility.
Sentence 2: we consider a scenario in which each node moves around one or more home-points (in a .nite num­ber) randomly placed over the area.
Relationship: entailment
Domain: Networks
Sentence 1: Consider the following FT, which we refer as FTO : [ (1, tcp_dst_port=22 , drop), (0, eth_dst==4 &#38;&#38; eth_src==6, port 30), (0, eth_dst==2 , drop)] One can verify that the two FTs produce the same result.
Sentence 2: the example shows that BU IL DFT has two problems: (1) it may generate more .ow table rules than necessary, since the barrier rule in FTB is unnecessary; and (2) it may use more priority levels than necessary, since FTB has 4 priorities, while FTO has only 2.
Relationship: entailment
Domain: Networks
Sentence 1: Anomalies by the subspace method are detected by inspecting the size of residual vector (Ix I2) across time for un­usually large values.
Sentence 2: an anomaly is triggered when Ix I2 >da where da denotes the Q-statistic at the 1-acon.dence level, as given in [10] and used for traf.c analysis in [16].
Relationship: entailment
Domain: Networks
Sentence 1: In this section, we attempt to .x these two issues and demon­strate that signi.cant performance gain can be obtained, even with power control itself alone.
Sentence 2: to fo­cus on the performance of the state machine, we limit our­selves to only controlling the transmit power (TPC -trans­mit power control) while keeping the broadcast periodicity, carrier sense threshold and modulation schemes constant.
Relationship: entailment
Domain: Networks
Sentence 1: Let us denote by S (s, t) = S (t) -S (s)the amount of service that the server would have delivered in interval [s, t) if there had been no service impairment in the interval, and I(s, t) the amount of service, called impaired service, that cannot be delivered in the interval due to some impairment to the server.
Sentence 2: the actually deliv­ered service S(t) to the input satis.es, for all t =0, S(t)= S (t) -I(t), (31)  with S(0) = 0, I(0) = 0 by convention.
Relationship: entailment
Domain: Networks
Sentence 1: We argue that insu.cient time has been spent evaluating the suitability of symmetric designs, which have several notable advantages over asym­metric designs most notably a lesser reliance on availabil­ity of bandwidth.
Sentence 2: we suggest that asymmet­ric cryptographic models may not provide functional ben­e.ts to match their deployment costs, especially so in net­works where the constant availability of certi.cation author­ities and certi.cation revocation lists can not be taken for granted.
Relationship: entailment
Domain: Networks
Sentence 1: Thus, while our trace does not provide GPS-level .ne-grained location information, we will show later that location information at the level of base-stations is still invaluable from the perspective of the serendipitous location-based services.
Sentence 2: we will show how we caninfergenericuser mobilityproperties(Sections2.2,3.1), as well as correlate locations with application usage (Sec­tion 3.2).
Relationship: entailment
Domain: Networks
Sentence 1: R, then y is p s only closest point on .R.
Sentence 2: 1The Voronoi diagram of a set of points S in the Euclidean plane is a planar graph that partitions the plane into convex cells such that all the points in­side a cell have the same closest neighbor in S. a point on the Voronoi cell boundary has equal distance to at least two points in S. Further information about Voronoi diagrams can be found in [11].
Relationship: entailment
Domain: Networks
Sentence 1: We present a num­ber of strategies drawn from experiences for avoiding or overcom­ing some of the pitfalls.
Sentence 2: we discuss dealing with er­rors and inaccuracies; the importance of associating meta-data with measurements; the technique of calibrating measurements by ex­amining outliers and testing for consistencies; dif.culties that arise with large-scale measurements; the utility of developing a disci­pline for reliably reproducing analysis results; and issues with mak­ing datasets publicly available.
Relationship: entailment
Domain: Networks
Sentence 1: The realiza­tion of EnHANTs is based on recent advances in the areas of solar and piezoelectric energy harvesting [24] as well as ultra-low-power wireless communications [26, 42].
Sentence 2: recent novel cir­cuit designs that employ ultra-wideband (UWB) communications provide new levels of ultra-low-power operation (at the orders of nJ/bit) at short ranges.
Relationship: entailment
Domain: Networks
Sentence 1: For each incoming packet to input i destined for out­put k, a request token r(i, k) is immediately gener­ated and sent to the intermediate input linecard that is currently connected to the input.
Sentence 2: the input linecard load-balances request tokens among intermediate linecards in a cyclical way that is in.u­enced by the arrival time of each packet.
Relationship: entailment
Domain: Networks
Sentence 1: Capturing similarities be­tween di.erent versions of the same page visited several days or weeks apart would either require a very large cache on disk, or would possibly be better handled using hierarchi­cal substring caching or .le synchronization techniques.
Sentence 2: if a page is revisited after all the block hashes from the previous visit have already been evicted from the proxy, but the client still has the old page in his disk cache, then there is a very simple and elegant way to utilize .le synchronization techniques similar to rsync in this context.
Relationship: entailment
Domain: Networks
Sentence 1: to realize these applications are now on the market, and it is reasonable to assume that their deployment will grow rapidly.
Sentence 2: while there are many types of RFID, theEPCClass-1Generation-2 standard[3] de.nes readers and passive tags that operate at UHF frequencies and use backscatter communication to support read ranges mea­sured in meters.
Relationship: entailment