Author: Paolo Ardoino

skbuff are buffers used by Linux network layers ; its structure is defined in <linux/skbuff.h> .
skbuffs are linked lists as we can easily see :

1
2
3

        /* These two members must be first . */
        struct sk_buff          *next; // Next buffer in list
        struct sk_buff          *prev; // Previous buffer in list

Follows the description of all fields of the structure taken from the header file:

Read the rest of this entry »

Author: Paolo Ardoino
PageRank relies on the uniquely democratic nature of the web by using its vast link structure as an indicator of an individual page’s value. In essence, Google interprets a link from page A to page B as a vote, by page A, for page B. But, Google looks at more than the sheer volume of votes, or links a page receives; it also analyzes the page that casts the vote. Votes cast by pages that are themselves “important” weigh more heavily and help to make other pages “important”. by Google

PR(A) = (1 – d) + d (PR(T1) / C(T1) + … + PR(Tn) / C(Tn))

PR(A): Pagerank of a page A

d = 0.85

PR(Ti): Pagerank of page Ti which links to A

C(Ti): number of outbound links on page Ti, which has given the link Average Links per Page = 40

The following PHP script generates a simple chart that could be usefull to know how many links are needed
to increase pagerank; it takes script taking average links per page as parameter
Read the rest of this entry »