sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: We propose that the eN­odeB assigns the PRBs only to those users (say, N<bth of them) who have bu.ered data less than a certain thresh­old, bth = µbmax (µ typically set to 0.75), and also admits N ' new users so long as the existing users are satis.ed.
Sentence 2: additional PRBs are not assigned to a user if it has enough bu.ered data to playout.
Relationship: entailment
Domain: Networks
Sentence 1: In a comprehensive simulation study using ns-2 [8], we showed that TCP-AP achieves up to 84% more goodput than TCP NewReno and provides excellent fairness in almost all scenarios.
Sentence 2: tCP-AP provides fair sharing of the available bandwidth, even when competing flows are not within each other s transmission range, but within each other s interference range, since the proposed algorithm relies on the end-to-end measurement of the interference experienced by a TCP connection.
Relationship: entailment
Domain: Networks
Sentence 1: The reason is that E2DCA allows a cautious usage of network resources, which enables low packet delays to be obtained also when the network load gets high.
Sentence 2: e2DCA dynamically allocates the bandwidth to each virtual station by taking into account the actual needs of that station, as a consequence a bounded delay service can be provided to a large number of .ows simul­taneously.
Relationship: entailment
Domain: Networks
Sentence 1: Answerstothesequestionsarecriticalfordesigningsen­sibleprefetchingorserver-initiatedpushalgorithms.Any prefetchingalgorithmbasedonpasthistoryreliesonacer­taindegreeofstability,bothinrankingandintheinterest group(i.e.,thesetofdomainsrequestingthepages).Our traceanalysishelpsshedlightonhowwellsuchreactive prefetchingalgorithmsmightperforminpractice.
Sentence 2: 5.2.1 Stability of Web Page Popularity Ranking WestudythestabilityofWebpagerankingasfollows.We considerWebaccesslogsfromseveralconsecutivedays.For eachday,wepickthenmostpopulardocuments.Wethen computetheoverlapinthemostpopularpagesselectedin onedaytothoseselectedinthenextday.Ourresultsare illustratedinFigure5.Onthex-axisisthenumberofmost populardocumentspicked(e.g.x=10meanswepickthe10 mostpopulardocuments),andonthey-axisisthepercent­ageofoverlap.Figure5(a)plotstherankingstabilityina weekperiod.Wemakethefollowingobservations.First,the overlapismostlyover60%,whichessentiallymeansmany documentsarehotonbothdays.Second,fortheseveral consecutivedaysperiod,theoverlapismostlythesame.For example,theamountofoverlapbetween8/1/99vs.8/2/99 isquiteclosetothatbetween8/1/99vs.8/5/99.Thisim­pliesthattheWebaccesseswithinashorttime-frame(such asaweek)areequallygoodforpredictingwhichWebpages willbeamongthemostpopularinthenearfuture.lastweek'straceisalmostasusefulasyesterday'strace forpredictingWebpagesranking.Thishappensbecause manyoftheverypopularpagesareindexpages(suchas thedefaultfrontpagefortheMSNBCsite)thatcontain pointerstootherpages.Third,therankingstabilitytends todecreaseasthenumberofdocumentsselectedincreases.
Relationship: entailment
Domain: Networks
Sentence 1: These two metrics are critical in determining the delay and capacity of the network, as well as choosing various schedul­ing/forwarding algorithms.
Sentence 2: the inter-meeting time of two nodes is a major component of the end-to-end delay in MANET [15, 13, 14, 31, 32, 33], as it denotes how long it takes to encounter the other mobile node to have any chance to relay/forward the data for communications.
Relationship: entailment
Domain: Networks
Sentence 1: If we apply the Proposition to a neighborhood of 100 nodes with a period tw = 1000 ms, the estimation error introduced by a measurement delay E = 1 ms is 0.101 T(- = -0.09).
Sentence 2: 1 + 0.101 with a measurement error of just 1 ms, the estimation error is 9%.
Relationship: entailment
Domain: Networks
Sentence 1: Energy Saving and Network Performance: a Trade-off Approach Carla Panarello Al.o Lombardo Giovanni Schembra Dipartimento di Ingegneria Dipartimento di Ingegneria Dipartimento di Ingegneria Informatica e delle Informatica e delle Informatica e delle Telecomunicazioni Telecomunicazioni Telecomunicazioni Università di Catania -Italy Università di Catania -Italy Università di Catania -Italy cpana@diit.unict.it alombard@diit.unict.it schembra@diit.unict.it Luca Chiaraviglio Marco Mellia Dipartimento di Elettronica Dipartimento di Elettronica Politecnico di Torino -Italy Politecnico di Torino -Italy luca.chiaraviglio@polito.it mellia@tlc.polito.it ABSTRACT Power consumption of the Information and Communication Technology sector (ICT) has recently become a key chal­lenge.
Sentence 2: actions to improve energy-e.ciency of Internet Service Providers (ISPs) are becoming imper­ative.
Relationship: entailment
Domain: Networks
Sentence 1: 8 7 A major difference between our approach and CRC HOLSRis thatwe use onlyHNA messages for both inter-clusterand intra­ cluster topology dissemination, while hierarchical TC messages are used for inter-cluster topology dissemination in CRC HOLSR.
Sentence 2: no modificationsto HELLO and TC messages, or MPR selection, are foreseen with our approach.
Relationship: entailment
Domain: Networks
Sentence 1: Similarly, when there are topology changes that result in the additions of edges and/or vertices from the graph G in our model (e.g., due to the establishment of a new AS or a new BGP peering relationship), we note that our proof of Theorem 3.3 still holds for the new routing instance after the topology changes, as long as they do not violate the topol­ogy and export conditions.
Sentence 2: the new vertices and/or edges do not create customer-provider cycles and they fol­low the export only customer routes to peer or provider export policy.
Relationship: entailment
Domain: Networks
Sentence 1: This occurs when the additional experiments reveal no new surprises, in the sense that the probabilities of the various outcomes of an experiment converge to a fixed point.
Sentence 2: the formulation of marginal utility given in equation 6 assumes that the evaluation of marginal utility is done in an online fashion, we evaluate the marginal utility of experiment S before conducting any additional experiments Sk, Ic > n. An alternative formulation of marginal utility evaluates each experiment on an ex post facto basis, measuring each experiment s usefulness offline after all experiments have been conducted.
Relationship: entailment
Domain: Networks
Sentence 1: According to the aforementioned two properties, the number of reconstructed sub­trees does not exceed three in each round and a proxy node with lower tree level has the higher priority to execute tree reconstruction.
Sentence 2: only a proxy node with lowest tree level will select a share point to connect a source in its sub-tree and the other two sources in different sub-trees or the same sub-tree in each round.
Relationship: entailment
Domain: Networks
Sentence 1: In this regard, the SDPP module at the local host can coordinate communications with remote DAs by controlling SLPv2 through the use of APIs.
Sentence 2: sDPP can instruct SLPv2 to issue the corresponding signals for service (de-)registration (SRV_REG/DEREG) as needed, in addition to those required to discover the presence of other DAs, as explained shortly.
Relationship: entailment
Domain: Networks
Sentence 1: where E¯H (n)[ .u(n) 2] " lim supn EH (n)[ .u(n) 2].
Sentence 2: it then fol­lows from the conditions on sn in (12) and the boundedness of .u(n) that m {} lim Pr sup sn .u(n) = E=0, .E> 0. m.8 n=n0+1 the accumulated distance deviating from u (n0 + 1) is almost surely less than E. It then follows that the trajectory resides in B3E with probability one.
Relationship: entailment
Domain: Networks
Sentence 1: Our TCP injection tech­nique is independent of the victim s operating system, and allows the attacker to bypass the browser s same origin pol­icy (SOP) defense [5, 28, 36].
Sentence 2: this allows in­jection of web-pages and scripts in the context of a third­party web-server, and can be exploited for cross-site script­ing (XSS), cross-site request forgery (CSRF) and phishing attacks without relying on a vulnerability in the web-server.
Relationship: entailment
Domain: Networks
Sentence 1: It will put its own neighbors information into RREQ (RREQ_I) to displace the neighbors information of S besides of the operation described in above paragraph and then rebroadcast this RREQ (RREQ_I) message to other MNs.
Sentence 2: else if M doesn t find its information in the message, it will conclude that S can arrive at it but it can t reach S. the link between them is a unidirectional link.
Relationship: entailment
Domain: Networks
Sentence 1: Though information is not strictly additive, the  sum of individual informationI(vk) can often be consid­ered as a reasonable approximation of I(v1, ··· ,vT )in cases where the belief state varies slowly.
Sentence 2: one can show that, with mutual information as the information met­ric (2), the former is an upper bound of the latter.
Relationship: entailment
Domain: Networks
Sentence 1: To this end, we would like to "stage" the re-profiling task in two steps: (i) to understand what observations could trigger the re-profiling so no unnecessary re-profiling is performed and (ii) to determine a possible small subset of loca-tions that, upon being re-profiled, result in improved localization.
Sentence 2: we imply a semi-automatic process whereby the task (i) is performed automatically and then a set of points to-be-re-profiled is prepared (again automatically) and provided to either human operators to conduct the task (ii) or, even, with an operator in the loop, choices for points to re-profile are given and acted upon.
Relationship: entailment
Domain: Networks
Sentence 1: However, while the antenna hardware itself will soon be ready for the deployment at mobile stations, existing higher layer protocols may not be able to fully exploit the potentials of directional antennas.
Sentence 2: recent studies on the use of directional antennas in mobile ad hoc networks, or MANETs, have shown significant increase in network capacity by improving the spatial reuse, but effective extension of communication range has not been successfully demonstrated, which is another benefit of directional antennas in the cellular networks.
Relationship: entailment
Domain: Networks
Sentence 1: This ap­proach is computationally e.cient as it only involves appli­cations of a shortest-path algorithm.
Sentence 2: moreover, it is also en­ergy e.cient as we observed in Section V. the LD-ESP algorithm, which .nds energy e.cient link-disjoint paths sequentially, performed very close to the optimal al­gorithm.
Relationship: entailment
Domain: Networks
Sentence 1: We repeated the above procedure (initial measurements for cal­ibration) on a different day and we observed that FS did not com­pletely isolate cells as before.
Sentence 2: we observed that: (i) After the convergence of the FS algorithm, the access points AP31 and AP48, (which are in close proximity) selected the same chan­nel (5.32 GHz); (ii) AP50 had 2 more clients than AP31; (iii) AP48 had 4 clients and the RSSI from its farthest client, 40-48, was at ­69 dBm, while the RSSI for the AP-AP link 48-31 was at -70 dBm.
Relationship: entailment
Domain: Networks
Sentence 1: PROBLEM FORMULATION AND IMPLEMENTATION 2.1 Nonlinear functions selection For this study nonlinear functions were selected of nd rd 2and 3order with saddle points, which offers sufficient challenge for achieving approximation via 3-in-1-out MLP geometry.
Sentence 2: the first function was the standard saddle surface or hyperbolic paraboloid z=x 2-y 2, shown in Fig.
Relationship: entailment
Domain: Networks
Sentence 1: Instead, the edge costs are calculated on-demand, by A j--At precalculating the partial sums, Ai.
Sentence 2: c~,j = ~,+~ 116 B(Mbits/sec) 6 I l I I 5.5-% , FUSS (peak:4.68Mbitslsec,avg:O.68Mbits/sec) 5- 4.5 ' TV_I (peak:5.73Mbits/sec,avg:O.61Mbits/sec) 4 3.5 I ± ~'-.
Relationship: entailment
Domain: Networks
Sentence 1: 3.2 Analyzing the Loss Conditioned Delay We are interested in learning if the tcpRTT sample prior to loss (or perhaps the average of some small number of tcpRTT samples prior to loss) is greater than a smoothed average of preceding tcpRTT samples.
Sentence 2: we want to know how frequently loss events in a connection might have been predicted by monitoring R'VI'.
Relationship: entailment
Domain: Networks
Sentence 1: Although a number of Stat4 targets involved in Th1 cell development and T cell receptor signaling was characterized by Good et al, this study pointed to a large proportion of genes that showed lack of consistency between Stat4 binding and induction of target gene expression [5].
Sentence 2: a strongly binding target gene regulatory sequence did not necessarily induce high levels of target gene expression and conversely a weak binder did not always show poor expression.
Relationship: entailment
Domain: Networks
Sentence 1: EM-MAC achieves high energy ef.ciency by enabling senders to accurately predict the wake-up channel and wake-up time of a receiver.
Sentence 2: each time a node using EM-MAC wakes up, it independently selects its own wake-up time and channel ac­cording to a pseudorandom function, while avoiding undesirable channels on which it has detected high traf.c loads or excessive wireless interference, including channels being actively jammed.
Relationship: entailment
Domain: Networks
Sentence 1: Hence, while we contend that it may well be possible to evolve the data-oriented architectures so that they can be bootstrapped off from the current policy structure, we also note that the present policy-constrained inter-domain paths of the Internet are often not the shortest ones [22], or the ones with the best performance [20].
Sentence 2: we surmise that the richer network service model, provided by the data­oriented network architectures, opens up the possibility of using more ef.cient policies, leading to better network uti­lization and lower costs; see Section 5.
Relationship: entailment
Domain: Networks
Sentence 1: Given the matrices of the known initial positions of the G =1m/s) and current velocities are considered.
Sentence 2: we consider 33 3 .s = 2000 kg/m , .g = 2500 kg/m , Vs =0.5 · 10-3 m , and Vg =10-3 m 3 to account for the common physical charac­teristics of underwater sensor nodes and uw-gateways, which re­.ect into different sinking properties, as formalized in (11).
Relationship: entailment
Domain: Networks
Sentence 1: Notice that the tree metric T ' again dominates the original metric as we are only relaxing the edge weights.
Sentence 2: the edge connecting a node on level i in T ' to 1 +1 -2j its parent has weight ai, with 2j1 -2j = ai < 2jby construction, where j is level i s corresponding level in T and j' is level (i +1) s corresponding level in T .
Relationship: entailment
Domain: Networks
Sentence 1: In support of this effort, the Internet Engineering Task Force (IETF) recently speci.ed a number of protocols and adaptation layers that allow IPv6 to run over IEEE 802.15.4 link layers.
Sentence 2: the 6LoW-PAN working group speci.ed header compression and frag­mentation for IPv6 over IEEE 802.15.4 [16] and the IETF RoLL working group designed the RPL protocol as a pro­posed standard for IPv6 routing in low-power and lossy net­works (LLNs) [21, 22].
Relationship: entailment
Domain: Networks
Sentence 1: These attacks enable a party monitoring one (or more) paths used by  Figure 1: A scenario illustrating competing single-path TCP (SPTCP) and MPTCP connec­tions MPTCP sub.ow(s) to infer properties of other paths.
Sentence 2: such attacks can allow ISPs to infer sen­sitive and proprietary information (e.g., level of conges­tion, throughput, packet loss, round trip time) about their competitors [4].
Relationship: entailment
Domain: Networks
Sentence 1: In the pipelined-lookup approach, a d-dimensional packet search is separated into d searches, which are further pipe­lined.
Sentence 2: the d TCAM chips are chained together into a pipeline such that the search result of the i-th chip is part of the searchkey forthe(i +1)-st chip, and the result of the last chip isthedecisionforthepacket.
Relationship: entailment
Domain: Networks
Sentence 1: THE IMPACT OF ECN+ ON AQM PER-FORMANCE 4.1 AQM Algorithms While ECN+ is a generic extension to ECN that should improve the performance of all ECN-enabled AQM schemes, we necessar­ily limit our performance evaluation to a subset of AQM schemes.
Sentence 2: we evaluate the impact of ECN+ on Random Early Detection (RED) [15], Random Exponential Marking (REM) [8], and Proportional Integrator (PI) [19].
Relationship: entailment
Domain: Networks
Sentence 1: In other words, i,j i,j Ei,j ' =1, if vi cannot send a message directly to vj ,other­wise E ' =0.
Sentence 2: i,j We will show that ABEM is not secure in our model for security objective function FABEM .we present a con.guration conf andanadversary A,for which there doesn t exist any ideal-world adversary A ' ,such real,FABEM that Out is statistically indistinguishable from conf ,A ideal,FABEM Out .
Relationship: entailment
Domain: Networks
Sentence 1: when K< 1-1 1-log n where c =( m)mbm yy -log( ) cc and n ... 8 If we compare the results of Theorem 4 with Theorem 1, we notice that if K = D(log n) and n is su.ciently large, the performance of the greedy coloring algorithm is within a constant factor (roughly 2) away from the best possible value.
Sentence 2: the maximum possible loss due to the use of the greedy coloring algorithm is bounded by a constant.
Relationship: entailment
Domain: Networks
Sentence 1: The traf.c load from ACi on each maximal clique is: zi =F yi =[zi1,zi2, ···,ziM ]T ,i =1, 2 (5) A new .ow can be accepted only when the total traf.c load on each maximal clique does not exceed the available capacity ci in that clique.
Sentence 2: zi = .i ci, i =1, 2 (6) where 0<.i < 1and is a tunable parameter.
Relationship: entailment
Domain: Networks
Sentence 1: Optically routing a tra.c component will dedicate a wavelength on the two links it traverses to it, so this decision a.ects the decisions for other tra.c components.
Sentence 2: after dedicating the wavelengths required for the tra.c components which must be routed optically for any source node, the remain­ing wavelengths must be su.cient to carry all other tra.c sourced by that node to the hub node.
Relationship: entailment
Domain: Networks
Sentence 1: Video seconds with (a) 12 nodes at 10 m/s and (b) 18 nodes at 18 m/s Figure 7(a) shows the amount of received video in a scenario with 12 nodes moving with an average speed of 10 m/s.
Sentence 2: it represents the accumulated seconds of video received by the client at every second of the experiment duration.
Relationship: entailment
Domain: Networks
Sentence 1: 2.1 Wireless Transport Optimization We note that proxy-based transport optimization for last­hop wireless networks has a long history, with the majority of the research [4, 15] focusing on optimization of TCP over last-hop wireless networks.
Sentence 2: [15] showed that while 3G network packet losses can indeed be successfully overcome by using ample link layer retransmissions, the re­sulting large RTT mean and variance may severely a.ect the performance of a TCP-like congestion avoidance rate control that is based on end-to-end observable statistics of RTT and PLR.
Relationship: entailment
Domain: Networks
Sentence 1: For l2, we repeat the same process we went through for l1.
Sentence 2: either l2 prefers the two-edge su.x of l1 over any other feasible path (in which case we set e2 to be l1, and are done), or we move on to l3 (which is the .rst edge of l2 s most preferred path s two-edge su.x).
Relationship: entailment
Domain: Networks
Sentence 1: Inparticular, for a binomial random variable X with mean µ = tp, it can be shown[14,pp.70] that: -µd2/2 P(X< (1- d)µ)<e ,0  ne.
Sentence 2: substituting into(5) yields: -t ne ' [1-]2 P(W >t)= P(Xt =2ne)<e 4 P nNoting that W = i=1 Wi, where each Wi is geometrically distributed withparameter atleast1/e, itis easy to see that 4 P(W>t)= P(W ' >t)<e -n It is easy to see that the bound on the right hand side goes to 0 for large values of n. W = 2ne w.h.p.
Relationship: entailment
Domain: Networks
Sentence 1: Although a single load balancing enabled router may potentially damage the au­thenticity of all trace paths passing on it, the e.ect is not thesamefor tracenet because tracenet is based on the stable ingress router concept rather than stable path trace con­cept.
Sentence 2: as long as two packets destined to two di.er­ent IP addresses on the same subnet enter into the subnet through the same ingress router we are not interested if they took the same path or not.
Relationship: entailment
Domain: Networks
Sentence 1: However, there is currently no formal analysisthatquanti.esprecisely howthe servertraf­.c behaves.
Sentence 2: there are currently no answers to very basic questions such as: (1) How fast does the band­width available at the server has to grow as the number of usersincreases,(2) howdoesthetra.cloadimposed onin­dividual usersgrowasa functionof theuserpopulation,and (3)to what extend can we establish a tradeo.
Relationship: entailment
Domain: Networks
Sentence 1: In addition, 4.1 Network Model for Multi-Dimensional Re- X N Although the original network model introduced in Sec­ n=1 X Nn=1 sources (p,a) pnfa(v¯)= pnfa(vn), (14) tion 2.1 is de.ned using a one-dimensional resource measure, the remainder of the present paper uses a network model and equivalently that is de.ned using a multi-dimensional resource measure.
Sentence 2: x Nn=1 pn the resource is de.ned as an I-dimensional vector (p,a) fa(v¯)= fa(vn), (15) PN m=1 as follows: Let N be a set of users who have to compete for pm the resources, where N denotes the cardinality of N .
Relationship: entailment
Domain: Networks
Sentence 1: Under the out-home condition in De.nition 7, before re­turning back to site 0, the conditional distribution of {1,..., N}(given that the node has not visited site 0) always remains the same.
Sentence 2: in fact, when the graph G{0} (after removal of site 0 and all its edges from G)is non-bipartite [35], it out can be shown that tp0 is the stationary distribution of ran­dom walk on this resulting graph G{0}.if pi(t) is the probability that the node is at site i at time t,[p1(t),...,pN (t)] converges to tp out 0 under a conditioning event that the node never visits site 0.
Relationship: entailment
Domain: Networks
Sentence 1: These anomalies might indicate malicious activity or mas­sive scanning strategies.
Sentence 2: for outgoing client data, points corresponding to a very large number of client­to-server connections (kout,c ) and a very low volume of out­going tra.c (sout,c ) would imply some sort of scanning ac­tivity, for example, a project trying to estimate the density of Web servers in assigned IP space.
Relationship: entailment
Domain: Networks
Sentence 1: To guarantee the stability of the diamond relay network, the corresponding condition given in Qing, Pingyi and Khaled s work [4] has to be satis.ed.
Sentence 2: u>u and D>d (15) Actually, this condition is a simpli.ed form under the con­dition that the average SNR of the four links are almost the same.
Relationship: entailment
Domain: Networks
Sentence 1: Assuch,techniquessuch asWeb caching[6,13] are commonly used to reduce the tra.c demands of these en­vironments, but it may be di.cult to gauge the e.cacy of these approaches as the Web evolves and tra.c character­istics change.
Sentence 2: web proxies cache entire ob­jects(HTMLtext,images, etc.)
Relationship: entailment
Domain: Networks
Sentence 1: For such networks, the rate region is a (convex) polytope formed by the intersection of a .nite number of linear capacity con­straints, and it has been shown that all a-fair allocations with a>0 provide .ow-level stability if and only if the vec­tor representing the average tra.c intensities of .ow classes lies in the rate region.
Sentence 2: the rate region in the utility maximization problem is also the stability region under .ow-level stochastic dynamics.
Relationship: entailment