sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: For integrated networks carrying only speech, when equally-loaded compnets of 40 resources each are engineered to 5% blocking but overflow speech calls to each other, a more efficient shared blocking rate near 2% is achieved [19].
Sentence 2: for overflow 2-n (4) where D is the number of dual mode calls currently in progress, and N is the sample size of existing calls of type X on the network.
Relationship: neutral
Domain: Networks
Sentence 1: Video consumption, according to key members of the industry, is by far the most appealing service since it involves several players in the value chain where mobile operators play a renewed role.
Sentence 2: compared to this prior work, our main contribution is the design of a DMM based solution integrated into CDN archi­tectures, where we infer which functionalities are required to address the issues of content distribution among CDN caches and redirection of mobile users in the access part to e.ciently provide mobility-enabled video services.
Relationship: neutral
Domain: Networks
Sentence 1: We are now ready to state the drift inequality.
Sentence 2: in particular, there exist positive constants A and D such that as long as maxi Qi(t) = D,wehave D(Q(t)) =-A Q(t )+ K. (25) on the bounded set where maxi Qi(t ) = D, the drift D(Q(t )) is also bounded by a constant.
Relationship: neutral
Domain: Networks
Sentence 1: Call XHR3sr the extended hidden nodes relay set of a transmission Tsr in three-party proxy set cov­erage of node r. XHR3sr includes al l nodes in P3r that could relay tra.c from node r to nodes belonging to XH3sr.
Sentence 2: misclassi.ed nodes can ap­pear with the AMAC protocol if the nodes are highly mobile and the current con.guration does not re.ect the one de­tected when the 3-party proxy set was established.
Relationship: neutral
Domain: Networks
Sentence 1: The access network in these houses is a wireless network, and the external gateway of the net­work connects to an OSPF network in an emulated ISP.
Sentence 2: when using network emulators, users should create models that  Figure 2: Network Reproduction Using Link Emulator Figure 3: Network Reproduction Using Virtual Network Figure 4: Network Reproduction Using Real Network describe the processes of the trouble.
Relationship: neutral
Domain: Networks
Sentence 1: Throughput (b/s/Hz) Figure 4: AutoMAC: CDF of throughput gains on uplink 5.1 AutoMAC: Exploiting Interference on the Uplink Method: In this experiment, we statically place one USRP node which acts as the AP.
Sentence 2: 3.1 MAC Protocol AutoMAC uses a simple AP driven MAC protocol.
Relationship: neutral
Domain: Networks
Sentence 1: Also note that the increase in the throughput is achieved at the cost of increased delays for the users, due to lower chances of service for their queues in both the BS and RU, when the number of vehi­ cles increases.
Sentence 2: cHANNEL AND QUEUE AWARE POWER EFFICIENT RESOURCE ALLOCATION Transmission Rate [Bits/Slot] In this section, we propose power ef.cient resource allocation algorithm for providing data services for the users of vehicles.
Relationship: neutral
Domain: Networks
Sentence 1: of Computer Science and Engineering, Seoul National University Gwanak-599, Gwanak-gu, Seoul, Gyeonggi-do, Korea dobby@mmlab.snu.ac.kr, tkkwon@snu.ac.kr, yhchoi@snu.ac.kr ABSTRACT Cognitive Radio (CR) techniques to dynamically utilize the fre­quency spectrum is under hot discussion recently.
Sentence 2: hence, every SU is assumed to have 1 + n radios: 1 radio for signaling traf.c and n radios for data traf.c.
Relationship: neutral
Domain: Networks
Sentence 1: [5] Basu, P., and Redi, J. E.ect of overhearing transmissions on energy e.ciency in dense sensor networks.
Sentence 2: resid­ual overhearing denotes the number of nodes that overhear messages due to the transmissions of v. the more the number of multicast receivers v can cover, the less the number of nodes that overhear messages there will be.
Relationship: neutral
Domain: Networks
Sentence 1: In CR-MAC protocol, critical tra.c collision occurs only when there are more than one critical packet transmission at the same time slot while the non critical tra.c collision happens whenever there is more than one packet transmis­sion; critical or non critical, in a time slot.
Sentence 2: hence, as can be inferred from Figure 4, critical tra.c throughput is more than non critical tra.c through­  Figure 5: Packet Rejection Rate, .c = .nc =0.35 put.
Relationship: neutral
Domain: Networks
Sentence 1: For merged trie maintenance purposes, the FIB comple­tion algorithm must keep track of which NH entry exists in the corresponding individual FIB (i.e., original NH), and which NH is an entry resulting from masking (i.e., completed NH).
Sentence 2: this e.ort usually results in high power consumption and high cost, which makes it un­sustainable in the long term.
Relationship: neutral
Domain: Networks
Sentence 1: The size of FIB speci.c next-hop tables The number of entries in an individual FIB s next-hop table varies between 3 and 40 among a variety of routing tables we studied.
Sentence 2: in the current BGP decision pro­cess, each BGP router only selects a single best route for each pre.x, and announces it to the neighboring ASes (in­cluding customer ASes).
Relationship: neutral
Domain: Networks
Sentence 1: The biggest issue that WSB currently faces is the asynchronous-ness between the IEEE 802.11 MAC and Permission to make digital or hard copies of part or all 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.
Sentence 2: as High­speed is always configured to maximum speed, overflow may still occur.
Relationship: neutral
Domain: Networks
Sentence 1: Thus qx and qy can communicate cc-1 1 through z with probability pz > f 2 = O().There are 2log n c2 log2 n prnd possibilities for z within that cell, and all the possible z nodes have i.i.d channel assignments.
Sentence 2: we prove that the Invariants hold, by induction, as follows: If Invariant 1 holds at the end of step k -1, then Invariant 2 continues to hold after the channel-allocation phase of step k. If Invariant 2 holds after the channel-allocation phase of step k, then Invariant 1 will continue to hold after the node-allocation phase of step k, and thus both Invariants 1 and 2 will hold at the end of step k. Base Case: Before the procedure begins, at step 0, each node is assigned to its own backbone, for which it is effectively the origin (and this can be viewed as a single backbone link incoming to this node from an imaginary super-source).
Relationship: neutral
Domain: Networks
Sentence 1: 2.2 Proxy Mobile IPv6 Proxy Mobile IPv6 (PMIPv6) [13] is one of network-based mobility management protocols which can avoid tunneling overhead over the air as well as hosts involvement in mobil­ity management.
Sentence 2: the LMA has the functional capabilities of a home agent as de.ned in MIPv6 base speci.cation [16] and with the additional re­quired capabilities for supporting PMIPv6 as de.ned in the speci.cation [13].
Relationship: neutral
Domain: Networks
Sentence 1: The optimal solution is acquired by an exhaustive search, where complexity is of at least the order of O((LcMc)Nc ).
Sentence 2: for example, voice packets require a constant rate requirement, video tra.c has a vari­able rate with minimum rate, mean rate, and maximum rate requirements, while data tra.c is usually treated as a back­ground tra.c whose source rate is dynamic.
Relationship: neutral
Domain: Networks
Sentence 1: For example, in Figure 8, the entry at R1 for LSP P1 is replaced with instructions to (after removing the incoming label): push first the initial label of LSP Pb, then the initial label of LSP P4, and to forward over the interface of LSP P4.
Sentence 2: as discussed above, in addition to an ILM table, each router has an FEC table.
Relationship: neutral
Domain: Networks
Sentence 1: The uniform weight in the mix­ture then directly re.ects the probability of having either a false alarm or a missed detection.
Sentence 2: p(t) + n(t) (1) j=1 Lp where h(t) =j=1 aj d(t - tj ) is the multipath Channel Impulse Response (CIR) if d(.)
Relationship: neutral
Domain: Networks
Sentence 1: We vary the grid size from 3 × 3 (9 nodes) to 11 × 11 (121 nodes).
Sentence 2: as a source node always starts transmitting a data packet at the beginning of a Sleep period (e.g., node A in Figure 2), two hidden sources that have succeeded in scheduling through PIONs in a Data period always cause colli­sions at the beginning of the next Sleep period.
Relationship: neutral
Domain: Networks
Sentence 1: For example, ns-2 would model the communication of sensor data obtained from the Modelica s simulation and, conversely, Modelica s actuators would use control signals that are being exchanged over the ns-2 network.
Sentence 2: acknowledgments Research supported in part by NSF CCR-0329910, De­partment of Commerce TOP 39-60-04003, and Department of Energy DE-FC26-06NT42853.
Relationship: neutral
Domain: Networks
Sentence 1: When Ic is larger than 3, the asymptotic complexity of the exhaustive comparing algorithm is worse than Dijkstra s algorithm, except that it can cope with larger graphs.
Sentence 2: shashi Shekhar, Andrew Fetterer, and Bra­ jesh Goyal, Materialization Dade-Offs in Hierar­ chical SfLortest Path Algo~riLhms,Proceeding of the International Symposium on Large Spatial Databases, Springer Verlag (Lecture Nodes in Computer Science), 1997.
Relationship: neutral
Domain: Networks
Sentence 1: The game creator then invites other players to join the game.
Sentence 2: the user name (e.g., wechen@niu.edu.tw and wechen@nctu.edu.tw) consists of the user id (i.e., wechen) and the host name (i.e., niu.edu.tw and nctu.edu.tw), which identifies the user s home registrar.
Relationship: neutral
Domain: Networks
Sentence 1: For c from pfrom cto pto example, in Figure 2(c), edge (c3, c4) is the pseudo link between flip-flops c3 and c4.
Sentence 2: ijij i. j where a is a user-specified parameter, a normal link exists (a) a sample netlist p1 c2 c4 c6p3 normal link (b) the graph model without path information (c) the full graph model  Figure 2: Graph representation of a netlist 3.
Relationship: neutral
Domain: Networks
Sentence 1: the possible output of the perceptron is either 1or .1 interpreted as a positive and negative decision, respectively.
Sentence 2: 2.1 Choice of Attributes According to [4], link analysis attributes such as in­degree, out-degree, PageRank score and RBS score are ob­servably (even if not strongly) correlated with the number of visits made by users to Web pages and number of distinct users of Web pages.
Relationship: neutral
Domain: Networks
Sentence 1: Here, our goal is to use a microsec­ond precision timestamp.
Sentence 2: on Fast and Accurate Detection of Unauthorized Wireless Access Points Using Clock Skews * Suman Jana Sneha K. Kasera School of ComputingSchool of ComputingUniversity of UtahUniversity of Utahsuman.jana@utah.edu kasera@cs.utah.edu ABSTRACT We explore the use of clock skew of a wireless local area network access point (AP) as its .ngerprint to detect unau­thorized APs quickly and accurately.
Relationship: neutral
Domain: Networks
Sentence 1: For example, a network operator may conduct traf.c engineering to improve network performance, and many traf.cen­gineering techniques (e.g., [18, 19, 39, 42]) require the modi.ca­tion of con.gurable parameters (e.g., OSPF weights or egress point selections).
Sentence 2: this is certainly a feasible approach and our system can support it.
Relationship: neutral
Domain: Networks
Sentence 1: Extending the work of [3], the group-orthogonal (GO-)MC-CDMA presented in [4] assigns more than one user to each subcarrier subset and multiuser detectors are still required at receiver for each user groups.
Sentence 2: based on the concept of chip­interleaving [6][7], CIBS-CDMA uses the same block of data symbols to spread each chip of a user code and achieves MUI-free communication over multipath channels by inserting a guard interval between neighboring chips.
Relationship: neutral
Domain: Networks
Sentence 1: As expected, the results perfectly match the delay distribution ones where while the EDF 80-20, 100 UEs 20 ing at the RNC instead of at intermediate routers, allows to make 18 16 14 12 10 8 6 4 2 0 use of the different QoS application needs without interfering with the UTRAN transport requirements resulting in a relevant improve­ment with respect to the Iub interface delay and the packet error rate.
Sentence 2: in the 50-50 user mix case the WFQ con.guration cho­sen favours in excess the conversational class resulting in a poor performance with regard to the additional delay for the rest of the classes as compared to the FIFO case.
Relationship: neutral
Domain: Networks
Sentence 1: We adopt their model for the MPEG VBR traf.c, and transform the statistical result into the packet ar­rival probability in each interval under our setting, which is summarized in Table 3.
Sentence 2: assume that E[.npk |S]= t - E[L{1,2,...,n}] holds for k=1 pk all n = m. Consider the case n = m +1.
Relationship: neutral
Domain: Networks
Sentence 1: This implies that VINI must allow network experiments to specify different forwarding mechanisms (e.g., forwarding based on source and destination, forwarding on tags or .at identi.ers, etc.).
Sentence 2: step­ping back, we observe that even 200Mb/s is a signi.cant amount Chicago New York Washington DC   20.2 ms  4.5 ms Figure 5: PlanetLab topology for microbenchmarks Mb/s stddev CPU% Network 90.8 0.53 N/A IIAS on PlanetLab 22.5 4.01 13 IIAS on PL-VINI 86.2 0.64 40 Table 4: TCP throughput test on PlanetLab min avg max mdev loss Network 24.4 24.5 28.2 0.2 0% IIAS on PlanetLab 24.7 27.7 80.9 4.8 0% IIAS on PL-VINI 24.7 25.1 28.6 0.38 0% Table 5: ping results on PlanetLab; units are ms mean stddev Network 0.27 0.16 IIAS on PlanetLab 2.4 3.7 IIAS on PL-VINI 1.3 0.9 Table 6: Summary of jitter results on PlanetLab; units are ms of throughput for a networking experiment, as it far outstrips the available bandwidth between edge hosts in the Internet today.
Relationship: neutral
Domain: Networks
Sentence 1: We only examined A-requests because those are the only records that properly behaving LDNS servers access from Akamai s low-level servers (higher level DNS servers in Akamai serve NS records).
Sentence 2: we note that including all failures drives up the mean time to failure among those that did fail by several hours in both cases (hence, servers that we observed short failures at tended to fail later than those that we observed longer failures at), and well more than the majority never fail at all during the two-week period in both cases.
Relationship: neutral
Domain: Networks
Sentence 1: Let .= c-., Xt = A(t) -ct,and mx the reciprocal of the maximum of x,t =Var{Xt}/(x + .t)2 for a given x, i.e., mx = s2 1/maxt=1 s2 The MVA approximation of the over.ow x,t.
Sentence 2: one is the inter-bu.er priority (or priority queueing), where the tra.c in a bu.er of higher priority is served before that of lower priority.
Relationship: neutral
Domain: Networks
Sentence 1: To take this e.ects into account, we per­formed a last set of simulations where one information item is updated every d s. The computation of the coverage in­dex C is slightly modi.ed so as to consider only the updated information.
Sentence 2: the memory constraint B depends on the size of the corresponding ROI: .xed nodes have the largest amount of resources while pedestrians are equipped with a small sized memory.
Relationship: neutral
Domain: Networks
Sentence 1: A parallel deployment strategy such as this has some limitation, e.g., the IRSCP can not prevent routes from being distributed via the route re.ectors, but can dictate the relative preference of routes distributed by the IRSCP itself.
Sentence 2: the second, add delpolicyspec­i.es the relative preference of a route received from a particular egress router and states the relative preference to associate with that route when it is passed to a previously de.ned group of routers.
Relationship: neutral
Domain: Networks
Sentence 1: * * Jong-Hyouk Lee , Tai-Myoung Chung Sangheon Pack Sri Gundavelli Sungkyunkwan University, Korea Korea University, Korea Cisco, USA {jhlee, tmchung}@imtl.skku.ac.kr shpack@korea.ac.kr sgundave@cisco.com ABSTRACT Proxy Mobile IPv6 has been proposed to overcome limita­tions of host-based mobility protocols in IPv6 networks.
Sentence 2: in addi­tion, when the MH hands o. to another paging area, the lifetime is reset.
Relationship: neutral
Domain: Networks
Sentence 1: A relay picks the next token holder among neighbors, which are closer to source (comparing to the relay), and selects the furthest one.
Sentence 2: there are two types of acknowledgement: 1) cumulateACK, all SN up to this number have already been acknowledged, and 2) discreteACK, a list of SN which are acknowledged but not in the range of cumulateACK.
Relationship: neutral
Domain: Networks
Sentence 1: For each service, the relative improvement in FT corre­sponds to an increase in the number of available servers during a single worst-case failure; for example, a service with 20% improve­ment in FT will have 20% more servers available during such fail­ure.
Sentence 2: the service and service pairs are in decreasing order of Ti,or Ri,j, respectively.
Relationship: neutral
Domain: Networks
Sentence 1: But it is still a challenging task to build a practical and e.cient reputation system in VANETs due to the high mobility and diverse misbehavior types which are hardly speci.ed.
Sentence 2: we demonstrate that SLEP and PRP can supplement with each other very well to e.ciently remove the misbehaving insiders from the anonymous VANETs, at a low cost to a few individuals.
Relationship: neutral
Domain: Networks
Sentence 1: A saw-icy is tested for users who choose to devote, 1, 2 or 4 units tooth bandwidth variation pattern (Figure 7 (a)) is used of bandwidth per layer.
Sentence 2: the range of client bandwidths that can be supported by the protocol is independent of the server bandwidth, whereas in BroadCatch and HeRO, the client bandwidth range is directly related to the server bandwidth.
Relationship: neutral
Domain: Networks
Sentence 1: Though multiplexing techniques multi-fold the achievable transmit rates depending on number of antennas used for transmission, prior work showed that using multiplexing tech­niques improves performance of the network only in high SIR regions [1].
Sentence 2: interference in a PMP network is caused due to two rea­sons: a) Inter Carrier Interference (ICI) and b) Multiple Input Multiple Output (MIMO) Interference.
Relationship: neutral
Domain: Networks
Sentence 1: Moreover, none of them combine the tasks of energy replen­ishment with data gathering and balance their performance.
Sentence 2: e } i,a a .a SenCar located at anchor point a T Length of each time interval q Number of migration tours in each time interval L Maximum migration tour length for SenCar t(k) Sojourn time of SenCar at each anchor point in a migration tour during time interval k (k) r Data rate of sensor i when SenCar sojourns at anchor i,a point a during time interval k (k) fij,a Flow rate over link (i,j)when SenCar is located at anchor point a in time interval k (k) (k) .a Feasible region of link capacity variable f ij,a s Portion parameter for the energy budget eij Energy consumed for transmitting a unit .ow over link (i,j) vs Moving velocity of the SenCar .
Relationship: neutral
Domain: Networks
Sentence 1: For example, to ensure compliance with fu­ture regulation like Sarbanes Oxley, new accounting mid­dleboxes may be needed for email tra.c.
Sentence 2: if none of the above 3 conditions hold (for example, in a par­tial pswitch deployment where middleboxes are plugged into regular Ethernet switches), then we install a simple stateless in-line device, SrcMacRewriter, in between the middle­box and the regular Ethernet switch to which it is connected.
Relationship: neutral
Domain: Networks
Sentence 1: In such a case, one of them will give up its role and some of the nodes in one cluster may not be members of the other CH s cluster.
Sentence 2: the Weighted Clustering Algorithm (WCA) [11] is based on the use of a combined weight metric that takes into account several parameters like the node­degree, distances with all its neighbors, node speed and the time spent as a clusterhead.
Relationship: neutral
Domain: Networks
Sentence 1: Figure 5 shows a 3D plot of throughput achieved at different locations and at different times of the day, corresponding to a range of measured values of RSCP and ECIO.
Sentence 2: 6.1.4 Location Sensitivity In addition to just measuring load in a cell with background traf­.c that already exists, we also looked at settings when we used our own clients to generate traf.c in a controlled setting.
Relationship: neutral
Domain: Networks
Sentence 1: Note that, when constant c is large enough, the preced­ing construction produces winding open paths that cross the en­tire network area.
Sentence 2: a sector contains at most 1 sender, i.e., ng(v * ) = tg =21p(2g + 2)l. Since n0(v * )=0, the total signal interference at node v * by all ' * ) = L8* other transmitting nodes is I(v,v g=1 ng(v )P ·e(gR') = -a L8 21p(2g+2)lP (gR')-a = PR'-a L8 21p(2g+2)lg .
Relationship: neutral
Domain: Networks
Sentence 1: The source node waits for a route reply (RREP) message testifying the discovered path, up to a given timeout limit.
Sentence 2: the source and destination nodes act as convergence point of multiple concurrent paths, by nullifying the effects of spatial separation: as reported in [21], when the source-destination are close to each other only one link can be active, thus the presence of multiple paths does not lead to an increase in goodput.
Relationship: neutral
Domain: Networks
Sentence 1: In the Inject and Observe technique, described in Sec­tion 4, Mallory sends to the client data which is spoofed as coming from the server in response to queries that the pup­pet sends; this phase relies on a very common browser be­havior that allows the puppet to retrieve the injected data when bu.ered in the .ow-control window (maintained by the browser).
Sentence 2: 1.2 Related Works 1.2.1 Off-Path TCP Injection Attacks TCP injections are easy for implementations that use pre­dictable initial sequence numbers (ISNs).
Relationship: neutral
Domain: Networks
Sentence 1: M number of distinct ob jects within the WMN indexed by m. K total number of the generated graph parti­ tions indexed by k. DN k delegate node of partition k. Om identi.er of object m. |Om| size of object m in bytes.
Sentence 2: overall, the long convergence time for all heuristics is because it includes both the placement decision and the time to fetch the objects replicas.
Relationship: neutral
Domain: Networks
Sentence 1: [24] A. Rombaut, N. Staelens, N. Vercammen, B. Vermeulen y P. Demeester, «xStreamer: modular multimedia streaming,» de Proceedings of the seventeen ACM international conference on Multimedia, Beijing, China, Octobre 2009.
Sentence 2: in order to make the quantification of QoE more complete and to allow the inclusion of a real environment, the transformations performed should be extended to the different flows in the existing IP broadband services.
Relationship: neutral
Domain: Networks
Sentence 1: The paperisorganizedas follows: Section2gives more details about the operation of a frequencyhopping cognitive personal area network, while Section3presents the performance of the original protocol with respect to both data transmission and sensing.
Sentence 2: oSA technology can be used in wide-as well as in local area networks, but it may also be ap­plied in different personal area network scenarios, esp.
Relationship: neutral