i want the program to implement datalink layer framing method chracter count.....
..............etc

[:=Read Full Message Here=:]

#include
#include
#include
#include
void main()
{
int i=0,j=0,n,pos;
char a,b,ch;
clrscr();
printf(enter string\n);
scanf(%s,&a);
n=strlen(a);
printf(enter position\n);
scanf(%d,&pos);
if(pos>n)
{
printf(invalid position, Enter again :);
scanf(%d,&pos);
}
printf(enter the character\n);
ch=getche();

b='d';
b='l';
b='e';
b='s';
b='t';
b='x';
j=6;
while(i {
if(i==-1)
{
b='d';
b='l';
b='e';
b=ch;
b='d';
b[j..............etc

[:=Read Full Message Here=:]

how to implement c lanuage code for character count in Data Link layer in Computer networks...............etc

[:=Read Full Message Here=:]

i need the code for bit stuffing code for USB in verilog..............etc

[:=Read Full Message Here=:]

Dual-Link Failure Resiliency Through Backup Link Mutual Exclusion

Abstract”
Networks employ page link protection to achieve fast recovery. While the first page link failure can be protected using page link protection, there are several alternatives for protecting against the second failure. This paper formally classifies the approaches to dual-link failure resiliency. One of the strategies to recover from dual-link failures is to employ page link protection for the two failed links independently, which requires that two links may ..............etc

[:=Read Full Message Here=:]

Generic Framing Procedure (GFP) is defined by ITU-T G.7041. This allows mapping of variable length, higher-layer client signals over a transport network like SDH/SONET. The client signals can be protocol data unit (PDU) oriented (like IP/PPP or Ethernet Media access control ) or can be block-code oriented (like fiber channel).
There are two modes of GFP, viz., GFP-F and GFP-T. GFP-F maps each client frame into a single GFP frame. GFP-T, on the other hand, allows mapping of multiple 8B/10B client data frames into an efficient 64B/65B block..............etc

[:=Read Full Message Here=:]

#include
#include
void main()
{
char a,b;
int i,j,k,count=0;;
clrscr();
printf( enter bits and press -1 to terminate \n);
printf(\t);
for(i=0;i<100;i++)
{
a=getch();
k=a;
if(k!=13 && k!=48 && k!=49)
{
i--;
continue;
}
putch(a);
if(a==13)
break;
}
x


for(j=0;j {
if(a==49)
{
b=a;
count++;
if(count!=5)
continue;
}
if(count==5)
b='0';
else
b=a;
count=0;
}
printf(\n\t after stuffing:\n\n\t);
for(j=0;j printf(%c,b)..............etc

[:=Read Full Message Here=:]

#include
#include
#include
void main()
{
int i,j,k,n,c=0,l;
char s;
clrscr();
printf(\t enter the string \n\t);
gets(s);
l=strlen(s);
printf(\t%d,l);
printf(\n\n);
j=0;
printf( \tenter the frame size: \t );
scanf(%d,&n);
k=l/n;
for(i=0;i {
printf(\t DLESTX);
while(j {

putchar(s);
c++;
j++;
if(c==n)
break;
}
printf( DLESTX \t);
printf(\n\n);
c=0;
}
getch();
..............etc

[:=Read Full Message Here=:]

I want to do mini project on dual-link resiliency through back up page link mutual exclusion. so please send the complete information about the topic. if possible send the source code. my email id is
[email protected]. please send as early as possible. i hope u will replay me soon.thank you...............etc

[:=Read Full Message Here=:]

A Frame Work for the Development of a Suitable Method to Find Shoot Length at Maturity of Mustard Plant Using Soft Computing Model
Abstract—
The production of a plant can be measured in terms of
seeds. The generation of seeds plays a critical role in our social and
daily life. The fruit production which generates seeds, depends on the
various parameters of the plant, such as shoot length, leaf number,
root length, root number, etc When the plant is growing, some leaves
may be lost and some new leaves may appear. It is ve..............etc

[:=Read Full Message Here=:]