aelius

Muie Thread closed. Nu mai faceti atacuri la persoana pe forum ca va luati ban.

Ma tu esti interesat numai de hotii si smecherii ? Inainte de a deschide gura, verifica daca e si creierul conectat

Dany, sistemul asta de like si rep este la indemana utilizatorilor. Oricine poate da like, rep, -rep si toate cele. Ce vrei sa spuna Nytro, sa facem reguli de conduita ? Daca iti place ce am scris, esti liber sa dai + sau - rep. Nu stiu ce iti pare ciudat. Nu tine nimic aici de administrarea forumului. Uite un bun exemplu pentru care ai putea primi '-1' de la colegi: Adaugarea ta nu are nicio legatura cu subiectul acestui thread. Se pare ca gandesti tot romaneste.

Salut, - La punctul 1 nu te mai intereseaza partitionarea. Practic faci dd direct intre sda si sdb. Se cloneaza inclusiv partitiile. - Ai grija cu count. Toate comenzile sunt gresite in tutorial. (sau pe aproape, sunt pe fuga acum si nu am stat sa ma uit la fiecare) - Dimensiunea MBR-ului (boot, in cadrul primului punct la tine) este defapt 446 + 64 + 2 = 512 unde: * Primii 446 bytes = bootstrap * Urmatorii 64 bytes = tabela de partitie * Urmatorii 2 bytes = semnatura. - Cand clonezi doua discuri, setezi bs mare (exemplu: 2-4-6 MB). bs = cat sa citeasca odata (chunked like). De asemenea, nu mai specifici COUNT! Din manual: bs=BYTES ; read and write BYTES bytes at a time (also see ibs=,obs=) count=BLOCKS ; copy only BLOCKS input blocks Uite, nu pare sa fi facut imagine dupa intreg device-ul, nu ?! root@dell:~# dd if=/dev/sda of=test.img bs=512 count=1 1+0 records in 1+0 records out 512 bytes (512 copied, 0.000173764 s, 2.9 MB/s root@dell:~# du -csh test.img 4.0K test.img 4.0K total Referinta: http://linux.die.net/man/1/dd - Cu prietenie, Marian, dusmanul ciorilor

O persoana cu reputatie maricica ti-a dat -rep; Nu stiu exact cum functioneaza sistemul asta de reputatie. In orice caz, nu-l putem da la schimb pe tigari si cafea.

Si tu esti urat si ai nasul mare Aparent suntem liberi cu totii. Nu inteleg ce atata cearta pentru un futai de ban. Defapt, nici nu stiu exact pe ce va certati

Inca 7 zile ban, de la nasu mare

Am sters toate posturile aiurea + un warn si am redeschis threadul. E categoria RST Market, daca va trebuie, vorbiti cu omul si nu comentati aiurea ca va ard pe rug

Am sters toate posturile aiurea + un warn si am redeschis threadul. E categoria RST Market, daca va trebuie, vorbiti cu omul nu comentati aiurea ca va ard pe rug

Omule, un router bunicel costa 15.000 euro. Tu vrei sa-ti faci datacenter cu 8000 ?

@x00x: Ai dreptate, se fac abuzuri peste tot dar nu trebuie sa fim limitati si sa gandim asa. Iti spun din experienta, am avut parte de multe abuzuri din partea lor. Prezenta oamenilor care lucreaza in diverse structuri ale statului (SRI, MAI, etc) cred ca este binevenita la orice conferinta ce are legatura cu securitatea informatica. Chiar asta este si ideea, sa vada diferenta dintre un expert in securitate informatica (sa-i spunem generic: hacker) si un infractor care se uita sa fure banuti sau sa sparga diverse retele aiurea. Eu nu vin la DefCamp din alte motive dar va recomand sa mergeti. Aveti ocazia sa cunoasteti oameni buni si sa discutati multe.

Asa i-a invatat sistemul comunist. - Esti sysadmin si ai instalat apache + php + mysql pe un server abia instalat ? Pai esti vinovat, tu stii ca proprietarul serverului a facut spam de pe el ? - Scrii tutoriale si faci cursuri pentru elevi si studenti ? Pai nene, ala e site de hacking. - De ce folosesti linux si nu folosesti si tu windows ca toata lumea ? - Inculpatul avand o foarte buna pregatire tehnica constituie un real pericol pentru ordinea si linistea publica. - Am gasit instalata aplicatia NMAP ! Si da, sunt chestii reale, toate.

Sunt mai aberante legile in SUA de 1000 de ori fata de Romania.

Ce dracu ma, chiar la noi veniti cu rahaturi deastea ieftine?

Ai un pipe acolo in loc de argument awk -F "@" '{print $2}' | sort --unique > lista.txt

1. Solutie Pentru a le vedea: awk -F "@" '{print $2}' lista.txt Pentru a le salva: awk -F "@" '{print $2}' lista.txt > domenii.txt 2. Exemplu Am o lista: marian@hp:~$ cat lista.txt ion@hotmail.com george@usinternet.com vasile@yahoo.com Vreau sa vad doar domeniile: marian@hp:~$ awk -F "@" '{print $2}' lista.txt hotmail.com usinternet.com yahoo.com Vreau sa salvez domeniile in fisierul domenii.txt: marian@hp:~$ awk -F "@" '{print $2}' lista.txt > domenii.txt Au fost salvate: marian@hp:~$ cat domenii.txt hotmail.com usinternet.com yahoo.com

Este vorba de CVE-2013-1775 doar ca e cam prost explicata in acel PDF. Vulnerabilitatea este din 2013. Adaug userul marian in sudoers si verific daca este ok: root@hp:~# echo "marian ALL=(ALL:ALL) ALL" >> /etc/sudoers root@hp:~# grep marian /etc/sudoers marian ALL=(ALL:ALL) ALL Incerc intr-un terminal: marian@hp:~$ sudo su - [sudo] password for marian: root@hp:~# La cateva secunde, incerc in al II-lea terminal. Se pare ca-mi cere iar parola. marian@hp:~$ sudo su - [sudo] password for marian: Functioneaza pe versiunile 1.6.0 - 1.7.10 Mai multe detalii aici: - Authentication bypass when clock is reset - CVE - CVE-2013-1775 

Dincolo era mai ieftin; Da-l ma si tu GRATUIT la un student de aici; Macar o fapta buna sa faci in viata ta mizerabila ))))

E al lu Radu Tofan (si in spate se afla Eugenie Staicut, bosorogul de la RoTLD care nu mai vrea sa moara odata). Manereli cu domenii si srl-uri capusa.

E categorie Off-topic -> Non-IT; si invatati sa folositi EDIT la futaiu de post.

Salutari, Am un BlackBerry Curve 8520 si nu-mi vede sim-ul din alta retea. Cum nu-mi place sa fac pe meseriasul si ma ocup de altele las sa faca altul treaba. Simplu: Trimiteti mesaj privat cu ce detalii aveti nevoie + adresa de paypal si costul. Multumesc

Hai sictir

There is special type of DDoS attacks, application level DDoS, which is quite hard to combat against. Analyzing logic which filters this type of DDoS attack must operate on HTTP message level. So in most cases the logic is implemented as custom modules for application layer (usually nowadays user space) HTTP accelerators. And surely Nginx is the most widespread platform for such solutions. However, common HTTP servers and reverse proxies were not designed for DDoS mitigation- they are simply wrong tools for this issue. One of the reason is that they are too slow to combat with massive traffic (see my recent paper and presentation for other reasons). If logging is switched off and all content is in cache, then HTTP parser becomes the hottest spot. Simplified output of perf for Nginx under simple DoS is shown below (Nginx’s calls begin with ’ngx’ prefix, memcpy and recv are standard GLIBC calls): % symbol name 1.5719 ngx_http_parse_header_line 1.0303 ngx_vslprintf 0.6401 memcpy 0.5807 recv 0.5156 ngx_linux_sendfile_chain 0.4990 ngx_http_limit_req_handler The next hot spots are linked to complicated application logic (ngx vslprintf ) and I/O. During Tempesta FW development We have studied several HTTP servers and proxies (Nginx, Apache Traffic Server, Cherokee, node.js, Varnish and userver) and learned that all of them use switch and/or if-else driven state machines. The problem with the approach is that HTTP parsing code is comparable in size with L1i cache and processes one character at a time with significant number of branches. Modern compilers optimize large switch statements to lookup tables that minimizes number of conditional jumps, but branch misprediction and instruction cache misses still hurt performance of the state machine. So the method probably has poor performance. The other well-known approach is table-driven automaton. However, simple HTTP parser can have more than 200 states and 72 alphabet cardinality. That gives 200 x 72 = 14400 bytes for the table, which is about half of L1d of modern microprocessors. So the approach is also could be considered as inefficient due to high memory consumption. The first obvious alternative for the state machine is to use Hybrid State Machine (HSM) described in our paper, which combines very small table with also small switch statement. In our case we tried to encode outgoing transitions from a state with at most 4 ranges. If the state has more outgoing transitions, then all transitions over that 4 must be encoded in switch. All actions (like storing HTTP header names and values) must be performed in switch. Using this technique we can encode each state with only 16 bytes, i.e. one cache line can contain 4 states. Giving this the approach should have significantly improve data cache hit. We also know that Ragel generates perfect automatons and combines case labels in switch statement with direct goto labels (it seems switch is used to be able to enter FSM from any state, i.e. to be able to process chunked data). Such automatons has lower number of loop cycle and bit faster than traditional a-loop-cycle-for-each-transition approach. There was successful attempt to generate simple HTTP parsers using Ragel, but the parsers are limited in functionality. However there are also several research papers which says that an automaton states is just auxiliary information and an automaton can be significantly accelerated if state information is declined. So the second interesting opportunity to generate the fastest HTTP parser is just to encode the automaton directly using simple goto statements, ever w/o any explicit loop. Basically HTTP parsers just matches a string against set of characters (e.g. [A-Za-z_-] for header names), what strspn(3) does. SSE 4.2 provides PCMPSTR instructions family for this purpose (GLIBC since 2.16 uses SSE 4.2 implemenetation for strspn()). However, this is vector instruction which doesn't support accept or reject sets more than 16 characters, so it's not too usable for HTTP parsers. Results I made a simple benchmark for four approaches described above (http_ngx.c - Nginx HTTP parsing routines, http_table.c - table-driven FSM, http_hsm.c - hybrid state machine and http_goto.c - simple goto-driven FSM). And here are the results (routines with 'opt' or 'lw' - are optimized or lightweight versions of functions): Haswell (i7-4650U) Nginx HTTP parser: ngx_request_line: 730ms ngx_header_line: 422ms ngx_lw_header_line: 428ms ngx_big_header_line: 1725ms HTTP Hybrid State Machine: hsm_header_line: 553ms Table-driven Automaton (DPI) tbl_header_line: 473ms tbl_big_header_line: 840ms Goto-driven Automaton: goto_request_line: 470ms goto_opt_request_line: 458ms goto_header_line: 237ms goto_big_header_line: 589ms Core (Xeon E5335) Nginx HTTP parser: ngx_request_line: 909ms ngx_header_line: 583ms ngx_lw_header_line: 661ms ngx_big_header_line: 1938ms HTTP Hybrid State Machine: hsm_header_line: 433ms Table-driven Automaton (DPI) tbl_header_line: 562ms tbl_big_header_line: 1570ms Goto-driven Automaton: goto_request_line: 747ms goto_opt_request_line: 736ms goto_header_line: 375ms goto_big_header_line: 975ms Goto-driven automaton shows the better performance in all the tests on both the architectures. Also it's much easier to implement in comparison with HSM. So in Tempesta FW we migrated from HSM to goto-driven atomaton, but with some additional optimizations. Lessons Learned ** Haswell has very good BPU ** Core micro-architecture has show that HSM behaves much better than switch-driven and table-driven automatons. While this is not the case for Haswell - the approach loses to both the approaches. I've tried many optimizations techniques to improve HSM performance, but the results above are the best and they still worse than the simple FSM approaches. Profiler shows that the problem (hot spot) in HSM on Haswell is in the following code if (likely((unsigned char)(c - RNG_CB(s, 0)) <= RNG_SUB(s, 0))) { st = RNG_ST(s, 0); continue; } Here we extract transition information and compare current character with the range. In most cases only this one branch is observer in the test. 3rd and 4th branches are never observed. The whole automaton was encoded with only 2 cache lines. In first test case, when XTrans.x structure is dereferenced to get access to the ranges, the compiler generates 3 pointer dereferences. In fact these instructions (part of the disassembled branch) sub 0x4010c4(%rax),%bl cmp 0x4010c5(%rax),%bl movzbl 0x4010cc(%rax),%eax produce 3 accesses to L1d and the cache has very limited bandwidth (64 bytes for reading and 32 bytes for writing) on each cycle with minimal latency as 4 cycles for Haswell. While the only one cache line is accessed by all the instructions. So the test case bottle neck is L1d bandwidth. If we use XTrans.l longs (we need only l[0], which can be loaded with only one L1d access, in all the cases) and use bitwise operations to extract the data, then we get lower number of L1d accesses (4G vs 6.7G for previous cases), but branch mispredictions are increased. The problem is that more complex statement in the conditions makes harder to Branch Prediction Unit to predict branches. However, we can see that simple branches (for switch-driven and goto-driven automatons) show perfect performance on Haswell. So advanced Haswell BPU perfectly processes simple automatons making complex HSM inadequate. In fact HSM is only test which is slower on Haswell in comparison with Core Xeon. Probably, this is the difference between server and mobile chips that ever old server processor beats modern mobile CPU on complex loads... -O3 is ambiguous Sometimes -O3 (GCC 4.8.2) generates slower code than -O2. Also benchmarks for -O3 show very strange and unexpected results. For example the below are results for -O2: goto_request_line: 470ms However, -O3 shows worse results: goto_request_line: 852ms Automata must be encoded statically whenever possible Table-driven and HSM automaton are encoded using static constant tables (in difference with run-time generated tables for current DPI parser). This was done during HSM optimizations. Sometimes compiler can't optimize code using run-time generated tables. And this is crucial for real hot spots (for HSM the table is used in the if-statement described above which gets about 50-70% of whole the function execution time) - after the moving to the static data the code can get up to 50% performance improvement (the case for HSM). Source: High Performance Linux: Fast Finite State Machine for HTTP Parsing Refs: - Tempesta FW is a hybrid solution which combines reverse proxy and firewall at the same time. It accelerates Web applications and provide high performance framework with access to all network layers for running complex network traffic classification and blocking modules - http://natsys-lab.com/tpl/tempesta_fw.pdf

Sa-i dam la muie de sobolan de stepa. Thread closed.

Doua servere la preturi f. bune. (fara setup fee) Intel Core i5-3570 @ 3.4 GHz 4 Cores, 4 Threads, 6 MB Cache 32 GB DDR3 Memory 2 x 500 GB SATA [Raid 1 Software] 2 IP Addresses with reverse dns 100 Mbps Guaranteed Monthly traffic: 20 TB Monthly cost: 50 euro Activation time: 10 minutes Haswell Intel CPU Intel i5-4570 @ 3.2 Ghz 4 Core, 4 Threads, 6MB L2 Cache 16 GB DDR3 Memory 1 x 240 GB SSD Force 3 (6Gb/s, 85.000 IOPS) 100 Mbps (to any destination) 20 TB Monthly traffic Monthly traffic: 20 TB Monthly cost: 40 euro Activation time: 10 minutes // edit: i5-4570 s-a dat; Doar primul mai este disponibil. // edit: s-au dat ambele.