sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: 5 with two egress nodes, at most three such topology views are needed regardless of the number of pre.xes.
Sentence 2: given the topology view corresponding to a destination pre.x P, FIFR can then be applied as is to determine interface­speci.c forwarding entries to P at a node such as E. Based on this view, the failure of primary NEXT-HOP node A or primary egress node C or primary peering link A-C, is in­ferred by E as the failure of node A, when the packet arrives through an interface along the reverse shortest path from E to A, i.e, A is the key node for that interface for desti­nation P. E will forward the packet towards the secondary NEXT-HOP B via egress node D. Since the topol­ogy view is consistent at all routers within the AS, the packet under FIFR gets rerouted consistently from a node adjacent to the failure to the destination via secondary egress D. Occasionally, FIFR may reroute packets to the secondary egress on a few intra-AS failures even when the primary inter-AS link is still up.
Relationship: reasoning
Domain: Networks
Sentence 1: Parameter settings in our scheme X 10000 Bytes Y 20000 Bytes Z 50000 Bytes D21 0 s D22 0.002 s D23 0.005 s D24 0.01 s Updating interval T 2 s  Xu Kaixin et al [4] identified the severe unfairness among TCP flows across wireless ad hoc and wired networks.
Sentence 2: we first adopt a scenario similar to situations used in [4] to show how our scheme solves the problem.
Relationship: reasoning
Domain: Networks
Sentence 1: Astherearenpartiesandtheadversaryanontrolup totofthem,theremaybeexeutionswheretwoorthreeof thepartiesareorrupted.However,insuhaase,agree­mentholdsvauously.Ontheotherhand,anyexeutionin whihallthreepartiesarehonestmustbeorret.There­fore,agreementanonlybefoiledintheasethatexatly onepartiipatingpartyisorrupted.
Sentence 2: wefrstlaimthatwhenAplaystheGeneralinanex­eution,itannotfoiltheagreement.ThisisbeauseP1 andP2'sviewsofthemessagessentbyA(playingG)are idential.Furthermore,theirdeisionmakingproessbased ontheirviewisdeterministi.theymustoutput thesamevalue.Westressthatthisisirrespetiveofhow manyexeutionshavepassed(andisalsonotdependentat allontheseurityofthesignatureshemebeingused).
Relationship: reasoning
Domain: Networks
Sentence 1: The area of the shaded region Da is A = vt · 2R.Using Assumption 5, the average number of nodes in Da is found to be equal to 2Rvt·s.
Sentence 2: the average number of nodes in Da with velocity v is equal to 2Rsvt·f(v, f)dvdf.This is just the average number of nodes with velocity v entering the zone within the next t seconds.
Relationship: reasoning
Domain: Networks
Sentence 1: This frees two domains to peer with a variety of technologies and layers (such as optical, MPLS, or Ethernet); different domains can choose to peer in different ways, and a single domain might employ many different peering technologies simultaneously.
Sentence 2: this separation of interdomain and intradomain addressing, by enabling general forms of peering, not only makes changing the L3 protocol easy, it does away with the concept of a universal networking layer altogether.
Relationship: reasoning
Domain: Networks
Sentence 1: Note that the observation time depends on the tunnel stability which is a.ected by the node mobility.
Sentence 2: we can infer how the mobility of nodes may Table 4: Error Probability versus the number of observations number of observations per node tPF PM 100 0.935 0.006 0.161 500 0.970 0.005 0.026 1000 0.978 0.007 0.003 a.ect detection performance, noting that tunnel instability may also degrade the e.ectiveness of the attack.
Relationship: reasoning
Domain: Networks
Sentence 1: For DVS, we consider an additional constraint be­cause, in practice, there is a minimum rate below which scaling 1To simplify notation, we omit the explicit indication of depen­dence on time t. Figure 1: Network topology Web traffic load Figure 2: Number of Power State Transitions the link rate offers no further voltage reduction.
Sentence 2: we in­troduce a maximum scaling factor f, such that f (µ)=O(µ3)for µ .
Relationship: reasoning
Domain: Networks
Sentence 1: Users can be subjected to these attacks without their knowledge because an adver­sary can carry them out without being visibly or physically present.
Sentence 2: in addition, users are vulnerable even when us­ing thebestexisting securitypractices,such asWPA.10ms 100 ms 1sec 1min 1hr SIGCOMM 2004 1.4 3.2 7.6 24.7 80.1 OSDI 2006 4.6 9.0 20.6 60.8 221.3 UCSD 2006 2.4 7.1 17.9 76.6 176.6 Table 1 Mean number of devices that send or receive 802.11datapackets atdi.erenttimeintervals attwoconfer-ences(SIGCOMM[25],OSDI[11]) and one o.cebuilding (UCSD [12]).
Relationship: reasoning
Domain: Networks
Sentence 1: In other words, it is only when the relative load is high in stable networks that Epidemic underperforms both MANET protocols and sophisticated disruption toler­ant protocols that intelligently route using a single copy.
Sentence 2: the question is how far can we get if we simply .x the one place Epidemic Routing is weak in when it is forced to drop packets due to storage or bandwidth considerations.
Relationship: reasoning
Domain: Networks
Sentence 1: pakets,rtpurplepaketsand1+bluepakets.Moreover, t(1+r)rs t+rt+rs=t.
Sentence 2: 1+r1+(1+r)2 thenumberofgreenpaketsremaininginQ(f) attheendofstage2are rs(1+r)1+r+r 2 rs-rs 2+2r+r2 1+(1+r)2 thenumberofpurplepaketsremainingatthesametime are 2r 2 s(1+r)sr 2(1+r+r 2 rs­ 2+2r+r21+(1+r)2 andthenumberofbluepaketsare rsrs(1+r)rs(1+r+r 2) -.
Relationship: reasoning
Domain: Networks
Sentence 1: The fixed values of each simulation put lenient stress on the network delays and throughput.
Sentence 2: we obtain four scenarios: Scenario Values of Fixed Parameters Variable 1 pctb=0.05, pct~=0.1, r=100 ), 2 )~=0.06, pct~=O.1, r=lO0 pctb 3 )~=0.06, pctb=O.05, pct~=0.1 r 4 )~=0.06, pctb=O.05, r=lO0 pct~, Table 1: Four Scenarios and Their Parameters Secondly, we also simulate the static scheduling algorithm, UxDMA, specified in [17], for comparison with PANAMA in the same simulation scenarios with as many similar param- ieters as possible, such as percentage of inactive links and .channel divisions into NAMA-UN, PAMA-UN and signal :sections, where UxDMA uses a different coloring scheme for each section.
Relationship: reasoning
Domain: Networks
Sentence 1: The nodes transmit by default on the 430MHz and the 2.4GHz ISM band and can not communicate with each other directly.
Sentence 2: one computer runs a bridging ap­plication written in GNU Radio which translates messages from the 2.4GHz ISM band using IEEE 802.15.4 for the physical layer to the 400MHz ISM band with a FSK modu­lation, such that they can be received by the CC1000 radio chip used in the Mica2 motes.
Relationship: reasoning
Domain: Networks
Sentence 1: Also, as remarked in the evaluation, the channel and interface selection done by the routing metric has a significant effect on the dynamic channel assignment, since only the free interfaces are considered by the dynamic algorithm, We believe that complex algorithms can offer an upper bound on the expected performance of a network, but do not fit well with the dynamic nature of multi-hop wireless networks.
Sentence 2: in real networks, it is common to implement more simple solutions like the ones analyzed in this paper.
Relationship: reasoning
Domain: Networks
Sentence 1: In contrast, Ubicarse s SAR localization can identify the global positions of the device s camera accurately, but has no information about the object.
Sentence 2: by combining the two methods, we can localize an object to within tens of cen­timeters in global coordinates a promising step towards a future where we can tag or search for objects in the physical world us­ing only our mobile devices, much the way we currently search for information on the web.
Relationship: reasoning
Domain: Networks
Sentence 1: The charge assigned to each node depends on the network topology and the traf.c conditions (through queue length 6For example, in large networks, a typical node may be connected to many other nodes, making c o much less than 1 for all iand j.Given o c o. that both Ejiand kEjkO(E)where Emaxi,jEij, c oeis ce much less than 1 for all iand j.
Sentence 2: the approximation can be used directly for such large networks.
Relationship: reasoning
Domain: Networks
Sentence 1: Backscatter is so incredibly simple in terms of circuitry that even matching the e.ciency of backscatter becomes a challenging architectural design problem.
Sentence 2: the crux of our argument is the following: backscat­ter drives down the optimal cross-over point between compu­tation vs communication, such that communication of raw data may be preferable to computation in a wider spectrum of real-world scenarios.
Relationship: reasoning
Domain: Networks
Sentence 1: Finally,note that the objective function of the formulation Prob(Y>r-1) can be rewritten as: 2n-1   ( )() -1th th ProbY>r joutcomeProbjoutcome j=0 This is because all the 2n outcomes are mutually exclusive and exhaustive.
Sentence 2: the objective function has a term yj wj for the jth outcome.
Relationship: reasoning
Domain: Networks
Sentence 1: The price pn(tn)can be interpreted as a measure of the congestion in contention neighborhood n when the total channel busy time is tn [11].
Sentence 2: qf (t)represents the congestion in all conges­tion neighborhoods traversed by .ow f. It has been shown in [11] that for any initial condition xf (0),the congestion control algorithm (8) converges to the unique solution of the relaxation de.ned in (4).
Relationship: reasoning
Domain: Networks
Sentence 1: The second radio is the same as the single radio.
Sentence 2: the energy used by the dual radios is: Ed = (0.36mA)(1.8V)(r - t) + (0.36mA)(1.8V)i +(0.66mA)(1.8V)q + (11.66mA)(1.8V)(2t) Figures 4 (bottom) and 5 (bottom) show energy costs (in milliwatts per second) of transfered data for biking and walking speeds, respectively.
Relationship: reasoning
Domain: Networks
Sentence 1: Qa,s-1.This is also true for the user u * .
Sentence 2: qa,s that is matchedwithnode va,s.' ' frac,w x (va,s,u ) y(va,s-1)= = ra,uu .Qa,s-1 ' ' x (va,s,u ) 1 int,w = = = y(va,s) ra,u ra,u * * u .Qa,s-1 We now consider the backhaul link.
Relationship: reasoning
Domain: Networks
Sentence 1: This is an effect of the increased multiuser diversity: the greaterthenumberofUEs,thehighertheprobabilitythatfor each subchannelthereisatleast oneofthemwithagoodCQI.However, thisincreaseissigni.cant only whenthe numberof usersislow.
Sentence 2: when more usersareinthesystem,themarginalimprovement due to multiuserdiversitybecomeslower sinceforalmostall the sub­channelsthereisa userwithgoodCQI.the curves seemto saturate around 18 users.
Relationship: reasoning
Domain: Networks
Sentence 1: CDS represents the dy­namic con.guration because we allow state changes to hap­pen.
Sentence 2: these compartments at theApplicationLayer are not deemed entirely trustworthy, they are monitored and if their state changes(e.g., alibraryisloaded) theirtrustwor­thinesshastobereassuredby thepeer viachecking the new con.guration with respect to its security policy.
Relationship: reasoning
Domain: Networks
Sentence 1: The probability of a single packet going through without queuing is much higher than the probability of a packet pair su.ering the same fate.
Sentence 2: by comparing the delay of the .rst (second) packet in the minimum delay sample with the minimum delay of the .rst (second) packet, we can identify incorrect minimum delays sums with the same probability as that of the .rst (second) packet not being queued in the network.
Relationship: reasoning
Domain: Networks
Sentence 1: Furthermore, since cellular 3G/4G antennas have state machines for radio resources allocation and management of energy consumption, the state promotion delay (the time duration required to bring the antenna to ready state) is of­ten longer than packet RTTs [11, 12] and might signi.cantly impact our short .ow measurements.
Sentence 2: to avoid this impact, we send two ICMP ping packets to our server before each measurement, and start the measurements im­mediately after the ping responses are correctly received to ensure that the cellular antenna is in the ready state.
Relationship: reasoning
Domain: Networks
Sentence 1: Indeed, by Lemma 4.3 (i), fa is continuously di.erentiable, so its antiderivative Fa is twice continuously di.erentiable, and so is La.
Sentence 2: by the second order mean value theorem, we obtain an equation similar to Equation (9): La(Q(t +1)) - La(Q(t )) LL ' di(t )fa(Qi(t)) fa(Qi(t )+ .di(t ))d2 = i +1 ii (t ) La 2 a(Q(t)+ .d(t)) a(Q(t )) La L a ( i di(t)fa(Qi(t )+ .di(t)))2 - .
Relationship: reasoning
Domain: Networks
Sentence 1: Thus,byexploiting multiuserdiver­sity,the systemthroughput canbeveryhigh.However,UEswith lower CQIs will never be served.
Sentence 2: an additional tech­nique hasbeenintroduced,i.e.,the fairness mechanism which, as visibleinthe .gure,willprovideserviceto alltheregisteredUEs.
Relationship: reasoning
Domain: Networks
Sentence 1: Traffic Trends Across Days Bytes toward Endpoint 1e+06 10000 100 1 0.01 0.0001  Endpoint ID Endpoint ID (a) Traffic from a CE to all other CEs in a VPN remains similar across multiple days.
Sentence 2: there is only coarse grained aggregate SNMP data of tra.c on the internal PE-PE links of the service.
Relationship: reasoning
Domain: Networks
Sentence 1: 10 000 Probe Response packets were created in 53 167 ms and the validation of 100 000 Probe Responses took 340 301 ms.
Sentence 2: on average Probe Response is created in 0.53 ms  Probe Response are veri.ed in 0.34 ms  on a low-cost hardware such as Meraki Mini.
Relationship: reasoning
Domain: Networks
Sentence 1: 7.2 Simulation Set-up: We use a 3GPP-calibrated system simulator to create a outdoor heterogeneous cellular network, with 19 macrocell sites (each has three sectors) and ten small cells per sector.
Sentence 2: the network has a total of 627 cells (57 macro + 570 small) based on the scenarios de.ned in 3GPP 36.814 [2].
Relationship: reasoning
Domain: Networks
Sentence 1: Furthermore, over the proposed ESnet topology, we were able to magnify TCP s inability (particularly Reno) to adapt appropriately to congestion over high bandwidth­delay links.
Sentence 2: the work presented here concludes that if we continue on the path that we are on using TCP Reno as the networking substrate for high-performance computa­tional grids overall network performance will suffer.
Relationship: reasoning
Domain: Networks
Sentence 1: This has paved the way for a new generation of smart receivers that are able to select the most appropriate access technology among those available.
Sentence 2: the notion of ubiquitous services be­comes extremely appealing, enabling a service to be ac­cessible through any available access technology, and en­abling receivers to choose the most suitable one, based on the QoS, connection costs, and channel quality.
Relationship: reasoning
Domain: Networks
Sentence 1: Speci.cally, upon receiving bids or updates to bids, the seller device sets (tc) .lters to classify .ows into one of a .xed number of pri­ority classes based on their resampled bids, which enables the kernel to enqueue packets in the appropriate priority queue.
Sentence 2: we get e.cient strict priority queuing with­out any kernel modi.cations, with the caveat that we can only use a small .xed number of queues.
Relationship: reasoning
Domain: Networks
Sentence 1: i}i=1 are known at the base station through the N feedback channel vector, all e.ective channel gains {di}i=1 (as de.ned in Section 2.2) of selected subchannels are avail­able in the base station.
Sentence 2: the sum rate of the re­ceive ZF scheduler can be further improved by using water­.lling power allocation.
Relationship: reasoning
Domain: Networks
Sentence 1: Corollary 1 For any .ow aggregation p that enters the path at link Li, i.e., p 8 ei = p, the process {Vi(p,t)} has ergodic stationary increments.
Sentence 2: the traf­.c intensity random variable Yi,d (p) converges to xp in the mean-square sense [()2] lim EYi,d (p) -xp=0.
Relationship: reasoning
Domain: Networks
Sentence 1: On the other hand, the only provably secure accountability protocols that are known to date require nodes to deploy a PKI or have shared keys, so having no PKI for FS-BGP-PD would yield no practical gains if the Inter­net does deploy a provably secure accountability protocol.
Sentence 2: in the beginning stages of partial deployment of secure path vec­tor protocols, it may be more bene.cial to deploy link certi.cates rather than have some nodes possess public keys but deploy no link certi.cates at all.
Relationship: reasoning
Domain: Networks
Sentence 1: The reason for checking for 3 consecutive BPDUs announcing increasing costs is that BPDUs are sent out if the bridge has new information to announce, or periodically every hello time, which is typically 2 seconds.
Sentence 2: it is unlikely that a path cost to the root will increase twice during two consecutive hello times, due to any reason other than a count to in.nity.
Relationship: reasoning
Domain: Networks
Sentence 1: A s gateway then translates the mes­sage to OSCAR (AOL s protocol) before forwarding the message to user A. Bifurcating Presence Information: The gateway must relay the presence information for users to their base networks while updating the user s status in the gateway-to-gateway network.
Sentence 2: in Figure 2, when MSN User M comes online, M s gateway will proxy the presence messages (as usual) to the MSN Network.
Relationship: reasoning
Domain: Networks
Sentence 1: For a given beacon, parameters which were allowed to mutate in­clude the number of Tar and Tsr receptors per cluster and , Kof f , Kon the reaction rates for the receptors (Ka on a s ,and Kof f s ).
Sentence 2: the pathway for a beacon has 6 parameters and the pathways for all 3 beacons have a total of 18 pa­rameters.
Relationship: reasoning
Domain: Networks
Sentence 1: Vari­ables a and .i are chosen to ensure E[Xi(t)] = E[(Xi(t)- Xi(t -1))2]= µi, where µi is the required mean.
Sentence 2: we again ensure that the variance of innovations for a .ow are of the same magnitude as the volume of the .ow, as seen in em­pirical studies [15].
Relationship: reasoning
Domain: Networks
Sentence 1: .0 = 2i log nPopt.As results, we have .i = (i +1) log nPopt, (8) 1 =i =Llog nJ.
Sentence 2: the total transmission power of an approximate minimum-energy broadcast tree is Llog nJLlog nJ .. 3 .i = (i +1) log nPopt = O(lognPopt).
Relationship: reasoning
Domain: Networks
Sentence 1: Our analysis on the synthetic classifiers generated by ClassBench [4] find that 95.8% of the time the number of matching rules is no more than 10.
Sentence 2: the number of 0  0 1 0 2 0  0 3 3 0 eqID1 eqID CBM  0 80001 0 1 91001 2 1 10 0111 23 11 12 5 OIndex (100) 15 7 Chunk 1 eqID2 17 ranges to be matched after the first stage is limited.
Relationship: reasoning
Domain: Networks
Sentence 1: Wehave analyzed the latency from the client viewpoint.
Sentence 2: the latency measures the time interval starting when an HTTP client sends the HTTP request, and ends when the last packet of the HTTP response arrives at the client node Short Flows(SF) Long Flows(LF) Short Flows Long Flows 0.8 10 DropTail 0.6 8 RED 6 0.4 PLF Packet loss (%) 0.0 0.5 1.0 1.5 2.0 2.5 3.0 3.5 Packet loss (%) 0.0 0.5 1.0 1.5 2.0 2.5 3.0 3.5 PLF RED DropTail 4 0.2 2 1000 10 0.0 12 0 800 5 600 6 85 400 10 10 4 200 2 15 15 0.8 10 0.6 8 6 4 0.4 0.2 2 1000 0.0 12 0 800 10 600 5 85 6 400 10 10 4 200 2 15 15 2 4 6 8101214 2 4 6 8101214 HTTP Traffic Load (conn/s) HTTP Traffic Load (conn/s) Figure 7: Packet loss for short and long .ows.
Relationship: reasoning
Domain: Networks
Sentence 1: Finally, we com­pare two possible optimal retrieval sequences to obtain the optimal one with minimized access latency.
Sentence 2: p = {p1, p2, p3, p4, p5, p6, p7, p8, p9} (2)  Figure 2: Convert ODR-TC to DAG p1 = {node1, node2, node7}, p2 = {node1, node7}, p3 = {node1, node4, node7}, p4 = {node1, node6, node7}, p5 = {node3, node4, node7}, p6 = {node3, node7}, p7 = {node3, node6, node7}, p8 = {node5, node4, node7}, p9 = {node5, node6, node7} (3) we develop an algorithm SAP (M) to search all paths based on Algorithm 1, as shown in Algorithm 2.
Relationship: reasoning
Domain: Networks
Sentence 1: Furthermore, to effectively prompt the bearer selection, we design the lingering index according to the following general rules: (i) the index is positive when a node is well within the target area or it is approaching it; (ii) the index is negative when a node is at the area border or outside the target area.
Sentence 2: a negative lingering index is associated with the need to look for a better bearer.
Relationship: reasoning
Domain: Networks
Sentence 1: Itiseasytoseethatthe reroutedtraf.c is upper boundedbythe capacityof eachfailed link(aslongasno link is fully utilized under the base routing r).
Sentence 2: for every link in the network we create a virtual demand that is equal to its link capacity; the convex combination of all such virtual demands should cover the entire space of rerouted traf.c.
Relationship: reasoning
Domain: Networks
Sentence 1: The selective monitoring reduces the overheads by identifying areas with a similar spectrum condition and merging them together 60 40 20 as a unit measurement block.
Sentence 2: the main questions that the selective monitoring has to answer are: (1) how small or large the blocks are, (2) how to make a trade-off between ef.ciency and accuracy, and (3) how much of bene.t the selective monitoring can provide over the complete monitoring.
Relationship: reasoning
Domain: Networks
Sentence 1: Thedefer timeisgivenby the expression 2d*C R * DTmax, where dC is the distance of the re­sponding vehicle from C, R is the transmission range, and DTmax is a constant value expressing the maximum defer time.
Sentence 2: a vehicle closer to C will respond sooner than a vehiclefartherfrom C.Thevalueforthe max­imum defer time DTmax is strongly related to the density of vehicles traveling along the avenue, which can be estimated based on statistics stored on the vehicles devices.
Relationship: reasoning
Domain: Networks
Sentence 1: In basic DEAR, the objective function F(bb, p) is the revenue func­tion; and in extended DEAR, the objective function is the revenue function divided by the number of channels.
Sentence 2: in a spectrum auction, once the graph of bidders location is giv­en, the allocation scheme bx is only depends on parameter bb and p. we can denote the revenue function as Q(bb, p), and Q(bb, p)= pSixi(bb, p).
Relationship: reasoning
Domain: Networks
Sentence 1: (due to the symmetry of the construction) that variables xi and xj are set to false, while variable xk is set to true in the assign­ment, thus the clause c =(xi,xj,xk) is 1-in3 satis.ed, and thus the radii of nodes xi and xj are 1 and the radius of node xk is 2.
Sentence 2: variable node xk reaches its sink tck directly and nodes xi and xk reach their sinks tci and tjc via node xk.
Relationship: reasoning
Domain: Networks
Sentence 1: Note also that routers originally introduced as core routers are routinely con­scripted into being edge routers a few years later when core speeds increase.
Sentence 2: it is quite common in modern high speed router design (for either the edge or the core) that a single scheduler ASIC de­sign struggles to maintain the scheduling state for a large number of queues using a bounded amount of on-chip SRAM.
Relationship: reasoning
Domain: Networks
Sentence 1: Appendix I The derivation of p and q Since p represents the probability of .nding at least two nodes in a particular cell, the opposite event of it is there is no node (and this happens with a probability of (1 - 1 c )n) or only one node in the cell (this occurs with a probability of n )n-1 c (1 - 1 c , where n infers that the node in the cell can be any one among all n nodes of the network).
Sentence 2: we have the expression of (2).
Relationship: reasoning