sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: THEOREM11.Algorithm 1 can .nd a constant approximation solution for One-Slot link scheduling problem.
Sentence 2: pROOF.ByTheorem8andTheorem10, ALG(L1)= .1 · OP T (L1),ALG(L2)= .2 · OP T (L2) max(ALG(L1),ALG(L2)) 1 =· (.1 · OP T (L1)+.2 · OP T (L2)) 2 1 =· max(.1,.2)· (OP T (L1)+OP T (L2)) 2 1 =· max(.1,.2)· OP T (L) 2 Thereforemax(ALG(L1),ALG(L2)) iswithinconstantapprox­imationratiooftheoptimumsolutionforOne-Slotscheduling.SinceAlgorithm1choosesitasthereturningresult,ourproofisdone.
Relationship: reasoning
Domain: Networks
Sentence 1: For values of p smaller than 0.02, the number of transmitted packets in RAM, DAS and SSD is re­spectively 1.19, 1.12 and 1.02 timesgreaterthan the regulargraph.
Sentence 2: using the SSD model, it is possible to construct an ef.cient network with afewernumber ofpackets.For p =0.1, the number oftransmittedpacketsbyRAM,DAS andSSDis respectively 2.21, 2.15 and 1.10 timesgreater and the number of transmittedpackets by the regulargraph.
Relationship: reasoning
Domain: Networks
Sentence 1: The results show that EBbit = 0.073pJ, which is indeed negligi­ble compared to ELbit (typically in the order of pJ).
Sentence 2: in our new model, the average energy con­ sumption of sending one bit of data from tile ti to tile tj is: ti,t j E = nho ps × ESbit +(nho ps - 1) × ELbit (4) bit where nho ps is the number of routers the bit passes.
Relationship: reasoning
Domain: Networks
Sentence 1: The basic idea is that, through a sequence of streams with di.erent rates, iterative probing can converge to A.
Sentence 2: the basic equation behind iterative probing is: Ro(k)  A; else Ri(k) A (10) A key point about iterative probing is that it does not sam­ple the avail-bw process; instead, it only samples whether a rate is larger than the avail-bw or not.
Relationship: reasoning
Domain: Networks
Sentence 1: The noise amplitude due to ma jority of v the appliances at around 10 MHz is below -30 dBuV/ H z [13].
Sentence 2: under most circumstances, the noise PSD at 10 MHz is within the acceptable phase noise (-90 to -100dBc/Hz) for a reference clock that is used to generate RF carriers for Wi-Fi applications.
Relationship: reasoning
Domain: Networks
Sentence 1: For example, since transmissions A -AP1 and B -AP2 (See Figure 2a) are part of induced acyclic subgraph of the dependence graph, therefore both these transmissions can be suppressed at the end of slot 1.
Sentence 2: to compute the largest set of suppressed nodes in this slot, the CS computes the maximum Induced Directed Acyclic Subgraph (IDAS) of Gd.
Relationship: reasoning
Domain: Networks
Sentence 1: Overview of dataset  The number of packets 12300601 The number of Flows 155758 The number of services 6506 We alter the open source nDPI library, update the fingerprint library, and remove the fingerprint of RDP (Remote Desktop Protocol), so that the library cannot identify the traffic of RDP.
Sentence 2: the set of unknown flows contains the real unknown traffic and RDP traffic.
Relationship: reasoning
Domain: Networks
Sentence 1: Bydeploying mul­tiple radio interfaces on each node and tuning them into non­overlapping channels, wireless nodes are able to transmit and receive packets simultaneouslyand mesh nodes on differ­ent channels can transmit concurrentlywith minimal interfer­ence.
Sentence 2: more radio spectrums can be effec­tivelyexploited in one single wirelss network, which leads to uration has raised a number of research challenges for wire­less mesh networks, such as optimal channel assignment, new MAC scheme design, load balancing, and optimal routing.
Relationship: reasoning
Domain: Networks
Sentence 1: Denote SINRth and SINRth as PU SU the signal-to-interference-plus-noise power ratio (SINR) thresholds to achieve a target bit error rate BER * for primary users and PU BER * SU for secondary users, respectively.
Sentence 2: at each time slot the global objective is to .nd global vectors R, F, P that max­imize the sum of spectrum utilities over the activated links, under given BER and power constraints.
Relationship: reasoning
Domain: Networks
Sentence 1: Then by using Pr (Xi,j = 1)) =m(1 - (1 - )k) Azuma s Inequality, we can prove that, with probability at least m j=1 -ns 1 - 2e /8, the total load L = nsm/4.
Sentence 2: by Pigeonhole  v  principle, there is one cell such that its load (the number of .ows using its base-station) is at least ns/4.
Relationship: reasoning
Domain: Networks
Sentence 1: For example, if a program uses the rdtsc x86 instruction, we can leverage the knowledge that it takes no input and returns a 64-bit output representing the current value of the processor s time-stamp counter, which is placed in registers EDX:EAX [4].
Sentence 2: at the time of execution when the program uses rdtsc, Dispatcher taints the EDX and EAX registers with a unique source identi.er and offset pair.
Relationship: reasoning
Domain: Networks
Sentence 1: x For the node distances, if source node S chooses node A, it results in a decrease in the delivery ratio, as well as an increase in delay, because node A is farther from source node S compared to node B.
Sentence 2: nodes equipped with the DiPRoPHET protocol are able to know the distance between their neighbors and choose a better or nearby node as their message forwarder.
Relationship: reasoning
Domain: Networks
Sentence 1: 1 (b) E and F receive four times less traf.c than D,and for traf.c .ow­ingintheoppositedirection, A and B receivefourtimesless traf.cthan C. Similarly, while a per destination allocation model has somedesirableproperties,suchasprovidingprotectionagainst DoSattacks[18],itisnotfairtosources.
Sentence 2: thesealloca­tionmodelsareasymmetricinthattheycanonlybefairwith either sources or destinations, but not both.
Relationship: reasoning
Domain: Networks
Sentence 1: We model that process of node A as a continuous-time Markov chain (CTMC).
Sentence 2: in our scheme, node A leaves its current cluster if its intra-connection degree is below or equal to a critical value, c. in this model, node A is in state j if and only if the intra-connection degree, or the number of intra-links, is j+c.
Relationship: reasoning
Domain: Networks
Sentence 1: In our example, M3 (the only nodein the candidate set) can see thatits only neighbor M6 will receive the transmission of M7 , whichisin F4.
Sentence 2: m3 doestransmitP .Noticeherethatsincethelocation of M7 are attachedto P , M3 can verifyif M6 belongstoN7 or not.
Relationship: reasoning
Domain: Networks
Sentence 1: The timing of ACKs, however, is determined by a number of e.ects, including queueing of the data packets in the forward path, random delays at the receiver, as well as queueing of the ACKs in the reverse path.
Sentence 2: the sender has no direct control on the timing of packet departures, and so, under certain conditions, it can send a large number of packets at a rate that is much higher than the .ow s average throughput.
Relationship: reasoning
Domain: Networks
Sentence 1: This, in turn will cause node v1 to increase its o.er to source S from 16 to 26, which  in turn will make the o.er of v4, which is 21, the most attractive for source S to choose, thus resulting in a chosen path S,v4,v5,D with node v5 receiving a payment of 21 - 5 + 1 = 17.
Sentence 2: node v5 now makes a pro.t of 17 - 1 = 16 as opposed to a pro.t of 0 before cheating.
Relationship: reasoning
Domain: Networks
Sentence 1: CW hbChW T HA HAHA SHA Next, FA decrypts W with its secret key SFA to obtain h(h(N||IDMU)), x0 and x.
Sentence 2: fA can get the session key k between FA and MU, where The authentication message n is used to protect the real identity k = ((( || ID )) || x || .
Relationship: reasoning
Domain: Networks
Sentence 1: Finally, a bystander only broadcasts its own view of some receiver s schedule (a) after backing o. for a du­ration that depends on how recent it believes its view to be; and (b) if the bystander has not overheard a newer version of the schedule in the meantime.
Sentence 2: in LOG, a node updates its view of another node s schedule by observing any transmission which contains a newer version of that node s schedule.
Relationship: reasoning
Domain: Networks
Sentence 1: To do so, IAC exploits two properties of MIMO LANs: 1) MIMO transmitters can control the alignment of their signals at a receiver, and2)APs aretypically connectedtoa backend Ethernet, which they can use for coordination.
Sentence 2: in IAC, the two clients encodetheirtransmissionsinaspecialway toalignthe secondand the third packets at AP1 but not at AP2, as shown in Fig.
Relationship: reasoning
Domain: Networks
Sentence 1: When we compare between the probe request intervals of two machines using the same driver and the same OS, we are left with mainly dm + dn, which is miniscule in nature.
Sentence 2: in order to develop a feasible fingerprinting approach to distil out these differences, we must deal with two main problems: (1) The clock skew between machines must be measurable using our approach, i.e.
Relationship: reasoning
Domain: Networks
Sentence 1: The traf.c in a sensor network is different from conventional networks; it is a collective com­munication operation with redundancy.
Sentence 2: the network pro­tocol has the .exibility of meeting the performance demands by controlling the reporting rate of the sensors, controlling the virtual topology of the network (by turning off some sensors for example), or optimizing the collective reduction commu­nication operation (by fusing data along the way for example).
Relationship: reasoning
Domain: Networks
Sentence 1: pm,n = ¯Note that (16) has an intuitive meaning: each player at NE Pm (7) must dedicate its total available power on all carriers, due to n pm,n = 0 which is a convex optimization, since the objective function is concave in pm and the constraint set is convex.
Sentence 2: the Karush-Kuhn-Tucker (KKT) condition of the optimization is suf.cient and necessary for the optimality [6].
Relationship: reasoning
Domain: Networks
Sentence 1: BUILDING BLOCKS j=1 In this section we describe components that are used in our SFCA approach and present the criterion used in the proposed algorithm.
Sentence 2: we have the following matrix identity: Then, we illustrate the technical background of our study, namely the Extended Kalman filter, 802.11 ranging approach and a quick T =G+ B (7) view on multi-lateration.
Relationship: reasoning
Domain: Networks
Sentence 1: In­stead,atenant scomputeinstances(virtual machinesor,in short, VMs) communicate over the network shared amongst all tenants.
Sentence 2: the bandwidth achieved by traf­.c between a tenant s VMs depends on a variety of fac­tors outside the tenant s control, such as the network load and placement of the tenant s VMs, and is further exacer­bated by the oversubscribed nature of datacenter network topologies [14].
Relationship: reasoning
Domain: Networks
Sentence 1: Then we can relate this to a node s cost by setting a/(a + b)= b/(2(a + b)) and a/(b/2+1) =(b/2)/(b/2 +1) yields a = b/2 (or, for general k, a = b/k).
Sentence 2: a common solutionisb =1and a =1/2 (or, in general, a =1/k).
Relationship: reasoning
Domain: Networks
Sentence 1: Since, in Step 2, the receiver is focused on estimating the interferer s ratio, the signal of interest plays the role of noise; reducing this signal s magnitude increases the accuracy of the ra­tio estimate.
Sentence 2: this higher accuracy in the ratio ßj percolates to the estimate of s(t) inStep1.thedecoded bits are more accurate and lead to even smallerdifference between s(t) and s(t), andhence an even more accurate ßj .
Relationship: reasoning
Domain: Networks
Sentence 1: According to the operations of the adopted switch, the label of an arriving packet will be sent to the scheduler to be processed the moment it enters the corresponding M-FDLs, and its copy can leave the M-FDLs and enter the switch as early as it reaches the .rst coupler (i.e., after a delay of T , where T is the time slot length).
Sentence 2: the scheduler must determine the following within a time slot: (1) whether or not the packet is allowed to be switched in the next time slot; (2) if it is to enter the switch, which outputs will it be delivered to, such that no output contention could occur.
Relationship: reasoning
Domain: Networks
Sentence 1: Statistically we em­phasized the validity of the model for the presented scenario by performing a .2 test.
Sentence 2: we discretized the dis­tances between RSU and vehicles into 1001 bins of 1m and hence obtained 1000 degrees of freedom (note, that distance 0.0025 600 based on NS-2 simulations based on proposed model receptions derived from NS-2 simulations reception according to proposed model 500 0.002 400 pmf-value number of received samples 300 200 0.0005 0 0 200 400 600 800 1000 distance sender/receiver [m] Figure 9: Probability mass function of successful packet receptions for proposed model and NS-2 simulations.
Relationship: reasoning
Domain: Networks
Sentence 1: As soon as the loss rate is reduced to its original value, the probability that suspended .ows reentering the protected time will immediately be suspended again (and the probability that the random experiment of .ows in the on-state will fail) decreases.
Sentence 2: after time 300s, the random experiments of more and more .ows succeed, until about 50 sec­onds later the TCP-friendly rate is reached again.
Relationship: reasoning
Domain: Networks
Sentence 1: Note that the region G is a disk of radius 1, and that all of the disks that we use to cover G are unit-disks (i.e., of radius 12 ).
Sentence 2: for any Lp norm, in a d-dimensional space, the ratio of the area of G to the area of a unit-disk is 2d.we need at least 2d disks to cover G i.e., N = 2d for any dimension d = 1 and any norm Lp.
Relationship: reasoning
Domain: Networks
Sentence 1: Observe, if the family of cost functions FB is assumed to be .xed, then a is a constant or in.nity.
Sentence 2: we can conclude that for every .xed family of cost functions the coor­dination ratio is either unbounded or it is polynomially bounded in the number of servers, m. Let us illustrate the power of the above theorem by investigating some examples.
Relationship: reasoning
Domain: Networks
Sentence 1: These concepts reinforce our approach in which context is identified by the combination of computing context (network conditions involving two end points in a specific time) and user context (personal preferences and expectations), characterizing a user s situation dealing with an application.
Sentence 2: instead of the traditional User x Item relation, in this proposal the recommendation process was conceived to deal with a three­dimensional User x Application x Network performance relation.
Relationship: reasoning
Domain: Networks
Sentence 1: Forhardwarethatislikelytobedeployedinthenearfuture(Section 2.1), the energy consumption function e(x)is not convex and it is not doubly-differentiable(e.g., Figure2)1.
Sentence 2: we cannot easily 1 Convexifying the non-convex objective in the problem formu­ sleeping, because large savings arepossible with rate adap­tation andbaseline consumptionislow.
Relationship: reasoning
Domain: Networks
Sentence 1: In particular, since each RB experiences its own SNR vector, the optimization problem in (1) should be re-optimized for each RB.
Sentence 2: the Basic Allocation al­gorithm leads to the best performance if the SNR experienced by the packets is provided in the feedback channels, driving the sys­tem to be extremely sensitive to non-ideal or outdated channel es­timations.
Relationship: reasoning
Domain: Networks
Sentence 1: We used the RSSI measure­ ments between the pair sni.er/APREF to sense whether the WLAN propagation environment has changed and when the RPM should be rebuilt.
Sentence 2: assuming that RSSI follows a Gaussian distribution, av­ erage µi,n and standard deviation si,n can be estimated by real-time measures between the pair sni.er/APREF .it is possible to reconstruct the RPM for each pair snif­ fer APREF every time RSSI values measured by the sni.er i from the APREF n shows relevant statistical deviations.
Relationship: reasoning
Domain: Networks
Sentence 1: constraint and S is a posynomial program that approxi­mates the signomial program S. Moreover, the arithmetic­geometric inequality implies that g.l(x) = gl(x).
Sentence 2: if x is feasible for S., then it is feasible for S. The minimum value for S., M(S.), is an upper bound on the minimum value for S, M(S).
Relationship: reasoning
Domain: Networks
Sentence 1: Although all these standards use the same license-free industrial scienti.c and medical (ISM) band, theycannot communicate with one another because of the signi.cant difference in their physi­cal (PHY) and medium access (MAC) layer design.
Sentence 2: to si­multaneously use heterogenous wireless standards, multiple Ac­cess Points (AP) or Network controllers (NC) are needed, adding considerable management overhead and cost.
Relationship: reasoning
Domain: Networks
Sentence 1: Although these schemes can improve TCP performance to some extents, they still rely on the TCP layer to carry out congestion control algorithms, which cannot solve the problems discussed above thoroughly [10].
Sentence 2: semi-TCP was proposed recently in [10] by mov­ing congestion control from the transport layer down to the lower layer in order to realize hop-by-hop congestion control in the MAC layer for multi-hop wireless networks.
Relationship: reasoning
Domain: Networks
Sentence 1: Observe that for queue sizes of approximately 5 packets, TCP/OAR and TCP/RBAR ob­tain throughputs nearly identical to that achieved with a very large bu.er size.
Sentence 2: as OAR can transmit up to 5  [L , L] [H , L] [L , H] [H , H] Channel Quality [flow A , flow B] (a) Time Share (b) Throughput Gain packets back-to-back, it is critical for the intermediate node to be able to transmit at least this many packets.
Relationship: reasoning
Domain: Networks
Sentence 1: 1+(1+)2 1 Stage3:Duringr+1+rssteps,AinjetsintoQ(e1), 12 '' r+1+rsredpaketswithdestinatione1gf.Atthe endofthisfnalstage,Q(e1)willontainatotalnumberof paketsof 1+r1 2 rs+r+rs 1+(1+r)2 1+r 11 2 +r+rs-rsr+ 1+r1+r allofthemwaitingtogothroughedgee1andontinue '' throughgf.
Sentence 2: ifweompares,thenumberofpaketsinQ(eo)atthe beginningofthephase,andthenumberofpaketsinQ(e1) attheendofthephase,toassurenon-stabilityweneed, r(1+r)1 r(r-1)r++r 2 -1>0 1+(1+r)2 1+r whihimpliesthatr?0.8357.wehaveproved thestatementofthetheorem.
Relationship: reasoning
Domain: Networks
Sentence 1: (54) In addition, we can obtain the claimed bound for t ' = t + T(*), where T(*) is the time cost used for generating 1 (u ' , (u ' )y, (u ' ) y+1 m1 , ··· , (u ' ) y+mqS ) and g y+1 m. .
Sentence 2: this completes the proof.
Relationship: reasoning
Domain: Networks
Sentence 1: -Note that: .fij + fi,INT =1 j Then, the inter-VLAN traf.c communication costs InterVLANi for VLAN i, when choosing Ri as its gateway router is: Ni×Ti×[d(Vi,Ri)+fij ×d(Ri,Rj )+fi,INT ×d(Ri,RINT )] j (3) Here, RINT represents the gateway router to the Internet.
Sentence 2: the last term models the traf.c exchanged be­tween VLAN i and the Internet.
Relationship: reasoning
Domain: Networks
Sentence 1: Our approach conceptually results in a   Figure 3: Dynamic o.oad message .ow transparent split of the tunnel between the eNodeB and the original S/P-GW so that regular tra.c is still carried to these original gateways, while o.-loaded tra.c is carried to the new S/P-GW.
Sentence 2: creation of data tunnels with proper state in cloud-based S/P-GWs and establishment of o.oading policies in the network using the middlebox com­plete our MOCA realization.
Relationship: reasoning
Domain: Networks
Sentence 1: 12, when the SIR at Alice decreases below -3dB, Alice ex­periences 5% BER decoding Bob s signal, but Bob has 0% BER decoding hers.
Sentence 2: as one of the two signals becomes increasingly weaker than the other, ANC s performance degenerates to that of the current approach, where the stronger signal captures the medium and the weaker one gets ignored.
Relationship: reasoning
Domain: Networks
Sentence 1: It is well known that the sending rate of TCP is R = W/RT T Since the bu.er is empty, we have no queueing delay.
Sentence 2: to send at rate C we require that WWmax/2 C == RT T 2TP or Wmax/2=2TP × C which for the bu.er leads to the well-known rule-of-thumb B = 2Tp × C = RT T × C. While not widely known, similar arguments have been made previously [9, 10], and our result can be easily veri.ed using ns2 [11] simulation and a closed-form analytical model [7] Figure 4 illustrates the evolution of a single TCP Reno .ow, using the topology shown in Figure 2.
Relationship: reasoning
Domain: Networks
Sentence 1: Based on the Pdensity sub-protocol and a particular value of dinit set by the protocol implementor to re.ect the de­sired conditions of the network, the local energy saving speci.cation en is adjusted as follows: dlocal(t) dS W = Ts · - Ts (2)dinit Ts = Ts + dS W , Tw = Tw - dS W (3) This setting allows particles to sleep more (or less) when the detected local density is higher (or lower) than dinit speci.ed by the network implementor.
Sentence 2: the proto­col tries in each adaptation phase to converge to an opti­mal (with respect to current network conditions) power save scheme.
Relationship: reasoning
Domain: Networks
Sentence 1: However, while packets are routed only via HA in Mobile-IP, packets must be routed via two delegation router- s or one more default router in our proposed method when a communication source host and a communication destina- tion mobile host do not exist the same level 1 group.
Sentence 2: to route packets, delegation routers and default routers must refer to their own location information tables communication overhead of our proposed method is larger than that of Mobile-IP.
Relationship: reasoning
Domain: Networks
Sentence 1: We assume that all events concerning client activity affect only one di­mension of the state, i.e., when a message is requested and sent, it will not be cached in the cache of any intermediate broker other than the serving one and only the newly arrived client will receive it.
Sentence 2: for each transition from state s to state s ,weget si = si, .i = j, where j is the dimension where the change is taking place.
Relationship: reasoning
Domain: Networks
Sentence 1: bigger than 10 dB as our de.nition of poor conditioning, we .nd that the channel is ill conditioned with a probablity of about 50% even at relatively large antenna separations.
Sentence 2: while there may well be performance gains from an adaptive strategy that trades o. diversity and multiplexing depending on the channel condition number, we focus in this paper on determining how predictable a performance can be obtained by pure diversity strategies.
Relationship: reasoning
Domain: Networks
Sentence 1: C pw [BB PP ] (X, t), (X, t)(X, r ), (X, r )(40) haf cscsmcscscs Lemma 13 shows that the feasible states of the dual chan­nel dual aggregate carrier-sensing decision model d.4)en­compass the feasible states of the pairwise dual carrier carrier­sensing decision model d.1), with suitably chosen carrier­sensing range.
Sentence 2: by Lemma 13 and Theorem 3, we can show that the implementable dual channel dual aggre­gate carrier-sensing decision model d.4) can achieve through­ () put as as Ov1n on a uniform random network.
Relationship: reasoning
Domain: Networks
Sentence 1: In other words, v t kra, when k = .1a 2/r2 | Area(T )|= c0 (8) (2a 2 , when k = .1a 2/r2 v Notice that when k = O(a 2/r2), kra = O(a 2); when k = v O(a 2/r2), kra = O(a 2).
Sentence 2: we have a general bound for | Area(T )|: almost surely the area covered by all trans­mitting disks of a multicast tree for k receivers/source v | Area(T )| = O(min(a 2 , kra)).
Relationship: reasoning
Domain: Networks
Sentence 1: DDn() rf are the application layer abstracted parameters, lf and DD n() which express the expected distortion when the nth slice is lost and when the nth slice is received correctly, respectively.
Sentence 2: l() Pn is the probability of loss of the nth slice, which can be derived from the radio link layer abstracted parameters, given by qn Pn() = () (16) L () +qn() pn Dx() is the expected distortion of the current frame nAtransmission in the current wireless channel condition.
Relationship: reasoning