sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: PROPOSED SOLUTION The proposed solution, called PREemptive algorithm for DAta Transmission (PREDAT), aims to reduce the number of redundant transmissions over the network without compromising the cover­age of the event being disseminated, independently of the road traf.c condition and the type of vehicular environment.
Sentence 2: the protocol attempts to diminish the number of message collisions and manage the data transmission to reduce the data loss whenever network disconnections occur.
Relationship: entailment
Domain: Networks
Sentence 1: This result indicates that there is cache locality at the edge network since if there ware no lo­cality, the reduction of trafc .owing into the edge network would be zero.
Sentence 2: in-network cache Method E can reduce not only trafc .owing into the edge network but also trafc consumed inside the edge network by increasing upload trafc which less than size reduced inside trafc.
Relationship: entailment
Domain: Networks
Sentence 1: D D For intuition, we note that pe and re correspond respectively to the de.nitions of precision and recall for a particular classi.er.
Sentence 2: this classi.er is the one that declares that a path will disappear if the path passes through e on day k. maximizing p D e and re D with regard to e yields the network element that best classi­.es the paths as changing versus unchanging.
Relationship: entailment
Domain: Networks
Sentence 1: In addition, whereas JAVeLEN requires special­ized hardware with two separate radios, one for sending a Hail to an intended receiver and the other for data packet transmission, EM-MAC operates with only a single commodity radio per node; although the specialized radio hardware of JAVeLEN allows it to operate very ef.ciently in terms of energy consumption, this design limits its use on simpler, more generally available hardware such as the MICAz motes we used in our implementation of EM-MAC.
Sentence 2: to our knowledge, EM-MAC is the .rst multichannel MAC pro­tocol to use the pseudorandom number sequence to predict both the receiver wake-up time and the receiver wake-up channel.Cao et al.
Relationship: entailment
Domain: Networks
Sentence 1: By doing this, we are making a greedy choice that ignores fu­ture pawn groups, but we expect to improve both message overhead and average path latency over Random Selection (which also ignores future pawn groups during pawn selec­tion).
Sentence 2: we expect that if the distance from the current sender to the closest member of the next pawn group is half that to the average pawn group member, then the overall cost of sending the message will be cut in half.
Relationship: entailment
Domain: Networks
Sentence 1: MIDAS employs a methodology comprising three proce­dures: i) measurement collection, which gathers reports from each node consisting of a small set of passive time-aggregate measurements; ii) inference, which infers the coordination among the transmissions of di.erent sets of nodes using the reported measurements; iii) prediction, which utilizes the inferred information to predict the throughput gain of any target link, corresponding to rate-limiting di.erent con.ict­ing nodes.
Sentence 2: our contributions are as follows.
Relationship: entailment
Domain: Networks
Sentence 1: As a result, the increasing in­terest in evaluating the performance of energy harvesting wireless systems brought forth several contributions to .ll this gap.
Sentence 2: greenCastalia, an energy harvest­ing framework for the Castalia simulator [11] that allows the simulation of networks of embedded devices with heteroge­neous harvesting and energy source capabilities, has been presented in [12].
Relationship: entailment
Domain: Networks
Sentence 1: We use a non-parametric regression method to estimate the expected response-time distribu­tion, instead of assigning a random value from the constrained em­pirical distribution as in the previous section, because the designers are interested in the expected values of the response time for each request.
Sentence 2: we use a standard Kernel Regression (KR) method, with a radial basis Kernel function (see [24, 26] for de­tails) to estimate the response time for each request in the dataset.
Relationship: entailment
Domain: Networks
Sentence 1: Since the throughput is higher than that of links with similar dis-8000 tance (TLabs-HHI) and longer than HHI-TC, we attribute the high 7000 throughput to the frequency choice.
Sentence 2: the Dynamic 6000 Power Selection (DPS) of 802.11a dynamically adjusts the send­ ing power.
Relationship: entailment
Domain: Networks
Sentence 1: With 100 Mbps, even 30 hops takes only about 600 us, which is comparable to a single hop floor acquisition in current 802.11 W-LANs where the time to acquire the channel is of the order of 650 usec (RTS-CTS roundtrip, ignoring processing time).
Sentence 2: by virtue of physical layer relaying, elimination of headers, and dramatically reduced processing we can acquire a few tens of hops in about the same time than it takes to acquire a single hop today.
Relationship: entailment
Domain: Networks
Sentence 1: This topol­ogy is analogous to the Alice-Bob topology, but in contrast to Alice s node, which knows the interfering signal because she has generated it, the receivers in the X topology know the interfering signal be­cause they happen to overhear it while snooping on the medium.
Sentence 2: s1 and S2 are sending to D1 and D2, respectively.
Relationship: entailment
Domain: Networks
Sentence 1: To support dynamic spectrum access (DSA), capabilities must be built to support multiple transmission configurations (multiple channels at different frequencies, diverse transmission powers and rates), heterogeneous user classes (PUs, SUs, and jammers/adversaries), and signal-level interactions among users in terms of both spectrum sensing and data transmission.
Sentence 2: the manner in which CR network protocols respond to realistic physical channel effects can be tested over RFnestTM with controlled RF transmissions.
Relationship: entailment
Domain: Networks
Sentence 1: Since each secondary user is equipped with only one SDR transceiver, which can operate on one channel at a time, it cannot accurately know the states of all the channels by itself.
Sentence 2: the goal of the channel-state report process is to enable the secondary users to have a large picture of all the channels states through their cooperation s. the secondary users use SDR transceivers to sense one of n licensed channels, say i-th channel, (1 = i = n).
Relationship: entailment
Domain: Networks
Sentence 1: 2(.+1) G The proof of the theorem is now concluded by deriving the ratio OP Tij (tcur, 3G)/Tij (tcur, 3G) and replacing ß/Gby k/.. Notice that the bound in Theorem 3.3 gets tighter as k increases.
Sentence 2: the smaller the fairness interval, the looser the proportionally-fair throughput guarantee.
Relationship: entailment
Domain: Networks
Sentence 1: The results in this paper as well as in [7] show that the new AMVA-Deeomp technique, together with the proposed model and analysis of bursty arrivals at the downstream queueing centers, can be expected to be quite accurate in practice for these contexts.
Sentence 2: the estimates of mean system residence time have less than 15% error over the entire parameter space considered in this paper, and less than 10% error over most of that parameter space.
Relationship: entailment
Domain: Networks
Sentence 1: To avoid the obstacles related to the public­key management, in this paper, we show how to use the idea of stateful encryption in another important asymmet­ric setting: Identity-Based Encryption (IBE).
Sentence 2: we .rst de.ne the model of security for stateful IBE scheme and then present a concrete stateful IBE scheme whose se­curity meets the (strongest) de.nition in the model, while its encryption and decryption algorithms are also extremely e.cient.
Relationship: entailment
Domain: Networks
Sentence 1: We extended the method proposed in [17] so that we were able to precisely identify routing instances and their interconnections from a network s router con.guration .les.
Sentence 2: we made the following major contributions in this paper: (1) We developed a complete model and associated tools for characterizing intercon­nections between routing instances based on analysis of router con­.guration data.
Relationship: entailment
Domain: Networks
Sentence 1: Proof: The proof is by induction on the level of u.If levelp(u)0 then exitPoint(p)uand so p2MyExits(u).
Sentence 2: then by de.nition, p2PossibleExits(uVt)MyExits(u)for all t. Suppose levelp(u)h+1.0and the claim holds for all w where levelp(w):h. there is some time t[h]such that for all tt[h], p2PossibleExits(wVt)for all wwith levelp(w):h. Since p2S[, it is clear that p2GoodExits(wVt)for all tt[h].
Relationship: entailment
Domain: Networks
Sentence 1: Each sensor device consists of embedded operating system (OS), processor, sensors, battery, transceiver and receiver.
Sentence 2: battery capacity of sensor device is very limited due to its low cost and not easy to be recharged due 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 profit or commercial advantage and that copies bear this notice and the full citation on the first page.
Relationship: entailment
Domain: Networks
Sentence 1: Infrastructure-COMBINE is the next to end, hav­ing completed 203 requests while the Cool-Tether system is able to serve 322 requests (3.4/1.6 times more requests than the ad hoc/infrastructure-COMBINE designs) before losing charge in its gateway phones.
Sentence 2: cool-Tether delivers 38%-71% savings in energy for web access workloads as compared to the COMBINE tethering solution.
Relationship: entailment
Domain: Networks
Sentence 1: The proposed distributed routing solutions are tai­lored for the characteristics of the underwater environment, e.g., they take explicitly into account the very high propagation delay, which may vary in horizontal and vertical links, the different com­ponents of the transmission loss, the impairment of the physical channel, the extremely limited bandwidth, the high bit error rate, and the limited battery energy.
Sentence 2: the proposed routing solutions allow achieving two apparently con.icting objectives, i.e., increasing the ef.ciency of the channel by transmitting a train of short packets back-to-back; and limiting the packet error rate by keeping the transmitted packets short.
Relationship: entailment
Domain: Networks
Sentence 1: Although the exact SPSW value for a given processor is application-dependent, the relative trend among processors is uniform across applications with similar computational workload.
Sentence 2: if processor P1 has a higher SPSW than processor P2 in ap­plication A1, it will also have a higher SPSW value for application A2 as long as A1 and A2 are similar in terms of processor workload.
Relationship: entailment
Domain: Networks
Sentence 1: &#38;#169; ACM 2000 1-58113-195-X/00/09 ...$5.00 Rather, it focuses on quantitative attributes that are significant for the class of applications that operate in a geographically distributed environment, with heterogeneous (and possibly physically moving) locations.
Sentence 2: we focus on interaction related performance indices (e.g.
Relationship: entailment
Domain: Networks
Sentence 1: 2.2 Approach Overview The intuition of our approach is as follows: Since each NIDPS only receives a portion of the network tra.c, we want to make sure that this portion contains su.cient in­formation for the NIDPS to detect and prevent intrusions.
Sentence 2: we want to send attack-correlated .ows to the same NIDPS, so that no attack would be missed.
Relationship: entailment
Domain: Networks
Sentence 1: The developed model enables us to quantify the impacts of channel parameters (e.g., fad­ing rate) on TCP throughput and, more importantly, to de­termine the optimal SNR switching thresholds for different AMC transmission modes (at the physical layer) in order to maximize TCP throughput (at the transport layer) un­der different levels of persistence at the link layer (i.e., the maximum number of transmission attempts for a link-level packet).
Sentence 2: the developed model provides a framework to determine the cross-layer system parameters for a target TCP performance, which is the ultimate qual­ity of service (QoS) perceived by the application layer for many data services.
Relationship: entailment
Domain: Networks
Sentence 1: RELATED WORK In recent years, a substantial amount of research has been devoted to object and data location in large scale P2P (peer­to-peer) networks.
Sentence 2: known works on DHTs, e.g., CAN [22], Pastry [23] and Chord [26] promise several important desirable properties such as decentralized oper­ation, scalability, fault-tolerance, and load balancing.
Relationship: entailment
Domain: Networks
Sentence 1: The answer to these questions is the goal of this paper.
Sentence 2: we consider the entire net­work design of an IP-over-WDM network, meaning that we look not only at the IP layer deciding which routers and line cards to install and how to route the traf.c over the set of IP links, but also at the realization of the IP links in the WDM layer and consider in­stallation of .bers on the physical links.
Relationship: entailment
Domain: Networks
Sentence 1: Most .ows are small: 90% of .ows have less than 2.9 KB uplink payload and 90% of .ows carry no more than 35.9 KB downlink payload.
Sentence 2: 11.3% (10.9%) of .ows do not have any downlink  Figure 2: Distribution of TCP .ow sizes.
Relationship: entailment
Domain: Networks
Sentence 1: We .x a = 1 and the cache to catalog size ratio C/N to a con­servative 0.1%, and let the cache C and catalog sizes N vary.
Sentence 2: we instantiate a small-scale scenario with C/N = 102 /105 , a medium-scale with C/N = 103 /106 and a large-scale with C/N = 105 /108 .
Relationship: entailment
Domain: Networks
Sentence 1: A negative result indicates the opposite, i.e., path a has less delay than path b .
Sentence 2: to assess which forward path would have the lowest delay, the same evaluation has to be carried out with the third and fourth rows yielding: aA cA = a + A (c + A) = a c (2) aA dA = a + A (d + A) = a d (3) it is possible to know the pairwise differences between single paths delays.
Relationship: entailment
Domain: Networks
Sentence 1: However, there is a fundamental spectrum e.ciency limit to existing cel­lular network architectures: they are single-user systems.
Sentence 2: a base station serves only one terminal in a given 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: In this work, we propose an intelligent tra.c information system based on inter-vehicle multi-hop communication to minimize vehicle tra.c congestion by taking into account the aforementioned network challenges.
Sentence 2: to overcome them, we use our e.cient and robust data dis­semination protocol for highway environments with di.er­ent tra.c conditions (DRIFT) [13] to disseminate accident warnings on the road.
Relationship: entailment
Domain: Networks
Sentence 1: There however has been very little e.ort spent on design­ing algorithms to achieve su.ciently fast data aggregation under the physical interference model which is a more re­alistic model than traditional protocol interference model.
Sentence 2: a distributed solution to the problem under the physical interference model is challenging because of the need for global-scale information to compute the cumulative interferences at any individual node.
Relationship: entailment
Domain: Networks
Sentence 1: Do player I has a strategic advantage to cheat by sending misleading information to player II?
Sentence 2: how should be player II s reaction to the infor­ si and sj are computed as function of player I s belief, namely {{ 1, if b1 E [0, th1] and H1 = HG; 2, if b1 E [th1, 1] and H1 = HG.
Relationship: entailment
Domain: Networks
Sentence 1: A super state in the (Nc+1)-dimensional Markov chain is a sequence of size Nc + 1, in which the ith element represents the state (in the 1-dimensional Markov chain) that the ith distance headway belongs to.
Sentence 2: a super state, (s0,s1,...,sNc ), means that the distance head­way Xi is in state si .
Relationship: entailment
Domain: Networks
Sentence 1: OmniVoice meets the QoS requirements for VoIP in all operating scenarios and is unaf­fected by interference from non-VoIP traf.c.
Sentence 2: om­niVoice provides 100% greater throughput and 130% greater unin­terrupted connectivity time to mobile VoIP users as compared to an off-the-shelf 802.11 solution.
Relationship: entailment
Domain: Networks
Sentence 1: 4.4.3 Distributed Collaborative Monitoring In order to improve the monitoring accuracy and with­stand the blackmail attack, we use m out of N strategy to cross-validate the monitoring results of di.erent nodes in one neighborhood.
Sentence 2: a node is considered as an at­tacker if and only if m nodes out of all its N neighbors have independently sent out SID packets against it.
Relationship: entailment
Domain: Networks
Sentence 1: This standard, known as IEEE 802.11p [6], is an enhancement of the original IEEE 802.11 standard that ba­ sically combines the IEEE 802.11a (operation in the 5 GHz band) and the IEEE 802.11e (MAC-level QoS support) an­ nexes [7].
Sentence 2: the band of frequencies reserved for the operation of IEEE 802.11p is de.ned at 5.9 GHz, although there is still not a worldwide consensus on the use of this band.
Relationship: entailment
Domain: Networks
Sentence 1: Thus, for c = 3 theschemeensures (3 ·ln(n +1), 3/2)-approximation factor.
Sentence 2: the calculated solution will be within a factor of 3·ln(n+1) from the optimal solution and the sizes and weights of its LAs are at most 1.5Kmax and 1.5Wmax, respectively.
Relationship: entailment
Domain: Networks
Sentence 1: Clearly, for De.nition 1, E =0, and only the exact feature points are used.
Sentence 2: the skeleton nodes identi.ed based on Proposition 2 is a subset of those iden­ti.ed based on De.nition 1, while Proposition 2 can yield a more stable result in 3D sensor networks, which is validated by extensive simulations in Section 5.
Relationship: entailment
Domain: Networks
Sentence 1: In this case, it is clear that w * is RBMw* (-b, P (ßl.la)2), P l.Lwhere its average total workload is simply l.L(ßl.la)2)/2b.
Sentence 2: when the transmission duration is large and the va­cation duration has a light tail, the delay performance is a.ected only by the heavy tra.c condition and the variabil­ity of the arrival process.
Relationship: entailment
Domain: Networks
Sentence 1: We see that compared to the 33 second propa­gation time for a HELLO interval of 10 seconds (i.e., a 40 second timeout period), a 500 ms HELLO interval yields a 2 second prop­agation time and a 250 ms HELLO interval yields a 1 second prop­agation time.
Sentence 2: there are substantial improvements 4We did try running with TE extensions, but our simulator ran out of memory.
Relationship: entailment
Domain: Networks
Sentence 1: The key idea in the subspace-based detection step is that, once Sand S have been constructed, this separation can be effectively performed by forming the projection of link traf.c onto these two subspaces.
Sentence 2: we seek to decompose the set of link measure­ments at a given point in time y: y =y +y such that y corresponds to modeled and y to residual traf.c.
Relationship: entailment
Domain: Networks
Sentence 1: The reason to have a separate NFSS based on NFST is to pro­vide causal ordering among multicast packets.
Sentence 2: if (1) host A sends multicast M1, (2) host B receives M1, and (3) host B subse­quently sends multicast M2, then any host C that receives both M1 and M2 will receive M1 before M2.
Relationship: entailment
Domain: Networks
Sentence 1: In the delay analysis of SR-ARQ, many researchers use simpli.cations or approximations to make problem tractable.
Sentence 2: rosberg and Shacham [6]  d_r (ms) (a) Fmac = 1%  d_r (ms) (b) Fmac = 5% Figure 3: The average transmission delay Table 1: The parameters used for evaluation slot length ds dm Kmax M m 0.4 ms 1 ms 1 ms 2 20 10 slots made assumptions of i.i.d channel error process, heavy traf­.c, and .xed round trip time (RTT).
Relationship: entailment
Domain: Networks
Sentence 1: In CALEA systems, ironically, the problem appears to be much worse: in-band C-tone signaling may be used not just at the link between the TSP and law enforcement (where the vulnerability can be more easily mitigated on the law enforcement side), but also internally within the TSP s de­livery network.
Sentence 2: if a surveillance subject applies C-tone on a link tapped by CALEA equipment designed in this way, the CCC between the TSP and the LEA simply closes (as if the call terminated normally) and no content is delivered at all.
Relationship: entailment
Domain: Networks
Sentence 1: Recently, small-world graph was proposed to model vari­ous networks in the computer science society, including the Web graph, the Internet connectivity, peer-to-peer networks, and poten­tially wireless ad hoc networks.
Sentence 2: helmy [2] showed if long-range connections are established in a spatial ad hoc network, then it is likely to become a small-world.
Relationship: entailment
Domain: Networks
Sentence 1: In this experiment, new connections are admitted in the net- work when a random number in the interval (0,1) generated for each new connection is above a threshold value (provided there was enough bandwidth in the cell to support the new connection).
Sentence 2: for a threshold value equal to l, the base station tried to accept 100 x (1 - 1)% of all new connection requests to the network.
Relationship: entailment
Domain: Networks
Sentence 1: Assuming that the transfer has to reoccur every day, E2E-CBR would push up the 95-percentiles of the sending and receiving access ISPs by exactly B/T =2.5 Gbps costing them anything between $75K and $225K in additional monthly transit costs ($30K­90K per Gbps according to recent prices).
Sentence 2: since E2E-CBR is bound to increase the charged volume by exactly its mean rate, it provides no advantage compared to buying dedicated lines of the exact same rate.
Relationship: entailment
Domain: Networks
Sentence 1: Using this database, we attempt to reconstruct a leaf cer­ti.cate s chain based .rst on the certi.cate s Authority Key ID and, failing that, the certi.cate s Issuer Name.
Sentence 2: given a leaf certi.cate, we look for a CA certi.cate whose Subject Key Identi.er is the same as our leaf s Au­thority Key Identi.er.
Relationship: entailment
Domain: Networks
Sentence 1: The results during the post-bu.ering period are shown in Figures 14-19 where there is some response of WSMto limited network resources.
Sentence 2: in the case of a low-speed broadband connection (250 Kbps) shown in Figures 14-15, the bitrate of WSMduring the post-bu.ering period is linear with the encoded bitrate up to the bottle­neck capacity.
Relationship: entailment
Domain: Networks
Sentence 1: 3(a)), the reconstructed qualities for various motion activity levels are higher for the PFGS encoding with encoding rate ai =1 Mbps, as indicated by the positive quality difference.
Sentence 2: for such a case (i.e., the available transmission rate is 1200 Kbps) the video server is better off transmitting the video stream with a lower rate (i.e., 1 Mbps) than the channel can offer (1.2 Mbps) in order to achieve higher reconstructed quality.
Relationship: entailment
Domain: Networks
Sentence 1: In particular, considering a small increase on the right-hand­side (RHS) of (10), i.e., changing bito bi+Ei, where Ei>0, node :Æ1 ibelongs to the minimum node set S1if and only if (0)<0.
Sentence 2: nnode ibelongs to the minimum node set S1if and only if a small increase in node i s rate (in terms of total volume generated at node i) leads to a decrease in the objective function.
Relationship: entailment