sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: To en­sure fairness, i.e., to ensure that all clients obtain the same average rate, distant receivers that experience lower per-frequencySNRs are allocated more frequencies.
Sentence 2: when the subband SNR is below 3.5 dB, no combi­nationof modulation or code rateworks.In this case,itis better not to transmit in that subband, i.e., to suppress that subband.
Relationship: neutral
Domain: Networks
Sentence 1: The criteria of choosing the best query execution plan lies on the satisfaction of query issuer to the best extent, in the sense that results should be available before the specified delay.
Sentence 2: [3] Y. Fukushima, H. Harai, S. Arakawa, and M. Murata, Distributed clustering method for large-scaled wavelength routed networks, In Proc.
Relationship: neutral
Domain: Networks
Sentence 1: The model of BAR (Byzantine, Altruis­tic,Rational) games[10] addresses theseissues;indeed,the model is general enough to subsume traditional Byzantine approaches  in this context, resource-competitive analy­sis is concerned only with altruistic and Byzantine nodes.
Sentence 2: a Jamming-Resistant MAC Protocol for Single-Hop Wireless Networks.
Relationship: neutral
Domain: Networks
Sentence 1: We simply need to set both the low and high thresholds to K, and mark based on instantaneous, instead of average queue length.
Sentence 2: to establish that long .ows impact the latency of query responses, we measured the RTT between the worker and the aggregator: this is the time between the worker sending its response and receiving a TCP ACK from the aggregator labeled as RTT+Queue in Fig­ure 7.
Relationship: neutral
Domain: Networks
Sentence 1: For example, a node in layer 3 can have layer 2 nodes as its parents, but if this node moves to layer 4, it can have its layer 2 and also its layer 3 neighbors as poten­tial parents.
Sentence 2: in addition, note that the base station and the nodes in the last level (leaf nodes) wake up only once, unlike other nodes which wake up twice in every period T. they save energy and con­sume less power for wakeup in comparison with other nodes.
Relationship: neutral
Domain: Networks
Sentence 1: The rest of the paper is organised as follows.
Sentence 2: ~to = A~, + ~t~b + ~t~, (4) In a hi-directional terns, the average numbers of hops that a message makes along a given dimension and across the network, and d, are given by "k - f;"~ k is even -(5) 1 (k - f) k is odd = n~ C6) Since a router in the terns has 2n output channels and a node generates, on average, ~.~.
Relationship: neutral
Domain: Networks
Sentence 1: 250 .T = 20 .T = 40 200 Wiener prediction for the .T = 20 ms and.T = 40 ms the time di.erence between the arrivals of packets n and n -1.Theinterpretation of(14)isthattheAR(2)model  s[n] s[n] 200 200 150 150 100 100 100 150 200 250 300 350 100 150 200 250 300 350 s[n-1] s[n-1] Figure 2: Phase diagrams for .T = 20 ms (on the left) and .T = 40 ms(on the right).
Sentence 2: such measures are naturally too costly for delay-sensitive applications.
Relationship: neutral
Domain: Networks
Sentence 1: Essentially, we construct a new graph where all the sinks are now considered to be a single logical sink and edges con­necting a particular sensor to any sink in G are replacedby an edge from the sensor to the logical sink in G,with its new weight being the minimum distance of the sensor from any of the sinks.
Sentence 2: we have E. = {(u, v)|(u, v) .
Relationship: neutral
Domain: Networks
Sentence 1: Based on our analysis, we show that 1) both the linear and cumulative approaches can achieve correctness; 2) the cu­mulative approach has better timeliness since it can reach the threshold faster; and 3) the linear approach has better resilience to spurious messages.
Sentence 2: to simplify the anal­ysis, we assume that the reputations of all vehicles are the same (i.e., l6(vi) = 1).
Relationship: neutral
Domain: Networks
Sentence 1: The use of cryptographymakes intensive use ofCPU resources.
Sentence 2: [4] V. S. Pail, M. Aront, G. Bangat, M. Svendsent, P. Druschelt, W. Zwaenepoelt, and E. Nahumq, "Locality-Aware Request Distribution in Cluster-based Network Servers., 8th InternationalConferenceon Architectural Supportfor ProgrammingLanguages and OperatingSystems, Oct. 1998.
Relationship: neutral
Domain: Networks
Sentence 1: Given a channel pro.le (e.g., Pedestrian-A) and Ior/Ioc of a user, a concave function, which takes into account the be­havior of adaptive modulation and coding, is often used to model the (instantaneous) data throughput (bps) per chan­nelization code [4].
Sentence 2: this is true also for our HSDPA re­source allocation problem, although our problem has two knapsack constraints instead of one.
Relationship: neutral
Domain: Networks
Sentence 1: In MicroCast, encoding and decoding must be performed ef.ciently, at a rate matching that of the local network dissemination; other­wise, CPU risks to become the bottleneck of the video distribution.
Sentence 2: 10 shows that MicroCast still improves the average download rate up to the total capacity of 3G links (of four phones) in a congested network.
Relationship: neutral
Domain: Networks
Sentence 1: Toaddprotection,FlexCastdesignsaratelessvideo codecbased on raptor codes [24] that allows the sender to protect bits in dif­ ferent distortion groups according to their relative importance.
Sentence 2: hence,tomakesureFlexCastisnotbene­fting from very accurate rate adaptation, we constrain the wireless AP to use only a very crude static rate adaptation protocol when wearerunningexperimentswithFlexCast.
Relationship: neutral
Domain: Networks
Sentence 1: For ex­ample, if certain protocol are enabled only on one type of network interface, say GigabitEthernet, then the GigabitEthernet part of the message may be falsely included in the syslog template of the protocol messages.
Sentence 2: this is because SyslogDigest learns both the types and the co-occurrence time patterns of re­lated syslog messages, and consequently associate such syslogs to­gether when theydo co-occur.
Relationship: neutral
Domain: Networks
Sentence 1: We coin the term heterogeneous multi-channel neighbor discovery problem to denote the following problem in the context described above: How can neighbor nodes with het­erogeneous duty cycles, operating on di.erent channels, with­out clock synchronization, discover each other over every common channel within a bounded delay?
Sentence 2: in multi-channel case, the second metric on discovery diversity and the third metric on MTTFDD are applicable.
Relationship: neutral
Domain: Networks
Sentence 1: FORMULATING ADMISSION CONTROL AS AN MDP Our goal is to construct an ~!,dmi~sion-control policy that decides, for each new call and handoff call, whether it should be admitted or rejected and, if it is admitted, at what QoS level.
Sentence 2: (for example, we could have a "mid- day" MDP, a middle-of-the-night MDP, and "morning rush hour" MDP, and so on.)
Relationship: neutral
Domain: Networks
Sentence 1: This paper presents several techniques for establishing pair­wise keys in static sensor networks.
Sentence 2: to predistribute pairwise keys, the setup server randomly generates a bivariate t-degree polynomial f(x, y)over a .nite .eld Fq, where q is a prime number that is large enough to accommodate a cryp­tographic key, such that it has the property of f(x, y) = f(y, x).
Relationship: neutral
Domain: Networks
Sentence 1: This is because DCTCP and L2DCT use reactive rate control at the end hosts, which is not as effective as PIAS for in-network .ow scheduling.
Sentence 2: [23] H. Wu, Z. Feng, C. Guo, and Y. Zhang, ICTCP: Incast Congestion Control for TCP in data center networks, in CoNEXT 2010.
Relationship: neutral
Domain: Networks
Sentence 1: Over the course of 14 months, we completed upwards of 400 billion SYN probes and 2.55 billion TLS handshakes, collecting and parsing 42.4 million unique X.509 certi.cates from 109 million hosts.
Sentence 2: between June 2012 and August 2013, we completed 110 exhaustive scans of the public IPv4 address space in which we performed TLS handshakes with all hosts publicly serving HTTPS on port 443.
Relationship: neutral
Domain: Networks
Sentence 1: We know that (1) (2) ri = ri , .vi = S1 (13) because vk is the node with the smallest rate in L1 that di.ers in its rate assignment in L2 .
Sentence 2: suppose there are two di.erent optimal rate assignments, L1 and L2 , for a network G. L1 and L2 are identical as sorted vectors but their rate assignments for some nodes di.er.
Relationship: neutral
Domain: Networks
Sentence 1: [37] STUDER,A., BAI,F., BELLUR,B., AND PERRIG,A.Flexible, extensible, and ef.cient VANET authentication.Journal of Communications and Networks 11,6 (Dec.2009), 574 588.
Sentence 2: tESLA-basedschemesre­quire a timestamping server to achieve the non-repudiation prop­erty.
Relationship: neutral
Domain: Networks
Sentence 1: Figure 1 shows that with the increase of packet loss ratio, the discovery probability of all discovery designs decreases.
Sentence 2: categories and Subject Descriptors C.2.2 [Computer Communication Networks]: Network protocols General Terms Performance, Design Keywords Selective Reference, Neighbor Discovery, Low-duty­cycle WSNs, Group 1 Introduction Energy-saving is very important in sustainable deploy­ment of Wireless Sensor Networks systems.
Relationship: neutral
Domain: Networks
Sentence 1: Note that miliar algorithms such as the Floyd-Warshall, Bellman 23 Ford, or Dijkstra s (the last two can be used to compute A* 1,1 0 ··· 0 6 A* 7 A* one row or column at a time).
Sentence 2: path-or distance-vector routing protocols such as RIP and the Border Gate­way Protocol (BGP) use the distributed Bellman-Ford (DBF) algorithm [1].
Relationship: neutral
Domain: Networks
Sentence 1: Hence, intermediate ADs can announce greater reservable bandwidth (i.e., overbook) to their downstream ADs than the actual link capacity, and defer the actual bandwidth reservation later during the ac­tivation step (.).
Sentence 2: an interesting observation is that since compromised endhosts send tra.c all the time whereas uncompromised endhosts do not, the available bandwidth is much higher than the fair share if the domain contains fewer bots.
Relationship: neutral
Domain: Networks
Sentence 1: Note the close, but not exact, correspondence between the TCP and IB connection state machines.
Sentence 2: 5.1.1 Connection Management For connection management, the VNET Core CA must manage three di.erent sets of states: the guest TCP state, the In.niband connection state as per the IB Connection Management standard, and the underlying In.niband queue pair state.
Relationship: neutral
Domain: Networks
Sentence 1: As shown inFigure.,the networkis ahierarchyreachingfrom alayerof servers inracksatthebottomtoalayerofcoreroutersat thetop.
Sentence 2: theagentatthesourcecomputesahash of thefive­tuple values and writes that value into the source IP address field, which all switches douse inmakingECMPforwardingdecisions.
Relationship: neutral
Domain: Networks
Sentence 1: In [6], an algorithm named iterative partitioned water-filling (IPW) was proposed to obtain the optimal power, consider that there is a power constraint on every subchannel.
Sentence 2: where pn is transmit power of CU on subchannel n.  2.2 Problem Formulation Our objective is to optimally allocate CU s power on every subchannel to maximize sum rates of the CR system, the CU is subject to not only individual transmit power constraint but also the PU s interference power constraint.
Relationship: neutral
Domain: Networks
Sentence 1: Our solution, called RABE for Retransmission-based Available Bandwidth Estimation, takes into account, in its estimation, the bandwidth wasted by extra waiting times and medium occupancy due to retransmissions.
Sentence 2: 3.6 Estimation of the available bandwidth of a wireless link Finally, given the available bandwidth ABs at the RABE sender s and the available bandwidth ABr RABE at the re­ceiver r, we consider that the available bandwidth on the wireless link(s,r)is: ABRABE = K * min{ABsr (14) RABE,ABRABE} Denoting Ks = K * ts and Kr = K, the available band­width of a wireless link can be rewritten as ABRABE = min{Ks * Cs,Kr * Cr} (15)  4.
Relationship: neutral
Domain: Networks
Sentence 1: Controlled Potential-Based Routing for Large-Scale Wireless Sensor Networks Daichi Kominami Graduate School of Information Science and Technology Osaka University 1-5 Yamadaoka, Suita Osaka 565-0871, Japan d-kominami@ist.osaka­u.ac.jp  Masashi Sugano School of Comprehensive Rehabilitation Osaka Prefecture University 3-7-30 Habikino, Habikino Osaka 583-8555, Japan sugano@rehab.osakafu­u.ac.jp Takaaki Hatauchi Fuji Electric Co., Ltd. 1 Fuji, Hino Tokyo 191-8502, Japan hatauchi­takaaki@fujielectric.co.jp Masayuki Murata Graduate School of Information Science and Technology Osaka University 1-5 Yamadaoka, Suita Osaka 565-0871, Japan murata@ist.osaka-u.ac.jp ABSTRACT Improving the scalability of wireless sensor networks is an impor­tant task, and toward this end, much research on self-organization has been conducted.
Sentence 2: [3] I. Dietrich and F. Dressler.
Relationship: neutral
Domain: Networks
Sentence 1: Let us consider a simple case when packets are of constant size2 , P. If all the packet sizes are of constant size, as in the case of ATM cells, then, each Xi is independent of each other.
Sentence 2: as can be noted from the above, the standard DRR scheme needs per .ow de.cit counters that keep track of the credits left over in the previous round of scheduling.
Relationship: neutral
Domain: Networks
Sentence 1: Although the actual values for the fractions of solved scenarios from Ex­periments 1 and 2 are not directly comparable due to the different number of background .ows, we conclude that from a qualitative point of view the results match quite closely.
Sentence 2: n :(f, n, (a, b),s) .A (6) For each .ow and path index, allocations form a path starting at the source node of the .ow: .f .F.n .
Relationship: neutral
Domain: Networks
Sentence 1: Accommodating the uncertainty in resolving IP-level paths into AS-level paths as discussed in Sec­tion 4.1 makes calculating the exact number of distinct cuts |.| dif­.cult, since we do not know if two cuts both containing the same starting node going into # are actually the same cut.
Sentence 2: the pollution caused by the hijack spreads through links (10, 6) and (6, 5) to pollute ASes 5, 8, 6, and 9.
Relationship: neutral
Domain: Networks
Sentence 1: ---::..-=:.. ....:...:: oi~ 0~ 013 0,I 0.5 Fraction (~ ml~ node8 (a) 0 second pause time ~ND-ON ,PR-ON ,~;RR-ON WD,.ON ,PR~ON .SRR~OFF ---x--- WD~ON ,PR-OFF,SRR..OFF -*-~--" WD-OFF,P R-OFF.SR R,.OFF 0.8 0.6 | ~) 0.4 0.2 o i ' i ' 0 01 0.2 0 3 0.4 0,5 Fraction of misbehavl~ nodes (b) 60 second pause time Figure 6: This figure shows routing overhead as a ratio of routing packet transmissions to data packet transmissions.
Sentence 2: if keys are not distributed ahead of time, then enforcing a priori trust-based forwarding requires a secure channel for key exchanges within the ad hoc network for authentication.
Relationship: neutral
Domain: Networks
Sentence 1: A parallel methodology could be based on FIN .ags, since all TCP sessions should end with a FIN packet.
Sentence 2: observe f(1) more closely fe(2) is captures the peak of the actual frequencies at length 5. clearly more accurate at longer .ow lengths, re.ecting its smaller variance due to its use of data from all .ows, not just the SYN fe(1) .ows used by .
Relationship: neutral
Domain: Networks
Sentence 1: Inwhatfollows,weshowtherelationshipbetweenthesig­nalingostandthenumberofellsinapagingarea.Most parametersusedinthisevaluationaresettotypialvalues foundintheliteratureforanalyzingellularsystems[14]: Rw 8 Rore 0.5 Rzoaz 0.5 dHA,FA 16(hops) dFA,FA i(hops) v 65(mph)i.e.28.9(m/s) p 200(useTs/km2)i.e.0.0002(useTs/m2) a 5%[6] Aa 3(1/hr)i.e.0.0008(1/se) Ad 3(1/hr)i.e.0.0008(1/se) Theaveragenumberofhopsbetweenforeignagents,dFA,FA, isdependentonthenetworktopologyofthepagingarea.
Sentence 2: inthisase,pagingreduesunneessaryregistrationwith­outintroduingpagingoverhead.Morepagingisrequired athigherdatarates,andasaresult,paginginreasesthe signalingost.Pagingeventuallydegradesthesystemper­formaneatveryhighdatasessionrates.Signalingostin MobileIPdoesnothangewiththedatasessionrate,as indiatedinSetion4andFigure6.
Relationship: neutral
Domain: Networks
Sentence 1: Table 4: Simulation results Wireless Technology Channel Type Uplink (Mbps) Downlink (Mbps) Coverage Area Medium Access Wi-Fi Shared 24.09 24.09 small CSMA/CA WiMAX Shared 16.03 16.03 medium OFDMA UMTS Dedicated 1.8 2.7 large CDMA   0 2 4 6 8 10 0 2 4 6 8 10 Node of User Equipments Number of User Equipments Figure 5: WiMAX maximum experimental through- Figure 7: UMTS maximum experimental uplink put throughput 25 .guration of each wireless network, the available capacity can vary signi.cantly.
Sentence 2: a comparison of Wi-Fi, WiMAX and UMTS is presented by Kavas [10].
Relationship: neutral
Domain: Networks
Sentence 1: To this end, data re­vealing the actual status-condition of the available networks are periodically retrieved form the network detection mod­ule.
Sentence 2: for a given communication session, let us de.ne the following cost function: .n C = TN i · cN i (h) (1) i=1 where TN i is the sum of the permanence intervals spent by the user in the i-th access network and cN i (h) is the fee per unit of time (second) that the operator of the i-th access network charges to the user.
Relationship: neutral
Domain: Networks
Sentence 1: Sel.shness and Payments Energy-e.ciency is a must for routing protocols in ad hoc networks.
Sentence 2: if node vj additionally knows the emission power Pemit i (which vi could have included in the message), it can estimate the minimal emission power Pmin required for a i,j message from node vi to node vj as follows5 using the signal loss equation Eq.
Relationship: neutral
Domain: Networks
Sentence 1: 123 134 [2] "Draft IEEE Standard for Local and Metropolitan Area Networks: Media Independent Handover Services", IEEE LAN/MAN Draft IEEE P802.21/D14.00, 2008 [3] "WiMAX forum network architecture, Stage 3: Detailed protocols and procedures", Release 1, Version 1.2, 2008.
Sentence 2: the challenge is to design multi-radio devices that use energy efficiently; the objective is to provide the benefits of using multiple radios with low energy consumption.
Relationship: neutral
Domain: Networks
Sentence 1: Since compatibility with the popular libpcap[5] libraryispreserved, webelieve thatit can smooth the transition toward e.cient parallel packet processing.
Sentence 2: aCKNOWLEDGEMENT The authors would like to thank J. Gasparakis and P. Waskiewicz Jr from IntelTMfor the insightful discussions about 10 Gbit on multi-core systems, as well M. Vlachos, andX.Dimitropoulosfor their suggestions while writingthis paper.
Relationship: neutral
Domain: Networks
Sentence 1: For our node storage simulation results, we con.gure four links to be intermittent, which are the .rst four links listed in table 2 and let node storage range from 32 KB to 2048 KB.
Sentence 2: a custom simula­tion environment was developed based on the generic YAC-SIM [14] discrete event simulation engine and augmented with custom simulation software supporting intermittent links, custody transfer, and the other DTN mechanisms.
Relationship: neutral
Domain: Networks
Sentence 1: This noise is dynamic in nature and is expected to grow with time as additional services are launched via the same binder group.
Sentence 2: in general, for offering the best solution for implementing a broadband access network compatible with NGN, the points mentioned below must be considered: x Implementation cost reduction by efficient use of current infrastructure and previous investments x Imposition the least and the shortest interrupts to the services currently in use x Considering the priorities and balance in improving and upgrading the network and equipments in order to efficient use of resources x Selecting the architectures, technologies and equipments with sufficient knowledge and notice to the world communication market trends and national communication needs in the future 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 STP is NP-hard, and in this paper, we .nd a solution to the problem by modifying the approximation algorithm by Kou et al.
Sentence 2: partition CS into ng disjoint subsets D1,D2,...,Dng for gateways subject to c(gk), 1 = k = ng, using the method Sng in [1].
Relationship: neutral
Domain: Networks
Sentence 1: The last (veri.cation) is an essential step which we cannot do without human interaction.
Sentence 2: for example, the SMTP rewrite above would be speci.ed as: modify_element( smtp_request_arg,  "From: ") and the composer would alter the location in output trace occu­pied by the variable smtp_request_argto contain the new text rather than the original.
Relationship: neutral
Domain: Networks
Sentence 1: Second, the gains in terms of QoE are usually large in the low rates, so the encoding of a large number of representations at low rates is valuable because a small increase of the link capacity at the client side can result in a signi.cant QoE gain.
Sentence 2: for example, users cannot reach simultaneously fairness and e.ciency in a scenario where many clients share the same bottleneck link.
Relationship: neutral
Domain: Networks
Sentence 1: DA-B ,DB-A) for i =0 to n - 1 do if B[i] is pure then Add i to pureList while pureList .Ø do = i=pureList.dequeue() if B[i] is not pure then continue s=B[i].idSum c=B[i].count if c> 0 then add s to DA-B else add s to DB-A for j in DistinctIndices(s, k, n)do B[j].idSum = B[j].idSum .s B[j].hashSum = B[j].hashSum .Hc(s) B[j].count = B[j].count-c for i =0 to n - 1 do if B[i].idSum .0 OR B[i].hashSum =0 B[i].count .0 then return FAIL return SUCCESS .elds have value equal to zero), then the decoding process has suc­cessfully recovered all elements in the set difference.
Sentence 2: one has to use 5d cells, where d is the set difference.
Relationship: neutral
Domain: Networks
Sentence 1: [11]L.Fan,Q.Jacobson,P.Cao,andW.Lin.Web PrefetchingBetweenLow-BandwidthClientsand Proxies:PotentialandPerformance.InProc.of SIGMETRICS'99,May1999.
Sentence 2: w h a s W h clien h a s e pro h a s A k y o f W a im ed a t red u cing In t h a h a s W has studyofasmalldepartmentalserverwouldscaletothelarge commercialsitesintherealworld.
Relationship: neutral
Domain: Networks
Sentence 1: Am bie n t Se r v i c e ASI In t e r f ac e  Med i a Ov e r lay Co ntext D e liv e r y Su p p o r t Lay e r Pr ov is i o n i n g Mg m t .
Sentence 2: am b i e n t Am bi e n t M o bi lity Na m i n g Conn e c ti v i ty Se cu r i ty Ro ut i n g Gro u p In f o r m a t i o n Ne t w o r k In t e r f a c e Do ma in Mul t i Rad i o Co nnec t i v i t y A g reem ent Am bi e n t Ne t w or k AN I Ma na g e m e nt R e so u r ce M g mt .
Relationship: neutral
Domain: Networks
Sentence 1: The reason is that maximum length of MSS pattern and minimum length of MSS pattern are the same in this situation, and PSS-CAGE can schedule each sleep cycle no more than that of PS.
Sentence 2: reference [3] proposes Periodic on-off scheme (PS) and AS and considers to combine not only the packets from different connections but also the pattern from different MSSs under the maximum bandwidth of minimum delay bound.
Relationship: neutral
Domain: Networks
Sentence 1: 30 8 25 7 6 20 5 15(hop)µ 4(hop)s 10 3 2 5 1 0 0 0 5 101520253035404550 Traceroute Gateway ID Figure 4: µ parameters for traceroute gateways.
Sentence 2: [45] A. Yaar, A. Perrig, and D. Song.
Relationship: neutral
Domain: Networks
Sentence 1: analyzed thekeyword .ltering mechanism of the Great Firewall of China (GFC) and found that it was pos­sible to circumvent it by simply ignoring the forged TCP packets with the reset .ag set sent by the .rewall.
Sentence 2: more than 3165 IPv4 pre.xes are delegated to Egypt and man­aged by 51 ASes.
Relationship: neutral