sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: CONFab executes multiple levels of reasoning because it is dif­.cult to model the in.uence of a component on a protocol stack separately without considering its interdependencies with other el­ements.
Sentence 2: voke upper-level behavioral reasoning that abstracts a component as a functionality that provides and requires certain services, i.e., we employ a form of the service-oriented design.
Relationship: neutral
Domain: Networks
Sentence 1: A survey on interference networks: Interference alignment and neutralization.
Sentence 2: with experiments, we Figure 12: FDoS handles heterogeneity gracefully have veri.ed that the impact of the former is more signi.cant than  10 30 25 Rate (bits/sec/Hz) 20 4 2 5 5 0 0 2 3 4 5 6 7 8 9 10 2 3 4 5 6 7 8 9 10 N: # antenna at AP N: # antenna at AP (a) FDoS w rate optimization (b) FDoS w/o rate optimization Figure 13: Scalability and Rate Optimization in FDoS In addition to the homogeneous 2 and 4 antenna cases, we now consider a heterogeneous case.
Relationship: neutral
Domain: Networks
Sentence 1: ForeahREYIcIUYout,defnethefollowingFOformulas: R( x ) := { (x ) : (if (x )thenR(x )) EI} 7R( x ) := { (x ) : (if (x )then-R( x )) EI} XR( x ) := ( R(x )1 -7R(x )) V ( R(x )17R(x )1R(x )) V (- R(x ) 1 -7R(x )1R(x )), where0:=false.Finally,foreverystate5overY,let thefnitestrutureT(T,I)(5)overYIcIUYoutbedefned asfollows: theuniverseofT(T,I)(5)isthatof5,  foreveryRERT(y,r)(S):=XSand YIcI,R,  foreveryRERT(y,r)(S):= S  Yout,R, whereXSand Sdenotetheanswerrelationsofthequeries RRXRand Ron5,respetively.Thisonludesthedefnition ofT(T,I).
Sentence 2: toseeanexampleofanASM'transduerandaUT'spe­ifation,reallsuppandinExample2.Also,verifythat Tt Lemma2remainstrueforASM'transduers.
Relationship: neutral
Domain: Networks
Sentence 1: In our experiments, we use the following heuristics: Greedy algorithm tests all available locations and selects the one with maximal decrease in the objective func­tion[22].Theprocedure repeats until the required number of locations is reached.
Sentence 2: based on the result in Section IV-B2, the difference in end-to-end latency is only modest (23.7% for HSPA), and the throughput difference is even smaller.
Relationship: neutral
Domain: Networks
Sentence 1: These tran­sitions are labeled with their enabling conditions (that can include events generated by other transitions), any necessary reset of the continuous state that must take place when the transition occurs, and events generated by the transition.
Sentence 2: from t0 + RT Tf to t0 +2RT Tf the number of acknowledg­ - 0 )/2-ndrop (which was the number  should be replaced by ments received is 1+wf (t of packets sent in the previous interval) and each will both min{wf ,w adv } f increase the congestion window size and decrease the num­ rf = .
Relationship: neutral
Domain: Networks
Sentence 1: The gap response curve Z, de.ned as the functional relation between the statistical mean of the output dispersion and the input dispersion, is much more dif.cult to penetrate than the .uid curve F. Second, un­like in the .uid case, where both packet-train length nand probing packet size shave no impact on the rate response curve F (rI ), the response curves in bursty cross-traf.c are strongly related to these two packet-train parameters.
Sentence 2: in our future work, we will identify how var­ious factors, such as path con.guration and cross-traf.c routing, affect the amount of deviation between Z and F. We are also interested in investigating new approaches that help detect and eliminate the measurement bias caused by bursty cross-traf.c in multi-hop paths.
Relationship: neutral
Domain: Networks
Sentence 1: [15] T. Harks and T. Poschwatta.
Sentence 2: x Bregman s divergence can be de.ned using F(·) as follows: I {F(ui) - F(vi) - F the natural generalization of the above de.nition would be given as follows: (vi)(ui - vi)}BF(u, v)=  X N n=1 i=1,...,I v¯ (p,FN )i=1 min BFn (u, vn), = arg 0<ui<8 = X I {F(ui) - F(vi) - f(vi)(ui - vi)}.
Relationship: neutral
Domain: Networks
Sentence 1: We record the PRR and the average RSSI/LQI for every group of 100 packets from a grass .eld (Figures 4 (a) and (d)), a parking lot (Fig­ures 4 (b) and (e)) and a corridor (Figures 4 (c) and (f)).
Sentence 2: the trend of ATPC s energy consumption varies a little bit.
Relationship: neutral
Domain: Networks
Sentence 1: The schemeproposedin[4] detects wormhole attacks us­ingdirectionalantennas, that are not commonforWSN.RF­.ngerprinting, i.e., recognizing a wireless transceiver based on unique features of the signals it generates, is considered in[13].
Sentence 2: in our protocol, each node estimates its distance to the other nodes it can communicate with through a single hop.
Relationship: neutral
Domain: Networks
Sentence 1: We can assume that the larger densities give a stronger advantage to our algorithm, since statistic disorders of the network are rare and so the algorithm can behave more as desired, minimizing complica­tions in the routing.
Sentence 2: gRIC combines inertia and the right-hand rule (along with careful use of orientation .ags) to bypass complex (even deep, concave) obstacles by following their contour.
Relationship: neutral
Domain: Networks
Sentence 1: allocatedblocksinmemory.WewishtoknowhowhighL canbewithrespecttoM(ideallytheyshouldbethesame) intheworstcase,andintypicalcases.
Sentence 2: 7.1 Results Forlackofspaceweonlyprovideafewsamplecurvesandthe highlightsofourexperimentalresults.Totestcompressed tries,webuilttwotries.Thefrstisa8/8/8/8trie,andthe secondisa12/4/4/4/4/4trie.The8/8/8/8trietraverses anIPaddress8bitsatatime.Thesecondtrietraverses anIPaddress12bitsatthefrststep,and4bitsateach subsequentstep.ForthefrstsetofIPlookupexperiments, weusedasnapshotoftheMae-Eastdatabase.Thedatabase had42732prefxes.Buildingthe8/8/8/8trierequired74226 allocatesand42731deallocates.Buildingthe12/4/4/4/4/4 trierequired87695allocatesand42731deallocates.
Relationship: neutral
Domain: Networks
Sentence 1: :Foreachl2Sjandi2Fj,dG(i,l): (c 0+2)*al.
Sentence 2: [4]M.Faloutsos,P.Faloutsos,andC.Faloutsos.Onpower-law relationshipsoftheinternettopology.InProceedingsACM SIGCOMM,1999.
Relationship: neutral
Domain: Networks
Sentence 1: The router reads the .rst segment in the header, which corresponds to itself, and inspects the primary next-hop label p. If the corre­sponding link available, the router deletes this .rst seg­ment corresponding to itself.
Sentence 2: 1 0 1 10 10 10 Average stretch - 1 0 0 10 Average stretch - 1 -1 10 -2 10 -3 10 -4 10 Average stretch - 1 10 -1 10 Fast-SlickPackets Flooded-SlickPackets -2 10 e2e-SlickPackets Fast-VSR -3 Ideal-SafeGuard Ideal-NCR 10 -4 -1 -2 10 10 10 -3 -4 10 10 0 10 -5 100 200 300 400 500 0 10 -5 5 10 15 20 0 10 -5 5 10 15 20 25 30 35 Packet generation time (ms) Packet generation time (ms) Packet generation time (ms) (a)Sprint Topology (b)AS-level Topology (c)Router-level Topology Figure 8: Average packet stretch -1 vs. packet generation time when t0 =0.
Relationship: neutral
Domain: Networks
Sentence 1: 3.2.1 Utility function To have a suitable representation of the users social be­haviour, we take inspiration from the caveman model pro­posedbyWatts[17],whichisareferencepointinthe .eld of social behaviour modelling.
Sentence 2: the weight of all other communities is set as in MFV, i.e., is proportional to the average time spentby the nodein that community.
Relationship: neutral
Domain: Networks
Sentence 1: In addition, the throughput could be the main requirement to be satis­.ed, for example, when mobile grid applications have to be supported.
Sentence 2: special attention has been devoted to issues such as heterogeneous networks interconnection, full and fault tolerant coverage of the disaster area, localization to allow an e.cient coordination of the rescue operations and .nally, security which represents one of the major re­quirements for any emergency communications system, in particular when a disaster is due to a terrorist attack.
Relationship: neutral
Domain: Networks
Sentence 1: IP (w/o lookup) 43 cycles TCP Quick-Start (non-critical) 55 cycles Rate Control Protocol (RCP) 26 cycles  As statedin[4], software-levelmodules canonlyprocessa packet for N · F clock cycles, with N parallel processors with an F times higher clock frequency than the system pipeline.
Sentence 2: one can choose a module with the most suitable level of abstrac­tion when implementing a new functional unit.
Relationship: neutral
Domain: Networks
Sentence 1: The malicious relay could conclude deterministi­cally that its predecessor is a if it knew both the tunnel s length l and that (l-1) relays succeed it on the tunnel.
Sentence 2: if an adversary com­promises M gateway routers or LAN machines that belong to previously-uncorrupted domains, it can then run many malicious nodes (m) within each of these M corrupted domains.
Relationship: neutral
Domain: Networks
Sentence 1: 8 shows our experimental topology, which is 7-hop indoor network with one source (one end node) and one sink (the other endnode);allnodesareequallyspaced(4mapart).
Sentence 2: in N (NAV) schedule, the node sleeps because it cannot send any packet, and in A (ACK) schedule, the node re­ceives the next node s data packet or ACK packet and regards it as anacknowledgementofitsdatapackettransmission;thenodedoes not have to overhear the entire data packet because the header of tate Transition Transition Time ; ->L:st : 2 2:ms Rx->Tx 0 270:ms Tx->Rx 0 125:ms Figure2: Implementation issues of the basicoperations.
Relationship: neutral
Domain: Networks
Sentence 1: While in a limited network bandwidth environment, this will be costing to store and transmit the huge numbers of hash values.
Sentence 2: [15] R. Gennaro, P. Rohatgi, How to Sign Digital Streams, em Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology, pp.180 -197, 1997.
Relationship: neutral
Domain: Networks
Sentence 1: (t) for slot t. A control message in distributed algorithms is assumed to include any information about queue lengths and link states available at a node until Section 5.
Sentence 2: this analysis aims at answering the following question: for a .xed complexity, could we have incentives in terms of delay to choose a .-throughput opti­mal algorithm with .< 1 rather than throughput optimal algorithms?.
Relationship: neutral
Domain: Networks
Sentence 1: The network switches will imple­ment these functions, taking one packet in a port, and pro­ducing 0 (dropped), 1 (unicast forwarding), or more (multi­cast forwarding) packets out other ports.
Sentence 2: congested link in_group(ingress(), [ switch ]) ^ (true)* Determine .ows (switch sources .
Relationship: neutral
Domain: Networks
Sentence 1: For exam­ple, rock state is observed with di.erent periodicity: at day­and night-time less frequent measurements may be taken since physical processes are stable.
Sentence 2: measurements, as well as special events (clock skew, sen­sor replacement, etc) are numbered, recorded in .ash mem­ory and queued for transmission towards the GPRS node where they are cached.
Relationship: neutral
Domain: Networks
Sentence 1: The hardware selected for the gateway was the Asus desk­top EEEBox EB1007 (Figure 9), which provides a versatile, moderate-cost, and self-hosting platform that is very useful for the pilot phase of this project.
Sentence 2: aCKNOWLEDGMENTS This research was partially supported by Fundação para a Ciência e a Tecnologia (FCT) through projects PEst-OE/EEI/ LA0009/2011 and PTDC/EEA-CRO/104243/2008.
Relationship: neutral
Domain: Networks
Sentence 1: INTRODUCTION Linear Dispersion Code (LDC) [1] is a well-known space-time (ST) coding technique that can provide full-ergodic capacity and good error probability performance in Multiple-Input Multiple-Output (MIMO) communication systems.
Sentence 2: rEFERENCES [1] Heath, R., and A. Paulraj, Linear Dispersion Codes for MIMO Systems Based on Frame Theory , IEEE Trans.
Relationship: neutral
Domain: Networks
Sentence 1: The steps are repeated aslong as theinterferencedoes not convergefrom one Table1: Simulationparameters Cellular layout 25hexagonal, trisectorized cells Site-to-site distance 0.5km BS/UEantenna height 30m, 1.5m Carrier freq.
Sentence 2: improved strategies how to allocate the resources on the side partitions are proposed.
Relationship: neutral
Domain: Networks
Sentence 1: (2) In the second stage, a classical max-.ow method is used to get maximum throughput in the relay candidate set.
Sentence 2: if we consider the number of uninterest­ed nodes in the relay sets that the two algorithms, we .nd that the ContactOnly uses more uninterested nodes than that does InterestSpread when ( is increasing, which is not what we expected.
Relationship: neutral
Domain: Networks
Sentence 1: Step-4) Mapping the MAC performance to the HTTP per­ formance: Since each HTTP request generates lh(9 + 2D)+ Lapp bytes of tra.c at the MAC, of ev­ ery lh(9 + 2D)+ Lapp bytes of MAC throughput, Lapp bytes constitute application throughput.
Sentence 2: technical Report MIST-TR-03-003, MIST, Dept.
Relationship: neutral
Domain: Networks
Sentence 1: Information Theory,vol.52,no.7,pp.2935 2953,2006.
Sentence 2: .ow,nomatterwhatthedirectionofthe.owis.allowingadifferentreturnpathis,fromtheloadbalancingpointofview,isineffectequivalenttoallowingtwopathsbetweeneachpairoflocations(assumingthatthereistraf.c.owinginbothdirections).Itisstraightforwardtoseethatwithsingle-pathroutingwehave .
Relationship: neutral
Domain: Networks
Sentence 1: In addition to these gaps, the only service at the high-end, leased-line service, is highly restrictive in that the two endpoints of a leased­line circuit have to be identi.ed at the time of purchase.
Sentence 2: applying Er­lang based teletra.c theory, it can be shown that op­erating a link at high utilization in an accept-or-reject mode comes with a concomitant cost of high call block­ing probability if the number of circuits is small.
Relationship: neutral
Domain: Networks
Sentence 1: [0, 1] with E[Ii.S Xi] = Ii.S pi for every set S .{1,...,n}.
Sentence 2: then P[Yt =1] = P[pt = 1/f2] · P[one msg sent | pt = 1/f2] = 1/f2 + p and it holds for any set S of time steps prior to some time step t that 2 P[Yt =1 | I Ys = 1] = 1/f+ p s.S the Chernoff bounds imply that k1 < g/8, w.h.p.
Relationship: neutral
Domain: Networks
Sentence 1: STRUCTURE OF THE EIGENLOADS The statistical analysis of the tra.c load series presented in the previous section underscores the central role of the eigenloads in understanding the intrinsic properties of a traf­.c load series obtained in a large-scale WLAN, such as the network considered in our study.
Sentence 2: wLANs have more vulnerabilities and bandwidth/latency constrains than their wired counterparts.
Relationship: neutral
Domain: Networks
Sentence 1: IXP28xx NP such as IXP2855 has 16 Microengines (MEs) and each ME is 8-way multi­threaded.
Sentence 2: 3.3 Bit-Byte-Level Aho-Corasick State Machine We have studied two categories of state machines, bit-level and byte-level AC for DPI, with subset strategy.
Relationship: neutral
Domain: Networks
Sentence 1: By running NetPiculet onthemajorU.S.cellularproviders as well as deploying itas a smartphone applicationin the wild covering more than100 cellularISPs,weidenti.edthekeyNAT and.rewallpoli­cies whichhavedirectimplications onperformance, energy, and se­curity.
Sentence 2: we studied the policies of two large nation-wide U.S. carriers in more depth and corroborated our .ndings carefully with controlled experiments.
Relationship: neutral
Domain: Networks
Sentence 1: Commun., 52(9):1585 1594, Sep.2004.
Sentence 2: it has been found from Table 1 that, the capacity of the TDMA-TDD system outperforms that of TDMA-FDD sys­tems.It is known that, TDD systems experience potential interference from neighboring BS(s) which is not the case in FDD systems.the appearance of additional in­terference in TDD can be exploited constructively by the TS opposing algorithm.Using this algorithm the capacity of TDMA-TDD system is found to be 2.9562 bps/Hz/cell which is approximately 1 bps/Hz/cell higher than the ca­pacity of TDMA-FDD system.
Relationship: neutral
Domain: Networks
Sentence 1: Vertex c is colored red .rst, followed by vertex d in the next cycle.
Sentence 2: if capacity increase is desired, then the average SNR (p) can be increased by a factor Ga, thereby resulting in a relative logarithmic increase in capacity (Cj), C. logGa Cj 2 1 +(9) Clogp 2 Resource allocation and utilization: The channel can be visual­ized to be composed of min(M,N) independent and parallel chan­nels (called as channel modes ) in the presence of rich multipath.
Relationship: neutral
Domain: Networks
Sentence 1: To address these challenges, we have designed and built a testbed for large-scale mobile experimentation, called the Diverse Outdoor Mobile Environment.
Sentence 2: in order to overcome chal­lenges in improving large-scale mobile systems, long-running remotely programmable yet diverse testbeds are needed which can address a number of open and ongoing questions in mobility research: Challenges related to temporal trends: A large body of re­cent work is based on the availability of open WiFi access points that provide free, ubiquitous connectivity to mobile users.
Relationship: neutral
Domain: Networks
Sentence 1: In addition to the above, implementations also have a parameter that limits the duration a route is suppressed.
Sentence 2: this suggests that the general form of P(t)is a geometric series: t. P(t) e .>(j.1) (2) j=1 and a closed form for this is P(t) 11 e .>t e.> (3) For what value of tdoes P(t)exceed the suppression threshold?
Relationship: neutral
Domain: Networks
Sentence 1: q=0.5, q=0.98) or saturated (i.e.
Sentence 2: so we have: At the same time, we get the following equations according to the N -1 Ntup (1 -tup ) (1 -tdw )relationship between the collision probability Pup, Pdw and the Pup s , = P (12) transmission probability t , t .
Relationship: neutral
Domain: Networks
Sentence 1: A MAR-based QoS Routing in Long-distance Wireless Networks Zenghua Zhao, Zhibin Dou, Tengfei Li, Lianfang Zhang, Jie Zhang School of Computer Science and Technology Tianjin University Tianjin, China zenghua@tju.edu.cn  ABSTRACT Long-distance wireless networks are expected to provide mul­timedia tra.c service in addition to basic Internet access, as more and more such networks have been emerged in real life.
Sentence 2: pERFORMANCE EVALUATION We evaluated the performance of MQDSR in simulation via NS2.
Relationship: neutral
Domain: Networks
Sentence 1: Assume that host 6 is attached at switch s1/port 1, and host 4 at switch s3/port 4.
Sentence 2: open­.ow [13] has made signi.cant progress by establishing (1) .ow tables as a standard data-plane abstraction for distributed switches, (2) a protocol for the centralized controller to install .ow rules and query states at switches, and (3) a protocol for a switch to forward to the controller packets not matching any rules in its switch-local .ow table.
Relationship: neutral
Domain: Networks
Sentence 1: The procedure AverageByFrequency requests O(log n/e + m) elements and satis.es: (1) If a¯is equal to the average of the values a1,... ,an, and the aggregator follows the protocol, then B always ACCEPTs.
Sentence 2: depending on the aggregation function, assuming that at most a certain number of sensors are compromised, we can calculate the bound on how much deviation from the correct result these corrupted sensors can cause.
Relationship: neutral
Domain: Networks
Sentence 1: Rexford,S.Shenker,andJ.Turner.OpenFlow: Enablinginnovation in campus networks.
Sentence 2: such applications requirepro­grammabilityonthedatapath(e.g.,allmulticastpackets, .. of allpackets,allblock accessrequestson SANs) andif im­plementedwithOpenFlowwouldresultinsendinglargevol­umesoftraffictotheOpenFlow controllerforprocessing.
Relationship: neutral
Domain: Networks
Sentence 1: If not, process A pushes the re- quest to queue C in order to retrieve the content from the server.
Sentence 2: rEFERENCES [ 1] Fielding, R., Gettys, J'., Mogul, J., Frystyk, H., and Bern- ers-Lee, T. RFC2068: Hypertext Transfer Protocol -HTI'P/I.1.
Relationship: neutral
Domain: Networks
Sentence 1: It was also shown that in the random m c network case, there are three distinct capacity regions: when = m vWc O(log n), the per-.ow capacity is ,when = O(log n)and n log nm ( C)2) loglogn m also On, the per .ow capacity is T(W),and logn nc (C)2)loglogn when c = O n, the per-.ow capacity is T(Wmloglogn ).
Sentence 2: associated with each node x, there is a set of nodes B(x)called the backbone for x.
Relationship: neutral
Domain: Networks
Sentence 1: In order to internetwork the heterogeneous network layer protocols, the new generation network employs the ID/locator split concept in the protocol stack [6, 7].
Sentence 2: since the mobility requires updates in the ID tables of gateways of both the MH and CH, gateway-initiated updates can be faster if the MH s new gateway sends locator update signaling message to the CH s gateway (i.e.
Relationship: neutral
Domain: Networks
Sentence 1: While considering MIMO operation, we notice that the activation of additional RF chains remarkably increases power consumption, as several hardware components need to be activated, in order to provide for the complex base­band processing that MIMO communications require.
Sentence 2: while considering tra.c loads above 100 Mbps, we notice that the remarkably increased through­put performance that A-MPDU aggregation results in does not come at much higher energy costs.
Relationship: neutral
Domain: Networks
Sentence 1: As another example, consider how we identify when a new participant joins an ongoing two-party call converting it to a 3­party conference call: classifier can be programmed to look for Join header (on a INVITE message from the new party) whose values matches any of the in-progress Dialog-IDs (here, the ability to maintain state at the classifier comes in handy).
Sentence 2: there are several challenges in doing this.
Relationship: neutral
Domain: Networks
Sentence 1: 3.1.2 Partial Autocorrelation Function (PACF) The partial autocorrelation function, fkk for a stationary process is de.ned as a function of the autocorrelations rk of theprocess[3] andhas thedistinctivefeature that fkk =0 for k>p in an autoregressiveprocess oforder p. fkj denotes the jth coe.cient in an autoregressive process of order k, so that fkk is the last coe.cient in fk1rj-1 + fk2rj-2 +... + fkk rj-k = rj .
Sentence 2: the ARIMA modelforthetopologicallinksisof order(0,1,1).
Relationship: neutral
Domain: Networks
Sentence 1: Graph based analysis of 2-d fpga routing.
Sentence 2: the number of switches needed can be calculated as a classical geometric series: (r (r (r N 1 N 1 N 1 NN Nswitch =+ + + + ···= 4244484 2 These linear organizations also allow us to have only a single switch at each tree level, such that the total switches along the worst-case path is again only 2 logr(N) -1.
Relationship: neutral
Domain: Networks
Sentence 1: As an example, Figure 6 shows the throughput obtained during two of the observed trips of the mobile node: the upper plot refers to a trip of duration equal to 140 s and with tra.c .owing from the mobile point to the desktop (uplink), while the lower plot refers to a trip of duration equal to 130 s and with tra.c .owing from the desktop to the mobile point (downlink).
Sentence 2: in this way, a node does not maintain the full route to a des­tination but every node on the path only knows the next hop to use to reach it.
Relationship: neutral
Domain: Networks
Sentence 1: Our approach leverages the intuition and under­standing that developers have of the likely protocol actions that can be exploited and the likely network conditions under which manip­ulations can succeed.
Sentence 2: in our experiments, we .nd that this is not a signi.cant limitation because for all attacks that we study, we are able to link the relevant header .elds to internal vari­ables.
Relationship: neutral