IT

CESO 2003
IT Baseline Knowledge for the

Biomedical Professional
Jeff Kabachinski
October 31st, 2003
CESO 2003 IT Baseline Knowledge for the Biomed
Today’s Agenda
 Technology growth in the Communications Age
 Strategies for keeping up with the pace of IT growth
 Strategy – Build your own KMS or knowledge

foundation by assembling knowledge bits
 Strategy – create a reference library that makes

sense to you
 Strategy – create your own acronyms

Today’s Agenda
 Technology growth & the effect on the psyche
 Strategy – Build your own KMS or knowledge
foundation by assembling knowledge bits
 Today’s Knowledge Bits
Accelerated Learning – Networking Overview
including: Repeaters, Bridges & Routers – the
difference between distance vector routing and link
state routing
 Strategy – create a reference library that makes
sense to you
 An Excellent Start: Newton’s Telecomm Dictionary
 Strategy – create your own acronyms
 Create a few and share some best practices
Technology Growth
It took us 6000 years of history to move from the

Agricultural to the Industrial Age.
From 1815 to 1950 most workers were industrial

workers
Beginning ~ 1960 – we were in the Service Age where

there were more working in Services than in
manufacturing.
By the late 1970’s - we were in the Information Age

Technology Growth
An now we’re in the Communication Age

– where there are more workers employed in media,
news, magazines, books, computers and computer
networks (including the Internet) and education than
anything else
From Brute Force to Brain Force

Technology Growth
Moore’s law – information processing doubles every 18
months and halves in cost @ the same time.
The observation made in 1965 by Gordon Moore, co-founder of

Intel, that the number of transistors per square inch on
integrated circuits had doubled every year since the
integrated circuit was invented. Moore predicted that this
trend would continue for the foreseeable future. In
subsequent years, the pace slowed down a bit, but data density
has doubled approximately every 18 months, and this is the
current definition of Moore's Law, which Moore himself has
blessed. Most experts, including Moore himself, expect
Moore's Law to hold for at least another two decades
Processor Year Introduced Transistors

4004 1971 2,250
8008 1972 2,500
8080 1974 5,000
8086 1978 29,000
286 1982 120,000
386™ processor 1985 275,000
486™ DX processor 1989 1,180,000
Pentium® processor 1993 3,100,000
Pentium II processor 1997 7,500,000
Pentium III processor 1999 24,000,000
Pentium 4 processor 2000 42,000,000

Technology Growth
Technology Growth
Cognitive Ability
Rate of Complexity
Jeff’s
Cognitive Ability
Time
Technology Growth
For Example
Today’s Lexus:
 has more computing circuits that the Apollo 13 did
 which was the most advanced of its time – 35 years
ago (1968).
There’s more cost in electronics than in steel.
Technology Growth
For Example
If the auto industry had kept pace with Moore’s Law,

today’s Lexus:
 Would cost $2
 Would get 700mpg
 It’s top speed would be ~ 500mph
Knowledge is doubling every 2 to 3 years (1996)

Knowledge will double every year by 2000
Reading
• The highest paid read 2 to 3 hours a day
• Lowest paid – 0
• 80% don’t read at all
• 70% haven’t been in a bookstore
• 58% don’t read another book after high school
• 42% don’t read another book after college
Adding up the Knowledge Bits for Pattern Recognition
“Luck plus preparation equals opportunity”

Vince Lombardi
“I will study and prepare myself

and someday my chance will come ”
Abraham Lincoln
“Ignorance is no obstacle to advancement ”

Abraham Lincoln
Microsoft in 1978
Repeater Basics
Common Repeater
Legend:
T - T r a n s c e iv e r o r M A U
5 0 - 5 0 o h m t e r m in a t o r
50
T R epeater T 50
N ode 1 N ode 2
S tart the
Ethernet
A ttem pt to
T r a n s m it
IEEE 802.3
CSMA/CD Flow Chart C a r r ie r Yes
D efer the
Random
A ttem pt to
S ense T im e - O u t
T r a n s m it
Truncated Binary N o
Exponential Back-off
• 51.2µS increments S tart
to
• 0 < r < 2k T r a n s m it
• k = the # of transmit
attempts
• r = a random number C o llis io n Yes S top
S end
Random
Jam m er
that gets x 51.2µS D e t e c t io n T r a n s m it
S ig n a l
T im e - O u t
N o
Jammer signal = 4 bytes

of all 1’s or 3.2µS of a End
carrier T r a n s m it
Repeater Basics
Multi-Port Repeater
50 R epeater Card 1 50
N ode 1 N ode 2
N ode 3 N ode 4
N ode 5 N ode 6
N ode 7 N ode 8
Repeater Basics
Multi-Port Repeater
N ode 1 R epeater Card 1 N ode 2

Repeater Basics
Hub
Bridge Basics
Common Bridge
Node Node
2 5
A B
50 T T T Bridge T T T 50
Node Node Node Node

1 3 4 6
From :
S ource A ddress
37¢
0 0 :0 0 :1 D :A F :B 9 :2 8
T o:
D e s t in a t io n A d d r e s s
0 2 :6 0 :B C :6 E :1 A :7 F
Ethernet
Data Packet Architecture
P r e a m b le A d d r e s s in g Length D ata CRC
T im in g F r a m e D e s t in a t io n S ource A m o u n t o f d a t a e n c lo s e d Checksum
Can vary from 46 bytes to
7 B ytes 1 6 bytes 6 bytes 2 bytes
15 0 0 b ytes
4 bytes
1 0 1 0 1 0 1 0 1 0 1 ....
a lt e r n a t in g 1 s & 0 s
S F D : 10 10 10 11
0 0 :0 0 :A 1 :F D :2 3 :C 9 0 0 :0 0 :A 1 :1 E :0 4 :1 2
Bridge Basics
Multi-Port Bridge
N ode N ode
2 5
A B
50 T T T B r id g e T T T 50
N ode N ode
N ode N ode N ode N ode
8 11
1 3 4 6
C D
50 T T T B r id g e T T T 50
N ode N ode
14 17
7 9 10 12
T E F T
50 T T B r id g e T T 50

13 15 16 18
Bridge Basics
Multi-Port Bridge
N ode 1 B r id g e C a r d 1 N ode 2
Bridge Basics
Switch
Ethernet
T im in g F r a m e D e s t in a t io n S ource A m o u n t o f d a t a e n c lo s e d Checksum
Can vary from 46 bytes to
7 B ytes 1 6 bytes 6 bytes 2 bytes
15 0 0 b ytes
4 bytes
1 0 1 0 1 0 1 0 1 0 1 ....
a lt e r n a t in g 1 s & 0 s
S F D : 10 10 10 11
0 0 :0 0 :A 1 :F D :2 3 :C 9 0 0 :0 0 :A 1 :1 E :0 4 :1 2
TCP/IP Protocol
IP Data Packet Architecture
Ethernet packet
IP packet
A d d r e s s in g H eader Checksum "O th e r I nfo" D ata
D e s t in a t io n S ource
Distance
Routing Vector
Basics -Routing
RIP A
Routing Information Protocol C
B Router 1
Router 3
Router 2
Router 4
Routing Basics - RIP A
B Router 1
Router 3
Router 2
Router 1 Table
Net ID Router Connection Hop Count
A Router 1 1 Router 4
B Router 1 1
C Router 1 1
B Router 1
Router 3
Router 2
Router 2 Table
C Router 2 3 Router 4
D Router 2 2
E Router 2 1
B Router 1
Router 3
Router 2
Router 1 Table
A Router 1 1
B Router 1 1
Router 4
C Router 1 1
E Router 2 1+1=2
D Router 2 2+1=3
C (Alt.) Router 2 3+1=4
A
Routing Basics - RIP
C
B Router 1
Router 3
D
E
Router 1 Table Router 2

A Router 1 1
Router 4
C Router 1 1
C (Alt) Router 2 3+1=4
D Router 3 1+1=2
D (Alt) Router 2 2+1=3
E Router 2 1+1=2
E (Alt) Router 3 2+1=3
B Router 1 1
B (Alt) Router 3 3+1=4
A B C D
Router 1 Router 2 Router 3
3 2 1
4 (Alt)
A B C D
3 2
4
A B C D
3 2
5 4
A B C D
3 2
5 4
6
A B C D
3 2
5 4
7 6
8
A B C D
Stop the Madness !

Link
Routing
State
Basics
Routing
- OSPF A cost = 2
Open Shortest Path First C cost = 2
B cost = 6 Router 1
Router 3
D cost = 3
E cost = 4
Router 2
Router 4
Routing Basics - OSPF A cost = 2
C cost = 2
B cost = 6 Router 1
Router 3
D cost = 3
E cost = 4
Router 2
Router 1 Table
Net ID Router Connection Cost
B Router 1 6
C Router 1 2
C cost = 2
B cost = 6 Router 1
Router 3
D cost = 3
E cost = 4
Router 2
Router 2 Table
D Router 4 7
E Router 2 4
C cost = 2
B cost = 6 Router 1
Router 3
D cost = 3
E cost = 4
Router 1 Table Router 2

A Router 1 2
B Router 1 6
E Router 2 4+6=10
D Router 2 7+6=13
C (Alt.) Router 2 9+6=15
C cost = 2
B cost = 6 Router 1
Router 3
D cost = 3
E cost = 4
Router 2
Router 1 Table
C Router 1 2
C (Alt) Router 2 15
D Router 3 3+2=5
D (Alt) Router 2 13
E Router 2 10
E (Alt) Router 3 7+2=9
B Router 1 9
B (Alt) Router 3 13+2=15
IP Addressing Scheme
The Big Idea:
• Routers use the Net ID to determine which network the device is on.
• The Node ID is the specific node location or address on that network.
In a Class A IP address, the first byte is used as the Network ID and

the last 3 bytes are the node ID:
1st byte 2nd byte 3rd byte 4th byte
Net ID Node ID Node ID Node ID
0 - 127 X X X
The Big Idea:
In a Class B IP address, the first 2 bytes are used as the Network ID

and the last 2 bytes are the node ID:
Net ID Net ID Node ID Node ID
128 - 191 0 – 255 X X
The Big Idea:
In a Class C IP address, the first 3 bytes are used as the Network ID

and the last byte are the node ID:
Net ID Net ID Net ID Node ID
192 - 223 0 – 255 0 – 255 X
IP Addressing Scheme 220.8.62.0
112.0.0.0
151.186.0.0 Router 1
Router 3
134.91.0.0
193.231.12.0
Router 2
Router 4
220.8.62.0
112.0.0.0
151.186.0.0 Router 1
Router 3
134.91.0.0
193.231.12.0
Router 2
Router 1 Router
Net ID Hop Count
Table Connection
Router 4
220.8.62.0 Router 1 1
112.0.0.0 Router 1 1
Alternate route 112.0.0.0 Router 2 3+1=4
134.91.0.0 Router 3 1+1=2
193.231.12.0 Router 2 1+1=2
151.186.0.0 Router 1 1
TCP/IP Protocol
IP Data Packet Architecture
Ethernet packet
IP packet
D e s t in a t io n S ource
TCP/IP Protocol
Ethernet packet
IP packet
TCP packet
D atagram
A d d r e s s in g S eq. # A ck. # F la g s D ata
Checksum
S ource Port D e s t in a t io n P o r t
TCP/IP Protocol
Ethernet packet
IP packet
UDP packet
A d d r e s s in g D ata Length H eader Checksum D ata
D e s t in a t io n P o r t S ource Port
OSI Model Basics

The Layers
Layer Name Keywords
7 Application Semantics
6 Presentation Syntax
5 Session Dialog Coordination
4 Transport Reliable Data Transfer
3 Network Routing and Relaying
2 Data Link Technology-Specific Transfer
1 Physical Physical Connections
OSI Reference Model
Application Defining the app socket
Presentation Defining the data format
Session Defining the connection
Logical Link Control Transport Transfer of data
Media Access Control Network Identifying your location on

the Network
Method for getting data on
Data Link & off the media
Physical Medium for transfer of signal

OSI Reference Model

NOS
TCP/UDP Transport Transfer of data
Identifying your location on

IP Network the Network
Ethernet Data Link & off the media
Wires Physical Medium for transfer of signal

OSI Reference Model
Routers Transport Transfer of data

Bridges Network the Network
Repeaters Data Link & off the media

OSI Reference Model

Gateways
Transport Transfer of data

Network the Network
Data Link & off the media

A strategy to keep pace - The JIT Genius Plan
Knowledge Bits like these can help with your pattern

recognition and build a foundation of network savvy
The JIT Genius Plan

4. Work on the foundation
5. Build a reference library
6. Create your own acronyms

The JIT Genius Plan
•
• Build a reference library

• Newton's Telecom Dictionary is a great reference for
telecom, data communications, networking, computing,
and the Internet. With over 21,000 definitions it weighs
in at over four times larger than any other telecom and
IT dictionary, and includes wireless, broadband,
intranet, e-commerce, and IT terms.
• Newton explains technical concepts in non-technical
language. This has made the book an essential reference
tool to anyone managing network and telecom systems
and services.
Says Harry,
"I wrote this book for those of us new (and old) to the
world's most exciting industry. That's what my publishers
would have me say. But, I really wrote the book for
myself. I simply want to keep up. Defining a term is the
best way I know of understanding it. The good news is
I'm not an engineer; I can't write incomprehensible
technical explanations. I can write explanations business
people (like me) will understand. Some of my definitions
are short. Some are long. Many are mini-tutorials. My
definitions of a term explain how it's used, its benefits,
its pluses, and its minuses.”
Knowledge Bits like these can help with your pattern

recognition and build a foundation of network savvy
The JIT Genius Plan

4. Work on the foundation
5. Build a reference library
6. Create your own acronyms
It doesn’t mean that you’ll end up looking like Bill Gates
Enjoy This Year’s Conference!

IT

Enviado por

Dados do documento

Descrição original:

Título original

Direitos autorais

Formatos disponíveis

Compartilhar este documento

Compartilhar ou incorporar documento

Opções de compartilhamento

Você considera este documento útil?

Este conteúdo é inapropriado?

Direitos autorais:

Formatos disponíveis

IT

Enviado por

Direitos autorais:

Formatos disponíveis

CESO 2003

IT Baseline Knowledge for the

 Technology growth in the Communications Age

 Strategies for keeping up with the pace of IT growth

 Strategy – Build your own KMS or knowledge

 Strategy – create a reference library that makes

 Strategy – create your own acronyms

It took us 6000 years of history to move from the

From 1815 to 1950 most workers were industrial

Beginning ~ 1960 – we were in the Service Age where

By the late 1970’s - we were in the Information Age

An now we’re in the Communication Age

From Brute Force to Brain Force

The observation made in 1965 by Gordon Moore, co-founder of

Processor Year Introduced Transistors

8008 1972 2,500

8080 1974 5,000

8086 1978 29,000

286 1982 120,000

386™ processor 1985 275,000

486™ DX processor 1989 1,180,000

Pentium® processor 1993 3,100,000

Pentium II processor 1997 7,500,000

Pentium III processor 1999 24,000,000

Pentium 4 processor 2000 42,000,000

If the auto industry had kept pace with Moore’s Law,

Knowledge is doubling every 2 to 3 years (1996)

Adding up the Knowledge Bits for Pattern Recognition

“Luck plus preparation equals opportunity”

“I will study and prepare myself

“Ignorance is no obstacle to advancement ”

Jammer signal = 4 bytes

N ode 3 R epeater Card 2 N ode 4

N ode 5 R epeater Card 3 N ode 6

N ode 7 R epeater Card 4 N ode 8

Node Node Node Node

P r e a m b le A d d r e s s in g Length D ata CRC

N ode N ode N ode N ode

P r e a m b le A d d r e s s in g Length D ata CRC

Routing Information Protocol C

Routing Basics - RIP A

Routing Basics - RIP A

Routing Basics - RIP A

Net ID Router Connection Hop Count

Routing Basics - RIP

Router 1 Router 2 Router 3

Routing Basics - RIP

Router 1 Router 2 Router 3

Routing Basics - RIP

Router 1 Router 2 Router 3

Routing Basics - RIP

Router 1 Router 2 Router 3

Routing Basics - RIP

Router 1 Router 2 Router 3

Routing Basics - RIP

Router 1 Router 2 Router 3

Stop the Madness !

Open Shortest Path First C cost = 2

Routing Basics - OSPF A cost = 2

Routing Basics - OSPF A cost = 2

Routing Basics - OSPF A cost = 2

Router 1 Table Router 2