sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: Intuitively, to guarantee that the .nal decision aggregation at the sink node is legal, each decision arriving at the sink should have a weight smaller than or equal to W =ldWT J (where WT denotes the total weight of all the sensor nodes on the aggregation tree).
Sentence 2: at any nonleaf node ex­cept the sink, the summation of the weights of all the input decisions involved in any aggregation must not exceed W .
Relationship: reasoning
Domain: Networks
Sentence 1: For an underwater acoustic channel, its average path loss is given by A(d, f)=daß(f)d , (2) where d is the distance of the acoustic channel; a is the spreading factor (1= a = 2); and ß(f)is the absorption coef.cient which is determined by the frequency of the acoustic channel f. In this paper, we assume that all nodes work in the same frequency band.
Sentence 2: ß(f )will be the same for all nodes.
Relationship: reasoning
Domain: Networks
Sentence 1: It is rele­vant for network operators as JP will be deployed mainly in areas with high tra.c demand due to economical reasons.
Sentence 2: di.erentarchitectures mightbebetter suited for certaindeployment scenariosdue totheshapeoftheircover­agearea, e.g.,becausethey matchtheshapeof acity center.
Relationship: reasoning
Domain: Networks
Sentence 1: This implies thatiftheroot does not receive a topology update from a particular node within timeout, the root removes that node from the tree and .ushes it s network state.
Sentence 2: the usage of topology updates at the root is two-fold: (1) periodically refresh the routing state ofthenode(2)periodically refreshthe neigh­borhood information of the node for the network and the interference graph data structures.
Relationship: reasoning
Domain: Networks
Sentence 1: Note that the partition is done on-line according to the lengths of P and Q, so each cell in the array must be able to read the data from the primary inputs directly, and be able to propagate the data to the primary outputs directly to .nish the .nial step of the modular multiplication.
Sentence 2: we use some switches, MUXes, and a control signal to achieve the goals.
Relationship: reasoning
Domain: Networks
Sentence 1: With the extremal nodes identi.ed, we also need to know their relative orderings to connect them to a consistent bound­ary.
Sentence 2: this ordering can be derived from the ordering of the nodes on R. Speci.cally, for each node on R, we assign a label in [0,L] that indicates its position on R. A node uthat is k hops away from R may have multiple neighbors (k- 1) hops away from R. the label of u, J(u), is taken as the average of the labels of all of its neighbors that are (k- 1) hops away from R. Each node in the network records the distance to R as well as its label.
Relationship: reasoning
Domain: Networks
Sentence 1: data rate, 60 consecutive packets roughly correspond to 1­second worth of streaming.
Sentence 2: the .gure shows that on Cuatro channel, 20% of peers have their sub-streams com­pletelyin-sync,while morethan90%havetheirsub-streams lagging each other by at most 5 seconds; on ARD channel, 1 30% arein-sync,and morethan90% arewithin1.5 seconds.
Relationship: reasoning
Domain: Networks
Sentence 1: 5.5 TLS/SSL Speedups Although the TLS protocol has a resume handshake that signi.cantly reduces the handshake tra.c and latency, it re­quires the server to store the TLS session in its cache.
Sentence 2: many servers store the TLS session only for a short period of time resulting in the full handshake being used instead.
Relationship: reasoning
Domain: Networks
Sentence 1: The packet loss ratio is then estimated as n-1 .
Sentence 2: the avail­ M-1 ablebandwidthofthe link mustbescaledwiththefollowing factor: 1- (n-1) M-n = ,n = M (M-1) M-1 K = (13) 0, n>M In Eq.
Relationship: reasoning
Domain: Networks
Sentence 1: For this paper, we assume that .rewalls have the most restrictive se­mantics the same as symmetric NATs in they cannot communicate with other symmetric NATs or .rewalls.
Sentence 2: links between two Resource Index 3 2.5 2 1.5 1 0.5 0 0 102030405060 Stream Figure 8: Resource Index for multiple trees.
Relationship: reasoning
Domain: Networks
Sentence 1: Similarly, the middleware can determine if a noti.cation for a certain street (given by name) or highway segment (given by name and km-range), or a noti.cation concerning the whole city, overlaps with its suggested route.
Sentence 2: a large number of subscriptions can be matched by our middleware according to the location and the destination of the vehicle, in order to determine if a received noti.cation is relevant or not.
Relationship: reasoning
Domain: Networks
Sentence 1: For simplicity, we assume that the power costislinear: ci( p)= ci p. The terminal can .nd the optimal amount of power for SC n as * the solution x to the single-variable equation R ' i,n(x)= ci/ßi.
Sentence 2: of course, the amount ordered by the terminal cannot exceed the total amount ofpowerthat remains atthetransmitter(considering any * amount allocated to previous winners), say P. with p := i,n * max(P, x * ), the terminal valuation of this SC equals ßiRi,n( pi,n) - * ci p , andfrom this, under the assumptions of sub-section3.3, the i,n bid follows directly.
Relationship: reasoning
Domain: Networks
Sentence 1: RILAnalyzer: a Comprehensive 3G Monitor On Your Phone Narseo * Vallina-Rodriguez ICSI narseo@icsi.berkeley.edu  Yan GrunenbergerTelefonica Research yan@tid.es Andrius Aucinas Mario Almeida Computer Laboratory Telefonica Research University of Cambridge 4knahs@gmail.com  andrius.aucinas@cl.cam.ac.uk Konstantina Jon Crowcroft PapagiannakiComputer Laboratory Telefonica Research University of Cambridge  dina@tid.es jon.crowcroft@cl.cam.ac.uk ABSTRACT The popularity of smartphones, cloud computing, and the app store model have led to cellular networks being used in a completely di.erent way than what they were designed for.
Sentence 2: mobile applications impose new chal­lenges in the design and e.cient con.guration of constrained networks to maximize application s performance.
Relationship: reasoning
Domain: Networks
Sentence 1: If NINA is supported in the Nested NEMO then its routes can be relied upon and the CoA of each MR does not need to be recorded.
Sentence 2: in a Nested NEMO where NINA is supported by all of the MRs that a packet traverses out to the Internet, the principal role of the RRH protocol is to record the actual CoA of the originating MR and the topologically correct CoA of the Gateway-MR and report it to the MR s HA.
Relationship: reasoning
Domain: Networks
Sentence 1: N We also use Ri to denote the number of recurrences that occur at X 1{Tk/c 2 k}(1 - Xk) (16) state i. Ri is actually a geometric process.
Sentence 2: hence, the expectation = E k=1 on Ri is  X + k=1 k=1 1 m X 1{N 2 k, Tk/c 2 k}(1 - Xk) k · p k i (17)= EE(Ri) = · (1 - pi) = = (26) 1 - pi m - i X the expectation on T2 under assumption A1, E(T2|A1), is E [1{N 2 k, Tk/c 2 k}(1 - Xk)] , (18)= k=1 E(T2|A1) = m(Trsp + Tinf + Tidle) + , (27) wherewhere we have used Fubini s Theorem to interchange the expectation m-1 and in.nite summation.
Relationship: reasoning
Domain: Networks
Sentence 1: 3.4 Discussion As discussed in preceding subsections, the e.ectiveness of FEC depends on how the server uses redundant packets based onpacket-lossdynamicsofnetworkpaths.
Sentence 2: non­adaptive FEC schemes that use a .xed amount of overhead encounter signi.cant quality degradation if packet loss .uc­tuates as often observed in the Internet.
Relationship: reasoning
Domain: Networks
Sentence 1: The variation of average relative speed with Vmax is shown in .gure 11.
Sentence 2: the Probability Density Function (PDF) of the path duration across most of the mobility models used in our study can be approximated as an exponential distribution4: -.0hV f(x)= e R (2) .0hV x R The Cumulative Density Function (CDF) of the path du­ration across the mobility models used in our study can be approximated as follows: -.0hV F (x)=1 - e R x (3) In the next section, we show the utility of average path 4We conducted the Kolmogorov Smirnov test on these PDFs.
Relationship: reasoning
Domain: Networks
Sentence 1: 6.3 Handover Latency Study Considering MIPv6, in our proposed scenario described in Figure 7, the latency will be 1) the time required to send the BU and receive the BA through the wireless medium, plus 2) the time required by the BU to reach the HA who forwards the packet to the MN, plus 3) the time required by the BA to reach the current nAR, plus 4) the time required by the forwarded packet to arrive at the current nAR and plus 5) the delay caused by the wireless part to send the packet to the mobile node.
Sentence 2: the handover latency performing a handover from the AR to the nAR in MIPv6 can be computed through the following formula: dw + dw + dHA-nAR + dHA-nAR + dHA-nAR + dw (1) where dw denotes the delay introduced by the wireless part.
Relationship: reasoning
Domain: Networks
Sentence 1: Using this optimization reduces the pruning time substantially from 1800 s to 110 s for AS3356-aug. 8.4 Accuracy of the DynHandler As discussed in §6, proxies create the most number of challenges in terms of dynamic behaviors they create/multiplex sessions and change packet contents.
Sentence 2: we focus on the accuracy of the DynHandler in inferring correlations between responses from the web servers to a Squid proxy and from the Squid instance to the individual users.
Relationship: reasoning
Domain: Networks
Sentence 1: Flows in application 1 (sets A1 and B1) were assignedrates proportional to their demands, and .ows in application2 (sets A2 and B2) were assigned rates limited by their de­mands.
Sentence 2: notice that even though .ows in A1 and A2 had the same demand, they each get different rate alloca­tions because the applications use different capacity alloca­tion policies.
Relationship: reasoning
Domain: Networks
Sentence 1: In addition, if the spoofer sends more data to the client than the dummy host (i.e., the dummy host), the censor can detect the inconsistency of the sequence numbers as long as the dummy host sends any packet to the client2 .
Sentence 2: the spoofer has to use the se­quence numbers that have already been used by the dummy host (i.e., injecting packets as resent packets ).
Relationship: reasoning
Domain: Networks
Sentence 1: The model highlights that the duration of a round strictly depends on the amount of bits transmitted by the reader (in the inven­tory message) and by the tag (in the response message).
Sentence 2: the duration of an idle round (that does not involve any tag response) is shorter than the time taken by an identi.cation or collision round, that involves the trans­mission of tag s ID.
Relationship: reasoning
Domain: Networks
Sentence 1: In this paper, we present mechanisms and design of a pro­totype that allows game-context based VoIP communication between players.
Sentence 2: in addition to allowing players to talk to each other to coordinate teammates and activities (through a static team-based audio conference) as in some of the current systems, it supports communication among players based on shared contexts like the same physical lo­cation or room within the gaming environment.
Relationship: reasoning
Domain: Networks
Sentence 1: Instead, when data rategoes up and overcomes its mean value, the accorded transmis­sion time is not suf.cient to dispatch the incoming streams and to absorb bursts of traf.c.
Sentence 2: transmission queues length increases,jeopardizing the assuredQoS and real-time networkper­formance, expressed in terms of end-to-end delay, is worse.
Relationship: reasoning
Domain: Networks
Sentence 1: Unlike in the case of mini­mal routing, where it has been proved that two VCs are adequate to break deadlock cycles [16], there is no such property in unre­stricted (potentially non-minimal) routing.
Sentence 2: we for­mulate the deadlock-free VC assignment problem as an integer lin­ear programming (ILP) problem which takes the number of VCs as one of its inputs and answers the question Can we avoid dead­locks using the given number of VCs?
Relationship: reasoning
Domain: Networks
Sentence 1: The challenge is that the wireless channels may constantly .uctuate such that it is often not possible learn the actual optimal rates during the experiments.
Sentence 2: we design emulated channel experiments in which the nodes are very closely located such that real packet losses are rare; arti.­cial packet losses and partial packets are introduced by inserting errors to certain packets according to the emulated channel condi­tions.
Relationship: reasoning
Domain: Networks
Sentence 1: Eef f can be derived from the delivery rate r and the total number of transmissions t.Let psrc be the number of pack­ets sent by the source, etx and erx the amount of energy required by a node to transmit and receive a packet, and ere the energy used to read only the header of the packet (for early rejection).
Sentence 2: given that we are assuming a random distributed topology, the expected number of neighbors can be considered as a constant n. the total amount of energy consumed by the network for each transmitted packet is given by: etotal = etx + erx +(n- 1)ere (2) Subsequently, Eef f is given by: Eef f = psrc r kt (3)  Where k is a constant which includes etotal and a conversion factor for energy units.
Relationship: reasoning
Domain: Networks
Sentence 1: The sup­ optimal configurations (with six and eight cores), where we have three and four couples of Rx and Tx gigabit interfaces, show a performance decay; with six cores we achieve a maximum 99% 68% 40% throughput equal to about 4.4 MPkts/s, while the SR forwards up to 5.9 MPkts/s in the setup with eight cores, which corresponds to about the 70% of the maximum theoretical throughput.
Sentence 2: while optimal SR configurations can achieve the full rate speeds, 600 400 200 even the sub-optimal configurations guarantee a high performance UP SMP 1CPU SMP 2CPUs level.
Relationship: reasoning
Domain: Networks
Sentence 1: Station D forwards .ow1 to station C and .ow2 to station A.
Sentence 2: in this ex­ample, the link rate of (D, C) is larger than the one of (C, B) and C can not forward the packets to B asfast as it receives them from D. C sbuffer level is soon above the critical thresh­old and it sends a congestion control message to D and B.
Relationship: reasoning
Domain: Networks
Sentence 1: C, it will compare its own distance discriminator to the desti­nation node F with the DDbits, thus determining that the packet must not be forwarded using conventional routing ta­bles, but cycle following tables.
Sentence 2: b will forward the packet over IBA following c3, which will bring it to C after being forwarded by A.When C tries to forward the packet though ICB, the termination condition will be triggered, and C will compare its own distance to F with the DDbits, thus determining that cycle following must continue.
Relationship: reasoning
Domain: Networks
Sentence 1: When an attacker sends polluted packets with hv = h in some time interval, for the next a(1 - hd ) time intervals its pol­lution attacks will be ineffective (polluted packets will be veri.ed and dropped by its .rst-hop neighbors).
Sentence 2: its pollution success frequency is at most 1/(a(1 - hd )+1).
Relationship: reasoning
Domain: Networks
Sentence 1: The utility function for a user is de.ned as the ratio of the user s goodput to its transmit power, i.e., Tk uk = , (10) pk where the goodput Tk is the number of bits that are trans­mitted successfully per second and is given by Tk = Rkf(.k).
Sentence 2: (11) the utility function for user k is given by f(.k) uk = Rk .
Relationship: reasoning
Domain: Networks
Sentence 1: Theseapproaheshavetheadvantagethatnospeialsoft­wareneedstobedeployedonrouterstogathertiminginfor­mation,butunfortunatelytheymaynotworkinallpartsof theInternet.BeauseofmalevolentuseofICMPpakets, someroutersandhostseitherrate­limitthemorflterthem out[16],thusslowingdownorpreludingmeasurement.
Sentence 2: anotherproblemisthatbridges,hostoperatingsystems (OSs),andnetworkinterfaeards(NICs)areusuallystore­and­forwardnodesbutdonotderementtheIPTTLand arenotindividuallyaddressableinIP.the linksorrespondingtothese"invisible"nodesannotbede­tetedormeasuredusingtheIPTTLderementmethod itedabove.Thereisanodebetweenthesoureapplia­tionandthesoureoperatingsystembeausethesending OSusuallymustopypaketsfromtheappliation'sad­dressspaetothekernel's.Inaddition,thesoureOS's networkarddriverusuallymustopythesentpaketfrom kerneladdressspaearossthesystembustotheNIC.Fi­nally,ifthedestinationisaPC,thepaketusuallymustbe opiedfromthedestination'sNICtothedestination'sker­neladdressspae.Theappliation.kernel,kernel.NIC,and NIC.kernelopiesusuallymustbeindividuallyompletebe­forethepaketanbeforwardedanyfurtherinthepipeline.
Relationship: reasoning
Domain: Networks
Sentence 1: if 1 + .dlk.=m =M + .dlk., fR lk(m)= 0 otherwise.
Sentence 2: in time slot t, if the m-th position on link l carries a symbol payload, then the fL lk(m)-th positions lk(m)-th and fR on interfering link k cannot carry a symbol payload.
Relationship: reasoning
Domain: Networks
Sentence 1: 4 compares the scenario in which both C1 and C2 have one copy of the searched content with the scenario in which C1 has two copies, i.e., m1 =2 and m2 =0.For µx/µi < 1,which is the expected operating region according to the notion of commu­nity, intra-community meetings are more dominant.
Sentence 2: the search takes shorter when C1 holds both copies.
Relationship: reasoning
Domain: Networks
Sentence 1: We see similar increases in average play times when Age 3 and Age 4 were released on November 17, 2009 (day 380) and October 31st, 2010 (day 728) respectively.
Sentence 2: as the game becomes more popular and usable (more features and bug .xes, better UI and gameplay), it increases the average time users spend playing the game.
Relationship: reasoning
Domain: Networks
Sentence 1: Within the remaining three patterns, T-shaped array appears to have slightly better performance than the others, for the reason that have been studied in Section 3.3.
Sentence 2: 1 Linear Array Circular Array 0.8 Cross Array T-shape Array 0.6 the angle spectrum measured by iLocScan at given point in time corresponds only to one AP; this enables iLocScan to obtain three separated angle spectra shown in Fig.
Relationship: reasoning
Domain: Networks
Sentence 1: The goal of the Vegas con­gestion avoidance algorithm is to keep this number within a .xed range de.ned by two thresholds, a and ß.
Sentence 2: once every RTT when not in slow-start mode, TCP Vegas adjusts the window size as follows: {W +1 , diff ß Alternatively, diff can be divided by baseRT T [6], in which case the thresholds a and ß are de.ned in a standard unit of throughput (e.g., packets/second); however, this results in unequal treatment of connections with different baseRT T [16].
Relationship: reasoning
Domain: Networks
Sentence 1: Multiple-ray Model of propagation inside tunnels 2.3 Characteristics from the point of statistics   In tunnel environments, the received signal is presented as the sum of the direct signal and the signal scattered by the wall, ceiling and ground.
Sentence 2: the statistical distribution of the received signal can be described as the Ricean distribution as:  ,, (6) where is the probability density function,is the random variable, is standard deviation,is the amplitude of the LOS component, and is a first order zero degree Bessel function.
Relationship: reasoning
Domain: Networks
Sentence 1: After 13s, a fault happens at link 2 that triggers the SM to generate a new 8000 set of routing tables that causes both .ow 1-5 and .ow 2-4 to sharethesame upstreamlink.
Sentence 2: withoutthe 6000 dFtreealgorithmthethroughputof .ow2-4dropsto3Gbps due to the HOL blocking caused by the congested .ow 1-5.
Relationship: reasoning
Domain: Networks
Sentence 1: As illustrated in Figure 12, spher­ical graphs are quite complicated; their practical deployment for large N would be quite dif.cult without a scalable tiling strategy.
Sentence 2: in a manner analogous to that used in §3.1 and §3.2, we now transform these graphs to discover local patterns and identify self­similar tilings that make such constructions tractable and scalable.
Relationship: reasoning
Domain: Networks
Sentence 1: Even though these datasets use di.erent relationship-inference al­gorithms, the trends we observed across datasets were re­markably consistent.
Sentence 2: all the results we present are from CAIDA s November 20, 2009 dataset (with slight mod­i.cations to the sibling relationships, see the full version); counterparts of these graphs, computed from Cyclops and IXP data [12, 13] are in the full version [1].
Relationship: reasoning
Domain: Networks
Sentence 1: In HCMM pro1, the accumulation of the whole history performed by Greedy makes it able to di.erentiate the com­munities, although mixed, as it emergesbyboth the utilities reported in Fig.13(a) (they are not uniform, as instead it happens in RWP) and the behavior of the ecdf over utili­ties (which shows more encounters with a subset of nodes) (Fig.13(b)).
Sentence 2: greedy is able to discover the communities (although with a long learning phase: roughly (a)(b) Figure 14: HCMM pro1 (a) Fresh: ecdf(utilities) for a node.
Relationship: reasoning
Domain: Networks
Sentence 1: We also conducted VoIP calls to other desti­ nations (China and NewYork), and the results were compa­rable.Anexaminationofthe distributionof interframegaps (also omitted for brevity) which takes both the uplink and downlink traf.c into account shows that 70% of the frames have an interframe gap of a few hundred µ s and 90% are within 10 ms.
Sentence 2: it is clear that the tail of the distribu­tion contributes to the large exploitable idle time, and this tail likely arises from silence suppression as well as delay variability over the wide area network.
Relationship: reasoning
Domain: Networks
Sentence 1: In de.ning OFSS our aim is to select pf to maximise the total amount of information captured by FSS, or equiva­lently, to minimise the CRLB when using all A counters.
Sentence 2: for each a > 0, we seek to minimise the diagonal elements of I+ I+ (a) (a) 1 FSS FSS I+ ' IT (pf )= = = Sk(a ) (15) Nf Aa Aa' over pf .
Relationship: reasoning
Domain: Networks
Sentence 1: NumOfPath(i)×NumOfPath(j) return the pair (i,j) with maximum d 3.1 Ef.cient dependency discovery Since the joint table is a combination of forwarding table of each switch, it is essentially driven by the routing policies of the net­work.
Sentence 2: we can take advantage of commonly used policies (e.g., routing schemes) to guide the selection of the inputs.
Relationship: reasoning
Domain: Networks
Sentence 1: Specif­ 1E(k-1) n ically, we simulated a large number of random duty cycling v 2 2 n` vk, n 2p(k-1) n 2p(k-1) n 22 = v cos + i sin = ´ `´ instances on each graph with di.erent p and then measured (7) the average end-to-end latency.
Sentence 2: n  nn  (k-1) (-1) v = v First, we simulated duty cycling random walks on small cos((k-1)p)+ i sin((k-1)p) = n n networks for a 10 node random geometric graph with wake up probability, p =0.1, we found that the simulated value of vk, n is always a real number.
Relationship: reasoning
Domain: Networks
Sentence 1: One problem we found was that since the amplitude of the preamble is much larger than that of the OFDM transmission (due to low PAPR), a 3ms cyclic pre.x proved insuf.cient for shielding from ISI the training symbols that immediately followed the preamble.
Sentence 2: we padded each preamble with a silence period of roughly 4ms that allowed ringing of the preamble to subside sig­ni.cantly and reduced channel estimation errors.
Relationship: reasoning
Domain: Networks
Sentence 1: 2 i  Using x = Q(t ), y = Q(t +1) and d(t )= Q(t +1) - Q(t ), we have L i di(t )Qai (t ) Q(t +1) = Q(t)+ a Q(t ) L a i(Qi(t )+ .di(t))a-1di 2(t)+ 2 Q(t )+ .d(t) a (L n2 a (Qi(t)+ .di(t ))adi(t) - i.
Sentence 2: (9) 2 Q(t )+ .d(t ) 1+2a using the fact that di(t) .
Relationship: reasoning