Skip to content
academia.sh

Course Intermediate

Compute and Networking in the Cloud

Published Updated

By the end of this course

Start course

01

Cloud Compute

Renting the machine: matching instance families' resource ratio to the workload and sizing, the startup time and freshness balance of the machine image and startup script, the cost and interruption risk of persistent against interruptible capacity, launch templates for a repeatable instance definition, the combined behavior of scaling policies and health checks, and cluster and task-based managed container services.

  1. 01 Virtual Machine Instances Four workload profiles are mapped to three instance families, and each match counts the idle processor, idle memory, and the size at which the bottleneck appears; the same demand is split across six different instance sizes, measuring how fixed overhead and failure exposure move in opposite directions; on a single instance, which decisions stay with you, which cannot be undone, and how many fleet hours a correction takes are worked out.
  2. 02 Machine Images Eight items done at startup are embedded into the image one at a time, and the seconds each item gains are counted alongside the staleness it costs; the embedding level is scanned from zero to eight, working out startup duration, external call count, dependency type, monthly bake load, and stale item-days; which dependency the work remaining at startup is bound to, and whether startup stops when that dependency drops, are measured.
  3. 03 Persistent and Interruptible Capacity Four job types are run on interruptible capacity, and interruption notice is scanned from zero to three hundred seconds to count the work lost at each type; over a thirty-day period, interruption count, lost job-hours, restart load, and completion rate are worked out; the job type that does not tolerate interruption at all is named, and the mix of persistent with interruptible is scanned.
  4. 04 Launch Templates Manually launched instances and template-launched ones are compared field by field at the end of a period, and drifted instances and separate configuration variants are counted; when the template is updated, instances left behind, the number of versions running at the same time, and instances a security patch has not reached are worked out; the template's own input surface and the fields that cannot be undone are named.
  5. 05 Auto Scaling Groups The scaling policy and health checks are run together in the same group, and group-size swing, the number of instances changed at once, and the rounds spent below capacity are counted; the health check threshold and the scaling cooldown duration are scanned as nine pairs, and the pair that produces constant change is named; the daily cost of constant change and the group's three items that cannot be undone are worked out.
  6. 06 Managed Container Services The same workload is counted through fifteen decision items across three execution levels — self-run cluster, managed cluster, and task-based execution — and how many decisions stay with you, how many are handed off, and what the annual maintenance load is at each level are worked out; each level's items that cannot be undone are named, and the configuration that does not travel at exit along with the handoff's payback period are measured.

02

Cloud Networking

Setting up the layer that connects machines to one another: the unchangeability of address space planning once it is set up, the separation of public and private subnets, route tables determining traffic, outbound and inbound access gateways, the rule count and false-negative difference between stateful and stateless filtering, load balancer layer choice and health checks, address stability and name integration, content delivery through edge caching, and private access between networks.

  1. 01 Virtual Private Cloud Address space planning is counted item by item: as the prefix length is swept, how many addresses stay usable, how many are reserved, how many are wasted; which period the narrow choice runs out of growth in, which neighboring blocks the wide choice collides with, and how many units the cost of this item — unchanged once it is set up — comes to.
  2. 02 Subnets The same block is split on two axes, and for every layout the usable address count, the reserved share, the unassigned remainder, and the instance count lost to a zone loss are counted; how far the public/private subnet separation cuts the externally reachable item count, and how many extra components and route tables it requires in exchange, is worked out item by item.
  3. 03 Route Tables Five route tables are modeled and the winning row for every flow is worked out by longest prefix match: how many flows a widely written rule swallows silently, how many units the same flow costs a narrowly written rule to swallow, how many instances and how many units a single row's drop affects, and how many tables the same rule repeats across.
  4. 04 Internet and Address Translation Gateways A private subnet's instances' relationship with the outside is counted in four layouts: which five jobs stall by name in the no-gateway layout, how many instances' traffic a single gateway routes through one point and in which period it crosses the connection limit, how far a gateway per zone divides the failure radius and what it raises the cost to, and how many items and how many external records a public address per instance opens.
  5. 05 Security Groups and Network Access Lists The same policy is written in two mechanisms, stateful and stateless, and run against twelve known flows: how many rules each needs, how many rows are added for return traffic, how many flows escape and how many legitimate flows get closed by mistake, what changing the rule number fixes, and which one decides when the two are used together.
  6. 06 Load Balancers What layer choice determines in a load balancer: the transport layer seeing two fields and being able to apply only one of five rules, and sending 1,024 of 1,200 requests to the wrong pool; port split bringing this down to 653 while writing two items to the client; the application layer applying all five rules, dropping key copies from six to one, and raising the termination point from six to seven; the trade-off the health check threshold sets up between detection time and false removal.
  7. 07 Persistent Address and Name Integration Measuring what happens to the address when the instance changes, across three layouts: under the ephemeral address, five items updated by hand raise detection time to 450 seconds and stale requests to 10,800; the persistent address brings this down to 200; name-based resolution sits in between; and the persistent address's own bill — the regional quota, the move operation, the idle address's monthly fee, and its being unrecoverable once released.
  8. 08 Content Delivery Network Measuring the edge rented as a service: the bill turning over at a 67% hit rate when edge egress and origin egress are priced separately, and the bill still staying high at 60% even though origin load has dropped; prefix invalidation looking free while producing 180,000 warming requests; invalidation closing the 90-second edge window while never touching the 3,600-second client window; and nine of fifteen decision items staying with the renter.
  9. 09 Private Connectivity and Peering The three ways two networks connect to each other are counted on the same workload: peering raises reachable items from one to 384 and hands off no decision, private link keeps items at one but gives four of six items to the provider; in a seven-network address plan, four of twenty-one pairs cannot be peered because of overlap, and the fix is re-addressing three networks; because peering is not transitive, the sixty-six peerings twelve networks need call for 660 routing lines.

Final exam

Compute and Networking in the Cloud — Final Exam

In preparation

This course's question bank is not complete yet. The exam opens here automatically once enough questions are added.

Start typing to search.

↑↓ ↵ Esc navigate · open · close