sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: The results of the per­formance evaluation of ML-SOR showed that more stable social information provided by several social network layers is able to augment available partial contact information im­proving message forwarding.
Sentence 2: we compared our protocol to Epidemic routing, PRoPHET, Bubble Rap and a hybrid version of Bubble Rap, called H-Bubble Rap, which uses the same metric of ML-SOR and is community-based.
Relationship: entailment
Domain: Networks
Sentence 1: )rmax and duj vj <rmax (13) By geometry, SIV <SV < 2SIV holds.
Sentence 2: since uj is dis- M tributed randomly on MN in a uniform manner, we get: MCNC M1 + M2 SIV <E(SIR(uj )) <(1+ )SIV (14) M MN when rmax =1, .=0.78, we obtain: 0.44 <k 1(ei) <0.58 (15) Now, take the value of k 2(ei) into account.
Relationship: entailment
Domain: Networks
Sentence 1: More generally, we can also de.ne an unweighted (hyper)graph Hd where an edge epq .E if and only if H pq >d, i.e., if the density of the corre- H sponding subgraph Spq is at least d. Hence, the induced hypergraph H represents the interaction patterns and their intensities between the various inside/outside host groups, and Hd captures the domi­nant interactions among the core host groups (or communities) of the inside/outside hosts.
Sentence 2: it is in this sense that we refer to the hy­pergraph H (Hd)as the (core) latent hypergraph underlying (or generating) the original TAG G. using Hd and the corresponding dense graph components Spq s, we obtain an ap­proximate core G of the original G that captures the dominant interaction patterns among signi.cant inside/outside host groups.
Relationship: entailment
Domain: Networks
Sentence 1: SUMMARY AND CONCLUSION We introduced a novel framework for P2P media stream­ing, BEAM, that uses alliance basedpeering scheme to solve some of the existing problems in chunk based P2P media streaming.
Sentence 2: our main contributions and .nd­ings are: 1) Peerlag(while mediaplayback) canbe signi.­cantly reduced from the order of minutes to approximately 10-20 seconds in the swarm.
Relationship: entailment
Domain: Networks
Sentence 1: Scheduling Policy: In terms of the scheduling policy itself, one can employ any desired scheduling policy ranging from simple round-robin to more sophisticated weighted fair queuing schemes with delay guarantees in MIDAS.
Sentence 2: de.cit round robin (DRR) is a type of weighted fair queuing that also incurs low com­plexity and is hence conducive for implementation.
Relationship: entailment
Domain: Networks
Sentence 1: Step 3 : The optimal scheme will be selected as the one minimizing the deviation with respect to both the maximal Pinf and the minimal Mrecv .
Sentence 2: depending on the vehicle density, it may become more important to minimize the number of messages for high densities, and in that case our algorithm varies the degree of importance of the two metrics by using the K value, calculated as follows:  100 K = (1) density of vehicles we used the value of reference 100 to compute K, since our experiments showed that the di.erences in terms of informed vehicles decrease no­ticeably for densities above 100 vehicles/km2 (see Fig­ure 2), and, hence, a higher weight is assigned to the number of messages received when this density is ex­ceeded.
Relationship: entailment
Domain: Networks
Sentence 1: ILNP FQDN Transport Identi.er, I Network Locator, L IP address Link MAC address MAC address Table 2: Use of names in ILNP and IP 2.4 DNS and a new API We .rst apply the traditional computer science concept of data hiding and de.ne a new Networking API that omits the use of ad­dresses or Locators, and instead is focused upon Domain Names4.
Sentence 2: only the Fully Quali.ed Domain Name (FQDN) is used by normal applications; raw IP address values are no longer vis­ible (though it is clear they could still be used by those applica­tions that absolutely needed to use them).
Relationship: entailment
Domain: Networks
Sentence 1: Moreover, the attacks prevent not only call content from being recorded (in the case of call-content wiretaps), they additionally prevent accurate call records from being delivered to law enforcement, often without the possibility of detection.
Sentence 2: unlike encryption that may be used to obfuscate the content of calls, the techniques described in this section may be used to additionally hide call records (who called whom and when) from wiretap transcripts.
Relationship: entailment
Domain: Networks
Sentence 1: This rep­resentation differs from the previous two approaches in that it cap­tures much more structural information about the .ows from which it is built.
Sentence 2: cSGs: are not based on a .xed token length but rather use longest common subsequences between .ows,  capture all of the sequences in which common substrings oc­cur, including their offsets in the .ows,  ignore all byte sequences that share no commonalities with other .ows,  track the frequency with which individual substrings, as well as sequences thereof, occur.
Relationship: entailment
Domain: Networks
Sentence 1: In this way we can be sure to avoid duplicate address and at the same time the TEMP IP discover would not contribute to the total handoff time any longer.
Sentence 2: since we know the TEMP IP before the actual handoff, we can think of a scenario where we can update the SIP session before performing the L2 handoff thus further reducing the total L3 handoff time.
Relationship: entailment
Domain: Networks
Sentence 1: From the classic result of Fred Cohen (a Ph.D. student of Leonard Adleman) (see [7] for an account of the results) that detecting a virus by its appearance is undecidable, it follows that By knowing the defense mechanism, it becomespossible to build a virus that infiltrates into the systemi.e., fools the defender.
Sentence 2: no defense is perfect.
Relationship: entailment
Domain: Networks
Sentence 1: We assume to replace a standard TCP session between a client and a WEB server with a CONET session (exchange of CONET CIUs) between an end-node and a serving-node, or an intermediate cache.
Sentence 2: we assume that: -an URL  is replaced by the network-identifier: namespace= www , principal= IP address:80 , label= path ; -TCP segments are replaced by carrier-packets that convey segments of named-data CIUs; -TCP ACKs are replaced by carrier-packets that convey interest CIUs (see Sec.
Relationship: entailment
Domain: Networks
Sentence 1: Link Management Protocol (LMP) runs between data plane adjacent nodes and is used to manage TE links.
Sentence 2: lMP provides mechanisms to maintain control channel connectivity (IP Control Channel Maintenance), verify the physical connectivity of the data-bearing links (Link Verification), correlate the link property information (Link Property Correlation), and manage link failures (Fault Localization and Fault Notification).
Relationship: entailment
Domain: Networks
Sentence 1: Therefore, to disconnect the graph it is necessary to create a sens­ing void, so that it is impossible to draw a continuous covered path connecting a node in V1 to a node in V2.
Sentence 2: as illus­trated in Figure 2, the nodes of V1 may all lie in region S, the nodes in V2 may all lie in region Q, and a set of nodes W must be removed to make a region T that is 0-covered.
Relationship: entailment
Domain: Networks
Sentence 1: Moreover, our impossibility ar­gument uses a 2-partitioning argument but does not require the system to (temporarily or permanently) decompose into k + 1 partitions.
Sentence 2: there is no further restriction on the communication among processes within D and within D. Despite its main purpose of showing impossibilities, our theorem is also useful when developing new algorithms for achieving k-set agreement.
Relationship: entailment
Domain: Networks
Sentence 1: Lemma 4 illustrates the limitation of FIFO in the face of a single adversary, where a single message transmis­sion can be exponentially complex with capacity constraints.
Sentence 2: many simple distributed algorithms includ­ing the emulation of a single round in a Byzantine agreement  (a) (b) Figure 2: (a) Single adversary case.
Relationship: entailment
Domain: Networks
Sentence 1: A Dynamic Bandwidth Allocation Algorithm for Supporting Real-time Applications in 802.15.3 WPANs G. Boggia, P. Camarda, L. A. Grieco, G. Tomasicchio DEE -Politecnico di Bari Via Orabona, 4, 70125 -Bari -Italy {g.boggia,camarda,a.grieco,g.tomasicchio}@poliba.it ABSTRACT The 802.15.3 Task Group was formed to create a standard that would enable wireless connectivity of high-speed, multi­media capable portable consumer devices within a Wireless Personal Area Network (WPAN).
Sentence 2: the 802.15.3 standard de.nes a piconet as a wireless ad hoc data com­munications system, con.ned to a small area.
Relationship: entailment
Domain: Networks
Sentence 1: Experiments In this section we describe the experiments 2 we have performed on various of the Multiparty Computation Protocol that we had speci.ed and analyzed in [17].
Sentence 2: in that paper we analyzed a num­ ber of protocols that were speci.ed using a dedicated uni.cation algorithm for equational theory H. Equation (7) was used and nothing else.
Relationship: entailment
Domain: Networks
Sentence 1: Conclusive results have been found only for scenar­ios where the interference power is either stronger or weaker than the direct (useful) signal.
Sentence 2: it has been shown that with strong interference, transmission of only common information is optimal, since the interfered receiver can decode anything that the intended receiver can, while for weak interference only private in­formation should be transmitted and treated as noise at the inter­fered receivers (see [4] for a review and further results)1.
Relationship: entailment
Domain: Networks
Sentence 1: The feedback in the probes bounds the send rate along any path.
Sentence 2: each TeXCP agent, s, maintains an additional per path variable gsp, which is the allowed rate on path p. When it receives a probe ack, it updates gsp as: gsp = gsp + a+ - a- × gsp, where a+ and a- here are the positive and negative feedback from the probe ack.
Relationship: entailment
Domain: Networks
Sentence 1: INTRODUCTION In wireless sensor and actor networks (WSAN), a large number of sensor nodes obtain information which must be transmitted reliability to any of several actor nodes in an energy e.cient and timely manner [1].
Sentence 2: actor­actor coordination selects the actor which each sensor is as­sociated with; sensor-actor coordination .nds the optimal means of sending and receiving information between an ac­tor and its sensors.
Relationship: entailment
Domain: Networks
Sentence 1: To allow a gateway node to send frames consecutively in an non-interruptible manner, we leverage the transmission opportunity (TXOP) option in the IEEE 802.11e speci.cation [17].
Sentence 2: a gateway node that succeeds in grasping the medium is granted the right to use the medium for a period of time speci.ed by TXOP.
Relationship: entailment
Domain: Networks
Sentence 1: By trying to address the short term unfairness encountered in the algorithms based on the totalitarian approach, WGPS implements in fact an egalitarian approach which might ac- tually lead to "too good a fairness".
Sentence 2: should 14 one terminal be experiencing very bad channel (black out), WGPS would "fairly" reduce the rate of all other termi- nals leading thus to the undesirable effect of degrading com- pletely the network throughput.
Relationship: entailment
Domain: Networks
Sentence 1: Nodes are moving with some mobility pattern; for our analytical study, we do not specify a particular mobility model, and we only require that the mobility pattern be random and independent, unconstrained, and stationary.
Sentence 2: that the velocity (speed and direction) of a node is chosen randomly from some fixed distribution and independently of that of the other nodes; that a node can freely move into any location within the network (i.e., that there are no exclusion there exists one infected node (vertex), while all the remaining N­1 nodes are susceptible.
Relationship: entailment
Domain: Networks
Sentence 1: While heteroge­neous communication systems have been considered before (e.g., in some satellite networks), our solution explores some unique op­portunities that arise in vehicular systems.
Sentence 2: we de­scribe a system called Scout that uses a front radio at the head of a vehicle to look ahead and identify the best channel parameters to be used when the rear radio eventually reaches the forward post.
Relationship: entailment
Domain: Networks
Sentence 1: Specif­ically, in [8], a sensor network deployed over a belt region (such as international borders) is said to provide k-barrier coverage if every path that crosses the width of the belt is covered by at least k distinct sensors.
Sentence 2: k-barrier coverage guarantees to detect any intruder crossing the belt (border) along any path by at least k sensors.
Relationship: entailment
Domain: Networks
Sentence 1: A second test we performed was using a TCP .ow from S12 to S01, respectively the top left corner and the bot­tom right corner of .gure 1(a), thus, passing up to 7 hops, depending on MeshDV version used.
Sentence 2: using MeshDV-HC, the number of hops was continuously .uctuat­ing between 5 and 7.
Relationship: entailment
Domain: Networks
Sentence 1: In contrast, H2 points to routing differences as the primary culprit behind occurrences of poorer IPv6 performance.
Sentence 2: promoting IPv6 and IPv4 peering parity is probably the single most effective step towards equal IPv6 and IPv4 performance Categories and Subject Descriptors C.2.1 [Computer-Communication Networks]: Net­work Architecture and Design Distributed networks;  C.4 [Performance of Systems]: Design Studies General Terms Measurements Keywords IPv6, adoption, performance, measurements * The work of the .rst two authors was supported in part by a grant from Comcast Corp. and by NSF grant CNS­1116039.
Relationship: entailment
Domain: Networks
Sentence 1: NS-BGP ensures that a route announced to a peer or provider does not change based on the presence or absence of any non-exportable (e.g., peer­or provider-learned) routes.
Sentence 2: in this example, node 3learning(32 d) (a provider-learned route) should not af­fect whether node 3 exports (3 d)to node 1 (which is also a provider).
Relationship: entailment
Domain: Networks
Sentence 1: Therefore, a cost of each link in M­route should be considered a monotonically increasing func­tion of the packet arrival rate, and on the packet distribution from K[i]to J[i] in a base station, g(p(bs,K[i])) is a monoton­ically increases for p(bs,K[i]), g(p(bs,J[i])) is a monotonically decreases for p(bs,K[i]),and G(pbs[i]), which is the sum of g(p(bs,K[i]))and g(p(bs,J[i])), is a multioptimization function of p(bs,K[i]) (see Fig.4).
Sentence 2: g(pbs[i]) has some local minimums for p(bs,K[i]) and the packet distribution meeting Eq.
Relationship: entailment
Domain: Networks
Sentence 1: An important additional feature of the gmcps model is that all these performance measures are insensitive with respect to the speci.cform of the .ow size distribution, depending on its mean D only.
Sentence 2: 4.2 Proportional fair radio access selection As is immediately clear from expressions (9), (11) and (12), the proportional fair ra selection schemes with either switched or parallel mrtd,the .ow-speci.c throughput func­tion is a more complicated function of (O,) Q and the l s. it cannot be split into distinct components comprising the e ects of Q and the l s, respectively.
Relationship: entailment
Domain: Networks
Sentence 1: We believe solving the problem of stimulating coopera­tion in the task of building and maintaining the network topology is fundamental to a successful realization of the wireless multi-hop paradigm in a non-cooperative environ­ment as this task is a necessary building block on which protocols at higher and lower layers rely.
Sentence 2: it is quite unrealistic to assume (as, for instance, has been done in [11]) that network nodes act sel.shly in performing the routing task, while they are willing to cooperate in the task of topology control.
Relationship: entailment
Domain: Networks
Sentence 1: This hierarchical well-separated tree is going to approx­imate the original graph metric G by a logarithmic distor­tion factor, in terms of the shortest path distance between any two nodes.
Sentence 2: what we propose to extract is one a-HST, chosen by a distribution D from a family S of a-HSTs such that for each HST T in the family S, the dis­tance dT (u, v) between any two nodes u, v in the tree T is greater than the shortest path length dG(u, v) in the origi­nal graph G, and that the expected distance between u, v, ET .S [dT (u, v)D(T )], taken over the distribution D on the family S of trees, is no greater than ß ·dG(u, v), where D(T ) is the probability of T in the family S. Such a family of HSTs is said to ß-probabilistically approximate the original metric G, with ß being the (expected) distortion factor.
Relationship: entailment
Domain: Networks
Sentence 1: So it is straight­forward to calculate M1, ..., Mn,to get thesame r value.
Sentence 2: in order to have fair partitioning re­gards to r value, all partitions (in our example the three partitions) should have the same fairness parame­ (P miss (P miss (P miss +Pc) +P c) +P c (in our example, ter = = (P * +Pc) 2 3 3 3 ) +P c (P miss+P c ) +P c Fig.
Relationship: entailment
Domain: Networks
Sentence 1: fI of the interference power (18) is illustrated for di.erent values of >0 .
Sentence 2: >0 is ob­tained from (11), with Ts/Tp =1000, pX (X =1) =0.5 and for >T ranging between 0.01 nodes/mm2 and 0.1 nodes/mm2 .
Relationship: entailment
Domain: Networks
Sentence 1: We de.ne BD(p) as the largest frequency component of D0(f ) that can be restored from Dp(f), i.e., only frequency components of d(k)with |f|= BD(p)can be reconstructed from dp(k).
Sentence 2: if we .lter dp(k) using a low-pass .lter with bandwidth B,such as H(f) 0.445 whose cuto.
Relationship: entailment
Domain: Networks
Sentence 1: Every time a handoff happens, management frames are exchanged at the lowest available bit-rate between the station and the AP, and they degrade network performance by increasing network conges­tion for all the clients on a particular channel.
Sentence 2: at the IETF meeting, 10% of the total wireless resources were wasted due to too many inef.ceint handoffs.
Relationship: entailment
Domain: Networks
Sentence 1: BLUETOOTH DATA ELEMENTS The Bluetooth is a byte-aligned protocol (almost all fields are a multiple of eight bits), which in many parts is similar to (but of course in detail different from) the ASN.1 Basic Encoding Rules [7] in its encodings.
Sentence 2: a type field and a length field followed by the actual value is used for what Bluetooth calls "Data Elements".
Relationship: entailment
Domain: Networks
Sentence 1: Finally, we utilize the fairness reference model to explore fairness­constrained system capacity.
Sentence 2: previous studies such as [15] consider network capacity without fairness constraints, which can result in signi.cant unfairness were a protocol to realize such a capacity: for example, in certain scenarios a capacity-maximizing strategy would give all bandwidth to one-hop .ows and starve multi­hop .ows.
Relationship: entailment
Domain: Networks
Sentence 1: The car rental agency acts as relying party R in a selective attribute disclosure transaction with A. Conversely to how such a transaction is carried out today, where R would require A to release personal data such as her name, address, or driver s license number, the rental agency will only request the attributes that are strictly necessary for renting a car.
Sentence 2: it will require a proof that A has a valid driver s license to drive the car she wants to rent as well as information that allows R to bill A.
Relationship: entailment
Domain: Networks
Sentence 1: Figure 3: How the Dk matrix is updated 3.2 Connected and Feasible states Considering the availability of routing standby fea­tures in network routers, it is necessary to introduce modi.cations to network management.
Sentence 2: during low tra.c hours, it is needed to modify network paths so that routers in routing standby nodes do not execute IP processing functionalities.
Relationship: entailment
Domain: Networks
Sentence 1: In Fig.s 4 and 5 we compare the performance of the consid­ered authenticationschemewith respecttotheinformation­theoretic bound computed in Section 3.3.
Sentence 2: we plot the PMD in terms of the number of pilot tones N for M/s2 =15and20dB, respectively, and considering P .8, d/.c =20anddi.erent values of PFA.
Relationship: entailment
Domain: Networks
Sentence 1: Therefore, the above bounds simplify to: dmin -2 = OCSP(G)= dmin -1 if dmin = d(G * );  dmin -1 = OCSP(G)= dmin if dmin < d(G * ).
Sentence 2: if d(G* ) = 1 (i.e., there is a cut-vertex in G * ), then OCSP(G)= 0, i.e., even single-node failures cannot always be localized.
Relationship: entailment
Domain: Networks
Sentence 1: Principally, such a morphological thin­ning based method, attempting to realize Blum s grass.re model [3], is very sensitive to the distance metric and typi­cally fails to accurately localize medial surface points [4], and it is also sensitive to boundary noise.
Sentence 2: a small change in boundary surface may result in a considerable change in the surface skeleton.
Relationship: entailment
Domain: Networks
Sentence 1: For an endpoint r and a node S that queries the oracle, this oracle can answer questions about membership of endpoint r up to a speci.c time t. t is the latest time that satis.es d (t S)p+t :t0 where t0 is the current time and d (t S)is the minimum delay from endpoint r to node S starting at time t5 .
Sentence 2: if endpoint r joins or leaves a group at or before time t and sends this information to other nodes by .ooding, assuming no con­tending traf.c in the network, node S should have received this information by the time of querying the oracle.
Relationship: entailment
Domain: Networks
Sentence 1: To reduce the time for establishing the tunnel between MAGs in the vehicular networks based on PMIPv6, each MAG along the road, pre-con.gures the tun­nel with its neighboring MAGs and then the tunnel will be activated when a new MN arrives.
Sentence 2: the proposed en­hanced fast handover scheme relies on the fact that the MN s direction is limited by the roads in the vehicular networks, so that highly accurate predictions can be made about which MAG the MN is going to hand over.
Relationship: entailment
Domain: Networks
Sentence 1: INSUFFICIENCY OF EXTANT ROUTING FRAMEWORKS In this section, we discuss why extant routing frameworks are insu.cient to support inter-domain routing in MANETs.
Sentence 2: we explain why a BGP-like protocol is inappli­cable in the ad hoc environment, and what in extant ad hoc routing frameworks are missing to support interoperation among multiple MANET domains.
Relationship: entailment
Domain: Networks
Sentence 1: This t-reliable protocol executes (in parallel) the (To, T1)-reliable protocol for every pair of sets of size t, and the receiver learns the message that was sent from the sender by analyzing the results of these executions.
Sentence 2: if t is constant and the (To, T1)- reliable protocol is efficient for every To, T1 of size at most t, then the resulting t-reliable protocol is efficient.
Relationship: entailment
Domain: Networks
Sentence 1: Thus, we argue that directly comparing the .nal p(k) with the PMF obtained by simulations p s(k) is not meaningful enough.
Sentence 2: it is not possible with such a comparison, as done in [13] to know whether the errors between the simu­lated and analytical PMF come from an inaccurate model or originate from the inversion of D(Z).
Relationship: entailment
Domain: Networks
Sentence 1: A 10 Gb/s link de­queues packets every 1.2 µs, which stretches the limits of to­day s hardware timers.
Sentence 2: we found that the best timer resolution offered by Linux s High Resolution Timer (hrtimer) subsystem was about 1.8 µs, whose limits depend on the frequency of the hardware clock, and its interrupt and programming overheads.
Relationship: entailment