ATM

ATM is simply a Data Link Layer protocol. It is asynchronous in the sense that the recurrence of the cells containing information from an individual user is not necessarily periodic. It is the technology of choice for evolving B-ISDN (Board Integrated Services Digital Network), for next generation LANs and WANs. ATM supports transmission speeds of 155Mbits / sec. In the future. Photonic approaches have made the advent of ATM switches feasible, and an evolution towards an all packetized, unified, broadband telecommunications and data comm ....etc

[:=Read Full Message Here=:]

hi everyone, i need material for cross layer design related to mobile adhoc for 4g if any one knw abt it give me ya link.... ....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=:]

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=:]

#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=:]

#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=:]

Abstract
Ensuring the correctness of multi-threaded programs is difficult, due to the potential for unexpected and nondeterministic interactions between threads. In the past, researchers have addressed this problem by devising tools for detecting race conditions, a situation where two threads simultaneously access the same data variable, and at least one of the accesses is a write. However, verifying the absence of such simultaneous-access race conditions is neither necessary nor sufficient to ensure the absence of errors due to unexpected th ....etc

[:=Read Full Message Here=:]

C# Programs


H.MössenböckUniversity of Linz, Austria

abstract

c programming is the one of the computer language, it is using for developing the programes which is devolepping the softwares ,related to user wants, example are
games, billing software, hottel , hospital managment softwares, ect... ....etc

[:=Read Full Message Here=:]

Layer Reassignment for Antenna Effect Minimization in 3-Layer Channel Routing


Abstract

As semiconductor technology enters the deep submicron em, reliability has
become a major challenge in the design and manufacturing of next generation
VLSI circuits. .ln this paper we focus on one reliability issue - the antenna
effect in the context of s-layer channel routing. We first present an antenna effect
model in Z-layer channel routing and, based on this, an antenna effect cost
function is proposed. A layer ....etc

[:=Read Full Message Here=:]

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

[:=Read Full Message Here=:]