sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: Future-L.  5.4 Comparison of Latency Cost 5.5 Effect of NCDN Traf.c on Network Cost We compare InvCap-LRU scheme, which is a completely unplanned scheme, against OptRP-L and OptRP-Future-L, This experiment, unlike previous experiments, considers a which optimize latency cost based on previous day s content network consisting of both ISP and NCDN tra c. Our goal matrix and based on next day s content matrix respectively.
Sentence 2: sIGMETRICS 13, June 17 21, 2013, Pittsburgh, PA, USA.
Relationship: neutral
Domain: Networks
Sentence 1: Categories and Subject Descriptors C.2.2[Computer-Communication Networks]: Network protocols routing protocols General Terms Algorithms, Measurement, Performance Keywords Wirelessadhocnetworks,QoS .ows,Capacity,Interference * This work was supported by the the National Telecommu­nication Research Network(RNRT).
Sentence 2: a Links con.ict graph LCG is a perfect graph if for every induced subgraph of LCG, the size of the largest clique equals the chromatic number.
Relationship: neutral
Domain: Networks
Sentence 1: REFERENCES [1] L. Chiaraviglio, D. Ciullo, M. Meo, M. Ajmone Marsan, Energy-Aware UMTS Access Networks, First International Workshop on Green Wireless (W-GREEN 2008), Lapland, September 2008.
Sentence 2: at 5 minutes inter­vals, the AP records the number of associated users.
Relationship: neutral
Domain: Networks
Sentence 1: A further important di.erentiator of our networking ap­proachisthataswell assupporting infrastructural policies that de.ne which VMs can communicate with which other VMs, our system allows customers to de.ne their own per-VM policies -this allows customers to specify their own IP .lters, stateful .rewalls, etc.
Sentence 2: prototypeImplementation In our current prototype implementation the VNET soft­ware is implemented as a Linux dynamically-loaded kernel module.
Relationship: neutral
Domain: Networks
Sentence 1: All the results shown in Figure 9, 10, 11 and 12 are averaged over .ve individual experiments at different times of the day, each experiment was performed 10,000 times to detect the tones.
Sentence 2: this time difference ensures that all the ACK tones from client nodes are available with suf.cient energy at the AP to be able to use a simple threshold test to detect them.
Relationship: neutral
Domain: Networks
Sentence 1: With cellular networks, there are not typically service plan limits on throughputs, but rather on total numbers of bytes transferred.
Sentence 2: our study considers spatio-temporal per­formance (upload/download throughput and latency) using over 3 million user-initiated tests from iOS and Android apps in 15 dif­ferent metro areas collected over a 15 week period.
Relationship: neutral
Domain: Networks
Sentence 1: Conse­quently, the traf.c originating from TAP is limited.
Sentence 2: &#38; Spatial Bias &#38; Temporal 2.00 2.00 1.00 2.00 7.00 Proportional 1.05 2.10 2.10 2.10 7.35 Under the TAP fairness reference model of Section 2, the fairness objectives include temporal fairness, removal of spatial bias, and ingress aggregation; it additionally requires maximization of spatial reuse in the system.
Relationship: neutral
Domain: Networks
Sentence 1: balance factors in unicast system .LBC and .AU .
Sentence 2: budget-imbalance issue should be taken into account through the notion of (a, ß)-budget-balanced: A mechanism is (a, ß)-budget­balanced if the central authority (1) can retrieve at least a fraction a of the total payment from the service requestor, and (2) can never retrieve more than ß times of the total payments.
Relationship: neutral
Domain: Networks
Sentence 1: The demo setup is as shown in Fig.
Sentence 2: tRANSPORT PROTOCOL DEMO When the requirement on the end-to-end delay is much larger than the network round-trip time (RTT), protocols such as TCP which fully utilize the network bandwidth while su.ering minimal waste (since they only retransmit lost pack­ets) work well even though they su.er from signi.cant queu­ing delays and some congestion induced packet loss.
Relationship: neutral
Domain: Networks
Sentence 1: However, if we assume the adversary will periodically stop its interference and check to see whether A and B are still attempting to transmit, then the adversary will be able to detect that he is no longer interfering with their communi­cation.
Sentence 2: from this .gure, we .nd that the noise level time series with the jammer and without are distinctly di.erent.
Relationship: neutral
Domain: Networks
Sentence 1: With the monitoring pre.x set generated by the Max-Cover al­gorithm, we can easily calculate the traf.c of all the ancestors of pre.xes in the monitoring pre.x set.
Sentence 2: be­sides, this solution works for large time-scale because its accuracy depends directly on the number of available counters and the con­trol loop latency: the number of counters is limited by the amount of expensive power-hungry TCAMs at the switches and control net­work bandwidth.
Relationship: neutral
Domain: Networks
Sentence 1: REFERENCES [1]GNU RADIO, http://gnuradio.org [2] Intel Core2 Quad Core, http://www.intel.com [3] Barbara chapman, Gabriele Jost, Ruud van der Pas 2007 Using OpenMP Portable Shared Memory Parallel Programming The MIT Press.
Sentence 2: we implemented an SDR architecture for IEEE 802.11a receiver baseband processing on a chip multiprocessor.
Relationship: neutral
Domain: Networks
Sentence 1: It will be interesting to observe how in the years to come, these proposed wavelet-based techniques will im­pact the use of active and passive measurement strategies, the analysis and interpretation of the ensuing data, and the development of next-generation active and/or passive mea­surement tools.
Sentence 2: upon closer inspection, the fact that the energy function corresponding to period 31 is almost flat turns out to be an artifact of the very low traffic load dur­ing this period (see top plot).
Relationship: neutral
Domain: Networks
Sentence 1: C(er,n)=cost(ci) (1) This function is in fact a lower bound calculation, as the components v) to vii) are only used if the CEP engine pro­duces a result, and therefore require no resource consump­tion at all in many cases.
Sentence 2: ii) By setting the .lter values we can adapt the event rates that are used within aggregation rule.
Relationship: neutral
Domain: Networks
Sentence 1: The same deployment had been used to provide IPv6 In­ternet access for the ETSI Network Function Virtualization Work­shop on April 22 23, 2013.
Sentence 2: the transition and evolution to IPv6 are expected to complete in three stages: (1) the deployment of IPv6 is prepared and begun on the IPv4-based network, (2) IPv4 and IPv6 coexist, and (3) IPv6 plays a leading role on the network and the IPv4 network is grad­ually retired.
Relationship: neutral
Domain: Networks
Sentence 1: Decoupling FDs from associations removes even this limited assurance and forces the architec­ture to deal directly with the end-to-end security issue.
Sentence 2: once an entity gets a canonical FD from the fDS, it is free to use its local knowledge of topology to transform the canonical route into a more e.cient FD that does not take the tra.c up to the globally-known core domain and down again.
Relationship: neutral
Domain: Networks
Sentence 1: From them, we get ()2 ()2 ks {t}-ks {t} = n = µ {(1 + ß)t}- µ {t} µ {(1 - ß)t}- µ {t} (26) Let F be the cumulative distribution function of a standard normal distribution and erf {.}
Sentence 2: ()[()()()J y-1 f-y-1 f-y-1 f-y-1 .
Relationship: neutral
Domain: Networks
Sentence 1: BACKGROUND The basic Packet Pair algorithm [9, 2] relies on the fact that if two packets sent back-to-back are queued one after the other at the narrow link, they will exit the link with dispersion T given by: T = L/B where L is the size of the second packet, and B is the band­width of the narrow link, i.e., the capacity limiting link.
Sentence 2: submitted to IEEE/ACM Transactions of Networking.
Relationship: neutral
Domain: Networks
Sentence 1: Note that the source data with length ri belonging to layer i ( i = 0~ l , layer 0 is the base layer) are filled into the arranged portions (column width = si ) of ki packets, and the remaining portions of n -ki packets ( n = number of packets) in the BOP are filled with channel coding redundancy.
Sentence 2: this might lead to the result that even you have the largest received data rate, but it does not guarantee that you can get the optimal quality.
Relationship: neutral
Domain: Networks
Sentence 1: If the estimated SIR based on the SSDT is larger than SIRreq, the system changes back to the SSDT mode; otherwise, the system re­mains in the multi-site transmission mode.
Sentence 2: we are motivated to develop a joint LPPA and SSDT technique to improve the downlink performance of the CDMA system from both power e.ciency and outage performance perspec­tives.
Relationship: neutral
Domain: Networks
Sentence 1: 1 - = 22 2 where the additional factor of 12 accounts for the possibility of backing off from a tile after collision.
Sentence 2: since we are dealing with multi­ple OFDMA sub-channels, whose number varies with varying user population, our solutions have to be designed to constantly adapt and possess both (good) throughput and convergence properties, unlike WLAN solutions that require only good convergence prop­erties.
Relationship: neutral
Domain: Networks
Sentence 1: Today, this choice is dictated by whether C1-S1 and C1-S2 are public or private IP pre.xes and this applies to our implementation too.
Sentence 2: hence, in the example above, the inspecting mod­ule can send queries to the target modules  and  (via the NM), as well as to the modules below them, and ask those modules what .eld values it should be checking for.
Relationship: neutral
Domain: Networks
Sentence 1: A linear programming solution to determine the movement of the sink and its sojourn time in different points of the network is given in [29] as well.
Sentence 2: this is mainly due to the fact that in the majority percentage(%) percentage(%) 0.4 0.2 percentage(%) 0.4 0.2 0 0 02000 2000 20002000 2000 1000 1000 1000 1000 1000 1000 y00 y00 x x y 00 x Fig.
Relationship: neutral
Domain: Networks
Sentence 1: PATH ESTIMATES AND FORWARDING lect the .ow with the maximum differential backlog f * (i, j)= In this section, we extend the ideas presented in Section 2 to f (t) - q fj (t)).
Sentence 2: [7, 8, 15, 17]); a comprehensive survey (a) (b) Figure 8: CDF of the relative improvement of the minimum, mean, maximum rate and the fairness index of Horizon over the single­path TCP for the experiments with 4 .ows (a) and 8 .ows (b).
Relationship: neutral
Domain: Networks
Sentence 1: (9) Then, we can see that (11) can be generated by the above (9) assuming the below (10).
Sentence 2: 1) Request packet: same as ICMP Type 13 packet - Sequence number field = k - Originate timestamp = t b(k-1) 2) Response packet: same as ICMP Type 14 packet - Sequence number field = k - Originate timestamp = t a(k) - Receive timestamp = tb(k) - Transmit timestamp = t b(k) 5.2 Initial Offset Although the offset, Ofsa.estim is estimated for the true offset Ofsa which is Ofsa > 0 or Ofsa < 0 in (25), we have no idea whether the true offset Ofsa is Ofsa > 0 or not.
Relationship: neutral
Domain: Networks
Sentence 1: In our use to date we have found that such gaps are rela­tively minor (accounting for less than 13% of link time) but this could also be an artifact of our particular network and hardware.
Sentence 2: we col­lect all BGP messages received by the Peering and Internet Ex­change (PAIX) listener in Palo Alto, California that pertain to ad­dress blocks belonging to or serviced by the CENIC network.
Relationship: neutral
Domain: Networks
Sentence 1: aport i with a low demand and a high computation .ow will get all the bandwidth it rate such that x ; otherwise, the port will get a fair share asks for, i.e, r i b i b = x get connected a web server to the network.
Sentence 2: at time t, a puzzle router .rst estimates the packet arrival rate of puzzle-solution packets ra t with a typical exponential­averaging rate estimator [35].
Relationship: neutral
Domain: Networks
Sentence 1: Google Search Page Ads Quantile Linux RFC 3517 PRR Linux RFC 3517 PRR 25 487 -39 [-8%] -34 [-7%] 464 -34 [-7.3%] -24 [-5.2%] 50 852 -50 [-5.8%] -48 [-5.6%] 1059 -83 [-7.8%] -100 [-9.4%] 90 4338 -108 [-2.4%] -88 [-2%] 4956 -461 [-9.3%] -481 [-9.7%] 99 31581 -1644 [-5.2%] -1775 [-5.6%] 24640 -2544 [-10%] -2887 [-11.7%] Mean 2410 -89 [-3.7%] -85 [-3.5%] 2441 -220 [-9%] -239 [-9.8%]  Table 9: A comparison of TCP latency (ms) for PRR, RFC 3517 and Linux recovery.
Sentence 2: note that since some Web clients don t gener­ate DSACKS, these are lower bounds of the actual spurious retransmissions.
Relationship: neutral
Domain: Networks
Sentence 1: It can be seen from the table that the aggregate arrival rate to eachSS,i.e., .0i , canbedeterminedfromtheexitprocess of thecorrespondingAP connectedtoit.
Sentence 2: in case the connectivity of the network is not a complete mesh, then the routing probabilities will depend on the forwarding table entries of the SS.
Relationship: neutral
Domain: Networks
Sentence 1: The larger the difference between x and T(Bi), the more items might have been updated by the clients before disconnection, and those items would be falsely invalidated when reconnected.
Sentence 2: this may not be possible for Jing s approach because the number of bit-sequences (i.e., log(k)) is completely determined by the number of updates, k, during the window period (assumed fixed), and the number of updates, and thus, the update rates have nothing to do with FIR, as shown in the tables.
Relationship: neutral
Domain: Networks
Sentence 1: Categories and Subject Descriptors C.2.3 [Network Operations]: [Network Monitoring]; K.4.1 [Public Policy Issues]: [Privacy]; K.4.3 [Organizational Impacts]: [Computer-supported collaborative work]; K.6.m [Miscellaneous]: [Security] General Terms Security, Veri.cation  Keywords Adversarial Model, Anonymization, Network Logs, Taxon­omy 1.
Sentence 2: cryptographic: Attacking the cryptographic primitives  that form the basis for anonymization algorithms.
Relationship: neutral
Domain: Networks
Sentence 1: This score is shown to correlate well with the paper s PageRank score computed on citations links that will appear in the future.
Sentence 2: 1, 2 ··· n}: Retained adjacency matrices a, ß: attenuation factors e:unit vector (n × 1) Output DC(a, ., .1,n): Dynamic centrality vector Initialize r0 .
Relationship: neutral
Domain: Networks
Sentence 1: The actual values cannot be published due to a required NDA with Roma Metropoli­tane [6].
Sentence 2: iNTRODUCTION The demonstration of the solutions and the technologies discovered within the European project Genesi [1], concern­ing hardware and software for green monitoring of struc­tural health, has taken place by monitoring a construction site of Rome B1 underground.
Relationship: neutral
Domain: Networks
Sentence 1: Poor channel estimates can cause the sys­tem to generate digital samples different from what the node hears, such that their subtraction corrupts a received waveform.
Sentence 2: aCKNOWLEDGMENTS This work was supported by generous gifts from DoCoMo Capi­tal, the National Science Foundation under grants #0832820, #0831163, #0846014 and #0546630, the King Abdullah University of Science and Technology (KAUST), Microsoft Research, scholarships from the Samsung Scholarship Foundation, a Stanford Graduate Fellow­ship and a Stanford Terman Fellowship.
Relationship: neutral
Domain: Networks
Sentence 1: The use of broadcast is natural for a game with three or more players as only one send() is required for each data 1 0.75 0.75 Cumulative Distribution  Cumulative Distribution 0.5 0.5 0.25 0.25 0 0 0 100 200 300 400 500 600 Frame Size (bytes) Frame Size (bytes) (a) Nintendo DS(b) Sony PSP Figure 5: Frame Size Comparison for Di.erent Games Platform Game Percent   PictoChat 1% Metroid 10%DS Super Mario 3% Ridge Racer 10% Soccer 6% Need for Speed 8%PSP Legends 96% Golf 98% Table 3: Percentage of Frames Sent by Broadcast packet sent, while directly addressable frames need a sepa­rate send() for every other player.
Sentence 2: a 3-bar , or Excel lent connection, the highest, had the two hand-helds within 10 feet of each other in the same room.
Relationship: neutral
Domain: Networks
Sentence 1: VNET/P achieves 75%-85% of native performance on this benchmark, and there is no signi.cant differ­ence between the 1 Gbps and 10 Gbps network.
Sentence 2: the ping-pong latency and bandwidth results are consistent with what we saw in the previous microbenchmarks: in the 1 Gbps net­work, bandwidth are nearly identical to those in the native cases while latencies are 1.2 2 times higher.
Relationship: neutral
Domain: Networks
Sentence 1: First, this previous work described various disrup­tion scenarios in terms of their effects (e.g., internal path change) but did not propose an algorithm for determining the reason for the changes (e.g., node failure).
Sentence 2: introduction To achieve acceptable end-to-end performance in the face of dy­namic network conditions (e.g., traf.c shifts, link failures, security incidents, etc.
Relationship: neutral
Domain: Networks
Sentence 1: We define Prk,~:(t) A P[S(to + t) = glS(to ) = k], (19) where S(to) is the position of an MT at call arrival time to.
Sentence 2: when the one-step paging scheme is used, paging delay in each LA is equal to one, which means that the network must be able to locate the MT in one polling cycle.
Relationship: neutral
Domain: Networks
Sentence 1: In each experiment, we emulate an OpenFlow network using a slightly modi.ed version of Mininet [9] hosted on a physical server equipped with 64G of RAM and 4 Intel Xeon(R) E7-4807 CPUs (each with 6 cores).
Sentence 2: our evaluation results would still apply, even if we install all paths proactively.
Relationship: neutral
Domain: Networks
Sentence 1: through the deployment of additional infra-structure, such as dis­tributed antennaarrays,relay nodes, oradditionalbasestations(to reduce cell size).
Sentence 2: as dis­cussed above, the BS could send an over the air noti.cation to let all macro-terminalsknowthatthisSCis nolonger availabletothem (leaving total BS power unchanged; after a macro-cell terminal wins a SC the available down-link power is reduced).
Relationship: neutral
Domain: Networks
Sentence 1: Categories and Subject Descriptors C.2.2 [Computer Communication Networks]: Network Protocols; C.2.4 [Computer Communication Network­s]: Distributed Systems] General Terms Design, Algorithms, Performance, Experiments  Keywords Indoor energy harvesting, duty-cycle, synchronization 1.
Sentence 2: we dedicate a prototype of energy harvesting system in this demo to such applications.
Relationship: neutral
Domain: Networks
Sentence 1: In this context, each published service can be defined by a set of multi-user sessions, where each session can be composed by set of flows that may require similar or different quality levels, importance and rates (this generic definition accommodates common multimedia encoders, such as H.264, MPEG-2 and MPEG­4).
Sentence 2: [5] R. Hancock et al.. Next Step in Signalling (NSIS): Framework.
Relationship: neutral
Domain: Networks
Sentence 1: http://tools.ietf.org/html/ draft-pantos-http-live-streaming-01, 2009.
Sentence 2: for variable frame rate video, every picture needs a PTS value, but the extremely common case of constant frame rate video and uninterrupted audio makes itpossible to discard all PTSes except the .rst audio and video PTSin a segment.
Relationship: neutral
Domain: Networks
Sentence 1: The simulation results illustrated in Figure 4 show clearly that the SA and the proposed game have quite the same performance, since the maximum di.erence between the mean value of the SINR obtained by the SA and the game is -3dB.
Sentence 2: eNERGY EFFICIENT ITERATIVE WATER-FILLING ALGORITHM Water .lling is a frequently used algorithm in power allo­cation methods.
Relationship: neutral
Domain: Networks
Sentence 1: More in detail, tra.c-based criterion looks for nodes that cannot pass in routing standby, since their total demand is higher than the capacity of its greater out­coming link.
Sentence 2: in the routing standby state all incomingpackets are considered as terminatingpackets, and sodirected tothe localincomingport,whileoutgo­ing packets coming from the local ports are forwarded through a single active output interface.
Relationship: neutral
Domain: Networks
Sentence 1: Average delay values for G.711 codec are longer, as the time to cipher and decipher a 160 bytes payload is longer than the time needed to cipher and decipher an iLBC of 50 bytes payload.
Sentence 2: the average MOS score for G.711 was 4.25 and 3.82 for iLBC, in the 802.11 scenario, for example.
Relationship: neutral
Domain: Networks
Sentence 1: Multi­rate transmission based on variable spreading factor (VSF) requires different SIR levels for different rates to obtain the required error transmission probability.
Sentence 2: the SIR can be determined from the transmit power of MS i (pij), the path loss from the MS i to BS j (hij), the spread spectrum bandwidth (W), the data transmission bit rate (Ri) and the variance of the AWGN noise at the receiver of the BS (s2).
Relationship: neutral
Domain: Networks
Sentence 1: Optical waves do not suffer from such high attenuation but are affected by scattering.
Sentence 2: [] (m) (m) (m) .B= Bt-t[s] is the time-to-live of i max -i,now 0 packet marriving at node i,where t(m) is the arriving time i,now of m at i,and t0 (m) is the time m was generated, which is time-stamped in the packet header by its source.
Relationship: neutral
Domain: Networks
Sentence 1: BonnMotion: A mobility scenario generation and analysis tool.
Sentence 2: the utility of nodes in the same community (familiars)is slightly higher than those of outside nodes(un­   (a)(b)(c) Figure 5: Greedy in HCMM det5: ecdf(utilities) for (a) a sedentary node, and (b) a traveler.
Relationship: neutral
Domain: Networks
Sentence 1: Since the interpolated process 1.4 starts at time slot k, the behavior of .k (t)as k .8 is n,m ¯ that of Rn,m(k)as k .8.
Sentence 2: solid lines and lines marked with circles in the same color represent the same user s throughput when scheduled with CPF and LPF, re­spectively.
Relationship: neutral
Domain: Networks
Sentence 1: Algorithms for Packet Classification.
Sentence 2: instead of dividing edges of the original hash table into M independent sets, we would divide them into M+1 sets denoted by Gk(k = 1,.., M + 1) , among which the first M sets are all independent edge sets, and the last set is a residual edge set, which stores edges not fitting into the first M sets.
Relationship: neutral
Domain: Networks
Sentence 1: Moreover both nodes prevent the same number of nodes from serving as parents at time slot T Su on channel C Hu (i.e., they make dt i (u) of the same number of nodes not empty), so the node which has the smallest ID would be scheduled .rst.
Sentence 2: in order to facilitate the presentation of DAS-MC, Figure 1 will be referenced throughout the discussion.
Relationship: neutral
Domain: Networks
Sentence 1: CHANNEL ALLOCATION-POWER CON-for link li,j is P= {p : p = p = Pi}.We then de­ i,j i,j .ne p .×Pi,j as the transmission power assignment vector TROL SYSTEM MODEL FOR DYNAMIC SPECTRUM COGNITIVE NETWORKS The following formulation presented in [2] and we re-present it here for completeness.
Sentence 2: link li,j interferes with any link terminating at nk when the following condition holds: pi,j ·gi,k =ß.
Relationship: neutral
Domain: Networks
Sentence 1: The 4x4x4 Torus nominally has su.cient bisection bandwidth for all nodes in any one half of the topology to send all of their tra.c to nodes in the other half of the topology.
Sentence 2: [5] P. Dong, S. Liao, D. Feng, H. Liang, D. Zheng, R. Sha.iha, X. Zheng, G. Li, K. Raj, A. Krishnamoorthy, and M. Asghari.
Relationship: neutral