sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: Figure1(see[5]) shows an example of such a network scenario, where the users employ CSMA/CA in order to access each of the C channels.
Sentence 2: the rate R c (kc) is shared equally between the radios allocated to that channel, i.e., for strategy S, each ra­dio using channel c receives abit rate of(suppressing (S)in the notation) c c R (kc) d (kc):= kc thetotal transmissionthroughputfor a user i is L c (kc)kc LR c (kc)kc ri = d i = i .
Relationship: reasoning
Domain: Networks
Sentence 1: Let pi,j and qi,j be the probability of transition from state Si to state Sj for users 1 and 2, respectively.
Sentence 2: pi,j = Pr{X1(t)= Sj |X1(t - 1) = Si} qi,j = Pr{X2(t)= Sj |X2(t - 1) = Si}.
Relationship: reasoning
Domain: Networks
Sentence 1: Thus, the number of rounds is i=1 O(i)= O(log4.4 n).In phase i, at each round, a node uses a sin­gle message with an expected communication cost of O(i).
Sentence 2: the communication cost per node for the algorithm Plog n 3.4 is: i=1 O(i· i)= O(log5.4 n).The total communication cost is thus O(nlog5.4 n).
Relationship: reasoning
Domain: Networks
Sentence 1: Behavior of 1Gbps EEE links with coalescing: When coalescing techniques are used, the transition from state LP I to state W is delayed.
Sentence 2: we .ctitiously split state LP I into two states, as shown in Figure 2: state L, which represents state LP I when there is no packet queued in the coalescing bu.ers and which is equivalent to LP I in systems with no coalescing and state C, in which coale­scing bu.ers are not empty but neither the coalescing timer expired nor the coalescing bu.ers were completely full.
Relationship: reasoning
Domain: Networks
Sentence 1: We give comparisons between the output of SkypeMorph and actual video calls of Skype and we conclude that for the censoring adversary it would be di.cult to dif­ferentiate between the two.
Sentence 2: a censor would be required to block a great portion of legit­imate connections in order to prevent access to the obfuscated Tor messages.
Relationship: reasoning
Domain: Networks
Sentence 1: In this regard, the question is: where , tt t AB C(t)= f (k) - f (k)= does the transition from exponential to power-law happen?
Sentence 2: k=1 k=1 k=1 we have t () t [C(t)]x = RA cos .A -RB cos .B kkk k k=1 6This is always possible by making one time step small enough such that when the node gets out of the circle at t = 1, it is located outside that tangential line at x = d. Or, equivalently, how do we choose (or scale) the size of the space (boundary) to observe the power-law inter-meeting time distribution over a given timescale?
Relationship: reasoning
Domain: Networks
Sentence 1: This gives p+k1 -1 L .k1 Sfk1 = .p k =2 p 1 -.p k=k1 which, by equality Rfk1 =(-1)k1 -1,leads to ( ) p ip+1 2 Rfk1 Sp = -= (A.11) fk1 1 -.p (sin p/2p)p which is a constant .p depending on p only.
Sentence 2: there are in (A.9) exactly p terms equal to .p 2n+1,i.e.
Relationship: reasoning
Domain: Networks
Sentence 1: Without a position-locating system, we approximate the carrier-sensing neighborhood of a node, i.e., the set of nodes within its carrier-sensing range, as its k-hop neighborhood, where k is a positive integer.
Sentence 2: we set the time-to-live (TTL) field in each BUSY_PERIOD_REPORT message to k, which results in a local broadcast.
Relationship: reasoning
Domain: Networks
Sentence 1: Node 2 calculates the following routing opinion values, using equation (18): VR1 = (P4,1 · P4,8)1/2 = (0.91 · 0.82)1/2 = 0.86, VR2 = (P4,1 · P4,9)1/2 = (0.91 · 0.25)1/2 = 0.47.
Sentence 2: route R1 is selected to route packets from node 4 to node 2.
Relationship: reasoning
Domain: Networks
Sentence 1: Note that there is the possibility that an IP address creates false positive matches in all the .lters in the system.
Sentence 2: in this case,the number of required hash probes is Eworst = B +1 (10) while Equation 9 gives the expected number of hash probes for a longest pre.x match,Equation 10 provides the maximum number of hash probes for a worst case lookup.
Relationship: reasoning
Domain: Networks
Sentence 1: In future systems, a significant part of this load might be carried on shared channels [3] (e.g., on the Downlink Shared Channel of LTE) for several reasons: First, video traffic produced by H.264/AVC compliant coders remains bursty even György Dán gyuri@ee.kth.se ACCESS Linnaeus Centre KTH, Royal Institute of Technology 10044 Stockholm, Sweden after being smoothed over several consecutive frames.
Sentence 2: a dedicated multicast transport channel might need to be provisioned at a level significantly higher than the average bit­rate [4].
Relationship: reasoning
Domain: Networks
Sentence 1: G.,f )=P(e1, ...,eki ), therefore, if we sum up these probabilities for all Gi,then we get precisely the expected number of the graphs with property Q that occur in G.,f ,as each Gi contributes to (i)(i) this expectation by 1 with probability P(e1, ...,eki )and (i)(i) by 0 with probability 1 - P(e1, ...,eki ).
Sentence 2: r () (i)(i) EN(Q,G.,f )= P(e1, ...,e) ki i=1 holds.
Relationship: reasoning
Domain: Networks
Sentence 1: We note that on each interval f of AF, d(p, S) for all points p .
Sentence 2: f is a linear function since there is a corresponding segment or point on S on which lie all the points closest to points in f. the maximum and minimum distances are at the vertices of f. Contrary to the discretization of S where we approximate the maximum interference received by points in S, we approximate the maximum SINR.
Relationship: reasoning
Domain: Networks
Sentence 1: time for the last .ow of an incast job to .nish), while also closely matching the performance of other expensive schemes like DeTail and RPS (within 2% of their completion times on average and in terms of the tail).
Sentence 2: flowBender makes a strong case for a non-intrusive, end-host-and .ow-level load balancing using the classic end­to-end principle [19].
Relationship: reasoning
Domain: Networks
Sentence 1: S.S H.H From Claim 1, f maps S to H. Moreover since the mapping f : S/~.H is one-to-one and onto, we get (k) -1 Pr(Ts = x)= X Pr(f(H)).
Sentence 2: h.H by Claim 2, (k) Pr(Ts = x)= X Pr(H), H.H that is (k)(k) Pr(Ts = x)=Pr(Xs = x), which completes the proof of the lemma.
Relationship: reasoning
Domain: Networks
Sentence 1: As a result of this theorem, the following holds k X T£: 1 + fi (4) k i=2 We will analyze the performance for three different cases: Worst case text: the text that triggers the most pathological memory accesses pattern  Random text: the text composed of uniformly randomly cho­sen characters  Synthetic text: Text is random but with some concentration of the strings of interest  5.1 Worst Case Text To evaluate the worst case behavior, let s assume that the JACK-NFA has gone down to a state at depth d after which it falls through the failure chain by consuming the next symbol (The depth of state q0 is 0).
Sentence 2: at this state, when it consumes a symbol, it needs Tk £ memory accesses for LPM.
Relationship: reasoning
Domain: Networks
Sentence 1: Each version was perhaps obtMned by a series of updates to that original document (e.g., by a series of transmissions on the internet and updates along the way).
Sentence 2: it would be reasonable to expect that many parts are ~t of EECS, Case Western Reserve University, Cleveland, OH, and Dept of CS, University of Warwick, Coventry, UK; grc30eecs, cwru.
Relationship: reasoning
Domain: Networks
Sentence 1: s bound, we have Pr {f : f .Oi(t)and Rif (t)= Rmax = (1 - d)T if } (= 1 - exp - d2T 3 ) , where T = p max( Qi(nT ) F max - .maxD - T ).
Sentence 2: it can be easily shown that Pr (Ri(t)) = .max(T + F max) .max(T + F max)+(1 - d)T +exp - d2T 3 , and the lemma holds for the uniform tie-breaking rule.
Relationship: reasoning
Domain: Networks
Sentence 1: But also the devices, on which such systems are executed are very heterogenous and no real restrictions can be applied to them.
Sentence 2: a tremendous amount of P2P Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for pro.t or commercial advantage and that copies bear this notice and the full citation on the .rst page.
Relationship: reasoning
Domain: Networks
Sentence 1: )However,wedo noteoneimportantsenariowhereTheorem5anbeap­plied.Aswehavementioned,seureprotoolsoftenuse manyinvoationsofabroadastprimitive.Furthermore,in ordertoimproveroundeÆieny,inanygivenround,many broadastsmaybesimultaneouslyexeuted.Thekeypoint hereisthatwithintheseureprotool,uniqueidentifersan bealloatedtoeahbroadast(bytheprotooldesigner).
Sentence 2: authentiatedByzantineAgreementanbeused.
Relationship: reasoning
Domain: Networks
Sentence 1: Permission to make digital or hard copies of all or part of this work for Oceans, rivers and lakes are critical to the life on our planet and monitoring these environments is a hard and costly task.
Sentence 2: there is a large number of applications where UWSNs are important, such as ecosystem preservation, disaster pre­vention, oil/gas exploration, and freshwater reservoirs man­agement [6, 7].
Relationship: reasoning
Domain: Networks
Sentence 1: Such an undifferentiated access mode is unfavorable when some QoS-critical applications are inte­grated with the QoS-resilient applications over the wireless LAN, or when the AP needs to handle aggregated downlink .ows that have a much larger traf.c load than that in a mo­bile node [14].
Sentence 2: we consider an enhanced DCF with class differentiation for more effective QoS provision­ing and higher resource utilization.
Relationship: reasoning
Domain: Networks
Sentence 1: (2) where a(t) is the average value of a(t) from time 0 to t. As un­veiled in existing works [6,11,23], clock skew can accumulate with time.
Sentence 2: fLIGHT should calibrate clocks to minimize its nega­tive impact by controlling the differences of each cn(t)/(a(t) · fg) among different nodes; otherwise, logic times will rapidly exhibit heterogeneous advancing rates respect to the global reference and among themselves.
Relationship: reasoning
Domain: Networks
Sentence 1: In particular, for non-linear latency functions (even for quad­ratic latency functions), there is no constant c for which a scaled-down version f/c of a Nash .ow f is optimal for the reduced tra.c rates r/c.
Sentence 2: it is not at all clear how to exploit our characterizations of Nash and optimal .ows to relate their respective costs.
Relationship: reasoning
Domain: Networks
Sentence 1: The attenuation due to transmission, which is the product of the transmission coef.cient and the total number of transmis­sion walls.
Sentence 2: the model is de.ned as: Nr,j N P= (P0 - 20log10(di)- .· Ni,ref - a· Ni,trans ) (3) i=1 where Pis the power (in dB) at receiver, Nr,j is the total num­ber of rays received at the receiver j; P0 is the power (in dB) at a distance of 1 meter; di, Ni,ref , and Ni,trans represent the total transmission distance, the total number of re.ections and the total number of (wall) transmissions of the ith ray, respectively.
Relationship: reasoning
Domain: Networks
Sentence 1: In addition, for the AS and RL topologies, we use the sim­ple policy model described in Section 3.2.1 to evaluate link values using policy-constrained paths.
Sentence 2: we expect that backbone links will have higher values than pe­ripheral links.19 the distribution of these link values is our measure of hierarchy; if all links have similar values then there is no hierarchy because usage is spread out evenly, and if only a few links have high link values then there is a small and well-de.ned backbone on which usage is concentrated (where, again, usage is not measured by the level of traf.c but by the nature of the traversal set).
Relationship: reasoning
Domain: Networks
Sentence 1: 5.2 Greedy Proxy Discovery In greedy proxy discovery, neighboring mobile clients within one-hop IEEE 802.11b transmission range periodically ex­change their average downlink channel rates by broadcast­ing a neighborhood advertisement message (NBADV).
Sentence 2: each mobile client proactively maintains a table of its neigh­bors IDs (e.g., IP addresses) and their most-recently adver­tised average HDR downlink channel rates.
Relationship: reasoning
Domain: Networks
Sentence 1: 1.2 Contribution Since activating too many wireless stations will cause in­terference and thereby signi.cantly reduce the total system throughput, there is an optimum number of stations for a given geometry.
Sentence 2: it makes sense to address the de­sign problem of determining the desired number of wireless stations to obtain a certain throughput and study the in.u­ence of the location of the wireless nodes on the expected system throughput.
Relationship: reasoning
Domain: Networks
Sentence 1: Assuming that thepair traverses thepath close to each other, they may observe similar states of the congested hop before a packet is discarded.
Sentence 2: the residual packet in the loss pair has been used to estimate the packet dropping mechanism of the congestedhopgovernedby various activequeueman­agement schemes(e.g.,droptail,RED[20], andBLUE[18]) and a droptail queue s bu.er size [31], and to classify the causesforpacketloss[32].
Relationship: reasoning
Domain: Networks
Sentence 1: CONGESTION CONTROL WITH COL-LABORATIVE INFERENCE OF CHAN-NEL STATE The previous sections clearly indicate that relying on local in­ference of the channel state can result in serious unfairness, thus pointing to the need for collaboration among nodes.
Sentence 2: in this section we study congestion control under inter-node collaboration, i.e., inter-node sharing of channel-state information within a con­tention neighborhood.
Relationship: reasoning
Domain: Networks
Sentence 1: Table 2: Energy Savings through GreenCall Silence Suppression No Silence Suppression 30ms 60ms 30ms 60ms Savings(%) 43 53 52 63 periments) states that the sleep periods be speci.ed only as multi­ples of AP s beacon interval (typically 100ms) [4].
Sentence 2: the only sleep period we could use was 100ms.
Relationship: reasoning
Domain: Networks
Sentence 1: Although we do not explore this issue further in this paper, we believe that this problem can be addressed by using a hierarchical scheme: In addi­tion to their own noti.cation .ags, a group of frontends can also share a single .ag (or counter) which they access using atomic memory operations.
Sentence 2: the polling thread normally only needs to check the shared .ag.
Relationship: reasoning
Domain: Networks
Sentence 1: Clearly, E[.R]=.C p.Now, to remain, the newly occupied entries need their sample counts be raised by zp.C , since the .ushing threshold will be dF + zp.C .
Sentence 2: of those entries, he can only keep .R alive, which zp.C is 1/z on the average; provided that more than 1/z of such entries had been occupied.
Relationship: reasoning
Domain: Networks
Sentence 1: Our aim in this paper is to propose a clear and precise per­formance evaluation method to i) assess the quality of the analytical model leading to the total delay PGF, ii) select the most accurate numerical inversion method.
Sentence 2: we de.ne two performance measures whose aim is to charac­terize the error originating from the analytical model on the one side and from the PGF inversion method on the other side.
Relationship: reasoning
Domain: Networks
Sentence 1: The re­sults in Figure 11 indicate that, while the sub-optimality of CABS client association component can at most be within half of the op­timal (see Sec.4.2.4) in the worst case, in practice, it yields a per­formance that is very close to its upper bound.
Sentence 2: the high ef.­  (a) Throughput ratio (b) Throughput ratio (c) System utility (d) BS load balancing (a) Throughput ratio (b) Utility Figure 11: Evaluation of client association component in Pro-Beam.
Relationship: reasoning
Domain: Networks
Sentence 1: Ifrequestsarriveatsomerater,thenthetotalrawweight forthedemandtermisabouttr+ tr+ r .2tr.
Sentence 2: similarly,thetotalrawweightforthebakgroundterm isabout2tr.toallowdemandrequeststo dominatebakgroundrequestsduringthefrstseonds afterademandrequest,weweightthedemandtermbya fatorof100t.
Relationship: reasoning
Domain: Networks
Sentence 1: However, since the PNC monitors all command exchanges, including peer discovery commands, the PNC can obtain the data rates between reachable DEV pairs from their frame exchanges by self-learning without extra overhead, and store them in an N×N rate matrix (RM), where N is the total number of DEVs within the piconet, including the PNC.
Sentence 2: in practice, distance measurement in not necessary for link rate gathering.
Relationship: reasoning
Domain: Networks
Sentence 1: 4.4 Practicality When a PSK, or cached PMK, is configured to a current PMK, the attacker can interfere with the 4-Way Handshake either before Message 1 or after Message 1 because it knows the corresponding PMKID from previous eavesdropping.
Sentence 2: the attacker may just send out a forged Message 1 periodically, the attack succeeding if one of the forged Message 1s falls between the legitimate Message 1 and Message 3.
Relationship: reasoning
Domain: Networks
Sentence 1: By using the equations 1, 2 and 3, the energy consumed in the ith grid is E1 = eta ( r2 + W2)nAt1B + eeB (10) Ei = eta ( (2r)2 + W2)nAtiB + eeB, i =1.
Sentence 2: based on equation 2, the total energy consump­tion of the network is m r1 25.0200m r2 25.7293m r3 25.7818m r4 26.5282m r5 26.6441m r6 27.4387m r7 27.6325m r8 28.4911m r9 28.7835m r10 29.7290m r11 30.1504m r12 31.2181m r13 31.8155m r14 33.0634m r15 33.9165m r16 35.4456m r17 36.6998m r18 38.7129m r19 40.6786m r20 43.6573m r21 47.1716m r22 52.6951m r23 61.3664m r24 80.6189m r25 188.7475m  Etotal = Ei (11) 0.18 i=1 0.16 2L2 L2 W2(m +1) = eta BWLnda[ - + ]+ meeB.
Relationship: reasoning
Domain: Networks
Sentence 1: However, such an attack is unable to prevent the spreading of good copies in a fully cooperative p2p environments (that do not exhibit the above (i)-(iii) behavior) with a suf.cient interest rate for a certain .le, as indicated in Figure 1.
Sentence 2: in the rest of the paper, we anticipate the next step in the arms race between the attackers and defenders, and treat a class of more sophisticated DoS and counter-DoS strategies.
Relationship: reasoning
Domain: Networks
Sentence 1: In all three schemes, however, a packet has to look up the cut dimen­sion and the number of cuts in each node s .rst part to determine its index into the array in the second part, and then retrieve the child node pointer at the index.
Sentence 2: each node requires Table 1: Node data in bytes HyperCuts 2 for header (number/dimension of cuts, other infor­ mation such as internal node or leaf) 4 per moved-up rule pointer (up to 1) or leaf rule pointer (up to binth = 16) 16 for compacted region boundary 4 per child pointer Ef.Cuts 2 for header 13 per leaf rule (up to binth = 16) (leaf) or 16 for compacted region (equi-size) or 2 per unequal cut index (max_cuts = 7) (equi-dense) 4 per child pointer  (b) Access 1 Access 2  FIGURE 5.
Relationship: reasoning
Domain: Networks
Sentence 1: With EPS implemented in the nodes, it is likely that, within an epoch, the root node completes transmission of the maximum number of packets from subtree A before subtree B s. Since EPS does not have work-conservation (Section 6.4), this implies that it will wait until the required number of packets has been received and transmitted from subtree B before considering packets from subtree A.
Sentence 2: ePS achieves fairness irrespective of the di.erences in loss probabilities of links in the network.
Relationship: reasoning
Domain: Networks
Sentence 1: Obviously, a node cannot forward any informa­tion it has not received yet, enforcing that information .ow is directed: An intermediate node on a line topology has to wait for at least one message from a neighbor, while after its re­ception it ought to send as quickly as possible in order to not slow things down.
Sentence 2: we naturally end up with .ooding a pulse through the network, implicitly building a breadth­.rst search tree.
Relationship: reasoning
Domain: Networks
Sentence 1: If an attacker could generate a valid signature h(m)d on h(m) from h(m)-dH N i , = h(m)d-dH N i he could compute h(m)2dF N i and thus gen­erate valid RSA signatures for a secret key dF N i .
Sentence 2: 3 The foreign networks learn, that their shares themselves are not the secret.
Relationship: reasoning
Domain: Networks
Sentence 1: THE OPTIMIZATION FRAMEWORK As shown in [5], the problem of constructing a minimum .ooding tree (the so-called Minimum Connected Dominating Set), which would identify the best collection of nodes to retransmit a brodcast packet as to reach all other nodes, is NP-hard.
Sentence 2: most approaches to e.cient broadcasting in ad-hoc networks start with .ooding and attempt to reduce its extent with the assistance of some heuristics.
Relationship: reasoning
Domain: Networks
Sentence 1: If the instantaneous requirement for a certain .ow is above its aver­age bit-rate, the enforcer can borrow resources at .ne time-scales from a .ow whose instantaneous rate is below its average bit-rate.
Sentence 2: setting the maximum rate for the .ows above their average 1 16 0.8 100 75 14 100 0.6 12 0.4 75 50 10 0.2 50 25 CDF    Video Bit-rate (Mbps) SINR (dB) % Resource Utilization 4 2 0 0 25 NOAVISnpAVIS AVIS Fairness Index Frequency of Switches Scenario 0 0 (a) Fairness (b) Stability (c) Utilization NOAVISnpAVIS AVIS Time (seconds) Scenario Figure 8: Ef.cacy of AVIS.
Relationship: reasoning
Domain: Networks
Sentence 1: can be guaranteed, which causes the ine.cient use of power.
Sentence 2: when we aim at maximizing the sum e.ective capacity (i.e., .1 = .2 = ··· = .N = 1) over multiple users, users with less stringent QoS requirements get more power such that the system can in­crease the sum e.ective capacity more e.ciently with the limited power.
Relationship: reasoning
Domain: Networks
Sentence 1: Prom the property of Laplace transform, the first order moment, i.e., the mean value ~ of the residence time in the LA is: OG~.
Sentence 2: (s) Is=o-- N(K) -t- 1 (12) = Os 21z the Laplace transform, B~(s), of the residual so- journ time, T, within the LA is obtained by ~T(S ) = 1 -- G~.
Relationship: reasoning
Domain: Networks
Sentence 1: This is a fairly mild assumption as the information conveyed by the keys is relative to identities of the parties sharing them, not to the protocol they are running.
Sentence 2: unlike similar results proved of existing typing systems for authentication, notably [11, 12], Theo­rem 2 may be directly applied to the veri.cation of multi-protocol system (see [20, 21] for details).
Relationship: reasoning
Domain: Networks
Sentence 1: The fundamental challenges are system-inherent latencies between the host PC and the SDR as well as compu­tational performance and non-deterministic delays introduced by running the physical layer on a non-real-time operating system [16].
Sentence 2: conventional architectures with USB or Gigabit Ethernet interfaces are not able to meet the latency requirements of the IEEE 802.11 [17].
Relationship: reasoning
Domain: Networks
Sentence 1: BroadastPeeringLink:Apeeringrelationshipbe­tweentwoBGsindiatesawillingnesstoarrybroadast traÆtoandfromeahother'snetworks.BGsarossindi­vidualbroadastnetworksestablishadministrativelyonfg­uredpeeringlinkstoeahother(inontrasttoself-organizing peers).ThisallowsBNadministratorstoestablishexpliit poliiesandommerialagreementsfortheuseofthose links.Forexample,BNadministratorsanonfgurepeer­inglinkstoallowordisallowtheuseoftheirnetworkasa transitfortraÆtoandfromotherreahablenetworks.The peeringonnetionsthataresetuparossBNsareknown as.external"peeringlinks.Inaddition,allBGswithina singleBNsetupinternal"peeringlinkswithoneanother.
Sentence 2: 3.2 Service Model Thefederationserviemodeldefnesabroadastsession asafederation-widegroup-ommuniationabstration.Clients arosstheentirefederationansubsribetosessionspub­lishedanywherewithinthefederation.afederation sessionextendsanIPmultiastnetwork'sgroupabstration orasingleCDN'sstreambeyondthatnetwork'sboundaries toreahlientsinotherBNs.
Relationship: reasoning