sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: In particular the number of broadcast transmissions is drastically reduced because, with RONR, only the .rst interest packet of a content item is .ooded, while subsequent interests are unicast, using temporary FIB entries established by RONR.
Sentence 2: a quick back-of-the-envelope analysis shows that in a network of n nodes, and for k chunks of content, the v number of transmissions is (n - 1) + 2(k - 1 2 )v n, assuming again the average path length approximation n. RONR scales much better than VIF when network size or content size grows.
Relationship: reasoning
Domain: Networks
Sentence 1: As the initial probabilities are set to pstart, we have pw = C1/2 for each v at the beginning of the algo­ w.B(v,1) rithm.
Sentence 2: it suf.ces to show that w pw = C1 at the end of a phase, provided the same inequality is satis.ed at the begin­ning of this phase, where the sum is taken over w that are active in a given round.
Relationship: reasoning
Domain: Networks
Sentence 1: Principal Alice utilizes protocol P if one protocol session exists or existed where Alice is either an originator or recipient of a message with the protocol identification field of P. A protocol session is an instantiation of a protocol.
Sentence 2: it is a set of messages that correspond to the form of a protocol, where the generic source aad destination identifiers are replaced with actual identifiers and an actual payload replaces the generic payload.
Relationship: reasoning
Domain: Networks
Sentence 1: takes and transmits 60 pictures, the charge consumption is about 146.46 C. On the other hand, if it is on econ state, with blocking rate of 2 tasks out of 3 and duty cycle of 75%, its charge consumption will be 123.88 C for the same 600 seconds.
Sentence 2: the overall lifetime will be higher with EM with relative increase of 15%.
Relationship: reasoning
Domain: Networks
Sentence 1: In practical network settings, especially in low duty-cycle sensor networks, a sender should not endlessly retransmit a packet because it would consume signi.cant energy at the send­ing nodes.
Sentence 2: we set the maximum time bound for a sender to retransmit a particular packet as T. Consequently, at node e, with known neighboring nodes and their corresponding working schedule G, we can have a full sequence of potential forwarding nodes that wake up before T. ee Formally, let s be a next-hop node with wake-up time t(s ).
Relationship: reasoning
Domain: Networks
Sentence 1: However, the simulator is al­ways implemented based on some degree of abstraction and sim­pli.cation ofthe networkprotocols andlive applications, thus may missimportant system characteristics[18].
Sentence 2: itis appeal­ingto constructahybrid system which can combine the advantages of both approaches and provide a balance solution to accomplish the needed tests[10][23][22][4].
Relationship: reasoning
Domain: Networks
Sentence 1: According to the 802.11 standard, the synchronization time is (144 + 48) / 1 = 192 (µs), where 144 bits is the length of PLCP preamble, 48 bits is the length of PLCP header, and 1 Mbps is the transmission rate for PLCP preamble and header specified in the 802.11 standard.
Sentence 2: the overhead due to the PLCP preamble and header is 1320%.
Relationship: reasoning
Domain: Networks
Sentence 1: This proce­dure essentially blends Nugache tra.c into the background tra.c so that each of these m selected internal hosts looked as if they communicated with the peers that the correspond­ing m Nugache peers communicated with.
Sentence 2: each of these m selected hosts becomes a real Nugache peer and constitutes the ground truth as far as the proposed scheme is concerned.
Relationship: reasoning
Domain: Networks
Sentence 1: However, for a delay-sensitive application, we are interested in the time a packet is live from the application s perspective fromthetimethepacketisgeneratedby thesource appli­cation to the time it is received by the destination.
Sentence 2: we de.ne the stretch for a packet that does not fully tra­verse the original shortestpath, tobe the ratio of the time thepacket is live tothepost-link-failure shortestpathla­tency; for other packets those that traverse the original shortestpath thestretchis1.
Relationship: reasoning
Domain: Networks
Sentence 1: While prior stud­ies have shown the usefulness of LG servers, it is not clear what other information (apart from those available with the show ip bgp summary command) is available with LG servers for the purpose of collecting the AS topology.
Sentence 2: we conducted a comprehensive investigation to .nd out how many LG servers are operational and what functionalities are provided by individual LG servers.
Relationship: reasoning
Domain: Networks
Sentence 1: Our proposal includes the two extremes the .ooding when n = 0and the unicast routing based on distance-vector algorithm when n = 8 as well as various options that ex­ist between the two extremes.
Sentence 2: the proposal is scalable in the sense that the sizes of message forwarding and routing tables are independent of the network size; theydepend only on pa­rameter n. the overhead for maintaining the tables is also independent of the network size.
Relationship: reasoning
Domain: Networks
Sentence 1: To ful.ll this requirement, we .rst design a VCG auction-based algo­rithm using a linear utility function, called a Classical-VCG (CVCG) algorithm, where the valuation function is given by the maximal feasible received packets per time-slot as discussed in Section 1, i.e., L1 L1 L1 L1 L1 L1 L1 V (T )= Q (T ) · N= a · T (7) ii ii iii L2 L2 L2 L2 L2 L2 V (T )= Q L2 (T ) · N= a · T (8) ii ii iii Thus, their utilities can be expressed as: L1 L2 L1 L1 L2 Ui (Ti,T i )= ai · Ti - ai · Ti (9) L2 L2 L2 L2 U(T )= a · T (10) ii ii Notice that (7) is strictly increasing on a Li 1 .
Sentence 2: to max­imize the declared aggregate valuation, the auctioneer just needs to allocate all time-slots to the bidder with the highest L1 ai .
Relationship: reasoning
Domain: Networks
Sentence 1: In the spirit of static global e.ciency Eglob [12], we de.ne the temporal ef­.ciency ETij between nodes i and j and between the time interval tmin to tmax as: ETh ij (tmin,tmax)= ij (tmin1 ,tmax) (3) dh where temporally disconnected nodes intuitively have ETij = 1/8 = 0.
Sentence 2: given a horizon h, we can then de.ne the characteristic shortest temporal path length Lh and tem­poral global e.ciency Eh glob for a temporal graph as: X 1 hh  L(tmin,tmax)= dij (tmin,tmax) (4) N(N - 1) ij X 1 hh Eglob(tmin,tmax)= E(tmin,tmax) (5) Tij N(N - 1) ij To fully characterise a temporal graph, temporally dis­connected nodes are captured in the average.
Relationship: reasoning
Domain: Networks
Sentence 1: However, in the traces many clients have no activity over a period of several days; if this data is included these inactive times completely dominate the total inactive time (as shown by the dotted line which is barely visible above the x-axis).
Sentence 2: inactive events longer than 1000 s (around 2% of all inactive events) were excluded from the total inactive time represented by the dashed line.
Relationship: reasoning
Domain: Networks
Sentence 1: Hence P(.A = 600 µs |C) = f(1-f)/4+(1-f)/4+af(1-f)/2+a(1-f)/8 =(-87718f2 +38451f+49267)/145800 = 0.37.
Sentence 2: p(.A > 600 µs)= P(.A > 600 µs |C)P(C)> (1-0.37)×0.893 =0.45.
Relationship: reasoning
Domain: Networks
Sentence 1: The public wireless LAN service (MIAKO-NET), demonstrated experimentally as a test bed, provides access to the Internet via PPPoE and PPTP, so MTU size is smaller than the one used in ordinary LAN environments.
Sentence 2: mrouted or AMT can achieve multicast delivery services over MIAKO-NET, but Mrouted or AMT reduce MTU size on MIAKO-NET because of the encapsulation, which degrades communication efficiency.
Relationship: reasoning
Domain: Networks
Sentence 1: While the multi-table approach is well suited for a hard­ware implementation, where multiple small tables can eas­ily be accessed in parallel, in a software implementation the multiple sequential memory accesses would signi.cantly lower performance.
Sentence 2: alternatively, the multiple tables canbecompressedintoasingle, unifying table (see Fig­ure 1d), by storing only su.xes of length w -s +1 bytes (the shortest sub-window) of all the entries in the multiple .ngerprint tables.
Relationship: reasoning
Domain: Networks
Sentence 1: Therefore µvel becomes 4, the complexity becomes, .=NN N ( +µ) (15) PS p t r vel This procedure is repeated Nitr (number of iterations same as k) times to converge to the near-optimal BER performance.
Sentence 2: .=N (NN +µ)N (16) PS p t r vel itr Since the Proposed detector takes initial solution guess as the output of ZF-VBLAST therefore, total computational complexity of proposed detector results in, .
Relationship: reasoning
Domain: Networks
Sentence 1: It is important to note that the maximum bitrate Rmax_1 can be (and should be) selected to be smaller than the original maximum bitrate2 Rmax_in: Rmax_1 < Rmax_in As we will see in the simulation section, the quality of the new stream S1 at Rmax_1 could still be higher than the quality of the original stream Sin at a higher bitrate R >> Rmax_1.
Sentence 2: transcaling could enable a device which has a bandwidth R >> Rmax_1 to receive a better (or at least similar) quality video while saving some band­width.
Relationship: reasoning
Domain: Networks
Sentence 1: Suppose t1 = |{Ci|Fi = v}|and t2 = |{Ci|Fi =1}|when the maxi- P mization is achieved.
Sentence 2: pi,k is bounded by n -v |S1 |+t1 · (Suc(u)+(1-Suc(u)) )k W(u -v)n -1 k + t2 · (Suc(u)+(1-Suc(u)) ) W(u -1)n -1 k = |S1 |+t1 +t2 · (Suc(u)+(1-Suc(u)) ).
Relationship: reasoning
Domain: Networks
Sentence 1: PROACTIVE TRANSMISSION-BASED MULTICAST AND BROADCAST SERVICES In this paper, we propose a proactive transmission-based (and LMA-based) MBS scheme that not only transmits the of session i) will be changed to a proactive LMA with a probability of pi.
Sentence 2: pr{inactive LMA} is expressed as -.iAl Pr{inactive LMA} = (1 - pi)e. (2) Then, the average handover delay can be calculated by di­viding the service disruption time by the total number of handovers (µs/µc) during a session.
Relationship: reasoning
Domain: Networks
Sentence 1: While it is possible for the regenerated clock to have a phase o.set from the original reference clock, as long as the regenerated clock has the same frequency as that of the reference clock, the superposition of these two clocks only a.ects the duty cycle of the reference clock without af­fecting its frequency (unless the regenerated clock is out of phase with the reference clock, in which case the two signals destructively interfere).
Sentence 2: as long as the frequency of the reference clock remains unchanged, the synchronization between nodes is not a.ected.
Relationship: reasoning
Domain: Networks
Sentence 1: Formally, let the received SINR at node j from Sij node i be, .ij = P , where B represents the com- BNj + Ikj kETi mon bandwidth for all links on the network, Sij is the re­ceived power, which is exponentially distributed with mean / = Pid-, Pi is the power transmitted by node i, dij is the distance between nodes i and j, T is the set of transmit­ters, Ikj is the interference at node j from node k. Denote Ij = P Ikj .
Sentence 2: the reception probability is given kvT i Sij ij by prij := P(.ij v .).
Relationship: reasoning
Domain: Networks
Sentence 1: The .rst step is to establish an appropriate network structure (e.g., a i m+n |g | = , .s = 1,...,v, is maxi­ sv tree) while the second step is to deploy routing nodes with m+n mized; for v =1,...,m + n, when () the maxi­ =, is achieved.
Sentence 2: the total e)m+n v the available network structure from the .rst step, making e v v e)m+n use of the available connectivity observations with the de-mal m+n ( e = v v veloped physical layer models.
Relationship: reasoning
Domain: Networks
Sentence 1: c0 ma -2(n·p-b)2 From the Hoeffding s inequality, Pr (X = b) = e n , |D(T )| where constant 0 <b = n · p. By letting b = n · 2a2 , we have n·(c2)2 ·k2 ·r 2(c2)2 ·k·log n (|D(T )| ) - 2 - 2 2(c0)2·m·a2pc2·m Pr C = n ·= e = e 0 2a2 The last formula is = 1 , will go to 0 when n goes to 8 and (c2)2·k2 2pc2·m n 0 vkm .8.
Sentence 2: from Lemma 6, when n .8 and vkm .8, c2·r·k·nD(T ) we have Pr (C> v ) = Pr (C>n · 2 ) .
Relationship: reasoning
Domain: Networks
Sentence 1: Therefore, the re­quest load on peers younger than tm (i.e., peers withage in the interval[t,tm])from the .dt peers is: .D dt (tm -t).. (14) x +y-.t The .rst factor represents the demand per peer, while the secondfactor representsthenumberofpeersintheregion of interest(tm -t).
Sentence 2: the total request load handled by peers younger than tm is: Z tm .2 D (tm -t) dt (15) 0 x + y-.t x + y = .Dtm -(x + y-.tm)D ln .
Relationship: reasoning
Domain: Networks
Sentence 1: The normalization constant A in the expression of p. (k, m; l) is equal to (1 - C¯)-1 for uncorrelated networks, where def1 (E[D2] - E[D])2 ¯ C = p(l)C(l) = 1 - p(1) N(E[D])3 l=2 is the average clustering coe.cient in the normal-sampling sense.
Sentence 2: the degree distribution under the wedge-based sampling, p. (k), is expressed as 1 p. (k) = (1 - q(k, m))pe(k, m; l) 1 - C¯ m,l 1 = (1 - q(k, m))pe(k)pe(m) 1 - C¯ m .. = 1 pe(k) .. 1 - .
Relationship: reasoning
Domain: Networks
Sentence 1: Of these, the indexes that do not lie in an excursion in h b are discarded by Bob while those that do, are considered eligibleforquantization andplacedintothe L -message sent to Alice.
Sentence 2: an unsuccessful guess provides no bene.t to Eve, while a successfulguess, albeitimprobable, causes L to contain anindexthat was notpresentin L, thereby alerting  Figure 2: Timing diagram for the key-extraction protocol.
Relationship: reasoning
Domain: Networks
Sentence 1: Accuracy for V=70km/h and R=4 km 1,2 1 Accuracy 0,8 R=500m R=1000m 0,6 R=4000m 0,4 Accuracy 0,8 0,6 0,4 0,2 0,2 0 0 0,2 0,4 0,6 Width (W) /Radius (R) Figure 11: Prediction accuracy for V =70km/h Unlike the GPA, which is performed immediately after a mobile user enters a new cell, LPA is performed when the user enters the High HO region of its current cell and is moving towards an adjacent cell.
Sentence 2: the time where the prediction is made by LPA is very important regarding the prediction model e.ciency.
Relationship: reasoning
Domain: Networks
Sentence 1: Equation 3: As the expected value of a counter in a counter subvector, which is speci.ed in Equation (1), should never exceed the maximum capacity of the counter, we have tf,X T -tf,X b + = 2-1 m n Let tmax be the maximum value of tf,X for all .ows on a f,X network.
Sentence 2: the value of b should satisfy the following equation: max max tT -t f,X f,X b + = 2-1 (15) m n Here tmax can be obtained by some measurement on the f,X sum of the time stamps of all packets on a per-.ow basis on the given network.
Relationship: reasoning
Domain: Networks
Sentence 1: i Next, since F (r)= 0 r f(s) ds and f = 0, we have F = 0as well.
Sentence 2: 2a a+1 L2a2a (x)= (a +1) F (xi) = ((a +1)F (xmax)) a+1 , i and so M2f2 (xmax) ¯ T3 = (1 - a) 2a .
Relationship: reasoning
Domain: Networks
Sentence 1: We assume that transmitters are sub ject to simple power limits, 0 =Pl =Pmax and that links o.er a single rate rl tgt = W log(1 + .tgt ) when the SINR at its receiver exceeds the threshold .tgt .
Sentence 2: tobeabletosee this e.ect we introduce the following rate allocation policy { tgt .l(P) =.tgt r, if rl = (2) 0, otherwise link l may transmit at rate rtgt if the SINR level at its receiver exceed the threshold, and stays silent otherwise.
Relationship: reasoning
Domain: Networks
Sentence 1: However, if several replicas of .les are placed in peers of high degree adjacent to a peer of high degree, the situation would be the same as Path Replication and Path Random Replication, in which replicas of .les are placed in peers on the present search path.
Sentence 2: the key point toward simultaneous achievement of load balancing and the decrease in the number of hops is the method by which replicas of .les are allocated around peers of high degree.
Relationship: reasoning
Domain: Networks
Sentence 1: It then transmits an t outgoing stream at rjto its relay candidate Vjt.
Sentence 2: j t ri+rrj (10) iljl  i.e., the rate of incoming streams plus the rate of the self-generated stream should equal to the rate of outgoing streams, since all live local-views should be forwarded to the BS (we do not consider .ow aggregation now, since it is application speci.c).
Relationship: reasoning
Domain: Networks
Sentence 1: Content providers struggle to mitigate any network performance bottleneck that can slow down Web page loads in ac­ cess networks by even tens of milliseconds.
Sentence 2: it is crucial to understand both how network properties of access networks such as latency can introduce bottlenecks in Web page load times and the extent to which various optimizations can help further mitigate these bottlenecks.
Relationship: reasoning
Domain: Networks
Sentence 1: By estimating the channel at the Rx and conveying it to the Tx, the beamformer can be adjusted to be the complex conjugate of the channel, so that the spatial chan­nels from each Tx antenna combine coherently and reenforce each other at the Rx.
Sentence 2: the optimal beamformer is given by w = h * , where * denotes the complex conjugate.
Relationship: reasoning
Domain: Networks
Sentence 1: However, we observe the Proportional Scheduler maintains a queue for each outgoing link from a node.
Sentence 2: that is for each node n the policy maintains a queue for each j = (n, n ' ) = J rather than each link-route pair (j, r) = J × R. in our example, a Proportional Scheduler would require a number of queues given by d. This is signi.cantly smaller than the number required by BackPressure.
Relationship: reasoning
Domain: Networks
Sentence 1: Note that the proxy gathers data before striping.
Sentence 2: it has an accurate estimate of the total size of the download, S. It simply needs to obtain the number of eligible phones, n, by .rst applying the energy-aware-balanced policy and then, using the above expression, stripe data over a subset of the eligible phones, thereby delivering the requested data in an energy e.cient manner.
Relationship: reasoning
Domain: Networks
Sentence 1: Flashback: Decoupled Lightweight Wireless Control Asaf Cidon, Kanthi Nagaraj, Sachin Katti Stanford University {cidon, kanthicn, skatti}@stanford.edu ABSTRACT Unlike their cellular counterparts, Wi-Fi networks do not have the luxury of a dedicated control plane that is decoupled from the data plane.
Sentence 2: wi-Fi struggles to provide many of the ca­pabilities that are taken for granted in cellular networks, including ef.cient and fair resource allocation, QoS and handoffs.
Relationship: reasoning
Domain: Networks
Sentence 1: Thence, to determine that start time, the earliest idle interval [A, B] on processor P has to be searched to satisfy condition 3.
Sentence 2: as a result, the start time of task vi is set as: vv 0 i entry _ task (, P) tv s i , (7) ^max( Aavail (v ,P)) v zv i i entry _ task the Earliest Start Time (EST) and Earliest Finish Time (EFT) values of a task vi executed on a processors P are computed compi j wi *mtu j (10) p j where mtuj is the amount of money per a time unit of workflow execution on processor Pj with processing rate pj .
Relationship: reasoning
Domain: Networks
Sentence 1: Let v be a forwarding neighbor of u for q, R[u;q]= L[uv](R[v;q]), and assume that v belongs to E, R[v;q]= R[v;p].
Sentence 2: r[u;p]: L[uv](R[v;p]) = L[uv](R[v;q]) = R[u;q].
Relationship: reasoning
Domain: Networks
Sentence 1: iii) its aver­age is 8(1) as shown in Appendix C. As a result of previous arguments, although the dynamics of a virtual queue associated to step i may exhibit complex depen­dencies over time, the number of messages in it can be stochasti­cally dominated by the number of messages in a Geo[X]/Geo/1 (a Geo/Geo/1 queue with bulk arrivals), in which the service times (batch sizes) are memoryless and lower (upper)-bounded as ex­plained above.
Sentence 2: the average delay E[Di] experienced by step-i messages in the considered virtual queue can be bounded using the Pollacek-Kinchine formula [24]: 22 (2) (2)2 iasi - a(si + si)+ asi E[D] .
Relationship: reasoning
Domain: Networks
Sentence 1: Furthermore, each verifying party checks that the proofs of all the other par­ties are also accepting (this is possible because the proof of Hamiltonicity is publicly veri.able and because all parties receive all the commitments).
Sentence 2: at the end of the proto­col, all honest parties agree (without any additional commu­nication) on whether the proof was successful or not.
Relationship: reasoning
Domain: Networks
Sentence 1: At every node visitedduring this traversal, the probe message awakens (adds tothe planar sub-graph) all attached links that were previouslyremoved by GG/MW or LCR, and then runs CLDP on eachlink to eliminate cross-links.
Sentence 2: in our example, whenK notices that the link (L, K) has failed, it sends a probe message towards J which awakens the link (J, M), thereby restoring connectivity.
Relationship: reasoning
Domain: Networks
Sentence 1: (1) At the beginning and end of the original active slots, S sends a discovery mes­sage including its neighbor table, i.e., its own duty cycle as well as IDs and duty cycles of its current known neigh­bors.
Sentence 2: (2) S may receive similar discovery messages from previously unknown or known neighbors if they also become active in the same slots with S. S will collect some activation schedules about some known neighbors, i.e., when the known neighbors will become active again in fu­ture slots.
Relationship: reasoning
Domain: Networks
Sentence 1: Here we need to point out that for Algorithm 1, the se­quence {Ok, 1 = k = |s|} is unimodal and hence the algo­rithm can stop once the sequence Ok becomes nonincreas­ing at some k. However, this property does not hold for Algorithm 2 due to the non-convexity of the objective func­tion.
Sentence 2: we need to check every element in the sequence {Ok, 1 = k = |s|}.
Relationship: reasoning
Domain: Networks
Sentence 1: In mobile disruption-tolerant networks (DTNs), store-carry-forward communication which is inte­gral to many routing protocols exploits nodes mobility to bring messages closer to their destinations by exchanging messages with other mobile nodes when they are in ade­quate proximity.
Sentence 2: long-term knowledge of future locations of mobile users is a de.ning factor in the routing of the messages to their .nal destinations in mobile DTNs.
Relationship: reasoning
Domain: Networks
Sentence 1: 8 L L L c 1 pd = = c = c.(ß) = n.(ß) kß kß d.D(S) k=|D(S)| k=1 44.
Sentence 2: (ß) we have E[Z] = :n n.(ß)= : By the Maclaurin-Cauchy test, we know for ß> 1, the series represented by .
Relationship: reasoning
Domain: Networks
Sentence 1: This was expected, since the goal of the MG­based scheme is just to maintain the VDM inside the road pipe, butit does not take into account the speed factor.
Sentence 2: when the MG-based index is used, the VDM is driven at an averagespeed that approximates the average vehicle velocity, and when thevehicle lane density is high, the average vehicle speed decreasesbecause of route congestion.
Relationship: reasoning
Domain: Networks
Sentence 1: Further, the high degree of ringing in the acoustic channel (reverberations), compared to Radio Frequency (RF), ren­dered the existing RF self-interference cancellation techniques in­adequate.
Sentence 2: for Dhwani, we present a novel and ef.­cient technique for self-interference cancellation, which takes ad­vantage of the fact that the jamming sequence can be predetermined by the receiver.
Relationship: reasoning
Domain: Networks
Sentence 1: G) Lx cle [13] centered at ij ,Ly and with radius Lr ij , where ij ; ; ;; LxIi xi-Ijxj LyIi yi-Ijyj ij = ;; ij = ;; I -II -I ij ij ;; II ij 22 Lr ij =G)2(xi - xj )+(yi - yj ), Ii ; - Ij ; ;; for Ij /Ii =0, 1, 8.
Sentence 2: l12 = L13 may have at most two solutions.
Relationship: reasoning