sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: From a technical perspective, realizing e.cient data de­livery without capacity over-dimensioning demands for a .exible and adaptive tra.c control coupled with in-network caching.
Sentence 2: rEFERENCES [1] G. Caro.glio, M. Gallo, L. Muscariello, M. Papalini, and S. Wang.
Relationship: neutral
Domain: Networks
Sentence 1: http://www.teltarif.de/arch/2005/kw24/s17460.
Sentence 2: eVALUATION SeveralaspectsareofinterestwhentestingaVoIPapplication:setuptime,end-to-endlatencyandpacketloss.Furthermore,toob­jectivelymeasurethespeechquality,theITUPESQ[16]methodcouldbehavebeenemployed.PESQmeasurementsarecomplexandrequireexplicitequipmentwhichwedidnothaveavailable.Furthermore,PESQincludesmanyparameterslike.l­tering,distortions,channelerrorswhichcanbeignoredwheneval­uatingtheverygenericbehaviorofanapplication.WethereforeconcentratedonSIPsetuptimeandlatencymeasurements.
Relationship: neutral
Domain: Networks
Sentence 1: WMuNeP 08, October 27, 2008, Vancouver, BC, Canada.
Sentence 2: iNVITE sip:uB@registrar.org SIP/2.0To: User B From: User A Proxy-Require: prefReject-Contact:*;videoAccept-contact:*;+type-of-charging= free­charging ;+service-provider-name= SP2 Accept-contact:*;methods= INVITE ;explicitAccept-contact:*;audio ;require ;explicitContact: sip:uA@pc.example.com When the Global Server receives this request, it finds a well­matched URI according to User A s preferences by applying the process described in the SIP Caller Preferences extension [3].
Relationship: neutral
Domain: Networks
Sentence 1: This is largely because the slope of the .rst-order Taylor approximation is dependent on the noise variance o.set in the uncertainty variable constraint.
Sentence 2: when power and dpi bi nn quantization are determined dynamically based on the noise Power Usage (pu) Bits per transmission Node KF accuracy (||x -x||/d) 8 6 100 4  35 2 0 10 0 0 20 400 20 400 20 40  30  Node 4 Node 3 Node 2 Node 1 100 0 8 6 0  25104 2 North (du) 20 0 20 400 20 400 20 40  156 0 104 2  10 0 10 0 0 20 400 20 400 20 40 8 8  5 6 100 4 2  0 100 0 (a) Individual sensor node metrics.
Relationship: neutral
Domain: Networks
Sentence 1: A 300-Byte packet (which is used in our experiments) takes 0.4ms transmission time us­ing 6 Mbps (QPSK), which is just a little beyond the channel coherence time (0.3-0.4 msec in rural and freeway environ­ment), so the mobility and corresponding Doppler spread do not degrade performance signi.cantly.
Sentence 2: 1.0 1.0 1.0 0.8 0.8 0.8 0.6 0.6 0.6 PPDR PPDR PPDR 0.4 0.4 0.4 0.2 0.2 0.2 0 0 50 100 150 200 250 300 350 0 50 100 150 200 250 300 350 0 50 100 150 200 250 300 350 Distance (m) 0 0  Distance (m) Distance (m) (a) UF environment (b) RF environment (c) RR environment Figure 10: PDR vs.
Relationship: neutral
Domain: Networks
Sentence 1: Again, if no similar images are present at the server for any of the images being considered for up­load, there is a very slight increase in delay (from 8.41 seconds to 9.12 seconds) due to the metadata exchange and processing.
Sentence 2: one could conceivably tar­get prioritizing image uploads based on content; however, we defer studies of such possibilities to the future.
Relationship: neutral
Domain: Networks
Sentence 1: LATENCY-CONSTRAINED RELAYING Relaying requires spoke-to-spoke traf.c to traverse an indirect path, and therefore increases paths latency.
Sentence 2: actually, given hundreds of VPNs each of which spans some tens to hundreds of PEs, running our pro­totype script with usage-based traf.c matrices measured over one week takes less than an hour.
Relationship: neutral
Domain: Networks
Sentence 1: The cases k = 1, 2, 3 are considered: with k = 1, the models are based on known asymptotic results to assure correct limiting behavior; with k = 2, 3, an attempt is made to generalize these results and the models are built accord­ingly.
Sentence 2: gENERALIZATION TO Rk 3.1 Preliminaries As presented in [4], the generalization of Theorem 2.1 to the k-nearest neighbor graph is lim P [nmM k 2 - log n - (k - 1) log(log n) + log(k - 1)!
Relationship: neutral
Domain: Networks
Sentence 1: To that end, two US Government agencies FCC and NTIA have been tasked to identify 500 MHz of new spectrum to be made available by 2015.
Sentence 2: in many settings, Wi-Fi networks are experiencing con­gestion and despite continued improvements in Wi-Fi speeds (e.g: 802.11ac), many predict need for more unlicensed spectrum to sup­port greater number of Wi-Fi channels.
Relationship: neutral
Domain: Networks
Sentence 1: Delay-Tolerant Networking in Restricted Networks Johannes Morgenroth, Tobias Pögel, Robert Heitz and Lars Wolf Institute of Operating Systems and Computer Networks Technische Universität Braunschweig Braunschweig, Germany [morgenroth, poegel, heitz, wolf]@ibr.cs.tu-bs.de ABSTRACT For security reasons, many companies usually allow only strictly regulated communication, speci.c system con.gu­rations and predetermined software components.
Sentence 2: if the client has bundles to send, another HTTP connec­tion is initiated.
Relationship: neutral
Domain: Networks
Sentence 1: V 1+mi mk and mi and mk are the angular coef.cients of the straightline that passes through node i and the sink node and through node k and node i.Theaddition of thisedgeisdoneusing thesameprobabil­ity p determined for each edge of G. After adding this new edge, according to p, G will become a small-world graph, and for large values of p, we willhave a randomgraph.
Sentence 2: the concept is simple: a small number of powerful high­end sensors(H-sensor) and alargenumber oflow-end sensors(L­sensors) constitute a wireless sensor network and this model is calledHeterogeneous SensorNetworks(HSNs)[14].
Relationship: neutral
Domain: Networks
Sentence 1: Although T-MAC is primarily designed to shorten the Data period when no traf.c is around the node, so that nodes can preserve more energy, T-MAC can also extend the Data period to allow multihop forwarding during a sin­gle Data period.
Sentence 2: as traf.c in a WSN can be quite dynamic, depending on the events being sensed and the sensing application and protocols being used, an ideal WSN MAC protocol should perform well under a wide range of traf.c loads, including high loads and bursty traf.c.
Relationship: neutral
Domain: Networks
Sentence 1: [3] Lakshminarayanan Subramanian, Sharad Agarwal, Jennifer Rexford, and Randy H. Katz.
Sentence 2: categories and Subject Descriptors C.2 [Computer Systems Organization]: Computer -Com­munication Networks; C.2.1 [Computer-Communication Networks]: Network Architecture and Design 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: neutral
Domain: Networks
Sentence 1: We can also see a peak variance of almost 2.25 at 149th fractal that is greater than 25% of WKH ZKROH HYHQW¶V YDULDQFH.
Sentence 2: pDFs stage 2 of the fog event with a fractal size of 5 minutes So it can EH HVWDEOLVKHG WKDW IRJ¶V EHKDYLRU GXULQJ LWV VHWWOHG GRZQ case is very much constant and the density function of received signal strength is Gaussian.
Relationship: neutral
Domain: Networks
Sentence 1: 5.3 Dead-Reckoning 5.3.1 Average Localization Error Over Time In Figure 16(a), we show the average cumulative localiza­tion errors of Dead-reckoning and Social-Loc for all six users.
Sentence 2: otherwise, user A would have encountered either user B or C. user A can be localized to location 1 by removing the impossible location 5.
Relationship: neutral
Domain: Networks
Sentence 1: DEBS 10 July 12-15, 2010, Cambridge, UK Copyright 2010 ACM 978-1-60558-927-5/10/07 ...$10.00.
Sentence 2: the KAP project address both   Figure 2: GINSENG Data Processing Framework manufacturing experts (methods to green-up production processes) and consumers (visualization of the energy costs required to produce certain goods).
Relationship: neutral
Domain: Networks
Sentence 1: Let NCBPS denote the block size.
Sentence 2: we observe that a data symbol s is successfully receivedif(i) the headeriscorrectly received and(ii) theFECgroup towhich s be­longsisreceivedcorrectly.we .rstcomputethedelivery probability of anindividualFECgroup, and then computethe ex­pected number of received symbols asfollows: X Pheader · PFEC(K) dK, K where Pheader denotes the header delivery probability, PFEC(K) denotes the FEC group K s delivery probability, and dK denotes the number ofdata symbolsin theFECgroup K. Pheader canbe computed asfollows: YY BERi + (1 - BERi)PFEC' , i.header i.header since the header is received either when all bits in the header are correctly received(which canbe veri.ed using aheaderCRC) or when the FEC group to which the header belongs is correctly re­ceived, which is denoted by PFEC' .
Relationship: neutral
Domain: Networks
Sentence 1: The task of securing the data can be accomplished by end-to-end cryptographic signatures and encryption (when data secrecy is needed), leaving open only the task of key management among the data sending/receiving parties, but not any channel or boxes in the middle of the data delivery paths.
Sentence 2: because data is invisible in today s IP-centric architecture, one can only meet applications needs by selecting a speci.c node to send data to, resulting in sub-optimal data delivery.
Relationship: neutral
Domain: Networks
Sentence 1: 4Since the genre listings of applications can be inaccurate, we categorized the top 250 applications manually.
Sentence 2: out-degree, Tail Week GoF LN PL EXP SE PLED 34-2009 KS 5.39E-03 6.58E-03 5.77E-03 5.41E-03 5.49E-03 50-2009 KS 3.82E-04 3.34E-04 4.49E-04 4.38E-04 6.289E-03 26-2010 KS 7.32E-03 7.11E-03 7.75E-03 7.74E-03 0.0195 Table 5: GoF measures for out-degree (tail) distributions for weekly iHeart user activity.
Relationship: neutral
Domain: Networks
Sentence 1: Flow definition schemes have been developed in re- search environments, see e.g.
Sentence 2: if our assumption (A2) were obeyed, we would expect ml to decrease inversely with N. the decrease is a little slower than this, a symptom of the fact that the trace contains SYN packets that do not start flows, and hence M1 overcounts of the number of flows.
Relationship: neutral
Domain: Networks
Sentence 1: While predicting the amount of tra.c crossing a link in a certain period of time 3.1 Slide-and-Chop (S&#38;C) Besides the unsuitability of setting the threshold by guess­ing Ct, the previous discussion reveals that overthresholding has a distinct e.ect from underthresholding.The former can cause false negatives.
Sentence 2: (1) d dbm(d -1)m m +1 As we show in [13], if (m +1) =d/z,then E[Rm+1]can be `´ d (m+1)2ez/d bounded above as E[Rm+1] = zm+1 e. Plugging this and E[R]= dz in (1), it follows that 1 d -11 m (m+1)2 ez E[No] = 1+ 1+ e d .
Relationship: neutral
Domain: Networks
Sentence 1: [18]T.BATES,R.CHANDRA,D.KATZ,ANDREKHTER,Y.
Sentence 2: theownerBNprovidesaonvenientrendezvouspointfor thesession.Otherbroadastnetworksattahtothesession viatheownerBN'sbroadastgateways.Moreover,theon­eptoftheownerBNlendsitselftoanintuitivenaming shemeforbroadastsessionsthatavoidstheaddressallo­ationproblemsassoiatedwithtraditionalmultiastpro­tools.Arossthefederation,asessionisidentifedbya ombinationoftheownerBN'sBNNumoritsorrespond­ingDNSname,andthenativenameofthesessionwithin theownerBN.WeuseaURL-likenamingshemeforthese federation-widesessionnames: bfed:/// ?=&#38;=... Theomponentofthesessionnamerepre­sentstheaddressoruniquenameassoiatedwiththesession withintheownerBN,andanbeparsedonlybygatewaysin theownerBN.ClientsandgatewaysinotherBNsregardit asanopaquestringofharaters.themusionert originatingwithinanISP'sIPmultiastnetworkwillusethe BNNumorDNSnameassoiatedwiththeISP'snetwork, andtheIPmultiastgroupaddresstoformitsfederation­widesessionname,forexample: bfed://rultiast.isp.net/224.5.6.7:8888 InadditiontotheownerBNNumandthenativename,a sessionURLmayontainadditionalparameters.Thesepa­rameters,whihfollowthe?
Relationship: neutral
Domain: Networks
Sentence 1: Finally, we observe that AODV allows a slightly shorter Gnutella bootstrapping time, as suggested by the slopes in the .rst 100 seconds.
Sentence 2: additionally, it was a natural choice to implement the cross-layer interface inside the PROTOLIB, so as to provide OLSR and Gnutella with platform indepen­dent objects for cross-layer interactions.
Relationship: neutral
Domain: Networks
Sentence 1: Session completion time is another potential evaluation metric.
Sentence 2: so while a small set of transactions suffer more, for the majority 10000 1000 1000  Additional Delay (ms) 100 10 Additional Delay (ms) 100 10 1 1 WCETT ETX HOP PKTPAIR RTT WCETT ETX HOP PKTPAIR RTT 10000 10000  Additional Delay (ms) 1000 100 10 Additional Delay (ms) 1000 100 10 1 WCETT ETX HOP PKTPAIR RTT WCETT ETX HOP PKTPAIR RTT 1 10000 10000  Additional Delay (ms) 1000 100 10 Additional Delay (ms) 1000 100 10 1 WCETT ETX HOP PKTPAIR RTT WCETT ETX HOP PKTPAIR RTT 1 10000 10000 Additional Delay (ms) 100 10 1 WCETT ETX HOP PKTPAIR RTT Figure 20: Performance over Heavy Traf.c Period, Central Placement, Testbed Con.guration B of transactions the delay is still acceptable.
Relationship: neutral
Domain: Networks
Sentence 1: For example, the signature action: Message m in [IPDatagram d]{i_x,i_y}| m.dst != i_y; represents a link-level message used during the delivery of an IP datagram such that the link-level destination address isnotthe.naldestinationinterface(i.e.,the messageisnot the last one in the delivery process).
Sentence 2: states are characterized by means of assertions, which are functions with zero or more arguments returning Boolean values.
Relationship: neutral
Domain: Networks
Sentence 1: On July 19th, 2004, from 9:30am, when we began our data collection, to 9:37am, a host outside of the UMASS campus network performed a port scan at port 4899 by sending many SYN packets to dif­ferent hosts in the UMASS campus network.
Sentence 2: we divide time into slots of .xed length d. Suppose the traf.c in a time slot contains the packet sequences {x1,...,xn}, the empirical distribution P of the packet classes in this time slot is 2 1 (xi .
Relationship: neutral
Domain: Networks
Sentence 1: Pk) case 1: r if n = nRelay the received packet to the sink; else Send the sensed data to the sink; endif case 2: r if n = nRelay the received packet to the mobile; else Find a neighbor in P3  G andsendsenseddata to it; endif case 3: a if n = nRelay the received packet to the mobile or nr; else if n. G Find a neighbor in P3  G andsendsenseddata to it; else Relay the received packet towards na using a neighbor in P3  G; endif case 4, .
Sentence 2: we denote the nodes out side the transmission range of the sink as P1.The set of all the nodes which can reach the sink within j hops is denoted as Qj =k=j Pk.We use nk to represent a node in Pk and n=j to represent a node in Qj.
Relationship: neutral
Domain: Networks
Sentence 1: Assume we have outliers X = {x1,x2,...,xk}sent to a non-leaf y that contains outliers Y = {y1,y2,...,ya}for a = 0, where X and Y are sorted such that xi is a more likely outlier than xj , where i>j for i .
Sentence 2: [3] M. M. Breunig, H.-P. Kriegel, R. T. Ng, and J. Sander.
Relationship: neutral
Domain: Networks
Sentence 1: In addition to predicting Wi-Fi availability, Blue-Fi also User t = 0.8 p2p Global U1 59.6% 68.3% 79.4% U2 57.8% 72.2% 84.5% U3 51.1% 78.4% 86.3% U4 73.4% 78.8% 89.1% U5 74.2% 81.8% 90.1% U6 50.2% 66.5% 88.1% U7 58.8% 71.1% 90.1% U8 61.2% 69.4% 83.3% U9 44.6% 65.1% 80.8% U10 60.2% 70.8% 76.4% U11 60.1% 72.2% 77.3% U12 64.5% 70.9% 73.2% Table 6: Improvement in Coverage because of peer­to-peer and global sharing aims to learn new access points that provide connectivity, i.e., open or unsecured wireless networks.
Sentence 2: referencedevices can alsobeplaced us­ingsystematic techniques.
Relationship: neutral
Domain: Networks
Sentence 1: 3.1.2 Utilization-Based VFI Creation To find the optimal utilization-based clustering, we group the cores that are in each quartile of the utilization values within a single VFI.
Sentence 2: more recently, it has been shown that mSWNoC can help improving the temperature profile of the NoC switches and links compared to a traditional mesh in presence of DVFS [13].
Relationship: neutral
Domain: Networks
Sentence 1: Table 1: Notations Used in This Paper.
Sentence 2: minimum­ 100000 0.1 Proportional using FIFO Proportional using FIFO Minimum-access using GreedyDual Minimum-access using GreedyDual Minimum-query using GreedyDual 10000 slope=-1.0 Number of replicas slope=-0.667 slope=-0.5 1000 100 10 1 Normalized retrieval cost 0.01 1 10 100 1000 10000 0.4 0.5 0.6 0.7 0.8 0.9 1 1.1 1.2 Object popularity rank, i Alpha Figure 7: Number of replicas of objects with different ac­cess probabilities in steady-state, proportional strategy/FIFO, minimum-query strategy/GreedyDual, and minimum-access strategy/GreedyDual.
Relationship: neutral
Domain: Networks
Sentence 1: Theseconditionalprobabilitiesareusedtoupdatetheprobabilityvectorip byapplyingBayes Rule[3] pi *P(M|ri) pi = Pn pj *P(M|rj) j=1 foreachreferencepointi.
Sentence 2: figure 2: Each asterisk represents a reference point with eight signal strength histograms in an exemplary operation area.
Relationship: neutral
Domain: Networks
Sentence 1: Hence, most of these systems are designed with suf.cient resources to service an ex­pected mix of packet types, while ensuring that the worst-case per­formance requirements for only the basic IP-forwarding bench­mark are met.
Sentence 2: by making use of registers, and where available, the small fast memories close to the processor [22] to store temporary­data, the overhead for temporary-data accesses can be elimi­nated.
Relationship: neutral
Domain: Networks
Sentence 1: Other approaches [20 23]illustrated that optimalnetwork performance could notbe reachedby solely considering con­nectivity, and suggested to also take into account transmis­sion load or interference levels.
Sentence 2: of the 3rd Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON 06), Reston, VA, USA, September 2006, pp.
Relationship: neutral
Domain: Networks
Sentence 1: We can further convert such problem to a tradi­tional network .ow problem which has only edge capacity constraints using the well known node-splitting method in network .ow problems ([27] page 41 42).
Sentence 2: in order to provide a tight bound on the moving distance, we use a di.erent placement than the deterministic placement discussed in the previous section, which places k v sensors at the same grid point of side length ds =2r.
Relationship: neutral
Domain: Networks
Sentence 1: However, unlike these related works, IDIPS is not limited to the peers selection in P2P and can measure path performances.
Sentence 2: iNTRODUCTION Content is often replicated and distributed with the help of e.cient content distribution networks (CDN) [3, 5] or even end-user based replication with peer-to-peer applica­tions.
Relationship: neutral
Domain: Networks
Sentence 1: RDMA initiator RDMA target TCP sender TCP receiver      B y tes per Energy (M B y tes/joule) 70 60 50 40 30 20 10 0  Figure 10: BPE for Chelsio Bandwidth Tests From Figure 5, we noticed that CPU utilization drops as the message size increases for Mellanox RDMA tests.
Sentence 2: we believe that it is equally important to study the power aspect of high performance communication.
Relationship: neutral
Domain: Networks
Sentence 1: 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.
Sentence 2: the time for the network to stabilize is the information propagation time in the network,which depends on the maximal hops from the goals or the obstacles to any node in the network.
Relationship: neutral
Domain: Networks
Sentence 1: SUMMARY AND CONCLUSION We introduced a novel framework for P2P media stream­ing, BEAM, that uses alliance basedpeering scheme to solve some of the existing problems in chunk based P2P media streaming.
Sentence 2: in BEAM, the initial bu.er­ing time can be reduced from approximately 30 seconds to 10-12 seconds for smaller swarms and less than 20 seconds for larger swarms (4096 nodes).
Relationship: neutral
Domain: Networks
Sentence 1: The coordinates of each LM are as: (0, 0), (.v3R, 0), (v3R, 0), ( .v3R/2, 3R/2), ( v3R/2, 3R/2), ( .v3R/2,-3R/2), (v3R,-3R/2).
Sentence 2: it may result in large error to interpret NLOS condition into LOS condition.
Relationship: neutral
Domain: Networks
Sentence 1: It is also compared with the recently proposed Energy Balanced Routing Protocol (EBRP) and established that our proposed work is performing well as compared with the existing one in terms of Throughput and End-to-End Delay and this proposed work retains all the positive features of Portion of Living Node (PLN) and Network Lifetime.
Sentence 2: they have proposed an novel routing scheme called Energy Balanced Routing Protocol which does overcome the problem of energy consumption imbalance is a serious issue in recently proposed energy-efficient routing techniques, and it does demonstrate the advantage of balanced energy consumption between the sensor network.this schemes consumes more cost which leads End-to-End delay.
Relationship: neutral
Domain: Networks
Sentence 1: SINRequal to 0, in other words, ............ .... case1 takin g value is alway s high er than threshold, case2 taking ............ .... between 0 to a seconds, case3 taking All nodes use CC2420 radio transceiver which occup ies 2.4GHz frequency band and transmit p ower of sender nodes is a to ß seconds, case4 taking bet ween ............ ....  fixed to -3dBm.
Sentence 2: the result of naive Bayesian classifier, the proposed algorithm which jointly considers PRR and previous state is equal to prior ............ .. .. value, respected result.
Relationship: neutral
Domain: Networks
Sentence 1: MAC designs using local signaling among nodes [5][9][11], e.g., exchanging request-to-send(RTS)/(clear-to-send)CTS mes­sages over a common code/frequency control channel, real­ize transmitter-receiver hand-shaking and may improve the performance over random access schemes.
Sentence 2: copyright 2005 ACM 1-59593-004-3/05/0005 ...$5.00.
Relationship: neutral
Domain: Networks
Sentence 1: Proceedings of the 7th USENIX conference on Networked systems design and implementation (Berkeley, CA, USA, 2010), 19 19.
Sentence 2: we show that distributed-adaptive-routing may be used to provide a scalable and non-blocking routing even for long flows on a rearrangeably-non-blocking Clos network under half­rate conditions.
Relationship: neutral
Domain: Networks
Sentence 1: a) Nodes generate traffic independently of each other, via a Poisson process with a mean rate of~.g messages per cycle.
Sentence 2: by modelling the injection channel in the source node as an M/G/I queue, the mean arrival rate and mean service time arc given by the following equations ~'~ = 2n +Ash + ~n Aa" (26) ~, = ~,b + "g~r Sb -~ S,, (27) Approximating the variance of the service time distribution by (S, -M) z yields a mean waiting time at the source as --2 ~.
Relationship: neutral
Domain: Networks
Sentence 1: The implementation known as Trunked IAX protocol allows the use a single header for the passage of several calls, meaning that it is possible to send several conversations on the same stream, which represents a significant saving bandwidth, since with this avoids the overhead of IP and UDP transport layers too.
Sentence 2: in addition, IAX uses UDP port 4569 to communicate all the packages, using for that purpose call a field of 15 bits within the header of the protocol for multiplexing the streams over a single UDP association [10].
Relationship: neutral