sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: In [11], authors propose Push&#38;Track (PT), an o.oading solution based on prede.ned performance targets used by the network controller to compute the number of content replicas to inject.
Sentence 2: the controller, at .xed time steps, operates content re-injections in order to force the opportunistic dissemination trend to follow a target dis­semination evolution.
Relationship: entailment
Domain: Networks
Sentence 1: We observe that for a visi­bility scope of l = 2, when the transmission ratio > 5, the network coverage of the required number of VSs is always smaller than the network coverage of the same number of VSs needed to ensure connectivity in secondary network.
Sentence 2: for a speci.c area, the number of VSs required for a visibility scope of 2 is always larger than that required to ensure full connectivity in the same area.
Relationship: entailment
Domain: Networks
Sentence 1: Our MB-facing ( southbound ) API de.nes how MB state is represented and how it can be access and ma­nipulated at .ne-granularity.
Sentence 2: state is repre­sented as key-value pairs, with the key being either a string constant (for con.guration state) or a .ow identi.er simi­lar to the OpenFlow 10-tuple (for supporting and reporting state).
Relationship: entailment
Domain: Networks
Sentence 1: Then, we find among all cases that Trunc FM needs to be used are not N-feasible, which are the ones where this Round Robin Trunc FM variation will not lead to a (N-1)-feasible solution for each node that could power off.
Sentence 2: we are interested in cases where, e.g., when node1 is chosen to power off, then the other N-1 nodes achieve their targets, but when node2 is chosen to power off, then the other N-1 nodes cannot achieve their targets.
Relationship: entailment
Domain: Networks
Sentence 1: Figure 6 merges parts of Figures 1 and 4 to illustrate how constraint di.erentiation works: we pick one, say s4,ofthe overlapping states s2 and s4 in Figure 4 (where t2 = t4) and replace the from constraint that does not appear in the other constraint set with a D-from constraint; this yields the transformed state s4 " .
Sentence 2: we use di.erentiation of constraints to restrict the extension of one of the two symbolic states to those ground states that are not covered by the other (as illustrated by the shaded part in the set of ground states).
Relationship: entailment
Domain: Networks
Sentence 1: M-TOP applies to the operator pla­cement problem in data stream processing environments and con­sidersa setof application-speci.c QoS-targets for operator place­ment.
Sentence 2: provided a set of nodes to place a set of operators, M-TOP searches for an operator placement that ful.ls the speci­.ed QoS-targets.
Relationship: entailment
Domain: Networks
Sentence 1: An important observation in .gure 2 is that the energy savings increase sharply as B increases from 1 to 2 or 3.
Sentence 2: while switching entire links on or o. as suggested previously [4] would only allow us to reduce the energy con­sumption of the associated line cards by 54%, if all links consist of three cables, the savings increase signi.cantly to 73%.
Relationship: entailment
Domain: Networks
Sentence 1: Some of the possible explanations for the heterogeneity of the implemented security levels can be captured by more elaborate equilibrium models.
Sentence 2: (1) users have incomplete in­formation on the levels of security deployed by other users, (2) the perceived bene.t of installing security patches may be smaller than the overhead patching incurs, and (3) some users may be gam­bling (knowingly or not) on the seriousness of the security threats they face.
Relationship: entailment
Domain: Networks
Sentence 1: If everything is in order, the TTP stores d2 securely, and creates a voucher VA by com­puting VA = S ignT T P (CA, w, sw).
Sentence 2: vA is the TTP s signature on message (CA, w, sw), which guar­antees that the TTP can issue a valid partial signature on behalf of Alice by using the secret d2.
Relationship: entailment
Domain: Networks
Sentence 1: Thus, the question is how far can we get if we simply .x the one place Epidemic Routing is weak in when it is forced to drop packets due to storage or bandwidth considerations.
Sentence 2: if we can determine which of the copies of a packet in various nodes in the network are more droppable than others, we can signi.cantly reduce the burden on resources without compromising too much on delivery.
Relationship: entailment
Domain: Networks
Sentence 1: The signi.cant increase in AAAA queries re­.ects wide adoption of IPv6 capable operating systems and browsers which issue AAAA queries along with A queries for requested names, as well as IPv6 capable resolvers which also issue AAAA queries for seen NS names by default.
Sentence 2: the top 3 domains that are looked up by AAAA queries are akamai.net, amazonaws.com and akadns.net.
Relationship: entailment
Domain: Networks
Sentence 1: Finally, YPi has expected value E(YPi )= P(YPi = 1), equal to the fraction of snapshots dur­ing which Pi is congested.
Sentence 2: if, during the ex­periment, we observe that Pi is congested during half of the snapshots, we model this by saying that P(YPi =1) =0.5.
Relationship: entailment
Domain: Networks
Sentence 1: Another possible answer to our question, and one that we con­front in this paper, is that there is no known solution that provides enough functionality to justify a standard approach to all P2P con­nectivity establishment.
Sentence 2: there is a widespread percep­tion that it is impossible in the vast majority of cases to establish direct TCP connections through NAT, and that there are too many cases where even UDP cannot be established through NAT because of the dif.culty of knowing what port number the NAT box will assign.
Relationship: entailment
Domain: Networks
Sentence 1: Such effect depends on the relative position of the FTP flows within the grid.
Sentence 2: fTP 1 experiences less contention than FTP 2 and FTP 3 due to its FT P 4 FTP5 FTP6  FTP3 FTP2 FTP1 Figure 19: Grid topology  400 350 300  more goodput than FTP 3 and FTP 4, respectively.
Relationship: entailment
Domain: Networks
Sentence 1: Let E be the primitive n-root of 1.
Sentence 2: e is the complex number: 2rn ´` ´` n H1, 2 +1 =2m ´ ` 2p 2p P rrn For 1 = k = n, de.ne a number: n-2 j=1 E = cos + i sin 2pj(k-1) 1 - 1 nn k=2 cos 2 X k=0 1 - 1 2 k-1(n-1)(k-1) .k = a1 + a2E+ ··· + anE(4) =  P rrn T n-2 j=1 2pj(2k+1) cosand a column vector: 1 Ek-1 E2(k-1) E(n-1)(k-1) 1, , , ..., ` X 2 4r n = p(2k+1)(2r+1) v (5) vk = ´ sin `´ k=0 (2r + 1) - n By substitution, we obtain: p(2k+1) sin n 0 BBBBB@ a1 a2 ... an-1 an an a1 ... an-2 an-1 .. .. .
Relationship: entailment
Domain: Networks
Sentence 1: As P 2h =2k - 1, 0=h<k summing newly reached peers across these m + 1 rounds yields that eachunit c t reaches the wholepopulationin m+1 rounds.
Sentence 2: the whole peer set is covered at the end of round t+m, as20 +20 +21 +··· +2m-1 =20 +2m -1 =2m .
Relationship: entailment
Domain: Networks
Sentence 1: Uncontrollable Probing (UP): P is the set of paths between monitors determined by the routing protocol used by the network, not controllable by the monitors.
Sentence 2: although CAP allows probes to traverse each node/link an arbitrary number of times, it su.ces for probes to traverse each link at most once in either direction for the sake of localizing node failures.
Relationship: entailment
Domain: Networks
Sentence 1: However,theseprotocols are guaranteed to work only if the models assumptions are ful.lled, which is hardly the case in practice.
Sentence 2: the UDG model assumes isotropic propagation of the ra­dio signal with distance, which is unlikely to happen in the real world due to phenomena such as scattering, re.ection, and di.raction of the radio signal.
Relationship: entailment
Domain: Networks
Sentence 1: In order to model the AKE-security of the end-to-end key KM,H we .rst specify the auxiliary notion of e2e-freshness for the instances of M and H, which de.nes the conditions under which A can be treated as an outsider with respect to the test session for which it has to distinguish KM,H.
Sentence 2: these conditions prevent active participation of A on behalf of either M or H by restricting A from respec­tive corruptions, and capture known-key attacks allowing A to reveal end-to-end keys computed in sessions that are dif­ferent from the test session.
Relationship: entailment
Domain: Networks
Sentence 1: Blacklisting: no packets with header h=0 traverse link (s2, s3).
Sentence 2: (h = 0) -> AG (switch = s2 -> ~(EX switch = s3)) if a packet header matches h=0, then on all paths where the packet reaches switch s2, it will not reach switch s3 on the next hop i.e.
Relationship: entailment
Domain: Networks
Sentence 1: It is important to note that, although our model allows for monetary transfers, in ev­ery resulting agreement between major players no monetary transaction is performed.
Sentence 2: our model predicts that the major players clique will form a settlement­free interconnection subgraph, while in major player -minor player contracts transac­tions will occur, and they will be of a transit contract type.
Relationship: entailment
Domain: Networks
Sentence 1: Despite decades of power and rate control research, few systems exist that jointly adapt transmit power and rate for WLANs on a per-link basis (partly due to the lack of hardware support for .ne-grained power control until re­cently [36, 48]).
Sentence 2: while rate control is per­formed onaper-link basis, current solutions either use static or coarsely dynamic transmitpower con.gurations onaper-AP or per-cell basis[2,31].These approachesforegoper-link power control s bene.ts in a mobile environment.
Relationship: entailment
Domain: Networks
Sentence 1: Quantifying Maximal Loss of Anonymity in Protocols Han Chen Queen Mary University of London School of Electronic Engineering and Computer Science hanchen@dcs.qmul.ac.uk ABSTRACT There is a natural intuitive match between anonymity and information theory.
Sentence 2: the maximal anonymity loss in anonymity protocols can be matched to the informa­tion theoretical notion of channel capacity.
Relationship: entailment
Domain: Networks
Sentence 1: From equation 1, the only way to reach such objective is to change the number Nk of tasks that i,j node ni executes during time slot k. Of course, the goal is not to decrease Nk for each node (which is suitable from i,j thepoint of view of each node),buttobalancetasks among nodes in function of their available energy.
Sentence 2: copyright is held by the author/owner.
Relationship: entailment
Domain: Networks
Sentence 1: It should be noted that this accumulation of di.culty is based on a very important condition: attackers e.ort on compromising one node cannot save their e.orts on compromising another node.
Sentence 2: if an attacker has spent 10 hours get­ting the secrets from one node, he/she might have to spend another 10 hours to do the same thing for another node.
Relationship: entailment
Domain: Networks
Sentence 1: described in §6.11 These experiments were conducted both in line­of-sight (LOS) and non-line-of-sight (NLOS) settings during peak library hours with pedestrian foot traf.c.
Sentence 2: we classify locations as non-line-of-sight (NLOS) only when the predominant (highest power) peak in the multipath pro.le is not the direct path to at least one neighboring AP.
Relationship: entailment
Domain: Networks
Sentence 1: Thus, system administrators must deal with namic bandwidth allocation technique.
Sentence 2: we argue that such a technique should (i) provide control over the time-scale of *This research was supported in part by a NSF Career award CCR­  allocation and over the allocation itself, (ii) provide stable behavior 9984030, NSF grants AN1 9977635, CDA-9502639, EIA-0080119, Intel, IBM, EMC, Sprint, and the University of Massachusetts.
Relationship: entailment
Domain: Networks
Sentence 1: Inductive step: Now suppose that Theorem 2 is valid for some Using the above definitions and the Markovian model in Fig.
Sentence 2: 2, value of t= (m-1)..t. for t= (m-1)..t, the average we write down an iterative equation for pq( mk)( k 2) , as: ,...1... ....1 .... ..... ... ....... ........ .
Relationship: entailment
Domain: Networks
Sentence 1: ; that relation is called simulatability) if for each possi­ble H and A there exists an adversary S, such that the view of H in the con.guration with Str and A is computationally indistinguish­able [23] from its view in the con.guration with Str .
Sentence 2: and S. anything that can happen to H using the functionality provided by Str can also happen to it if it uses the functionality of Str .
Relationship: entailment
Domain: Networks
Sentence 1: The iSCSI Extensions for RDMA (iSER) protocol is borne out of a desire to take advantage of this convergence.
Sentence 2: the iSER protocol design is motivated by the following D To have the generic data movement needs of iSCSI be met with the iWARP protocol suite so that the advances in the RDMA technology can continue to naturally improve iSCSI in most efficiently delivering data.
Relationship: entailment
Domain: Networks
Sentence 1: 6.1 Accurate Reporting of Loss Episodes byProbes An important component of our probe process is dealing with in­stances where individual probes (where a probe consists of a series of Npackets) do not report loss accurately.
Sentence 2: ideally, a given probe Pi should report the following: 0: if a loss episode is not encountered Pi = 1: if a loss episode is encountered It should be noted that this requirement is only for a probe, not necessarily the individualpackets withina probe.
Relationship: entailment
Domain: Networks
Sentence 1: 1 The actual gossip­ing strategy is then encapsulated in the gossip() function, more precisely in function f(x), which encapsulates the dis­tribution function.
Sentence 2: the structure of Algorithm 1 is used for both the traditional gossiping protocol, where f(x) returns a constant transmission range, and our power-law gossiping protocol, where f(x) returns a transmission range following the power-law distribution pictured in Fig.
Relationship: entailment
Domain: Networks
Sentence 1: Based on these insights, we design a new cir­cumvention framework for web browsing, which uses asym­metric communication with separate upstream/downstream channels.
Sentence 2: a user who requires circumvention service .rst starts or pretends to start a legitimate com­munication session (e.g., a VoIP call) with a dummy host residing outside the censor s network, and the proxy (called spoofer) injects censored data into the downstream .ow to­wards the user by spoo.ng the dummy host s IP, so that the censor believes the user is legitimately communicating with the dummy host only.
Relationship: entailment
Domain: Networks
Sentence 1: In our LiT MAC implementation [12], we have a TDMA frame of 60 ms and currently we use this frame length as the repeating pattern for the TDMA schedule.
Sentence 2: the time slot and channel allocation repeats across the 60 ms frames and a handset and a gateway is allocated slots every 60 ms. Now, before encoding,we sample60msofvoiceat8khzfrequency (480 samples per 60 ms, 1 byte each).
Relationship: entailment
Domain: Networks
Sentence 1: All the derived models and the implementation of SIMULWATCH have been val­idated using real traces collected from a large nationwide IPTVprovider in the United States.
Sentence 2: we demonstrate thatwhile not explicitly modeled, the estimation of unicast and multi­cast traf.c demand based on SIMULWATCH trace closely matchestheactualvaluesfromtherealtrace.
Relationship: entailment
Domain: Networks
Sentence 1: Thus, in an average case, where the topology is evenly distributed over the region A, the number of zones in area A in which update packets could migrate between nodes simultaneously, without mutual interference, equals (A / ( pR2 )).
Sentence 2: now since the nodes are evenly distributed, the number of nodes (and consequently the number of update packets P) confined in a zone will be 2 N N (pR ) P = = A 2 A (pR ) P number of update packets has to migrate from one node to another sequentially.
Relationship: entailment
Domain: Networks
Sentence 1: Second, * Wi , 0 the geometric sum 1- (1- qi ) (Wi,0 qi * ) describes the probability of not receiving any packets in the transmission queue while performing the complete empty-queue post-backoff.
Sentence 2: this expresses the probability of finally ending in the Li +1 1- pi state (i,0,0, e) , instead of transitioning to any of the regular post­ .
Relationship: entailment
Domain: Networks
Sentence 1: On the Scalability and Capacity of Wireless Networks with Omnidirectional Antennas  Onur Arpacioglu and Zygmunt J. Haas School of Electrical and Computer Engineering Cornell University Ithaca, NY 14853, USA o.arpacioglu@cornell.edu, haas@ece.cornell.edu http://wnl.ece.cornell.edu  ABSTRACT* We consider a wireless network of N nodes equipped with omnidirectional antennas, and we extend the capacity results of some previous works by finding bounds on the maximum achievable per-node end-to-end throughput, .e, while using a general network model and a bounded propagation model.
Sentence 2: we show that when the network domain has a fixed area, .e is T(1/N) even when the mobility pattern of the nodes, the temporal variation of transmission powers, the source-destination pairs, and the possibly multi-path routes between them are optimally chosen.
Relationship: entailment
Domain: Networks
Sentence 1: Again, we make the assumption that the conditioning on neighbours to be negligible: if v is a neighbour of u, we assume the edges of v are independent of those of u.
Sentence 2: given a node u pointing to a neighbour v, we can consider the edges out-going a random node x instead of the ones out-going v. Note: in the model, when pulling, an element is updated by selecting some element from the array and copying its value.
Relationship: entailment
Domain: Networks
Sentence 1: P (s|l) is the probability of the sni.ers to receive s from a tx located at l. P (l) is the probability a priori of .nding a tx in the position l.It provides an easy manner to incorporate to the location system, background information about mobility pattern and tracking.
Sentence 2: it is possible to suppose that a wireless device is more likely to be found next to tables and inside o.ces than inside bathrooms.
Relationship: entailment
Domain: Networks
Sentence 1: NACK originating from FIN node y1:If node x had previously observed at the MAC layer that node y1 cor­rectly forwarded packet p,thennode x assumes that node y2 failed to forward the packet correctly.
Sentence 2: the FIN property of y1 implies that xcan moni­tor the forwarding behavior of y1 at the MAC layer and this allows it to narrow the fault to y2.
Relationship: entailment
Domain: Networks
Sentence 1: Solution methodology: Corresponding to the goals, we (i)useasmall numberofhashfunctions,(ii)braid thecoun­ters,and(iii) usealinear-complexity message-passing algo­rithm to reconstruct .ow sizes.
Sentence 2: by using a small number of hash functions, we eliminate the need for storing a .ow-to-counter association rule.
Relationship: entailment
Domain: Networks
Sentence 1: First, we argue that from a practical viewpoint, Epidemic Routing2 [18] is essentially unbeatable in terms of delivery ratio when the load relative to resources (bandwidth and storage) is low, or when the network is very sparse (highly disconnected).
Sentence 2: it is only when the relative load is high in stable networks that Epidemic underperforms both MANET protocols and sophisticated disruption toler­ant protocols that intelligently route using a single copy.
Relationship: entailment
Domain: Networks
Sentence 1: Although di.erent bots may communicate with di.erent peers, we show that for P2P botnets with an unstructured topology, where bots randomly pick peers to communicate with, there is a sur­prisingly high probability that any given pair of P2P bots communicate with at least one common external bot during a given time window.
Sentence 2: there is a signi.cant probability a pair of bots within a network have a mutual contact.
Relationship: entailment
Domain: Networks
Sentence 1: Taking advantage of this, we can make the OBU inform the old RSU about its intention to handover before breaking its connection with the old RSU, such that the rest of data destined to the OBU can be forwarded by the old RSU and proactively cached by the new RSU even before the OBU receives a WSA message from the new RSU in order to mitigate frame losses.
Sentence 2: it is possible to use a proactive scheme in the handover procedure of the IEEE 802.11p-based networks rather than a reactive scheme as in the IEEE 802.11 networks.
Relationship: entailment
Domain: Networks
Sentence 1: Impacto Relativo da Posic¸ ao dos Clientes no Desempenho de Sistemas de VoD Baseados em APs Co-localizados Leonardo Bidese de Pinho Claudio Luis de Amorim leopinho@cos.ufrj.br amorim@cos.ufrj.br Laborat ´orio de Computac ¸ao Paralela Programa de Engenharia de Sistemas e Computac¸ ao COPPE -Universidade Federal do Rio de Janeiro Caixa Postal 68511 21941-972 Rio de Janeiro -RJ -Brasil ABSTRACT This paper investigates the impact of clients position in scalable wireless VoD systems, based on collocated access points.
Sentence 2: it evaluates the use of several trans­mission modes provided by the 802.11a standard, aiming to service di.erent area sizes, using the CINAPS (Cluster of Inexpensive Access Points) system, which was extended with a novel distance-aware association control heuristic.
Relationship: entailment
Domain: Networks
Sentence 1: (Slot Allocation Problem) Given a set of voice connections, M = {Mi = (1,Di) | 1 : i : n}, allocate the slots in such a way that each connection Mi is guaranteed to transmit each of its messages before the mes­sage deadline Di.
Sentence 2: if a message of Mi arrives at time t, enough slots must be allocated for Mi during time interval [t, t + Di) for the timely transmission of the message.
Relationship: entailment
Domain: Networks
Sentence 1: Then, to &#38;OXVWHU &#38;OXVWHU  7LPH 7LPH D ,Q FDVH RI WZR FOXVWHUV RYHUODSSLQJ &#38;OXVWHU 3DXVH &#38;OXVWHU 8S&#38;+8S&#38;+ 'Z&#38;+'Z&#38;+ 8S&#38;+ 'Z&#38;+ 8S&#38;+ 'Z&#38;+ &#38;OXVWHU SHULRG  7LPH 7LPH E ,Q FDVH RI WKUHH FOXVWHUV RYHUODSSLQJ Figure 3: A crossing-synchronous up/down trans­mission scheduling with di.erent frequencies in con­tiguous clusters avoid collisions in any overlapping area, contiguous clusters schedule the UpCH and DwCH in a synchronous manner, such that they cross each other, as shown in Figure 3.
Sentence 2: the same frequency channel is never used at the same time in contiguous clusters.
Relationship: entailment
Domain: Networks
Sentence 1: However, real experiments conducted over production networks (e.g., GPRS, CDMA2000) indicate that such links are currently plagued with several problems such as high and variable round trip times, patterns of burst packet loss, frequent link outages, and signi.cantly lower bandwidths than originally claimed [11],[15].
Sentence 2: it seems that there is cur­rently no wireless technology in the wide-area, that can o.er the level of reliability desired.
Relationship: entailment
Domain: Networks
Sentence 1: While these heavy-tailed distributions may contribute to self-similarity, we will illustrate that TCP itself is the primary source of self-similarity and that this behavior may have dire con­sequences in computational grids as WAN speeds increase into the gigabit-per-second (Gb/s) range.
Sentence 2: we show that even when application traf.c is rigged to produce a Hurst parameter H of 0.5, TCP adversely modulates this application traf.c and produces H =1.0(i.e., self-similar traf.c).
Relationship: entailment
Domain: Networks
Sentence 1: Contribution of the paper The .rst contribution of this paper, is the clear identi.cation of the main techniques characterising DTN routing protocols in order to better un­derstand and classify the solutions proposed in the litera­ture.
Sentence 2: we consider forwarding, replication and queue management as the main techniques for DTN proto­cols and we show how each protocol can be classi.ed ac­cording to the techniques it adopts.
Relationship: entailment