sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: However, our goal is to have bundles being exchanged also with users that are socially well-connected with the destination, and not only to have bundles being delivered directly to the destination.
Sentence 2: as social proximity relates to how physi­cally close users are and how much time they spend together, Bluetooth is the most indicated technology to exploit such proximity as it supports only close range communication.
Relationship: neutral
Domain: Networks
Sentence 1: We propose a method to classify ASes into a number of types de­pending on their function and business type, using observable topo­logical properties of those ASes.
Sentence 2: if the snapshot duration is too small (say a few days), then the major­ity .ltering mechanism may not be able to .lter out backup links that appear during long-lasting failures such as .ber cuts.
Relationship: neutral
Domain: Networks
Sentence 1: These plots focus on forging probabilities such 2-64 as and2-80 , to show that PEAC is completely cus­tomizable and that it can reach high level of security.
Sentence 2: on the other end, PEAC can just use longer hash chain (that is, increasing the parameter L) to amortize the overhead in­duced by the transmission of the TPK over several time intervals.
Relationship: neutral
Domain: Networks
Sentence 1: In this paper, we propose and analyze a cross-layer, scal­ able and e.cient integrated mobility and service manage­ ment scheme, called DMAPwSR, with the goal to mini­ mize the network cost incurred for mobility management  Figure 1: Example Mobility and Service Management Scenarios under DMAPwSR.
Sentence 2: mIP v6 Cservice = .t + at (4) 1.2  1.4 1 1.3 1.4 Cost Difference 0.8 0.6 0.4 0.2 01/81/41/2 1 2 4 8 16 32 64 SMR Figure 6: Cost di.erence between MIPv6, HMIPv6 and DMAPwSR.
Relationship: neutral
Domain: Networks
Sentence 1: Hit 257.68 264.05 271.53 274.87 275.46 Other Hit 62.33 59.57 52.85 45.80 41.52 Total Hit 320.01 323.62 324.38 320.67 316.98 Table 5.1: Total encoding size in MB with various allo­cations of space for the .le cache, with total cache size 10 MB.
Sentence 2: the client, upon receiving the hash data, uses an ordered data structure to identify all blocks whose MD5 hashes start with the received pre.xes.
Relationship: neutral
Domain: Networks
Sentence 1: The dynamically changing network topology makes the maintenance of any multicast tree in DTNs challenging.The performance of different multicast approaches relies on the knowledgeofnetworkconditions that DTN nodes can discover and disseminate among one another.
Sentence 2: 4.5 Comparisons with Other Multicast  Approaches In this section, we compare our CAMR scheme with U-Multicast, DTBR, and OS-Multicast schemes using random waypoint mobility model and a scenario with 25 nodes randomly distributed in 1000x1000 m2 and a traffic load of 1 bundle every 2 seconds.
Relationship: neutral
Domain: Networks
Sentence 1: In fact, without loss of generality, we assume that the values ai are integers from [m]= {1,... ,m}.
Sentence 2: to lower the size of veri.ca­tion information, the aggregator .rst hashes the measurements with a cryptographic hash function, e.g., v3,0 = H(m0),as­suming that the size of the hash is smaller than the size of the data.
Relationship: neutral
Domain: Networks
Sentence 1: METRICS RELEVANT TO CONTENT PROVIDERS In this section we discuss two key aspects for our study: (i) what constitutes a content provider relative to each censorship event, and (ii) the metrics on which we base our assessment of changes resulting from censorship events (note that we can only apply these metrics to unencrypted traf.c).
Sentence 2: for SOHO traf.c, the average porn bandwidth reduces by a fac­tor of three.
Relationship: neutral
Domain: Networks
Sentence 1: PRELIMINARY EVALUATION In this section we show some preliminary evaluation results of our schemes, and refer the readers to [23] for more comprehensive 0 20 40 60 80 100 120 140 Number of heavy changes Figure 6: Heavy change detection accuracy: true positive (top) and false positive (bottom).
Sentence 2: we note that for non-hierarchical keys, such as source/destintion pairs of IP ad­dresses, an alternate (and slightly less ef.cient) scheme needs to be used.
Relationship: neutral
Domain: Networks
Sentence 1: The idea is .nding the erage as the area of the coverage disc to the area of a smallest coverage disc in which a unit cell can be fully covered by that disc wherever a sensor is placed in the cell.
Sentence 2: in [8], the authors addressed a probabilistic k-coverage model that can determine the appropriate number of sensors to provide k-coverage of a region under mostly sleeping sensor nodes.
Relationship: neutral
Domain: Networks
Sentence 1: Throughput Received Packets (24 nodes) 3.5 Analysis The overall assessment of this simulation was that the performance of the 24-node configuration was better than that for 12-node configuration in every respect, except for dropped packets, as denoted in Table 1.
Sentence 2: selected nodes then became mobile, moving to a new location while maintaining communications with its respective companions.
Relationship: neutral
Domain: Networks
Sentence 1: 2p1B Denoting r := p2/p1, we get then r(A- B)+ 2B rA E(R)/E(S)= = - r/2+ 1.
Sentence 2: for probes in which any packet is lost, we consider the one-way delay of the most recent successfully transmitted packet as an es­timateof the maximum queue depth(OWDmax).We then consider a loss episode (or, more generally, a congestion episode) to be de­limitedby probes within t seconds of an indication of a lost packet (i.e., a missing probe sequence number) and having a one-way de­lay greater than (1- a) × OWDmax .
Relationship: neutral
Domain: Networks
Sentence 1: In conclusion, the low entropy of some peers is either a measurement artifact due to modi.ed or misbehaving clients, or the result of the this remote peer spent in the peer set when the local inability of the rarest .rst algorithm to reach ideal entropy peer is in leecher state; in some extreme cases.
Sentence 2: this paper is not a case against solutions based on source or network coding.
Relationship: neutral
Domain: Networks
Sentence 1: As the de­ployment of charging stations depends on the mobility of e­vehicles, which is not observable in real urban areas at higher scales, the real-world behavior is not yet clear.
Sentence 2: in [8], the authors discuss the advantages and disadvantages of different communication technologies available for smart grids, such as wireless mesh networks (WMNs), cellular networks, powerline communication, and digital subscriber lines.
Relationship: neutral
Domain: Networks
Sentence 1: Consider a packet i that arrived in the bu.er when there were some other pack­ets present.
Sentence 2: for ev­ery packet arrival event we registered: Unique identi.er of the wireless card for which the event occurred  Unique frame identi.cation number (we used IEEE  802.11 frame ID for this purpose) Packet arrival timestamp And for every packet departure event we logged: Unique identi.er of the wireless card for which the event occurred  Unique frame identi.cation number  Transmitted frame size in bytes  MAC-layer transmission rate used with the frame  Packet departure timestamp  This information was su cient for calculating aforemen­tioned fairness metrics.
Relationship: neutral
Domain: Networks
Sentence 1: Full Duplex Backscatter Dinesh Bharadia Kiran Raj Joshi Sachin Katti Stanford University Stanford University Stanford University dineshb@stanford.edu krjoshi@stanford.edu skatti@stanford.edu ABSTRACT This paper asks the following question: could we transform the radios found in our personal gadgets into powerful multi­purpose scanning devices that can detect and locate tumors, guns, buried human bodies, a la the Star Trek Tricoder?
Sentence 2: [16] B. Fleury, M. Tschudin, R. Heddergott, D. Dahlhaus, and K. Ingeman Pedersen.
Relationship: neutral
Domain: Networks
Sentence 1: Because RTS/CTS mitigates effects of hidden terminals, the results for CSMA/CA are more balanced, and downlink traf.c contributes with 414 kb/sec whereas uplink traf.c contributes with 407 kb/sec.
Sentence 2: notice that the total goodput achieved by the system is 67% of that of the reference model for CSMA (and slightly less for CSMA/CA) and signi.cantly less than twice that achieved with a single omnidirectional antenna.
Relationship: neutral
Domain: Networks
Sentence 1: In Proceedings of IEEE DySPAN, pages 1 11, April 2010.
Sentence 2: (1) in Stage III, SAP announces the optimal price p* =arg maxp=0 = R(p, a, Wl,p), and in Stage * II, SAP determines the optimal leasing amount W = l arg maxWl R(p, a, Wl,p*).
Relationship: neutral
Domain: Networks
Sentence 1: Indeed, existing protocols either do not satisfactorily address the problem of coercion and vote-buying [2, 3, 10], or they are too impractical and involved to be understood by the vast majority of users [5, 11].
Sentence 2: in fact, despite being a realistic threat undoubtedly relevant for governments that wish to implement e-voting [10, 14], this problem is rarely addressed at all in remote e-voting protocols.
Relationship: neutral
Domain: Networks
Sentence 1: Given that the network sharing functional block on node B relies only on generic API calls to operate, the same module can be used for sharing all sorts of networks.
Sentence 2: at this point, all data sent by the TCP FB on IDP u will be tunneled through the Y network and then forwarded to the X FB on its IDP r. The X functional block then adds the received data into an appropriate X packet and sends it to the destination address.
Relationship: neutral
Domain: Networks
Sentence 1: SIMULATION RESULTS We now present simulations that explore the quantita­tive di.erence between mechanisms, and illustrate the e.ects Figure 2: Sample demand realization for 3 buyers with our trace-inspired model for 600 simulated secs.
Sentence 2: we get e.cient strict priority queuing with­out any kernel modi.cations, with the caveat that we can only use a small .xed number of queues.
Relationship: neutral
Domain: Networks
Sentence 1: 3.1.2.2 The Suitability Re-Assessment Procedure The MN may change its direction whilst in a periphery zone, so the suitability of an advance reservation should be re-assessed regularly.
Sentence 2: the other weakness is that Soh assumes that, at any particular location in the current cell, there is only a single cell to which a MN can hand-over.
Relationship: neutral
Domain: Networks
Sentence 1: If energy consumption is a .rst-class concern as it is for hand­held devices the best policy for the client would be to trans­mit data to the .le server when the mobile device has the highest-bandwidth network connection that it will enjoy in the near future.
Sentence 2: the purpose of maintaining this database is to estimate the quality of a connection to the Internet, for all the di.er­ent access points a mobile device encounters.
Relationship: neutral
Domain: Networks
Sentence 1: China wanghuinudt@gmail.com, sunzhigang@nudt.edu.cn ABSTRACT The rapid growth of diverse applications and services over the Internet poses signi.cant challenges to the traditional multicast routing protocols.
Sentence 2: in the traditional multicast routing pro­tocols, policy is not exerting impact on mechanism, and there is no clear boundary and separation between poli­cies and mechanisms.
Relationship: neutral
Domain: Networks
Sentence 1: assume the control variables, the locations of the  4.1 Network Structure ble vertices, to be {(x1,y1), (x2,y2),..., (xn,yn)}.
Sentence 2: end as discussed in Section 4.1, it is not clear that de­ploying a node at the vertices v1 will produce a maximal Algorithm 2: Algorithm for dynamic deployment probability of connectivity between v1 and all its neighbor nodes.
Relationship: neutral
Domain: Networks
Sentence 1: In Panama, if an IP packet does not require additional pro­cessing, its forwarding path is an interrupt-free pipeline co­ordinated by network processors lying on the packet s for­warding path.
Sentence 2: an alternative way to measure the effectiveness of the Figure 12 shows how the packet rate changes as the per­centage of .ows that require computation worth one exten­sion function increases.
Relationship: neutral
Domain: Networks
Sentence 1: The work in [15] provides a comparison between preamble-sampling and wake-up radio systems, but Figure 1: Developed MiXiM model for a WuR-equipped node.
Sentence 2: aCM 978-1-4503-2353-6/13/11 ...$15.00 http://dx.doi.org/10.1145/2507924.2507955.
Relationship: neutral
Domain: Networks
Sentence 1: Once the KDC (TGS part), receiving the TGS request from the user, verifies the TGT ticket and hence the user authenticity, it sends to the user the service ticket containing the necessary credentials (keys) according to the user profile and according to the required service.
Sentence 2: this approach requires lot of processing and consumes lot of resources, thus presenting a deployment limitation.
Relationship: neutral
Domain: Networks
Sentence 1: Ifthereisanyinonsisteny,Vbroadastsm.
Sentence 2: supposewehaveaprotoolinwhihadealerVsendsto twoplayersPi,PjasinglevalueX(Round1).Thetwoplay­erswishtoverify(andannounetothepubli)ifthetwo valuestheyholdXi,Xjareequal(thisshouldbetheaseif thedealerishonest);however,ifthevaluesareequalthen thisommonvalueshouldremainprivate.Theyandoso byexhangingthesevaluesovertheirprivateommunia­tionhannel(Round2)andthenbroadastingiftheyare thesameornot(Round3).Weanreduethenumberof roundstotwoasfollows:duringthefrstroundPisends toPjarandompadr(whereXi,Xj,rareallelementsof thefeld).DuringRound2theplayersbroadastthevalues Xi+r,Xj+r.Nowallplayersanhekifthevaluesare thesameornot.Thevalidityofthistransformationanbe informallyjustifedasfollows.IfV,Pi,Pjareallhonest, thenXi =Xj=Xandthebroadastedvaluegivesnoinfor­mationonX.Moreover,evenfromtheorruptionofplayers, theadversarydoesnotgainanyadvantageinthe2-round protooloverwhatitouldhaveahievedinthe3-round protool(bothintermsoftheinformationitlearnsandits efetontheoutomeoftheomparison).the modifedprotoolenjoysthesameseuritypropertiesasthe originalonewhileusingonelessround.
Relationship: neutral
Domain: Networks
Sentence 1: Also, voice over IP is becoming the favored means of voice communication mainly because of its low cost when compared to voice communication over traditional networks like cellular and PSTN.
Sentence 2: available: http://www.counterpath.com/xlitedownload.html [14] Digium Wildcard TE110P Single T1/E1 PCI card VoIP SIP IAX Asterisk PBX.
Relationship: neutral
Domain: Networks
Sentence 1: [4] J. Deng, R. Han, and S. Mishra.
Sentence 2: step 2: Asensor u with m(u) = WHITE receiving m(v)= BLACK from v .Nu is dominated by v.Node u sets m(u) = GRAY, r(u)= r(v), and broadcasts m(u)and r(u).
Relationship: neutral
Domain: Networks
Sentence 1: For exam­ple, an MPRG graph node could indicate a group of hosts compromised at the user level at depth one (meaning a direct attack) and root level at depth three (meaning two stepping­stone attacks were used).
Sentence 2: instead, we explore every reacha­bility group, walking backwards to discover the hosts using the group and forwards to discover the hosts exploited and vulnerabilities used through the group.
Relationship: neutral
Domain: Networks
Sentence 1: An RF channel is used for coordination of peer-to-peer sensing and sensor data exchange, and the actual sensing is performed using an ultrasonic channel.
Sentence 2: in the motion experiments where a valid solution was returned, 70% returned an accurate set of readings within one second after the laptop had come to rest, 90% within .ve seconds, and 95% within six sec­onds.
Relationship: neutral
Domain: Networks
Sentence 1: (a): collision due to retransmission at one-hop neighbor; (b): collision due to retransmission at two-hop neighbor; (c): timing diagram.
Sentence 2: proactive protocols (e.g., DSDV and OLSR) involve a large sig­naling overheard to establish routes for the .rst time and each time the network topology changes due to mobility or node failures.
Relationship: neutral
Domain: Networks
Sentence 1: Considering that the objective of this research is to evaluate the cost-benefit trade-off in terms of the additional topology knowledge achieved by applying each of the proposed strategies, at the cost of increasing the communication overhead, from our previous results we can argue that strategies TC=1 and TC=3 increase the communication overhead when compared to TC=0, for all values of MPR, but without providing any additional topology knowledge with respect to TC=0, therefore, no benefit is gained even when additional cost is paid.
Sentence 2: measurements were taken at the end of the simulation time.
Relationship: neutral
Domain: Networks
Sentence 1: Concerning t,in con­trast, the new protocol for periodic sensors is worse than the previousoneswhen d is very small, con.rming that pe­riodic sensors bene.t of moderately long awake period.
Sentence 2: such devices can model the general behavior of sensor nodes with harvesting capability which collect energy during the sleep periods and perform their duties during the awake periods.
Relationship: neutral
Domain: Networks
Sentence 1: As the electronic commerce is becoming more and more important and popular in the world, it is desirable to need a mechanism that allows two parties to sign a digital contract via the Internet.
Sentence 2: upon receiving (CA, VA, s1), Bob checks the validity of CA and VA, and whether h(m) = s1 e1 mod n. If all those veri.cations go through, Bob returns his signature sB to Alice, since he is convinced that the expected s2 = h(m)d2 mod n can be revealed by Bob or the TTP.
Relationship: neutral
Domain: Networks
Sentence 1: These few long .ows may not have enough entropy to uniformly distribute the load.
Sentence 2: flowBen­der s performance, like that of RPS and DeTail, su.ers with a larger fan-in degree due to synchronized packet arrivals to the destination ToR with the receiver s last hop being the bottleneck i.e., multipathing does not help in principle.
Relationship: neutral
Domain: Networks
Sentence 1: Un­der STDMA it is advantageous for the links to use maxi­mum transmission power when active and refrain from fur­ther power adaptation, cf.
Sentence 2: the input parameters for the dimensioning task are the locations of the wireless routers, the routes in the network and the tra.c parameters of each route (i.e., the o.ered load and the respective throughput requirement).
Relationship: neutral
Domain: Networks
Sentence 1: Node B is connected to the User Equipment (UE) via the Uu interface (based on the Wideband Code Division Multiple Access, WCDMA technology) and to the RNC via the Iub interface.
Sentence 2: [3] 3GPP, TR 22.146 v6.5.0, Technical Specification Group Services and System Aspects; Multimedia Broadcast/Multicast Service; Stage 1 (Release 6).
Relationship: neutral
Domain: Networks
Sentence 1: However, to resist against time varying misbehaviors, intermittent link availability, network congestion and most importantly misbehaving nodes when they comprise a con­siderable percentage of the network members and compro­mise most of the paths, a closed loop feedback system is proposed to react to these behaviors based on Path State Information (PSI) concept.
Sentence 2: although multipath routing and data forwarding imposes information redundancy at the .rst step, we argue that as it prolongs the route lifetime and reduces retransmissions it can achieve better overall perfor­mance saving that the system is tuned properly[11, 16, 20].
Relationship: neutral
Domain: Networks
Sentence 1: Based on the approximate equation (9), we may therefore after all say that as n tends to in.nity, the q-quantile of Rk denoted by rk (q, n) satis.es rk (q, n) = V log n + (k - 1) log(nmrk (q, n)2) - log(k - 1)!
Sentence 2: no exact analytical results exist for .nite n. There is hence a gap in the knowledge of the distribution of R that prevents accurately predicting the connectivity of this network model with a .nite number of nodes.
Relationship: neutral
Domain: Networks
Sentence 1: The analysis in this subsection demonstrates that Mc-Dis can support most duty cycles and even in the cases where the duty cycles cannot be directed supported, Mc-Dis can use neighboring duty cycles with almost negligible errors.
Sentence 2: the following requirements should be satis.ed:  Maximal discovery diversity/robustness with bounded (and minimal) worst-case discovery delay;  Support for heterogenous and arbitrary duty cycles to provide .ne-grained control of energy saving levels.
Relationship: neutral
Domain: Networks
Sentence 1: A minimum number of out-neighbours e and in-neighbours f is enforced by the algorithm (not shown in the sketch above for the sake of simplicity) so as to avoid disconnect­ing some peers from the overlay.
Sentence 2: the graph suggests that the overlay adapts to within about 10% of its .nal state in roughly 1, 000 chunks, i.e., about 100 seconds.
Relationship: neutral
Domain: Networks
Sentence 1: Another concern is that the extremely long delays we ob­ 0 102030405060 Time (s) served in cellular networks are due to Radio Resource Con­trol(RRC) statetransitions[1] ratherthanbu.erbloat.
Sentence 2: despite theirgrowing importance due to theboom of smart phones, we still lack a comprehensive study of bu.erbloat in cellular networks and its impact on TCP per­formance.
Relationship: neutral
Domain: Networks
Sentence 1: [11] A. Greenberg, J. R. Hamilton, N. Jain, S. Kandula, C. Kim, P. Lahiri, D. A. Maltz, P. Patel, and S. Sengupta.
Sentence 2: between any pair of end hosts in di.erent pods, there are (k/2)2 equal­cost paths, each of which corresponds to a core switch.
Relationship: neutral
Domain: Networks
Sentence 1: [9] Sacramento, V., Endler, M., Rubinsztejn, H. K., Lima, L. S., Gonalves, K., Nascimento, F.N., and Bueno, G. A.
Sentence 2: advances in telecommunications and computer engineering have enabled mobile and wireless networks, namely Mobile Ad-hoc NETwork (MANET), in which mobile nodes coordinate themselves to enable message routing in a totally decentralized fashion [1].
Relationship: neutral
Domain: Networks
Sentence 1: However, it provides new tools (e.g., the gen­eration of meaningful synthetic traces) to analyze novel cach­ing approaches in the future, and insight that has been missing to date on the caching schemes adopted in ICN ar­chitectures.
Sentence 2: 2.2 Architectures and Systems In-network caching of named content is a cornerstone of many ICN architectures [2, 17, 21].
Relationship: neutral
Domain: Networks
Sentence 1: The idea is that an underlying and unknownprobabilisticmodelhandles all thosecaseswheretwo ormorepeers ask toreceivefroma common otherpeer orfromthesource:howeverthesecases are handled, the greater the number of peers who all ask to receivefromacommon otherpeer orfromthesource(i.e.the higher congestion), the less likely it becomes, for each of them, to be precisely the one who actually receives.
Sentence 2: the focus is on simplerulesoftheform: certainpeers i .
Relationship: neutral
Domain: Networks
Sentence 1: The main contribution of this paper is: The implementation of a web switch in a multi­processor reconfigurable platform supporting TCP splicing  The proposed Connection Manager and the URL string parsing co-processors  The performance, power, and area evaluation and the comparison against a network processor-based and a software-based scheme  This paper is organized in the following way.
Sentence 2: the low power consumption in our scheme is mainly caused by the use of low frequency components.
Relationship: neutral
Domain: Networks
Sentence 1: Compared with available bandwidth measurement techniques, such as pathload which sends 12 streams of 100 packets in 15 sec­onds [21] and requires tomography to identify which is the constraining link, TSLP uses 2 packets every 5 minutes to sample a targeted interdomain link, and does not require a cooperative end-host at the other end of the path.
Sentence 2: we asked the ISPs involved to validate our inferences of this and other links that exhibit this behavior, but they are generally blocked by NDAs from sharing tra.c data.
Relationship: neutral