sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: Suppose further that the network uses either loop veri.cation or path veri.cation.
Sentence 2: then there exists a BGP compliant strategy for m that uses rm(·) = vm(·) and obeys all-or-nothing export, which obtains the best possible stable outcome in terms of the utility func­tion of m. On an intuitive level, Theorem 5.1 proves that any gains a ma­nipulator gets from lying can be obtained by using a clever export rule.6 Theorem 5.1 shows the existence of an optimal all­or-nothing export rule for the manipulator; however, this optimal export rule for m depends on the export rules chosen by the other nodes in the network.
Relationship: entailment
Domain: Networks
Sentence 1: The genre-based weight pp G is then calculated as the cosine similarity between the user s genres and program s genres: G gu · gp pp (u)= (5) gu gp We can combine this with the previous predictor as follows: G+H HG pp (u)=max(pp (u),pp (u)) (6) Clearly, more sophisticated predictors can be developed.
Sentence 2: we experimented with an item-item collab­orative .ltering-based predictor, that predicts new accesses based on similar items accessed in the past.
Relationship: entailment
Domain: Networks
Sentence 1: Several research efforts have focused on the detection of, and/or protection from, FCEs and DDoS attacks.
Sentence 2: aggregate­based Congestion Control (ACC) is introduced to deal with such at­tacks by limiting the rate of (large) aggregate traf.c at the routers to reduce the impact of the added load on the underlying network and end-servers [21, 23].
Relationship: entailment
Domain: Networks
Sentence 1: PROMISE: Peer-to-Peer Media Streaming Using CollectCast Mohamed Hefeeda, Ahsan Habib, Boyan Botev, Dongyan Xu, Bharat Bhargava Department of Computer Sciences Purdue University, West Lafayette, IN 47907 {mhefeeda, habib, botevbi, dxu, bb}@cs.purdue.edu ABSTRACT We present the design, implementation, and evaluation of PROMISE, a novel peer-to-peer media streaming system encompassing the key functions of peer lookup, peer-based aggregated streaming, and dy­namic adaptations to network and peer conditions.
Sentence 2: pROMISE is based on a new application level P2P service called CollectCast.
Relationship: entailment
Domain: Networks
Sentence 1: If MPs in a mesh network should carry in­tensive tra.c transmitted from a lot of end stations, the per­formance of DCF-based IEEE 802.11s may be signi.cantly degraded [8].
Sentence 2: the wireless medium between the MPP and its neighbor MPs may become a natural bottle­neck because a lot of data packets are forwarded to/from the Internet through the MPP [9, 10].
Relationship: entailment
Domain: Networks
Sentence 1: 2.3 Robot to Localization The localization of a robot moving around a certain operation area is accomplished by means of interacting with a Beacons Network (BN) which is comprised of fixed nodes and are aware of their position (absolute coordinates).
Sentence 2: a robot is able to associate the BN Nodes (BNNs) falling within its coverage radius and to send them a beacon message; upon the reception of which BNNs reply with a ranging message (either in the Receive Signal Strength Indicator (RSSI) or ultrasonic domain).
Relationship: entailment
Domain: Networks
Sentence 1: For those IPs that pass the checks of the certi.cate, we extract the names for which the X.509 certi.cate is valid and the purpose for which it was issued.
Sentence 2: we check the following properties in each retrieved X.509 certi.cate: (a) certi.cate subject, (b) alternative names, (c) key usage (purpose), (d) certi.cate chain, (e) validity time, and (f) stability over time.
Relationship: entailment
Domain: Networks
Sentence 1: 6.4 Drawbacks of Our Proposed Mechanism The proposed mechanism works well when the datapath in the switches can also extract the values of the packet header .elds used in the match .elds of the pending .ow rules and tables and when the datapath can apply the user selected actions to the packets that match the entries in the pending .ow tables.
Sentence 2: there might be some cases where the controllers use header .elds in a protocol, but the dat­apath cannot parse the packets of the protocol and extract the values.
Relationship: entailment
Domain: Networks
Sentence 1: ACE in the Hole: Adaptive Contour Estimation Using Collaborating Mobile Sensors Sumana Srinivasan, Krithi Ramamritham and Purushottam Kulkarni Department of Computer Science and Engineering Indian Institute of Technology Bombay, Mumbai -400076, INDIA sumana, krithi, puru@cse.iitb.ac.in Abstract This paper focuses on the use of mobile sensors to esti­mate contours in a .eld.
Sentence 2: we focus on strate­gies to estimate the contour with minimum latency and max­imum precision.
Relationship: entailment
Domain: Networks
Sentence 1: RELATED WORK Tra.c analysis is a large .eld; in this section, we survey work in that .eld that is related to the analysis of anonymity systems.
Sentence 2: we discuss prior work on passive log­ging, pro.ling (or .ngerprinting) attacks, and analysis of countermeasures to these attacks, as these are the most rel­evant to our work.
Relationship: entailment
Domain: Networks
Sentence 1: By the induction hypothesis, there exists a processor that performs a rightward transmission of M on behalf of a seg­ment in {S(j+f-1)m,...,S(j+f-1)m+W -1} during phase p2(a+f-1).
Sentence 2: during superphase .a+f-1, message M is trans­mitted via a rightward transmission on behalf of a segment in supertile Tj+f-1.
Relationship: entailment
Domain: Networks
Sentence 1: We have shown that the expected weight of feasible solution fIP 1 of IP (1) obtained by our randomized rounding is larger than E(wfIP 1 ) = E(wfIP 1 |ri .
Sentence 2: sj )qi,j + E(wfIP 1 | i)q i (2) rj.S there exists at least one conditional expectation in E(wfIP 1 |ri .
Relationship: entailment
Domain: Networks
Sentence 1: When multiple DHCP servers are providing di.erent IP subnets on the same layer 2network,users may usejointhewrong networkbecause, by default, DHCP clients typically listen to the .rst DHCP server that responds to a broadcast.
Sentence 2: dHCP lacks the ability to support heterogeneous DHCP con.gura­tions [4].
Relationship: entailment
Domain: Networks
Sentence 1: If an individual .ow transmits above its assigned rate, it may experience tra.c policing by at least one of the intermedi­ate nodes on the path.
Sentence 2: if at an intermediate node the rate of in-out stream to which the .ow belongs ex­ceeds the assigned rate, the .ow will be sub jected to tra.c policing.
Relationship: entailment
Domain: Networks
Sentence 1: Goodput Control monitors the goodput of all TCP flows passing through the gateway and aims at achieving optimal fairness by throttling aggressive wired-to-wireless flows.
Sentence 2: in case the Internet gateway IG recognizes that the goodput ratio between the goodput of a wired-to-wireless flow and the mean of the goodput of all flows exceeds a certain threshold S, then IG periodically probes the ability of the slower TCP flows to increase their goodput by throttling the rate of the faster TCP flows down to the value of the mean goodput.
Relationship: entailment
Domain: Networks
Sentence 1: Towards Universal Mobile-IP Robert Elz Centre for Network Research (CNR) Department of Computer Engineering Faculty of Engineering, Prince of Songkla University Tel: +66 74 28 7075, Fax: +66 74 28 7076 kre@munnari.OZ.AU Sinchai Kamolphiwong Centre for Network Research (CNR) Department of Computer Engineering Faculty of Engineering, Prince of Songkla University Tel: +66 74 28 7075, Fax: +66 74 28 7076 ksinchai@coe.psu.ac.th  ABSTRACT In this paper we discuss several issues with the present usage model for Mobile-IP that tend to limit its deployability and sug-gest solutions to most of these practical deficiencies.
Sentence 2: we conclude that the Mobile IP protocols and implementations should operate with any number of Home Agents.
Relationship: entailment
Domain: Networks
Sentence 1: In column4- , the scheduler ii will scan the terms from top to bottom, when the term is not 0, the scheduler will serve the corresponding flow.
Sentence 2: the flows will be served in the following service sequence, 0 2 4 6 810 12 14 maintain any tags or states, SRR can achieve O(1) time time(unit:4ms) complexity, short-term fairness, and certain delay bound at the same time.
Relationship: entailment
Domain: Networks
Sentence 1: While this notion carefully captures that a distributed pro­tocol does not behave any worse than an ideal speci.cation, it however does not capture any form of liveness guarantees, i.e., that the protocol ensures that something good eventu­ally happens.
Sentence 2: a protocol that does not create any output or that can be caused to hang inde.nitely by corrupted parties serves as a good implementation of every ideal speci.cation in the sense of reactive simulatability.
Relationship: entailment
Domain: Networks
Sentence 1: Loosely speaking, we investigate two contrasting approaches; one where only a subset of data packets must be acknowledged, and another where only a subset of intermediate nodes must ack5.
Sentence 2: we construct, (a) the PAAI-1 protocol: every intermediate node sends an ack for only a selected fraction of data packets; and (b) the PAAI-2 protocol: only one selected intermediate node sends an ack for each data packet.
Relationship: entailment
Domain: Networks
Sentence 1: Considering the de.nition of the Xtc p (t)and Xack (t)processes, we can write: Xtc p (t)=Ytc p (t)+Ztc p (t) (3a) Xack (t)=Yack (t)+Zack (t).
Sentence 2: (3b) From the set of equations (2) and (3), it follows that modelling the bidimensional process {Xtc p (t),Xack (t)} is equivalent to mod­elling the bidimensional process {Ytc p (t),Yack (t)}.to compute the probability distribution functions of the number of TCP data segments and TCP ACK packets in all the output queues of the wireless network, it is suf.cient to compute these probability distributions only for the output queues of the Su and Sd stations.
Relationship: entailment
Domain: Networks
Sentence 1: In spite of these valid concerns, we believe that there is value in exploring an FSO-based all-wireless design since it could lead to unprecedented bene.ts.
Sentence 2: pursuing such a vision could open up other avenues amenable to more incremental adop­tion (e.g., hybrid/augmented networks) and inspire other novel use cases for FSO in DCs.
Relationship: entailment
Domain: Networks
Sentence 1: The key characteristic that sets our work apart from related work is that it takes into account link correlations.
Sentence 2: we considered the model where we know which links are most likely to be correlated (e.g., links from the same local-area network or the same administrative domain), however, we do not know the exact nature of the correlation (i.e., we do not assume knowledge ofany correlationcoe.cients).Weformallyprovedthat, un­der certain well de.ned conditions, it is feasible to identify the probability that each link is congested from end-to-end path measurements, even in the presence of link correlations.
Relationship: entailment
Domain: Networks
Sentence 1: More precisely, for i =1, we write: P <i Q,if P is at least as good as Q,subject to P, Q .Pi(P(v, v0)) for some v .V,  P .
Sentence 2: i Q, if some element in Q depends on all the ele­ments in P.for all p .P,there exists q .Q such that p .
Relationship: entailment
Domain: Networks
Sentence 1: Diagnosis and Design for Diagnosability for Internet Routers Lee Barford Agilent Laboratories 3500 Deer Creek Road, MS24M-A Palo Alto, CA 94303 USA lee_barford@agilent.com Abstract This paper deals with diagnosis and design for diagnos­ability at the system level.
Sentence 2: diagnosis and de­sign for diagnosability of high-end Internet routers in man­ufacturing test and design validation are considered.
Relationship: entailment
Domain: Networks
Sentence 1: Here the speed difference is intended as the modulus of the speed vectors difference, and thus accounts for vehicles movement direction.
Sentence 2: we are interested in explaining the shape of the degree PDF in the case of models belonging to group III, as it gath­ers the models which more realistically reproduce the case of traf­.c lights-ruled intersections, frequently encountered in real-world traf.c.
Relationship: entailment
Domain: Networks
Sentence 1: Then, the temporal network HR,D,[t,t+.fA.
Sentence 2: (b)) contains a strictly time-respecting x­x ' path with probability at least 1 -(ld(b+1))-., for every time t. x ' will learn of information originating at xwith a propagation delay that is poly-logarithmic in the size of the small­est disc containing both of them.
Relationship: entailment
Domain: Networks
Sentence 1: Indi­rect reciprocity is essentially the concept of I help you, and someone else will help me .
Sentence 2: a group of individuals exchange altruistic actions so that all of them can be better o.. To better describe the possible cooperation relationships among the the set of nodes without social trust, we introduce the physical-coalitional graph GPC = {N , EPC }.Here the vertex set is the node set N and the edge set EPC = {(n, m): PCP S PC enm enm · (1 - enm)=1, .n, m .N }, where enm =1 if and only if node m is a feasible relay (i.e., e P =1) nm and has no social trust towards node n (i.e., e S =0).
Relationship: entailment
Domain: Networks
Sentence 1: functions) in such a way that the outcome of the game played by independent agents according to the rules set by the mechanism designer will be the desired outcome, which is called the social optimum.
Sentence 2: the game should be designed in such a way that choosing a strategy that results in the social optimum is a dominant strategy for each player, where dominant means that no player has an incentive to unilaterally deviate from the strategy.
Relationship: entailment
Domain: Networks
Sentence 1: By constructing ef.cient random sam­pling mechanisms and interactive proofs, we enable the user to verify that the answer given by the aggregator is a good approxi­mation of the true value even when the aggregator and a fraction of the sensor nodes are corrupted.
Sentence 2: we present ef.cient protocols for secure computation of the median and the average of the measurements, for the estimation of the network size, and for .nding the minimum and maximum sensor reading.
Relationship: entailment
Domain: Networks
Sentence 1: The de­sign of fast retransmit assumes packets are sent in bursts so that when a packet is dropped, each of its successive pack­ets will elicit a duplicate ack.
Sentence 2: to trigger the fast retransmit before a retransmission timeout, there should be at least three additional packets released within an interval of (RTO - RTT) following the departure of the dropped packet.
Relationship: entailment
Domain: Networks
Sentence 1: Find X0 to minimize L(X, {Xk}, Y , Y0, Z, W, M, {Mk}, N, µ) with other variables .xed (k = 1, 2, ..., K ).
Sentence 2: this gives: minimize: (M, D - AX0 - BY0 - C Z - W ) +(M0, X0 - X) +µ/2 D - AX0 - BY0 - C Z - W 2 F +µ/2 X0 - X 2 F minimize: X0 - X + M0/µ 2 F + D - BY0 - C Z - W + M/µ - AX0 2 F Let J0 = X - M0/µ and J = D - BY0 - C Z - W + M/µ.
Relationship: entailment
Domain: Networks
Sentence 1: To access control information, including both NetFPGA status registers and the shared SRAM memory, a simple interface is pro­vided that allows Click elements to write and read state of the off­chip SRAMs.
Sentence 2: the 2 MB shared SRAM can be both read and written by programs written in Click to facilitate commu­nication with the shims, without needing to modify or add status registers contained in the CNET infrastructure.
Relationship: entailment
Domain: Networks
Sentence 1: One of the fundamental differences of our work from other existing research efforts lies in the appropriate and more realistic definition of users utility functions, which in turn requires and necessitates different treatment.
Sentence 2: instead of simply expressing the tradeoff between the amount of a user s reliably transmitted bits and corresponding consumed power as assumed in [6], in our study in order to fulfill simultaneously multiple services QoS performance requirements in an environment where the service performances are interrelated, a user s utility that reflects his service QoS-aware performance efficacy as a function of his achieved goodput per joule of consumed energy is considered.
Relationship: entailment
Domain: Networks
Sentence 1: Speci.cally, after the contention period ends, the succesful nodes transmit training blocks in separate time slots in or­der of their contention winning sequence.
Sentence 2: the node with the smallest contention subcarrier and time slot in­dex transmits 4 OFDM symbols, the .rst one is a symmetric pseudorandom sequence for time and frequency synchroniza­tion via Schmidl-Cox [16], and the next two symbols are the preamble used for channel estimation.
Relationship: entailment
Domain: Networks
Sentence 1: The major di.culty in this problem lies in the fact that changing the location of one version of a multimedia object may result in a redistribution of multimedia objects in this storage and in the system.
Sentence 2: within the limi­tation of the storage space, the distribution decision should guarantee that the bene.t of placing a new version in a storage should be greater than the lost of removing other versions from the storage to make room for the new one.
Relationship: entailment
Domain: Networks
Sentence 1: 2.2 Complexity As it turns out, even simple and highly restricted variants of the dynamic spectrum allocation problem are computa­tionally hard.
Sentence 2: the throughput problems are hard even if demands have in.nite duration (i.e., .t= 8), and sometimes even in single-hop scenarios or when there are no prohibited bands, i.e., |P| =0.
Relationship: entailment
Domain: Networks
Sentence 1: Indeed, in order to guide a peer joining the network towards its best position in the selected SONs, each peer maintains a SCI which contains summarized information about the concepts which can be reached in each available direction.
Sentence 2: for each SON SONi the peer belongs to and for each neighbor nj , the SCI represents the set of SONi s concepts which are reachable in nj s subnetwork through a clustroid concept and a radius such that all such concepts are within the radius from the clustroid.
Relationship: entailment
Domain: Networks
Sentence 1: According to [34], this implies that in the actual binomial case we have 1 Pr IR > + o(1) |S | =e KC(t) · O(n -4) 2 R.S =O(n -3).
Sentence 2: there are at least (1/2-o(1))|S | = (1-o(1)).2 2f(ar)2 r-cells, within which all nodes will get jµ-informed in time slot t + 1 with probability 1 - O(n -3).
Relationship: entailment
Domain: Networks
Sentence 1: In the ARQ approach, we note that one single bit error causes the retransmission of the whole packet, and thus Ci(t) is a step- wise function varying in a packet length time scale.
Sentence 2: ci (t) = C/ki, where k is the number of transmission for the head of line (HOL) packet of flow i until successfully received by its receiver.
Relationship: entailment
Domain: Networks
Sentence 1: (0,1), we also prove that if k is the activity threshold, then, a.s., an O(k)-active .ooding protocol completes in the same time as .ooding without constraints on the activity, up to a multiplicative constant.
Sentence 2: the reachability threshold for the .ooding protocol is essentially of the same order of magni­tude as the activity threshold for this protocol to complete in optimal time, up to multiplicative constants.
Relationship: entailment
Domain: Networks
Sentence 1: We find that the TCP-AP variants significantly outperform the NewReno variants, both in terms of aggregate averaged goodput and fairness.
Sentence 2: tCP-AP achieves about 91% more aggregate averaged goodput than TCP NewReno, while TCP-AP with delayed ACK achieves about 58% more aggregate averaged goodput than TCP NewReno with delayed ACK.
Relationship: entailment
Domain: Networks
Sentence 1: Moreover, assume that Na(N) lim =0, (15) N.8 ß(N) Then, the steady state distribution of {X(t)}t=0 is such that `´ lim P |F (X(t))- sup F (X)|>o(N) = o(N), t.8 X.D where limN.8 o(N)=0.
Sentence 2: lim lim F (X(t))=sup F (X), in probability.
Relationship: entailment
Domain: Networks
Sentence 1: For the secondary queue, the ULP way we have adopted when the network is in congestion is not like the way in [3-5, 7], which simply abandons P and B-Frame packet, or like the way in [6], which removes totally B-Frame packet but decides whether P-Frame packet is to be removed according to 50% probability; instead, here we throw away the B-Frame packet first, then we go to the queue to find P-Frame packet to substitute for transmission.
Sentence 2: the transmission of queue is not forced to stop, instead, the right to use channel this time is transmitted to another packet of higher priority, this is because in our architecture, P and B-Frame belongs to the same queue.
Relationship: entailment
Domain: Networks
Sentence 1: A worst-case counter update sequence takes the following form: .rst come q + r(= C) update re­quests for distinct counter indices a1,a2, ..., aq+r, and they then repeat for T -1 times in total, followed .nally by q update requests for counter indices a1,a2, ..., aq.
Sentence 2: inside this window of t cycles, counters a1,a2, ..., aq (q of them) are accessed T times and counters aq+1, ..., aq+r (r of them) are accessed T -1 times.
Relationship: entailment
Domain: Networks
Sentence 1: As expected, our analysis has shown that the lifetime of a network employing a cell-based energy conservation tech­nique depends on the density with which nodes are dis­tributed throughout the region where the network is de­ployed.
Sentence 2: the analysis has shown that when the node density is large enough to ensure that the result­ing network is connected with high probability, the network lifetime is very likely to be extended by a multiplicative factor of at least h, with respect to the case where no en­ergy conservation is used.
Relationship: entailment
Domain: Networks
Sentence 1: 3.1 Channel Assignment and Resource Contention During initial experiments, unfavorable results for non­overlapping channel assignments brought us to question whether radio-to-radio packet processing or wireless channel interfer­ence dominated the performance characteristics of a given WLAN.
Sentence 2: did it cost more to pass a packet to another radio on the same access point than it did to reuse the same radio on the same channel?
Relationship: entailment
Domain: Networks
Sentence 1: While deploy­ment of such a widespread wireless monitoring infrastruc­ture is still feasible in building-wide settings, the logistics of densely deploying and managing such infrastructure is im­practical when the wireless networks are signi.cantly larger in scale.
Sentence 2: it is virtually impossible to densely deploy wireless sni.ers to monitor the performance of a city­scale or a nation-scale cellular data network.
Relationship: entailment
Domain: Networks
Sentence 1: However, either one is .ne, i.e., either u waits for w and v, w may switch immediately, or v waits for w and u, w may switch immediately.
Sentence 2: there are two valid dependency trees, one  Figure 1: Illustrating loop freedom Figure 2: Illustrating multiple min-Figure 3: Illustrating circular de­(§2).
Relationship: entailment
Domain: Networks
Sentence 1: 1.2 Related Work Signi.cant research e.orts have been dedicated over the last decade to the study of wireless networks through game­theoretic tools.
Sentence 2: several papers (see, e.g., [8, 9, 10], and a recent survey [2]) have studied the equilib­rium properties of power allocation games, where mobile users adjust their transmission power to meet some objec­tive (such as maximizing the throughput, or the energy in­vestment per bit).
Relationship: entailment