sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: Complex systems are large-scale and dynamic interconnections of nodes (connected via physical links or logical relations) that emergently self-configure into random networks with power-law connectivity-degree distri- bution z. Power-law signature has been observed in natural complex systems, such as social networks and ecological net- works, as well as man-made complex systems such as the Internet and World Wide Web.
Sentence 2: introduction to Percolation Theory.
Relationship: neutral
Domain: Networks
Sentence 1: RELATED WORK AND OUR CONTRI-BUTIONS 2.1 ReviewonDeluge Deluge [2], currentlydistributed as part of TinyOS, is the de facto standard codedisseminationprotocol.
Sentence 2: both .lters heavily rely on secure pairwise key establishment to allow secure information exchange between the sender and the receivers, which introduces new security issues.
Relationship: neutral
Domain: Networks
Sentence 1: Let M"" [i]bethe cumulative valueof M" i [i], i.e., M"" [i]=j=0 M" [j].
Sentence 2: sYSTEM MODEL, ASSUMPTIONS, AND METHODOLOGY In the development of our joint space-time registration model, we use the data collected at the campus-wide wire­less local network of Dartmouth College [6].
Relationship: neutral
Domain: Networks
Sentence 1: For example, an attacker may: (i) combine broad bandwidth and higher LifeTime to increase attack e.ectiveness; (ii ) distribute more zombies around the net­work to avoid attack source detection; (iii ) exploit more bad pre.xes in order to make any countermeasures even more complex to deploy.
Sentence 2: by increasing either the overall attack bandwidth or the Interest LifeTime, routers start to be unable to correctly handle incoming tra.c and all the connections are signi.cantly slowed down.
Relationship: neutral
Domain: Networks
Sentence 1: Within the IP-level topology and without alias resolution, ams1.he.net was inferred to be di.erent nodes of degree 218, 194, 178, 189, 136, where some of the IPv6 interfaces corresponded to address space other than that owned by HE.
Sentence 2: if the router follows the IPv6 protocol [9], it will subsequently send (induced) fragmented echo replies to our hosts.
Relationship: neutral
Domain: Networks
Sentence 1: In order to reduce the po­tential for processor overloading, a small 5-packet FIFO is attached to the snoop interface, allowing for snoop message drops in the event of microprocessor overloading and quick 4BCP source code is publicly available online at http://anrg.usc.edu/~scott/  returns from radio snoop events.
Sentence 2: volcano rout­ for a centralized maximum-weight-matching algorithm al­ing was evaluated only via idealized simulations and is not lows any tra.c within the network s capacity region to be based on any theoretical framework; in particular, because scheduled stably.
Relationship: neutral
Domain: Networks
Sentence 1: We determine the message cost c of each individual line to pick the execution with maximum cost.
Sentence 2: the lifetime TTLi case arises for example in Figure 4 when t moves along the of a TFP t i depends on the value of i. Wegiveconstraints dashed path, such that the publish algorithm is triggered at on the value of TTLi while proving the correctness of MLS.
Relationship: neutral
Domain: Networks
Sentence 1: When the rate granularity is 1Mbps, the corresponding set of rate is {1Mbps,2Mbps,3Mbps,L,64Gbps} .
Sentence 2: rose, Traffic Modeling of Variable Bit Rate MPEG Video and its Impacts on ATM Networks, Ph.D. thesis, Wurezburger, Bericht, 02/97.
Relationship: neutral
Domain: Networks
Sentence 1: The Berkeley IRAM [12] and Stanford Smart Memory system [13] both use a crossbar to interface a single gen­eral purpose programmable RISC PE to an array of memory banks, targeting the high bandwidth that crossbars provide.
Sentence 2: architecture Con.guration and Application Compilation top(float* B, int n) sqrtArray(float* B, int n) { { for(i=0; i<n; i++) B[i] = sqrt(B[i]); } sqrtArray(B, n); addArray(B, n); } addArray(float* B, int n) { for(i=0; i<n; i++) B[i] += 2.0; }  Figure 5: Original C Implementation of a Simple Array Processor Consider that we need to implement an array processor that v calculates f (A)= A +2.0: A .
Relationship: neutral
Domain: Networks
Sentence 1: In the topology given in Figure 11, for a user in reference sector 0a,sectors 1cand 2bare primary interferers, while sectors 3b,4a,5a,and 6c are secondary interferers.
Sentence 2: it pays to schedule users on the periph­ery when few neighboring BSs are active, and schedule users in the center when many surrounding BSs are active.
Relationship: neutral
Domain: Networks
Sentence 1: 2, each curve decreases as the number of level increases when the Nash Equilibria are 1.2 Nash Equililbrium  reached.Note that as the level of the network increases, the curve decreases slowly because more nodes will tend to join the game and attract multiple nodes of lower level , which have smaller amount of bandwidth requirement.
Sentence 2: we have to determine the maximal utility of the nodes hop-by-hop from the root to the leaf.
Relationship: neutral
Domain: Networks
Sentence 1: and · · · · · · dr 1 2 2 2 2 2 2 = m m rm r when m f .
Sentence 2: to enable indoor location-based services (ILBS), there are several stringent requirements for an indoor localization system: highly accurate that can dif­ferentiate massive users locations (foot-level); no additional hardware components or extensions on users smartphones; scalable to massive concurrent users.
Relationship: neutral
Domain: Networks
Sentence 1: In fact, the appearance of the FMC has spawned a whole cottage industry of daughterboard design for various DSP applica­tions.
Sentence 2: the high number of logic slices available on the WARP FPGA make it a good candidate for very constrained real-time signal pro­cessing applications, such as distributed MIMO [4] or mas­sive MIMO [17].
Relationship: neutral
Domain: Networks
Sentence 1: This con.rms that the upper bound for the number of MSs that can share a slot is bounded to 8 if we plan to exploit MIMO techniques available at each MS. We can also observe that when 2 MSs with one antenna share an OFDM slot for transmission, the SIR value remains close to the threshold ß, conformingtothe C-SMspeci.­cations in WiMAX standards [1].
Sentence 2: since each MS receives di.erent SIR values for each transmission, we calculate SIR of required signal at each antenna of the BS, and plot the average SIR across all antennas observed at the BS.
Relationship: neutral
Domain: Networks
Sentence 1: To improve the system robustness to link failures and packet loss, we can augment this basic double ruling scheme by using multi­path routing.
Sentence 2: we show in Section 5 that this simple property is enough to guarantee that the overall effort spent in the aggregation for nodes other than the one of minimum weight is O(T log n),where T is the cost of a minimum spanning tree connecting the hot nodes.
Relationship: neutral
Domain: Networks
Sentence 1: by the following expression: 2 · 4 · 2i · .= O(2k)= i=k O(|st|) where the factor 2 is due to going to each of the virtual points and returning to s, 4 is due to the fact that there are 4 virtual points, 2i is due to the maximal distance of the virtual points from s, and .
Sentence 2: their solution is not easily adapt­able to dynamic mobile settings.
Relationship: neutral
Domain: Networks
Sentence 1: As Figure 8 illustrates, a = 0 is always a .xed point of the a-reply application, and it is the only one when p is too high, in which case either the economy on the subscription price is not enough to compensate for the aversion to trans­fer, or the o.ered connectivity is too low.
Sentence 2: in that case, the situation where a pure cellu­lar coverage is chosen does not occur anymore: as soon as the provider can expect a strictly positive bene.t, then he chooses to o.er the two options transfer and no transfer with prices p and p respectively around 3.5and 5.
Relationship: neutral
Domain: Networks
Sentence 1: Theorem 2 If the total number of bytes serviced from any back­logged queue is S over n scheduling intervals and the quantum allocated for the queue is Q, |S -(Q·n)|<Pmax ·n Hence, in the worst case even if the random number generator is completely misbehaving, the loss in bandwidth for any backlogged queue is less than one packet for each round of scheduling.
Sentence 2: if the variation in the rates is high, then the delay bound becomes really large.
Relationship: neutral
Domain: Networks
Sentence 1: It then sends binding update to the MAP­HMR as well as its HA.
Sentence 2: 3.5 Intra­NEMO and Inter­NEMO Network Handoff (Network Mobility) The intra­NEMO network handoff refers to the situation that a HMR with its mobile network moves to a new network which is still a part of the original nested mobile network.
Relationship: neutral
Domain: Networks
Sentence 1: Recalling the constraints shown in (6a) and (6b), we .nd that .ow table constraint is more di.cult to meet than the link capacity constraint, since the max overhead of the update process comes from the stage II of each step when the new .ow entries have been added to the switches.
Sentence 2: sortedSeq and RandSeq complete the update with almost the same number of steps, but considering update success rate shown in Fig.
Relationship: neutral
Domain: Networks
Sentence 1: BEk is the bandwidth used by the best e.ort tra.c on link k. 3.2.4 Unreserved link bandwidth for a traf.c class Let UBck denote the unreserved link bandwidth for a traf­.c class c on link k, then UBck = UBk - .Tk .
Sentence 2: in long-distance wireless net­works, since a node always has multiple radios, DSR cannot be used directly.
Relationship: neutral
Domain: Networks
Sentence 1: 03: Push amount of y =min{e(u),cap(u, w)} through arc (u, w) by sending a message to the cell associated to w 04: e(u)= e(u) - y; e(w)= e(w)+ y;update cap(u, w).
Sentence 2: de.ne PCR thenumberofvacancies in R as VR = i=1 aivi.if a region only covers part of the cell i,the num­ber of vacancies contributed by the cell i will be aivi.This de.nition spreads the vacancy in cell i uniformly on the area of a cell, thus it has the property that the number of vacancies in a union of disjoint regions will be the sum of vacancies in individual regions.
Relationship: neutral
Domain: Networks
Sentence 1: One approach is to .nd a routing scheme that minimizes the total power consumed by all nodes, e.g., [23], [3], [19], [25].
Sentence 2: speci.cally, we investigated the single-recipient model, and showed that the single-topology broadcast problem is NP­hard, while for the multi-topology version we established an e.cient optimal solution, which implies an interesting twist of di.culty compared with the standard model.
Relationship: neutral
Domain: Networks
Sentence 1: We also discuss the practical implications of our results to wireless ad hoc and sensor net­working: (1) using r-nearest cycle as a basis for optimizing transmission power and latency, and (2) using tilted torus to estimate the time-to-live values of packet delivery in op­portunistic forwarding.
Sentence 2: lovasz s formula only applies to connected graphs, while in our case we consider a disconnected graph with dis­joint identical tilted tori.
Relationship: neutral
Domain: Networks
Sentence 1: Results: Figure 15 shows that the intelligent traf.c duplication in Scout improved the overall TCP throughput by 55% over No-DUP, because whitespace links (like all other links) can experience oc­casional outages and the ability to divert traf.c to alternate paths should always improve performance.
Sentence 2: the prior designs focus on how to ef.ciently utilize the slow satellite downlink with a relatively fast feedback path [14, 15].
Relationship: neutral
Domain: Networks
Sentence 1: Regarding the resources in the Iub, a separate timeslot must be used to transport the multicast data to each multicast receiver.
Sentence 2: there are several proposed schemes providing IP multicast routing over wired networks such as Protocol Independent Multicast (PIM), Multicast over Open Shortest Path First (MOSPF), Distance Vector Multicast Routing Protocol (DVMRP) and Core Based Tree (CBT) and Border Gateway Multicast Protocol (BGMP) [3].
Relationship: neutral
Domain: Networks
Sentence 1: Note that we can run over all elements of the star by run­ning the parameter .in (8).
Sentence 2: assume that the presence or abscence of a direct radio link between them depends on the (random) distance r. To capture this dependence at a general level, let us say that the probability of having a link between A and B is f(r), where 0 = f(r) = 1is a given function.
Relationship: neutral
Domain: Networks
Sentence 1: To characterize mobile traf.c and design new protocols and services that are better tailored to the mobile environment, we would like a framework that allows us to intercept and potentially modify traf.c generated by mobile devices as they move with users, regardless of the device, OS, wire­less technology, or carrier.
Sentence 2: once packets arrive at a Meddle server, we use a variety of middlebox approaches to interpose on mobile-device traf.c.
Relationship: neutral
Domain: Networks
Sentence 1: The full attack holds as long as these t members form the update group O (see section 3.3 above), and it holds regardless of what indices these players hold.
Sentence 2: since there is no established se­quence or order in which the members in O take part in the secret share update procedure, the adversary can wait until each member in O except of Mb distributes their shares of the random update polynomials dj, j. O{Mb}, before dis­tributing the shares of his polynomial db(z)as the last one.
Relationship: neutral
Domain: Networks
Sentence 1: To understand the above factors better, in Section 2, we provide detailed arguments for the speci.c bene.ts enabled when using a receiver-centric transport protocol for mobile hosts in a wireless environment.
Sentence 2: reliability is still the role of the sender, and hence the receiver needs to periodically send back ACKs (CACK and SACK) to inform the sender of its buffer state.
Relationship: neutral
Domain: Networks
Sentence 1: As results of sensing, when some vacant and avail­able frequencies/time slots exist in a system, users tempo­rally utilize the frequencies and time slots.
Sentence 2: we can see that the proposed neighbor discovery that uses CLCR by which the widest cov­erage wireless system of WS[C] is used has higher connec­tivity rather than the uncontrolled neighbor discovery that uses an active wireless system of the terminal only, which has a quite limit connectivity among terminals.
Relationship: neutral
Domain: Networks
Sentence 1: Even when RTO is avoided, the congestion window is reduced as a result of the shrinking number of bytes-in-.ight with each re­ 45000 turning ACK, as illustrated by the bytes-in-.ight graph in Figure 8.
Sentence 2: the paper is structured as follows: in Section 2 we brie.y de­scribe relevant work related to TCP and describe our lab environ­ment in Section 3.
Relationship: neutral
Domain: Networks
Sentence 1: Pure IP multicast is also compared using the same RP and Group(CD) settings.
Sentence 2: (95%CI) (in µs) COPSS Hybrid-COPSS 1st Hop 2778.14(579.13) 2860.21(592.49) Internal Unicast 2679.05(575.13) 34.71(3.04) Rendezvous Point 2749.33(572.32) 2804.65(574.47) Internal Multicast 82.76(5.60) 33.18(2.90) Last Hop 83.26(6.10) 140.65(5.79) Table 2: Performance in Single Domain Scenario Type COPSS Hybrid COPSS IP Multicast Update Latency (ms) 80.79 71.36 65.45 Network Load (GB) 116.28 207.95 265.31 Edge Tra.c (GB) 30.05 85.42  router and the internal multicast take less time due to the simpler ST lookup in COPSS.
Relationship: neutral
Domain: Networks
Sentence 1: When a SAM-enabled AP has announced an access threshold K, all CCMA and CSMA stations contend for the .rst transmission opportunity using the standard mechanism as de.ned by the 802.11 MAC.
Sentence 2: since SAM uses a block-based decoding strategy (Section 3.3), it is pos­sible to exploit pipeline parallelism to chain-decode.
Relationship: neutral
Domain: Networks
Sentence 1: Applying the Greenshield s model in this context, the tra.c .ow rate linearly depends on the packet density (K).
Sentence 2: the operation of HMIPv6 consists of the following steps: (i) the mobile node obtains the global address of the MAP from the router advertisements by using MAP discov­ery procedure, (ii) duplicate address detection is done by exchang­ing message NS (iii) A change in the advertised MAP s address is to be noti.ed to the HA and correspondent nodes by sending bind­ing updates.
Relationship: neutral
Domain: Networks
Sentence 1: De.ne I(w, rw)to bea restriction ofin­stance I where the only descriptor originated is rw at node w. For each, de.ne the corresponding SPP instance S(I,w,rw) as described below, and let S(I) be the set ofSPP instances corresponding to all the possible restrictions of I. Letthe setofpermittedpaths in S(I,w,rw) be P(I,w,rw) = {P |r(P, rw)= Ø}.
Sentence 2: we extend the path descriptor r, following [5], to include a level at­tribute g(r).
Relationship: neutral
Domain: Networks
Sentence 1: After completely receiv­ing a page, a node advertises the availability of the newly received page, and may transmit the corresponding packets upon request.
Sentence 2: 4.3 Mitigating DoS Attacks against Sig­nature Packets All the previous secure code dissemination schemes [8, 10, 17] as well as Seluge use a signature to bootstrap the authentication of a code image.
Relationship: neutral
Domain: Networks
Sentence 1: Adaptive, Direction-Aware Data Dissemination for Diverse Sensor Mobility Azzedine Boukerche Dionysios EfstathiouSotiris Nikoletseas PARADISE Research University of Patras, Greece Research Academic Computer Laboratory, eustathi@ceid.upatras.gr Technology Institute (CTI) and University of Ottawa, Canada boukerch@site.uottawa.ca  ABSTRACT We consider sensor networks where the sensor nodes are at­tached on entities that move in a highly dynamic, heteroge­neous manner.
Sentence 2: in realistic scenarios nodes will change mobility roles.
Relationship: neutral
Domain: Networks
Sentence 1: The costofWiFi scales better per user thanthelinearcostsof purchasingcellularaccessforevery users.
Sentence 2: if ri and rj are both not destined to X: (a) Set U(ri)= P (ri)·QX (ri) and U(rj )= P (rj )· QX (rj ) (b) Return web page with higher utility.
Relationship: neutral
Domain: Networks
Sentence 1: ..0, .. where .. is the speed of light in the medium, ..0 is the trans­mitter s center frequency, .. is the speed of moving object and .. is the angle between signal direction and the direction of moving object.
Sentence 2: the basic idea of MoveLoc is detecting the Doppler shifts re.ected o. moving object and mapping from the shifts to the angle of arrival (AoA) using di.erent directional antennas though beacons.
Relationship: neutral
Domain: Networks
Sentence 1: When a RREQ copy at an intermediate node creates or updates a reverse path, and the intermediate node has no valid path to the destination, the RREQ copy is re-broadcasted provided it is the .rst copy that yields a reverse path; this is somewhat similar to basic AODV where only .rst copies of RREQ are forwarded to prevent looping during the .ood.
Sentence 2: a Link-Layer Tunneling Mechanism for Unidirectional Links.
Relationship: neutral
Domain: Networks
Sentence 1: Once nodes belonging to the smallest cluster were elected as CH nodes, the last CH node informs the BS that no other node can be elected as a new CH.
Sentence 2: the approacch cconsists to classsify dynamicaally nodes intoo clusters wheere ccoordinators noddes with extra pprivileges are abble to manipulaate mmassages, aggreggate data and ennsure transmissioon between noddes aand the BS acccording to TDMMA and CDMAA schedules.
Relationship: neutral
Domain: Networks
Sentence 1: In this case, we observed that the amount of additional bulk traf.c is roughly half of what is sent with bandwidth-aware routing, thus justifying the need for bandwidth­aware traf.c engineering in NetEx.
Sentence 2: in fact, we found that NetEx .ows occasionally experience periods of very poor perfor­mance that would be unacceptable for many latency-sensitive, in­teractive applications.
Relationship: neutral
Domain: Networks
Sentence 1: Numerous algorithms have been proposed that select items to forward based on context or social knowledge to enhance the dis­semination [5, 6, 10, 24].
Sentence 2: the links in­between nodes in each cluster, and links between bridging nodes, are modelled by a two state Markov link model [11], with an ex­pected contact duration of 60 seconds and inter-contact time of 240 seconds.
Relationship: neutral
Domain: Networks
Sentence 1: Choosing nd = n and sn nd vv sn = 3log n/ n, the proposed system can accommodate a total of v nE v (6) 3log n sources without using one comb for multiple .ows.
Sentence 2: we propose to use a majority rule, which can provide a high multicast rate (on the same order of the capacity upper bound) to a majority of users if we are allowed to sacri.ce an arbitrarily small percentage of users in overcrowded areas.
Relationship: neutral
Domain: Networks
Sentence 1: For trace POLITO we have only the information of unknown tra.c that results to be lower than the other two traces for the TCP case (most hosts on the network use only stan­dard applications such as web and email).
Sentence 2: in the POLITO-GT trace, in which this phenomenon is more evident, the unclassi.ed tra.c drops from 55.29% (N = 2) to 13.37% (N = 50) and leads almost entirely to misclassi­.cations, whose value grows from 3.84% (N = 2) to 45.35% (N = 50).
Relationship: neutral
Domain: Networks
Sentence 1: Hedera[2]and MicroTE[5]advocate .ne-grained traf.c engi­neering over a .xed topology to alleviate congestion.
Sentence 2: alleviating the straggler provides only 20% gains, reducing CTD to 40 s. Note that there is room to spare on the .yway; the demand from A toB completes after 33.3s, 6.7s before traf.c from C G. Our datasets indicate that this is quite common; very few of the ToR pairs on hot links require substantial capacity.
Relationship: neutral
Domain: Networks
Sentence 1: Given that the delay performance was found to be equivalent in both network coding approaches, implicit acknowledgement will have an overall better per- Figure 12: Average power consumed by node vs number of packets in an 8-node network, transmit­ting 10 packets using optimal power calculation and Psource =0.2 formance.
Sentence 2: the fact that the signal attenuation and the noise power depend on Figure 3: Network coding example: wireless sce­nario.
Relationship: neutral
Domain: Networks
Sentence 1: To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior speci.c Shriram Krishnamurthi Brown University sk@cs.brown.edu cgroups [1] organize processes in trees to express and control the sharing of memory, CPU, and I/O bandwidth, and the Cinder op­erating system [13] uses a hierarchy to control the sharing of bat­ tery resources among smartphone applications.
Sentence 2: hFT allows policy authors to state high­level, declarative policies that are agnostic to network topologies and capabilities.
Relationship: neutral
Domain: Networks
Sentence 1: One oftheprimary challenges withthedesign andimplementation of theTransit Portal is to manage the limited set of resources across mul­tiple downstream virtual networks.
Sentence 2: we provide an outline of the demonstration, which will consist of threeparts:(1) showing how clients can useTransitPor­tal to achievetransparent upstream connectivity;(2) showinghow virtual networks that use Transit Portal can take advantage of IP routing to respond tofailures andbalance traf.cloads;(3) showing the example applications that wedescribed inSection2.
Relationship: neutral