FC Connenctivity

FC CONNECTIVITY


The FC architecture supports three basic interconnectivity options point to point , arbitrated loop  ,and Fibre Channel switched fabric.

POINT-TO-POINT
  1. Point-to-point is simplest FC configuration in which two devices are connected directly to each other.
  2. This configuration provides a dedicated connection for data transmission between nodes.
  3. The point-to-point configuration offers limited connectivity , because only two devices can communicate with each other at a given time.
  4. It can not be scaled to accommodate a large number of nodes.
  5. Standard DAS uses point-to-point connectivity.
Fig. point to point connectivity

FIBRE CHANNEL ARBITRATED LOOP
  1. In FC-AL configuration devices are attached to a shared loop.
  2.  FC-AL has a characteristics of a token ring topology and a physical star topology.
  3. In FC-AL each device contents with other devices to perform I/O operations.
  4. Devices on the loop must “arbitrated” to gain control of the loop. At any given time , only one device can perform  I/O operations on the loop.
  5. The FC-AL implementation may also use hubs whereby the arbitrated loop is physically connected in a star topology.

Python Programming ↓ 👆
Java Programming ↓ 👆
JAVA EasyExamNotes.com covered following topics in these notes.
JAVA Programs
Principles of Programming Languages ↓ 👆
Principles of Programming Languages
EasyExamNotes.com covered following topics in these notes.

Practicals:
Previous years solved papers:
A list of Video lectures References:
  1. Sebesta,”Concept of programming Language”, Pearson Edu 
  2. Louden, “Programming Languages: Principles & Practices” , Cengage Learning 
  3. Tucker, “Programming Languages: Principles and paradigms “, Tata McGraw –Hill. 
  4. E Horowitz, "Programming Languages", 2nd Edition, Addison Wesley

    Computer Organization and Architecture ↓ 👆

    Computer Organization and Architecture 

    EasyExamNotes.com covered following topics in these notes.

    1. Structure of desktop computers
    2. Logic gates
    3. Register organization
    4. Bus structure
    5. Addressing modes
    6. Register transfer language
    7. Direct mapping numericals
    8. Register in Assembly Language Programming
    9. Arrays in Assembly Language Programming

    References:

    1. William stalling ,“Computer Architecture and Organization” PHI
    2. Morris Mano , “Computer System Organization ”PHI

    Computer Network ↓ 👆
    Computer Network

    EasyExamNotes.com covered following topics in these notes.
    1. Data Link Layer
    2. Framing
    3. Byte count framing method
    4. Flag bytes with byte stuffing framing method
    5. Flag bits with bit stuffing framing method
    6. Physical layer coding violations framing method
    7. Error control in data link layer
    8. Stop and Wait scheme
    9. Sliding Window Protocol
    10. One bit sliding window protocol
    11. A protocol Using Go-Back-N
    12. Selective repeat protocol
    13. Application layer
    References:
    1. Andrew S. Tanenbaum, David J. Wetherall, “Computer Networks” Pearson Education.
    2. Douglas E Comer, “Internetworking with TCP/IP Principles, Protocols, And Architecture",Pearson Education
    3. KavehPahlavan, Prashant Krishnamurthy, “Networking Fundamentals”, Wiley Publication.
    4. Ying-Dar Lin, Ren-Hung Hwang, Fred Baker, “Computer Networks: An Open Source Approach”, McGraw Hill.