sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: Our results suggest that (1) users are not getting the speeds that their ISPs advertise; (2) mobile broadband users commonly achieve higher throughput than fixed­line users, although the performance that they achieve is variable; and (3) speed (i.e., throughput) is not the only limiting factor on performance in South Africa, and that latency to popular websites and services as determined by both geographic location and Internet peering relationships may significantly affect performance.
Sentence 2: many of the positive network effects promised by broadband connectivity may not be realized in South Africa; rather the widespread problems associated with throughput and latency may ultimately affect the ubiquity of cloud and other services as they extend beyond corporate use.
Relationship: reasoning
Domain: Networks
Sentence 1: The .rst is preferential attachment [7] which says (1) the growth of the network is realized by the sequential addition of new nodes, and (2) each newly added node connects to some existing nodes preferentially, such that it is more likely to connect with a node that already has many connections.
Sentence 2: high-degree nodes are likely to get more and more connections resulting in a power law in the distribution of node degree.
Relationship: reasoning
Domain: Networks
Sentence 1: Then the system could be engineered so that TBS = TP2P = T. However, the p2p throughput may vary significantly among subscribers, which makes it more difficult to strike a balance TBS has to be larger than TP2P in order not to limit the subscribers that enjoy above­average p2p throughputs because that would in turn affect the p2p throughputs of other subscribers.
Sentence 2: in the quasi-static regime T = TP2P and TBS > TP2P.
Relationship: reasoning
Domain: Networks
Sentence 1: Due to the random selection of covering nodes to be included into the backbone, CSCA approximation algorithm does not produce a good re­sult in constructing the broadcast backbone.
Sentence 2: in our scheme LBAS, we completely exploit the propagational direction of broadcast message and the relationship between covering nodes and covered nodes, so as to design an e.cient strategy of connecting these nodes and the broadcast source for constructing the backbone.
Relationship: reasoning
Domain: Networks
Sentence 1: Because of this, we say that a network is an optimally synchronized network if all nodes in the network can achieve the optimality conditions of (3) and (4) and the mean squared error achieved in (4) for each node is the smallest possible mean squared error achievable for that node over the area of the network.
Sentence 2: the optimality condition for an optimally synchronized network is cj cj 2cj cj 2 E(dt -t d)=minE(dt -t d)for all j.
Relationship: reasoning
Domain: Networks
Sentence 1: Routing in Clos networks was mostly studied in the context of systems where a centralized control unit allocates virtual circuits to injected flows [19] (see Figure 1(a)).
Sentence 2: the network s topological properties that support strict sense non-blocking (SNB), rearangeable non-blocking (RNB) and wide-sense non-blocking (WSNB) [4] were defined.
Relationship: reasoning
Domain: Networks
Sentence 1: However, thegood newsisthat softinfor­mationisalreadycomputedatthePHYfordecodingchannelcodes, FlexCastonlyrequiresthePHYtoexposethisalreadycomputedin­formation.
Sentence 2: architecturally FlexCast is similar to the recently proposed SoftPHY abstraction [13] and uses a modular network stack at the receiver where the PHY interface is augmented to ex­pose softinformation along withdecoded bits.
Relationship: reasoning
Domain: Networks
Sentence 1: The factors that determine a transient s shape are poorly understood, perhaps because they are of limited use, since, lasting under 2µs in 802.11 [18], they can­not serve a protocol function.
Sentence 2: transients have to be treated essentially as arbitrary waveforms, and .nding a compact representation that will be e.ective for all possible transients involves heuristics and guesswork.
Relationship: reasoning
Domain: Networks
Sentence 1: Since all the nodes save their keys in the same places, once knowing where keys are stored, .nding the keys of the next compromised nodes will be a trivial task.
Sentence 2: our goal is two-fold: .rst, we will make identifying and re­vealing the keys of the .rst compromised node a challenge task; second, we will make the data structures for di.erent nodes di.erent, so compromising a subsequent new node is as hard as compromising the .rst one.
Relationship: reasoning
Domain: Networks
Sentence 1: 6(d + 1) Obviously, e(T ) = k. For a multicast tree T ', there are at most k leaf nodes.
Sentence 2: if we remove all edges in T ' incident on leaf nodes, the total edge length of all edges left is at least |T ' |- k · r. the '' number of internal nodes |I(T )| in T is at least |T '|-k·r .
Relationship: reasoning
Domain: Networks
Sentence 1: Ifthe corre­ 158 sponding IP address is on the list, the server answers with a TXT record; if it is not on the list, it sends an NX- DOMAIN answer.
Sentence 2: a-record answers resulting from those queries do not have any associated TCP con­nection, and should be excluded in calculating the ratio of TCP connections to DNS lookups (in estimating caching effectiveness).
Relationship: reasoning
Domain: Networks
Sentence 1: 3.2 Interworking Scheme 3.2.1 Interworking scheme with MIP for multihomed MS First, as the current MIP operation is only based on RA messages received from one specific interface, the MIP functionalities are only configured on the WLAN interface of dual-interfaced MSs.
Sentence 2: the MIP can only provide mobility management over the foreign network when the MS moves into the WLAN.
Relationship: reasoning
Domain: Networks
Sentence 1: In terms of feature vT(Y) = SDNT, we have p[(vT(Y) = SDNT) | True], and p[(vT(Y) = SDNT) | False).
Sentence 2: based on the NB classifier, NH can deduce the posterior probability of new received trust value p(True | New) = p(True) × p[(vTA = SDPT) | True] × p[(vT(Y) = SDNT) | True].
Relationship: reasoning
Domain: Networks
Sentence 1: Since all of the links we encoun­tered during the experiment campaign had a much smaller height than length, theyoperated in the 1/d4 regime of two-ray propaga­tion where d denotes the communication distance.
Sentence 2: we used the following simple expression for the RSSI-distance model: RSSI(d) = 10 log10(da)+ b (13) for some constants a and b.
Relationship: reasoning
Domain: Networks
Sentence 1: And when r> 0, we have i,a i,a (k)(k)(k)(k)  µa =0 and r -r = c(m -m )+µa ' = 0.
Sentence 2: i,a' i,a i,a' i,a by using this result and the KKT conditions, there exists an A TABLE 4 such that (h i ' (k)(k) (k) c qt(k)U (Rqt(k))+m> 0,a = A r = i i,a i,a i(13) 0, a>A, (k) .A (k) where R= r denotes the sum of data rates for ia=1 i,a different anchor points.
Relationship: reasoning
Domain: Networks
Sentence 1: As a result, transition costs depend only on the present state: the physical position of the node in the network and the coding scheme being used, and, since the output of a node (its coe.cient) is the same regardless of the previous path, costs up to a particular node do not in.uence the cost for a future transition.
Sentence 2: choos­ing a best path arriving to a speci.c state does not eliminate optimal paths.
Relationship: reasoning
Domain: Networks
Sentence 1: Let Eit denote the event that node i is not discovered in t slots.
Sentence 2: p(Eit)= P(Ni(t)=0) = e -tps Substituting ps = 1 asgivenby(1) intothe expressionfor ne P(Eit)yields - t P(Eit)= e ne ne P(¬Eit)=1- e - t We are interested in the probability that all n nodes are discovered by time t i.e.
Relationship: reasoning
Domain: Networks
Sentence 1: In the .rst regime, the minimum speed va is large such that va = r/c.
Sentence 2: suppose the encounter node moves at speed V and the observer node moves at speed v0, the corresponding connec­tion time is 2r 2r = = c. (52) V + v0 2va there is no connection time truncation at all observer and encounter node speeds.
Relationship: reasoning
Domain: Networks
Sentence 1: Speci.cally, to compute V (u, S), we may need to know V ( u, S - j) for all j .
Sentence 2: s and all u = u = M. instead of trying to compute these values and the associated strategies, we will use the above two formulations to derive fundamental properties of optimal strategies and use them to .nd simpler ways of determining optimal strategies in Section 4.
Relationship: reasoning
Domain: Networks
Sentence 1: These are inter-access-point interference (IAP), access-point-client interference (OAP/OC), and inter-client interference (IC) 2.
Sentence 2: the total interference in the network is the sum of these individual interferences and can be expressed as: NN NK Uint = -(Si=1Sj=1IAPij effi +Si=1Sv=1OAPiveffi KN KK +Sv=1Si=1OCvieffv +Su=1Sv=1ICuveffu) (4) where effi is the (assumed log-linear) effect of interference by access-point/client i on the throughput of the interfered access point or client.
Relationship: reasoning
Domain: Networks
Sentence 1: In the case of accurate information, d(Ri-1,D) - d(Ri,D) always has a value of ±1 or zero, as in Equation 1.
Sentence 2: pRi = {1+ k[d(Ri-1,D) - d(Ri,D)]} PRi-1 exp {k[d(Ri-1,D) - d(Ri,D)]} PRi-1 (2) The second line of Equation 2 is derived from the similarity to the low order terms of a Taylor series expansion of the exponential function (exp(x) ~ 1+ x).
Relationship: reasoning
Domain: Networks
Sentence 1: From Figure 2(a), we also see that once the time lag is above 20s, the median autocorrelation coe.cient is close to 0, and the 25-75th percentiles are in the range of [-0.05, 0.05].
Sentence 2: we expect that using the time windows that are within the last 20s is su.cient to predict network performance.
Relationship: reasoning
Domain: Networks
Sentence 1: Moreover, we assume that for each .ow, the packet is forwarded for one hop in each time­slot.
Sentence 2: the maximum delay for the transmission of a packet in our network model is k time-slots, or the delay constraint is D = k. In section 7, we will mainly use the 2In the random walk mobility model de.ned in [22], each movement either corresponds to a constant time interval t, or corresponds to a constant distance traveled.
Relationship: reasoning
Domain: Networks
Sentence 1: Figure 3: Illustration of the prohibited turns in the modi.ed odd-even routing (rules 4 and 5) Rules 4 and 5 ensures that the row of WN turn cannot have SW turn and the row of EN turn cannot have SE.
Sentence 2: like rules 1 and 2 these rules 4 and 5 will ensure the deadlock freeness if applied for 2D meshes by breaking all possible cycles as illustrated by Fig.
Relationship: reasoning
Domain: Networks
Sentence 1: Since the VDL-4 data link is duplex, each aircraft can be both a receiver and a transmitter at the same time, so there are N source-destination pairs if there are N aircrafts in the AANETs.
Sentence 2: the total expected bit-meters of the network is given by: 8 mitting to j, meanwhile k is transmitting to l in the same L E(t)= .dN · P(n = N) N=1 channel, easily we have |Xk - Xj|= (1 + .
Relationship: reasoning
Domain: Networks
Sentence 1: A packet of a .ow that belongs to grp1 will experience a (one-way) average end-to-end latency, equal to the sum of its queueing, transmission, and propaga­tion delays.
Sentence 2: the total average latency from the source to the destination of a grp1 packet equals q1LLq2LL +1+P1++2+P2,(1) CCCC 1 2 where qand qare the average queue sizes (measured in 12 number of packets, not counting the packet being transmit­ted) for the queues R1-R2 and R2-R3 respectively, and Lis the packet size.
Relationship: reasoning
Domain: Networks
Sentence 1: By considering the impact of the arbitrary power assignment on pair-wise transmissions scheduling, we explicitly show that when some node distance function is satisfied, there does not exist any power assignment for simultaneous link scheduling, and thus the scheduling complexity cannot be further improved via the means of power assignment.
Sentence 2: the scheduling algorithm must take full advantage of the power assignment schemes so that it can simultaneously schedule as many links as possible without violating the physical SINR model.
Relationship: reasoning
Domain: Networks
Sentence 1: The original formulation considers the problem of estimating point-to­point tra.c in a telephony network based on a known prior tra.c matrix and measurements of total incoming and to­tal outgoing tra.c to each node in the network.
Sentence 2: kruithof s method can, for example, be used to adjust the gravity model estimate to be consistent with measurement of total incoming and outgoing tra.c at edge nodes.
Relationship: reasoning
Domain: Networks
Sentence 1: As described in C-PNSS, the XH -XJ central angle .J.H can be calculated by formula .J.H = () d(J,H ) 2 *arccos 2*r .
Sentence 2: we can compute the coordinates of point B as follows: XB = XJ + r *cos(aJ.H -.J.H ) and YB = YJ + r *sin(aJ.H -.J.H ), while A, C, and D coordinates can be calculated in the same way.
Relationship: reasoning
Domain: Networks
Sentence 1: At each intermediate input j, tokens can only be received and granted (respectively pack­ets can only arrive and depart) every N time-slots.There­fore, at each intermediate input, we will cut time into frames of N time-slots.
Sentence 2: as detailed in the proof of strong stabil­ity [5], the intermediate input linecard operates at every frame in CMS with algorithm s as it would have at ev­ery time-slot in a single switch with the same algorithm s. under the same arrival pattern of request tokens in CMS (respectively of packets in a single switch), it takes the same number of frames for grant requests to exit inter­mediate input linecards (respectively the same number of time-slots for packets to exit the single switch) under the same algorithm s. In addition, in both cases, the tra.c arrival matrix is indeed the same, and therefore all tra.c arrival characteristics of this Bernoulli i.i.d.
Relationship: reasoning
Domain: Networks
Sentence 1: Again, taking expectations, we obtain N[] dq(t)[]Wi E-1q(t)C+E dt Ri(q) i=l N [] Wi E-1q(t)C+ Ri(q) i=l Now for a bottlenecked queue, we ll have q(t)>0with probability [] close to 1.
Sentence 2: we can approximateE1q(t)to obtain N dq(t) Wi -C+ (9) dtRi(q) i=l We have N+2coupled equations (4), (7), and (9) and N+2 unknowns, (x,q,Wi) which can be solved numerically.
Relationship: reasoning
Domain: Networks
Sentence 1: In the following, we will show that, roughly speaking, bucketing (i.e., with k buckets instead of 1) will reduce the standard deviation of our estimation of Lp norms by a factor v slightly less than k, provided that the number of .ows is much larger than the number of buckets k. Lemma 9 shows that the standard deviation for using l counters is in the v order of O(1/l).
Sentence 2: a decrease in l can be com­pensated by an increase in k by a slightly larger factor.
Relationship: reasoning
Domain: Networks
Sentence 1: During a busy hour, two transmitters, AP1 and AP2, alternatively send broadcast frames to a common receiver C.Table 2 shows that transmitter AP1 o.ers both higher signal strength and slightly lower overall loss rate in a 30-minute packet trace of an experiment that involved transmitting 720,000 data frames.
Sentence 2: if AP1 were an access point, the receiver would naturally associate with AP1.
Relationship: reasoning
Domain: Networks
Sentence 1: With respect to the .rst task, while for the MANET cre­ation component this requires parsing the user s input and generating an SSID string with autocon.guration informa­tion (according to the strategy shown in .gure 4), the au­tocon.guration component must merely parse the beacon received to extract con.guration information.
Sentence 2: while the latter task is achieved in just 4 µs, the former (SSID generation) requires 20 µs.
Relationship: reasoning
Domain: Networks
Sentence 1: 5.5 Remarks on Ef.ciency In case of roaming protocols the most signi.cant impact on the communication complexity has the number of com­munication rounds on the path with the highest round trip time, i.e.
Sentence 2: the link between F and H. several so­lutions for the non-tunnel-based roaming mentioned in Sec­tion 3 aim to minimize this number.
Relationship: reasoning
Domain: Networks
Sentence 1: Depending on the protocol timers, such an event is observed as a link .ap , yet the true underlying issues could be an optical re-route, possibly in response to a .ber cut (e.g., due to construction, hunting, shark attack).
Sentence 2: failure Rate (%) Duration (log scale) (a) (b) Figure 2: (a) Problem root-causes for long-haul links, and (b) Annualized downtime for long-haul links it is not possible in many cases to attribute the exact cause.
Relationship: reasoning
Domain: Networks
Sentence 1: M and F need not to be aware of each other, which is fairly natural in the case of roaming.
Sentence 2: in questions related to the authorized WRT participation both, M and F, rely on H. On the other hand, as part of their contract we assume that F creates a tunnel to H if it successfully authenticates H, whereas H accepts the provided tunnel after the success­ful authentication of F (in addition to the authentication of M).
Relationship: reasoning
Domain: Networks
Sentence 1: The sum of the absolute value of these di.erences is at most T1 + T2 (T1 is the total tra.c of the .rst measurement interval and T2 is the total tra.c of the second one) because each .owcan be associated with at most one most speci.c cluster in the report and the sum of the sizes of all .ows is T1 + T2.
Sentence 2: there are at most (T1 + T2)/H = s1 + s2 clusters in the compressed delta report.
Relationship: reasoning
Domain: Networks
Sentence 1: InFigure7weplotthenetworkostofeahalgorithmas thex­axisandusehitrate-thefrationofrequeststhatan besatisfedloally-asafgureofmerit.Foreahalgorithm weshowthehitrateonsideringboththehitratetofresh objetsandthetotalhitrateinludinghitsto"stale"ob­jets.Inthegraph,thefreshhitratesareshownwithflled symbolsandthetotal(fresh+stale)hitratesareshown withoutlinesymbols.
Sentence 2: notethatthepreseneofappliation­speifadaptation makes"hitrate"animperfetfgureofmerit.Inpartiular, whendisonneted,themobileodethatimplementsour CNNservieshowsusersonlythesubsetofloallystored stories.ratherthanallowinguserstolikalink andseeafailure,thesystemhidesuselesslinkssothatthe userwillbelessawareofmissingartiles.Wespeulate thatbyusingappliation­speifprioritizationofartiles suhastheHeadlinesalgorithmabove,andbyontrolling presentation,thisserviewouldprovidehighutilitytousers withamodestfrationofitstotalsetofartiles.
Relationship: reasoning
Domain: Networks
Sentence 1: Considering that the sound from an acoustic source spreads omnidirec­ tSw tionally, the source level is tSwLv1 0u1wLge(P W/ tSv1 0u1w)ge)v t7vLedoTs7e (29) 1P whereand 1represent the area measured one meter away from the te(a6 m (u v1n source and the standard intensity W m, respectively.
Sentence 2: the signal-to-noise ratio at the receiver can be expressed by the Passive Sonar Equation [12], tSvNetSwLTwLe vNwL Lit ) (30) tSw Tw vNw where is the source level,is the transmission loss, is the noise level, and itis the microphone directivity.
Relationship: reasoning
Domain: Networks
Sentence 1: AS s that wish to connect at a particular IXP have to physically come and make a connection at that IXP.
Sentence 2: since IXP s make a pro.t by providing basic infrastructure for AS s to make connec­tions and become neighbors, it would be in their interest to facil­itate the establishment of physically secure communication chan­nels and trust between neighboring AS s, as this would guarantee longer lasting business relationships for those AS s (which would equate to longer lasting pro.ts for the IXP connecting them).
Relationship: reasoning
Domain: Networks
Sentence 1: MATERIAL AND METHODS Since daily temperatures present a pattern that repeats in a cyclic way every day, we propose an algorithm that determines which pattern corresponds to the readings profile that are being made in real time by sensors deployed internally and externally in hives.
Sentence 2: our solution is able to detect pre-swarming behavior and at the same time save energy by reducing the data transmission to the sink node, which receives all the data sensed in the sensor nodes and sent over the network.
Relationship: reasoning
Domain: Networks
Sentence 1: From Claim 3.11 it follows that E[X] = a|S|for some constant a> 0, and because the distance between any two sinks in S is at least 4, the Xs variables are independent.
Sentence 2: we can use Chernoff bounds to obtain -E2a|S|/2 Pr[X =(1 -e)a|S|] =e for any e> 0.
Relationship: reasoning
Domain: Networks
Sentence 1: OnecanseethattheaggregatethroughputofPASisalwaysgreaterthan802.11,thusPASismoreef.cient.Itcanalsobeob­servedthatwhenusingPAS,thenumberofpacketsandthethrough­putofthefaststationremainalmostthesame,independentlyoftherateusedbytheslowstation.Thisisbecausethetimeoccupationisroughlydividedby2betweenthefaststationandtheslowstation.ThefairnessindexshowsthatPASachievesaverygoodfairnessintermsofmediumoccupancyinthesescenarios.
Sentence 2: thedifferencebetweenthetheoreticalresults(cf.Table1)andthesimulationresultscanbeexplainedbythebackoffalgorithmofIEEE802.11.Indeed,thebackoffalgorithmdoesnotprovideaTDMA-likeaccesstothemedium.Whenthereareonlytwosta­tions,eachstationcanaccesssuccessivelythemedium.InthecaseofPAS,thefaststationwill.rstaggregateitspacketsduringitstransmissiontimeandwhenitstransmissiontimeelapses,itwillsenditspacketsclassicallywithIEEE802.11ifitaccessessucces­sivelytothemedium.thisfeatureofPASreducesthethroughputofthefaststationbecauseitdoesnotalwaysaggregateitspackets.Thisreductioncanbeworsenedwhentheslowstationsendsalsosuccessivepackets.Thedifferencebetweentheanalyti­calresultsandthesimulationresultsincreaseswhenthedifferenceinthedatarateofthetwostationsincreases.
Relationship: reasoning
Domain: Networks
Sentence 1: On-goingstandardization efforts, including IEEE 802.11p, IEEE 1609, OSICALM-M5 and ETSI ITS, jointly with the growing interest of theautomobile industry, have played a major role in speeding up sucha process over the last few years.
Sentence 2: it will be soon time to .eldtest the vast amount of vehicular networking solutions proposed by Permission to make digital or hard copies of all or part of this work for personal orclassroom use is granted without fee provided that copies are not made or distributedfor pro.t or commercial advantage and that copies bear this notice and the full cita­tion on the .rst page.
Relationship: reasoning
Domain: Networks
Sentence 1: If a packet encounters multiple failures in standard Ethernet, a switch cannot determine the exact set of failures encountered by the packet, which can cause backup routes to form loops.
Sentence 2: the principal challenge in choosing an output path in Plinko is determining the set of failed links that have been encountered by a packet, which Plinko solves by introducing a new forwarding model that matches on the reverse path of a packet, which is accumulated in its header.
Relationship: reasoning
Domain: Networks
Sentence 1: One can argue that high-power links (such as base-stations and back-haul links) are more important than the low-power links.
Sentence 2: our design goals are, in the follow­ing order: (a) to avoid starvation of any link, (b) avoid signi.cant performance deterioration of high-power links and (c) increase the total throughput as much as possible.
Relationship: reasoning
Domain: Networks
Sentence 1: However, with multiple relays, a large number of sub-channels, multiple hops, anddue to discrete nature of the available number of sub-channels and time slots, the combinatorial complexity of the solution space blows up.
Sentence 2: in order to exploit the diversity of 1In this example, we attempt to maximize throughput simply for ease of illustration.Amore desirablegoalisto maximizea metric that also ensures some kind of fairness and we do account for that in the later sections.
Relationship: reasoning