sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: The NP-hardness of MAX DICUT follows from the observation that the well-known undirected version of MAX DICUT the maximum cut problem (MAX CUT),which is on Karp s original list [11] of 21 NP-complete problems reduces to MAX DICUT by substituting each edge for two oppositely oriented arcs.
Sentence 2: a 1-disk graph is referred to as unit-disk graph (UDG).
Relationship: neutral
Domain: Networks
Sentence 1: A local placement order ( local order for short) (Si+1, ··· , Si+j ) is an order of some neighbor nodes in S,and its place­ment spacing is D(Si+1 ··· ,Si+j ) ( Si+1Si+2 , ··· , Si+j-1Si+j ).
Sentence 2: these .ndings provide valuable in­sight for the placement of BRs for barrier coverage.
Relationship: neutral
Domain: Networks
Sentence 1: Energy-Efficient Opportunistic Topology Control in Wireless Sensor Networks Jian Ma, Qian Zhang, Chen Qian, and Lionel M. Ni Department of Computer Science and Engineering Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong {majian, qianzh, cqian, ni}@cse.ust.hk  Abstract Topology control has been proposed as a promising technique to achieve energy-efficiency in wireless sensor networks (WSNs).
Sentence 2: when network topology is modeled as a connectivity graph in which each wireless link is either connected or disconnected, the energy-efficient topology control problem can be formulized as the minimal connected dominating set (MCDS) problem.
Relationship: neutral
Domain: Networks
Sentence 1: The set of streams is denoted by [n]= {1,... ,n}and the set of servers is denoted by [m]= {1,... ,m}.
Sentence 2: in fact, we have explicitly shown that the sel.sh routing in such queueing systems can lead to an arbitrary large delay even when the total injected load can potentially be served by a single server.
Relationship: neutral
Domain: Networks
Sentence 1: The simulation parameters are summarized in the following table: Table1, Simulation Setup Parameters Values Simulation Time 200s Number of vehicles 60 Simulation Area 2000m x 2000m Transmission range 100m , 250m Movement speed 5m/s 40m/s Traffic Type CBR Based on the parameters presented above, we simulate two scenarios one with a transmission range of 100m and the second with a transmission range of 250m.
Sentence 2: the detailed description of MAGF scheme is provided in section III.
Relationship: neutral
Domain: Networks
Sentence 1: INTRODUCTION The Datagram Transport Layer Security (DTLS) protocol [7] has been introduced by the IETF to provide secure communication be­tween two peers, in the presence of unreliable datagram protocols This work was carried out during the tenure of an ERCIM Alain Bensoussan Fellowship Programme.
Sentence 2: the GC should provide the joining node with the GSA through a secure communication channel.
Relationship: neutral
Domain: Networks
Sentence 1: It is known that in the 802.11 unicast mode, packets are immediately acknowledged by their intended next-hop nodes; if no ACK message is received, the 802.11 MAC layer will retransmit the packet a number of times (with exponential backo.)
Sentence 2: the throughput of FUN-2 is higher than or equal to that of FUN-1.
Relationship: neutral
Domain: Networks
Sentence 1: Unlike conventional fat-tree like topolo­gies with multiple stages or recent designs using high-radix routers to reduce the network diameter [10], we propose an architecture based on a single-stage regular topology that avoids the complexity and cost of multiple stages, while be­ing able to scale to tenths of thousands of servers.
Sentence 2: we observe a degraded throughput of the SH approach that is always far from reaching the ideal through­put of the FC network.
Relationship: neutral
Domain: Networks
Sentence 1: The con.guration of a uniform grid is given by 3 parts: the top-left corner location (8 bytes), the side length of each square grid cell (4 bytes), and the number of grid cells in the horizontal/vertical direction (1 byte).
Sentence 2: for each point ri, we apply a bit-wise AND operation to its bitmap bmpi and the value of operation 1 << (k - idx - 1).
Relationship: neutral
Domain: Networks
Sentence 1: The other is that the proposed scheme needs additional signaling messages between MAGs and should compute Diffie-Hellman variables (gx and gy).
Sentence 2: permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page.
Relationship: neutral
Domain: Networks
Sentence 1: The average hop counts per route of TATR were less than that of LAR.
Sentence 2: reactive protocols, such as Ad-hoc On-Demand Distance Vector routing (AODV) [6], Dynamic Source Routing (DSR) [10], and Temporally Ordered Routing Algorithm (TORA) [9], delay route discovery until a particular route is required, and propagate routing information only on demand.
Relationship: neutral
Domain: Networks
Sentence 1: If the ISPs decide to peering with cAB = .0 which is of the high level, the cost matrix is as Table IV, both BK peering and paid peering by Nash bargaining are BNE strategies.
Sentence 2: paid peering by Nash bargaining in this case can be better off than no peering, and it is the At last, we have the following corollary.
Relationship: neutral
Domain: Networks
Sentence 1: Then attackers attempt to .nd out the network address IPd of ud who hap­pens to have a critical role in the MANET.
Sentence 2: log2(L) + log2(2ß - s(3) s(5) l + 1) = APd = log2(L) + log2(2ß - 1) and 0 = APd = s(5) s(4) s(3) log2(L - 1).
Relationship: neutral
Domain: Networks
Sentence 1: 3.4 In-network Filtering The channelization approach does not allow for the possi­bility to prune unnecessary messages within each channel.
Sentence 2: the ISPs will provide the middle­ware with the characteristics of the virtual links connecting virtual switches such as latency or bandwidth as well as a speci.cation of the capabilities of the virtual switches like .ow table sizes, supported actions (e.g., address re-writing, IPv6 support), fast matching capabilities on certain tuples of header .elds, etc.
Relationship: neutral
Domain: Networks
Sentence 1: 1(a), (b) and (c), respectively, where si (i = 0, 1, , K) is output of encoder and modulator to be transmitted over layers.
Sentence 2: 2.1 Conventional Mapping Rules Here, we exemplify a mapping scheme with one or two codeword streams, linking to 2, 3 or 4 MIMO layers, alternatively.
Relationship: neutral
Domain: Networks
Sentence 1: {0, 1, 2}3.For ease of reference, we also treat [L(RUX ),L(RUY ),L(RUZ )] as an integer (in tierary representation) id = L(RUX ) · 32 + L(RUY ) · 3+ L(RUZ ) .
Sentence 2: (srcPrt(*),dstIP(*)) [1,3] [0,2.2] [48,144] [0,3.6] 445: Microsoft-DS 1 dstPrt(593).
Relationship: neutral
Domain: Networks
Sentence 1: Therefore, the above bounds simplify to: dmin -2 = OCSP(G)= dmin -1 if dmin = d(G * );  dmin -1 = OCSP(G)= dmin if dmin < d(G * ).
Sentence 2: n 2 in G ' or |Cw,m and v = w. Since for a graph G of |V| nodes and |L| links, |Cv,w | = 2 can be tested in O(|V|+ |L|) time6, the overall test takes O(s2(|V|+ |L|)) = O(s2(µ+ s)2)time.
Relationship: neutral
Domain: Networks
Sentence 1: However, the turnover ratio of Fopt decreases as it only focuses on the absolute speed of each node and ignores the relative change on the neighbors.
Sentence 2: however there is still a small part of the curve in the valid region, and the minimum cost will be obtained at Rk+2 according to the theoretical analysis, therefore fk+2 is assigned with the maximum value fmax.
Relationship: neutral
Domain: Networks
Sentence 1: [7]Ieee802.11e mediumaccesscontrol(mac)qualityof service(qos)enhancements,January2005.
Sentence 2: inFigure9weshowtheaveragegoodputresultsforsmallerMACPDUsizeof228Byte(includingthe28bytesaddedbytheIEEE802.11MAClayer).SuchpacketsoccurforexampleinVoIPstreamsencodedaccordingtoG.711withabitrateof64kbps.NotethatweonlyshowtheperformanceoftheoptimumswitchingBERsagainincaseof802.11DYN.Clearly,802.11DYNoutper­formsthelegacyschemesigni.cantlyforanSNRrangebetween4and28dB.theperformancedifferenceismuchsmallerthaninthecaseofthelargepacketsastheoverallaveragegood­putismuchsmallerforthesesmallpacketsizes.InFigure10weshowthecorrespondingresultsforthesingle-user802.11DYNmodeversuslegacyIEEE802.11awithoutRTS/CTS(againshow­ingthecon.denceintervalsonlyfor802.11DYNwhiletheonesforthePHYmodesofIEEE802.11aarebelowonepercentoftheaveragegoodputperSNR;thesameappliestoFigure9).Incaseof SNR [dB] Mode 1 Mode 5 Single-User Mode 2 Mode 6 802.11 DYN Mode 3 Mode 7 Mode 4 Mode 8  Figure 10: Goodput comparison of the single-user 802.11 DYN mode and the eight legacy IEEE 802.11a PHY modes without RTS/CTS handshake for various different SNR levels and a MAC PDU size of 228 Byte.
Relationship: neutral
Domain: Networks
Sentence 1: While small failures that impact individual nodes in a testbed can be addressed in an opportunistic fashion, and often allow experimenters to ignore such nodes for small periods of time, failures in our system lead to unhappy users and often required us to quickly detect and repair such oc­currences.
Sentence 2: given the dominance of HTTP tra.c (Table 3), it is natu­ral to expect that various forms of caching and compression techniques to be greatly bene.cial.
Relationship: neutral
Domain: Networks
Sentence 1: Thereby,beacons from farther distances maybe received.
Sentence 2: due to this reason, the authors of D-FPAV introduce so called extended beacon messages, which are piggybacked every n beacon messages andcontain the list of thepositions of all vehicles located inside CSAmax (v)as estimatedby ve­hicle v. How often extended beacons have to be sent and whether including all vehicles inside CSAmax (v)is crucial is subject to a trade-o.between desired estimation accuracy and acceptable extra communication e.ort.
Relationship: neutral
Domain: Networks
Sentence 1: Thatis, L = {d,u,o}× Z+ .. edge head node type identi.er The setof signatures contains route attributesthat are either used to determine a route s preference or to determine how it is propa­gated.
Sentence 2: _______________________________ _ SM if we compose our new algebra A as a lexical product of a set of algebras Ai where A1 is strictly monotonic, then A will alsobe strictly monotonic.
Relationship: neutral
Domain: Networks
Sentence 1: Number of tests 100 80 60 40 20 0  80 60 40 20 0100 20 0  0 4 8121620 0 4 8121620 0 4 8 121620 0 4 8121620 Hour of the day (local time)Hour of the day (local time) Hour of the day (local time)Hour of the day (local time) (a)Comcast(USA)(b)Cox(USA) Figure 3: Result sets grouped by the hour of the day for Comcast and Cox: BitTorrent.owswereblockedatalltimesoftheday.
Sentence 2: bysendingforgedTCPreset(RST)packetstotheendhosts.Thesereportsofblockingsparkedanintenseandwide-rangingpolicyde­batebetweenISPs,consumeradvocacygroups,websiteoperators,andgovernmentagenciesonacceptableISPtraf.cmanagementpracticesandnetworkneutrality[5].todate,enduserslackaccesstomeasurementtoolsthatcandetectwhethertheirac­cessISPsareblockingBitTorrenttraf.c.Asaresult,nooneknowshowwidelyBitTorrentisblockedinthecurrentInternet.
Relationship: neutral
Domain: Networks
Sentence 1: Define the slacks as S =0.5 -V, and S=0.5 -V. We insert dummy null frames X XYY Øinto the buffers at nodes 1 and n, so that nothing is transmitted during a slot when only a null frame comes up in the buffers (more detailed discussion of null frame can be found in the section, formal description of PNC frame-forwarding mechanism , below).
Sentence 2: the amount of bidirectional traffic at the aggregate level is min( ij, , ji , ) and they can leverage PNC.
Relationship: neutral
Domain: Networks
Sentence 1: Wk is a k-stage Erlang random variable with mean E[W]=2.ke and a is given by: 4.ne 2n a == > 1 E[Wk] k It is easy to see that P(Wk > 4.ne) .
Sentence 2: to simplify discussion, we initially assume nodes are syn­chronized on phase boundaries and relax this assumption later.
Relationship: neutral
Domain: Networks
Sentence 1: While HDR has the potential to provide anywhere always-on wide-area wireless Internet access, its peak down­link data rate of 2.4Mbps is relatively low compared with IEEE 802.11b links.
Sentence 2: iEEE 802.11b interfaces work in the license-free 2.4GHz ISM frequency band and provide data rate up to 11Mbps.
Relationship: neutral
Domain: Networks
Sentence 1: OpenFlow has been de­ployed at various academic institutions and research labora­tories, and has been the basis for many recent research pa­pers [1, 13], as well as for hardware products from vendors such as NEC, Arista, and Toroki.
Sentence 2: this requirement does not mean that the con­troller s .ow-awareness should start with the initial setup of every .ow.
Relationship: neutral
Domain: Networks
Sentence 1: Previous studies of Internet application mix found HTTP to pre­dominate around the turn of the century.
Sentence 2: we can attribute more than 82% of HTTP traf.c to tradi­tional Web browsers, with Firefox and Internet Explorer each hav­ing a share of approximately 35% each, while Safari and Opera only contribute 6% and 3% of HTTP traf.c.
Relationship: neutral
Domain: Networks
Sentence 1: For each node, the error in both the skew and offset derived from these updates would be primarily determined by the number of hops between the node and the base station, since there would be nondeterministic delays for each hop.
Sentence 2: as n gets larger, the breakdown point gets closer to 0, meaning that a very small fraction of contaminated data can cause the estimation to get far from the real value.
Relationship: neutral
Domain: Networks
Sentence 1: Should the other party run a UDP variant of the BT protocol on the advertised port, it will abort parsing the unknown message and silently drop it (in fact, since there is a lot of questionable software around in the BT cloud, most implementations are hardened to deal with all kinds of broken, garbled or unexpected messages).
Sentence 2: invalid results are entries which we get for the queried key from the DHT which are di.erent from the values we pub­lished.
Relationship: neutral
Domain: Networks
Sentence 1: It can select suit­able parent as exchange path advertisement and response.
Sentence 2: table 1: Sending candidate relay information Events Description New relay join Detecting changes of multicast tree Relay leave Detecting changes of multicast tree Relay failure Detecting changes of multicast tree Solve inversion Detecting changes of multicast tree Periodic update When receipt check information at root relay is full Figure 2 shows a restructuring partial multicast tree method.
Relationship: neutral
Domain: Networks
Sentence 1: Our ns-3 [4] simulations, with workloads representative of datacenter applications, show that FlowBender substan­tially reduces the mean and tail latency compared to ECMP, while achieving performance very similar to that of other expensive or undesirable schemes like DeTail and RPS.
Sentence 2: we use the default TCP re-ordering threshold of 3, and monitor the out-of-order delivery num­bers to ensure that FlowBender does not introduce undesired CPU (processing) overhead.
Relationship: neutral
Domain: Networks
Sentence 1: In sum­mary, while the current ECN speci.cation enables routers to mark data packets, ECN+, when enabled at servers, extends this feature to TCP SYN ACK packets.
Sentence 2: in the absence of any explicit noti­.cation from the network, a TCP endpoint has no other option but to wait for the retransmission timer to expire, and to then re-send the TCP SYN packet.
Relationship: neutral
Domain: Networks
Sentence 1: If we put iProxy closer to clients, the latency is lower and the performance is better.
Sentence 2: when a smartphone is sent a video at a resolution larger than the phone can display, two prob­lems can arise: .rst, the smartphone has to spend a signi.cant amount of time buffering the high-resolution stream compared with using the optimal resolution, which in.ates start-up delays (§5); second, the video cannot be displayed optimally on the screen, which further has an impact on the user experience.
Relationship: neutral
Domain: Networks
Sentence 1: After determining all three OFDM waveform parame­ters, i.e., carrier frequency fc,bandwidth(number of used subcarriers) B, and modulation scheme M, the receiver recon.gures to core receiver and starts recep­tion of the transmitted OFDM signal.
Sentence 2: each CR receiver should synchronize itself to appropriate carrier frequency and identify currently acti­vated subcarriers and corresponding waveform parameters, i.e., applied modulation/coding scheme.
Relationship: neutral
Domain: Networks
Sentence 1: ACM Classification Keywords C.2.2 [Computer Communication Networks]: Network Protocols Routing protocols.
Sentence 2: vehicle D is unable to see the brake lights of vehicle B because the view is blocked by vehicle C. Without EBW warnings, vehicle D has no time to react to the delayed braking of vehicle C. But with EBW warnings, vehicle D is informed about the braking before the driver of vehicle C has even begun braking, keeping longer braking distance between his vehicle and vehicle C. Another cooperative vehicular safety application is the Vehicle Stability Warning (VSW) application.
Relationship: neutral
Domain: Networks
Sentence 1: Introduction Online Social Networks (OSNs) now attract hundreds of millions of users around the world and represent a crucial place to gather data with countless possibilities of analy­sis, ranging from extracting user habits to in.uencing rec­ommendation systems.
Sentence 2: we wanted to answer the following question: is the probability of a user to be connected at a given time impacted by the fact that her friends are also connected at this particular time or are these two independent events?
Relationship: neutral
Domain: Networks
Sentence 1: [2] A. Shamir, Identity-based Cryptosystems and Signature Schemes, in Proceedings of CRYPTO 84 on Advances in cryptology, LNCS 196, Springer-Verlag, 1984, pp.
Sentence 2: we propose a new security scheme to prevent the attacks of malicious nodes in which, having considered the computational cost, we employ the techniques of hash chains and elliptic curve cryptography [13] to ensure security and integrity for packets forwarding.
Relationship: neutral
Domain: Networks
Sentence 1: The BGP routing change might have been triggered by an external event, such as a policy change or a failure in another AS, that caused pto be withdrawn or replaced by a less attrac­tive route.
Sentence 2: although this router has many tunable con.gu­ration options, including OSPF and BGP timers, we do not change the values of any tunable parameters and instead focus on the de­fault con.guration of the router.
Relationship: neutral
Domain: Networks
Sentence 1: Our prototype library uses heuristics that are inexpensive in terms of probes, robust in the face of incomplete information provided by the primitives, and produce good results.
Sentence 2: for example, Jannotti [16] de.nes two router primitives path re.ection and path painting that are used to replicate multicast packets and to create an overlay topology that resembles the underlying network.
Relationship: neutral
Domain: Networks
Sentence 1: As a result, there is an imbalance between the calories burned due to physical activity and those accrued by food intake and this leads to a weight increase.
Sentence 2: [3] H. Kumahara, Y. Schutz, M. Ayabe, M. Yoshioka, Y. Yoshitake, M. Shindo, K. Ishii, H. Tanaka, The use of uniaxial accelerometry for the assessment of physical-activity-related energy expenditure: a validation study against whole-body indirect calorimetry , British Journal of Nutrition, Vol.
Relationship: neutral
Domain: Networks
Sentence 1: 4.1 Failure Characteristics of Building Blocks of a Network Stamp We .rst analyze the number of failures per device across three types of network elements: Access routers, Ag­gregation switches and Top-of-Rack switches.
Sentence 2: we observe a me­dian link out time of 0.4 seconds/km and a 95P value of 5.9 seconds/km for the latter and 26.7 seconds/km for Percentage of Devices 1.00 0.75 0.50 0.25 0.00  Figure 13: Distribution of the number of ToRs connected to two AGG platforms.
Relationship: neutral
Domain: Networks
Sentence 1: walk msg.T rail) then continue;  (19) /* overcoming most hilltop misconceptions */ (20) highest nbr := q; (21) endforeach; (22) return highest nbr ; Upon getBestHillExit(walk msg) do (23) best exit score := 0; (24) best exit := NULL;  (25) foreach q .
Sentence 2: this means that the nodes 2http://jist.ece.cornell.edu/ Figure 3: The default network characteristics height changes gradually across the network and sharp changes are extremely rare.
Relationship: neutral
Domain: Networks
Sentence 1: Upon completing transmission and receiving ACKs from all in­tended clients, Vj returns to its initial busy state and advances its contention probability according to Eq.
Sentence 2: nEMOx s scalability is higher by more than 2× (with a dAP density of only 3), as it opportunistically leverages spatial reuse and cooperation between dAPs, which are missing in FullCoop and NonCoop, respectively.
Relationship: neutral
Domain: Networks
Sentence 1: In creatingVL., agoal was toinvesti­gate whether we could create a network architecture that could be deployed today,sowelimit ourselvesfrommaking any changesto thehardwareof theswitchesorservers,and we requirethatlegacy applications work unmodified.
Sentence 2: performance isolation inVL.restsonthemathematicsofVLB thatanytrafficmatrixthatobeysthehosemodelisroutedbysplit­tingtointermediatenodes inequalratios(throughrandomization) toprevent anypersistenthot spots.
Relationship: neutral
Domain: Networks
Sentence 1: http://bittorrent.org/beps/bep_0003.html.
Sentence 2: 5.1 Data set WedeployedBTTestonapubliclyaccessiblewebserverathttp://broadband.mpi-sws.org/transparency/bttest.php.Initially,weinvitedahandfulofourcolleaguesandfriendstotesttheirISPs,andweaskedthemtospreadtheinvitationtotheirfriends.Afterthe.rstweek,thesitecaughttheattentionofafewin.uentialblog­gers,andhundredsofnewuserstestedtheirISPseachday.
Relationship: neutral
Domain: Networks
Sentence 1: Due to the presence of speci.c and heterogeneous sensors the cur­rent version of the system does not permit the use of fully automatic con.guration tools.
Sentence 2: the sensors of SINDI-WSN are very heterogeneous: they collect data about light, temperature, humidity, opening and closing doors/windows, user s movements, localization and weight (using load cells under a bed or an armchair).
Relationship: neutral
Domain: Networks
Sentence 1: CLAIM3.2.Exeptwithnegtigibteprobabitity,partiesB1 andG1hattwithinrounds(I)stepsandoutput0inthesys­temS.
Sentence 2: acknowledgments WewouldliketothankOdedGoldreihforpointingouta simplerproofofTheorem5.AndMatthiasFitzifordisus­sionsabout[S].
Relationship: neutral
Domain: Networks
Sentence 1: First, as discussed in §4, applications ensure NEs read and modify only authorized .elds within a message by appropri­ate use of encryption.
Sentence 2: such implicit discovery could also lead to inef.ciencies that arise when an end host discovers their operations are not permitted mid-stream (e.g., because the end host then decides to change paths and so effort has been wasted when compared to up-front negotiation).
Relationship: neutral
Domain: Networks
Sentence 1: A natural question is: if we want only loop freedom (not packet coherence), is there an update procedure that does not rely on updating all nodes before start­ing to use any of the new forwarding rules?1 This is not a technicality, as nodes in a production network can often react slowly, or they may even be temporarily unreachable via the controller [6].
Sentence 2: in our algorithm, each node is in one of three states, old, new, or limbo, depending on whether the node is guaranteed to only use its old rule or new rule, or whether it might use both rules, respectively.
Relationship: neutral