sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: There are also pro­tocols that have a working implementation showing signif­icant improvements in total network throughput.
Sentence 2: this motivates formulating the network throughout optimization problem in a manner similar to a clustering problem in a graph, whereby nodes that communicate frequently are clustered into the same channel, whereas those that do not communi­cate much (but are within each other s interference range) are separated into different channels.
Relationship: neutral
Domain: Networks
Sentence 1: In this context, we make three contributions in this paper:  We introduce the new paradigm of Communication through Silence for wireless sensor networks, de.ne the concept of CtS, and identify its basic trade-offs.
Sentence 2: [6] Z. Ghassemlooy E.D Kaluarachi and B. Wilson, Digital pulse interval modulation for optical free space communication links, in IEE Colloq.
Relationship: neutral
Domain: Networks
Sentence 1: To improve throughput, the IEEE 802.11n [8] high throughput standard adopts two approaches to frame aggregation: the aggregated MAC service data unit (A-MSDU), and the aggregated MAC protocol data unit (A-MPDU) [1].
Sentence 2: this method does not reduce the MAC and PHY header overheads or the cost of link-level ACKs.
Relationship: neutral
Domain: Networks
Sentence 1: For example, after a node detects a broken link and returns a ROUTE ERROR to the original sender of a packet, the node may attempt to salvage the packet if it has in its own Route Cache a different route to the packet s destination; to do so, the node replaces the original route with the route from its cache and transmits the packet to the new next hop node.
Sentence 2: with implicit source routing, source routes do not appear in the majority of packets, lessening the opportunity for these routes to be overheard and cached by other nodes.
Relationship: neutral
Domain: Networks
Sentence 1: NV has been proposed as a diversifying attribute of the Future Internet (FI) [5] and focused on developing new ser­vices to increase the virtual networks more e.ective [6, 7, 8].
Sentence 2: at each step, the GA selects individuals at random from the current population to be parents and uses them to produce the o.­spring (children) for the next generation towards an optimal /* Header on all OpenFlow packets.
Relationship: neutral
Domain: Networks
Sentence 1: While research in this direction has been full-grown to its potential in various networks, e.g., Blue­tooth [7][15][10], it is still immature in protocols of Wireless Sensor Networks (WSNs).
Sentence 2: di.erent from other networks, e.g., In­ternet, Bluetooth etc, with the presence of limited resource, hardware variability/unreliability, and sensitivity to the en­vironment on the nodes, in WSNs, when a protocol fails on hardware testbed one can hardly identify the causes, which could be due to the logical errors of the protocol, or the problems of hardware device.
Relationship: neutral
Domain: Networks
Sentence 1: 2.2 Classi.cationofWireless UndergroundCommunication Networks Although a WUSN is mainly formed by underground sen­sor nodes, the network still requires aboveground nodes for additional functionalities such as data retrieval, manage­ment, and relaying.
Sentence 2: the above PA challenges illustrate the importance of real­time soil measurement for an e.cient PA solution.
Relationship: neutral
Domain: Networks
Sentence 1: The total number of routing table entries of a CoRC router in year 2030 is bounded to the same level of the current num­ber of IP pre.xes (i.e., the FIB size of a DFZ router).
Sentence 2: hashing can cause colli­sions, which may have a marginal e.ect on the routing and caching performance in CoRC.
Relationship: neutral
Domain: Networks
Sentence 1: There are manytechniques for hierarchical classi.cation, including use of the degrees of individual ASes, the number of pre.xes origi­natedby the ASes and the numberof distinctAS paths seen froma particular AS.
Sentence 2: our study .nds that P2P traceroutes reveal an additional 40.99% peering links, which con.rms these prior results.
Relationship: neutral
Domain: Networks
Sentence 1: [33] F. Smith, F. Campos, K. Jeffay, and D. Ott.
Sentence 2: because the initial window periods can have a dominant impact on end-to-end performance.size is two packets [6], and because TCP s slow-start mechanism doubles the window size each round-trip-time, the .ow arrives into the system in n bursts of size Xs = {2, ..
Relationship: neutral
Domain: Networks
Sentence 1: We measured the whole L3 handoff time in the three sce­narios speci.ed in Section 3.2, took the average of each component, and reconstructed the total L3 handoff time of each scenario.
Sentence 2: the longest component of the DHCP assignment procedure is the time between the DHCP DISCOVER Figure 1: DHCP Procedure sent by the MN and the DHCP OFFER sent by the DHCP server.
Relationship: neutral
Domain: Networks
Sentence 1: 1Hereafeter, we describe active device to represent active mobile broadcasting device in short.
Sentence 2: categories and Subject Descriptors C.2.1 [Computer-Communication Networks]: NetworkAr­chitecture and Design Wireless Communication ; C.2.2 [Computer-Communication Networks]: Net­work Protocols Application  General Terms Design, Implementation  Keywords Mobile video broadcasting, Availability, SIP, Advanced no­ti.cation method 1.
Relationship: neutral
Domain: Networks
Sentence 1: To this aim, energy e.ciency analysis is performed by the research community, mainly focusing on the development of power consumption models.
Sentence 2: in partic­ular, we present a wireless experiment that is remotely exe­cuted in NITOS testbed [6] and more speci.cally show how the proposed framework facilitates energy e.ciency evalua­tion in parallel with the experiment execution.
Relationship: neutral
Domain: Networks
Sentence 1: [2]BILIRIS,A.,CRANOR,C.,DOUGLIS,F.,RABINOVIH,M., SIBAL,S.,SPATSHEK,0.,ANDSTURM,v.CDN Brokering.InProeedingsoftheSixthInternational WorkshoponWebCahingandContentDistribution (BostonUniversity,Boston,MA,June2001).
Sentence 2: inProeedingsofthe4thSymposiumonOperatingSystem DesignandImplementation(OSDI)(SanDiego,CA,Ot.
Relationship: neutral
Domain: Networks
Sentence 1: CHneeds to store a hash chain, veri.cation values for all nodes in the cluster, pairwise keys for all nodes in the cluster, and temporarily the received endorsements and respective node identi.ers of the endorsingnodes.IftheroleofCHdoesnotchange,aCN needs only to storea hashchain and one pairwisekey shared with CH.
Sentence 2: an endorsing node has to prove at a later point in time, that the sent en­dorsement was correct.
Relationship: neutral
Domain: Networks
Sentence 1: This is possible in polynomial time; see, e.g., the linear-time algorithm by Tamassia and Tollis [8].
Sentence 2: if each edge is ( 13 e/2 - E)-covered by some relay, the corresponding common endpoints form a vertex cover of size at most N = k. if there is no vertex cover of size k, there is an edge v sensor i such that there is no relay or sink within 13 e/2-E units [2].
Relationship: neutral
Domain: Networks
Sentence 1: Moreover, constructing PS windows in lines 4 and 9 takes time O( s=1 I)in total, which can be written as O(PS)as the receiver buffer size Qand number of frames in each window are small constants.
Sentence 2: for a service provider who sat­urates the bandwidth and broadcasts 20 video streams, the preroll delay is no more than 2sec.
Relationship: neutral
Domain: Networks
Sentence 1: These .aws in the speci.cation not only can confuse implemen­tors; they also limit extensibility, since a proxy might not prop­erly handle an extension header that it cannot correctly character­ize.
Sentence 2: the model should be further tested on additional HTTP extensions (e.g., pend­ing work on coherent caching[22], or the metadata mechanisms used in some CDNs to track the validity or mutability of informa­tion), to ensure that it is robust enough to support extensions that I have not considered.
Relationship: neutral
Domain: Networks
Sentence 1: [4] A. Demers, D. Greene, C. Hauser, W. Irish, J. Larson, S. Shenker, H. Sturgis, D. Swinehart, D. Terry; Epidemic algorithms for replicated database maintenance; Proceedings ACM Symposium on Principles of Distributed Computing (PODC), pp.
Sentence 2: in the same sense, it can also be concluded that for this level of noise, all single-path methods perform worse than DIRECTED TRANSMISSION.
Relationship: neutral
Domain: Networks
Sentence 1: there cannot be more than 2c ' log n nodes left uncommitted in Ri at the end of the stage, where 1 = c ' < c is the constant we de.ned in the proof of Lemma 4.8.
Sentence 2: [9] M. Khabbazian, D. Kowalski, F. Kuhn, and N. Lynch.
Relationship: neutral
Domain: Networks
Sentence 1: Infranet [41] takes things a step fur­ther, embedding the real communication inside a cover web session, using covert channels to communicate the request and image steganography to return the data.
Sentence 2: censorSpoofer decouples the upstream and downstream channels, using a low-bandwidth indirect channel for deliv­ering URLs and a high-bandwidth direct channel for down­loading web content.
Relationship: neutral
Domain: Networks
Sentence 1: How­ flow (4,2) } TA (4) ever, the formulation in [15] lacks fairness constraints and seeks to flow (4,1) maximize the number of packets leaving the source and arriving  at the destination.
Sentence 2: (15) 1a tf1 TA (1) TA (2) TA (3) TAP1 C,1, TAP2 C,2, TAP3 C,3, TAP4 Figure 19: Example scenario for throughput computation un­der the spatial-bias-removal constraint Consider the scenario depicted in Figure 19 with link capacities a, a, and a3set as in the example of Figure 18.
Relationship: neutral
Domain: Networks
Sentence 1: INTRODUCTION Sel.sh Routing and the Price of Anarchy We study the degradation in network performance caused by the sel.sh behavior of noncooperative network users.
Sentence 2: roughgarden and Tar­dos [20] studied a related model in which network users may carry more than a negligible fraction of the overall tra.c and showed that the cost of routing sel.shly is provably larger in general networks than in networks with parallel links; Roughgarden [17] showed that the equilibria in a Stackel­berg game related to the tra.c model of this paper are 1For example, it su.ces for the class to satisfy a mild and standard convexity assumption, to be closed under multipli­cation by positive scalars, and to possess some latency func­tion that is positive when evaluated with zero congestion.
Relationship: neutral
Domain: Networks
Sentence 1: A major difference with traditional cellular systems is that in order to achieve directional communication enabled co-existence of SUs (and not just of PUs and SUs) each point in the plane should be in the directional transmission range of more than one SUBS.
Sentence 2: the type of the transceiver will be added to the correspondent range as a superscript, e.g., TV mic SU RC , RC , RI , etc.
Relationship: neutral
Domain: Networks
Sentence 1: GloMoSim provides a two-ray path loss model, with antenna height hardwired at 1.5 m and with a Friss free-space model with parameters (exponent, sigma) = (2.0, 0.0) for near line-of-sight and plane earth path loss (4.0, 0.0) for far line-of-sight.
Sentence 2: 2 records the ratio of bad frames in single path transfer of the Foreman video stream.
Relationship: neutral
Domain: Networks
Sentence 1: Onlyifnoneof.ows in Oi(t)have Rif (t)= Rmax , the if base station will serve a .ow which becomes a resident .ow in [nT, (n +1)T - 1] over channel i.
Sentence 2: the reason we need this T is that our proof uses the standard drift argument in Foster s criterion (see [2]), but the drift of M(n)may not be negative over successive time instants.
Relationship: neutral
Domain: Networks
Sentence 1: That is, FTP 1 experiences less contention than FTP 2 and FTP 3 due to its FT P 4 FTP5 FTP6  FTP3 FTP2 FTP1 Figure 19: Grid topology  400 350 300  more goodput than FTP 3 and FTP 4, respectively.
Sentence 2: this effect even has a stronger impact when transferring small files, as it is the case in this scenario, since TCP should be able to utilize the available bandwidth quickly in order to get benefit from the pause times, when the other flow is idle.
Relationship: neutral
Domain: Networks
Sentence 1: Our analysis can be of great value to content providers and site administrators due to the large amount of net­work tra.c generated by UGC.
Sentence 2: we try to an­swer the following questions: what is the underlying distri­bution of non-popular items, what shapes the distribution in one way or another, and how much bene.t the Long Tail can bring for UGC services.
Relationship: neutral
Domain: Networks
Sentence 1: During the transmission of this probe train, either the bottleneck queue occasionally empties or it doesn t. If it never empties then the probe rate is almost certainly infeasible.1 In this case, it is highly likely that some queue build up occurs during every sequence of 9 or 17 out of the 100 equally spaced probe packets, and thus a 9-packet probe train would also likely obtain the same infeasibility result.
Sentence 2: we .nd that the AQP,2 estimates are between 0.7 -1.0 times the Pathload estimate in nearly every experiment that we have run (over hundreds of paths), and are often between 0.9 -1.0 times the Pathload value.
Relationship: neutral
Domain: Networks
Sentence 1: As a general qualifier for this processing performance increase, Moore's Law [5] is often used to relate processor performance per unit cost to the number of transistors on an integrated circuit, empirically showing that these metrics double approximately every 2 years.
Sentence 2: rEFERENCES  [1] IEEE Std 802.11-2007 (Revision of IEEE Std 802.11-1999), Part 11: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications, Jun.
Relationship: neutral
Domain: Networks
Sentence 1: Categories and Subject Descriptors C.2.1 [Internet]: Measurement  General Terms Measurement  Keywords Routing, Data-Plane, Control-Plane, Reachability, Limitation of data, Default-Routing 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 pro.t or commercial advantage and that copies bear this notice and the full citation on the .rst page.
Sentence 2: the AS s operator is likely to be interested in knowing that they have limited reachability, and may put upwards pressure on the guilty party to ensure that the problem  Figure 7: The number of ASes showing conclusive, and proba­ble evidence for reachability problems (log-scale).
Relationship: neutral
Domain: Networks
Sentence 1: ADPQ will adaptively set a quantum based on the QoS parameter called Maximum Latency defined for rtPS in IEEE 802.16 standard.
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: Bestperformance can be achieved if TNAPI is combined with PF RING.
Sentence 2: people are even building mon­itoring devices based on commodity hardware that can be used to capture tra.c in 10 GE networks [4, 5] this is not an easy task, since it requires careful con.guration andoptimization of the hardware andsoftware components involved even the best hardware will su.er packet loss if its driving software stack is not able to handle the huge amount of network packets.
Relationship: neutral
Domain: Networks
Sentence 1: H * (HTH *)-1 Zero-forcing: W = c · Wzf = .Zero­forcing beamforming employs the CSI to precode the data­bearing symbols so that they sum to zero, or a null , at unintended receivers.
Sentence 2: zero-forcing requires the computation of a matrix inverse, a calculation with the com­plexity of O(M·K2).
Relationship: neutral
Domain: Networks
Sentence 1: The broadcast storm problem in a mobile ad hoc network.
Sentence 2: flooding usually covers all the nodes in a network, but can also be limitted to a set of nodes that is de.ned by a geographical area (also called geocast .ooding [15]) or by the time-to-live (TTL) pa­rameter of m. a node receiving the .ooded message only rebroadcasts it if it is within the speci.ed area or if the message s TTL is greater than 0.
Relationship: neutral
Domain: Networks
Sentence 1: In addi­tion, our results match observations previously made over entire networks for FastTrack [17], older variants of Gnutella, which did not use a two-tiered hierarchical topology, and Napster [6].
Sentence 2: we observe that eDonkey and eDonkey/Overnet produce results extremely quickly: after two minutes, for nearly all queries, the sender has received over 85% of all query returns.
Relationship: neutral
Domain: Networks
Sentence 1: Upon receiving L3-Route.req, the network layer exchanges L2-LinkStatus.req and L2-LinkStatus.conf to L2-1 and L2­2 in order to acquire the status of both links (Fig.4­(7)).
Sentence 2: 3.1 CEAL Architecture The information in each layer should be abstracted before it is sent to another layer.
Relationship: neutral
Domain: Networks
Sentence 1: Therefore, the delay introduced by weight calculation is negligible.
Sentence 2: our solution simply normalizes the total transmission power locally at each base  -1 K cm = lh m.kl (m =1, 2, ...M) (8) k=1 The conjugate beamforming weights are then scaled via: W = H * · diag(C) (9) Where C is the scaling vector given by Clocal =[c1,c2, ...cM ], from Equation 8; notably the globally scaled conjugate can also be found in this form, using Cglobal =[c, c, c, c...], from Equation 7.
Relationship: neutral
Domain: Networks
Sentence 1: 4.1.2 Impact of Noise at PHY layer and DetectionAlgorithm Figure 7 shows the mean and 95% con.dence interval of the noise .oor values reported by the HAL for di.er­ent power levels of the input signal generator.2 We observe that the noise .oor does not change until around -70 dBm; beyond -70 dBm there is a linear increase in the calibrated noise .oor.
Sentence 2: with detailed knowledge of the noise level, adaptive channel selection algorithms could be implemented which could reduce the degradation in performance.
Relationship: neutral
Domain: Networks
Sentence 1: For this reason, in the chirp receiver bandwidth of the band pass .lter hBP (t) BBP can be set to BBP Bv and still on time o. time  Figure 1: Signaling strategies.
Sentence 2: iEEE Journal of Solid-State Circuits, 41(8):1784 1791, Aug. 2006.
Relationship: neutral
Domain: Networks
Sentence 1: By considering all the possible values of y, we have: The probability that there are N - N + i IDL UTs CON ,n+1 CON ,n,h n changing to CON at the frame boundary is: NCON (22) .
Sentence 2: generally, other video source models, for example, the mini-source model, can also be employed and the performance results should be similar.
Relationship: neutral
Domain: Networks
Sentence 1: Other algorithms have attempted to minimize end-to-end delay mod- We also note that these results indirectly indicate that for any net­ work node v, the routes to destinations that are distant change much less frequently than routes to destinations that are close by.
Sentence 2: sIGCOMM 03, August 25 29, 2003, Karlsruhe, Germany.
Relationship: neutral
Domain: Networks
Sentence 1: In addition, Se,0 n r n k - 1 r=0 rr are pair-wise disjoint.
Sentence 2: for a j-square S, let D<j be the S set of active disks with level less than j and intersect with jj D =j D>j }j S. Similarly, we de.ne D, , ,and D. For a SSS S j-square S, let OP T S<j be the set of disks from OP T (DS ) with level less than j and intersect with S. Similarly, we jj =j >j }j de.ne OP T, OP T , OP T , and OP T. SSS S For each level j, let Dj (r, s) be the set of active disks at level j respecting to shifting (r, s).
Relationship: neutral
Domain: Networks
Sentence 1: FC[C.srcIP ].count +0.25 //src,dst contacted previously 13 end 14 if FC[C.srcIP].count = k then 15 add new entry for index C.dstIP into S 16 return (True) 17 end 18 end 19 else if IsLocalAddress(C.srcIP) .
Sentence 2: the TRW algorithm must wait for each new connection attempt to check whether it is successful or not.
Relationship: neutral
Domain: Networks
Sentence 1: 3.2 Macroscopic Quantities As in Section 2, the .rst step is the proper de.nition of macroscopic quantities.
Sentence 2: the optimal tra.c .ow, that minimizes the number of nodes needed, happens to be the same as the electrostatic .eld that will be created if we remove the data sources and substitute them with positive charges, and we remove the data sinks and substitute them with negative charges!
Relationship: neutral
Domain: Networks
Sentence 1: We need at most M = L + G - 1 static paths, where each path can support up to 2R,tospread tra.c uniformly over any set of n = N = G × L linecards that are present so that each pair of linecards are connected at rate 2R/n.
Sentence 2: third, the crossbars in each group can be protected byan additional crossbar slice.
Relationship: neutral
Domain: Networks
Sentence 1: While DENs can be considered more important for the applications, from a net­work point of view the CAMs, also called safety beacons,are consuming most of the bandwidth and lead to congestion problems.
Sentence 2: in classical IEEE 802.11 networks, adaptive data rate is achieved either through mechanisms based on historical data [17], or by solutions relying upon feed-back from receivers [7].
Relationship: neutral
Domain: Networks
Sentence 1: Unless the low rate .ow s link quality improves, by moving closer to the AP for example, it will lag behind high-rate .ows.
Sentence 2: the main reason is the time incurred due to retransmission attempts and channel contention, especially as N2 and N3 move far­ther away, they consume increasingly more air-time due to their lower data rates.
Relationship: neutral
Domain: Networks
Sentence 1: To solve the problems of existing isolated broadcasting stations, such as the inconvenience in accessing the services (via different hostnames or IP addresses), lack of interaction between audience and broadcasting hosts, limited types of programs, and lack of coordinated supervision, we design a web-based platform, DJ DreamFactory, where average users are able to easily set up network broadcasting stations with minimal effort.
Sentence 2: users can receive broadcastings in the channels, produce broadcasting programs in the media studio, maintain personal profile in the personal zone, and participate in social network activities in the communication platform.
Relationship: neutral
Domain: Networks
Sentence 1: Equipping the PdP node with two FEs instead of one can double its speed.
Sentence 2: the results in Table 2 show that less out-of-order pack­ets will occur if the packet classi.er takes into account the packetprocessingpower(CPU cycleis just one aspectof the   350  90 Forwarding rate (Kpps) Forwarding rate (Kpps) 250 60 200 Forwarding rate (Kpps) 150 50 40 30 100 20 50 10 0 0user one two three kernel user one two three kernel user one two three kernel Click FE FEs FEs Click Click FE FEs FEs Click Click FE FEs FEs Click (a) 64-byte packet(b) 512-byte packet(c) 1500-byte packet Figure 11: Packet forwarding speed in case of large routing table.
Relationship: neutral
Domain: Networks
Sentence 1: 3.3 Caveats Obtaining several independent inexpensive Internet ac­cesses seems trivial at .rst glance; Simply checking the o.ering in the desired geographic area and obtaining two or more connections from local Internet Service Providers.
Sentence 2: mOBILE IP-BASED APPROACH Our proposed approach[6] in providing business-grade connectivity economically is based on connecting sites over the Internet, over standard commodity consumer-grade connections.
Relationship: neutral
Domain: Networks
Sentence 1: R = {,,...,} (5) ,k =0,1,2,... 5.2.2 Generation ofRule Sets In our experiments, we emulate a sudden drop of through­put from 4 Mbps to 400 Kbps after playing the .rst three fragments.
Sentence 2: sec­tion 4.2) does not test the available bandwidth lower than the least video bit rate.
Relationship: neutral