sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: 3.3 Leveraging sleeping of routers Itis wellknownthatthe chassis ofa router consumespower even ifjust one ofitslinksis active.
Sentence 2: to compute the normalizeddistance(wl),intermediate routers use thefunction RI(yl)to determine the energy state s index that can handle the loadyl, whilethefunction R(x)retrievesthe operating ratefor the energy stateindex x. Thedestination will reportback to the source the amount of traf.c thathas tobe removed(min(wl))in order to move alink to alower energylevel.
Relationship: neutral
Domain: Networks
Sentence 1: Instead, we consider how to detect inconsistent routes from data readily available within the local AS an internal BGP (iBGP) feed of the best route for each pre.x from each border router and the import policies con.gured on each of these routers.
Sentence 2: although a peer may intentionally send inconsistent advertisements to prevent its neighbor from performing hot-potato routing, we also discuss several con.guration scenarios where a peer may inadvertently advertise in­consistent routes, despite having consistent export policies.
Relationship: neutral
Domain: Networks
Sentence 1: And Figure 9(c) depicts the impact of ß towards ATVal when the bad-mouthing node deliberately accuses an innocent node per 60s.
Sentence 2: the privacy preser­vation increases the di.culty in resolving insider misbehav­ior, because anonymity hinders neighbors from directly dis­closing the real identity of the nearby misbehaving vehi­cles.
Relationship: neutral
Domain: Networks
Sentence 1: Here, multiplicative (M) policies change step size by a factor of 2, and additive (A) policies change step size by 4 TCAM counters every epoch.
Sentence 2: because it is impossible to predict traf.c variability, DR E AM may infrequently drop tasks when headroom is insuf.­cient.5 In our current design, operators can specify a drop priority for tasks.
Relationship: neutral
Domain: Networks
Sentence 1: If we identify particles with data packets, and the net­work with the medium in which particles move, then the routing problem becomes a problem of how to push a particle from one location in the medium to another.
Sentence 2: iNTRODUCTION n Work supported in part by the National Science Foundation under grant CCR 0227676, and by a gift from the Lockheed Martin Corp.
Relationship: neutral
Domain: Networks
Sentence 1: This behavior is captured by the impulse response of the wireless channel, considering L signal paths L X jfl d(t - tl), h(t )= alel=1 with di.erent values of each path for the amplitude al, phase shift fl and delay tl, acting as random variables on each impulse d. Because of phase shifts, interference e.ects can lead to signal cancellation or ampli.cation, depending on the relative phase shifts.
Sentence 2: our implementation on MICAz sensor motes presented in the next section shows that with a tolerance t = 1, key agreement was reached in 83% of the cases on the .rst try.
Relationship: neutral
Domain: Networks
Sentence 1: More impor­tantly, we show that there exists a simple and elegant duality rela­tionship between the LMM rate allocation problem and the LMM node lifetime problem.
Sentence 2: each of these .ow routing solutions will yield different available energy levels on the remaining nodes for future iterations and so forth, leading to a different rate allocation vector, which usually does not coincide with the optimal LMM rate allocation vector.
Relationship: neutral
Domain: Networks
Sentence 1: Unfortu­nately, even a very low fprQ1 could result in the misclassi.cation of a sample because during an eight hour day, there would be up to 8N opportunities to do so.
Sentence 2: this problem arises not only when searching for access points, but also when clients want to locate devices in ad hoc mode, such as when using a Microsoft Zune to share music or a Nintendo DS to play games with friends.
Relationship: neutral
Domain: Networks
Sentence 1: 7, July 2004 [11].Wei-chih Hong, Zsehong Tsai, Adaptive Bandwidth Allocation Via Dynamic Programming In A Shared Wireless Network, The 18th Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC 07) [12].Heng-Qing Ye, Stability of Data Networks Under an Optimization-Based Bandwidth Allocation, IEEE Transactions On Automatic Control, Vol.
Sentence 2: send raw packets to the network 2.2.2.3 What these libraries can t do Jpcap captures and sends packets independently from the host protocols (e.g., TCP/IP).
Relationship: neutral
Domain: Networks
Sentence 1: Auto-route When a TE-LSP is created, we automatically reroute any flow whose path goes through the head-end and the tail­end router of the created LSP onto the LSP.
Sentence 2: the user specifies the head-end and tail-end routers and the characteristics of the desired TE-LSP, which is then created in the network and shown in the GUI.
Relationship: neutral
Domain: Networks
Sentence 1: Maltz,P.Patel,andS.Sengupta.Vl2: ascalableand.exibledatacenter network.In SIGCOMM,2009.
Sentence 2: these proposals have not been evaluated under a range of realistic traf.c patterns and it is unclear whether simplisticECMPis suf.cientfor such situations.
Relationship: neutral
Domain: Networks
Sentence 1: (a) Using carrier sensing (b) Using a reference broadcast  Figure 6: The worst-case symbol timing misalignment of two concurrent transmissions received at the AP in a CSMA WLAN: (a) symbol timing misalignment when coordination uses carrier sensing;(b)areferencebroadcastsynchronizesthe senders better and timing misalignment is much tighter.
Sentence 2: these APs should use M-RTS and frequency-domain backoffto contend for each sub-channel for transmission.
Relationship: neutral
Domain: Networks
Sentence 1: In general, a higher data rate results in shorter frame durations, thus producing less interference.
Sentence 2: of the 10th ACM/IEEE International Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWiM), 2007 [5] Network Simulator ns-2, http://www.isi.edu/nsnam/ns/ [6] Q. Xu, T. Mak, J. Ko, and R. Sengupta, Vehicle-to-Vehicle Safety Messaging in DSRC, in Proc.
Relationship: neutral
Domain: Networks
Sentence 1: Simulation results for TAP algorithm are obtained using the turnover as de.ned in Eq.
Sentence 2: when d > dmin: -.d2-k2 1 u Pbi arccos( R2 )if a>amin (d, Ru, Rv) =p 2d.d (7) Ru=Rv 0 otherwise From Eq.
Relationship: neutral
Domain: Networks
Sentence 1: 1.2.2 Address-Based Authentication and SOP TCP injection attacks were key to some of the most well known exploits, speci.cally, attacks against address-based client authentication, e.g., see [7].
Sentence 2: sHPS chooses a pseudo-random initial port for each des­tination (server) IP-address; a new connection between the client and that destination uses the current port which is then incremented, i.e., a per destination port-counter.
Relationship: neutral
Domain: Networks
Sentence 1: n -22e2 Since n 11 = 0.07, n - 22e2 2e2 we need a> 0.07.
Sentence 2: observe also that E[Zt |Yis,s<t] depends only on |St-1|, the number of saturated vertices (i.e., those that have already transmitted three times suc­cessfully) for t -1, and when |St-1|=n/2wehave L Y tE[Zt |Yis,s<t]= i i.St-1 = (n -|St-1|) ·p/2 = (k -2)/4; of course, when |St-1|>n/2wehave E[Zt |Yis ,s<t]= k. In any case, E[Zt |Yis,s < t] =(k -2)/4.
Relationship: neutral
Domain: Networks
Sentence 1: [4]Y.Bernet,J.Binder,S.Blake,M.Carlson,B.E.
Sentence 2: alsonotethatambiguityasdefnedherepertainsonlyto thetrajetoriesfollowedbypakets.Forexample,example (e)isunambiguousbeausethereisnoambiguityaboutthe twotrajetoriesfollowedbythepakets.ifwehave olletedotherattributesofthetwopakets(attheingress 2Weviewpaketsgeneratedbyrouters(e.g.,routingup­dates)asomingfromavirtualingressnodeonnetedto thatrouter.
Relationship: neutral
Domain: Networks
Sentence 1: Let -be the set of check points that the CP rbfyx algorithm uses, being de.ned as follows: -c. Tyx CP rbfyx = cpyj , (10) Gyj .hp(Gyx )  where cyj =Tyj , 2Tyj , ..., myj Tyj,myj =Tyx /Tyj cp.
Sentence 2: pyx identi.es the parent server, i.e, the server to which the stream is connected to and RTyx is its computed response time.
Relationship: neutral
Domain: Networks
Sentence 1: We quanti.ed this performance in a controlled experiment with an increasing number of sensors, using .ve trials per con.guration (Fig­ure 7) and showed that PDR drops to near 20% with as few as 4 nodes in the same radio cell.
Sentence 2: con.guring, installing batteries, assembling parts, and mounting a sensor may only take 10 minutes, but for 200 sensors this adds up to over 4 days of installation time, eight hours per day.
Relationship: neutral
Domain: Networks
Sentence 1: In any such attempt, the calls belonging to the deterministic sub-classes retain their priority.
Sentence 2: c calls in any of the sub-classes {1,..., B } are of a higher prior­ c ity than this call and are within the deterministic guarantee limit) at a time t. We denote the probability that a call of sub-class i exists in the network at time tby pi(t).
Relationship: neutral
Domain: Networks
Sentence 1: For example, compared with Saucy+,O2, which has the SPLD heuristic, improves the time from 2.97 to 1.31 seconds (or 2.27 times) for BCube(8,4), from 18.5 to 4.16 seconds (or 4.34 times) forFatTree(100), from 6.33 to 1.07 seconds (or 5.92 times) for VL2(100,100), whereas it reduces the time from44603 to  Nauty Saucy+ O2 v v v Candidate pruning via orbit v v Selective splitting v Candidate selection via SPLD Table 4: Heuristics applied in different algorithms.
Sentence 2: address autocon.guration for data centerexpansionis required.
Relationship: neutral
Domain: Networks
Sentence 1: Second, this method a.ords a CDN only lim­ited control over load balancing decisions: caching of DNS responses by the clients makes server selection decisions per­sist for a long time, regardless of the current load condi­tions.
Sentence 2: we certainly do not expect this problem to occur in practice, where variable network delays introduce signi.cant random­ness into the behavior of di.erent TCP sessions.
Relationship: neutral
Domain: Networks
Sentence 1: 1 1  Bandwidth Guarantee Prob 0.9 0.8 Bandwidth Guarantee Prob 0.998 0.996 0.994 0.992 0.7  0.99 0 1 2 3 4 1.52 3.04 6.08 12.16 Number of Retries Pareto Shape Parameter Figure 3: SUAC is not robust in case of user retries.
Sentence 2: stable peers: Existence, importance, and application in peer-to-peer live video streaming.
Relationship: neutral
Domain: Networks
Sentence 1: (ii) Assuming the factors in.uencing this behav­ioral change can be sensed through the mobile phone sensors, the sensor sampling may have to be performed on a contin­uous basis in order not to miss the ground truth events.
Sentence 2: [8] K. K. Rachuri, M. Musolesi, C. Mascolo, P. J. Rentfrow, C. Longworth, and A. Aucinas.
Relationship: neutral
Domain: Networks
Sentence 1: However, the distance between the furthest nodes in the network able to cause this problem is not enough to justify the SlotTime values that maximizes tra.c in this net­work.
Sentence 2: a node that receives signal under such sensitivity does not use the received information as a received packet, but rather that reception activates the CCA (clear channel assessment) and e.ectively freezes the contention window.
Relationship: neutral
Domain: Networks
Sentence 1: Corollary 1 For any .ow aggregation p that enters the path at link Li, i.e., p 8 ei = p, the process {Vi(p,t)} has ergodic stationary increments.
Sentence 2: in the .rst experiment, we measure the rate response curve of the path from the RON node lulea in Sweden to the RON node at CMU.
Relationship: neutral
Domain: Networks
Sentence 1: For example, two static routes may be con.gured on R6 to reach S2, one using R4 as the next­hop, and the other using R5.
Sentence 2: toimplement the reachability between I1 and I2, one or more border routers must be deployed to physically connect the two routing instances, and in addition, a connecting primitive must be con.gured on the border routers to enable route exchange.
Relationship: neutral
Domain: Networks
Sentence 1: A Ubiquitous Wireless Video Surveillance System Based on Pub/Sub Jiannong Cao, Xuefeng Liu, Steven Lai, Yang Zou, Jun Zhang, Yang Liu, Chisheng Zhang {csjcao, csxfliu, csylai, csyzou, csjuzhang,csyangliu, cscszhang}@comp.polyu.edu.hk ABSTRACT In most of the existing video surveillance systems, captured video streams by CCTV or video cameras are aggregated through cables to a central station and monitored by associated human operators.
Sentence 2: using the video surveillance system, the designated car is tracked continuously.
Relationship: neutral
Domain: Networks
Sentence 1: Gandhi, Parthasarathy, and Mishra [6] claim NP-hardness of collision-aware broadcast scheduling on directed Disk Graphs, al­though they leave out the proof due to lack of space.
Sentence 2: ld(u,s)/rJ.If two nodes have the same value, the node that covers a node with smaller Euclidean hops from the source is given priority.
Relationship: neutral
Domain: Networks
Sentence 1: Fix M1,...,Mn satisfying M1 + ... + Mn = M such that Mj channels are divided into mj secondary parts of type j,for j =1,...,n.For these .xed values, let T (j0,j1,...jn,i) denote the maximum possible revenue from all participating networks when j0 primary parts and jt secondary parts of type t, t =1,...,n,are to be allocated and networks 1, ..., i are participating in the auction.
Sentence 2: of ACM Conference on Electronic Commerce, 2000.
Relationship: neutral
Domain: Networks
Sentence 1: Case 2: L1 <L2.Given any L2-zone, it can be di­vided into three parts: the center Lc-zone, and the two Ls-zones on the opposite sides of the center zone, where d - R+W/2 R+W/2 Lc = r and Ls = r. Then, it can be R+WR+W proved in a similar manner as in the proof of Theorem 4.1 (case 2) using Lemma A.3 in place of Lemma 4.2 that L2­zone is k-barrier covered.
Sentence 2: we also assume that nodes are able to estimate their remaining life­times by observing their battery drainage.
Relationship: neutral
Domain: Networks
Sentence 1: In the reactive mode, an unknown packet is forwarded to a central controller and the controller will decide the action for the unknown packet, for example, to setup the .ow table to forward the packet to a speci.c port.
Sentence 2: for example, 16k segments * 1k VTEPs becomes 16M messages/10 seconds or 1.6M messages/second.
Relationship: neutral
Domain: Networks
Sentence 1: Figure I shows some of the current and the proposed router queue mechanisms.
Sentence 2: likewise, by reserving 0.6-packet space in the queue, the untagged class could get an average of 1,500Kbps, that is little bit more than 2 times (2 untagged flows) the fair flow share during 10 to 20 seconds.
Relationship: neutral
Domain: Networks
Sentence 1: The LOS channel model  Transmision delay (millisecond) 0.7 0.6 0.5 0.4 0.3 0.2 0.1 0 0 400 800 1200 1600 2000 Traffic load (Mbps) Figure 4: Performance comparison between stan­dard and low latency frame aggregation, nrt =3, ns=8,subframelength1024bytes and7dBSNR.
Sentence 2: the improved capacity comes at the price of the prolonged transmission delay.
Relationship: neutral
Domain: Networks
Sentence 1: We note that 8% to 10% of the overall node population is a very strin­gent requirement for most practical purposes and can represent a huge number of nodes.
Sentence 2: this is exempli.ed in .gure 11, where the false positive rate increases faster, as the population of malicious nodes increases, for lower values of the signi.cance level of the test.
Relationship: neutral
Domain: Networks
Sentence 1: Since TCP-Reno and Tahoe can t handle multiple packet losses from one window of data, their performance degraded.
Sentence 2: in case of TCP-Newreno, up on the reception of partial acknowledgment, the sender shouldn t come out of fast recovery algorithm; rather it retransmits the lost packet and stays in fast recovery phase till all the unacknowledged packets from one window of data to be acknowledged.
Relationship: neutral
Domain: Networks
Sentence 1: 5.3 Integrating RRAA-BASIC and A-RTS While RRAA-BASIC and A-RTS address channel .uctu­ations and hidden terminals respectively, one might think that a simple combination of both algorithms would su.ce.
Sentence 2: when it is halved from the value 1, it becomes 0 which disables RTS again.
Relationship: neutral
Domain: Networks
Sentence 1: The resulting tra.c is not only a waste of global Internet resources, but also raises security, privacy and intellectual property questions of its own.
Sentence 2: using a discrete autocorrelation algorithm we found that updates series have periods of 60 or 75 minutes, which we identi.ed as default settings of out­of-the-box Microsoft Windows 2000 and XP DNS software.
Relationship: neutral
Domain: Networks
Sentence 1: He is a fellow of the Institute of Electrical and Electronics Engineers (IEEE), the Asso­ciation for Computing Machinery (ACM), and the Amer­ican Association for the Advancement of Science (AAAS).
Sentence 2: the design choices that have been made for wireless networks are derivatives of pro­tocols designed for wireline networks and are such that: (a) channel access is either very ine.cient and unable to support multimedia tra.c across multiple hops, or requires complex clock synchronization to support scheduling schemes based on time division of the channel and dynamic channel reuse; (b) the routes established in wireless networks have no cor­relation to the transmission schedules used over the wireless links forming those routes, which reduces the e.ciency with which .ows can be forwarded; and (c) the mechanisms used for information dissemination in wireless ad hoc networks do not scale with the size or dynamics of the network.
Relationship: neutral
Domain: Networks
Sentence 1: * Peer X Provider X X Table 1: Guidelines for interception.
Sentence 2: rather than providing contrived counterexamples, we give evidence that the attack strate­gies we discuss could succeed in wild by ensuring that every example we present comes from real data.All the exam­ples we present here were found in CAIDA s November 20, 2009 dataset [11], and then anonymized by replacing AS numbers with symbols (e.g., in Figure 1, m for manipula­tor, v for victim, T 1for aTier 1AS, etc.).
Relationship: neutral
Domain: Networks
Sentence 1: The results from our measurements mostly support conventional wisdom by quantifying the key characteristics of non-access bot­tlenecks.
Sentence 2: if the trace process observes that the queues on the .rst 1-3 hops from the source are building, it quits immediately, to avoid .ood­ing the local network (The .rst 3 hops almost always encompass all links along the path that belong to the source stub network).
Relationship: neutral
Domain: Networks
Sentence 1: IEISS simulates telecommunications by iteratively (at random) choosing unrouted sessions until every session is either routed or dropped.For each session, IEISS choosesa route between the session s source and desti­nation using the routing preference algorithms developed for MIITS-P.
Sentence 2: the challenge is how to select a suf.cient numbers of sessions that characterizes the traf­.c in the MIITS-P model.
Relationship: neutral
Domain: Networks
Sentence 1: Typically, a scan happens every 15 seconds, and each time it consumes about 20uAh energy, with an average power 57% more than the non-scan state, as shown in Figure 1.
Sentence 2: rEFERENCES [1] K.-H. Kim, A. Min, D. Gupta, P. Mohapatra, and J. Singh.
Relationship: neutral
Domain: Networks
Sentence 1: InChord, this would mean that stealth nodes would acquire suc­cessorandpredecessorpointers,aswell as .ngertables, but they would never appear as predecessor, successor orin .ngertablesof any othernodes(serviceand stealth nodes alike).
Sentence 2: section 5 describes how the fundamental separation of role between map­ping servers and mapping resolvers (i.e.
Relationship: neutral
Domain: Networks
Sentence 1: If we can introduce su.cient noise in the error X that is produced by any particular transmitter, we can drive H(X|T)closer to H(X), reducingthe mutual information and reducing the certainty of identi.cation, and thusprivacy reductionresultingfrom wireless .ngerprinting.
Sentence 2: without the ability to provide unlinkability at the PHY layer, upperlayerprivacy techniqueswill notbe abletopro­vide vehicle privacy.
Relationship: neutral
Domain: Networks
Sentence 1: Given a new Wi-Fi scan, the sensor model determines a particle s likeli­hood as follows: for each AP in the scan, we look up the response rate or the probability of seeing the mea­sured signal strength based on the distance between the particle and the estimated AP location in the radio map.
Sentence 2: in return, it also sheds its sensitivity to potential systematic differences in the way different Wi-Fi devices mea­sure signal strength.
Relationship: neutral
Domain: Networks
Sentence 1: Proceedings of the IEEE, Special Issue on Advances in Video Coding and Delivery, 93(1):18 31, January 2005.
Sentence 2: there is, for example, no dependency across distant gops and only limited dependency between objects in adjacent gops (the last b-frames of an open gop in MPEG-2 video depend on the .rst i-frame of the fol­lowing gop).
Relationship: neutral
Domain: Networks
Sentence 1: [7] Hsu, W., Dutta, D. and Helmy, A. CSI: A Paradigm for behavior-oriented profile-cast services in mobile networks, Ad Hoc Networks 10(8): 1586-1602 (2012).
Sentence 2: as can be observed form the figure, this approach does not improve the minimum similarity, however only less than 2 percent of receivers have a similarity score less than 60 percent.
Relationship: neutral
Domain: Networks
Sentence 1: 22 minutes), sending 230 packets, and spanning 6 different postures (SIT, SIT-RECLINING, LYING-DOWN, STAND, WALK and RUN), each lasting for 20 sec.
Sentence 2: due to its inherent flooding nature, the transmission energy cost for OBSFR will be expected to be significantly larger compared to PRPLC and PROPHET [12].
Relationship: neutral
Domain: Networks
Sentence 1: Avarietyofonsiderationsshouldbetakenintoaount byaserverbeforedeidingontheappliabilityofaparti­ularationtoasequene.Amongtheonsiderationsare thelengthofthesequene(somesequenesmayhavetobe longbeforetheyareonsideredusefulenoughtotriggera partiularserveration),thesizeofthefullontainerdo­ument,orthesizeofthebasepage.InTable3,welista seriesofpossibleserverationsandthesequeneriteriato beexaminedforeahation.
Sentence 2: evenoursimplesetofategories(poor,normal,andrih) anbeusedtodriveawiderangeofpossibleserverations.
Relationship: neutral
Domain: Networks
Sentence 1: Let q be the probability that a spe­ci.c fragment of the IP address of routerA is (accidentally) equal to a fragment with the same index of (at least) one router at distance n on some of attack paths.
Sentence 2: most of PPM schemes let bd = 5and ap­ply the zero/increment scheme; if a router decides to mark the packet, it sets the distance .eld at 0.
Relationship: neutral
Domain: Networks
Sentence 1: For example, in some chan­nel estimation methods which are based on minimum mean square error (MMSE) (e.g.,[9, 4]), it is assumed that the channel frequency covariance matrix is known, otherwise, it has to be estimated via statistics.
Sentence 2: each OFDM symbol is appended by a cyclic pre­.x (CP) that is longer than the delay spread of the mul­tipath fading channel L. Then, the parallel data are con­vert back to serial data stream, and transmitted over the frequency-selective channel with additional white Gaussian noise (AWGN) and unknown narrowband interference.
Relationship: neutral
Domain: Networks
Sentence 1: This result reveals two key observations: i) Hierarchical cooperation yields a logarithmic growth rate for the schedule length with N, that is well below the linear growth rate achieved by network-wide cooperation or two-phase cooperation and ii) The cooperation set size i constitutes a degree of freedom for trading transport traf.c for scheduling delay for a given net­work size.
Sentence 2: it would lack the sample measurements of nodes in other sets.
Relationship: neutral