sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: It is only after the news of a topology change has reached all routers, directly in the case of link-state and indirectly in the case distance-vector and path-vector, that the protocol can ensure that the forwarding tables de.ne consistent routes between all pairs of nodes.
Sentence 2: all such routing protocols experience a convergence period after the change has been detected and before all routers learn about the change during which the routing state might be inconsistent.
Relationship: reasoning
Domain: Networks
Sentence 1: Since a root-cause is assigned to be up in most assignment vectors, the evaluation of an assignment vector only requires re-evaluation of states at the descendants of root­cause nodes that are not up.
Sentence 2: ferret preprocesses the Inference Graph by assigning all root-causes to be up and propagating this state through to the ob­ 3There are important cases where this observation might not hold, such as rapid malware infection and propagation.
Relationship: reasoning
Domain: Networks
Sentence 1: 3.2 Problem Formulation In an inter-BS spectrum contention process, the channel redistribution may satisfy the contention source BS i; but meanwhile a contention destination BS j that loses the tar­get channel may become starving, and successively initiate a cascading contention process.
Sentence 2: the event that a BS j becomes starving is caused by a spectrum contention initiated by a starving BS i.
Relationship: reasoning
Domain: Networks
Sentence 1: For example, using our example of learning a model on server ports, it is clear that the use of a particular server port is not an intrinsic property of botnet behavior.
Sentence 2: the design of Disclosure s feature extractor module emphasizes the selection of those NetFlow attributes that best capture invariants in botnet behavior without resorting to specialization to a particular C&#38;C protocol.
Relationship: reasoning
Domain: Networks
Sentence 1: For 1 = j = n/ log n, let Bj denote the new block size after the jth er­ror.
Sentence 2: we ll set (yy) B0 Bj = B0 j+ 1 - j= v v j+ 1 + j at any given time, Alice and Bob simulate the noise­free protocol in blocks of size Bj where j is the number of errors encountered so far.
Relationship: reasoning
Domain: Networks
Sentence 1: Thus, in both cases, d(u,v) 3 ·2i, which implies by PN(i)that S N i Ti v belongs to u and w .v.N i v. u N i 2i Consider now v .u.
Sentence 2: by de.nition, d(u,v) 3 ·, and again according to triangle inequalities, all the nodes 2i+1 in Tv i areatdistanceatmost2i +2i-1 + ···+1 from v. from the triangle inequality, Tv i is included in Bu(5 ·2i).
Relationship: reasoning
Domain: Networks
Sentence 1: Since PreRSS-Cost determines the optimal network based on COL cost function from the available bandwidth, PreRSS-Cost avoids handoffing to a network that has strong RSS but lacks of enough bandwidth for the handoff connection.
Sentence 2: the dropping probability of the cost-based approach is zero and that of RSS-T and RSS-HT are almost above 0.5 under different arrival rate as shown in Fig.
Relationship: reasoning
Domain: Networks
Sentence 1: Increase µ1 and decrease µ2 from (µ1,µ2)=(0.5,5) to (2.75,2.75) incrementally, keeping E µS(1) =2.75.
Sentence 2: simulation 2: Asymmetric chain with p12 =1 - p11 = 0.1 and p21 =1-p22 =0.2.(P1,P2)=(2/3,1/3).
Relationship: reasoning
Domain: Networks
Sentence 1: The iffinder approach naturally leads to a higher rate of false negatives (failing to infer two interfaces are on the same router) than false positives (inaccurately inferring two interfaces are on the same router).
Sentence 2: to validate our DNS-based grouping, we search for instances in which our DNS-based approach infers two or more routers for a set of interfaces, yet iffinder infers only one.
Relationship: reasoning
Domain: Networks
Sentence 1: Speci.cally, none of the schemes that have been pro­posed have been shown to perform well enough over a wide range of environments.
Sentence 2: the question remains as to how to ef.ciently support routing that is responsive to a wide range of mobility patterns, that is scalable and that can form the nucleus of a strategy capable of supporting QoS requirements in terms of throughput and delay?
Relationship: reasoning
Domain: Networks
Sentence 1: ID start date dur sites size rr-pairs A1 22 Aug 08 noon 24h all >5 TB >80 M A2 18 Sep 08 4am 48h all >10 TB >200 M A3 01 Apr 09 2am 24h all >6 TB >170 M B1 21 Feb 08 7pm 25h OSNs >15 GB >2M B2 14 Jun 08 8pm 38h OSNs >50 GB >3M B3 23 Jun 08 10am >7d OSNs >110 GB >7M to the active and its associated indirect requests.
Sentence 2: the number of bytes in an action is the sum of bytes of all its requests.
Relationship: reasoning
Domain: Networks
Sentence 1: Since all links have a similar packet loss distribution in the UDP measurements, this effect is explained with the lower RTT of the shorter link (see also Figure 4(c)).
Sentence 2: the average 9  Value [s] -3 x 10 (b) jitter throughput of the link HHI-TC is 16.6 Mbps and the standard devi­ ation 3.08 Mbps.
Relationship: reasoning
Domain: Networks
Sentence 1: We will con­ 1 struct a multicast structure as follows: Algorithm 1 Multicast Capacity Achieving Manhattan Routing Based on a Squarelet for Nodes U1 ' 1: We partition the deployment square into squarelets, each with v side length r/ 5 (as in [18], see Figure 1 (b) for illustration).
Sentence 2: we have I r/ av 5 l squarelets.
Relationship: reasoning
Domain: Networks
Sentence 1: 4.2 Popular Smartphone Apps Figure 2 shows that there are a substantial number of smartphone apps with only 1 subscriber and that 60% of the smartphone apps have no more than 10 unique subscribers.
Sentence 2: these apps do not provide enough data for analysis, and, in this section, we explore how to decide systematically which apps can be considered popular and how we can eliminate the effect of apps with marginal usage on our analysis.
Relationship: reasoning
Domain: Networks
Sentence 1: ML detection in MIMO communication system belongs to a large class of combinatorial problem known as NP-hard optimization problems.
Sentence 2: in order to solve these NP-hard problem for any non­trivial problem size, one of the following approaches can be used: (1) Approximation: An algorithm which quickly finds a suboptimal solution which is within a certain range of the optimal one; (2) Probabilistic: An algorithm which provably yields good average runtime behavior for a given distribution of the problem instances; and (3) Heuristic: An algorithm which works reasonably well on many cases, but for which there is no proof that it is always fast (e.g., evolutionary techniques).
Relationship: reasoning
Domain: Networks
Sentence 1: decentralized, reliable and non-discriminatory network of networks.
Sentence 2: initiatives for characterization and monitoring of service o.erings by Internet Service Providers (ISPs) [21, 12, 26], governments [24, 25, 10], researchers [9, 6, 7, 8] and independent entities [1, 2, 3, 4] have grown in popularity in the last few years, as a way to provide consumer protection and information, as well as a means to regulate the behavior of broadband providers.
Relationship: reasoning
Domain: Networks
Sentence 1: Analyzing first the operator payoffs, they show a general increase trend.
Sentence 2: this occurs because the operator payoffs depend strongly on the operator income and this last parameter depends on N. as in our repeated game, N increases one unit between two consecutive game stages, in this way, the operator payoffs should also increase proportionally to N. We can conclude that as the network stays uncongested (N<=14) the best strategy for the operator, independent of the user actions, is accepting the new user (payoff a12).
Relationship: reasoning
Domain: Networks
Sentence 1: From [1,12,13], x(e) x(e) all schedulable .ows must satisfy that + Le = C d(e) ' .I(e) d(e) for a constant C > 1 depending on interference model.
Sentence 2: x C * satis.es all the constraints of our linear programming, except that the achieved .ow is at least F/C.
Relationship: reasoning
Domain: Networks
Sentence 1: We maintain a rolling window of n bins of a set inter­val t, such that n · t>TOactive + Dmax, where TOactive is the active timeout of the .ow collection infrastructure (i.e., the time after which any .ow will be expired from the .ow meter s cache, or alternately, the maximum duration of any exported .ow) and Dmax is the maximum observed export delay.
Sentence 2: we are guaranteed that any observed .ow can be assigned to all bins it covers.
Relationship: reasoning
Domain: Networks
Sentence 1: We believe that the MRD throughput results would im­prove if we used the modi.ed autorate algorithm for MRD in our LOVAR experiments.The potential throughput perfor­mance could be as high as (if not higher than) the 48 Mbps .xed rate MRD experiments, which improved throughput by 9% to 16% over R1 Auto and R2 Auto.
Sentence 2: another reason for the diminished gain is the low variabil­ity of the channel.Although the frame loss rate was substan­tial at 48 Mbps, there was almost no loss at 36 Mbps.the throughput for R1and R2 is lower bounded at the 36 Mbps bit-rate and caps the maximum achievable throughput gain for MRD.
Relationship: reasoning
Domain: Networks
Sentence 1: Then, from Corollary 1 we conclude that the length of the EMST which connects the nodes of the kth cluster is d d-1 less than Kd mk lcd .
Sentence 2: hence, the sum the lengths of the v ncd d-1 d P 3a ncnd-1= Kdlc EMST s is less than Kdlc Pmax m k k=1 Wij = B log2(1 + SINRij ) = B log2(e) (31) (for a proof of this bound use Jensen s inequality with the v (j - 1)Pmin concave function d xd-1): d d nc nc nc nc nc m 3a Pmax 1 1 n d d-1 mk)d-1 )d-1 d = fi(X) = ( ( (32) Wi1 + B log2(e) m = k (j - 1)Pmin j=2 k=1 k=1 #SD-1 3aThe second part is straightforward from Corollary 1.
Relationship: reasoning
Domain: Networks
Sentence 1: ), the number of nodes of both B(n,k-1) and T is n and it is known to u.
Sentence 2: indeed, T can be chosen as a shortest path tree rooted at u in B(n,k-1), and labeled by ..after t rounds, the state in u com­puted by FA is the same in B(n,k -1) and in T.If none of the nodes decides to remove one of its incident edges, then the number of edges of the spanner for B(n,k -1) is 1+1/.
Relationship: reasoning
Domain: Networks
Sentence 1: Shadowing accounts for the random variations in signal strength between node and client pairs at the same distance d(n, p), which are due to di.erences in the scattering and attenuation environment and is usually represented as a zero-mean Gaussian random variable [19].
Sentence 2: instead of estimating based only on average path loss, we also de.ne a terrain-informed shadowing es­timator, ß(n, p), to capture the speci.c path s deviation (higher or lower) from the average path loss.
Relationship: reasoning
Domain: Networks
Sentence 1: Once the rate is increased beyond the capacity, the local MAC delay does not increase more as the BEB bounds the maximum back-off time.
Sentence 2: in QAMNet, if the MAC-layer back-off increases, we decrease the rate at which BE and rejected real­time traffic enters the MAC-layer at each forwarding node, otherwise we increase it according to an Additive Increase Multiplicative Decrease (AIMD) control algorithm.
Relationship: reasoning
Domain: Networks
Sentence 1: NS-3 Configuration Standard IEEE 802.11a Frequency Channel 5GHz, 20MHz BW Noise Figure 7+19 dB Energy Detection threshold -82dBm[7] CCA busy threshold -62dBm[7] Output power 15dBm Tx and Rx antenna gains 2dBi Rate control algorithm AARF-CD Super frame / ISFS durations 25 ms / 0 ms  4.1.3 Scenario According to our simulations, the network saturation is around 24 Mbps when using 64QAM3/4.
Sentence 2: we selected a basic scenario with four IPTV flows of 4 Mbps.
Relationship: reasoning
Domain: Networks
Sentence 1: Packet error rate (PER) which is dependent on packet length, bit error rate (BER), SNR, modulation and coding scheme has to be considered accurately [2].
Sentence 2: throughput for an error prone channel can be recalculated with the following formula, Ps(l-Pb)L Tp Sthr = (6) I+Ps(l-Pb)LTs+ (l-Ps)Tc+PsTe(l-(l-Pb)L ) where Pb is the bit error rate (BER), L is the data packet length in bytes which includes PHY layer header, MAC layer header and packet payload, Te is the unsuccessful transmission period.
Relationship: reasoning
Domain: Networks
Sentence 1: have neighboring nodes that have a tree distance in the order of the diameter of the network.
Sentence 2: the Protocol parameter Value Synchronization period ROOT_TIMEOUT IGNORE_ROOT_MSG ENTRY_SEND_LIMIT 30s 5 4 3  e.ects shown in Figure 7 will always occur in real-world network topologies even though at a smaller scale.
Relationship: reasoning
Domain: Networks
Sentence 1: Speci.cally, it shows the probability for a link to have PRR = phigh as a function of the sender-receiver dis­tance, under various log-normal variations s. When s =0, there is no log-normal shadowing and thus signal strength decays monotonically with distance.
Sentence 2: the proba­bility becomes zero as signal strength falls below .th, and the corresponding distance is the length of the connected region.
Relationship: reasoning
Domain: Networks
Sentence 1: Fourth, it is di.cult to ascertain the interfer­ence relation among neighboring nodes because radio inter­ference ranges are di.erent from communication ranges and some interfering nodes may not be in a direct communica­tion range (this phenomenon is known as interference irreg­ularity [25]).
Sentence 2: any channel assignment that uses the communication ranges, in place of interference ranges, for building the con.ict relations does not necessarily yield an interference free schedule.
Relationship: reasoning
Domain: Networks
Sentence 1: The resultis shown in Figure 14.
Sentence 2: the .gure shows that around 60% ofunknown .ows are distance 2 away from the observer ASes.Distances 1 and 3 follow by 30% and 10%, respectively; thepercentage of unknowns that are further away is negligible.most unknown .ows are at least two hops away fromthe observer AS.
Relationship: reasoning
Domain: Networks
Sentence 1: ForanypathP,letp1(P)betheprobabilitythatapaket travelingalongPhasthesingleheaderbitsetto1whenit arrivesatthevitim.Now,onsidertheasewherethereare threepossiblepathsofattakP1,P2andP3,outofwhihthe attakerisallowedtohooseuptok=2.Weanassume w.l.o.g.thatp1(P1):p1(P2):p1(P3).Considertwodifer­entattakerstrategies:1)theattakersendsallpaketalong pathP2,and2)foreahpaketindependently,theattaker pI(tf)-pI(t) sendsthepaketalongP1withprobabilityand pI(tI)-pI(t)pI(tf)-pI(t)pI(tI)-pI(tf) alongP3withprobability1-=.
Sentence 2: pI(tI)-pI(t)pI(tI)-pI(t) Inbothattakerstrategies,theprobabilitythattheheader bitofanypaketis1isp1(P2),butthetwoasesdonot shareanypaths.whentheprobabilityofreeivinga 1isp1(P2),thevitimisnotabletodobetterthanguess­ingbetweenthetwoases.Alsonotethatobtainingmore paketsdoesnotgiveanyinformationbeyondabetteresti­mateofp1(P2),andthusinreasingthenumberofpakets reeivedisnothelpful.
Relationship: reasoning
Domain: Networks
Sentence 1: Conveying the ideas behind Portolan in a concise and simple form (as it is generally required for publicity) proved to be rather di.cult.
Sentence 2: to stimulate the adoption from normal users, we included in the Por­tolan app some networking tools that can be directly started by the user independently from the Portolan activities: the traceroute tool and an estimator of the available bandwidth.
Relationship: reasoning
Domain: Networks
Sentence 1: Thus, research into proximity methods is now in a position where we neither know how to describe the real-world latencies nor understand their e.ect on our proposed algorithms.
Sentence 2: 10this version of PRS adds nothing when combined with the ideal PNS algorithm, which e.ectively has in.nite K. (a) (b) Figure 4: The CDF of latency distributions for (a) the Internet as seen from di.erent geographic locations and (b) a 16,384 node GT-Itm topology as seen from a typical node.
Relationship: reasoning
Domain: Networks
Sentence 1: Since the packet size is geometrically distributed, M the channel that has l agreements can be utilized up to ( ) min jl =1 Yj, dslots where the Yj ' s are geometrically dis­ tributed random variables.
Sentence 2: the averaged through­put can be upper-bounded as follows: l l+1 L L R(i, d)= (M-r)Emin Yj, d+rEmin Yj, d j=1 j=1  (14) where r is the number of channels with l + 1 agreements.
Relationship: reasoning
Domain: Networks
Sentence 1: Therefore, there is no overlap between the coverage area of the nodes to the right of a and that of the nodes to the left of a (including a and those on the same orthogonal crossing line as a)because L= 2r.Then the nodes on the left side of a (including a and those on the same orthogonal crossing line) should provide k-barrier coverage for 2d-zone(a), which is impossible because d>r.
Sentence 2: there must be at least one active node in the L-zone.
Relationship: reasoning
Domain: Networks
Sentence 1: Clearly, appending this stream to stream A results in a stream with n slots where the persis­ tence of item 1 is n1(A)+(na - n1(B)) = na - (n1(B) - n1(A)) <na, and appending this same stream to stream B results in a stream with n slots where the persistence of item 1 is na.
Sentence 2: item 1 must be reported as a-persistent in the latter case, and not in the former case.
Relationship: reasoning
Domain: Networks
Sentence 1: The spot where travel distance from vertex u1 along the path p(u1,uk) is dbelongs to the n th road along the path, i.e., (un, un+1 ) .
Sentence 2: pj .its ith weight can be expressed as: (u1,uk) n-1 wi,p(u1,uk) (d) = wi,(un,un+1 )(d- m=1 D(um,um+1 )), (3) n-1 n if d .
Relationship: reasoning
Domain: Networks
Sentence 1: Therefore, following typical practice FICA groups a set of sub­carriers into a subchannel and uses it as the basis for channel ac­cess.2 Each subchannel contains sixteen data subcarriers and one pilot subcarrier.
Sentence 2: a single subchannel in FICA is 1.33MHz wide witha 6% pilotoverhead, whichis comparableto 802.11(7%).
Relationship: reasoning
Domain: Networks
Sentence 1: = x)= ··· .0.C .0.C .1.C .1.C .n.C .n.C Pr {s(t0)= .0}nEb(t0,x + eh,.0) n{s(t0 + rtt)= .1}nEb(t0 + rtt, x + eh,.1) n··· n{s(t0 +(n -1)rtt)= .n-1} nEb(t0 +(n -1)rtt, x + eh,.n-1) n{s(t0 + n ·rtt)= .n}nEc(t0 + n ·rtt, x + eh,.n) n on x+£h -Qx+£h )Prtt-(x+£h) Qx+£h = ic (P e Qx+£h = icR(x + eh,rtt)ne, (13) 6 6 = Prtt - where e =(1, 1)T is a unit vector and R(x+ eh,rtt) Qx+£h Prtt-(x+£h) .
Sentence 2: we have ` ´-1 g(x + eh,rtt)= ic I - R(x + eh,rtt) e - 1.
Relationship: reasoning
Domain: Networks
Sentence 1: Ritesh Maheshwari State University of New York ritesh@cs.sunysb.edu mission, each TV channel uses a 6 MHz slice of bandwidth, but digital transmissions have the ability to pack four programs" in one 6 MHz channel.
Sentence 2: this analog-to-digital transition frees up a substantial amount of television spectrum that was previously used by analog transmitters.
Relationship: reasoning
Domain: Networks
Sentence 1: than the sample size required for non-parametric quantile estima­tion to converge.
Sentence 2: the highly-varying nature of path de­lay distribution makes non-parametric quantile estimation unable toaccurately estimateinstantaneouspathdelayquantilesinanag­ile manner;thatis,thedistribution ofthepathdelay changesbefore the estimation converges to an accurate value.
Relationship: reasoning
Domain: Networks
Sentence 1: What is essential, however, is that it be normalized; for instance, in our exam­ple it is easy to determine from the leaf-pushed trie that the two sub-tries under the pre.xes 00/2 and 10/2 are identical, but this is impossible to know from the original pre.x tree.
Sentence 2: leaf-pushing is essential to realize good compression but, at the same time, makes updates prohibitive [46].
Relationship: reasoning
Domain: Networks
Sentence 1: In addition to origin authentication, Secure BGP [9] also uses cryptographically-signed routing announcements to provides a property called path veri.cation.Path veri.­cation guarantees that every AS a can only announce a path abP to its neighbors if it has a neighbor b that announced the path bP to a.
Sentence 2: it e.ectively limits a single manipula­tor to announcing available paths.
Relationship: reasoning
Domain: Networks
Sentence 1: phaseilastsfor 2i+1 e(ln2i +c)+d time unitsfortheALOHA-likealgorithm and 2i+1 e + d time units for the Collision Detection-based algorithm.
Sentence 2: all nodes are simultaneously inphase i for at least 2i+1 e(ln2i + c) time units in the case of ALOHA­like algorithm and 2i e time units in the case of Collision Detection-based algorithm, thus guaranteeing all nodes are discovered w.h.p when i = .log2 n., as desired.
Relationship: reasoning
Domain: Networks
Sentence 1: Under a realistic scenario where Averdist and Sspeed are set to 4m and 4m/s respectively, then it can be seen that TMoSBoD is almost hundred and ten percent and TM-MoSBoD is more than forty percent higher than TFlooding.
Sentence 2: a substantial reduction in the completion time of the boundary identification has been achieved (TM-MoSBoD is almost forty percent less than TMoSBoD).
Relationship: reasoning
Domain: Networks
Sentence 1: According to the interference model, if aircraft i is trans­superposed poisson point process, so the horizontal posi­tions of the source and destination are uniformly distributed.
Sentence 2: we can obtain the probability distribution func­tion for the horizontal distance dx of a source-destination pair as follows () 2(D -x0) P dx = x0|n(m.)= N= , 0 < x0 = D, D2 where n(m.)denotes the number of aircrafts.
Relationship: reasoning
Domain: Networks
Sentence 1: This ability promises good search performance, although the number of .les that peers of middle and high degrees are required to have would depend on the network con.guration, such as the network size, network topology, kinds of .les distributed, and so forth.
Sentence 2: to achieve good storage load balancing, we should take into consideration the writing such a local load balancing mechanism achieved global storage load balancing, it is suggested that the accumulations of the local load balancing provide global storage load balancing.
Relationship: reasoning
Domain: Networks
Sentence 1: Note that the unit of storage size is in bits unless otherwise stated.
Sentence 2: the total required memory is: MIPv4 = NS(32+5+5+6+20) = 68NS (8) MIPv6 = NS(128+7+5+6+20) = 164NS (9) a state-of-the-art FPGA device with 36 Mb of on-chip memory (e.g.
Relationship: reasoning
Domain: Networks
Sentence 1: As centrality-driven routing is a greedy approach to the message path optimiza­tion problem, there is a non-negligible probability that a message gets trapped at a highly central node that never encounters the destination.
Sentence 2: for each centrality­basedroutingvariant,we alsoreport thepercentageof deliv­ered messages out of the total messages that canbe delivered by the optimal scheme(deliverable messages).
Relationship: reasoning
Domain: Networks
Sentence 1: In summary, vulnerability to low-rate DoS attacks is not a conse­quence of poor or easily .xed TCP design, as TCP necessarily re­quires congestion control mechanisms at both fast (RTT) and slow (RTO) timescales to achieve high performance and robustness to diverse network conditions.
Sentence 2: it appears that such at­tacks can only be mitigated and not prevented through randomiza­tion.
Relationship: reasoning
Domain: Networks
Sentence 1: We keep the same distributed data plane and, on top of it, the control plane is built on the collaboration between PMIPv6 and DHCPv6 [11], where the synchronization of attributed IPv6 addresses (through the use of DHCP-relays on every X-GW) provides continuity to ongoing data sessions.
Sentence 2: we are in fact pushing the PMIPv6 pre.x management to the DHCPv6 server while keeping mobility control at the X-GW.
Relationship: reasoning