sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: This motivated the following fairly simple analysis of pTO, which as­sumes that every loss identi.ed by duplicate ACKs is identi.ed by the .rst duplicate ACK received.
Sentence 2: let A(w, k) denote the probability that k out of w packets are acknowledged, given that there is a loss episode in a round with window size w. Let C(w, k) denote the probability that exactly k packets are received from a round of w. k {k (1- p)p (1- p)p , k<w A(w, k)= C(w, k)=w 1- (1- p)w (1- p),k =w Given a round of w packets that has a loss episode, the scenarios that lead to no duplicate ACKs, and thus a TO in the round, are: 1) the entire window is lost, or 2) i out of w packets reach the receiver, the receiver sends i ACKs, the sender sends i new packets and all i packets are lost.
Relationship: entailment
Domain: Networks
Sentence 1: K Pt If k=1 R,k = minl Ql,max, the normalization factor .k can be calculated directly based on (PtR,k) obtained from solving problem (21)-(25) by normalizing the beam­forming vectors given in (11).
Sentence 2: when Ql,max = Ptotal, which might be the case of .xed relays with a high power budget (or no individual power constraint applied on each relay), only the .rst sub-problem is needed.
Relationship: entailment
Domain: Networks
Sentence 1: Withthese considerationsin mind,if welook at(1),(2), (3) and(4) itis evidentthattheperformance of each sin­gle user depends not only on the PHY mode it chooses, but also on the PHY mode selected by every other user.
Sentence 2: the choice of the rate performed by any user a.ects the performance of all remaining users.
Relationship: entailment
Domain: Networks
Sentence 1: A few code dissemination protocols (e.g., [7, 13, 16, 22, 27, 28]) have been developed recently to propagate new code images using the ad-hoc wireless net­work formed by the sensor nodes.
Sentence 2: deluge [13] uses an epidemic protocol [18] for ef.cient advertisement of meta data and spatial multiplexing for ef.cient propagation of code images.
Relationship: entailment
Domain: Networks
Sentence 1: We now formally define the (distance, weight)-based quantitative estimate of the SDT for a routing protocol R as 2 2 R RR W (7) SDTdist = WStability (Sdist ) + Delay (Ddist ) The efficiency of a routing protocol is inversely related to its SDT.
Sentence 2: smaller the SDT value, larger the efficiency of the routing protocol and vice-versa.
Relationship: entailment
Domain: Networks
Sentence 1: As a result, its performance is highly dependent on the CPU speed.
Sentence 2: we can summarize our .ndings as the following: Observation 7: RDMA lends itself much bet­ter to the DFVS technique than TCP, because RDMA communication performance is a.ected 1600 1400 1200 1000 800 600 400 200 0 much less by the CPU speed.
Relationship: entailment
Domain: Networks
Sentence 1: In order to be useful, the definition of domination between seri- alization orders must imply domination between protocols, as follows: Serialization order S dominates serialization or- der S ~ if, for a given workload and faultload, the dominating algorithm using S can commit a write W whenever the dom- inating algorithm using S' can commit that write.
Sentence 2: s dominates S' if S allows the commitment of any write that could be committed using S'.
Relationship: entailment
Domain: Networks
Sentence 1: However, in recent years these clean slate efforts moved beyond adding functionality and have begun addressing the reason we had to turn to clean slate design in the .rst place: architectural rigidity.
Sentence 2: the research community is now devoting signi.cant attention to the design of architectures that can support architectural evolution, so that future architectural changes could be made incrementally rather than through a series of clean-slate designs.
Relationship: entailment
Domain: Networks
Sentence 1: Smax is bounded to the di.erence from message deadline and transmission time for each node, while Smin is at least 0.0, as the message will be discarded at some intermediate node if the slack is less than 0.0, namely, its deadline expires.
Sentence 2: the chop partition dispatches to Sink 1 themessage whoseslack belongs tothe rangeof 0.0 through c. each node sends the message along the fast path, if the message has a tight deadline.
Relationship: entailment
Domain: Networks
Sentence 1: It is typically modeled on layer 3 of Internet protocols because economic relationships can be inferred from BGP (Border Gateway Protocol) [55] and IP (Internet Protocol) [53] measurements.
Sentence 2: bGP identi.es ASes (Autonomous Systems) on announced paths, enabling inference of layer-3 structures where ASes act as economic entities interconnected by transit or peer­ing relationships [30].
Relationship: entailment
Domain: Networks
Sentence 1: However, this may not be possible for Jing s approach because the number of bit-sequences (i.e., log(k)) is completely determined by the number of updates, k, during the window period (assumed fixed), and the number of updates, and thus, the update rates have nothing to do with FIR, as shown in the tables.
Sentence 2: even though there is still bandwidth left for use, Jing s approach simply cannot use it to reduce the false invalidation rates.
Relationship: entailment
Domain: Networks
Sentence 1: Our prototype library uses heuristics that are inexpensive in terms of probes, robust in the face of incomplete information provided by the primitives, and produce good results.
Sentence 2: the topology probing layer provides the small set of facts that the underlay has learned about the Internet s topology, while the routing services library represents the higher-level con­clusions one might derive based up on those facts.
Relationship: entailment
Domain: Networks
Sentence 1: Forsuchrandomwalks(formally called continuized random walks [1]) it is possible to show that if G is con­nected, the steady state probabilities that the walk is at a vertex i always exist and are equal to di pi = Pn .
Sentence 2: (1) i=1 di if the query packet is forwarded for su.­ciently long time, the probability it will be on vertex i will be proportional to the degree di of i.
Relationship: entailment
Domain: Networks
Sentence 1: measured patterns or statistics, but ignoring the feedback that en-In this paper we present a preliminary investigation of the pos­ergy saving schemes may have on the traf.c itself.
Sentence 2: without sible intertwining between capacity scaling approaches and TCP taking into account the possibility that changes in the instantaneous congestion control, and we show how this interaction can affect offered traf.c rate may be caused by the effect that energy-saving performance in terms of both energy saving and QoS.
Relationship: entailment
Domain: Networks
Sentence 1: We provide the .rst lower bounds on the number of bea­cons required for a triangulation in some speci.c simple net­works.
Sentence 2: these bounds (i) answer Slivkins ques­tion positively, even for one-dimensional metrics, and (ii) prove that, up to constants, Slivkins triangulation achieves an optimal number of beacons (as a function of the approx­imation guarantee and the doubling dimension).
Relationship: entailment
Domain: Networks
Sentence 1: The average number of links traversed across all topologies in our architecture is 6,208 links (for 1,000 samples), while the average for triangle routing is 11,157.
Sentence 2: on average, triangle routing for MIP consumes almost twice as much network resources as does a shortest path approach (such as MIP with route optimization or our proposed protocol) for the same scenarios.
Relationship: entailment
Domain: Networks
Sentence 1: 5.1 Topology lay-out strategy and required area In this subsection we apply our lay-out approach for a single topology and we examine the benefits on the required lay-out area, varying a single technological parameter at a time.
Sentence 2: we examine the impact of smaller chip footprints (sh = sr = 26 mm, and sh = sr = 10 mm), smaller bending radiuses (ro = ri = 10 mm and 1mm - for both intra- and inter-node connections), and smaller crossing angles (.
Relationship: entailment
Domain: Networks
Sentence 1: This sounds 301 very reasonable.
Sentence 2: let X~ be a indicator variable for the event that node r is a receiver for the next request, given that the source node for the request is s. 1 if r is a receiver for next request Xr = given that source is s 0 otherwise Clearly, the number of receivers for the next request given that the source node is s is ~reR Xi, where R is the set of all possible receivers (egress nodes).
Relationship: entailment
Domain: Networks
Sentence 1: In this direction, we envision a particularly promising type of nanomachines based on key synthetic bi­ology techniques [21], which allow to genetically engineer cells, such as bacteria, and program functionalities in the biological environment.
Sentence 2: a synthetic biologi­cal circuit [19], or simply biological circuit, allows to pro­gram logical functions from simple controlled production of speci.c types of protein molecules, to complete engineered cell-to-cell interactions [18], such as a di.usion-based molec­ular communication system, in a similar way as it is done with electrical circuits.
Relationship: entailment
Domain: Networks
Sentence 1: Since DistGreedy approximates the optimal solution to the MWIS problem at each time slot, we focus on the behavior of DistGreedy under static inter­ference models, where the interference relationship does not change across time.
Sentence 2: we use one-hop (or pri­mary) interference model, under which two links that share a node cannot transmit at the same time.
Relationship: entailment
Domain: Networks
Sentence 1: Therefore, the bandwidth con­sumption of our replication method, L, is, at most, two times the ideal L * (we omit the full proof due to space limitations): L = 2 · L * (2)  5.2 Concurrent provisioning of many servers In our next experiment, we consider a typical application of multicast tra.c.
Sentence 2: we source multicast traf­.c from 6 user ports in 3 leaf switches (2 sources per leaf ).
Relationship: entailment
Domain: Networks
Sentence 1: However, since it sits on top of the standard network interface card drivers, it is a.ected by the same problems identi.ed in the previous section.
Sentence 2: for each incoming packet a temporary memory area, called socketbu.er[8,21],is allocatedby the network driver, and then copied to the PF RING ring bu.er which is memory mapped to user space.
Relationship: entailment
Domain: Networks
Sentence 1: However, .nd­ # of links remaining in G' ' r# of bad paths remaining in G' ing MILSes di.ers from the usual problem of .nding a sparse k' =s' rank of G' basis for the following reasons: The sparse basis problem is an NP-hard problem, and nearly all the heuristic algorithms for this problem are based on a nondegeneracy assumption.
Sentence 2: these heuristics require that every submatrix of G with G reduced ¯G after removing good paths &#38; links ¯G a basis of G'' , also a basis of G' Q' ,R' QR decomposition of ¯G' T .
Relationship: entailment
Domain: Networks
Sentence 1: Once the video streaming session has been closed, there are still a considerable number of packets in the AP buffer that must be flushed from the queue which results in the gradual decrease in the BWLOAD over time.
Sentence 2: it can be seen that the packet size of the background traffic load plays an important role in determining the background traffic load that can be supported before the video stream is severely corrupted and ultimately terminated.
Relationship: entailment
Domain: Networks
Sentence 1: The .gure shows, for a process with .xed standard deviation (stdev=0.3), and Hurst parameter (H =0.8, which is a fairly typical value for traf.c data), the impact of varying .. We can see in this case, that the insight from the M/M/1 queue applies, only more strongly.
Sentence 2: for .nite length data we have fundamental limits on the accuracy with which we can know the average queueing delay, and these limits decrease more slowly for LRD dependent data.
Relationship: entailment
Domain: Networks
Sentence 1: Mathematically, the problem and goals of this work is formulated as follows.
Sentence 2: i0 i0 i0 Let Pi0={ v ,v ,...,v } denotes the routing path from vi to 12 k i0 1 vktree T and a request set D, a working set WT,D denotes the set of all SSs that participate in the data transmission for satisfying all request in D. v0(BS), where vi0 and are vi and v0, respectively.
Relationship: entailment
Domain: Networks
Sentence 1: For each subset .. of ..,we use ....,.. to denote the set of all replications of the links in ...
Sentence 2: ....,.. is the set of all replicated links of the links in ... A subset .. of ....,.. can transmit at the same time if and only if (1) all replication links in .. are radio-disjoint, in other words, no pair share a common radio, and (2) for each channel .., all the replication links in .. transmitting over channel .. are con.ict-free.
Relationship: entailment
Domain: Networks
Sentence 1: Note that the inference of failure location is based on router location, but the actual failure could be at the link or router attached to the last responding router.
Sentence 2: the availability estimate is computed as follows: If Tcis the ' total time failures attributed to routers of class Cwere observed, c and Nis the total number of routers of class Cwe observed on d each path on day d,6 then we estimate the availability of a router (or attached link) of class Cas: Tc Availabilityc 100x1-' dNdcx  day the fraction of time unavailable is the aggregate failure time attributed to a router of class Cdivided by the total time we expect to observe a router of class Cin any path.
Relationship: entailment
Domain: Networks
Sentence 1: We observe that as ß is decreased, many of the high-performance 4+ hop paths are replaced by sub-optimal 3 hop paths.
Sentence 2: the average 3-hop path throughput is 3.8, 3.98 and 4.29 Mbps for ß=0.7, 0.8 and 0.9 respectively.
Relationship: entailment
Domain: Networks
Sentence 1: Minimizing Server Throughput for Low-Delay Live Streaming in Content Delivery Networks Fen Zhou Shakeel Ahmad Eliya BuyukkayaTelecom Bretagne De Montfort University Telecom Bretagne Brest, FranceLeicester, United Kingdom Brest, Francefen.zhou@telecom-sahmad@dmu.ac.uk eliya.buyukka@telecom­bretagne.eu bretagne.eu Raouf Hamzaoui De Montfort University Leicester, United Kingdom rhamzaoui@dmu.ac.uk ABSTRACT Large-scale live streaming systems can experience bottle­necks within the infrastructure of the underlying Content Delivery Network.
Sentence 2: the equipment bottleneck occurs when the fan-out of a machine does not enable the concurrent transmission of a stream to multiple other equip­ments.
Relationship: entailment
Domain: Networks
Sentence 1: Computing Separable Functions via Gossip Damon Mosk-Aoyama Department of Computer Science Stanford University Stanford, CA 94305, USA damonma@cs.stanford.edu ABSTRACT Motivated by applications to sensor, peer-to-peer, and ad­hoc networks, we study the problem of computing func­tions of values at the nodes in a network in a totally dis­tributed manner.
Sentence 2: we consider separable func­tions, which can be written as linear combinations of func­tions of individual variables.
Relationship: entailment
Domain: Networks
Sentence 1: Indeed, existing protocols either do not satisfactorily address the problem of coercion and vote-buying [2, 3, 10], or they are too impractical and involved to be understood by the vast majority of users [5, 11].
Sentence 2: a notable problem is to achieve the property of individual veri.ability (a voter can verify that their vote was counted as intended) without violating coercion resistance (a voter cannot prove to a co­ercer how they voted).
Relationship: entailment
Domain: Networks
Sentence 1: A quick glance at publicly available maps of some of the major backbones2 show that most cycles in NSP networks contain at least one peering point, provided we treat multiple direct links between two points as a single bundle.
Sentence 2: the Internet is mostly a tree, ex­cept for public peering points and very short redundant paths such as FDDI rings and n × m fabric at PoPs or between core routers and border routers3.
Relationship: entailment
Domain: Networks
Sentence 1: By intensively experimenting (to be reported later) on our MicaZ Motes and their CC2420 radios, we have discovered that it would be more e.cient to use the spectrum resource in a continuous manner.
Sentence 2: we should allocate channels to nodes or links in terms of their center frequencies (rather than a .nite set of channel IDs).
Relationship: entailment
Domain: Networks
Sentence 1: The solution of the steady-state equations will provide us with the probabilities .Fj in equation (3).
Sentence 2: the probability of each cycle Fj is given by the limiting probabilities of states ss(x,1) and ss(x,x+1), which correspond to a cycle starting in the state ss(x,1) or ss(x,x+1) respectively.
Relationship: entailment
Domain: Networks
Sentence 1: In SC and MRC cut-through schemes, each forwarding node combines all of the incoming signals, i.e., K in equation (3) is equal to N. Because diversity combining is not possible at the first hop receivers, the three schemes share the same BER results.
Sentence 2: due to zero MAI, the average BER at the first hop receivers is 10-3, 4·10-5, and 0 for 0, 1 and larger decibels of Eb/N0, respectively.
Relationship: entailment
Domain: Networks
Sentence 1: While most of these papers assume that players update their actions following the best response dynamics, some pa­pers argue that if players do not know the exact form of the game then it will be more reasonable to consider an imitative dynamics.
Sentence 2: in populations with limited information about the game, players try to learn the best action by imitating those neighbors who are currently more successful [2, 5, 6, 13].
Relationship: entailment
Domain: Networks
Sentence 1: CONCLUSION In this paper, we have presented a new IPTV delivery platform that provides mobile users with customized IPTV service via WLAN 802.11 access network.
Sentence 2: we have presented mechanisms used by our IPTV architecture to provide the tight management of QoS and security for IPTV services over two different segments of the IPTV transmission path.
Relationship: entailment
Domain: Networks
Sentence 1: For the other algorithms, the best performers also tended to place nodes mostly on channels 1, 6, and 11, but some of the algorithms were unaware of adjacent channel interference, and thus were less likely to avoid the intermediate channels.
Sentence 2: as would be expected, Hrandom scattered access points evenly across the 11 channels, with around 9% assigned to each.
Relationship: entailment
Domain: Networks
Sentence 1: Let d < n. A ]amily 3= of subsets of [n] is (n,d)-strongly-selective /] for every non empty subset Z of [n] such that IZl < d and for every element z E Z there is a set F in 3= such that Z n F = {z}.
Sentence 2: we will use the following upper bounds [13, 1@ THEOREM 3.1.
Relationship: entailment
Domain: Networks
Sentence 1: For one, we .nd that the stable pool of server IPs is consistently contributing more than 60% of the server­ : : : : : : : : :  New  Rec ent  Stab e  (a) Churn of server IPs N be  e w t e e N be e e  :  server-related traf.c attributed to the stable and recurrent pools of J server IPs, respectively, Figure 5 shows for each week n three bars, : each with .ve segments corresponding to the .ve regions consid- W related traf.c.
Sentence 2: of the server IPs that this IXP sees on : J : a weekly basis, more than 30% of them are not only seen week after week, but they are also responsible for most of the server­ related traf.c that traverses the IXP each week.
Relationship: entailment
Domain: Networks
Sentence 1: It is also possible to de.ne a stronger variant of FRBC, called F+ , that more closely corresponds to what is ac- RBC tually accomplished by the Hirt-Zikas attack.
Sentence 2: the di.er­ence between FRBC and F+ is that the latter only al- RBC lows the adversary to have m' =.. the adversary is allowed to adaptively corrupt the sender (based on the sender s original message) and thereby cause agreement on Functionality FRBC The functionality interacts with an adversary S and a set P = {P1,...,Pn} of parties.
Relationship: entailment
Domain: Networks
Sentence 1: consists of the current timestamp Ti and a list of tuples (d=, t~) such that t= > (T~ - w * L), where d= is the data item id, t= is the most recent update timestamp of d=, and w is the invali- dation broadcast window size.
Sentence 2: iR contains the update history of the past w broadcast intervals.
Relationship: entailment
Domain: Networks
Sentence 1: An orphan NIC is useless since no neighboring nodes can receive its data, but it enables us to simulate the condition in which nodes have different numbers of effective radios (i.e., non-orphan radios).
Sentence 2: if an assignment leads to a node with x orphan NICs, it means this node is equipped with only 4-x effective data NICs and one control NIC, where 0 = x < 4.
Relationship: entailment
Domain: Networks
Sentence 1: Our simula­tiongoalis toinvestigate where ourMarkovbased algorithm falls in this performance spectrum compared to these algo­rithms with di.erent values of alpha.
Sentence 2: if the class of a-epidemic algorithmshas a totalperformance curve in the form of delay = f(energy), the Markov based algo­rithmis more energy e.cientifitsperformance curveliesbe­neath the class of a-epidemic s, meaning delay <f(energy).
Relationship: entailment
Domain: Networks
Sentence 1: This experiment shows that while the be-Figure 2: 802.11 throughput in the presence of heteroge­neous data rate senders havior is fair as nodes see equal performance irrespective of their sending rate, it hurts the overall system through­put.
Sentence 2: as the sending rate of Node 2 decreases from 54 Mbps to 6 Mbps, the total system throughput decreases from 24 Mbps to 7.2 Mbps.
Relationship: entailment
Domain: Networks
Sentence 1: In addition, there is often no way to control the Q values set by a reader since modern RFID readers are designed for ease of use and hide low-level protocol parame­ters from the operator.
Sentence 2: the Impinj Speedway reader we use in this paper o.ers no visbility into the chosen Q value; the resulting window size is completely decided by the reader s proprietary algorithm.
Relationship: entailment
Domain: Networks
Sentence 1: Application level multicast approaches using over­lay networks [4, 5, 6, 11, 15, 22, 30] have been recently proposed as a viable alternative to IP multicast.
Sentence 2: end System Multicast (ESM) [5, 6] has gained considerable attention due to 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: entailment
Domain: Networks
Sentence 1: While most of the existing research deals with the prob­lem of e.ciently and accurately distinguishing spam from ham, in this paper we focus on the thin line that separates the two categories.
Sentence 2: we limit our study to the often overlooked area of gray emails [31], i.e., those ambigu­ous messages that cannot be clearly categorized one way or the other by automated spam .lters.
Relationship: entailment
Domain: Networks
Sentence 1: 5.2 Network of Two Cells Motivated by the .ndings from the illustrate example, we next analyze the channel knowledge requirement of the beamforming weight optimization for a two-cell MU-MIMO network with arbitrary con.guration.
Sentence 2: we prove three key theorems regarding such requirement that can be summarized as follows: to calculate the optimal beamforming weights based on the optimal antenna usage, an AP or a client only needs the channel knowledge owned by a particular set of clients in the network.
Relationship: entailment