sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: On the other hand, a P2P user may be browsing the web or sending email while connected to a P2P network.
Sentence 2: to minimize false positives we exclude from M3 all .ows whose source or des­tination port implies web, mail, FTP, SSL, DNS (i.e., ports 80, 8000, 8080, 25, 110, 21, 22, 443, 53) for TCP and online gaming and DNS (e.g., 27015-27050, 53) for UDP 2 .
Relationship: reasoning
Domain: Networks
Sentence 1: Nr Case 2: There is an interval [t, ¯bk], t< ¯bk, in which all MSFQ servers are continuously busy: Let g be the smallest integer, such that all MSFQ servers are busy between ¯bg and ¯ bk.
Sentence 2: let m be the largest integer greater than or equal to g that satis.es both g = m = k-1and dm >dk.for mdk =di Then, packet pm is scheduled before packets pm+1,··· ,pk under MSFQ but pm departs after all these packets under GPS.
Relationship: reasoning
Domain: Networks
Sentence 1: Unfortunately, our WiFi cards did not support thisfeature.
Sentence 2: for the multiplePSM client experiments, we set the beacon interval to a small value (25ms) and simulated staggered beacons by only advertising the TIM bit for each client at the appropriate beacon corresponding to the as­sociated virtualAP.Wethen measured theoverhead of waking up the clientsforbeacons corresponding to other virtualAPsfrom our power readings, and subtracted this overhead from our .nal mea­surements.
Relationship: reasoning
Domain: Networks
Sentence 1: Due to potential route asymmetry between two networks in BGP routing, it is possible that a destination AS is still reachable though certain ASes along the forward path to it are polluted, e.g., two nodes c and d along the forward AS-level path [a, b, c, d, e] are pol­luted while node e is not.
Sentence 2: in this case, a probing tool such as tracer­oute may proceed to subsequent hops when probing to the hops in c and d returns * , and .nally reach e. the returned path may contain one or more * s followed by more IP hops reached further down the path.
Relationship: reasoning
Domain: Networks
Sentence 1: In a Di.Serv capable router, the output bu.er is normally divided into multiple logic queues, served under a certain scheduling algorithm, to provision di.erent classes of services.
Sentence 2: the tra.c aggregate associated with an output port needs to be split again according to the Di.Serv code point (DSCP) carried in each packet header [16] to generate the input process to the queue for each class.
Relationship: reasoning
Domain: Networks
Sentence 1: Recall that pf denotes the number of packets in f. Thus, 1 L() µf = uf,R[z]-uf,S [z] pf .z (L L) 1 1 = uf,R[z]- uf,S [z]= (tf,R -tf,S ) pf pf .z .z Note that the value of pf can be measured by tools such as NetFlow available on Cisco routers or by schemes proposed in [22, 26].
Sentence 2: to estimate the value of µf, we need to obtain the estimated values t f,S and t f,R for tf,S and tf,R, respectively.
Relationship: reasoning
Domain: Networks
Sentence 1: Pi,n,a (t) = RxTha + Li,n,a (t) (1) (t) is the propagation loss from the BS for system a i,n,a to node i at time t and increases when the distance between each node and BS becomes greater.
Sentence 2: a node located nearer to the BS consumes less power and a node that is remote from the BS needs more transmission power.
Relationship: reasoning
Domain: Networks
Sentence 1: Players are partitioned in ngroups of size n. Play­ers in group kare interested in markets k,kn1,kn,,kn n. All budgets and costs are equal, i.e., for all 1:i:n 2 n and 1:j:n 2 , BjCf.
Sentence 2: now, it is not hard to see that there exists a Nash equilibrium in which all players of group kprovide market k. there exists a Nash equilibrium with the social value Hn11 1 .
Relationship: reasoning
Domain: Networks
Sentence 1: Figure 2 shows that as pthresh increases the expected lookup hops decreases due to fewer timeouts; however, as table entry as follows: .talive i = (5).talive +.tsince Since p = ia, a monotonically increasing function of i, there exists some ithresh such that any routing table entry with i< ithresh will also have a p<pthresh .
Sentence 2: if nodes can estimate the value of ithresh corresponding to pthresh ,no estimate of a is necessary.
Relationship: reasoning
Domain: Networks
Sentence 1: A key observation is that -for short .ows -the size of the bu.er does not depend on the line-rate, the propagation delay of the .ows, or the number of .ows; it only depends on the load of the link, and length of the .ows.
Sentence 2: a backbone router serving highly aggregated tra.c needs the same amount of bu.ering to absorb short-lived .ows as a router serving only a fewclients.
Relationship: reasoning
Domain: Networks
Sentence 1: o f t m Consider a video sequence with frames of sizepixels, we use [)TJ(of size i ) to denote the 1-D vector obtained by line-scanning frame ), and [j)mJto denote the corresponding frame restored by the decoder.
Sentence 2: the error signal in frame ) is m[)mJn [j)mJg[)mJ, which represents the signal impairment in frame )caused by packet losses.
Relationship: reasoning
Domain: Networks
Sentence 1: 5.2 Simulation Results Webeginbyonsideringtheperformaneofanadhonet­workwithCSMAhannelaess,nopowerontrol,steered beams,andomni­diretionalneighbordisovery.Wethen progressivelyhangeeahoftheseparameterstodisernthe efetthateahonehasontheperformane.
Sentence 2: 5.2.1 CSMA,NoPowerControl,SteeredBeams,Omni­directional Neighbors Asillustratedinfgure3thereisnoimprovementinthrough­putwhenbeamformingantennasareemployed.Thisisbe­auseCSMAisevenmoreunsuitablewithbeamforming the"hiddenterminal"problemisexaerbatedduetoredued gainsonallbutthemainlobe.anodeoftenendsup transmittingtoaneighborthatisbusytransmittingorreeiv­ing.Thisseemstonegateanygainsduetoslightlyinreased spatialreuse.
Relationship: reasoning
Domain: Networks
Sentence 1: For in­stance, the values of C are 26.71 and 1.8 for the ixp and patricia, respectively.
Sentence 2: for a context switch over­head of 2 cycles, while the ixp is able to achieve a utiliza­tion of 26.71/(26.71 + 2) = 0.93, the patricia is limited to 1.8/(1.8 + 2) = 0.47.
Relationship: reasoning
Domain: Networks
Sentence 1: In practice, however, the cross tra.c consists of packets with discrete packet sizes, commonly following a strongly modal distri­bution.
Sentence 2: the amount of cross tra.c that in­terferes between each probing packet pair can often take 0.92 0.9 0.88 Figure 3: E.ect of cross tra.c burstiness.
Relationship: reasoning
Domain: Networks
Sentence 1: 2a Notice that to guarantee a connected network with high proba­bility, we have a< pn · r with high probability.
Sentence 2: log n 22 t·k·log n - n·t·k·r - (|D(T )| ) 22 1 2(c0)2·a2pc2 Pr C = n ·= e = e 0 = 2 t2·k 2a 2pc2 0 n |D(T )| Consequently, when n .8, Pr (C = n · 2 ) .
Relationship: reasoning
Domain: Networks
Sentence 1: A ball b(i, r)of radius r around node i is the subgraph that consists of all nodes j such that dij < r, their connecting edges and the fraction (r-dij)/(dik -dij ) of any edge (j, k) with only one endpoint, say j, belonging to the ball, i.e., dij = r (note that dij is de.ned for all nodes i, j).
Sentence 2: the ball b(i, 0) around node i contains node i and all the nodes j .
Relationship: reasoning
Domain: Networks
Sentence 1: Note that in the (T, k, m)-design, T =1, k =1, m =1 (i.e., all intervals are active) corresponds to a network with­out power management.
Sentence 2: in what follows, we use T =1, T = 7 and T = 73, respectively, to denote an always-on network, a power-managed network with the wakeup schedule (7,3,1), and one with the wakeup sched­ule (73,9,1).
Relationship: reasoning
Domain: Networks
Sentence 1: Clearly, each friend has the same chance as the node itself of meeting the node s desired communication partners, provided that the positions of the friends are ini­tially drawn from a uniform distribution or provided that the system reached stationarity.
Sentence 2: as con.rmed by simulations, the friend mechanism should reduce the aver­age convergence time according to the number of the friends, meaning that t.,f t./(f +1), where t.,f is the average convergence time with the friends mechanism and f is the number of friends of each node.
Relationship: reasoning
Domain: Networks
Sentence 1: The random variables Sx = |X2 - X1| and Sy = |Y2 - Y1|are independent and their pdf is given by (2).
Sentence 2: the joint pdf of Sx and Sy is 4 fSX SY (sx,sy)= (-sx + a)(-sy + b) 2b2 a l / a Figure 1: Pdf of epoch length on a rectangle for 0 = sx = a and 0 = sy = b.
Relationship: reasoning
Domain: Networks
Sentence 1: Since the capacities of wireless access links are considerably smaller than wireline constituents of a typical connection involving service delivery from the In­ternet to a wireless node, it is highly desirable to deploy an e.cient radio resource management system in order to ensure high spectrum utilization.
Sentence 2: modeling of the ma­jor components of a radio resource management system, in particular, a scheduler, becomes important from this per­spective.
Relationship: reasoning
Domain: Networks
Sentence 1: Theorem 2: If there is a point v .Al not covered by any sensor node, for every cluster Clust(si) there must exist at least one sensor sj .V whose LVor (sj) is not completely covered by Disk (sj,rs).
Sentence 2: proof: According to Lemma 1 (iii) or (12), we have  (LVor (sj) nAl)= Al (13) sj .Clust(si) for any v .
Relationship: reasoning
Domain: Networks
Sentence 1: To remedy the problem, ROB provides a series of predetermined report times so that even if a node missed a certain report time, it can always have another chance to receive next report.
Sentence 2: rOB at a source node consists of repetition of two procedures referred to as a broadcasting cycle: 1) preparing and transmitting broadcast packet, and 2) waiting for any response from nodes in N(S).
Relationship: reasoning
Domain: Networks
Sentence 1: PROOF.FromAlgorithm3,Sr,s selectonelink r,s=0,1,··· ,c2 whosesenderlocatedwithinagridforeachgrid(ifthereexistsonesenderinthegrid).
Sentence 2: accordingtoLemma9,OP T (L2) canselectatmostm linksforeachgrid,thus,  OP T (L2)= m ·Sr,s r,s=0,1,··· ,c2  Bypigeonholeprinciple,ourscheduledobtainedbyAlgorithm3:  1 ALG(L2)= (c2 +1)2 · Sr,s r,s=0,1,··· ,c2 OP T (L2) = m(c2 +1)2 · ALG(L2).
Relationship: reasoning
Domain: Networks
Sentence 1: 4.1Asmart-but-suboptimalattackstrategy We assumed that ASes make routing decisions based on business relationships and path length, and that a manipu­lator m cannot lie to his neighbor a about their business re­lationship (i.e., between m and a).
Sentence 2: intuition suggests that the manipulator s best strategy is to widely announce the shortest possible path: Shortest-Path Export-All attack strategy.
Relationship: reasoning
Domain: Networks
Sentence 1: In other words, what is the application-level cost of the very same network layer vertical handover, which may be very diverse depending on how it will impact on the application and the protocol it uses to manage end-to-end data .ows (UDP, TCP, RTP, HTTP, FTP, etc.).
Sentence 2: we shift the focus from the network layer to the transport and above layers.
Relationship: reasoning
Domain: Networks
Sentence 1: This happens because there might be two keywords that start the same.
Sentence 2: when the server compares the received keyword, with its set of supported keywords, it will obtain a sequence of true comparisons up to the .rst di.erence, and that sequence of true comparisons is output by our module rently able to describe how the increment was derived from the direction .eld value, which would be needed to observe that a constant of value two was added to the length .eld.
Relationship: reasoning
Domain: Networks
Sentence 1: EtherTrace relies on the following simple observation to discover layer-2 devices corresponding to each IP path segment: Because the bridges on LAN form a tree, only one layer-2pathbetween anypair ofhosts exists atany time.
Sentence 2: the bridges along thepathbetween twohosts on the sameVLAN must always receive framesfrom those twohosts on two separate ports.
Relationship: reasoning
Domain: Networks
Sentence 1: Since customer-premise routers (e.g., R' in Figure 3) are not part of the OSPF domain, and all data center routers are not part of EIGRP domain, routes from one protocol are injected into the other for ensuring connectivity.
Sentence 2: router R of area A in Figure 3 which is connected to a cus- tomer router .R', injects EIGRP routes into OSPF as ex- ternal LSAs.
Relationship: reasoning
Domain: Networks
Sentence 1: D4,2 = {M2 ,M5 }.For M2 , wehave n2 = |{M2 ,M4 ,M5 }|-|{M2 ,M4 ,M5 }|=0.
Sentence 2: forM5 , wehave n5 = |{M2 ,M4 ,M5,M8,M10 }|-|{M2 ,M4 ,M5 }|=2 n5 isthemaximum.So,weaddM5 toF4 ,butwe do notaddM2 toC4 becausen2 is zero.
Relationship: reasoning
Domain: Networks
Sentence 1: In the third step, we use the fact that the symbolic and the computational RCF-execution of A have essentially the same de.nition, except that one performs symbolic and the other computational operations.
Sentence 2: if we express these executions by a labeled transition system that treats opera­tions on messages as atomic steps, weget the same transition system for both executions, only with a di.erent interpreta­tion of these atomic steps.
Relationship: reasoning
Domain: Networks
Sentence 1: Thus, the throughput S can be written as: (1 - p)L 1 Ld S = P {Tn}· ·· , (11) (1 - p)L + pC L s where Ld is the DATA packet length and the term Ld/s converts the expression for the throughput from packets per slot to bps.
Sentence 2: the only unknown parameter that still remains to be derived so that the throughput is calcu­lated is the conditional collision probability p. Thisisthe only parameter that depends on the speci.c scenario.
Relationship: reasoning
Domain: Networks
Sentence 1: Due to simulation constraints, the con­.guration thatis modeled uses8port routers with the8thport used Figure3: Virtualrouter topologyfor cube collective for global connectivity, as shown in Figure 3.
Sentence 2: with a 4x4x4 meshthere are64globallinks(onefrom each router) toform65 cubes of 64 nodes each.
Relationship: reasoning
Domain: Networks
Sentence 1: In the FCR al­gorithm, the contention window size of a station will increase not only when it experiences a collision but also when it is in the defer­ring mode and senses the start of a new busy period.
Sentence 2: all stations which have packets to transmit (including those which are deferred due to backoff) will change their contention window sizes at each contention period in the FCR algorithm.
Relationship: reasoning
Domain: Networks
Sentence 1: Table 2: Data Distribution EvaluationParameters For eachof the performance metrics, system Con.gurationB(Sin­gle SFC) performs better than Con.guration A (Multiple SFCs), because the spatial data is better distributed over the network in the case of system Con.guration A.
Sentence 2: the query has to be evaluated at a larger number of peers compared to the system Con.guration B.
Relationship: reasoning
Domain: Networks
Sentence 1: For n » 1, this distribution can be approximated by a Normal distribution of zero mean and variance n: N(0,n).
Sentence 2: 18 1 - x2 BER(Eb, J, n)= v e dx n2pn 2n J Eb J 18 1 - x2 = v e dx (1) J Ebn 2p 2 J Eq.
Relationship: reasoning
Domain: Networks
Sentence 1: The resulting tra.c sent to the network of the MNO in a regular way (i.e., the non­o.oaded tra.c) from a single source is then modeled as the product of the two above processes.
Sentence 2: the aggre­gation of several such resulting processes models the tra.c still needing to be handled by the operator in the conven­tional way, which is the one to be used for the purposes of network dimensioning.
Relationship: reasoning
Domain: Networks
Sentence 1: More­over, let p0 = Iv(1 - pv) be the probability that the channel is idle at a given time step.
Sentence 2: since the covered nodes together have an access probability of at least (1 - 1/(m + 1)) p at any time (Corol­lary 3.6) and the least recently successful but not yet covered node, v, has an access probability of at most p , it holds that p0 · m P[node in C successful]= L pu I (1 - pw) =· p m +1 u.Cw=v and p0 P[node v successful]= pv I (1 - pw) =· p 1 - p w=v (1 - p )m P[node in C successful] =· P[node v successful] m +1 which implies that the probability that k consecutive successful transmissions are due to v is at most (1/(1 + c))k with c = (1 - p )m/(m + 1).
Relationship: reasoning
Domain: Networks
Sentence 1: It is straightforward to show that .ui/..i = 0 and .2 ui/..i 2 = 0, which con.rms that, given .xed pi, ui is a monotonically increasing concave upward function of .i.Like­wise, given .xed .i, ui is a monotonically decreasing concave downward function of pi since .ui/.pi = 0 and .2 ui/.p2 i = 0.
Sentence 2: ui is quasi-concave in pi.
Relationship: reasoning
Domain: Networks
Sentence 1: 5.3 Performance Metrics for Channel Sur.ng In this study, we used the following performance metrics to evaluate the e.ectiveness of channel sur.ng strategies: Network Recovery: The main ob jective of channel surf­ing is to ensure network availability in the presence of jamming.
Sentence 2: we .rst measure whether the channel sur.ng strategies can restore network perfor­mance (number of packets delivered to the sink) from jamming.
Relationship: reasoning
Domain: Networks
Sentence 1: Our key insight is that it is possible to determine whether MIM is helpful by observing the interference patterns on the received A-MPDU frames as illustrated previously in Figure 1.
Sentence 2: we can simply count and compare the number of occurrences where MIM was helpful (see Figure 1(a)) versus where MIM was detrimental (see Figure 1(b)) to decide whether and when to enable or disable MIM.
Relationship: reasoning
Domain: Networks
Sentence 1: 3.2 Problem Statement Suppose the MPR set of a particular node k at time t instance t is denoted by, Mt = {1,2,...,m}, where kk t |Mt | = mk.
Sentence 2: our goal is to identify Bt .Mt where kkk Bt denotes the MPR set that is geographically behind k node k at time t.  3.3 Description Assume Ft denotes the MPR set that is geograph­ k ically ahead of node k, and Ut speci.es the MPR set k that could not be identi.ed as either behind or ahead of node k at time t. we have Bk .Ft .Ut = Mt ttk k Bk nFt = Ø, Bk nUt = Ø, and Fk nUt = Ø. tttt tt Let us inspect if the node, i .Mt is behind node k. k Suppose the neighbor set of k at time t is denoted by, t ttt Nt = {1,2,...,n}, where |Nt| = n, and m= nk.
Relationship: reasoning
Domain: Networks
Sentence 1: Delay-Tolerant Networking in Restricted Networks Johannes Morgenroth, Tobias Pögel, Robert Heitz and Lars Wolf Institute of Operating Systems and Computer Networks Technische Universität Braunschweig Braunschweig, Germany [morgenroth, poegel, heitz, wolf]@ibr.cs.tu-bs.de ABSTRACT For security reasons, many companies usually allow only strictly regulated communication, speci.c system con.gu­rations and predetermined software components.
Sentence 2: often only communication over the HTTP protocol is pos­sible, which operates by using a request-response approach.
Relationship: reasoning
Domain: Networks
Sentence 1: The other products of the enzymatic reaction, denoted here as subproducts, remain in the intracellular environment and do not take part in the di.usion-based molecular communication.
Sentence 2: the input of the signaling molecule production is the concentration of enzymes [E], while the output is the concentration of produced signaling molecules at the transmitter, de­noted by [S]Tx.
Relationship: reasoning
Domain: Networks
Sentence 1: In particular, the traffic from the connected schools in the MAN should be forwarded to the Greek School Network, the traffic from universities on Greek Research and Technology Network GovernmentHealthEducation - Research 1 73,37 Universities Research Institutes 6 117,39 Elementary Schools 76 102,72 High Schools 44 108,58 Public occupational centres 2 5,57 Hospitals 4 622,16 Region 1 158,48 Prefecture 1 70,43 Municipalities 2 76,30 Libraries 1 3,22 Sum 140 2218,63 etc.
Sentence 2: the designing approach is to configure the equipment in such a way that will provide Transparent LAN services [11], connecting the building to their service provider transparently and friendly.
Relationship: reasoning
Domain: Networks
Sentence 1: Similarly, when 0 <.A < 1, the inter­departure time of ACKs A1 and A3 atqueue QA is no more than that when .A = 1.
Sentence 2: p(.A > 600 µs)< 0.18 also holds when 0 <.D < 1 or0 <.A < 1.
Relationship: reasoning
Domain: Networks
Sentence 1: After being noti.ed by the BS, the MS uses the current antenna subset to trans­mit pilot signals in the .rst available pilot symbol, and then sequentially uses disjoint antenna subsets to transmit subse­quent pilot signals.
Sentence 2: the BS can estimate the channel response associated with each di.erent antenna subset used by the MS in the uplink, and determine the optimal transmit antenna subset that the MS should use.
Relationship: reasoning
Domain: Networks
Sentence 1: For example, suppose a group of commuters using these two cellular carriers periodically travel between these two cities, then users of Carrier 2 may share their services with users of Carrier 1 in City 1, while utilize the service from Carrier 1 in City 2.
Sentence 2: with data of.oading, all users can bene.t in the long run.
Relationship: reasoning
Domain: Networks
Sentence 1: Regardless of the protocol details, we believe that any technique to harness partial packets should adhere to the following guidelines on how to handle each type of packets: Correct Packets: Figures 3 and 8 show that even channels opti­ mized for correct-byte throughput still see more than 30% fully correct packets.
Sentence 2: we would like a technique that does not introduce any extra overhead to correct packets.
Relationship: reasoning
Domain: Networks
Sentence 1: Sibling ASes: ASes from sibling organizations may share their address space and may also have cooperative routing arrangements.
Sentence 2: next-hop anomalies wherein the two Data-plane path Control-plane Part of AS O uses Adjacency addresses from AS N s address space 2 Figure 15: AS O uses part of its provider N2 s address space and this leads to erroneous AS-level paths.
Relationship: reasoning
Domain: Networks
Sentence 1: The robustness of VIRTIO-based con.gurations is instead accidental, and derives from the inability of the VIRTIO QEMU frontend (which in the non-VHOST case runs in the userspace emulator) to deliver more than 700Kpps (in our experiment) to the VM.
Sentence 2: in this con.g­uration we do not see livelock only because the guest is never running out of CPU.
Relationship: reasoning
Domain: Networks
Sentence 1: For example, the IBM Rack-Switch G8264 only recently added MPLS support [4] and only supports 1000 MPLS push and 1000 MPLS pop rules, which we believe represents the capabilities of the underlying Broadcom Tri­dent [10] switching ASIC as well as similar ASICs from other ven­ dors.
Sentence 2: using MPLS to manage the core of a large network re­quires buying high-end switches, waiting for future switches with large MPLS tables, or both.
Relationship: reasoning
Domain: Networks
Sentence 1: It has a limit when n goes to in.nity: 1un 1 lim f(n)= lim 1- = n.8 n.8n e and it is easy to verify that for any practical n, say, n = 106 , f(n)= 1 e .
Sentence 2: we can obtain E(p(k+ 1)) 1um = E(|O(F reeI n(k+ 1))|)= n1- n 1un n p(k) = n1- = = n ee Case 2: m < n and p(k)= m. For m = 1, it is trivial that the algorithm converges after one more iteration.
Relationship: reasoning
Domain: Networks
Sentence 1: Di.erentiating with respect to t and setting t = 0, we obtain p1' (t)+ µp1(t)= .ep0(t) (10) where p1(·) and p0(·) represent the state probabilities for state 1 and state 0, respectively.
Sentence 2: since p0(t)=1 - p1(t), we have .e -(.e+µ)t-(.e+µ)t p1(t)= [1 - e ]+ p1(0)e (11) .e + µ we have .e p1 = lim p1(t) = (12) t.8 .e + µ µ p0 = lim p0(t) = (13) t.8 .e + µ Also using the Kolmogoro.
Relationship: reasoning