sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: In the following table, the pheromone intensity is denoted by pvn,s, where n denotes the neighbor node, and s represents the address of an anycast server.
Sentence 2: pvn,s denotes the intensity of pheromone to anycast server s via neighbor n. Notably, if an anycast server s is the node s neighbor n, then the pvn,s should approach infinity.
Relationship: reasoning
Domain: Networks
Sentence 1: Thus, fastest-node asynchronismisstill abigproblemforIEEE802.11bdespite itslarger window size, W=2.The excitingthingisthatour ATSPprotocolwillwork evenbetterforIEEE802.11bthanfor IEEEStd 802.11becausethelarger window size willrelieve thebeaconcontention.
Sentence 2: itwould notbeasurprise ifATSPcaneffortlessly supportmorethan 500 stations with IEEE802.11b.
Relationship: reasoning
Domain: Networks
Sentence 1: Asexpected, counterbhasthe worstlatency where every messageisdelayedbefore anyfurther transmission.Onthe otherhand,dominantPhasthelowestlatency withthebad reliability results.
Sentence 2: thisisbecause the small number oftransmissionsintheincomplete view ofits2-hop neighbors.As in the reliability case, locBcast achieves the second best latency (afterdominantP).inmanydifferentsimulationsweno­ticethat ourprotocol,locBcast, obtainsagood tradeoffbetween reliability, latency, and message overhead compared to the other protocols.
Relationship: reasoning
Domain: Networks
Sentence 1: 60 40 20 0 0 50 100 150 200 250 i=1 ExpectedE2E Delay(EED): The EED value of node e repre­sents the expected delay for the packets sent by node e that reach the sink node b. Consequently, the probability that the packet transmission is successful at a certain forwarder is under the condition that the packet is received by one of the forwarders in Pe(i) Se .
Sentence 2: the conditional probability is Pe(i) ' = nEDRe(Se) .
Relationship: reasoning
Domain: Networks
Sentence 1: To ensure that the coarse tree in the TCAM is updated correctly, we logically superimpose the .ne tree on to the coarse tree in the TCAM ensuring that the .ne tree s leaves are aligned with the coarse tree s leaves in the TCAM subarrays.
Sentence 2: each TCAM subarray, which corre­sponds to a coarse tree leaf, holds a set of .ne tree leaves (i.e., .ne tree leaves are not split across multiple coarse tree leaves).
Relationship: reasoning
Domain: Networks
Sentence 1: As a general rule though, it is shown in [4] that the hitting time distribution of general random walks on graphs always hasanexponential tail, andinmanycasesisapproximately exponential itself.
Sentence 2: we expect that if a given mobility model can be (even approximately) represented as a random walk on an appropriate graph, then our method should produce su.ciently accurate estimates.
Relationship: reasoning
Domain: Networks
Sentence 1: Because wireless communication is sensitive to the physi­cal environment, we do not claim that the results of the ex­periments presented here are exhaustive and representative of al l situations.Our main ob jectives are to conduct a set of experiments to illustrate the performance gains that MRD can achieve in the implemented system under a real envi­ronment with di.erent degrees of channel variability, and to analyze the properties of the MRD system in depth.
Sentence 2: we present the results of our HIVAR and LOVAR exper­iments in the following sections.The HIVAR experiments used the modi.ed autorate algorithm as described in Sec­tion 5, but the LOVAR experiments were conducted before we implemented the modi.cations.the LOVAR ex­periments use the standard MADWiFi autorate algorithm, which could have reduced the performance of MRD for those experiments.
Relationship: reasoning
Domain: Networks
Sentence 1: If a signature (a, b) on a message m was indeed generated by the legitimate signer, then, b = k-1(e+da) (mod n) (9) Rearranging, gives k = b-1(e+da) = b-1e+b-1ad = .e+.ad = u1 +u2d (mod n) (10).
Sentence 2:          X = u1P +u2Q = (u1 +u2d)P = kP (11) which verifies that the signature verification is valid.
Relationship: reasoning
Domain: Networks
Sentence 1: t 1 If link e is active in time slot t y = e 0Otherwise Note that yet is set to one if there is a transmission on link e in time period t. Since no node can be transmitting or receiving from multiple nodes in a given time slot, we have the inequality X yet = 1 .v .
Sentence 2: v .t= T. (1) e.N(v) Note that the fraction of time link e is active is given by P t y t=Te T the mean .ow on link e is given by P c(e) y t t=Te f(e)= T Summing Equation (1) over all t= T,we get XX yet = T .v .
Relationship: reasoning
Domain: Networks
Sentence 1: The model characterizes the system state by the collection of subsets of clients that can be served under it, and makes no other assumptions about the network.
Sentence 2: the model is general enough to be applied to a wide range of applications, including delay-constrained wireless networks with rate adaptation, mobile cellular networks, and dynamic spectrum allocation; we will speci.cally focus on the prob­lem of delay-constrained wireless networks.
Relationship: reasoning
Domain: Networks
Sentence 1: The JML de­tected symbol x c (n - 1) .X (1) for time instant n - 1 can now be computed with relatively low computation complex­ity as given in (7).
Sentence 2: the DLT based Bayesian JML scheme e.ectively chooses corrected symbol vector x c (n - 1) corresponding to the sam­ple at time n - 1 through a fast low-complexity likelihood computation scheme.
Relationship: reasoning
Domain: Networks
Sentence 1: As premises for the con.rmation, note that when a mal­ware sample is captured by a honeypot, the attacker is as­sumed to be also infected by the same malware with a high probability.
Sentence 2: we extracted hosts who injected any malwares into our honeypot (i.e., the hosts were surely in­fected by the injected malwares), from the 398,780 hosts.
Relationship: reasoning
Domain: Networks
Sentence 1: This suggests applying analysis techniques successful in prior work, i.e., aggregation­based clustering techniques inspired by [7] and [14], both of which use hierarchical, volume-based cluster­ing to more succinctly store and represent an otherwise overwhelming number of measures.
Sentence 2: our fore­most goal is to distill the measurement data so that we can present essential, concentrated clusters that will be useful in both research and operations.
Relationship: reasoning
Domain: Networks
Sentence 1: This re.ect the fact that 802.11 may perform virtual carrier sensing using an RTS CTS exchange, and that for successful communication, the sender must be able to hear the link layer acknowledgment transmitted by the receiver.
Sentence 2: we draw an edge in the con.ict graph between vertices lij and lpq if dab = Ra for ab = iq, qi, ip, pi, jp, pj, jq, or qj.
Relationship: reasoning
Domain: Networks
Sentence 1: The packets are broadcast downward level by level.
Sentence 2: the servers on the ith level act as intermediate sources to the servers on the (i - 1)th level and those intermediate sources broadcast to servers in the (i - 1)th level in the dimension de.ned by pi.if the source is in the pi th dimension, it broadcasts to all its neighbors within the same element.
Relationship: reasoning
Domain: Networks
Sentence 1: If an on-path attacker corrupts a single bit in the ROA for 8.8.8.0/24 during a bulk download of ROAs from the RPKI, then the corresponding route for 8.8.8.0/24 becomes invalid if there is a covering ROA authorizing AS 3356 to originate 8.0.0.0/8.
Sentence 2: the 8.8.8.0/24 route would no longer be reachable.
Relationship: reasoning
Domain: Networks
Sentence 1: SDN-enabled APs and infrastructure, such as OpenRadio and OpenRAN [7, 8], can control wireless resource usages for AP-to-client downlink transmissions; but they cannot control uplink tra.c, which also interferes with downlink transmissions due to the half-duplex MAC of WiFi.
Sentence 2: aP-side control only cannot guarantee wireless resource for both uplink and downlink.
Relationship: reasoning
Domain: Networks
Sentence 1: Tak­ing into account that qB is symmetric, we conclude that D qB(pw)= qB(A, ..., Ni-1,NiD,Ni+1, ..., B) = qB(A, ..., Ni-1, Ni,Ni+1, ..., B)= qB(pw), which contradicts our assumption that pw is a unique widest path between A and B.
Sentence 2: the path pw will be discovered.
Relationship: reasoning
Domain: Networks
Sentence 1: Under the equilibrium condition, the mean rate of handoff calls moving out from a cell is equal to that of handoff calls entering into the cell.
Sentence 2: by referring to [13], the arrival rate of handoff calls of traffic class i can be expressed as .h,i= .n,i (7) where Pha,i denotes the handoff-attempt probability that an ongoing call of traffic class i will require a (further) handoff.
Relationship: reasoning
Domain: Networks
Sentence 1: (2) r:j.r Also we let ¯ar := ¯ajrr be the arrival rate of route r. 1 We let Qj (t) denote the number of packets who must next be served along link j.
Sentence 2: we let Xjr (t) be the number of route r packets who will next be served over link j at time t. it holds that .
Relationship: reasoning
Domain: Networks
Sentence 1: Also note that Rn(a1) can be recursively com­puted using (26).
Sentence 2: period testing can be conducted us­ 6In this paper, a tra.c is called bursty if its cumulative arrival sample-path V (t) is not a linear function of t. Hence, all but constant-rate .uid tra.c is bursty.
Relationship: reasoning
Domain: Networks
Sentence 1: 4.1 Description of Path Duration Since a path between two nodes becomes invalid as soon as one of its links is broken, the path duration is equal to the minimum of the residual life of the links that conforms that route.
Sentence 2: the distribution function of route duration (R) can be mathematically expressed as: N( )=P.min Li Fi =t .. (1) P R =t .i=1 .
Relationship: reasoning
Domain: Networks
Sentence 1: The need for memory e.ciency can be further emphasized by the following facts: measurement .ash of Crossbow MicaZ mote is 512K bytes [1], .ash mem­ory of Moteiv Tmote Sky is 1024K bytes [2], and TMote Sky s .ash memory .lls in roughly 20 minutes when record­ing two channels of data at 100 Hz [18].
Sentence 2: we are constrained to store the event information in a single node, which is the only node capable of resolving the query.
Relationship: reasoning
Domain: Networks
Sentence 1: If p was created by line 7, 9, 11, or 12, tsent a message m to create a LPt i in B at the same time while sending a message mto create p. Because t sends the message m to create the necessary pointer p in Bno later than mthat creates p, the lookup re­quest cannot arrive at the location of p in Bbefore m.Oth­erwise, m would have been sent over a sub-optimal route contradicting the triangle inequality.
Sentence 2: condition [a] holds.
Relationship: reasoning
Domain: Networks
Sentence 1: The LSR[E12hr] algorithm shows virtually identical delivery re­ 1yr sults, though it requires much less LSA traf.c to update its routing state since LSAs are not sent periodically withhigh frequency.
Sentence 2: because the DTLSR[E12hr] algorithm can estimate thatadown 1yr link may come up in the future, it need not wait for all links along thepathtobeupinorderto.ndapathandcan insteadpredictively forward messages along theexpected best path.DTLSRex­hibits much better performance, delivering close to 80% of all mes­sages even with only 30% link uptime.
Relationship: reasoning
Domain: Networks
Sentence 1: Once, the PDFs are determined, we compute the av­erage link duration for the di.erent mobility models and di.erent values of Vmax.
Sentence 2: for computing the aver­age path duration, we also vary the transmission range  R. The di.erent values of R used are 50, 100, 150, 200 and 250 m. We compute the average path duration for 3in general the one hop path duration is not the same as the link duration.
Relationship: reasoning
Domain: Networks
Sentence 1: We have [] A(t)=2pr 2 - a(t), 2 MDS in TMPO Near-optimum vs. analysis 1.6 Number of clusterhead Near-optimum Performance ratio 1.4 1.2 101 1 0 where a(t) = arccos 2 t - 2 t /  2 10 1 -2t .
Sentence 2: the prob­ 0.8 0 100 200 300 400 0 100 200 300 400 Transmission range (m) Transmission range (m) ability of node i having a lower priority than the nodes in the shaded area is = A(t)k -A(t) k p2 = e = U(A(t)) - T (A(t)) .
Relationship: reasoning
Domain: Networks
Sentence 1: Even more, by t1 the AP has performed bothforward-decodingandbackwarddecodingforallbits transmitted sofar,i.e.,all bitsexceptthefew bitsattheend of Pb1.
Sentence 2: 5 att1 theAPdeclares bothpacketsdecoded.It waitsforaSIFS and acks packet Pa1.
Relationship: reasoning
Domain: Networks
Sentence 1: When peers request pieces of a .le, it is di.cult to determine whether a piece is delivered by another peer en­gaged in the .le transfer, or if it is delivered through one or more relay peers.
Sentence 2: the degree of anonymity provided is dependent upon the number of relay peers relative to the numberof normalpeersparticipating ina .letransfer;how­ever, the expected performance overhead is also dependent upon the number of relay peers participating, as the path length between the initiator and the responder is higher on average as more relay peers participate.
Relationship: reasoning
Domain: Networks
Sentence 1: Taking p =1/(n -2) yields 11 1 )n-2 ps = (1 - (1 - ) n -2 n -2 n -2 1 1)n-2 +(n -2) (1 - (n -2)2 n -2 11 1 -2 -2 = (1 - )e + e n -2 n -2 n -2 11 = e -2 (1 - +1) n -2 n -2 11 -2 = e = .
Sentence 2: n -2 e2(n -2) we derive a lower bound p * s as * 1 ps = .
Relationship: reasoning
Domain: Networks
Sentence 1: For instance, if a vehicle A has received messages with IDs 1 and 2, then for every beacon it transmits, it will insert these IDs in the beacons to act as a list of received messages.
Sentence 2: if a neighbor of A,say B, has received messages with IDs 1, 2 and 3, when it receives the beacon from A and notices the missing ID 3, it will forward this message to A.
Relationship: reasoning
Domain: Networks
Sentence 1: Thus, we have the following theorem THEOREM 23.
Sentence 2: with probability at least 1 - O( v 1 ), the kn log n number of multicast .ows that pass through a squarelet is at most v v v 8 10 2µ = 5 v c · k · n · ln n = c11 kn log n. by letting .i = vc12W , 1 = i = n, for some proper kn log n constant 0 <c12 < 1, then with high probability, the total traf.c load at any speci.c squarelet is at most c11c12W bits/sec.
Relationship: reasoning
Domain: Networks
Sentence 1: For example, our study could be extended to a wider class of routing geometries, theoretical bounds could be derived for many of our simulation results, and the impact of a routing geometry (and in particular its sym­metry or the lack thereof) on the cost of maintaining the associated overlay structure should be studied.
Sentence 2: we view our paper as only the .rst step in a more fundamental investigation of routing algorithms.
Relationship: reasoning
Domain: Networks
Sentence 1: The pre­.x DAG, taking only about 180 KBytes of memory, is most of the time accessed from the cache, while fib_trie occu­pies an impressive 26 MBytes and so it does not .t into fast memory.
Sentence 2: even though the number of memory accesses needed to execute an IP lookup is smaller with fib_trie, as most of these go to slower memory the pre.x DAG supports about three times as many lookups per second.
Relationship: reasoning
Domain: Networks
Sentence 1: It sends a trigger-packet over the Teredo server to host H, which then opens a new IPv6-over-IPv4­tunnel to the Teredo relay.
Sentence 2: from then on, the relay node is able to relay IPv6 packets through the NAT box to host H. initial packets of a communication experience a signi.cant delay until a context in the NAT box has been established for the relay node.
Relationship: reasoning
Domain: Networks
Sentence 1: However, because nodes periodically sleep and the contention window is a constant, most nodes are largely inactive until something is detected and the chan­ nel access cannot adapt to the change of network tra.c.
Sentence 2: although S-MAC greatly reduces the energy con­ sumption and achieves good scalability which are two most important issues in the MAC protocol design, the through­ put, fairness, latency and bandwidth utilizaton of S-MAC are strongly weakened which impleads the application of S- MAC.
Relationship: reasoning
Domain: Networks
Sentence 1: Since what is being considered is the channel gain of the primary link, the SU can allocate more transmission power when the primary link channel gain is large than the transmission power of the SU under the interference power constraint for interference temperature.
Sentence 2: the SU will have more opportunities to transmit its signal in accordance with the channel condition of the primary link than under the inter­ference power constraint for the interference temperature.
Relationship: reasoning
Domain: Networks
Sentence 1: Due to BAP s underestimation of the delivery ratio on an asymmet­ric link, ETT with BAP overestimates the transmission time over the asymmetric link.
Sentence 2: eTT with BAP always takes a detour via B in the topology T3, consuming more network resources (e.g., BAP s Nd Nt is only 0.574 in Table 1 (b)).
Relationship: reasoning
Domain: Networks
Sentence 1: In this case, even if the average queue length of DAP1 is the same as that of DAP2 as 0.5Mbytes, it amounts to 50% of the queue length of DAP1 while the average queue size corresponds to only 0.05% of the DAP2 s queue.
Sentence 2: we must consider both the average queue length and the maximum queue length of a DAP to represent the relative congestion level of the DAP compared to those of other DAPs.
Relationship: reasoning
Domain: Networks
Sentence 1: the sequence B1 i (t0) since the stopping rule {N1(t0)= n}is completely determined by the information up to n+1 n+2  time n, and is unrelated to B1 (t0), B1 (t0) and so on.
Sentence 2: wald s equality [1] can be applied to (37) to yield E[Z1(t0)] = E[N1(t0)]E[B1(t0)].
Relationship: reasoning
Domain: Networks
Sentence 1: THE MEDUSA MODEL We give here a short summary of the MEDUSA model, whose basic idea is to quantify the level of satisfaction for each of the N users, which depends on both the perceived QoS and the price paid.
Sentence 2: for each user i, an Acceptance value Ai = [0, 1] is de.ned, that depends on the utility ui and on the paid price pi.
Relationship: reasoning
Domain: Networks
Sentence 1: We de.ne the load induced by user u on AP a to be Clearly,the NBV of a fractional max-min fairness allo­ cation always has the same or higher lexicographical value than the NBV of the integral max-min fairness allocation.
Sentence 2: we will use this property to construct our solution for the thetimethatisrequired of AP a to provide user u atra.c volume of size xa,u · wu.user u produces a load of integral-association case.
Relationship: reasoning
Domain: Networks
Sentence 1: Furthermore, in the next three subsection, we evaluate the performance of the metrics (b), (c), and (d) by setting k=10.
Sentence 2: based on the Chi-Square distribution table ([16]), we obtained the critical value 200  5.4 The impact of the number of nodes We investigate the effect of the variation of the number of nodes in our analytical model and confirm the results against simulation using the Chi-Square test.
Relationship: reasoning
Domain: Networks
Sentence 1: Therefore, P(x)= P(x1)1(x1 = x2) = P(yu = x1) pu,x1 =1 = .
Sentence 2: 1 - pu,x1 =0 if the joint distribution of xk is the product of a marginal distribution with an indicator function, and the two marginal distributions are identical, we can infer that both sni.ers observe the same set of users.
Relationship: reasoning
Domain: Networks
Sentence 1: Given that the power-law distribution topology has out-degree exponent: the frequency fd of an outdegree d is proportional to the outdegree to the power of a constant, i.e., fd = Ndc,where N is the proportion constant.
Sentence 2: assume that end hosts have degree 1, then the number of end hosts is N. If c< -1, then M-1 dc M = N (9) d=1  M-1 = N1+x c dx(10) 1 8 = N1+x c dx(11) 1 1 = N1 -(12) 1+ cc = N (13) 1+ c N 1+c the fraction is at least =1 + 1 .If c =-2 M cc N =1 then .
Relationship: reasoning
Domain: Networks
Sentence 1: We assume that 802.11 media access control protocol, CSMA with RTS/CTS/ACK is used to protect unicast transmissions.
Sentence 2: as a result of carrier sensing, a transmission between u and v may block all trans­missions within RI away from either u (due to sensing RTS and DATA) or v (due to sensing CTS and ACK).
Relationship: reasoning
Domain: Networks
Sentence 1: The key point of our scheme that prevents this is the time asymmetry in check­sum veri.cation: A node uses a checksum to verify only packets that are received before the creation of the checksum.
Sentence 2: unlike traditional hash functions where the attacker has a chance to .nd a collision because he has the hash value, in our scheme, the time asymmetry in checksum veri.cation prevents the attacker from computing a suitable polluted packet that will pass the ver­i.cation algorithm.
Relationship: reasoning
Domain: Networks
Sentence 1: Com­plexity in setting up simple communication scenarios would present a major hurdle in technology acceptance.
Sentence 2: the goals for the design of end-to-end ab­stractions in our network service architecture are: Develop simple speci.cation and composition mechanism for network services,  Use familiar functions for connection setup and data operations, and  Provide abstractions that can make full use of the capabilities of service-enabled networks.
Relationship: reasoning
Domain: Networks
Sentence 1: Due to these stochastic e.ects, in order to compute a sta­tistically meaningful value for the WSN performance factors, each evaluated WSN topology is simulated multiple times with di.erent random seeds.
Sentence 2: since the standard error of the mean of an n-dimensional sample whose variance is s is v s/ n, and applying the central limit theorem to approxi­mate the sample mean with a normal distribution, a sample size n =16s2/W 2 guarantees a 95% con.dence interval of width W .in order to guarantee con.dence interval W = s regardless of the actual value of s (which is not con­stant in the search space) we always run n =16 simulations per each WSN evaluation.
Relationship: reasoning
Domain: Networks
Sentence 1: INTRODUCTION The network evolution has been recently characterized by an increasing need for higher bandwidth availability and re­source management .exibility, in order to cope with new functionalities and features coming from emerging applica­tions and services.
Sentence 2: one of the main challenges Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for pro.t or commercial advantage and that copies bear this notice and the full citation on the .rst page.
Relationship: reasoning
Domain: Networks
Sentence 1: This might be explained by their RTT distributions, where 4MB and 8MB .ows tend to have higher RTTs.
Sentence 2: when a packet is out-of-order, it needs to wait for the later arriv­  1 5 10 50 100 500 1000 Out of order delay with log scale (milliseconds) ing packets from the slow path (in this case, the cellular network).
Relationship: reasoning
Domain: Networks
Sentence 1: We combine the two scores to an Figure 6: MOS scales used in this paper overall one as follows: z = max {0, z1 -z2 }.
Sentence 2: if z1 is good (i.e., due to negligible loss and jitter), but the z2 is bad (i.e., due to large delays), then the overall score z is low, re.ecting a poor quality and vice-versa.
Relationship: reasoning
Domain: Networks
Sentence 1: If i< j -1, v s parent node is n(w, i+1) .Yi+1 by Def­inition 2.7.
Sentence 2: since Yi+1 is a 2i+1-net, d(v, n(w, i + < 2i+1 1)) =2i+1 (f(d) + 1) by De.nition 2.4.
Relationship: reasoning
Domain: Networks
Sentence 1: However, we believe that, in order to obtain a concrete proofof conceptofthe sharingparadigm,itis mandatoryto assess itsperformanceinrealisticsituations,i.e., withalargernumberof nodes and a wider range of applications.
Sentence 2: the support ofapropersimulationenvironmentisfundamental forhigh-quality appliedresearch.
Relationship: reasoning