Runs of Ones in Binary Strings

We give three different computations of the total number of runs of length $i$ in binary $n$-strings, and we discuss the connection of this problem with the compositions of $n$.