sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: Similarly, in [10, 12, 15, 19, 23], routing decisions were mainly based on the so-called contact prob­ability of two users (or one user visiting an access point if available).
Sentence 2: [11] has considered algorithms to calculate the contact probability based on deterministic mobility of the users, which is suitable for satellites/buses with .xed paths/routes, but is not applicable to an ICMAN having mobile users.
Relationship: entailment
Domain: Networks
Sentence 1: 0 The upshot of this result is that as long as the delay-utility function representing user impatience is known, we can al­ways determine the number of copies QCR must make to drive the allocation towards its optimal.
Sentence 2: the optimal reaction function can be derived in a simple expres­sion for all the delay utilities previously introduced, as seen in Table 1.
Relationship: entailment
Domain: Networks
Sentence 1: Given the same constraint on the tra.c and network, sim­ilar results as in [28][9] can be obtained from the analysis in this paper.
Sentence 2: for the same network studied in [9], it can be veri.ed that the per-.ow end-to-end performance measures computed with the concatenation property Theo­rem 3.2 are also bounded by O(HlogH) that is the key result of [9] and is much better that O(H3) with the analysis in [28], where H is the number of nodes passed by the .ow.
Relationship: entailment
Domain: Networks
Sentence 1: As an example of the output, we present results of the 24-bit key sequence generated at each of the locations A through N using the .rst channel state estimates from Experiment 2.
Sentence 2: using a random seed r = 0x374573, the resulting keys were Location Key Sequence A 1001 1001 1101 1000 0101 1011 B 0110 0101 0010 1000 1110 1110 C 1101 0111 0000 0011 0011 1010 D 1111 0001 1101 1001 1111 0111 E 0100 0001 1101 1101 1000 0001 F 1111 1000 1101 1101 0001 1011 G 1100 0001 1110 1010 0110 1101 H 0000 1101 0000 1000 0000 0101 I 1111 0010 1011 0010 0111 1111 J 0010 1110 0011 0101 1111 0001 K 1010 1010 0101 0111 0100 0000 L 1011 1000 0110 0001 1001 0101 M 0101 1010 1010 1101 1010 1000 N 1100 1011 0101 1100 0111 1000 in spite of the correlation that exists be­tween certain pairs of locations on individual carriers, the fact that we are utilizing more than one carrier with di.erent correlation properties causes the quantized feature vector, and hence the resulting bit sequences, to di.er.
Relationship: entailment
Domain: Networks
Sentence 1: Tup: A routing event is classi.ed as a Tup if its pstart = e. A previously unreachable destination becomes reachable through path pend by the end of the event.
Sentence 2: tdown : A routing event is classi.ed as Tdown if its pend = e. a previously reachable des­tination becomes unreachable by the end of the event.
Relationship: entailment
Domain: Networks
Sentence 1: Here, we see more than 20% of the packets have out-of-order delay larger than 150 ms, even without including the one-way network delay.
Sentence 2: given that Sprint 3G s average RTT is about 200 ms, if we consider the one-way delay to be half of the RTT, its overall end-to-end delay (prior to be available to associated appli­cation) is (200/2)+100 = 200 ms, which is much larger than the duration that most modern real time applications can tolerate.
Relationship: entailment
Domain: Networks
Sentence 1: (2) Dipartimento di Elettronica, Informatica e Sistemistica Università di Bologna Viale Risorgimento, 2 -40136 Bologna Italy {pbellavista, lfoschini}@deis.unibo.it users are willing to have ubiquitous and continuous access to both traditional and novel context-aware Internet services while they move in smart spaces, such as smart museums or airports.
Sentence 2: novel context-aware services should be aware of all the possibilities offered by each wireless technology and their respective limitations.
Relationship: entailment
Domain: Networks
Sentence 1: The improved performance observed for a single row rout­ing table is due to the fact that the .rst hop under random selection makes little or no progress towards the message destination.
Sentence 2: while DHT paths are made up of a series of hops of exponentially decreasing length, the .rst random hop potentially adds a long hop to the path; thus seriously degrading the quality of the overall end-to-end path.
Relationship: entailment
Domain: Networks
Sentence 1: Data aggregation schemes and transmission scheduling al­gorithms are shown to have signi.cant e.ects on data deliv­ery performance.
Sentence 2: we .nd that simple schemes that choose gateways randomly and give equal priority to tra.c in both directions between gateways and the ferry achieve good delivery ratio while utilizing more information about contacts and tra.c load provides certain improve­ment.
Relationship: entailment
Domain: Networks
Sentence 1: This lemma implies that the total data that can be sent out from any grid during any time interval t is at most Wa · .t for a con­stant .. To prove an upper bound on the capacity, we will only consider the grid cells that are disjoint from the disks de.ned by base-stations.
Sentence 2: for nodes located inside these grid­cells, it cannot reach the base-stations directly and its data has to be relayed by some other nodes to reach the base stations.
Relationship: entailment
Domain: Networks
Sentence 1: Based on sequentially acquired primary RF-power measurements, we derived a sparsity-cognizant PU state tracker that can solve the above regression problem online and in a distributed fashion [1].
Sentence 2: we derived a distributed version of the on-line coordinate descent (OCD) least-absolute shrink­age and selection operator (Lasso) algorithm where, at each iteration of the algorithm, consensus is reached on the entry of the unknown vector p(t) that has to be updated.
Relationship: entailment
Domain: Networks
Sentence 1: Althoughthisprotocol achievesthesecuritypropertieswe desire,itis slowbecauseit usespublickey cryptography.
Sentence 2: onAP and consumerelectronicshardware,asin­gle private key decryption can take over 100 milliseconds several orders of magnitude greater than the time required to transmitthe message(see §5).
Relationship: entailment
Domain: Networks
Sentence 1: Thanks to this additional routing layer, a mobile node is always reachable with its home IP address, even though connected through a foreign network with a completely di.erent ad­dress space.
Sentence 2: the default Mobile IP routing scheme is called triangular routing: IP datagrams sent to the mobile node are intercepted and routed by home and foreign agents, while datagrams generated by the mobile nodes are routed as common Internet tra.c, .owing directly from the mobile node to the destination.
Relationship: entailment
Domain: Networks
Sentence 1: In this game, each unit of overlay routing traf.c .ow travels along the minimum-latency path available to it, where latency is measured with respect to the rest of the .ow; otherwise, this .ow would reroute itself on a path with smaller latency.
Sentence 2: all paths in use by an equilibrium .ow have minimum-possible cost.
Relationship: entailment
Domain: Networks
Sentence 1: 4.3 MMSE bit-allocation A third possible bit-allocation strategy is based on the be­havior reported in Figure 2 and the analysis carried in [18] for the scalar Gaussian wiretap channel.
Sentence 2: it ap­pears clear that the most critical losses in using .nite QAM constellations for secret transmissions are experienced when­ever the transmission power exceeds the optimal power al­location reported in [18] and the corresponding secrecy rate starts to decrease.
Relationship: entailment
Domain: Networks
Sentence 1: Some of these events be­came target of our study.
Sentence 2: in our data collection cam­paign we targeted the following scenarios: 1) Events of national 1http://dl.ubnt.com/src_datasheet.pdf  Frame Ctrl Duration DA SA BSSID Seq Ctl SSID FCS ... ... ff:ff:ff:ff:ff:ff 10:9a:42:42:42:42 ff:ff:ff:ff:ff:ff ... null (Broadcast) ... ... ... ff:ff:ff:ff:ff:ff 10:9a:42:42:42:42 ff:ff:ff:ff:ff:ff ... Free WiFi  ... ... ... ff:ff:ff:ff:ff:ff 10:9a:42:42:42:42 ff:ff:ff:ff:ff:ff ... Home WiFi ... Table 1: Example of Probe Requests sent by device with MAC address 10:9a:42:42:42:42.
Relationship: entailment
Domain: Networks
Sentence 1: In general, ac­curate estimationishard, inpartbecause overhearingprobabilities canchangeat .netimescales[6].However,asshownin§5,highly accurate predictions are unnecessary.
Sentence 2: we .nd that directly using the measurements in Table 1 may be good enough and estimatingreceptionfractionsfor eachdeployment maynotbe needed.
Relationship: entailment
Domain: Networks
Sentence 1: This technique thus forces M to either return all the data satisfying the query or risk being caught.
Sentence 2: to enable spatial crosscheck, we in­troduce a gossip phase at the end of each epoch t, in which sensor nodes exchange information about their sensed data before sending them to M. Then each node that has data to submit appends some randomly-chosen received information to its own data buckets and then sends encrypted buckets to M. during the gossip phase of epoch t, each node with data for submission, say Si, broadcasts a gossip message within cell C which contains each of the generated bucket IDs {Vi,j }Yi j=1 with equal probability pb.
Relationship: entailment
Domain: Networks
Sentence 1: We take Phase 2 to last until time TP 2 TP 1 +2(1 + W * /2)- 6log(g)/g, so that: *-g(Tk-TP1 )6-g(Tk-TP2 ) |ai(Tk)- a |= A0ke= gke.
Sentence 2: (31) it is easy to check that given (22), g 6TP 2 = g, which implies that for Tk = TP 2: 6-g(Tk-TP2 )6-g(Tk-TP2 ) .k g ke= gTke = g. (32) Phase 3.
Relationship: entailment
Domain: Networks
Sentence 1: Let the bit-to-subcarrier assignment be that A1 .G1, A2 .G2, A3 .G3, and A4 .G4.
Sentence 2: the bits in bit block A1 are assigned to be carried by subcarrier group G1, those in A2 by G2, A3 by G3, and A4 by G4.
Relationship: entailment
Domain: Networks
Sentence 1: The forward­ing of Interest Packets in the actual plane for Algorithm 2 coincides with the forwarding scheme described in (10).
Sentence 2: all the Interest Packets for a particular request for a given data object are forwarded on the link with the max­imum average VIP .ow rate over a sliding window of size T prior to the arrival time of the Interest Packet for the .rst chunk of the data object.
Relationship: entailment
Domain: Networks
Sentence 1: The main problem is that the Radio Network Controllers (RNC) do not have the information about the instantaneous transmitted power of each user, and need to know what the exact number of PtP connections that are equivalent to a single PtM connection is.
Sentence 2: the determination of the ideal switching point between multiple DCHs and FACH is essential for the reduction of the transmission power.
Relationship: entailment
Domain: Networks
Sentence 1: 110 100 90 80 (a) Speedup 120  Relative Delay (%) 100 80 60 40 20 0 (b) Overall latency Figure 11: (a) Speedup of the 16-node system with The result can also be a serious performance issue for chip­ multiprocessors.
Sentence 2: a bus architecture should not be written o. as a possible solution for on-chip interconnect.
Relationship: entailment
Domain: Networks
Sentence 1: T DC - 2 requires about 3.6 dB less Eb/N0 than the single path uncoded scheme to receive the entire message.
Sentence 2: with the same Eb/N0, e.g., 7.6 dB, T DC - 2 achieves full throughput and maximum e.ciency at a 1/2 DC code rate.
Relationship: entailment
Domain: Networks
Sentence 1: In this case, the recon.gurations min­imization phase requires only 3.36 s. Figure 5: The two best placement solutions on a 5x4 grid of applications A to B  4.3 Timing performance Table 2 presents the timing performance of the proposed design .ow for recon.gurable NoC-based architectures.
Sentence 2: the design .ow has been used to generate a re­con.gurable system for each application presented in Section 4.2 plus other more complex video/audio streaming applica­tions (C, D and E).
Relationship: entailment
Domain: Networks
Sentence 1: APPENDIX 8.1 Proof of Lemma 2 Recall that the values of A[i], i =1, 2, ..., N are initialized to values uniformly distributed over {0, 1, ..., 2l - 1} independently.
Sentence 2: v1(0), V1(0), ..., VN (0) are mutually independent and each of them has the following distribution: 8 >0 with probability 2-l , > > < 1 with probability 2-l , Vj(0) = >... > > : 2l - 1 with probability 2-l .
Relationship: entailment
Domain: Networks
Sentence 1: This edge-based notion of con.ict graph is quite complicated, and can be considerably simpli.ed by observing that, under the assumption that no per-packet transmit power control is used, the notion of interference in the physical model is associated with nodes, and not with edges.
Sentence 2: the interference level generated at a receiver v by a transmitter u, which is transmitting to a third node, say w, is independent of w, because u uses the same transmission power for all communications (of course, due to our link-layer reliability assumption, the interference generated by w when sending its ACK packet must also be included).
Relationship: entailment
Domain: Networks
Sentence 1: While traditional systems have eschewed such solutions due to the potential perturbation caused by addi­tional monitoringloads[23],giventhat modern machinesare increasingly bound in performance by memory bandwidth rather than CPU speed, we advocate an approach in which data-near analysis is used both to reduce monitoring data volume and to rapidly gain insights from captured data.
Sentence 2: we posit that it is often cheaper to quickly an­alyze data and then send out data summaries or abstracts thanitistocopy rawcaptureddataitems thisfacthasalso been showntoholdfordatadissemination across networked machines[7], and wenotethatforthesame reasons,phys­ical systems using smart sensors are increasingly common.
Relationship: entailment
Domain: Networks
Sentence 1: Moreover, owing to the the ratio between the maximum packet processing capacity and the traffic offered load, in terms of packets per second that require header processing.
Sentence 2: by assuming that the packet 24 hours time scale variability of traffic load dynamics on processing unit in a component can be modeled as a single server2 queuing system, with finite buffer and generic arrival/service time Internet links, in many cases rush hours and low utilization time distributions (i.e., a G/G/1/N queuing model), we can express its bands can be easily identified.
Relationship: entailment
Domain: Networks
Sentence 1: To measure short-term fairness we consider the sliding window application of Jain s fairness index as de.ned in [2], adapted to the case where di.er­ent stations can have di.erent weights.
Sentence 2: let yi(K)= zi(K)/wi,where zi(K) is the fraction of transmis­sions performed by station i in some window K and wi is the weight for station i.
Relationship: entailment
Domain: Networks
Sentence 1: Especially for MAC, although there is some convergence on the techniques to be used [13], there is still little evidence on the way these techniques can be effectively used in BAN.
Sentence 2: what is missing, is full understanding of the trade-offs created by these techniques and knowledge to optimally mix them for different BAN Permissiontomakedigital or hardcopies of all orpart of this work for personal or classroom use isgranted without fee provided that copiesare notmadeor distributedforprofitor commercial advantage andthatcopiesbear this notice andthe full citationonthefirst page.
Relationship: entailment
Domain: Networks
Sentence 1: Root servers very rarely an­swer with A or AAAA records, so we only plot NS record TTLs returned by root servers.
Sentence 2: a and AAAA record pro­vides a direct mapping from a hostname to an IPv4 address and an IPv6 address, respectively and the NS record provides a refer­ence to the authoritative nameserver that should know the queried hostname when the nameserver being queried does not know the IP address of the queried hostname.
Relationship: entailment
Domain: Networks
Sentence 1: Finally, due to simulation running time constraints, the node step size granularity is high.
Sentence 2: in Figure 3 the derivation for mesh unicast in Appendix A is really valid only for large N and therefore we see higher discrepancy at lower N. The simulation results attest to the fact that the approach taken and approximations and assumptions made do not excessively com­promise accuracy.
Relationship: entailment
Domain: Networks
Sentence 1: Easily, this corresponds to the selective algebra(R+ ,0,min,=), and so W is compressible by Theorem 1.
Sentence 2: under the tree routing scheme duetoFraigniaud andGavoille[10] widestpath routing can beimplemented using5logn bit addresses and3logn bits local memory, or log2 n bits using the scheme of Thorup andZwick[4].
Relationship: entailment
Domain: Networks
Sentence 1: In order to simplify the analysis we assume (without loss of generality) that in the optimum Knapsack solution, at most one carrier is partially assigned to user i and this carrier has the highest index among carriers as­signed to user i.
Sentence 2: if there exists a carrier c such that Qsi b(i, c ) >ß( c)and b(i, c ) <r(i, c )then c = c .
Relationship: entailment
Domain: Networks
Sentence 1: The prior studies in this area mostly focus on the caching de­cision algorithm, and the caching replacement algorithm , such as Least Recently Used (LRU) and Least Frequently Used (LFU); the latter of which are originated from the computer architecture liter­ature.
Sentence 2: the rationale behind LRU and LFU is that most of popular objects are consumed many times once they are used, and their popularity generally follows Zipf distribution, which re.ects the power-law effect [4], a relatively small number of popular objects are requested by a large number of users, which account for the majority of the Internet traf.c.
Relationship: entailment
Domain: Networks
Sentence 1: property, we propose using SPLD as a more sophisticated signature to select mapping candidates.
Sentence 2: when we try to select a node v ' in Gb as a candidate to be mapped to a node v in Gp, we only select the v ' from these nodes that have the same SPLD as v. This is effective because two nodes with different SPLDs cannot be mapped to each other.
Relationship: entailment
Domain: Networks
Sentence 1: Since most of the APs are deployed along roads, the simple instant model should work well.
Sentence 2: when a mobile client has visited multiple APs in sequence, which is represented by (, , ) where li and ti denote the location of the ith visited AP and the time of this visit, respectively, it is predicted to move in the same direction and velocity as it did between the last two visited APs, that is, ln í lní1 vp = .
Relationship: entailment
Domain: Networks
Sentence 1: Second, TPUT is proven to be instance-optimal on common data se­ries.
Sentence 2: analysis shows that by using a pruning parameter a< 1, TPUT achieves a qualitative reduction in network tra.c, lowering the optimality ratio from O(m *m) v to O(m * m) for data series following Zipf distribution.
Relationship: entailment
Domain: Networks
Sentence 1: First and foremost, the focus of this work is on evalu­ation of these sampling algorithms within the framework of anomaly detection which is heavily based on .ow measure­ment.
Sentence 2: .ow arrival time series are utilized by the wavelet-based volume anomaly detection, and exported .ow records are required for TRWSYN and TAPS, respec­tively.
Relationship: entailment
Domain: Networks
Sentence 1: min = n Speci.cally, D can be bounded as follows: min V V m K K ~ Dmin ~ 2 m , (2) nbmn where bm is the volume of a unit ball (a ball of unit radius) in the m-dimensional space.
Sentence 2: b1 =2, b2 = l, and b3 = 34 l. 8 The proof of this result is straightforward, and is presented in Appendix A for completeness.
Relationship: entailment
Domain: Networks
Sentence 1: If on exchange of DH values X, Y an attacker M computes a correct value MACKm (t), for some input t,where Km is the MAC key derived by the KDF from X, Y , then there is an extractor machine M ' that on the same inputs of M outputs the keys Km and Ks.
Sentence 2: 4 there are no shortcuts available for the at­tacker in computing the MAC without going through the key derivation steps and explicitly computing the MAC key Km as well as the companion key Ks.
Relationship: entailment
Domain: Networks
Sentence 1: In this work, we focus on Intermittently Connected Mo­bile Ad hoc Networks (ICMAN) formed by a group of mo­bile users roaming within a geographical area that is fairly large relative to the wireless transmission range, who either have no access to the infrastructure, or for other regulation or application speci.c requirements, could not or do not want to use the infrastructure for transferring certain de­lay tolerant data amongst themselves.
Sentence 2: the features of such ICMAN include those of ICN, as well as those of MANET such as lack of infrastructure, and non­deterministic mobility pattern of the users.
Relationship: entailment
Domain: Networks
Sentence 1: This paper shows a very strong result: there exist failover implementations for OpenFlow that achieve a maximal ro­bustness, in the sense that connectivity is always ensured as long as the underlying physical network is connected.
Sentence 2: we show that the problem of computing failover tables is related to graph search, and present three di.erent algorithms achieving di.erent tradeo.s, in terms of the num­ber of required failover rules, the number of tags, as well as the resulting path lengths.
Relationship: entailment
Domain: Networks
Sentence 1: Feasible throughput capacity for multi­cast: In a WAHN of n nodes, where each node is a source of a multicast session and transmits its packets to m ran­dom destinations, a throughput of Cm(n) bits per second for each session is feasible if there is a joint spatial and temporal scheduling transmission scheme, such that every source node can successfully deliver Cm(n) bits per second on average to its m chosen destinations.
Sentence 2: there is a T< 8 such that in every time interval [(i - 1)T, iT ] every source node can send TCm(n) bits to its destination nodes.
Relationship: entailment
Domain: Networks
Sentence 1: It is achieved by a time division multiple access (TDMA) mechanism, in which a temporal slot (sub-frame) is allocated to each CL-AP, proportional to the bandwidth requirement of its BSS and, hence, fair allocations among APs in terms of traffic load.
Sentence 2: the total duration of a super-frame is separated into n sub-frames, where n is the number of CL-APs and corresponding BSSs.
Relationship: entailment
Domain: Networks
Sentence 1: A comparison of these results with the lower bounds allows one to effectively identify the op- timal blocking probability.
Sentence 2: in our experiments we see that the Repacking scheme is near optimal since it comes close to achieving one of the lower bounds (the sub- set pooling bound), while other more easily implementable schemes such as Least Busy Frequency are also not too far from the optimal.
Relationship: entailment
Domain: Networks
Sentence 1: INTRODUCTION A major recent development in computer networking is the no­tion of Software-De.ned Networking (SDN), which allows a net­work to customize its behaviors through centralized policies at a conceptually centralized network controller.
Sentence 2: open­.ow [13] has made signi.cant progress by establishing (1) .ow tables as a standard data-plane abstraction for distributed switches, (2) a protocol for the centralized controller to install .ow rules and query states at switches, and (3) a protocol for a switch to forward to the controller packets not matching any rules in its switch-local .ow table.
Relationship: entailment